Download Previous Year CS2251 Design And Analysis of Algorithms

Subject Code: CS2251

Subject Name: Design And Analysis Of Algorithms

Semster: Fourth

Department : CSE ( Computer Science)

Type: Question Paper

Year: 2010

Regulation:2008/2010/2012

 
CS 2251 DESIGN AND ANALYSIS OF ALGORITHMS Syllabus

UNIT I
Algorithm Analysis – Time Space Tradeoff – Asymptotic Notations – Conditional
asymptotic notation – Removing condition from the conditional asymptotic notation -
Properties of big-Oh notation – Recurrence equations – Solving recurrence equations –
Analysis of linear search.
UNIT II
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: General Method – Multistage Graphs – All-Pair shortest paths –
Optimal binary search trees – 0/1 Knapsack – Travelling salesperson problem .
UNIT IV
Backtracking: General Method – 8 Queens problem – sum of subsets – graph coloring –
Hamiltonian problem – knapsack problem.
UNIT V
Graph Traversals – Connected Components – Spanning Trees – Biconnected
components – Branch and Bound: General Methods (FIFO & LC) – 0/1 Knapsack
problem – Introduction to NP-Hard and NP-Completeness.

Download: CS 2251 DESIGN AND ANALYSIS OF ALGORITHMS Question papers

• CS 2251 DESIGN AND ANALYSIS OF ALGORITHMS Nov/Dec 2011 Question paper

• CS 2251 DESIGN AND ANALYSIS OF ALGORITHMS April/ May 2011 Question paper

• CS 2251 DESIGN AND ANALYSIS OF ALGORITHMS Nov/ Dec 2010 Question paper

• CS 2251 DESIGN AND ANALYSIS OF ALGORITHMS April/May 2010 Question paper

Tweet