CZECH TECHNICAL UNIVERSITY IN PRAGUE
STUDY PLANS
2024/2025

# Programming and Algorithmics 1

Code Completion Credits Range Language
BI-PA1.21 Z,ZK 7 2P+2R+2C Czech
Garant předmětu:
Jan Trávníček
Lecturer:
Miroslav Balík, Jan Trávníček, Ladislav Vagner, Josef Vogel
Tutor:
Miroslav Balík, David Bernhauer, Daniel Breiner, Michal Dvořák, Filip Gregor, Albert Havliček, Radek Hušek, Jiří Kašpar, Tomáš Krupička, Jaroslav Kříž, Jan Matoušek, Tomáš Pecka, Sebastian Prokop, Matyáš Rak, Róbert Selvek, Ivan Šimeček, Otto Šleger, Milan Špinka, Petr Šťastný, Ondřej Štorc, Jan Trávníček, Ladislav Vagner, Josef Vogel, Vladimír Votava, Ondřej Wrzecionko
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.

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.

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:
Further information:
https://courses.fit.cvut.cz/courses/BI-PA1/
Time-table for winter semester 2024/2025:
Time-table is not available yet
Time-table for summer semester 2024/2025:
Time-table is not available yet
The course is a part of the following study plans:
Data valid to 2024-06-16
Aktualizace výše uvedených informací naleznete na adrese https://bilakniha.cvut.cz/en/predmet6533506.html