[PDF] CS3301 Data Structures (DS) Books, Lecture Notes, 2 marks with answers, Important Part B 16 Marks Questions, Question Bank & 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.

DOWNLOAD LINK

Anna University CS3301 Data Structures Books Question Banks Lecture Notes Syllabus CS3301 Data Structures Part A 2 Marks with Answers Part – B 16 Marks Questions with Answers & Anna University CS3301 Data Structures Question Paper Collection and Local Author Books.

Click below the link “DOWNLOAD” to save the Book/Material (PDF)

Kindly Note : There are different collection of CS3301 Data Structures study materials are listed below. Based on your requirement choose the suitable material for your preparation.