FPF:FPFVA021 Algorithms and Programming II - Course Information

FPFVA021 Algorithms and Programming II

Extent and Intensity

0/1/0. 5 credit(s). Type of Completion: z (credit).

Teacher(s)

Mgr. Daniel Valenta, Ph.D. (seminar tutor)

Guaranteed by

Mgr. Daniel Valenta, Ph.D.
Faculty of Philosophy and Science in Opava

Prerequisites

Successful pass out the course Algorithms and Programming 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

• English in combination with another discipline (programme FPF, N7310 Filo)
• English (programme FPF, N7310 Filo) (2)
• Archaeology (programme FPF, N7109 Arch)
• Audio-visual Creation (programme FPF, N8203 DrUm)
• History (programme FPF, N7105 HiVe)
• History - Museology (programme FPF, N7105 HiVe)
• Information and Library Studies (programme FPF, N7201 InSK) (2)
• Computer Science and Technology (programme FPF, N1801 Inf)
• Library science with the focus on public libraries of the community type (programme FPF, N7201 InSK) (2)
• Cultural Inheritance in Regional Practice (programme FPF, N7106 HiSt)
• Cultural History (programme FPF, N7105 HiVe)
• German in combination with another discipline (programme FPF, N7310 Filo)
• German (programme FPF, N7310 Filo) (2)
• Protection of the Cultural Heritage (programme FPF, N7105 HiVe)
• Computational Physics (programme FPF, N1701 Fyz)
• Theoretical Physics (programme FPF, N1701 Fyz)
• Secondary School Teacher Training in German (programme FPF, N7504 UcSS)
• Teacher Training - shared framework (programme FPF, N7504 UcSS)

Course objectives

The course Algorithms and programming II follows up the course Algorithms and programming I. Students get familiar with dynamic variables and dynamic data structures issue, application of dynamic data structures in graph, sorting and searching algorithms. They will also obtain basic knowledge of object-oriented programming - class definition, objects and their attributes, methods and encapsulation.

Syllabus

• 1. Pointers
  2. Dynamic variables
  3. Basics of object-oriented programming - class, object, method, attribute, encapsulation
  4. Dynamic data structures, queue, stack, list
  5. Application of dynamic data structures
  6. Searching linked list
  7. Radix sort
  8. Graphs, computer representations of the graphs
  9. Breadth first search and depth first search
  10. Passing a maze
  11. Connectedness of the graph, components of the graph
  12. Spanning tree
  13. Hamiltonian path and cycle
  14. Rod Cutting Problem
  15. Handling files
  

Literature

recommended literature
• http://codeforces.com/blog/entry/16221. URL info
• https://msdn.microsoft.com/en-us/library/60k1461a.aspx. URL info
• http://www.cplusplus.com/doc/tutorial/. URL info
• http://www.cprogramming.com/tutorial/c++-tutorial.html. URL info
• Stephen Prata. C++ Primer Plus (Learning Lab), 6th Edition. Addison-Wesley Professional, 2016. ISBN 978-0-13-431061-9. info
• Bjarne Stroustrup. Programming -- Principles and Practice Using C++. Addison-Wesley Professional, 2014. ISBN 978-0321-992789. info
• Bjarne Stroustrup. The C++ Programming Language (4th Edition). Addison-Wesley Professional, 2013. ISBN 978-0321563842. info
• Stephen Prata. C++ Primer Plus (6th Edition) (Developer's Library). Addison-Wesley Professional, 2011. ISBN 978-0321776402. info
• Donald E. Knuth. The Art of Computer Programming. Addison-Wesley Professional, 2011. ISBN 858-0001170602. info
• Steve Oualline. Practical C++ Programming, Second Edition. O'Reilly Media, 2003. ISBN 063-6920004196. info

Teaching methods

Monological

Language of instruction

English

Further comments (probably available only in Czech)

The course can also be completed outside the examination period.

Teacher's information

1. Active participation in seminar
2. Program final project.

• Enrolment Statistics (Winter 2023, recent)
  
• Permalink: https://is.slu.cz/course/fpf/winter2023/FPFVA021