You are on page 1of 4

CS702 – Algorithm Analysis and Design

MidTerm Fall 2015 - Paper Question with Answers


By: Asif Mansoor
Q1: Algorithm to Closest Pair in 2-D using Divide and Conquer

Q2. Pseudo code of n line assembly


Q3. Print station n line assembly

Q4. From asymptotic notation prove theta function [n2 + 5n + 7 = Theta (n2)
Q5:. Algorithm of chain matrix multiplication

Q6: Complete dynamic algorithm for 0-1 knapsack problem


Q7: Brute force algorithm for 0-1 knapsack problem

You might also like