CENG213Undergraduate
Data Structures
Printed in the catalogue as DATA STRUCTURES
Course content
Classification of data structures, space and time considerations. Linked lists, stacks and queues,priority queues . Array and pointer based implementations.Heaps and Tree structures, binary search trees,balanced AVL and red-black trees. Fundamentals of sorting and searching. Hash-tables and collision handling.Representation of graphs and introduction to graph algorithms. Prerequisite: CENG 140
Where it sits in a curriculum
Programs whose published curriculum lists this course, and the term it falls in. Your own curriculum is the one that counts.
- Computer EngineeringYear 2, Fall semester
More in CENG
- CENG100Computer Engineering Orientation
- CENG111Introduction to Computer Eng. Concepts
- CENG140C Programming
- CENG222Statistical Methods for Computer Engineering
- CENG223Discrete Computational Structures
- CENG232Logic Design
- CENG240Programming with Python for Engineers
- CENG242Programming Language Concepts