Course Information

B_Prg Programming

Extent and Intensity

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

Teacher(s)

Ing. Renata Janošcová, Ph.D. (seminar tutor)
doc. RNDr. Jan Lánský, Ph.D. (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: Tue 14:00–14:44 E306, Tue 14:45–15:30 E306, J. Lánský
B_Prg/pAPH: Tue 12:15–12:59 E306, Tue 13:00–13:45 E306, J. Lánský
B_Prg/vAPH: Fri 9. 2. 14:00–15:30 E303PC, 15:45–17:15 E303PC, Sat 24. 2. 9:45–11:15 E303PC, 11:30–13:00 E303PC, Sat 9. 3. 9:45–11:15 E303PC, 11:30–13:00 E303PC, Fri 22. 3. 14:00–15:30 E303PC, 15:45–17:15 E303PC, R. Janošcová

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 offered to students of any study field.

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. Dynamic memory allocation, singly linked list
• 2. Implementation of stack and queue using lists, doubly linked list, cyclic list
• 3. Trees, Binary Search Tree, Balanced Tree, AVL Tree
• 4. Binary tree as a dictionary, tree passage in depth and width, evaluation of arithmetic expression
• 5. MergeSort and QuickSort
• 6. Heapsort and external classification
• 7. B-trees and trie
• 8. Hashing, Blockchain (Bitcoin technology)
• 9. Graphs, graph continuity, existence of a circle
• 10. Skeleton of graph, bipartite graph
• 11. Finding the shortest path in the graph, wave, Dijkstra
• 12. Graphical user interface

Literature

required literature
• Wróblewski, P.: Algoritmy, Brno: Computer Press, 2015. ISBN:978-80-251-4126-7
• P.Töpfer: Algoritmy a programovací techniky, Prometheus Praha 1995, 2. vyd. 2007

recommended literature
• 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. The condition for granting the credit is the elaboration of the tasks assigned to the exercises. The relevant teacher will specify the conditions. 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.
Information on the extent and intensity of the course: 16 hodin KS/semestr.

Teacher's information

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

B_Prg Programming

Extent and Intensity

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

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á

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 offered to students of any study field.

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. Dynamic memory allocation, singly linked list
• 2. Implementation of stack and queue using lists, doubly linked list, cyclic list
• 3. Trees, Binary Search Tree, Balanced Tree, AVL Tree
• 4. Binary tree as a dictionary, tree passage in depth and width, evaluation of arithmetic expression
• 5. MergeSort and QuickSort
• 6. Heapsort and external classification
• 7. B-trees and trie
• 8. Hashing, Blockchain (Bitcoin technology)
• 9. Graphs, graph continuity, existence of a circle
• 10. Skeleton of graph, bipartite graph
• 11. Finding the shortest path in the graph, wave, Dijkstra
• 12. Graphical user interface

Literature

required literature
• Wróblewski, P.: Algoritmy, Brno: Computer Press, 2015. ISBN:978-80-251-4126-7
• P.Töpfer: Algoritmy a programovací techniky, Prometheus Praha 1995, 2. vyd. 2007

recommended literature
• 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. The condition for granting the credit is the elaboration of the tasks assigned to the exercises. The relevant teacher will specify the conditions. 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)

The course can also be completed outside the examination period.
Information on the extent and intensity of the course: 16 hodin KS/semestr.

Teacher's information

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

B_Prg Programming

Extent and Intensity

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

Teacher(s)

