B_Prg Programming

University of Finance and Administration
Summer 2013
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: Dagmar Medová, DiS.
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 E305, Mon 9:30–10:15 E305, P. Töpfer
Prerequisites
B_UPg Úvod do programování
Course Enrolment Limitations
The course is offered to students of any study field.
Course objectives
This is a continuation of basic programming course for first year students of Applied Informatics.
At the end of the course students should be able to:
solve bigger algorithmic problems;
use selected standard algorithms, such as sorting and searching, basic graph algorithms, dynamic data structures;
use all common constructs of programming languages, including recursion and dynamic variables;
develop and debug computer programs in an integrated devolopmental environment;
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. Minimal required participation is 75% on seminars in full-time study and 50% on tutorials in part-time study. Students with lower than required participation have to fulfill additional study duties.
Assessment methods
The course is completed with a credit and exam. Two specific studies, which consist of design, development and debugging of computer programs, written documentation included, are required to award the credit. The exam consist of a written part, where students should write a program, procedure or function, and a verbal part. Knowledge of programming language, algorithms and programming techniques according to the lecture 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.
General note: Aa1.
Teacher's information
http://ksvi.mff.cuni.cz/~topfer/vsfs/
The course is also listed under the following terms Winter 2007, Summer 2008, Winter 2008, Summer 2009, Summer 2010, Winter 2010, Summer 2011, Winter 2011, summer 2012, Winter 2012, Summer 2014, Summer 2015, Summer 2016, Summer 2017, Summer 2018, Summer 2019, Summer 2020, Summer 2021, Summer 2022, Summer 2023, Summer 2024, Summer 2025, Summer 2026.
  • Enrolment Statistics (Summer 2013, recent)
  • Permalink: https://is.vsfs.cz/course/vsfs/summer2013/B_Prg