460-2003/01 – Algorithms II (ALG II)
| Gurantor department | Department of Computer Science | Credits | 6 |
| Subject guarantor | doc. Mgr. Jiří Dvorský, Ph.D. | Subject version guarantor | doc. Mgr. Jiří Dvorský, Ph.D. |
| Study level | undergraduate or graduate | | |
| | Study language | Czech |
| Year of introduction | 2010/2011 | Year of cancellation | 2012/2013 |
| Intended for the faculties | FEI | Intended for study types | Bachelor |
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:
Recommended literature:
Additional study materials
Way of continuous check of knowledge in the course of semester
Implementation and presentation.
Programming applications to simple exercises.
E-learning
Other requirements
Additional requirements are placed on the student.
Prerequisities
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
Occurrence in study plans
Occurrence in special blocks
Assessment of instruction