We are proud to announce the launch of the new brand of sharecodepoint.


Like Us Fanpage




Thursday, 10 August 2017

CSE408 : Design And Analysis of Algorithms CA Test 2 | Class Test | Continuous Assessment (CA) | Academic Task 2 | LPU


SET A

Q1. What is Knapsack problem, explain solution using brute force approach and using same, solve for the given data set.  Consider knapsack capacity as 9.

Item
Weight
Value
1
5
50
2
3
60
3
7
90
4
6
70






Q2. Write and Explain Quick sort Algorithm.

Q3. Given an array of 6 elements: 15, 19, 10, 7, 17, 16, sort it in ascending order using heap sort and analyse heap sort.

SET B

Q1. Write and Explain Merge sort algorithm.

Q2. Using Count Sort, sort the following array


           
Q3. Write equations for large integer multiplication method, and using same Multiply 1543 and 1621.

0 comments:

Post a Comment

 

ShareCodePoint : Version 17.0.8 - 2016 - 2018 - © Sachin Yadav Production Made in India.