Welcome to Scribd. Sign in or start your free trial to enjoy unlimited e-books, audiobooks & documents.Find out more
P. 1
DAA

DAA

Ratings: (0)|Views: 153|Likes:
Published by prashant-mitba-9004

More info:

Published by: prashant-mitba-9004 on May 19, 2012
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

04/08/2014

pdf

text

original

 
CS1252-DAA
 
2
CS1252
DESIGN AND ANALYSIS OF ALGORITHMS
3 1 0 4
UNIT I ALGORITHM ANALYSIS 9
Algorithm analysis
 – 
Time space tradeoff 
 – 
Asymptotic notations
 – 
Conditional asymptoticnotation
 – 
Removing condition from the conditional asymptotic notation
 – 
Properties of Big-oh notation
 – 
Recurrence equations
 – 
Solving recurrence equations
 – 
Analysis of linearsearch.
UNIT II DIVIDE AND CONQUER, GREEDY METHOD 9
Divide and conquer
 – 
General method
 – 
Binary search
 – 
Finding maximum and minimum
 – 
Merge sort
 – 
Greedy algorithms
 – 
General method
 – 
Container loading
 – 
Knapsack problem.
UNIT III DYNAMIC PROGRAMMING 9
Dynamic programming
 – 
General method
 – 
Multistage graphs
 – 
All-pair shortest paths
 – 
 Optimal binary search trees
 – 
0/1 Knapsack 
 – 
Traveling salesperson problem.
UNIT IV BACKTRACKING 9
Backtracking
 – 
General method
 – 
8 Queens Problem
 – 
Sum of subsets
 – 
Graph coloring
 – 
 Hamiltonian problem
 – 
Knapsack problem
UNIT V TRAVERSALS, BRANCH AND BOUND 9
Graph traversals
 – 
Connected components
 – 
Spanning trees
 – 
Biconnected components
 – 
 Branch and Bound
 – 
General methods (FIFO and LC)
 – 
0/1 Knapsack problem
 – 
 Introduction to NP-hard and NP-completeness.
L: 45 T: 15 Total: 60
 
TEXT BOOKS
1. Ellis Horowitz, Sartaj Sahni and Sanguthevar Rajasekara
n, ―Computer Algorithms/C++‖, 2nd Edition, Universities Press, 2007.
 2.
Easwarakumar, K.S., ―Object Oriented Data Structures Using C++‖, Vikas
Publishing House, 2000.
REFERENCES
1.
Cormen, T.H., Leiserson, C.E., Rivest, R.L. and Stein, C., ―Introducti
on to
Algorithms‖, 2nd Edition, Prentice Hall of India Pvt. Ltd, 2003.
 2.
Aho, A.V., Hopcroft J.E. and Ullman, J.D., ―The Design and Analysis of Computer Algorithms‖, Pearson Education, 1999.
 3.
Sara Baase and Allen Van Gelder, ―Computer Algorithms, Int
roduction to Design
and Analysis‖, 3rd Edition, Pearson Education, 2009.
 
 
CS1252-DAA
 
3
Contents:S.No. Contents Page No.UNIT
 – 
I - Introduction
1.1 Introduction 51.2 Fundamentals of Analysis of Algorithm 61.2.1 Analysis of Framework 61.2.2 Measuring an input size 61.2.3 Units for measuring runtime 71.2.4 Worst case, Best case and Average case 71.2.5 Asymptotic Notations 101.3 An Example 151.4 Analysis of Linear Search 19Questions 22
Total Hours 9UNIT
 – 
II
 – 
Divide and Conquer, Greedy Method
 2.1 Divide and Conquer232.2 General Method
 – 
Divide and Conquer242.2.1 Master theorem 242.2.2 Efficiency of Merge sort 272.3 Binary Search 282.3.1 Efficiency of Binary Search 302.4 Greedy Techniques 322.5 General Method
 – 
Greedy Method 322.5.1
Prim‘s Algorithm
322.6 Container Loading 342.6.1 Algorithm for Container Loading 372.7 Knapsack Problem 37Questions 39
Total Hours 9UNIT
 – 
III
 – 
Dynamic Programming
 3.1Introduction413.2 General Method
 – 
Dynamic Programming 413.2.1 Pseudo code for Binomial Coefficient 413.3 Multistage Graphs 423.3.1
Pseudo code for Floyd‘s Algorithm
433.4 Optimal Binary Search trees 453.5 0/1 Knapsack Problem 493.6 Traveling Salesman Problem 50Questions 53
Total Hours 9UNIT
 – 
IV - Backtracking
4.1 Backtracking 554.1.1 General Method
 – 
Backtracking 554.1.2 State-Space tree 55
 
CS1252-DAA
 
4
4.2 N-queens Problem 554.3 Subset- Sum problem 574.3.1 Pseudo code for Backtracking Algorithms 584.4 Graph Coloring 594.5 Hamiltonian circuit problem 614.6 Knapsack Problem 63Questions 65
Total Hours 9UNIT
 – 
V
 – 
Traversals, Branch & Bound
5.1 Graph Traversals, BFS
 
665.1.1 BFS Forest 665.1.2 Efficiency 675.1.3 Ordering of Vertices 675.1.4 Application of BFS 675.2 DFS
 
675.2.1 DFS Forest 685.2.2 DFS Algorithm 695.1.3 Application of DFS 705.3 Connected Component
 
705.3.1 Biconnected Components 715.4 Spanning Trees
 
735.4.1
Prim‘s Algorithm
735.4.2
Kruskal‘s Alg
orithm 765.5 Branch & Bound
 
785.6 General Methods
 – 
FIFO & LC
 
795.7 Knapsack Problem
 
855.8 NP Hard & NP Completeness 86Questions 88
Total Hours 9

Activity (5)

You've already reviewed this. Edit your review.
1 thousand reads
1 hundred reads
jaavee liked this
jaavee liked this

You're Reading a Free Preview

Download
scribd
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->