CS3301 Data Structures Notes
Download CS3301 Data Structures Books, Lecture Notes, Part-A 2 marks with answers, Part-B 16 marks Questions, PDF Books. In this Notes Very Useful for Second Year Third Semester Students.
“CS3301 Data Structures Books”
“CS3301 Data Structures Lecture Notes”
“CS3301 Data Structures Study Material”
“CS3301 Data Structures Notes”
Subject Info:
| Semester | Third Semester |
| Department | CSE |
| Year | Second Year |
| Regulation | R 2021 |
| Subject Code / Name | CS3301 Data Structures |
| Content | Local Authors Books, Lecture Notes |
Syllabus:
CS3301 Data Structures
UNIT I LISTS
Abstract Data Types (ADTs) – List ADT – Array-based implementation – Linked list implementation – Singly linked lists – Circularly linked lists – Doubly-linked lists – Applications of lists – Polynomial ADT – Radix Sort – Multilists.
UNIT II STACKS AND QUEUES
Stack ADT – Operations – Applications – Balancing Symbols – Evaluating arithmetic expressions- Infix to Postfix conversion – Function Calls – Queue ADT – Operations – Circular Queue – DeQueue – Applications of Queues.
UNIT III TREES
Tree ADT – Tree Traversals – Binary Tree ADT – Expression trees – Binary Search Tree ADT – AVL Trees – Priority Queue (Heaps) – Binary Heap.
UNIT IV MULTIWAY SEARCH TREES AND GRAPHS
B-Tree – B+ Tree – Graph Definition – Representation of Graphs – Types of Graph – Breadth-first traversal – Depth-first traversal –– Bi-connectivity – Euler circuits – Topological Sort – Dijkstra’s algorithm – Minimum Spanning Tree – Prim’s algorithm – Kruskal’s algorithm
UNIT V SEARCHING, SORTING AND HASHING TECHNIQUES
Searching – Linear Search – Binary Search. Sorting – Bubble sort – Selection sort – Insertion sort – Shell sort –. Merge Sort – Hashing – Hash Functions – Separate Chaining – Open Addressing – Rehashing – Extendible Hashing.