Programming and Algorithmics 1

Vztahy:

In order to register for the course BI-AVI.21, the student must have successfully completed the course BI-PA1.

Garant předmětu:

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.

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. Arrays, strings.

7. Structures, pointers.

8. Pointers, dynamic variables.

9. Complexity of algorithms, sorting and searching.

10. Decomposition of a problem into subproblems, recursion.

11. 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. 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. Complexity of algorithms, examples of algorithms with various complexities.

10. Recursive functions.

11. Structures.

12. Linked lists.

13. Files.

14. Reserved.

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=BI-PA1

No time-table has been prepared for this course

The course is a part of the following study plans:

• Bachelor program Informatics, unspecified branch, in Czech, 2015-2020 (compulsory course in the program)
• Bachelor branch Security and Information Technology, in Czech, 2015-2020 (compulsory course in the program)
• Bachelor branch Computer Science, in Czech, 2015-2020 (compulsory course in the program)
• Bachelor branch Computer Engineering, in Czech, 2015-2020 (compulsory course in the program)
• Bachelor branch Information Systems and Management, in Czech, 2015-2020 (compulsory course in the program)
• Bachelor branch Web and Software Engineering, spec. Software Engineering, in Czech, 2015-2020 (compulsory course in the program)
• Bachelor branch Web and Software Engineering, spec. Web Engineering, in Czech, 2015-2020 (compulsory course in the program)
• Bachelor branch Web and Software Engineering, spec. Computer Graphics, in Czech, 2015-2020 (compulsory course in the program)
• Bachelor branch Knowledge Engineering, in Czech, 2018-2020 (compulsory course in the program)