Ing. Renata Janošcová, Ph.D. (seminar tutor)
doc. RNDr. Jan Lánský, Ph.D. (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: Tue 10:30–11:14 E306, Tue 11:15–12:00 E306, J. Lánský
B_Prg/pAPH: Tue 8:45–9:29 E306, Tue 9:30–10:15 E306, J. Lánský
B_Prg/vAPH: Fri 10. 2. 14:00–15:30 E230, 15:45–17:15 E230, Fri 24. 2. 14:00–15:30 E230, 15:45–17:15 E230, Fri 10. 3. 14:00–15:30 E227, 15:45–17:15 E227, Fri 14. 4. 14:00–15:30 E230, 15:45–17:15 E230, R. Janošcová

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 offered to students of any study field.

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. Dynamic memory allocation, singly linked list 2. Implementation of stack and queue using lists, doubly linked list, cyclic list 3. Trees, Binary Search Tree, Balanced Tree, AVL Tree 4. Binary tree as a dictionary, tree passage in depth and width, evaluation of arithmetic expression 5. MergeSort and QuickSort 6. Heapsort and external classification 7. B-trees and trie 8. Hashing, Blockchain (Bitcoin technology) 9. Graphs, graph continuity, existence of a circle 10. Skeleton of graph, bipartite graph 11. Finding the shortest path in the graph, wave, Dijkstra 12. Graphical user interface

Literature

required literature
• Wróblewski, P.: Algoritmy, Brno: Computer Press, 2015. ISBN:978-80-251-4126-7
• P.Töpfer: Algoritmy a programovací techniky, Prometheus Praha 1995, 2. vyd. 2007

recommended literature
• 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. The condition for granting the credit is the elaboration of the tasks assigned to the exercises. 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.
Information on the extent and intensity of the course: 16 hodin KS/semestr.

Teacher's information

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

B_Prg Programming

Extent and Intensity

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

Teacher(s)

Ing. Renata Janošcová, Ph.D. (seminar tutor)
doc. RNDr. Jan Lánský, Ph.D. (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 S11, Thu 11:15–12:00 S11, except Thu 17. 2. ; and Thu 3. 3. 12:15–13:45 S11, J. Lánský
B_Prg/pAPH: Thu 8:45–9:29 S11, Thu 9:30–10:15 S11, except Thu 17. 2. ; and Thu 24. 2. 12:15–13:45 S11, J. Lánský
B_Prg/vAPH: Sat 26. 2. 9:45–11:15 E305, 11:30–13:00 E305, Fri 25. 3. 17:30–19:00 S35, 19:15–20:45 S35, Fri 8. 4. 14:00–15:30 S35, 15:45–17:15 S35, Fri 29. 4. 17:30–19:00 S35, 19:15–20:45 S35, R. Janošcová

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 offered to students of any study field.

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. Dynamic memory allocation, singly linked list 2. Implementation of stack and queue using lists, doubly linked list, cyclic list 3. Trees, Binary Search Tree, Balanced Tree, AVL Tree 4. Binary tree as a dictionary, tree passage in depth and width, evaluation of arithmetic expression 5. MergeSort and QuickSort 6. Heapsort and external classification 7. B-trees and trie 8. Hashing, Blockchain (Bitcoin technology) 9. Graphs, graph continuity, existence of a circle 10. Skeleton of graph, bipartite graph 11. Finding the shortest path in the graph, wave, Dijkstra 12. Graphical user interface

Literature

required literature
• Wróblewski, P.: Algoritmy, Brno: Computer Press, 2015. ISBN:978-80-251-4126-7
• P.Töpfer: Algoritmy a programovací techniky, Prometheus Praha 1995, 2. vyd. 2007

recommended literature
• 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. The condition for granting the credit is the elaboration of the tasks assigned to the exercises. 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.
Information on the extent and intensity of the course: 16 hodin KS/semestr.

Teacher's information

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

B_Prg Programming

Extent and Intensity

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

Teacher(s)

Ing. Renata Janošcová, Ph.D. (seminar tutor)
doc. RNDr. Jan Lánský, Ph.D. (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: Tue 10:30–11:14 E228, Tue 11:15–12:00 E228, J. Lánský
B_Prg/pAPH: Tue 8:45–9:29 E228, Tue 9:30–10:15 E228, J. Lánský
B_Prg/vAPH: Sat 13. 2. 9:45–11:15 E228, 11:30–13:00 E228, Sat 13. 3. 9:45–11:15 E228, 11:30–13:00 E228, Sat 27. 3. 9:45–11:15 E228, 11:30–13:00 E228, Sat 24. 4. 9:45–11:15 E228, 11:30–13:00 E228, R. Janošcová

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 offered to students of any study field.

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. Dynamic memory allocation, singly linked list 2. Implementation of stack and queue using lists, doubly linked list, cyclic list 3. Trees, Binary Search Tree, Balanced Tree, AVL Tree 4. Binary tree as a dictionary, tree passage in depth and width, evaluation of arithmetic expression 5. MergeSort and QuickSort 6. Heapsort and external classification 7. B-trees and trie 8. Hashing, Blockchain (Bitcoin technology) 9. Graphs, graph continuity, existence of a circle 10. Skeleton of graph, bipartite graph 11. Finding the shortest path in the graph, wave, Dijkstra 12. Graphical user interface

Literature

required literature
• Wróblewski, P.: Algoritmy, Brno: Computer Press, 2015. ISBN:978-80-251-4126-7
• P.Töpfer: Algoritmy a programovací techniky, Prometheus Praha 1995, 2. vyd. 2007

recommended literature
• 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. The condition for granting the credit is the elaboration of the tasks assigned to the exercises. 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.
Information on the extent and intensity of the course: 16 hodin KS/semestr.

Teacher's information

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

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 17:30–18:14 E227, Thu 18:15–19:00 E227, J. Lánský
B_Prg/pAPH: Thu 15:45–16:29 E227, Thu 16:30–17:15 E227, J. Lánský
B_Prg/vAPH: Sat 29. 2. 14:00–15:30 E228, 15:45–17:15 E228, Fri 27. 3. 17:30–19:00 E128, 19:15–20:45 E128, Fri 17. 4. 17:30–19:00 E228, 19:15–20:45 E228, Fri 24. 4. 17:30–19:00 E228, 19:15–20:45 E228, 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 offered to students of any study field.

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. Dynamic memory allocation, singly linked list 2. Implementation of stack and queue using lists, doubly linked list, cyclic list 3. Trees, Binary Search Tree, Balanced Tree, AVL Tree 4. Binary tree as a dictionary, tree passage in depth and width, evaluation of arithmetic expression 5. MergeSort and QuickSort 6. Heapsort and external classification 7. B-trees and trie 8. Hashing, Blockchain (Bitcoin technology) 9. Graphs, graph continuity, existence of a circle 10. Skeleton of graph, bipartite graph 11. Finding the shortest path in the graph, wave, Dijkstra 12. Graphical user interface

Literature

required literature
• Wróblewski, P.: Algoritmy, Brno: Computer Press, 2015. ISBN:978-80-251-4126-7
• P.Töpfer: Algoritmy a programovací techniky, Prometheus Praha 1995, 2. vyd. 2007

recommended literature
• 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.
Information on the extent and intensity of the course: 16 hodin KS/semestr.

Teacher's information

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

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.
Information on the extent and intensity of the course: 14 hodin KS/semestr.

Teacher's information

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

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: Wed 12:15–12:59 E303PC, Wed 13:00–13:45 E303PC, J. Lánský
B_Prg/pAPH: Wed 10:30–11:14 E303PC, Wed 11:15–12:00 E303PC, J. Lánský
B_Prg/vAPH: Sat 17. 2. 14:00–15:30 E307, 15:45–17:15 E307, Sat 3. 3. 14:00–15:30 E307, 15:45–17:15 E307, Sat 17. 3. 14:00–15:30 E307, 15:45–17:15 E307, Fri 6. 4. 14:00–15:30 E307, 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. 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.
Information on the extent and intensity of the course: 14 hodin KS/semestr.

Teacher's information

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

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)

Guaranteed by

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

Timetable of Seminar Groups

B_Prg/cAPH: Thu 12:15–12:59 E303PC, Thu 13:00–13:45 E303PC, J. Lánský
B_Prg/pAPH: Thu 10:30–11:14 E303PC, Thu 11:15–12:00 E303PC, J. Lánský
B_Prg/vAPH: Fri 3. 3. 14:00–15:30 E126, Fri 17. 3. 17:30–19:00 E126, 19:15–20:45 E126, Fri 31. 3. 14:00–15:30 E126, 15:45–17:15 E126, Fri 21. 4. 14:00–15:30 E129, 15:45–17:15 E129, J. Lánský

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. 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.
Information on the extent and intensity of the course: 14 hodin KS/semestr.

Teacher's information

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

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)

Guaranteed by

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

Timetable of Seminar Groups

B_Prg/cAPH: Wed 14:00–14:44 E303PC, Wed 14:45–15:30 E303PC, J. Lánský
B_Prg/pAPH: Wed 12:15–12:59 E303PC, Wed 13:00–13:45 E303PC, J. Lánský

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. 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.
Information on the extent and intensity of the course: 14 hodin KS/semestr.

Teacher's information

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

B_Prg Programming

Extent and Intensity

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

Teacher(s)

doc. RNDr. Pavel Töpfer, CSc. (lecturer)
doc. RNDr. Jan Lánský, Ph.D. (lecturer)

Guaranteed by

doc. RNDr. Pavel Töpfer, CSc.
Department of Computer Science and Mathematics – Departments – University of Finance and Administration
Contact Person: Tamara Urbánková

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 E303PC, Mon 9:30–10:15 E303PC, P. Töpfer
B_Prg/vAPH: Fri 13. 2. 12:00–13:30 DELL ROOM E302PC, 13:45–15:15 DELL ROOM E302PC, Fri 27. 2. 12:00–13:30 E304, 13:45–15:15 DELL ROOM E302PC, Fri 10. 4. 13:45–15:15 DELL ROOM E302PC, 15:30–17:00 DELL ROOM E302PC, 17:15–18:45 DELL ROOM E302PC, J. Lánský

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. 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.
Information on the extent and intensity of the course: 14 hodin KS/semestr.

Teacher's information

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

B_Prg Programming

Extent and Intensity

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

Teacher(s)

doc. RNDr. Pavel Töpfer, CSc. (lecturer)
doc. RNDr. Jan Lánský, Ph.D. (lecturer)

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 E227, Mon 9:30–10:15 E227, P. Töpfer
B_Prg/vAPH: Fri 7. 3. 12:00–13:30 E303PC, 13:45–15:15 E303PC, 15:30–17:00 E303PC, Fri 4. 4. 13:45–15:15 E303PC, 15:30–17:00 E303PC, Fri 2. 5. 12:00–13:30 E303PC, 13:45–15:15 E303PC, J. Lánský

Prerequisites

B_UPg Úvod do programování

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

• B_OOP Object-oriented Programming
• B_PJC Programming in C

Further comments (probably available only in Czech)

The course can also be completed outside the examination period.
General note: Aa1.
Information on the extent and intensity of the course: 14 hodin KS/semestr.

Teacher's information

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

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)
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

