Verify Account

SYLLABUS

UNIT-I

Introduction to Data Structures: Abstract Data Types, Linear List – Singly Linked List Implementation, Insertion, Deletion and Searching Operations on Linear List, Stacks – Operations, Array and Linked Representations of Stacks, Stack Applications, Queues – Operations, Array and Linked Representations.

UNIT-II

Dictionaries: Linear List Representation, Skip List Representation, Operations – Insertion, Deletion and Searching. Hash Table Representation: Hash Functions, Collision Resolution – Separate Chaining, Open Addressing – Linear Probing, Quadratic Probing, Double Hashing, Rehashing, Extendible Hashing.

UNIT-III

Search Trees: Binary Search Trees, Definition, Implementation, Operations – Searching, Insertion and Deletion, AVL Trees, Definition, Height of an AVL Tree, Operations – Insertion, Deletion and Searching, Red-Black, Splay Trees.

UNIT-IV

Graphs: Graph Implementation Methods. Graph Traversal Methods. Sorting: Heap Sort, External Sorting – Model for External Sorting, Merge Sort.

UNIT-V

Pattern Matching and Tries: Pattern Matching Algorithms – Brute Force, The Boyer-Moore Algorithm, The Knuth-Morris-Pratt Algorithm, Standard Tries, Compressed Tries, Suffix Tries.