TR    EN

Data Structures (COMPE 226) Course Details

Course Name: Data Structures
Code: COMPE 226
Pre-requisite Course(s): COMPE225
Objective: This course introduces the abstract concepts that are useful in problem solving, and shows how these concepts are implemented in a programming language. The students learn how to choose a suitable data structure for a specific problem, how to create more complex data structures using the already existing data types, and also how to implement and analyze the algorithms developed for these data structures. The students get a chance to apply their knowledge by completing assignments written in the C++ language.
Content: Stacks. Recursion. Queues. Creation and destruction of dynamic variables. Serial linked lists. Circular lists. Doubly linked lists. Circular doubly linked lists. Sorting and searching algorithms. Space and time considerations. Binary trees. Binary search trees. Tree traversal algorithms. Binary tree sorting algorithms. Hashing.
Term: Spring
Theory: 3
Application: 0
Laboratory: 0
Credit: 3
Web:
ECTS Course File: Course File
Course File:
ECTS: 5.5