DSA - P26CA101

         Core I: DATA STRUCTURES AND ALGORITHMS

SEMESTER: I                                        CODE: P26CA101

CREDITS: 4                             HOURS/WEEK: 4

                                Syllabus

UNIT I - Introduction to Data Structures         

• Introduction and Overview: Definitions – Concept of Data Structures – Overview of Data Structures – Implementation of Data Structures.
• Linked Lists: Definition – Single Linked List – Circular Linked List – Double Linked List – Circular Double Linked List – Application of Linked Lists.
• Stacks: Introduction – Definition – Representation of Stack – Operations on Stacks – Application of Stacks.
• Queues: Introduction – Definition – Representation of Queues – Various Queue Structures– Application of Queues.

UNIT II - Tree and Binary Tree

• Trees: Basic Terminologies
• Binary Tree: Representation of Binary Tree – Operations on Binary Tree.
• Types of Binary Trees: Expression Tree – Binary Search Tree – Heap Tree – Threaded Binary Tree – Height Balanced Tree.