Reg 2017
Reg 2017
Reg 2017
Third/Sixth/Seventh/Eighth Semester
(Regulations 2017)
2. What is the benefit of circularly linked list over singly linked list in search
applications?
3. What are the necessary conditions for insertion and deletion operations on
static Stack?
11. (a) Write procedures or pseudo codes for the following operations on circular
linked lists:
(i) insertion. (4)
(ii) deletion. (5)
(iii) count. (4)
Or
(b) Implement the polynomial addition using singly linked list. Have
procedures for insertion, comparison and addition of node values of this
polynomial application. (4+5+4)
12. (a) Write procedures for significant operations on a Stack data structure.
Apply stack, to convert the following infix expression to the
corresponding postfix expression: a + b / (d - e) – f. (9+4)
Or
(b) Write procedures for significant operations on a Queue data structure.
List any four applications of queue data structure. (9+4)
Or
(b) (i) Illustrate the construction procedure of Expression trees with
suitable example. (8)
(ii) Distinguish between binary trees and threaded binary tree. (5)
14. (a) (i) Give the graph traversal procedures for DFS and BFS. (9)
(ii) Give the order of traversing the nodes of the graph given in figure:
Q.14(a), when DFS and BFS are applied on the same. (4)
Figure. Q.14(a)
Or
2 40388
(b) (i) What are Eulerian circuits and Eulerian paths? (4)
(ii) Give the procedure to determine Euler circuit. (5)
(iii) Does the figure: Q.14(b) has Euler circuit(s)? (2)
(iv) Does it have any Euler path. If so, list. (2)
Figure. Q.14(b)
15. (a) (i) Illustrate the linear search algorithm with suitable example. (6)
(ii) Trace the working of insertion sod algorithm on an unordered
dataset of size. (7)
Or
(b) Explain the various collision resolution strategies followed in hashing
techniques. (13)
PART C — (1 × 15 = 15 marks)
Or
(b) Consider the following problem scenario:
In recording scores for a golf tournament, we enter the name and score of
the player as the player finishes. This information is to be retrieved in
each of the following ways:
* Scores and names can be printed in order by ascending or by
descending scores.
* Given the name of a player, other players with the same score can
be printed.
Give procedures by using the doubly linked list data structure, for
implementing a solution for the problem. (8+7)
—————————
3 40388
*X10312* Reg. No. :
4. Brief about the generalized version of Queue. And list the operations performed
by it.
11. a) i) Given two sorted Linked lists L1 and L2. Exemplify and write the
functions to compute L1 ∩ L2 and L1 ∪ L2. (10)
ii) State the advantages of Linked list over arrays. Specify any two real
time applications of Linked list. (3)
(OR)
12. a) What are circular queues ? Write an algorithm to insert an element and delete
an element from a circular queue. And list the applications of queue. (13)
(OR)
b) i) Write a C program to implement a LIFO list that grows and shrinks
dynamically. (7)
ii) Convert the following Infix expression to Postfix expression.
(4 + 8)* (6 – 5)/((3 – 2)* (2 + 2)) (3)
iii) Find the value of the following postfix expression. Show stack contents-step
by step output.
54 6 + 7 4 – * 9 / 35 15 + + (3)
13. a) i) Write C functions to perform deletion in Binary search tree (Include all
the cases). (5)
ii) Construct a binary search tree for the values 45, 56, 39, 12, 34, 32, 10,
78, 67, 89, 91. Give the pre order and post order traversal of the resultant
binary search tree. (6+2)
(OR)
b) Construct B tree to insert the following key elements with order 5.
2, 14, 12, 4, 22, 8, 16, 26, 20, 10, 38, 18, 36, 48, 6, 24, 28, 40, 42, 32 (13)
*X10312* -3- X 10312
ii) Find the Euler’s path and Euler’s circuit for the graph given below. (7)
(OR)
b) Consider the following graph, in what order will the nodes be visited using
Breadth first search and Depth first search, and give the routine for same. (13)
ii) Give the routine for Insertion sort. Sort the following sequence using
insertion sort 3, 10, 4, 2, 8, 6, 5, 1. (6)
b) Consider a hash table with 9 slots. The hash function is h(k) = k mod 9. The
following keys are inserted in the order 15, 38, 8, 5, 20, 33, 14, 30. Draw the
contents of the hash table when the collisions are resolved by
i) Chaining
iii) Double hashing. The second hash function h2(x) = 7 – (x mod 7). (13)
(OR)
_______________________
Download STUCOR App for all subject Notes & QP's
P
AP
R
O
UC
ST
Access 3,000+ Study Materials for Semester Exams via STUCOR App
P
AP
R
O
UC
ST
Download STUCOR App for all subject Notes & QP's
P
AP
R
O
UC
ST
Access 3,000+ Study Materials for Semester Exams via STUCOR App
P
AP
R
O
UC
ST
Download STUCOR App for all subject Notes & QP's
P
AP
R
O
UC
ST
Access 3,000+ Study Materials for Semester Exams via STUCOR App
P
AP
R
O
UC
ST