SubjectsSubjects(version: 950)
Course, academic year 2019/2020
Programming and Algorithmics 1 - N500002
Title: Programování a algoritmizace 1
Guaranteed by: CTU in Prague, Faculty of Information Technology (500)
Faculty: University of Chemistry and Technology, Prague
Actual: from 2017 to 2019
Semester: winter
Points: winter s.:6
E-Credits: winter s.:6
Examination process: winter s.:
Hours per week, examination: winter s.:2/4, C+Ex [HT]
Capacity: unknown / unknown (unknown)
Min. number of students: unlimited
Language: Czech
Teaching methods: full-time
Teaching methods: full-time
For type:  
Guarantor: Vagner Ladislav Ing. Ph.D.
Is interchangeable with: B500001, B50001
Examination dates   Schedule   
Annotation -
Last update: Jirát Jiří Ing. Ph.D. (10.01.2014)
Students gain the ability to formulate algorithms for solving basic problems and write them in the C language. They understand data types (simple, structured, pointers), expressions, statements, functions, concept of recursion. They learn to analyse simple cases of algorithm complexity. They know fundamental algorithms for searching, sorting, and manipulating with linked lists.
Aim of the course -
Last update: Jirát Jiří Ing. Ph.D. (31.01.2014)

Students will be able to:

Understand fundamental algorithmics.

Use procedural programming skills that are crucial for further studying.

Literature -
Last update: Jirát Jiří Ing. Ph.D. (10.01.2014)

R:Brassard, G., Bratley, P. ''Fundamentals of Algorithmics.'' Prentice Hall, 1995. ISBN 0133350681.

R:Sedgewick, R. ''Algorithms in C, Parts 1--5.'' Addison Wesley, 2001. ISBN 0201756080.

Learning resources -
Last update: Jirát Jiří Ing. Ph.D. (10.01.2014)

(login necessary)

Syllabus -
Last update: Jirát Jiří Ing. Ph.D. (10.01.2014)

1. Algorithm, program, programming languages. Development environments.

2. Variables, assignment statement, input and output for integer data types.

3. Data types for real numbers. Expressions.

4. Control structures, branching, cycles.

5. Functions, input/output parameters.

6. Decomposition of a problem into subproblems, recursion.

7. Arrays, strings.

8. Pointers, dynamic variables.

9. Files.

10. Complexity of algorithms, sorting and searching.

11. Structures, structured files.

12. Linked lists.

13. Modular programming, other features of C.

Entry requirements
Last update: Jirát Jiří Ing. Ph.D. (10.01.2014)


Registration requirements - Czech
Last update: Jirát Jiří Ing. Ph.D. (10.01.2014)


Teaching methods
Activity Credits Hours
Účast na přednáškách 1 28
Příprava na přednášky, semináře, laboratoře, exkurzi nebo praxi 0.5 14
Práce na individuálním projektu 2 56
Příprava na zkoušku a její absolvování 0.5 14
Účast na seminářích 2 56
6 / 6 168 / 168