Scribd
Upload
38 views2 pages

14.model Question

Uploaded by

sindhusrrcetsoftware
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
Download as doc, pdf, or txt
38 views2 pages

14.model Question

Uploaded by

sindhusrrcetsoftware
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
Download as doc, pdf, or txt
Download as doc, pdf, or txt
You are on page 1/ 2

SRI RAAJA RAAJAN COLLEGE OF ENGINEERING AND TECHNOLOGY

AMARAVATHIPUTHUR, KARAIKUDI
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
MODEL EXAM
CS8391-DATA STRUCTURES
BRANCH : B.E
YEAR & SEMESTER: II/III Total Marks : 100

PART-A (10*2=20)

1. State the advantage of ADT.


2. What are the disadvantages of linked list array.
3. What are the application of stacks list?
4. What is priority queue? What are the ways to implement priority queue?
5. Draw a tree to list the sibilings for node and compute the height.
6. Show the result of in order traversal of the binary search tree.
7. What are the representation of the graphs?
8. Define Euler circuits.
9. What are the advantage and disadvantage of separate chaining and linear probing?
10. State the complexity of binary search.

PART-B (13*5=65)
11. a.i) State the polynomial representation for 6x3+9x2+7x+1 using linked list. Write procedure to
add and multiply two polynomial and explain with suitable example.(7)
ii) What are the ways to insert a node in linked list? Write an algorithm for inserting a
node before a given node in a linked list.(6)
OR
b.(i) What are the various operations on array? Write a procedure to insert an element in the middle
of the array.(7)
ii) Write a procedure to deleting the last node from a circular linked list.(6)
12. a) Write the procedure to convert the infix expression to postfix expression and steps involved
in evaluating the postfix expression. Convert the expression A-(B/C+D%E*F)/G*H To Postfix
Form .Evaluate the give postfix expression 9 3 4*8+4/-.
OR
b) What are circular queues . Write the procedure to insert an element to circular queue and
delete an element to an circular queue using array implementation.
13.a)Write the following routines to implement the basic binary search tree operations.
(i) Perform search operation in binary search tree.
(ii) Find_min and Find_max.
OR
(b) Distinguish between B tree and B+ tree. Create a B tree of order 5 by inserting the
following elements : 3,14,7,1,8,5,11,17,13,6,23,12,20,26,4,16,18,24,25 and 19.
14.a)Distinguish between breadth first search and depth first search with example.
OR
b) State and explain topological sort with suitable example.
15.a)i) State and explain the shell sort. State and explain the algorithm for shell sort. Sort the
elements using shell sorty.
(ii) Explain open Addressing in detail.
OR
b)i)Distinguish between linear search and binary search. State and explain the algorithms for both
the search with example.
ii) Explain Rehashing and extendible hashing.
PART- C(10*15=15)
16.a) What are expression trees. Write the procedure for construction an expression tree.
OR
b) Given input {4371,1323,6173,4199,4344,9679,1989) and a hash function h(x)=x(mod 10), show the
resulting.
(i)Open hash table
(ii)Closed hash table using linear probing.
(iii)Closed hash table using quadratic probing.
(iv)Closed
*********ALL THE BEST**********

You might also like