460-2001/02 – Algorithms I (ALG I)

Gurantor departmentDepartment of Computer ScienceCredits5
Subject guarantordoc. Mgr. Jiří Dvorský, Ph.D.Subject version guarantordoc. Mgr. Jiří Dvorský, Ph.D.
Study levelundergraduate or graduate
Study languageCzech
Year of introduction2013/2014Year of cancellation2020/2021
Intended for the facultiesUSP, FEIIntended for study typesBachelor
Instruction secured by
LoginNameTuitorTeacher giving lectures
BIE0026 Ing. Martin Bielik
DOH089 Ing. Pavel Dohnálek, Ph.D.
DVO26 doc. Mgr. Jiří Dvorský, Ph.D.
GAJ03 doc. Ing. Petr Gajdoš, Ph.D.
OH140 RNDr. Eliška Ochodková, Ph.D.
PAP0084 Mgr. et Mgr. Richard Papřok
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

Acquaint students with the basics of structured programming, the basics of C + +. After completing the course, students will be able to: Work with integrated development environment for C++. Define a describe basic programming constructions. Develop and debug a simple program C++. Use data structures such as array, list, etc. Write a recursive function. Use sorting and searching algorithms in their programs.

Teaching methods

Lectures
Tutorials

Summary

This subject is the introductory programming course. Students are expected to have the basic C++ knowledge and high school math knowledge. Discussed algorithms and data structures will be demonstrated in C++. A large emphasis is placed on practical implementation discussed algorithms and data structures. Students are encouraged analysis and synthesis solutions to the problems of smaller units.

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

E-learning

Další požadavky na studenta

Students are expected to know high school math and computer skills at users level.

Prerequisities

Subject has no prerequisities.

Co-requisities

Subject has no co-requisities.

Subject syllabus:

Lectures Introductory lecture, organizational matters The first program in C++, algorithm, program compilation, processor, process Variables, constants, data types Control of language structure (sequence, branching, loop) Structured Programming in C++, functions and their parameters, function calls Array Array search algorithms (linear, binary) Recursion, definition, examples, a simple backtracking Sorting, problem definition, address sorting Basic sorting algorithms(insertion sort, selection, bubble) Advanced sorting algorithms (quicksort, heapsort, mergesort) The content of computer training Getting to know the development environment, Visual Studio 2015 planned Implementation and debugging trivial programs - Hello World Implementation and debugging programs with basic structures such as calculating the greatest common divisor Work with functions, called value parameters, reference, constant parameters Working with the array Implementation of array search algorithms Recursive functions Backtracking Basic sorting algorithms Advanced sorting algorithms Project content The project specification will be directed to use the sorting and searching algorithms, array based algorithms etc.

Conditions for subject completion

Full-time form (validity from: 2017/2018 Winter semester, validity until: 2018/2019 Summer 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 20  10
        Programming test Other task type 30  15
        Written test Written test 50  26
Mandatory attendence parzicipation: obligatory participation at all exercises, 2 apologies are accepted

Show history
Combined form (validity from: 2013/2014 Winter semester, validity until: 2018/2019 Summer semester)
Task nameType of taskMax. number of points
(act. for subtasks)
Min. number of points
Graded exercises evaluation Graded credit 100 (100) 51
        První test Written test 20  10
        Druhý test Other task type 20  10
        Třetí test Other task type 20  10
        Projekt Project 40  21
Mandatory attendence parzicipation:

Show history

Occurrence in study plans

Academic yearProgrammeField of studySpec.FormStudy language Tut. centreYearWSType of duty
2019/2020 (B2647) Information and Communication Technology P Czech Ostrava 1 Compulsory study plan
2019/2020 (B2647) Information and Communication Technology K Czech Ostrava 1 Compulsory study plan
2018/2019 (B2660) Computer Systems for the Industry of the 21st. Century P Czech Ostrava 1 Compulsory study plan
2018/2019 (B3973) Automotive Electronic Systems P Czech Ostrava 1 Compulsory study plan
2018/2019 (B2647) Information and Communication Technology P Czech Ostrava 1 Compulsory study plan
2018/2019 (B2647) Information and Communication Technology K Czech Ostrava 1 Compulsory study plan
2017/2018 (B2647) Information and Communication Technology P Czech Ostrava 1 Compulsory study plan
2017/2018 (B2647) Information and Communication Technology K Czech Ostrava 1 Compulsory study plan
2017/2018 (B2660) Computer Systems for the Industry of the 21st. Century P Czech Ostrava 1 Compulsory study plan
2017/2018 (B3973) Automotive Electronic Systems P Czech Ostrava 1 Compulsory study plan
2016/2017 (B2647) Information and Communication Technology P Czech Ostrava 1 Compulsory study plan
2016/2017 (B2647) Information and Communication Technology K Czech Ostrava 1 Compulsory study plan
2016/2017 (B2660) Computer Systems for the Industry of the 21st. Century P Czech Ostrava 1 Compulsory study plan
2015/2016 (B2647) Information and Communication Technology P Czech Ostrava 1 Compulsory study plan
2015/2016 (B2647) Information and Communication Technology K Czech Ostrava 1 Compulsory study plan
2014/2015 (B2647) Information and Communication Technology P Czech Ostrava 1 Compulsory study plan
2014/2015 (B2647) Information and Communication Technology K Czech Ostrava 1 Compulsory study plan
2013/2014 (B2647) Information and Communication Technology P Czech Ostrava 1 Compulsory study plan
2013/2014 (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
V - ECTS - bc. 2014/2015 Full-time Czech Optional 401 - Study Office stu. block
V - ECTS - bc. 2013/2014 Full-time Czech Optional 401 - Study Office stu. block