B_ADS Algorithms and data structures

Institute of Technology and Business in České Budějovice
winter 2025
Extent and Intensity
1/2. 4 credit(s). Type of Completion: zk (examination).
Teacher(s)
doc. Ing. Robert Frischer, Ph.D. (seminar tutor)
prof. Ing. Zora Koštialová Jančíková, CSc. (seminar tutor)
Guaranteed by
prof. Ing. Zora Koštialová Jančíková, CSc.
Department of Applied Technologies and Materials Research – Faculty of Technology – Rector – Institute of Technology and Business in České Budějovice
Supplier department: Department of Applied Technologies and Materials Research – Faculty of Technology – Rector – Institute of Technology and Business in České Budějovice
Timetable of Seminar Groups
B_ADS/P01: Tue 11:25–12:10 I102, R. Frischer, Z. Koštialová Jančíková
B_ADS/S01: Thu 13:05–14:35 I314, R. Frischer, Z. Koštialová Jančíková
Course Enrolment Limitations
The course is also offered to the students of the fields other than those the course is directly associated with.
fields of study / plans the course is directly associated with
Course objectives supported by learning outcomes
The aim of the course is to introduce students to the principles of algorithmization, complexity evaluation and proof of algorithms, to introduce control and data structures of programming languages and abstract data types.
Learning outcomes
The student is able to analyze basic computer problems. The student will be familiar with basic data and control structures. The student will be able to apply - basic data and control structures in the design of a solution; - create an algorithm for a solution; - convert the algorithm into computer program. The student will be able to create a program with a graphical user interface solving given problems in the C# language.
Syllabus
  • Brief outline:
  • 1. Properties of algorithms, notation and description of algorithms. Visual studio development environment. Analysis of algorithms.
  • 2. Problem solving techniques. Design and implementation of algorithms. First program.
  • 3. Principles of higher programming languages. Symbols, separators, constants, identifiers. Graphical elements, window, panel, content input and display elements
  • 4. Variables, number representation, labels. Working with text, numeric values and their representation
  • 5. Expressions and commands. Calculator program
  • 6. Text files, standard input/output, binary files.
  • 7. Data concept. Simple data types. Structured data types. Working with user-defined types. Credit test.
  • 8. Structured programming. Control structures. Block structure of a program, scope of validity.
  • 9. Procedures and functions and their parameters.
  • 10. Recursive procedures and functions and direct and indirect recursion. Calculation of factorial, loop and recursion solutions.
  • 11. Pointer type and dynamic variables. Connection structures, lists and trees. Use of pointers, references. Lists, trees, sets.
  • 12. Basic sorting methods and their efficiency. Basic search methods, usage. Bubble sort, Quick sort. Method Divide and conquer.
  • 13. Program debugging and documentation
Literature
    required literature
  • VYSTAVĚL, R., 2008. Moderní programování: sbírka úloh k učebnici pro začátečníky. 2. vyd. Ondřejov: moderníProgramování. ISBN 978-80-903951-5-2.
  • VYSTAVĚL, R., 2009. Moderní programování: sbírka úloh k učebnici pro středně pokročilé. Ondřejov: moderníProgramování. ISBN 978-80-903951-3-8.
  • VYSTAVĚL, R., 2019. Moderní programování: učebnice pro začátečníky. 5. vydání. Ondřejov: moderníProgramování. ISBN 978-80-903951-9-0
  • VYSTAVĚL, R., 2008. Moderní programování: učebnice pro středně pokročilé. Ondřejov: moderníProgramování. ISBN 978-80-903951-2-1.
  • VYSTAVĚL, R., 2011. Moderní programování: učebnice pro pokročilé. Ondřejov: moderníProgramování. ISBN 978-80- 903951-7-6.
    recommended literature
  • KNUTH, D. E., 1997. The art of computer programming. Vol. 1, Fundamental algorithms. 3rd ed. Boston: AddisonWesley. ISBN 0-201-89683-4.
Forms of Teaching
Lecture
Seminar
Student Workload
ActivitiesNumber of Hours of Study Workload
Daily StudyCombined Study
Attendance on Lectures13 
Attendance on Seminars/Exercises/Tutorial/Excursion26 
Total:390
Assessment Methods and Assesment Rate
Test – mid-term 30 %
Test – final 70 %
Seminary Work 30 %
Exam conditions
For successful completion of the course it is necessary to achieve in total from the continuous and final assessment of at least 70% under the conditions set out below. V 30 points can be obtained in the continuous assessment, i.e. 30%. In the final assessment, it is possible to a total of 70 points, i.e. 70 %.
Interim evaluation: Term paper/Interim test - 30 points (i.e. 30%)
Final Assessment: Final Test - 70 points (i.e. 70%)
Language of instruction
Czech
Teacher's information
A full-time student is obliged to attend contact classes, i.e. everything except lectures, to meet the mandatory 70% attendance. A 100 – 90, B 89.99 – 84, C 83.99 – 77, D 76.99 – 73, E 72.99 – 70, FX 69.99 – 30, F 29.99 – 0.
  • Enrolment Statistics (recent)
  • Permalink: https://is.vstecb.cz/course/vste/winter2025/B_ADS