Classwork
Class: CSE (AIML) - A Section Course Name: Data Structures Course Code: A19ES1IT01
Syllabus
Syllabus
UNIT-I:
Introduction to Data Structures: Abstract Data Types (ADT), Asymptotic Notations. Time- Space trade off. Searching: Linear Search and Binary Search Techniques and their time complexities.
Linear Data Structures: Stacks - ADT Stack and its operations: Applications of Stacks: Recursion, Expression Conversion and evaluation.
UNIT-II:
Linear Data Structures: Queues - ADT queue, Types of Queue: Linear Queue, Circular Queue, Double ended queue, operations on each types of Queues
UNIT-III:
Linked Lists: Singly linked lists: Representation in memory, Operations: Traversing, Searching, insertion, Deletion from linked list; Linked representation of Stack and Queue. Doubly linked List, Circular Linked Lists: All operations
UNIT-IV:
Trees: Basic Tree Terminologies, Different types of Trees: Binary Tree, Binary Search Tree, AVL Tree; Tree Operations on each of the trees and their algorithms with time complexities. B-Trees: Definition, Operations.
UNIT-V:
Priority Queue: Definition, Operations and their time complexities.
Sorting: Objective and properties of different sorting algorithms: Quick Sort, Heap Sort, Merge Sort; Radix sort.
UNIT-VI:
Dictionaries: Definition, ADT, Linear List representation, operations- insertion, deletion and searching, Hash Table representation, Hash function-Division Method, Collision Resolution Techniques-Separate Chaining, open addressing-linear probing, quadratic probing, double hashing, Rehashing.
Graphs: Graph terminology –Representation of graphs –Graph Traversal: BFS (breadth first search) –DFS (depth first search) –Minimum Spanning Tree.
TEXT BOOKS:
1. Fundamental of Data Structure, Horowitz and Sahani, Galgotia Publication.
2. Data Structure, Lipschutz, Schaum Series.
REFERENCES:
1. Algorithms, Data Structures, and Problem Solving with C++, Illustrated Edition by Mark Allen Weiss, Addison-Wesley Publishing Company.
2. How to Solve it by Computer, 2nd Impression by R.G. Dromey, Pearson Education.
UNIT-I:
Introduction to Data Structures: Abstract Data Types (ADT), Asymptotic Notations. Time- Space trade off. Searching: Linear Search and Binary Search Techniques and their time complexities.
Linear Data Structures: Stacks - ADT Stack and its operations: Applications of Stacks: Recursion, Expression Conversion and evaluation.
UNIT-II:
Linear Data Structures: Queues - ADT queue, Types of Queue: Linear Queue, Circular Queue, Double ended queue, operations on each types of Queues
UNIT-III:
Linked Lists: Singly linked lists: Representation in memory, Operations: Traversing, Searching, insertion, Deletion from linked list; Linked representation of Stack and Queue. Doubly linked List, Circular Linked Lists: All operations
UNIT-IV:
Trees: Basic Tree Terminologies, Different types of Trees: Binary Tree, Binary Search Tree, AVL Tree; Tree Operations on each of the trees and their algorithms with time complexities. B-Trees: Definition, Operations.
UNIT-V:
Priority Queue: Definition, Operations and their time complexities.
Sorting: Objective and properties of different sorting algorithms: Quick Sort, Heap Sort, Merge Sort; Radix sort.
UNIT-VI:
Dictionaries: Definition, ADT, Linear List representation, operations- insertion, deletion and searching, Hash Table representation, Hash function-Division Method, Collision Resolution Techniques-Separate Chaining, open addressing-linear probing, quadratic probing, double hashing, Rehashing.
Graphs: Graph terminology –Representation of graphs –Graph Traversal: BFS (breadth first search) –DFS (depth first search) –Minimum Spanning Tree.
TEXT BOOKS:
1. Fundamental of Data Structure, Horowitz and Sahani, Galgotia Publication.
2. Data Structure, Lipschutz, Schaum Series.
REFERENCES:
1. Algorithms, Data Structures, and Problem Solving with C++, Illustrated Edition by Mark Allen Weiss, Addison-Wesley Publishing Company.
2. How to Solve it by Computer, 2nd Impression by R.G. Dromey, Pearson Education.