CS8391 Notes Data Structures
CS8391 Notes Data Structures Regulation 2017 Anna University free download. Data Structures Notes CS8391 pdf free download.
OBJECTIVES: CS8391 Notes Data Structures
To understand the concepts of ADTs
To Learn linear data structures – lists, stacks, and queues
To understand sorting, searching and hashing algorithms
To apply Tree and Graph structures
To Learn linear data structures – lists, stacks, and queues
To understand sorting, searching and hashing algorithms
To apply Tree and Graph structures
OUTCOMES: CS8391 Notes Data Structures
At the end of the course, the student should be able to:
Implement abstract data types for linear data structures.
Apply the different linear and non-linear data structures to problem solutions.
Critically analyze the various sorting algorithms.
Implement abstract data types for linear data structures.
Apply the different linear and non-linear data structures to problem solutions.
Critically analyze the various sorting algorithms.
TEXT BOOKS: CS8391 Notes Data Structures
1. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C”, 2nd Edition, Pearson Education,1997.
2. Reema Thareja, “Data Structures Using C”, Second Edition , Oxford University Press, 2011
REFERENCES: CS8391 Data Structures Notes
1. Thomas H. Cormen, Charles E. Leiserson, Ronald L.Rivest, Clifford Stein, “Introduction to Algorithms”, Second Edition, Mcgraw Hill, 2002.
2. Aho, Hopcroft and Ullman, “Data Structures and Algorithms”, Pearson Education,1983.
3. Stephen G. Kochan, “Programming in C”, 3rd edition, Pearson Education.
4. Ellis Horowitz, Sartaj Sahni, Susan Anderson-Freed, “Fundamentals of Data Structures in C”, Second Edition, University Press, 2008
CS8391 Syllabus Data StructuresCS8391 Notes Data Structures click here to download
CS8391 Unit-I Data Structures Notes
CS8391 Unit-II Data Structures Notes
CS8391 Unit-III Data Structures Notes
CS8391 Unit-IV Data Structures Notes
CS8391 Unit-V Data Structures Notes
CS8391 Important 2 marks Questions Data Structures
CS8391 Question Bank Data Structures
CS8391 Syllabus Data StructuresCS8391 Notes Data Structures click here to download
CS8391 Syllabus Data Structures Regulation 2017 Anna University free download. Data Structures Syllabus CS8391 pdf free download.
UNIT I LINEAR DATA STRUCTURES – LIST CS8391 Syllabus Data Structures
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 Manipulation – All operations (Insertion, Deletion, Merge, Traversal).
UNIT II LINEAR DATA STRUCTURES – STACKS, QUEUES CS8391 Syllabus Data Structures
Stack ADT – Operations – Applications – Evaluating arithmetic expressions- Conversion of Infix to postfix expression – Queue ADT – Operations – Circular Queue – Priority Queue – deQueue – applications of queues.
UNIT III NON LINEAR DATA STRUCTURES – TREES CS8391 Syllabus Data Structures
Tree ADT – tree traversals – Binary Tree ADT – expression trees – applications of trees – binary search tree ADT –Threaded Binary Trees- AVL Trees – B-Tree – B+ Tree – Heap – Applications of heap.
UNIT IV NON LINEAR DATA STRUCTURES – GRAPHS CS8391 Data Structures Syllabus
Definition – Representation of Graph – Types of graph – Breadth-first traversal – Depth-first traversal – Topological Sort – Bi-connectivity – Cut vertex – Euler circuits – Applications of graphs.
UNIT V SEARCHING, SORTING AND HASHING TECHNIQUES CS8391 Data Structures Syllabus
Searching- Linear Search – Binary Search. Sorting – Bubble sort – Selection sort – Insertion sort – Shell sort – Radix sort. Hashing- Hash Functions – Separate Chaining – Open Addressing – Rehashing – Extendible Hashing.