• B_OOP Object-oriented Programming
• B_PJC Programming in C

Further comments (probably available only in Czech)

The course can also be completed outside the examination period.
General note: Aa1.
Information on the extent and intensity of the course: 14 hodin KS/semestr.

Teacher's information

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

B_Prg Programming

Extent and Intensity

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

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.

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 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

• B_OOP Object-oriented Programming
• B_PJC Programming in C

Further comments (probably available only in Czech)

Information on completion of the course: ISP
The course can also be completed outside the examination period.
General note: 0.
Information on the extent and intensity of the course: 14 hodin KS/semestr.

Teacher's information

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

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)
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

• B_OOP Object-oriented Programming
• B_PJC Programming in C

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/

B_Prg Programming

Extent and Intensity

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

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á

Course Enrolment Limitations

The course is offered to students of any study field.

Language of instruction

Czech

Further comments (probably available only in Czech)

Information on completion of the course: ISP
The course can also be completed outside the examination period.
General note: 0.
Information on the extent and intensity of the course: 14 hodin/semestr.

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)
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 E304, Mon 9:30–10:15 E304, P. Töpfer
B_Prg/vAPH: Fri 18. 2. 15:30–17:00 DELL ROOM E302PC, 17:15–18:45 DELL ROOM E302PC, Fri 4. 3. 17:15–18:45 DELL ROOM E302PC, Fri 1. 4. 17:15–18:45 DELL ROOM E302PC, Fri 6. 5. 15:30–17:00 DELL ROOM E302PC, 17:15–18:45 DELL ROOM E302PC, Sat 7. 5. 11:30–13:00 DELL ROOM E302PC, J. Lánský

