460-2003/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 introduction2010/2011Year of cancellation2012/2013
Intended for the facultiesFEIIntended for study typesBachelor
Instruction secured by
LoginNameTuitorTeacher giving lectures
ABD006 Ing. Hussam Abdulla, Ph.D.
DOH089 Ing. Pavel Dohnálek, Ph.D.
DVO26 doc. Mgr. Jiří Dvorský, Ph.D.
JAW152 Ing. Marek Janáček
JEZ114 Ing. Tomáš Ježowicz
KOB071 Ing. Ondřej Koběrský
KOS305 Ing. Michael Alexander Košinár
KOZ01 Ing. Jan Kožusznik, Ph.D.
KRO080 doc. Ing. Pavel Krömer, Ph.D.
KUD007 doc. Mgr. Miloš Kudělka, Ph.D.
OH140 RNDr. Eliška Ochodková, Ph.D.
VAJ049 Ing. Robert Vajdík
ZAO034 Ing. Lukáš Zaorálek
ZJA0004 Ing. Ladislav Zjavka, PhD.
Extent of instruction for forms of study
Form of studyWay of compl.Extent
Full-time Graded credit 2+2
Combined 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:

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

Implementation and presentation. Programming applications to simple exercises.

E-learning

Další požadavky na studenta

Additional requirements are placed on the student.

Prerequisities

Subject codeAbbreviationTitleRequirement
460-2001 ALG I Algorithms I Compulsory

Co-requisities

Subject has no co-requisities.

Subject syllabus:

Lectures Introductory lecture, organizational matters, a summary of the necessary knowledge of subject Algorithms I Object-oriented paradigm (OOP), object, class, attribute, method OOP in C + +, dynamic memory allocation Inheritance Polymorphism, virtual methods Abstract data types, use of OOP Graph data structure, depth and breadth first traversal Binary trees, definition, searching Binary trees, insertion, deletion, tree travesal Overview of balanced binary trees, B-trees Hashing Search in text The content of computer excercise Repetition of subject Algorithms I Class implementation in C + + Constructors and destructors Dynamic memory allocation Inheritance, class hierarchies sample Polymorphism, pure virtual methods Graph, graphs implementation Graph traversal Binary Trees Using hash tables Search in text Project content Entering the project will aim to deal with the OOP.

Conditions for subject completion

Conditions for completion are defined only for particular subject version and form of study

Occurrence in study plans

Academic yearProgrammeField of studySpec.FormStudy language Tut. centreYearWSType of duty
2012/2013 (B2647) Information and Communication Technology P Czech Ostrava 1 Compulsory study plan
2012/2013 (B2647) Information and Communication Technology K Czech Ostrava 1 Compulsory study plan
2011/2012 (B2647) Information and Communication Technology P Czech Ostrava 1 Compulsory study plan
2011/2012 (B2647) Information and Communication Technology (1103R031) Computational Mathematics P Czech Ostrava 1 Compulsory study plan
2011/2012 (B2647) Information and Communication Technology (2601R013) Telecommunication Technology P Czech Ostrava 1 Compulsory study plan
2011/2012 (B2647) Information and Communication Technology (2612R025) Computer Science and Technology P Czech Ostrava 1 Compulsory study plan
2011/2012 (B2647) Information and Communication Technology (2612R059) Mobile Technology P Czech Ostrava 1 Compulsory study plan
2011/2012 (B2647) Information and Communication Technology K Czech Ostrava 1 Compulsory study plan
2010/2011 (B2647) Information and Communication Technology P Czech Ostrava 1 Compulsory study plan
2010/2011 (B2647) Information and Communication Technology K Czech Ostrava 1 Compulsory study plan
2010/2011 (N2647) Information and Communication Technology (2612T025) Computer Science and Technology (01) Exchange Students P Czech Ostrava Optional study plan
2010/2011 (B2649) Electrical Engineering (2601R004) Measurement and Control Engineering (01) Exchange Students P Czech Ostrava Optional study plan
2010/2011 (B2649) Electrical Engineering (2602R014) Applied and Commercial Electronics (01) Exchange Students P Czech Ostrava Optional study plan
2010/2011 (B2649) Electrical Engineering (3901R039) Biomedical Technician (01) Exchange Students P Czech Ostrava Optional study plan
2010/2011 (B2649) Electrical Engineering (3907R001) Electrical Power Engineering (01) Exchange Students P Czech Ostrava Optional study plan
2010/2011 (B2647) Information and Communication Technology (1103R031) Computational Mathematics (01) Exchange Students P Czech Ostrava Optional study plan
2010/2011 (B2647) Information and Communication Technology (2601R013) Telecommunication Technology (01) Exchange Students P Czech Ostrava Optional study plan
2010/2011 (B2647) Information and Communication Technology (2612R025) Computer Science and Technology (01) Exchange Students P Czech Ostrava Optional study plan
2010/2011 (B2647) Information and Communication Technology (2612R059) Mobile Technology (01) Exchange Students P Czech Ostrava Optional study plan
2010/2011 (N2647) Information and Communication Technology (1103T031) Computational Mathematics (01) Exchange Students P Czech Ostrava Optional study plan
2010/2011 (N2647) Information and Communication Technology (2601T013) Telecommunication Technology (01) Exchange Students P Czech Ostrava Optional study plan
2010/2011 (N2647) Information and Communication Technology (2612T059) Mobile Technology (01) Exchange Students P Czech Ostrava Optional study plan
2010/2011 (N2649) Electrical Engineering (2601T004) Measurement and Control Engineering (01) Exchange Students P Czech Ostrava Optional study plan
2010/2011 (N2649) Electrical Engineering (2612T015) Electronics (01) Exchange Students P Czech Ostrava Optional study plan
2010/2011 (N2649) Electrical Engineering (3901T009) Biomedical Engineering (01) Exchange Students P Czech Ostrava Optional study plan
2010/2011 (N2649) Electrical Engineering (3907T001) Electrical Power Engineering (01) Exchange Students P Czech Ostrava Optional study plan

Occurrence in special blocks

Block nameAcademic yearForm of studyStudy language YearWSType of blockBlock owner
V - ECTS - bc. 2012/2013 Full-time Czech Optional 401 - Study Office stu. block
V - ECTS - bc. 2011/2012 Full-time Czech Optional 401 - Study Office stu. block