Scribd
Upload
18 views2 pages

Question Bank

The document is a question bank for an internal assessment in Analysis and Algorithm (CSC 402). It includes questions on asymptotic notations, complexity classes (P, NP, NP-Hard, NP-Complete), sorting algorithms (insertion sort, quick sort, merge sort), divide and conquer strategies, greedy algorithms, minimum spanning trees, and shortest path algorithms. Additionally, it covers job sequencing with deadlines for maximum profit.

Uploaded by

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

Question Bank

The document is a question bank for an internal assessment in Analysis and Algorithm (CSC 402). It includes questions on asymptotic notations, complexity classes (P, NP, NP-Hard, NP-Complete), sorting algorithms (insertion sort, quick sort, merge sort), divide and conquer strategies, greedy algorithms, minimum spanning trees, and shortest path algorithms. Additionally, it covers job sequencing with deadlines for maximum profit.

Uploaded by

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

QUESTION BANK (INTERNAL ASSESSMENT 01)

ANALYSIS AND ALGORITHM (CSC 402)

1. Explain asymptotic notations OR What is Asymptotic analysis and define Big


oh ,Big Omega and Theta notation?
2. Define P,NP,NP-Hard ,NP-Complete.Describe the relationship P,NP,NP-Hard
,NP-Complete.
3. Explain Best Case , Average Case and Worst Case.
4. Write the algorithm for insertion sort. Also sort the following numbers
using same algorithm 11,7,17,3,9,29,85,9 and show output after each pass.
5. Solve the following Recurrence using substitution Method
T(n) = 1 If n=1
T(n) = 2T(n/2) + Cn if n>1

6. Sort the following numbers using Quick sort, also derive complexity of quick
sort. 50,31,71,38,77,81,12,33
7. Sort the following numbers using merge sort also, derive the time
complexity of merge sort. 7,2,9,4,3,8,6,1.
8. Sort the following numbers using merge sort 7,6,1,4,8,3,2,9. 7. Find
Minimum and Maximum elements of an array
X[0:9]={45,83,75,17,43,37,80,53,61,22}using divide and conquer strategy.
9. Write algorithm for greedy knapsack and obtain the solution to following
Fractional greedy knapsack problem where n=5, m=100, (p1, p2....p5) =
(10,20,30,40,50) and (w1,w2,.....,w5) = (20,30,66,40,60).
10.Obtain the solution to the following knapsack problem using Greedy
method :n=7,m=15 (p1,p2 .........,p7) = (10,5,15,7,6,18,3) , (w1,w2,....., w7)=
(2,3,5,7,1,4,1) .
11.Find MST of following graph using prim’s and kruskal’s algorithm.
12.Find the shortest path from source vertex S using Dijkstra’s algorithm.

13.Find the Dijkstra’s shortest path from vertex 1 to vertex 4 for the following
graph.

14.Solve the following instance of Job Sequencing with deadlines problem


n=7,profits(p1,p2,p3,p4,p5,p6,p7)= (3,5,20,18,1,6,30) and deadlines
(d1,d2,d3,d4,d5,d6,d7) = (1,3,4,3,2,1,2).Schedule the jobs in such way so as
to get maximum profit.
15.Find MST of following graph using prim’s and kruskal’s algorithm.

Assi.Prof.Harshala Date

You might also like