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

Gurantor departmentDepartment of Computer ScienceCredits6
Subject guarantordoc. Mgr. Jiří Dvorský, Ph.D.Subject version guarantordoc. Mgr. Jiří Dvorský, Ph.D.
Study levelundergraduate or graduateRequirementCompulsory
Year1Semesterwinter
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.
DVO26 doc. Mgr. Jiří Dvorský, Ph.D.
GAJ03 doc. Ing. Petr Gajdoš, Ph.D.
HOL541 Ing. Michal Holiš
JAW152 Ing. Marek Janáček
JEZ114 Ing. Tomáš Ježowicz
NEU098 Ing. Zdeněk Neustupa
OH140 RNDr. Eliška Ochodková, Ph.D.
PLA06 doc. Ing. Jan Platoš, Ph.D.
PRI156 Ing. Michal Prílepok, Ph.D.
VAJ049 Ing. Robert Vajdík
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. Programming applications to simple exercises

E-learning

Další požadavky na studenta

Additional requirements are placed on the student.

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 translation, processing, process Variables, constants, data types Control of language structure (sequence, branching, cycle) Structured Programming in C + + functions and their parameters, function calls Array Search in array (sequence, interval bisection) The list, queue, stack 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 2010 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 field Implementation of algorithms in the search box Implementation of stack usage examples Recursive functions Recursive functions Sorting Algorithms Project content The project specification will be directed to use the sorting and searching algorithms work with fields and the like.

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