Verify Account

SYLLABUS

Unit-I

Introduction and Overview: Asymptotic Notations, One-dimensional Array – Multi-dimensional Array – Pointer Arrays. Linked Lists: Definition – Single Linked List – Circular Linked List – Double Linked List – Circular Double Linked List – Application of Linked Lists.

Unit-II

Stacks: Introduction – Definition – Representation of Stack – Operations on Stacks – Applications of Stacks. Queues: Introduction, Definition – Representations of Queues – Various Queue Structures – Applications of Queues. Tables: Hash Tables.

Unit-III

Trees: Basic Terminologies – Definition and Concepts – Representations of Binary Tree – Operation on a Binary Tree – Types of Binary Trees – Binary Search Tree, Heap Trees, Height Balanced Trees, B.Trees, Red Black Trees. Graphs: Introduction – Graph Terminologies – Representation of Graphs – Operations on Graphs – Application of Graph Structures: Shortest Path Problem – Topological Sorting.

Unit-IV

Sorting: Sorting Techniques – Sorting by Insertion: Straight Insertion Sort – List Insertion Sort – Binary Insertion Sort – Sorting by Selection: Straight Selection Sort – Heap Sort – Sorting by Exchange – Bubble Sort – Shell Sort – Quick Sort – External Sorts: Merging Order Files – Merging Unorder Files – Sorting Process.

Unit-V

Searching: List Searches – Sequential Search – Variations on Sequential Searches – Binary Search – Analyzing Search Algorithm – Hashed List Searches – Basic Concepts – Hashing Methods – Collision Resolutions – Open Addressing – Linked List Collision Resolution – Bucket Hashing.