Categories
Important question Notes question bank Question Paper R-2021 Syllabus

CS3301 Data Structures

CS3301 Data Structures Study Materials

Anna University – CS3301 Data Structures Regulation 2021 Syllabus, Notes, Important Questions, Question Paper with Answers, Previous Year Question Paper.

UNIT I LISTS CS3301 Data Structures Syllabus

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 CS3301 Data Structures Notes

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 CS3301 Data Structures Important Questions

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 CS3301 Data Structures Question Paper

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 CS3301 Data Structures Question Bank

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.

Syllabus Click Here
Notes Click Here
Important Questions Click Here
Previous Year Question Paper Click Here
Question Bank Click Here

TEXT BOOKS CS3301 Data Structures

1. Mark Allen Weiss, Data Structures and Algorithm Analysis in C, 2nd Edition, Pearson Education, 2005.
2. Kamthane, Introduction to Data Structures in C, 1st Edition, Pearson Education, 2007

REFERENCES

1. Langsam, Augenstein and Tanenbaum, Data Structures Using C and C++, 2nd Edition, Pearson Education, 2015.
2. Thomas H. Cormen, Charles E. Leiserson, Ronald L.Rivest, Clifford Stein, Introduction to Algorithms”, Fourth Edition, Mcgraw Hill/ MIT Press, 2022.
3. Alfred V. Aho, Jeffrey D. Ullman,John E. Hopcroft ,Data Structures and Algorithms, 1st edition, Pearson, 2002.
4. Kruse, Data Structures and Program Design in C, 2nd Edition, Pearson Education, 2006.

Related Links

Anna University Syllabus Regulation 2021

Anna University Regulation 2021 Study Materials

Anna University Results

AU COE Portal

CGPA Calculator For Anna University

Download Padeepz App for Android

Leave a Reply

Your email address will not be published. Required fields are marked *