Page 6 - DCAP201_FUNDAMENTALS_OF_DATA_STRUCTURES

SYLLABUS
Fundamentals of Data Structures

Objectives: The objectives of the course are to:

Solve problems using data structures such as linear lists, stacks, queues, hash tables, binary trees, heaps, tournament
trees, binary search trees, and graphs and writing programs for these solutions.

Solve problems using algorithm design methods such as the greedy method, divide and conquer, dynamic
programming, backtracking, and branch and bound and writing programs for these solutions.
Develop proficiency in the specification, representation, and implementation of Data Types and Data Structures.

S. No. Description
1. Introduction & Overview: Concept of Data Type, Definition and Brief Description of Various Data Structures.
2. Operations on Data Structures, Algorithm Complexity, Big O Notation, Recursion, Some Illustrative Examples
of Recursive Functions.
3. Arrays: Linear and Multi-dimensional Arrays and Their Representation
Pointers, Array Pointers, Records and Record Structures, Representation of Records in Memory; Parallel
Arrays.
4. Arrays: Operations on Arrays, Sparse Matrices and Their Storage.
5. Linked Lists: Linear Linked List, Operations on Linear Linked List, Double Linked List.
6. Stacks: Sequential and Linked Representations, Operations on Stacks, Multi Stacks
Stacks: Application of Stacks such as Parenthesis Checker, Evaluation of Postfix Expressions
7. Queues: Sequential Representation of Queue, Linear Queue, Circular Queue, Operations and Applications,
Linked Representation of a Queue.
8. Introduction to Trees: Binary Tree Representation, Traversal.
9. Sorting: Insertion Sort, Selection Sort, Merge Sort, Radix Sort, Hashing.
10. Searching: Linear and Binary Search.