Register Number: _____________________

DHANALAKSHMI SRINIVASAN ENGINEERING COLLEGE

PERAMBALUR - 621212
MODEL EXAM
Department of Computer Science and Engineering
CP7102/ADVANCED DATA STRUCTURES AND ALGORITHMS
Year & Semester: I & I
Duration: 3 Hours

Date: 14-12- 2016

Total Marks: 100

Answer ALL Questions

01
02
03
04
05
06
07
08
09
10
11

12

13

14

Part A: 10 X 2 = 20 Marks
How to prove correctness of each step and an algorithm?
Write down the recurrence relation for Ackermanns function.
What are the ingredients of Optimization problem?
Define local and global maximum.
How sub instances are created in dynamic programming?
What do you mean by halting problem`?
Compare monte carlo and las vegas algorithms.
Define mutual exclusion. Give appropriate example.
What is lazy shynchronization?
What is the role of locking in synchronization?
Part B: 5 X 13 = 65 Marks
a i Narrate the steps to develop an iterative algorithm.
ii Write a Pre and Post conditions, checklist and recursive algorithm for Towers of
Hanoi problem.
(or)
b i Explain about representing expression with trees
ii Develop a step to find a number of nodes in a binary tree using recursive algorithm
a
Using Breath First Search and Optimization techniques solve the shortest path
problem.
(or)
b
Discuss about Primal-Dual Hill climbing method
a
What do you mean by question of the little bird? What are the local and global
considerations in it? Also narrate about repeated questions and reversing the order.
(or)
b
What is the smallest cut in the graph? Write an algorithm to compute the minimal
cut in the graph.
a
Explain lamports bakery algorithm in detail with respect to deadlocks.
(or)

b
What is the role of semaphores in solving producer consumer problem? Explain.
15 a i Describe the data structures and code used for concurrent queues
ii Compare coarse grained and fine grained synchronization
(or)
b i State ABA problem.Explain the solution with an example.
ii Design an unbounded lock-based stack on a linked list
Part C: 1 X 15 = 15 Marks
16 a
Dynamic programming algorithm is fast only if the given instance does not have
many sub instances justify and prove this statement
(or)
b
Consider a bipartite graph G= (V,E) with bipartition (A,B): V= AU B. assume
that, for some vertex sets A1 belong to A and B1 belong to B , there exists a
matching MA covering all vertices in A1 and a matching MB covering all vertices
in B1 prove that there always exits a matching covering all vertices in A1 U B1.

2
2
2
2
2
2
2
2
2
2

CO1
CO1
CO2
CO2
CO4
CO4
CO6
CO8
CO7
CO8

K1
K1
K1
K1
K1
K1
K1
K1
K1
K2

7
6

CO1
CO1

K1
K1

7
6
13

CO1
CO1
CO2

K1
K1
K2

13
13

CO4
CO4

K1
K1

13

CO5

K1

13

CO6

K2

13
7
6

CO7
CO8
CO8

K2
K1
K2

7
6

CO7
CO8

K1
K1

15

CO4

K3

15

CO6

K3