Page 6 - DCAP407_DATA_STRUCTURE

SYLLABUS

Data Structure

Objectives: The objectives for this course are to gain a solid understanding of the following topics:
 The fundamental design, analysis, and implementation of basic data structures and algorithms
 Principles for good program design, especially the uses of data abstraction and modular program composition

 Basic concepts in the specification and analysis of programs

S. No. Description
1. Basic concepts and notations: Data structures and data structure operations
2. Complexity Analysis: Mathematical notation and functions, algorithmic complexity and time space
trade off, Big O Notation, The best, average & Worst cases analysis of various algorithms.
3. Arrays: Linear & Multidimensional Arrays, Representation & traversal
4. Pointers: Array Pointers, Records and Record Structures, Representation of Records in Memory; Parallel
Arrays
5. Linked list: Representation, traversal, searching, Insertion, deletion of linked list.
Two way/multi linked structures, Header Lists, Circular Lists
6. Stacks: Basic operation of Stack, Memory Representation, Traversal.
Queues: Operations, Representation & Types.
7. Recursion: Definition, Function Call & Recursion implementation, Anatomy of Recursive Call,
Complexity issues
8. Trees: Definition, Representation in memory.
9. Binary trees: Binary tree traversal, Insertion, Deletion & Searching
10. Binary Search Trees: Search, Insertion, deletion
Intro to Heaps