Prerequisites (in Czech)

Výuka bezprostředně navazuje na předmět Úvod do programování ze zimního semestru. Předpokládá se znalost učiva z předmětu Úvod do programování a praktická zručnost při ladění jednoduchých programů v Pascalu na počítači.

Course Enrolment Limitations

The course is offered to students of any study field.

Course objectives (in Czech)

Pokračování základního kurzu programování ze zimního semestru pro posluchače 1. ročníku bakalářského studia oboru Aplikovaná informatika. Cílem předmětu je rozšířit znalosti prostředků programovacího jazyka (rekurze, dynamicky alokované proměnné), prohloubit znalosti základních algoritmů a programovacích technik (efektivita algoritmů, třídicí algoritmy, grafové algoritmy, dynamické datové struktury) a upevnit praktickou zručnost při návrhu a tvorbě programů. Cíl předmětu platí i pro kombinované studium.

Syllabus (in Czech)

• Tato osnova je určena pro prezenční studium, průběh výuky pro kombinované studium je uveden ve studijních materiálech formou metodického listu (ML).
• Obsah přednášek:
• 1. Modulární programování, unity. Unit CRT.
• 2. Dynamicky alokované proměnné. Dynamické datové struktury.
• 3. Lineární spojové seznamy - operace, druhy seznamů, příklady použití.
• 4. Rekurze - princip, příklady, backtracking.
• 5. Prohledávání do hloubky a do šířky. Zrychlení backtrackingu - ořezávání, heuristiky.
• 6. Metoda rozděl a panuj - princip, příklady. Algoritmus quicksort.
• 7. Binární stromy - reprezentace, průchod. Notace aritmetických výrazů, vyhodnocování, převody.
• 8. Vyhledávací stromy. Vyvážené stromy. Obecné stromy.
• 9. Metody ukládání a vyhledávání dat - přehled. Hešování. Třídění - algoritmy, složitost. K-tý nejmenší prvek.
• 10. Grafy - reprezentace grafu v programu, základní grafové algoritmy.
• 11. Implementace vybraných grafových algoritmů.
• 12. Ukázky řešení úloh.

Literature

• Povinná literatura
• P.Töpfer: Algoritmy a programovací techniky, Prometheus Praha 1995, 2. vyd. 2007
• Doporučená litreratura
• P.Satrapa: Pascal pro zelenáče, Neocortex Praha 2001
• P.Töpfer, D.Töpferová: Programování - Sbírka úloh, Fortuna 1998
• Další zdroje
• www.vsfs.cz/knihovna
• www.knihovna.vsfs.cz/info/volne_eiz.html
• IS VŠFS → osobní administrativa → ProQuest

Assessment methods (in Czech)

Typ výuky: Výuka probíhá formou přednášek a cvičení v prezenčním studiu a řízených skupinových konzultací v kombinovaném studiu.
Rozsah povinné účasti ve výuce: Minimální povinná účast na cvičeních v prezenčním studiu je 75%, na řízených skupinových konzultacích v kombinovaném studiu 50%. Studentům, kteří nesplní povinný rozsah účasti, budou v průběhu semestru nebo po jeho skončení zadány dodatečné studijní povinnosti.
Způsob zakončení předmětu: Předmět je zakončen zápočtem a zkouškou.
Zápočet osvědčuje splnění stanovených studijních povinností. K získání zápočtu se požaduje:
1. samostatné vypracování dvou zápočtových programů ve stanovených termínech (odevzdává se zdrojový text odladěného programu a dokumentace k programu),
2. pravidelná aktivní účast na výuce - je vyžadována minimálně 75% účast na cvičeních (více absencí lze nahradit vypracováním domácích úkolů).
Zkouška se skládá z písemné a ústní části. V písemné části je úkolem napsat proceduru, funkci nebo jednoduchý program řešící zadaný problém. V ústní části zkoušky se požadují znalosti programovacího jazyka, algoritmů a programovacích technik v rozsahu přednášky (viz sylabus uvedený výše).

Language of instruction

Czech

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/semestr.

Teacher's information

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

B_Prg Programming

Extent and Intensity

2/2/0. 6 credit(s). Recommended Type of Completion: zk (examination). Other types of completion: z (credit).

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á

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)

Language of instruction

Czech

Further comments (probably available only in Czech)

Information on completion of the course: ISP
The course can also be completed outside the examination period.
Information on the extent and intensity of the course: 14hodin/semestr.

B_Prg Programming

Extent and Intensity

