Programming and Algorithmics 1
Code | Completion | Credits | Range | Language |
---|---|---|---|---|
BIE-PA1 | Z,ZK | 6 | 2P+2R+2C | English |
- Course guarantor:
- Lecturer:
- Tutor:
- Supervisor:
- Department of Theoretical Computer Science
- Synopsis:
-
Students learn to construct 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 the basics of algorithm complexity analysis. They know fundamental algorithms for searching, sorting, and manipulating with linked lists.
- Requirements:
-
None.
- Syllabus of lectures:
-
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.
- Syllabus of tutorials:
-
1. Numeral systems, conversions. Bit, byte, word, double word. Development environments.
2. Integer types, variables, assignments, I/O. Representation of integers, two?s complement code.
3. Real data types. Representation of floating-point numbers. Expressions.
4. Conditional statements.
5. Cycles, processing of sequences.
6. Functions.
7. Recursive functions.
8. Arrays and strings.
9. Pointers and dynamic variables.
10. Files.
11. Complexity of algorithms, examples of algorithms with various complexities.
12. Structures, structured files.
13. Linked lists.
- Study Objective:
-
The module provides fundamental algorithmics and procedural programming skills that are crucial for further studying.
- Study materials:
-
1. Brassard, G., Bratley, P. ''Fundamentals of Algorithmics.'' Prentice Hall, 1995. ISBN 0133350681.
2. Sedgewick, R. ''Algorithms in C, Parts 1--5.'' Addison Wesley, 2001. ISBN 0201756080.
- Note:
- Further information:
- https://moodle-vyuka.cvut.cz/course/search.php?search=BIE-PA1
- No time-table has been prepared for this course
- The course is a part of the following study plans:
-
- Bachelor branch Security and Information Technology, in English, 2015-2020 (compulsory course in the program)
- Bachelor branch Web and Software Engineering, spec. Software Engineering, in English, 2015-2020 (compulsory course in the program)
- Bachelor branch Computer Science, in English, 2015-2020 (compulsory course in the program)
- Bachelor branch Computer Science, in English, 2015-2020 original version (compulsory course in the program)