456-0551/01 – Algorithms II (ALG II)

Gurantor departmentDepartment of Computer ScienceCredits6
Subject guarantordoc. Mgr. Jiří Dvorský, Ph.D.Subject version guarantordoc. Mgr. Jiří Dvorský, Ph.D.
Study levelundergraduate or graduateRequirementCompulsory
Year1Semestersummer
Study languageCzech
Year of introduction2009/2010Year of cancellation2009/2010
Intended for the facultiesFEIIntended for study typesBachelor
Instruction secured by
LoginNameTuitorTeacher giving lectures
ABD006 Ing. Hussam Abdulla, Ph.D.
BLA219 Ing. Petr Blaha
DVO26 doc. Mgr. Jiří Dvorský, Ph.D.
HLA168 Ing. Lukáš Hlaváček
JAK58 RNDr. Ondřej Jakl, CSc.
MIK0070 Mgr. Ondřej Mikulica
OH140 RNDr. Eliška Ochodková, Ph.D.
POH034 Ing. Milan Pohančeník
SCH317 Ing. Peter Scherer
SIK107 Ing. Rostislav Sikora
SIL055 Ing. Tomáš Šilhavý
SUR081 Ing. Milan Šurkala
VAJ049 Ing. Robert Vajdík
Extent of instruction for forms of study
Form of studyWay of compl.Extent
Full-time Graded credit 2+2
Part-time Graded credit 10+0

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:

Cormen, Leiserson, Rievest: Introduction to Algorithms, The MIT Press; 3rd edition, 2009, ISBN-13: 978-0262033848 Sedgewick: Algorithms in C++, Parts 1-4: Fundamentals, Data Structure, Sorting, Searching, Addison-Wesley Professional; 3rd edition, 1998, ISBN-13: 978-0201350883 Schildt: Teach Yourself C++, McGraw-Hill Companies; 3rd edition, 1997, ISBN-13: 978-0078823923

Recommended literature:

Cormen, Leiserson, Rievest: Introduction to Algorithms, MIT Press, 2001.

Way of continuous check of knowledge in the course of semester

Realizace a obhajoba projektu. Programování jednoduchých aplikací na cvičeních.

E-learning

Other requirements

Prerequisities

Subject has no prerequisities.

Co-requisities

Subject has no co-requisities.

Subject syllabus:

Náplň přednášek Úvodní přednáška, organizační záležitosti, souhrn nutných znalostí z předmětu Algoritmy I Objektově orientované paradigma, objekt, třída, atribut, metoda OOP v C++, dynamická alokace paměti Dědičnost Polymorfismus, virtuální metody Abstraktní datové typy, využití OOP Graf jako datrová struktura, průchody do hloubky a do šířky Binární stromy, definice, vyhledávání Binární stromy, vkládání, rušení vrcholů, průchody stromem Přehled vyvážených binárních stromů, B-stromy Hašování Vyhledávání v textu Náplň počítačových cvičení Opakování z předmětu Algoritmy I Implementace třídy v C++ Konstruktory a destruktory Dynamická alokace paměti Dědičnost, ukázka hierarchie tříd Polymorfismus, čistě virtuální metody Grafy, možnosti implementace grafů Průchody grafem Binární stromy Využití hašovacích tabulek Vyhledávání v textu Náplň projektů Zadání projektů budou směřovat ke zvládnutí OOP.

Conditions for subject completion

Part-time form (validity from: 2009/2010 Summer semester, validity until: 2009/2010 Summer semester)
Task nameType of taskMax. number of points
(act. for subtasks)		Min. number of pointsMax. počet pokusů
Graded exercises evaluation Graded credit 100 (100) 51 3
        First test Written test 20  10 2
        Second test Written test 20  10 2
        Third test Written test 20  10 2
        Project Project 40  21 1
Mandatory attendence participation:

Show history

Conditions for subject completion and attendance at the exercises within ISP:

Show history

Occurrence in study plans

Academic yearProgrammeBranch/spec.Spec.ZaměřeníFormStudy language Tut. centreYearWSType of duty
2009/2010 (B2647) Information and Communication Technology (1103R031) Computational Mathematics P Czech Ostrava 1 Compulsory study plan
2009/2010 (B2647) Information and Communication Technology (2601R013) Telecommunication Technology P Czech Ostrava 1 Compulsory study plan
2009/2010 (B2647) Information and Communication Technology (2612R025) Computer Science and Technology P Czech Ostrava 1 Compulsory study plan
2009/2010 (B2647) Information and Communication Technology (2612R059) Mobile Technology P Czech Ostrava 1 Compulsory study plan
2009/2010 (B2647) Information and Communication Technology P Czech Ostrava 1 Compulsory study plan
2009/2010 (B2647) Information and Communication Technology (1103R031) Computational Mathematics K Czech Ostrava 1 Compulsory study plan
2009/2010 (B2647) Information and Communication Technology (2601R013) Telecommunication Technology K Czech Ostrava 1 Compulsory study plan
2009/2010 (B2647) Information and Communication Technology (2612R025) Computer Science and Technology K Czech Ostrava 1 Compulsory study plan
2009/2010 (B2647) Information and Communication Technology (2612R059) Mobile Technology K Czech Ostrava 1 Compulsory study plan
2009/2010 (B2647) Information and Communication Technology K Czech Ostrava 1 Compulsory study plan

Occurrence in special blocks

Block nameAcademic yearForm of studyStudy language YearWSType of blockBlock owner

Assessment of instruction



2009/2010 Summer