2/2/0. 6 credit(s). Recommended Type of Completion: zk (examination). Other types of completion: z (credit).

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: Lenka Bažantová

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 E227, Mon 9:30–10:15 E227, P. Töpfer
B_Prg/vA21PH: Fri 12. 2. 13:45–15:15 DELL ROOM E302PC, Fri 26. 2. 12:00–13:30 DELL ROOM E302PC, 13:45–15:15 DELL ROOM E302PC, Fri 12. 3. 12:00–13:30 DELL ROOM E302PC, 13:45–15:15 DELL ROOM E302PC, Fri 26. 3. 15:30–17:00 DELL ROOM E302PC, 17:15–18:45 DELL ROOM E302PC, J. Lánský
B_Prg/vA22PH: Fri 12. 2. 15:30–17:00 DELL ROOM E302PC, Fri 26. 2. 15:30–17:00 DELL ROOM E302PC, 17:15–18:45 DELL ROOM E302PC, Fri 12. 3. 15:30–17:00 DELL ROOM E302PC, 17:15–18:45 DELL ROOM E302PC, Fri 16. 4. 15:30–17:00 DELL ROOM E302PC, 17:15–18:45 DELL ROOM E302PC, J. Lánský

Prerequisites (in Czech)

Výuka bezprostředně navazuje na předmět Úvod do programování ze zimního semestru. Předpokládá se znalost učiva z předmětu Úvod do programování a praktická zručnost při ladění jednoduchých programů v Pascalu na počítači.

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 (in Czech)

Pokračování základního kurzu programování ze zimního semestru pro posluchače 1. ročníku bakalářského studia oboru Aplikovaná informatika. Cílem předmětu je rozšířit znalosti prostředků programovacího jazyka (rekurze, dynamicky alokované proměnné), prohloubit znalosti základních algoritmů a programovacích technik (efektivita algoritmů, třídicí algoritmy, grafové algoritmy, dynamické datové struktury) a upevnit praktickou zručnost při návrhu a tvorbě programů. Cíl předmětu platí i pro kombinované studium.

Syllabus (in Czech)

• Tato osnova je určena pro prezenční studium, průběh výuky pro kombinované studium je uveden ve studijních materiálech formou metodického listu (ML).
• Obsah přednášek:
• 1. Modulární programování, unity. Unit CRT.
• 2. Halda, operace na haldě, implementace haldy, heapsort.
• 3. Rekurze - princip, příklady, backtracking.
• 4. Metoda rozděl a panuj - princip, příklady. Algoritmus quicksort.
• 5. Prohledávání do hloubky a do šířky. Zrychlení backtrackingu - ořezávání, heuristiky.
• 6. Dynamicky alokované proměnné. Dynamické datové struktury.
• 7. Lineární spojové seznamy - operace, druhy seznamů, příklady použití.
• 8. Binární stromy - reprezentace, průchod. Notace aritmetických výrazů, vyhodnocování, převody.
• 9. Vyhledávací stromy. Vyvážené stromy. Obecné stromy.
• 10. Metody ukládání a vyhledávání dat - přehled. Hešování. Třídění - algoritmy, složitost. K-tý nejmenší prvek.
• 11. Grafy - reprezentace grafu v programu, implementace vybraných grafových algoritmů.
• 12. Ukázky řešení úloh.

Literature

• Povinná literatura
• P.Töpfer: Algoritmy a programovací techniky, Prometheus Praha 1995, 2. vyd. 2007
• Doporučená litreratura
• P.Satrapa: Pascal pro zelenáče, Neocortex Praha 2001
• P.Töpfer, D.Töpferová: Programování - Sbírka úloh, Fortuna 1998
• Další zdroje
• www.vsfs.cz/knihovna
• www.knihovna.vsfs.cz/info/volne_eiz.html
• IS VŠFS → osobní administrativa → ProQuest

Assessment methods (in Czech)

Typ výuky: Výuka probíhá formou přednášek a cvičení v prezenčním studiu a řízených skupinových konzultací v kombinovaném studiu.
Rozsah povinné účasti ve výuce: Minimální povinná účast na cvičeních v prezenčním studiu je 80%, na řízených skupinových konzultacích v kombinovaném studiu 50%. Studentům, kteří nesplní povinný rozsah účasti, budou v průběhu semestru nebo po jeho skončení zadány dodatečné studijní povinnosti.
Způsob zakončení předmětu: Předmět je zakončen zápočtem a zkouškou.
Zápočet osvědčuje splnění stanovených studijních povinností. K získání zápočtu se požaduje:
1. samostatné vypracování dvou zápočtových programů ve stanovených termínech (odevzdává se zdrojový text odladěného programu a dokumentace k programu),
2. pravidelná aktivní účast na výuce - je vyžadována minimálně 80% účast na cvičeních (více absencí lze nahradit vypracováním domácích úkolů).
Zkouška se skládá z písemné a ústní části. V písemné části je úkolem napsat proceduru, funkci nebo jednoduchý program řešící zadaný problém. V ústní části zkoušky se požadují znalosti programovacího jazyka, algoritmů a programovacích technik v rozsahu přednášky (viz sylabus uvedený výše).

Language of instruction

Czech

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: 14hodin/semestr.

Teacher's information

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

B_Prg Programming

Extent and Intensity

2/2. 6 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

