Course Contents

Introduction and Overview

Elementary Data Organization, Introduction to Data Structures, Basic Data Structure Operations, Abstract Data Types (ADTs)

Arrays

Linear Arrays: Representation in memory, Multi-dimensional Arrays, Record Structures, Parallel arrays, Matrices, Pointer Arrays, Representing Stacks , Application of Stacks: Infix, Postfix and Prefix, Expressions

Linked Lists

Definition and Basic Operations
Traversing and searching linked list
Representing Linked Lists
Linked implementation of Stacks and Queues
Applications of Linked Lists
Other List Structures: Circular Lists, Doubly Linked Lists

Recursion

Recursive Definition and Processes, Recursion, Queues, Definition and Basic Operations, Representing Queues, Priority Queues, Applications of Queues

Algorithms

Introduction to asymptote notation, Worst case time complexity calculation.
Sorting
General Background
Bubble Sort
Selection and Tree Sorts
Insertion Sorts
Merge and Radix Sorts
Searching
General Background
Sequential Search
Indexed Sequential Search
Binary Search
Tree Search
Hashing

Trees

Definition and Basic Operations
Binary Trees
Representing Binary Trees
Application of Binary Trees: BST
Trees and their Applications, Searching, Inserting and Deleting trees.
Representing Trees
Application of Trees: Game Trees

Graphs

Definition and Basic Operations
Representing Graphs
Graph Search and Traversal Techniques:BFS, DFS
Application of Graphs: Dijkstra's Shortest Path Algorithm