CS8391 - Data strucures important questions for Semester Examination

NBA ACCREDITED

CS8391-Data Structures (R 2017)

IMPORTANT QUESTIONS FOR SEMESTER EXAMINATIONS NOV/DEC 2019

UNIT I

      1.       State the polynomial representation for 6x³+9x²+7x+1 using linked list. Write procedure to add 
             and multiply two polynomial and explain with suitable example

      2.       Operations on array

      3.       Implementation of Singly linked list’. Consider all cases

      4.       Doubly Linked List – All operations 
      5.         Circular Linked List- all operation
                                                                UNIT II

      1.       Array and list implementation of stack

      2.       Array and List implementation of Queue

      3.       Expression conversion(infix, prefix, postfix) / convert the infix expression to postfix expression  
              and steps involved in evaluating the postfix expression,  ( Problems)

      4.       Circular Queue, DEqueue, priority Queue – array and list implementation

UNIT III

1.    Tree traversals ( Inorder, preorder, post order) / Problems

2.    Expression Tree – Theory + Problems

3.    operations on a binary search tree – all operation and algorithms

4.    Binary tree –all operations and algorithms

5.    AVL trees and rotations + problems

6.    B Tree  + problems

7.    B+ Tree + Problems

8.    Min heap and Max Heap + Problems and algorithms

UNIT IV

1.       Breath First Search algorithm + problems

2.       Depth first search algorithm + problems

3.       Topological Sorting algorithm + problems

4.       Bi connectivity, Euler Circuits,

5.       Graph representation

6.       Types of Graphs

UNIT V

          1.       Linear Search algorithm + Problem

          2.       Binary Search algorithm + Problem

          3.       Bubble sort - Selection sort - Insertion sort - Shell sort – Radix sort. Algorithms and problems

          4.       Hashing – Types of Hashing functions

          5.       Collision Resolving Techniques ( Open addressing/Closed Hashing, separate 
                  chaining)/Problems

          6.       Rehashing

          7.       Extendible Hashing