prof. RNDr. Ondřej Čepek, Ph.D.
Department of Computer Science and Mathematics – Departments – University of Finance and Administration
Contact Person: Lenka Bažantová

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 E303PC, Mon 9:30–10:15 E303PC, P. Töpfer
B_Prg/vA21PH: Fri 13. 2. 12:00–13:30 DELL ROOM E302PC, Fri 27. 2. 12:00–13:30 DELL ROOM E302PC, 13:45–15:15 DELL ROOM E302PC, Fri 13. 3. 12:00–13:30 DELL ROOM E302PC, 13:45–15:15 DELL ROOM E302PC, Fri 27. 3. 15:30–17:00 DELL ROOM E302PC, 17:15–18:45 DELL ROOM E302PC, J. Lánský
B_Prg/vA22PH: Fri 13. 2. 13:45–15:15 DELL ROOM E302PC, Fri 27. 2. 15:30–17:00 DELL ROOM E302PC, 17:15–18:45 DELL ROOM E302PC, Fri 13. 3. 15:30–17:00 DELL ROOM E302PC, 17:15–18:45 DELL ROOM E302PC, Fri 24. 4. 15:30–17:00 DELL ROOM E302PC, 17:15–18:45 DELL ROOM E302PC, J. Lánský

Prerequisites (in Czech)

Výuka bezprostředně navazuje na předmět Úvod do programování ze zimního semestru. Předpokládá se znalost učiva z předmětu Úvod do programování a praktická zručnost při ladění jednoduchých programů v Pascalu na počítači.

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 (in Czech)

Anotace je stejná pro všechny formy studia.
Pokračování základního kurzu programování ze zimního semestru pro posluchače 1. ročníku bakalářského studia oboru Aplikovaná informatika. Cílem předmětu je doplnit znalosti složitějších prostředků programovacího jazyka (rekurze, dynamicky alokované proměnné), rozšířit znalosti algoritmů a programovacích technik (efektivita algoritmů, třídicí algoritmy, grafové algoritmy, dynamické datové struktury) a prohloubit praktickou zručnost při návrhu a tvorbě programů.

Syllabus (in Czech)

• Tato osnova je určena pro prezenční studium, průběh výuky pro kombinované studium je uveden ve studijních materiálech formou metodického listu (ML).
• Obsah přednášek:
• 1. Halda, operace na haldě, implementace haldy, heapsort.
• 2. Modulární programování, unity. Unit CRT.
• 3. Rekurze - princip, příklady, backtracking.
• 4. Metoda rozděl a panuj - princip, příklady. Algoritmus quicksort.
• 5. Prohledávání do hloubky a do šířky. Zrychlení backtrackingu - ořezávání, heuristiky.
• 6. Dynamicky alokované proměnné. Dynamické datové struktury.
• 7. Lineární spojové seznamy - operace, druhy seznamů, příklady použití.
• 8. Binární stromy - reprezentace, průchod. Notace aritmetických výrazů, vyhodnocování, převody.
• 9. Vyhledávací stromy. Vyvážené stromy. Obecné stromy.
• 10. Metody ukládání a vyhledávání dat - přehled. Hešování. Třídění - algoritmy, složitost. K-tý nejmenší prvek.
• 11. Grafy - základní pojmy, reprezentace. Implementace grafových algoritmů.
• 12. Ukázky řešení úloh.

Literature

• P.Töpfer: Algoritmy a programovací techniky, Prometheus Praha 1995
• P.Töpfer, D.Töpferová: Programování - Sbírka úloh, Fortuna 1998
• P.Satrapa: Pascal pro zelenáče, Neocortex Praha 2001

Assessment methods (in Czech)

Výuka předmětu je zakončena zápočtem a zkouškou. K získání zápočtu se požaduje:
1. Pravidelná účast na výuce - je nutná minimálně 50% účast na přednáškách a cvičeních.
2. Vypracování dvou zápočtových programů - posluchač musí samostatně vypracovat a ve stanoveném termínu odevzdat dva větší domácí úkoly. Na vypracování každého z nich bude vymezen čas 4-5 týdnů v průběhu semestru. Odevzdává se zdrojový text odladěného programu a dokumentace k programu.
3. Úspěšné absolvování praktického zápočtového testu u počítače - je třeba naprogramovat a odladit jednu úlohu podobného rozsahu a náročnosti, jakou měly domácí úkoly z předmětu Úvod do programování v zimním semestru. Na splnění zápočtového testu má každý dva pokusy (na posledních dvou cvičeních).
Zápočty se udělují na posledním cvičení v semestru.
Zkouška má písemnou a ústní část. V písemné části je úkolem napsat proceduru nebo funkci na práci s lineárními spojovými seznamy. U ústní části se požadují znalosti programovacího jazyka, algoritmů a programovacích technik v rozsahu přednášky (viz sylabus uvedený výše).

Language of instruction

Czech

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: 14hodin/semestr.

Teacher's information

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

B_Prg Programming

Extent and Intensity

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

Teacher(s)

Mgr. Alan Eckhardt (seminar tutor)
doc. RNDr. Pavel Töpfer, CSc. (seminar tutor)

Guaranteed by

prof. RNDr. Ondřej Čepek, Ph.D.
Department of Computer Science and Mathematics – Departments – University of Finance and Administration
Contact Person: Lenka Bažantová

Prerequisites (in Czech)

Výuka bezprostředně navazuje na předmět Úvod do programování ze zimního semestru. Předpokládá se znalost učiva z předmětu Úvod do programování a praktická zručnost při ladění jednoduchých programů v Pascalu na počítači.

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 (in Czech)

