Data Structures and Algorithms

With this course students can cover the following areas:
Overview, Preliminaries, List, Pointer Implementation of List, Advanced Linked List Structures, Stack, Queues, Tree Structures, Binary Trees, Applications of Tree Structures, Different Tree Structures, Graphs, Graph Traversals, Introduction to Algorithms, Analyzing Algorithms, Asymptotic Analysis of Algorithms, Recursion, Internal Sorting, Internal Sorting by Insertion, Internal Sorting by Selection, External Sorting, Searching Methods, Binary Search Trees, Hashing, Memory Management.