VSFS:B_Prg Programming - Course Information

B_Prg Programming

Extent and Intensity

2/2. 7 credit(s). Type of Completion: zk (examination).

Teacher(s)

doc. RNDr. Jan Lánský, Ph.D. (seminar tutor)
Ing. Jiří Zumr (seminar tutor)

Guaranteed by

doc. RNDr. Jan Lánský, Ph.D.
Department of Computer Science and Mathematics – Departments – University of Finance and Administration
Contact Person: Ivana Plačková

Timetable of Seminar Groups

B_Prg/cAPH: Thu 10:30–11:14 E227, Thu 11:15–12:00 E227, except Thu 4. 4. ; and Thu 4. 4. 10:30–12:00 E122, J. Lánský
B_Prg/pAPH: Thu 8:45–9:29 E227, Thu 9:30–10:15 E227, except Thu 4. 4. ; and Thu 4. 4. 8:45–10:15 E124, J. Lánský
B_Prg/vAPH: Sat 16. 2. 9:45–11:15 E303PC, 11:30–13:00 E303PC, Sat 2. 3. 9:45–11:15 E303PC, 11:30–13:00 E303PC, Fri 15. 3. 17:30–19:00 E303PC, 19:15–20:45 E303PC, Sat 13. 4. 9:45–11:15 E303PC, J. Zumr

Prerequisites

B_UPg Introduction to Programming
The requirement for the completion of this course is completion of the course B_UPg.

Course Enrolment Limitations

The course is also offered to the students of the fields other than those the course is directly associated with.

fields of study / plans the course is directly associated with

• Applied Informatics (programme VSFS, B-INF) (2)

Course objectives

This is a continuation of basic programming course for first year students of Applied Informatics.

Learning outcomes

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

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. A specific study and one or two 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

• B_PJC Programming in C

Further comments (probably available only in Czech)

Information on completion of the course: povinná seminární práce v rozsahu 5 - 8 stran
The course can also be completed outside the examination period.

Teacher's information

http://ksvi.mff.cuni.cz/~topfer/vsfs/

• Enrolment Statistics (Summer 2019, recent)
  
• Permalink: https://is.vsfs.cz/course/vsfs/summer2019/B_Prg