Logo ČVUT
Loading...
CZECH TECHNICAL UNIVERSITY IN PRAGUE
STUDY PLANS
2025/2026
Faculties | School elective courses | ECTS courses catalogue | Settings | Česká verze
Welcome page > Faculty of Information Technology > Department of Theoretical Computer Science > Programming and Algorithmics 1

Programming and Algorithmics 1

The course is not on the list Without time-table
Code Completion Credits Range Language
BI-PA1.21 Z,ZK 7 2P+2R+2C Czech
Course guarantor:
Lecturer:
Tutor:
Supervisor:
Department of Theoretical Computer Science
Synopsis:

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 and trees.

Requirements:

None.

Syllabus of lectures:

1. Algorithms, Programs and Basic support of development.

2. Variables, Input and Output in C language.

3. Floating point arithmetic. Expressions in C language.

4. Flow control statements in C language.

5. Functions in C language.

6. Arrays and strings in C language.

7. Structures and Pointers in C language.

8. Pointers and dynamic memory allocation in C language.

9. Complexity, Searching and Quadratic sorting.

10. Linked structures and Trees.

11. Recursion, MergeSort, QuickSort introduction.

12. Working with files, Modular programming in C language.

13. Abstract data types (boolean, complex numbers, queue, stack).

Syllabus of tutorials:

1. Numeral systems, conversions. Bit, byte, word, double word. Development environments.

2. Integer types, variables, assignments, I/O. Displaying integers, two's complement code.

3. Real data types. Displaying floating-point numbers. Expressions.

4. Conditional statements.

5. Cycles, processing sequences.

6. Functions.

7. Arrays and strings.

8. Pointers and dynamic variables.

9. Structures.

10. Complexity of algorithms, examples of algorithms with various complexities.

11. Recursive functions.

12. Linked lists.

13. Reserved.

Study Objective:

The module provides fundamental algorithmics and procedural programming skills that are crucial for further studying.

Study materials:

1. Cormen T. H., Leiserson C. E., Rivest R. L., Stein C. : Introduction to Algorithms (3rd Edition). MIT Press, 2016. ISBN 978-0262033848.

2. Brassard G., Bratley P. : Fundamentals of Algorithmics (3rd Edition). Pearson, 2015. ISBN 978-0133350685.

3. Sedgewick R. : Algorithms (4th Edition). Addison Wesley, 2011. ISBN 978-0321573513.

4. Kochan S.G. : Programming in C (4th Edition). Addison-Wesley, 2014. ISBN 978-0321776419.

5. Virius M : Jazyky C a C++: kompletní průvodce, 2. vydání, Grada, 2011. ISBN 978-80-247-3917-5.

Note:

Module information and study materials are available on https://courses.fit.cvut.cz/BIE-PA1/

Further information:
https://courses.fit.cvut.cz/courses/BI-PA1/
No time-table has been prepared for this course
The course is a part of the following study plans:
Data valid to 2025-03-28
Copyright © Jiří Kosek, 2010–2022 | Copyright © ČVUT, 2010–2022
Hosted by Výpočetní a informační centrum ČVUT
Send your questions and comments to HelpDesk ČVUT or to spravcekos@cvut.cz
For updated information see http://bilakniha.cvut.cz/en/predmet6533506.html