# CS8391 DATA STRUCTURES NOTES 2017 REGULATION

In this post we have posted some notes on CS8391 DATA STRUCTURES of PROFESSIONAL CORE for ANNA UNIVERSITY AFFILIATED COLLEGES STUDENTS.
Here We have listed the the notes whichever we could collect for HS8151 COMMUNICATIVE ENGLISH subject, We think that it will be helpful for your exam preparation.

#### OBJECTIVES:

ðŸ‘‰ 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

#### UNIT I LINEAR DATA STRUCTURES â€“ LIST

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

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

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

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

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.

#### OUTCOMES:

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

#### TEXT BOOKS:

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:

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 DATA STRUCTURES NOTES

If you have any queries or comments on this post, kindly contact us through contact form or telegram