TR EN

DATA STRUCTURE AND ALGORITHMS COURSE IDENTIFICATION AND APPLICATION INFORMATION

Code Name of the Course Unit Semester In-Class Hours (T+P) Credit ECTS Credit
BIL202 DATA STRUCTURE AND ALGORITHMS 4 5 4 7

KEY LEARNING OUTCOMES OF THE COURSE UNIT (On successful completion of this course unit, students/learners will or will be able to)

Understand the fundamental principles of recursion and its relationship with mathematical induction.
Use recursion as a problem-solving and programming technique.
Develop design and implementation skills for key abstract data types such as linked lists, doubly linked lists, stacks, and queues.
Analyze discrete data structures, such as trees, using combinatorial methods.
Understand algorithmic solutions for sorting and searching problems and design common search structures like binary search trees.