Jan / Feb 2016 15ECSC701

USN

I Semester M.Tech Examination

(Computer Science & Engineering)
Data Structures and Algorithms (15ECSC701)
Duration: 3 hours Max. Marks: 100
Note: i) Part-A and Part-B are compulsory. Answer any one Question from Part-C.
ii) Missing data may be suitably assumed wherever necessary with justification.

PART-A

1 Consider the insertion of items with following keys into an initially empty B-tree of
order 5.
[ 30, 40, 24, 58,48,26,11,13]
Draw the final tree that results from deleting 40 and 11 keys. (05 marks)

2 Explain the HBLT binary tree with an example. (05 marks)

3 Construct the binary tree, using following inorder & preorder traversals of that
binary tree.
Inorder : 20,7,30,10,31,22,52
Preorder : 10,20,30,7,22,31,52 (05 marks)
4 Write the steps to insert an item in Red and Black tree. Explain the operation with an
example. (05 marks)
5 Describe the salient features of Branch and bound algorithmic technique. Give three
applications. (05 marks)
6 Consider the following recurrence equation, defining a function T(n)
1 0
2 1
Show that T(n) = 2n. (05 marks)

PART-B

7 Mr. Ram has an algorithm Find2D to find an element X in an nXn array A. The
algorithm Find2D iterates over the rows of A and calls the algorithm ArrayFind to
search X in that respective row of A. Find2D iterates until X is found or it has
searched all rows of A.
Write the algorithm and what is the worst case running time of Find2D in terms of
n? (10 marks)

Page 1
8 Mr. Sham loves foreign languages and wants to plan his course schedule to take the
following nine languages : LA15, LA16, LA22, LA31, LA32, LA126, LA127,
A141, LA169. The course prerequisites are:
LA15: (none) LA22: (none) LA32:LA16, LA31 LA127 : LA16
LA16: LA15 LA31: LA15 LA126: LA22, LA32 LA141 : LA22, LA16
LA169 : LA32.
Use appropriate data structure to represent the scenario and find sequence of
courses that allows Mr. Sham to satisfy all the prerequisites. (10 marks)

9 Explain the performance of heap sort algorithm and sort the following input list
using the algorithm in increasing order.
[ 2, 5, 16, 4, 10, 23) (10 marks)

10 Consider the 0/1 knapsack problem with no. of items n=4, the profit list of items
P=[4,3,2,1], the weight list w=[1,2,3,4] and the maximum capacity of bag C=6.
Draw the solution space tree using backtracking technique. (10 marks)

11 How to analyze the recursive and non recursive algorithms? Algorithm A uses
10n log n operations, while algorithm B uses n2operations. Determine the value of
n0 such that A is better than B for n≥ n0. (10 marks)

PART-C

12 Briefly Explain insert and delete operations in AVL tree. Give example for each
operation.
Prof. Bhatacharya claims that the order in which the a fixed set of elements is
inserted into AVL tree does not matter, the same tree results every time. Give one
example that proves Prof. Bhatacharya is wrong. Justify your answer. (20 marks)

13 Describe the features of dynamic programming.

Suppose the ISRO wants to link n stations spread out over the solar system using
free space optical communication, which the technology that involves shooting
lasers through space between pairs of stations to facilitate communication.
Naturally the energy needed to connect two stations in this way depends on the
distance between them, with some connection requiring more energy than others.
Therefore, each pair of stations has different known energy that is needed to allow
this pair of stations to communicate. ISRO want to connect all these stations
together using minimum amount of energy possible, Draw the graph to represent
this application and write an algorithm of order O(n2) for constructing such
communication network. (20 marks)

Page 2
Department: Sem: IV Sub-Name: Sub-Code: Faculty
Name:
Q.No Blooms Learning Course Learning a-k Criteria PI codes Marks
Levels (LL) Objectives(CLO’s)
1: a
b
c
2: a
b
c
3: a
b
c
4: a
b
c
5: a
b
c
6: a
b
c
7: a
b
c
8: a
b

K.L.E Society’s
Page 3
 B.V.Bhomaraddi College of Engineering & Technology, Hubli-580 031

Examination Section
Semester End Examination Question Paper Review
Set I / Set II / Set III/ External
(Strike off the not Applicable one)
Programme: Course: Course Code:
Duration: Hrs Semester:
Self Review Expert
Criterion (Yes/No/NA/ Review
Number (Yes/No/NA/
Number
1] Whether the following details are mentioned correctly on YES
the
Header of the question paper (Exam month and year etc
up to instructions)?
2] Whether the question paper covers the entire syllabus YES
(unit wise) as announced in the scheme of SEE at the end
of prescribed syllabus for this course?
3] Whether the pattern of question paper is in accordance YES
with the model question paper?
4] Whether marks distribution is proper for all the questions YES
and sub questions?
5] Whether the question paper has all the required data and YES
figures? If figures exist, mention the number of figures in
the paper.
6] Mention the time required for an average student to 180 MNS
answer this paper (in minutes)
7] How many corrections you have made in the print copy of NIL
the question paper (typographical errors etc)?
8] Whether the scheme is ready along with the paper? YES
9] Whether the scheme contains marks splitting along with YES
points?
10] a) How many numerical problems are there in the
question paper?
b) How many worked out solutions exist in the scheme?
11] Is the Softcopy previewed for printing & verified for YES
corrections?
12] Would you like to do modifications to any of the NA *Yes/No
questions? (only for reviewer)
Reviewer’s Signature
Reviewer’s
Name
Date of Review

*If Yes please fill in the details on the reverse page

Page 4
 To,
The Controller of Examinations
B.V.B College of Engineering & Technology, Hubli.

Sir,

After scrutinizing I Recommend No/ The Following (Strike out not applicable)
corrections for this paper. The details are as follows:

Department:__________________________ Course-
_____________________
Paper Code:___________________________ Course
Code:________________

Correction Unit Question & Existing Question Suggested Change Reasons for Change
No No Sub Questions

Date:______________ Signature of Scrutinizer

Scrutinizer:_____________
Name of the Scrutinizer:_

Page 5