460-2003/05 – Algorithms II (ALG II)

Gurantor departmentDepartment of Computer ScienceCredits5
Subject guarantordoc. Mgr. Jiří Dvorský, Ph.D.Subject version guarantordoc. Mgr. Jiří Dvorský, Ph.D.
Study levelundergraduate or graduateRequirementCompulsory
Year2Semesterwinter
Study languageEnglish
Year of introduction2019/2020Year of cancellation
Intended for the facultiesFEIIntended for study typesBachelor
Instruction secured by
LoginNameTuitorTeacher giving lectures
DVO26 doc. Mgr. Jiří Dvorský, Ph.D.
Extent of instruction for forms of study
Form of studyWay of compl.Extent
Full-time Graded credit 2+2

Subject aims expressed by acquired skills and competences

The aim of the course is to acquaint students with object-oriented programming and to develop skills of students in the area of data structures. After completing the course, students will be able to: Analyze the problem from the position given the OOP. Develop and debug C++ program using OOP. Use of binary trees and hash tables. Assess the effectiveness of the solution of the problem.

Teaching methods

Lectures
Tutorials

Summary

This subject is a continuation of the course Algorithms I. In this course will be combined with the interpretation of object-oriented programming with the introduction of other frequently used data structures - binary trees and hash tables. OOP is seen rather to manage the implementation of a variety of tables, lists of operations to insert, search and subsequent deleting of elements than the proposal to more complex systems. This objective will be met in courses dealing with software engineering.

Compulsory literature:

LEVITIN, Anany. Introduction to the design. 3rd ed. Boston: Pearson, 2012. ISBN 978-0-13-231681-1. CORMEN, Thomas H. Introduction to algorithms. 2nd ed. Cambridge, Mass.: MIT Press, 2001. ISBN 02-620-3293-7. SEDGEWICK, Robert. Algorithms in C. 3rd ed. Reading, Mass: Addison-Wesley, 1998. ISBN 978-020-1350-883.

Recommended literature:

STROUSTRUP, Bjarne. The C programming language. Fourth edition. Upper Saddle River, NJ: Addison-Wesley, 2013. ISBN 978-0321563842. SCHILDT, Herbert. Teach yourself C. 3rd ed. Berkeley: Osborne McGraw-Hill, 1998. ISBN 978-0078823923.

Way of continuous check of knowledge in the course of semester

Conditions for granting credit Implementation and presentation of the project. Programming applications to simple exercises. Attendance on exercises.

E-learning

Other requirements

Students are expected to complete Algorihms I before this subject and also have the basic C++ programming skills and high school math knowledge.

Prerequisities

Subject codeAbbreviationTitleRequirement
460-2001 ALG I Algorithms I Compulsory

Co-requisities

Subject has no co-requisities.

Subject syllabus:

Transform and conquer strategy. Data presorting. Gaussian elimination. AVL trees. Representation change. Heap and heapsort. Horner's rule. Binary exponentation. Problem reduction strategy. Reduction to graph problems. Space-time trade-offs. Hashing. B-trees. Dynamic programming. Knapsack problem. Floyd algortihm. Greedy algorithms. Prim's, Dijkstra's algorithms. Huffman coding. Iterative improvement strategy. Simplex methods. Coping with the limitation of algorithm power. P, NP and NP-complete problems. Backtracking. Eight queens problem. Approximation algorithms for NP-hard problems. Computer seminars Gaussian elimination. AVL trees. Implementation of heap and heapsort. Hash tables. B-trees. Dynamic programming. Floyd algortihm. Greedy algorithms. Prim's, Dijkstra's algorithms. Huffman coding. Simplex methods. Backtracking. Eight queens problem. Approximation algorithms for NP-hard problems.

Conditions for subject completion

Full-time form (validity from: 2019/2020 Winter semester)
Task nameType of taskMax. number of points
(act. for subtasks)
Min. number of points
Graded credit Graded credit 100 (100) 51
        Ongoing Activity Other task type 30  15
        Project defense Project 30  15
        Final written test Written test 40  21
Mandatory attendence parzicipation: Every student has to obtain at least the minimum number of points for each task.

Show history

Occurrence in study plans

Academic yearProgrammeField of studySpec.ZaměřeníFormStudy language Tut. centreYearWSType of duty
2020/2021 (B0613A140010) Computer Science TZI P English Ostrava 2 Compulsory study plan
2020/2021 (B2647) Information and Communication Technology P English Ostrava 1 Compulsory study plan
2020/2021 (B0541A170009) Computational and Applied Mathematics P English Ostrava 2 Optional study plan
2019/2020 (B0613A140010) Computer Science TZI P English Ostrava 2 Compulsory study plan
2019/2020 (B0541A170009) Computational and Applied Mathematics P English Ostrava 2 Optional study plan

Occurrence in special blocks

Block nameAcademic yearForm of studyStudy language YearWSType of blockBlock owner