Anotace je stejná pro všechny formy studia.
Pokračování základního kurzu programování ze zimního semestru pro posluchače 1. ročníku bakalářského studia oboru Aplikovaná informatika. Cílem předmětu je doplnit znalosti složitějších prostředků programovacího jazyka (rekurze, dynamicky alokované proměnné), rozšířit znalosti algoritmů a programovacích technik (efektivita algoritmů, třídicí algoritmy, grafové algoritmy, dynamické datové struktury) a prohloubit praktickou zručnost při návrhu a tvorbě programů.

Syllabus (in Czech)

• Tato osnova je určena pro prezenční studium, průběh výuky pro kombinované studium je uveden ve studijních materiálech formou metodického listu (ML).
• Obsah přednášek:
• 1. Halda, operace na haldě, implementace haldy, heapsort.
• 2. Modulární programování, unity. Unit CRT.
• 3. Rekurze - princip, příklady, backtracking.
• 4. Metoda rozděl a panuj - princip, příklady. Algoritmus quicksort.
• 5. Prohledávání do hloubky a do šířky. Zrychlení backtrackingu - ořezávání, heuristiky.
• 6. Dynamicky alokované proměnné. Dynamické datové struktury.
• 7. Lineární spojové seznamy - operace, druhy seznamů, příklady použití.
• 8. Binární stromy - reprezentace, průchod. Notace aritmetických výrazů, vyhodnocování, převody.
• 9. Vyhledávací stromy. Vyvážené stromy. Obecné stromy.
• 10. Metody ukládání a vyhledávání dat - přehled. Hešování. Třídění - algoritmy, složitost. K-tý nejmenší prvek.
• 11. Grafy - základní pojmy, reprezentace. Implementace grafových algoritmů.
• 12. Ukázky řešení úloh.

Literature

• P.Töpfer: Algoritmy a programovací techniky, Prometheus Praha 1995
• P.Töpfer, D.Töpferová: Programování - Sbírka úloh, Fortuna 1998
• P.Satrapa: Pascal pro zelenáče, Neocortex Praha 2001

Assessment methods (in Czech)

Výuka předmětu je zakončena zápočtem a zkouškou. K získání zápočtu se požaduje:
1. Pravidelná účast na výuce - je nutná minimálně 50% účast na přednáškách a cvičeních.
2. Vypracování dvou zápočtových programů - posluchač musí samostatně vypracovat a ve stanoveném termínu odevzdat dva větší domácí úkoly. Na vypracování každého z nich bude vymezen čas 4-5 týdnů v průběhu semestru. Odevzdává se zdrojový text odladěného programu a dokumentace k programu.
3. Úspěšné absolvování praktického zápočtového testu u počítače - je třeba naprogramovat a odladit jednu úlohu podobného rozsahu a náročnosti, jakou měly domácí úkoly z předmětu Úvod do programování v zimním semestru. Na splnění zápočtového testu má každý dva pokusy (na posledních dvou cvičeních).
Zápočty se udělují na posledním cvičení v semestru.
Zkouška má písemnou a ústní část. V písemné části je úkolem napsat proceduru nebo funkci na práci s lineárními spojovými seznamy. U ústní části se požadují znalosti programovacího jazyka, algoritmů a programovacích technik v rozsahu přednášky (viz sylabus uvedený výše).

Language of instruction

Czech

Further comments (probably available only in Czech)

Information on the extent and intensity of the course: 14hodin/semestr.

Teacher's information

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

B_Prg Programming

Extent and Intensity

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

Teacher(s)

Mgr. Alan Eckhardt (seminar tutor)
doc. RNDr. Pavel Töpfer, CSc. (seminar tutor)

Guaranteed by

prof. RNDr. Ondřej Čepek, Ph.D.
Department of Computer Science and Mathematics – Departments – University of Finance and Administration
Contact Person: Lenka Bažantová

Timetable of Seminar Groups

B_Prg/cAPH: Mon 9:30–10:15 E303PC, Mon 10:30–11:14 E303PC, Mon 11:15–12:00 E303PC, P. Töpfer
B_Prg/pAPH: Mon 8:00–8:44 E307, Mon 8:45–9:29 E307, P. Töpfer
B_Prg/vA21PH: Fri 22. 2. 13:45–15:15 E303PC, Fri 7. 3. 12:00–13:30 E303PC, Fri 28. 3. 13:45–15:15 E303PC, Fri 11. 4. 12:00–13:30 E303PC, 13:45–15:15 E303PC, Fri 25. 4. 15:30–17:00 E303PC, 17:15–18:45 E303PC, A. Eckhardt
B_Prg/vA22PH: Fri 22. 2. 12:00–13:30 E303PC, Fri 7. 3. 13:45–15:15 E303PC, Fri 28. 3. 12:00–13:30 E303PC, Fri 11. 4. 15:30–17:00 E303PC, 17:15–18:45 E303PC, Fri 25. 4. 12:00–13:30 E303PC, 13:45–15:15 E303PC, A. Eckhardt

Prerequisites (in Czech)

Výuka bezprostředně navazuje na předmět Úvod do programování ze zimního semestru. Předpokládá se znalost učiva z předmětu Úvod do programování a praktická zručnost při ladění jednoduchých programů v Pascalu na počítači.

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 (in Czech)

