ANNA UNIVERSITY, CHENNAI

QUESTION BANK for (PGCSE 2013) ME(CSE) 2013 Re !"#$%o&

CP'102 A(VANCE( (ATA STRUCTURE AN( A)GORITHMS

UNIT I * ITERATIVE AN( RECURSIVE A)GORITHMS

2MARKS 1. Differentiate Sequence of actions vs sequence of assertions. 2. Requirement of iterative algorithm 3. Running time for selection, insertion, bubble sort and binary search 4. Define typical error . !ree of stac" frame #ith e$ample %. Strong &nduction '. Differentiate friend recursion vs iterations (. Running time for quic" sort, merge sort, and )eap Sort *. +rite a recursive program to find the ,-D of t#o numbers. 1.. Define /c"ermann0s 1unction 11. +rite recursion on trees 12. +rite the algorithm for number of nodes in a binary tree. 13. Define )eapify 14. Define the algorithm for the derivative +M#r, 1. Steps to develop an iterative algorithm 23$ample4 1ind 5/6 t#o finger algorithm7 2. Different types of iterative algorithm 2Selection Sort, &nsertion, 8 9ubble Sort7 3. !o#ers of )anoi. 4. :perations of integers . !ree !raversal %. Representing 3$pression #ith tree 1-M#r, 1. Sorting and Selecting /lgorithm 2. )eap Sort and ;riority <ueue

UNIT II OPTIMISATION A)GORITHMS 2 MARKS 1. 2. 3. 4. . %. '. (. *. Define :ptimi=ation problem given an e$ample. Reachability ;roblem 3stimate the running time of Di>is"tra0s Shortest ;ath 3dge -lassification of 3dges Define punning paths. Define D/,. 3stimate the running time of D/, /lgorithm ;runing 9ranch ,iven an algorithm for solving the mincut problem Running time of ( <ueen0s /lgorithm

+ MARKS 1. ,eneric Search /lgorithm 2. Steps to developing a recursive bac"trac"ing23$.(?<ueen0s, Sudo"u7 3. Satistiability 3$plain2Davis?;utnam /lgorithm7 1- MARKS 1. 91S, D1S, Di>i"stra0s Shortest ;ath /lgorithm #ith e$ample. 2. @et#or" 1lo# 8 Ainear ;rogramming 3. Recursive bac"trac"ing algorithm

UNIT III (YNAMIC PROGRAMMING A)GORITHMS

2 MARKS 1. Define Recursive 9ac"trac"ing. 2. Define Dynamic ;rogramming 3. Define Subtle ;oints 4. Differeniate Sub?instance vs sub solutions. . !ime 8 Space Requirements of little bird algorithm %. ,ive the code for printing neatly '. Define Reduction (. -&R?S/! problem definition *. ,raph 3 -oloring ;roblem 1.. !hree 5odels of Randomi=ed /lgorithm 11. 1ermat0s Aittle !heorem 12. 5/6-B! ;roblem + MARKS 1. Developing a question for the little bird

2. 3. 4. .

Developing a dynamic programming algorithm Subtle ;oints -ircuit Satistiability ;roblem Steps the prove @;?-ompleteness 8 3? -oloring is @; -omplete

1- MARKS 1. 9ipariate matching using the net#or" flo# algorithm 2. Randomi=ed algorithm

UNIT IV SHARE( OB.ECTS AN( CONCURRENT OB.ECTS

2 MARKS 1. 2. 3. 4. . %. '. (. Define threads. Shared -ounter #ith e$ample 5utual 3$clusion and ;roperties Starvation C freedom /mdahl0s la# #ith e$ample !imestamp -orrectness point2safety, liveness7 -ritical Solution

+ MARKS 1. 2. 3. 4. . %. '. ;roperties of mutual e$clusion ;roducer?consumer problem Reader?#riter problem Aampor0s ba"ery /lgorithm Aoc" /lgorithm22 threads solution7 Dava code to implement the timestamp interface Dava 5emory 5odel

UNIT V CONCURRENT (ATA STRUCTURES

2 MARKS 1. 2. 3. 4. . Aoc" free e$change Sequential 9ottlenec" Stac"E!F -lass Aa=y Aist /lgorithm Dual Data structure

+ MARKS

1. Design an unbounded loc" based stac"E!F implementation based on a lin"ed list 2bounded using an array7. 2. Ain"ed Aist is -oncurrent Data Structure. 3. 5emory Reclamation and the /9/ ;roblem 4. 1ine ,rained, -oarse ,rained . ;rove that Sequential consistency is non?bloc"ing requirement