Algorithmics
| Code | Completion | Credits | Range | Language |
|---|---|---|---|---|
| A7B36ALG | Z,ZK | 6 | 2+2c | Czech |
- The course cannot be taken simultaneously with:
- Programming (A0B36PRI)
Programming 1 (A0B36PR1)
Algorithmics (Y36ALG) - The course is a substitute for:
- Algorithmics (Y36ALG)
- Lecturer:
- Ivan Jelínek (gar.), Jiří Daněček
- Tutor:
- Martin Bloch, Jiří Daněček, Ondřej David, Stanislav Flígl, Karel Frajták, Jiří Kačer, Jiří Lužnický, Radek Malinský, Martin Mudroch, Aleš Pilný, Ilya Rudomilov, Ondřej Votava
- Supervisor:
- Department of Computer Science and Engineering
- Synopsis:
-
The course is an introduction into basics of algorithmic problem solving presented in close relation with practical parts of mathematics and computer science. Its core are data, their types, expressions, statements (exemplified by those at Java programming language), basics of programming techniques and data abstractions. The course does not involve topics concerning hardware, telecommunications or other programming languages or assemblers.
- Requirements:
-
For assessment; elaboration of a semester work and getting the necessary number of points.
For exam: getting the assessment.
For more info, see http://service.felk.cvut.cz/courses/Y36ALG/
- Syllabus of lectures:
-
1. Information - its representation and processing
2. Algorithms and their properties, programming languages
3. Variables and expressions
4. Statements and control structures
5. Data objects and types
6. Simple and structured types
7. Programs and subroutines
8. Top-down program design
9. Basic programming techniques
10. Object model
11. Data abstractions
12. Efficiency of algorithms
13. Theoretical informatics
14. Information systems
- Syllabus of tutorials:
-
1. Computer laboratory usage
2. IDE, compilation and execution of simple program
3. Simple programs with branches
4. Simple programs with loops
5. Arrays I
6. Arrays II
7. Logical operations I
8. Logical operations II
9. Functions, procedures and methods I
10. Functions, procedures and methods II
11. String and text processing I
12. String and text processing II
13. Data input and validation
14. Data files
- Study Objective:
-
The course is an introduction into basics of algorithmic
problem solving presented in close relation with practical
parts of mathematics and computer science. Its core are
data, their types, expressions, statements (exemplified by
those at Java programming language), basics of programming
techniques and data abstractions.
- Study materials:
-
1. Horton, I.:Beginning Java 2, 2nd edition, Wrox Press Inc, 1999
2. Herout, P.: Učebnice jazyka Java, Kopp, Č. Budějovice, 2000, s. 350
- Note:
- Time-table for winter semester 2011/2012:
-
06:00–08:0008:00–10:0010:00–12:0012:00–14:0014:00–16:0016:00–18:0018:00–20:0020:00–22:0022:00–24:00
Mon Tue Fri Thu Fri - Time-table for summer semester 2011/2012:
- Time-table is not available yet
- The course is a part of the following study plans:
-
- Společný 1. ročník (STM-A7B) (compulsory course in the program)
- Inteligentní systémy (STM-A7B) (compulsory course in the program)
- Manažerská informatika (STM-A7B) (compulsory course in the program)
- Softwarové inženýrství (STM-A7B) (compulsory course in the program)
- Web a multimedia (STM-A7B) (compulsory course in the program)