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.21 Programming and Algorithmics 1 Extent of teaching: 2P+2R+2C Instructor: Trávníček J. Completion: Z,ZK Department: 18101 Credits: 7 Semester: Z Annotation:
Students learn to construct algorithms for solving basic problems and write them in the C language. They master data types (simple, pointers, structured), expressions, statements, and functions presented in C language. They understand the principle of recursion and basics of algorithm complexity analysis. They know fundamental algorithms for searching, sorting, and manipulating linked lists and trees.
Lecture syllabus:
1. Algorithms, programs and basic support of SW development. 2. Variables. Input and output in the C language. 3. Floating-point arithmetic. Expressions in the C language. 4. Flow control statements in the C language. 5. Functions in the C language. 6. Arrays and strings in the C language. 7. Structures and pointers in the C language. 8. Pointers and dynamic memory allocation in the C language. 9. Algorithm complexity. Searching and quadratic sorting algorithms. 10. Linked structures and trees in the C language. 11. Recursive algorithms, MergeSort, QuickSort introduction. 12. Working with files. Modular programming in the C language. 13. Abstract data types boolean, complex numbers, queue, stack. Seminar syllabus:
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. Literature:
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. Requirements:
None.
Informace o předmětu a výukové materiály naleznete na https://courses.fit.cvut.cz/BIE-PA1/ The course is also part of the following Study plans:
Study Plan Study Branch/Specialization Role Recommended semester BIE-PI.21 Computer Engineering 2021 PP 1 BIE-PV.21 Computer Systems and Virtualization 2021 PP 1 BIE-PS.21 Computer Networks and Internet 2021 PP 1 BIE-TI.21 Computer Science 2021 PP 1 BIE-SI.21 Software Engineering 2021 PP 1 BIE-IB.21 Information Security 2021 (Bachelor in English) PP 1
Page updated 18. 4. 2024, semester: L/2020-1, L/2023-4, L/2019-20, Z/2021-2, L/2022-3, Z/2023-4, Z/2019-20, Z/2022-3, L/2021-2, Z/2024-5, Z/2020-1, Send comments to the content presented here to Administrator of study plans Design and implementation: J. Novák, I. Halaška