Semester 1

Algorithms and Data Structures 1 builds on basic mathematical knowledge to introduce the fundamental principles of algorithm design and data organization for problem-solving.

This course covers the complete problem-solving cycle (analysis, algorithm, program, execution), sequential algorithms, conditional and repetitive control structures, one- and two-dimensional arrays, character strings, and custom data types (records and enumerations). The C language is used as the practical implementation support, allowing students to translate algorithms into working programs.

Through a combination of lectures, tutorials, and laboratory sessions, students learn to design clear, well-structured algorithms and implement them efficiently, laying solid foundations for more advanced programming and data-structure courses.