VSFS:B_Prg Programming - Course Information
B_Prg Programming
University of Finance and Administrationsummer 2012
- Extent and Intensity
- 2/2. 7 credit(s). Type of Completion: zk (examination).
- Teacher(s)
- doc. RNDr. Jan Lánský, Ph.D. (seminar tutor)
doc. RNDr. Pavel Töpfer, CSc. (seminar tutor) - Guaranteed by
- doc. RNDr. Pavel Töpfer, CSc.
Department of Computer Science and Mathematics – Departments – University of Finance and Administration
Contact Person: Ivana Plačková - Timetable of Seminar Groups
- B_Prg/cAPH: Mon 10:30–11:14 E303PC, Mon 11:15–12:00 E303PC, P. Töpfer
B_Prg/pAPH: Mon 8:45–9:29 E228, Mon 9:30–10:15 E228, P. Töpfer
B_Prg/vAPH: Fri 17. 2. 15:30–17:00 E303PC, 17:15–18:45 E303PC, Fri 2. 3. 12:00–13:30 E303PC, 13:45–15:15 E303PC, 15:30–17:00 E303PC, Fri 20. 4. 13:45–15:15 E303PC, 15:30–17:00 E303PC, J. Lánský - Prerequisites
- B_UPG Úvod do programování
- Course Enrolment Limitations
- The course is offered to students of any study field.
- Course objectives
- Basic programming course for first year students of Applied Informatics.
The course covers advanced constructs of programming languages (recursion, dynamic allocation of memory); algorithms and programming techniques (algorithm efficiency, sorting and searching, basic graph algorithms, dynamic data structures); practice in development and debugging of computer programs. - Syllabus
- 1. Modular programming, units. Unit CRT.
- 2. Dynamic allocation, pointer. Dynamic data structures.
- 3. Linear linked list - operations, types of linear linked lists, examples.
- 4. Recursion - principle, examples, backtracking.
- 5. Depth-first search and breadth-first search. Backtracking speed-up - pruning, heuristics.
- 6. Divide and conquer method - principle, examples. Quicksort algorithm.
- 7. Binary tree. Arithmetic expression notations, evaluation, conversions.
- 8. Serching tree. Balanced tree. Multiway tree.
- 9. Storage and search of data - summary. Hash tables. Sorting - algorithms, efficiency. K-th least element.
- 10. Graphs - graph representation, basic graph algorithms.
- 11. Implementation of selected graph algorithms.
- 12. Problem solving examples.
- Literature
- required literature
- P.Töpfer: Algoritmy a programovací techniky, Prometheus Praha 1995, 2. vyd. 2007
- recommended literature
- P.Satrapa: Pascal pro zelenáče, Neocortex Praha 2001
- P.Töpfer, D.Töpferová: Programování - Sbírka úloh, Fortuna 1998
- not specified
- Povinná literatura
- Doporučená litreratura
- Další zdroje
- www.vsfs.cz/knihovna
- www.knihovna.vsfs.cz/info/volne_eiz.html
- IS VŠFS → osobní administrativa → ProQuest
- Teaching methods
- Lectures and seminars in full-time study; tutorials in part-time study; compulsory seminar participation is 75% in full-time study, compulsory tutorial participation is 50% in part-time study.
- Assessment methods
- The course is completed with a credit and exam. Two specific studies (design, development and debugging of computer programs, written documentation included) are required to award the credit. The exam consist of a practical part (write a program, procedure or function) and a theoretical part (verbal exam). Knowledge of programming language, algorithms and programming techniques is required.
- Language of instruction
- Czech
- Follow-Up Courses
- Further comments (probably available only in Czech)
- The course can also be completed outside the examination period.
Information on the extent and intensity of the course: 14 hodin KS/semestr. - Teacher's information
- http://ksvi.mff.cuni.cz/~topfer/vsfs/
- Enrolment Statistics (summer 2012, recent)
- Permalink: https://is.vsfs.cz/course/vsfs/summer2012/B_Prg