CSC 212: Data Structures

Course description:

Abstract Data Types; Performance Measurement: Time & Space Complexity, Big-O notation. Basic Data Structures: Lists, Stacks, Queues, Priority Queues. Trees: Recursion, Terminology, General Trees, Binary Trees, Balanced Search Trees, AVL Trees. Multi-way Trees: the family of B-Trees. Heaps: Min and Max Heap, HeapSort, Priority Queue as a Heap. Hashing Techniques: Hashing Functions, Collision Resolution Strategies. Graphs: Terminology, Graph Traversal Algorithms, Other important graph algorithms, Sorting.

Course Syllabus:

The course syllabus can be downloaded here. 

Course Material: 

The course is a multi-sections and thought by many intructors. All course materials are available on LMS for all sections.
Please visit lms.ksu.edu.sa and log in using your university credentials.