Data Structures - Syllabus - R22
Data Structures - Syllabus - R22
DATA STRUCTURES
II B. TECH- I SEMESTER
Introduction: Introduction to Data Structures, abstract data types, The Stack ADT: Stack operations,
implementing the Stack using Array, Stack Applications: Balanced Delimiters, Evaluating Postfix Expressions,
The Queue ADT: Queue operations, Implementing the Queue using Array, Circular Queue operations,
Implementing the Circular Queue using Array, Priority Queues: Priority Queue operations, The Priority Queue
ADT Implementation.
Linked List ADT - Singly Linked Lists (Insertion, Deletion and Traversing), Doubly Linked Lists (Insertion,
Deletion and Traversing), Circular Linked Lists (Insertion, Deletion and Traversing), Stacks implementation
Using Linked list, Queues Implementation Using Linked list.
Searching: Linear Search - Binary search. Sorting: Bubble Sort - Selection Sort - Insertion Sort – Quick Sort
- Merge Sort - Heap sort, comparison of sorting methods.
Trees –Terminology, Representation of Trees ,Binary Tree, Binary Tree traversals, Binary search trees:
operations-Insertion, Delete and Searching – AVL Trees: operations- Insertion, Delete and Searching, BTrees,
B-Tree of order m, height of a B-Tree, insertion, deletion and searching Red-Black Trees, Splay Trees,
Comparison of Search Trees.
Graphs: Introduction, Definition, Terminology, Graph ADT, Graph traversals- DFS and BFS, Dijkstra’s
Algorithm, Bellman Ford Algorithm, Floyd Warshall Algorithm.
Text Processing: Pattern matching algorithms-Brute force, Knuth Morris-Pratt algorithm, Tries-Standard Tries,
Compressed Tries, and Suffix tries.