DATA STRUCTURES FOR B.TECH
DATA STRUCTURES Unit 1: Introduction : Basic Terminologies: C oncept of Data Structure, Choice of right Data Structure , Algorithms , how to design and develop algorithm, Complexity of algorithm. Operations: insertion, deletion, traversal etc, Analysis of an Algorithm. Searching: Linear Search and Binary Search Techniques and their complexity analysis. Unit 2: Stacks and Queues : Stack and its operations: Algorithms and their complexity analysis, Applications of Stacks: Expression Conversion and evaluation -corresponding algorithms and complexity analysis. queue, Types of Queue: Simple Queue, Circular Queue, Priority Queue ; Operations on each types of Queues: Algorithms and their analysis. Unit 3 : Linked Lists: Singly linked lists: Representation in memory, Algorithms of several operations: Traversing, Searching, Insertion into, Deletion from linked list; Linked representation of Stack and Queue, Header nodes, Doubly linked list: operations on