Main page | Study Branches/Specializations | Groups of Courses | All Courses | Roles                Instructions

A course is the basic teaching unit, it's design as a medium for a student to acquire comprehensive knowledge and skills indispensable in the given field. A course guarantor is responsible for the factual content of the course.
For each course, there is a department responsible for the course organisation. A person responsible for timetabling for a given department sets a time schedule of teaching and for each class, s/he assigns an instructor and/or an examiner.
Expected time consumption of the course is expressed by a course attribute extent of teaching. For example, extent = 2 +2 indicates two teaching hours of lectures and two teaching hours of seminar (lab) per week.
At the end of each semester, the course instructor has to evaluate the extent to which a student has acquired the expected knowledge and skills. The type of this evaluation is indicated by the attribute completion. So, a course can be completed by just an assessment ('pouze zápočet'), by a graded assessment ('klasifikovaný zápočet'), or by just an examination ('pouze zkouška') or by an assessment and examination ('zápočet a zkouška') .
The difficulty of a given course is evaluated by the amount of ECTS credits.
The course is in session (cf. teaching is going on) during a semester. Each course is offered either in the winter ('zimní') or summer ('letní') semester of an academic year. Exceptionally, a course might be offered in both semesters.
The subject matter of a course is described in various texts.

BIE-PA1 Programming and Algorithmics 1 Extent of teaching: 2P+2R+2C
Instructor: Completion: Z,ZK
Department: 18101 Credits: 6 Semester: Z

Annotation:
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.

Lecture syllabus:
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.

Seminar syllabus:
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.

Literature:
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.

Requirements:
None.

Information about the course and courseware are available at https://moodle-vyuka.cvut.cz/course/search.php?search=BIE-PA1

The course is also part of the following Study plans:
Study Plan Study Branch/Specialization Role Recommended semester
BIE-TI.2015_ORIGINAL Computer Science (Bachelor, in English) PP 1
BIE-BIT.2015 Computer Security and Information technology (Bachelor, in English) PP 1
BIE-TI.2015 Computer Science (Bachelor, in English) PP 1
BIE-WSI-SI.2015 Software Engineering (Bachelor, in English) PP 1


Page updated 29. 3. 2024, semester: L/2021-2, Z,L/2023-4, Z/2021-2, Z/2020-1, Z/2019-20, L/2020-1, Z,L/2022-3, L/2019-20, Send comments to the content presented here to Administrator of study plans Design and implementation: J. Novák, I. Halaška