Documente Academic
Documente Profesional
Documente Cultură
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
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
+ 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
+ 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