Previous year question paper for ADA (B-TECH Computer Science Engineering 6th)

Analysis & Design of Algorithms

Previous year question paper with solutions for Analysis & Design of Algorithms from 2011 to 2018

Our website provides solved previous year question paper for Analysis & Design of Algorithms from 2011 to 2018. Doing preparation from the previous year question paper helps you to get good marks in exams. From our ADA question paper bank, students can download solved previous year question paper. The solutions to these previous year question paper are very easy to understand.

Section-A

Brief Review of Graphs, Sets and disjoint sets, union, sorting and searching algorithms and their analysis in terms of space and time

complexity.

Divide and Conquer: General method, binary search, merge sort, qick sort, selection sort, Strassenâ€Ÿs matrix multiplication

algorithms and analysis of algorithms for these problems.

Section-B

Greedy Method: General method, knapsack problem, job sequencing with dead lines, minimum spanning trees, single souce paths

and analysis of these problems.

Dynamic Programming: General method, optimal binary search trees, O/I knapsack, the traveling salesperson problem.

Section-C

Unit-5: Back Tracking: General method, 8 queenâ€Ÿs problem, graph colouring, Hamiltonian cycles, analysis of these problems.

Unit-6: Branch and Bound: Method, O/I knapsack and traveling salesperson problem, efficiency considerations. Techniques for

algebraic problems, some lower bounds on parallel computations.

Section-D

Unit-7: NP Hard and NP Complete Problems: Basic concepts, Cookâ€Ÿs theorem, NP hard graph and NP scheduling problems some

simplified NP hard problems.

2018
2017
2016
2014
2013
2012
2011