Scribd
Upload
705 views2 pages

Algorithms & Complexity Analysis Guide

The document outlines the topics covered in 5 units of a course on Design and Analysis of Algorithms (DAA). Unit I discusses time and space complexity analysis including asymptotic notations. It provides examples of recursive and non-recursive algorithms for problems like finding maximum/minimum, Fibonacci sequence, quicksort, and divide-and-conquer algorithms. Unit II covers greedy algorithms for single source shortest path problem and knapsack problem. It also discusses minimum spanning trees and Prim's algorithm. Unit III introduces dynamic programming and provides examples of problems like optimal binary search trees, multistage graphs, traveling salesman problem, and knapsack. Unit IV is about backtracking and

Uploaded by

jay
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
705 views2 pages

Algorithms & Complexity Analysis Guide

The document outlines the topics covered in 5 units of a course on Design and Analysis of Algorithms (DAA). Unit I discusses time and space complexity analysis including asymptotic notations. It provides examples of recursive and non-recursive algorithms for problems like finding maximum/minimum, Fibonacci sequence, quicksort, and divide-and-conquer algorithms. Unit II covers greedy algorithms for single source shortest path problem and knapsack problem. It also discusses minimum spanning trees and Prim's algorithm. Unit III introduces dynamic programming and provides examples of problems like optimal binary search trees, multistage graphs, traveling salesman problem, and knapsack. Unit IV is about backtracking and

Uploaded by

jay
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

DAA

UNIT-I

Time complexity and space complexity


Asymptotic notations used for describing the complexity
Explain recursive algorithms with example.
Explain Stassen’s matrix multiplication
Examples like:
Algorithm for finding maximum and minimum. Also analyze its time complexity.
Non-Recursive algorithm for finding the Fibonacci sequence and derive its time complexity
Algorithm for quick sort and calculate its time complexity
Design a divide-and-conquer algorithm for finding the minimum and the maximum element of n
number using no more than 3n/2 comparisons
Algorithm to search an item in a linear list. Calculate the running time if there are ‘n ‘elements in
list
Find the maximum and minimum in a set of ‘n’ elements using DAC. Also find the recurrence
relation for the number of elements compared
Write an algorithm for merge sort. Sort 62, 71, 88, 93, 12, 14 by using above sorting method.

UNIT-II

What is single source shortest path problem? Suggest the greedy algorithm to find shortest paths
from the designated vertex start to all of the vertices in a connected weighted, n vertex graph
Explain the procedure to formulate greedy procedure for knapsack problem. Also explain with an
example.
What is spanning tree?
Prim’s algorithm for finding the minimum spanning tree of a graph. Using the algorithm find the
minimum spanning tree of the given graph
Optimal storage on tapes technique using greedy method

UNIT-III

Describe dynamic programming method.


How dynamic programming can be used to solve optimal binary search trees?
Pseudo code of the dynamic programming algorithm for solving optimal binary search tree and
determine its time and space efficiencies
Explain Multistage graphs problem using dynamic programming with an example. Analyze its
time complexity
What is the difference between Greedy & Dynamic Programming?
Explain Traveling sales person problem with an example. give its time complexity
Write the algorithm to compute the 0/1 knapsack problem using dynamic programming and
explain it
With a suitable example, explain all pair’s shortest paths problem
Find an optimal solution to the knapsack instance n = 7, m= 15 (p1,p2, p3, ….p7) =(10, 5, 15, 7,
6, 18, 3) and (w1, w2, w3, ... w7) (2,3, 5, 7, 1, 4, 1)
UNIT-IV

Explain the properties of strongly connected components


What is a Bi-connected component? Write a scheme to construct a Bi-connected graph
Solve the 4-queens problem using backtracking
How does backtracking work on the 8 Queens problem with suitable example?
Explain the sum-of-subsets problem with an example.
Explain briefly graph coloring problem using Back tracking method
Apply backtracking to solve the 3 coloring problem for the given graph
Write an algorithm for generation of next color in M-coloring problem
What is Hamiltonian problem? Explain with an example using backtracking.

UNIT-V

What is Branch and Bound? Explain its control abstraction. Explain how these bounds are useful
in Branch and Bound methods.
Explain briefly the general method of Branch and Bound.
Draw the portion of state space tree generated by LC branch and bound for the following
instances. N=4, m=15, (p1,p2,p3, p4)= (10,10,12,18) (w1,w2,w3,w4)=(2,4,6,9).
With an example, explain how the branch-and-bound technique is used to solve Travelling
salesman problem.
Explain briefly the concept of evaluation and interpolation with examples.
Write an algorithm for Lagrange interpolation.
Write an algorithm for Newtonian interpolation.

You might also like