CS8391 Data Structures Previous Year Question Paper

CS8391 Data Structures Previous Year Question Paper

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.



CS8391 Data Structures Previous Year Question Paper Regulation 2013 question paper

CS8391 Data Structures Nov/Dec 2018 Question Paper

Leave a Reply

avatar
  Subscribe  
Notify of