Anotace je stejná pro všechny formy studia. Cílem kursu je doplnit znalosti složitějších prostředků programovacího jazyka (rekurze, dynamicky alokované proměnné, objekty), rozšířit znalosti algoritmů a programovacích technik a prohloubit praktickou zručnost při návrhu a tvorbě programů. Obsah učiva: Efektivita algoritmů - asymptotická složitost, nejlepší, průměrný a nejhorší případ, konkrétní odhady složitosti jednoduchých algoritmů. Rekurze - přímá a nepřímá rekurze, výhody a nevýhody použití rekurze, rekurzivní formulace algoritmů, efektivita rekurzivních programů a její zvyšování, odstranění rekurze použitím zásobníku. Prohledávání do hloubky a do šířky - backtracking, algoritmus vlny, ořezávání, heuristiky. Metoda rozděl a panuj - princip metody, příklady použití. Třídění dat - třídění přímým výběrem, přímé zatřiďování, bublinkové třídění, quicksort, mergesort, heapsort, přihrádkové třídění, vnější třídění. Hledání k-tého nejmenšího prvku - modifikace quicksortu, pomocí haldy. Staticky a dynamicky alokované proměnné - typ ukazatel, způsoby alokace a uvolňování dynamicky alokovaných proměnných. Lineární spojové seznamy - různé typy seznamů (obousměrné, s hlavou, cyklické), základní operace se seznamy, implementace zásobníku a fronty, práce s dlouhými čísly a polynomy. Stromy - binární stromy, obecné stromy a jejich různé reprezentace, binární vyhledávací stromy a operace s nimi, průchody binárním stromem a jejich souvislost s algebraickými notacemi, prakticky užívané definice vyvážených stromů. Hašování - hašovací tabulka, hašovací funkce, kolize a metody jejich řešení; srovnání různých metod ukládání a vyhledávání dat z hlediska efektivity. Aritmetické výrazy - algoritmy na vyhodnocení výrazu zapsaného v různých notacích (infix, prefix, postfix), převody mezi různými algebraickými notacemi. Grafy - základní grafové pojmy, způsoby reprezentace grafu v programu, programová realizace vybraných grafových algoritmů. Objekty, základní principy objektového programování.

Syllabus (in Czech)

• Tato osnova je určena pro prezenční studium, průběh výuky pro kombinované studium je uveden ve studijních materiálech formou metodického listu (ML). Obsah přednášek: 1. Rekurze, backtracking. 2. Prohledávání do hloubky a do šířky. Složitost algoritmů. 3. Metoda rozděl a panuj. 4. Třídění - algoritmy, složitost. K-tý nejmenší prvek. 5. Dynamicky alokované proměnné. Dynamické datové struktury. 6. Lineární spojové seznamy. 7. Binární stromy. Notace aritmetických výrazů. 8. Vyhledávací stromy. Vyvážené stromy. 9. Obecné stromy. Metody ukládání a vyhledávání dat. Hešování. 10. Grafy - základní pojmy, reprezentace. 11. Implementace základních grafových algoritmů. 12. Objekty a objektové programování.

Literature

• P.Töpfer: Algoritmy a programovací techniky, Prometheus Praha 1995
• P.Töpfer, D.Töpferová: Programování - Sbírka úloh, Fortuna 1998
• P.Satrapa: Pascal pro zelenáče, Neocortex Praha 2001

Assessment methods (in Czech)

Výuka předmětu je zakončena zápočtem a zkouškou. K získání zápočtu se požaduje: 1. Vypracování dvou zápočtových programů: samostatně vypracovat a včas ve stanoveném termínu odevzdat dva větší domácí úkoly. Na vypracování každého z nich bude vymezen čas 4-5 týdnů v průběhu semestru. Odevzdává se zdrojový text odladěného programu a dokumentace k programu. 2. Úspěšné absolvování praktického zápočtového testu u počítače: jedna úloha podobného rozsahu a náročnosti, jakou měly domácí úkoly z předmětu Úvod do programování v zimním semestru. Na splnění zápočtového testu má každý tři pokusy, podmínky testu je nutné splnit do ukončení výuky v letním semestru. 3. Účast na cvičeních není povinně vyžadována, bude však pravidelně sledována jako pomocné kritérium. Zkouška má písemnou a ústní část. V písemné části je úkolem napsat proceduru nebo funkci na práci s ukazateli a dynamickými datovými strukturami. U ústní části se požadují znalosti programovacího jazyka, algoritmů a programovacích technik v rozsahu přednášky (viz sylabus uvedený výše).

Language of instruction

Czech

Further comments (probably available only in Czech)

Information on the extent and intensity of the course: 14hodin/semestr.

Teacher's information

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

B_Prg Programming

Extent and Intensity

0/0. 6 credit(s). Type of Completion: zk (examination).

Teacher(s)

RNDr. Václav Vohánka (seminar tutor)

Guaranteed by

prof. RNDr. Ondřej Čepek, Ph.D.
Department of Computer Science and Mathematics – Departments – University of Finance and Administration
Contact Person: Lenka Bažantová

Course Enrolment Limitations

The course is offered to students of any study field.

Language of instruction

Czech

• Enrolment Statistics (Summer 2024, recent)