INTRODUCTION: Functions and parameters, Dynamic memory allocation, Recursion.
LINEAR LISTS: Data objects and structures, Linear list data structures, Array Representation, Vector Representation, Singly Linked lists and chains.
ARRAYS AND MATRICS: Arrays, Matrices, Special matrices, Sparse matrices.
STACKS: The abstract data types, Array Representation, Linked Representation, Applications-Parenthesis Matching & Towers of Hanoi.
QUEUES: The abstract data types, Array Representation, Linked Representation, Applications-Railroad car arrangement.
HASHING: Dictionaries, Linear representation, Hash table representation.
BINARY AND OTHER TREES: Trees, Binary trees, Properties and representation of binary trees, Common binary tree operations, Binary tree traversal the ADT binary tree, ADT binary tree and the class linked binary tree.
Priority Queues: Linear lists, Heaps, Applications-Heap Sorting. Search Trees: Binary search trees operations and implementation, Binary Search trees with duplicates.