BCS 042 ALGO Imp Ques
BCS 042 ALGO Imp Ques
BCS 042 ALGO Imp Ques
Important Question's
(Click here)
Check Important Question with Answer Video On [YOUTUBE]
BLOCK 1
Ques. 1 What are algorithms? Explain the meaning of the time and space
complexity of algorithms ?
Ques. 3 By applying the induction method, show that for all positive integers ?
oP(n)= 1^2+ 2^2+……n^2= n(n+1) (n+2)/6
Ques. 6 Define O (big Oh) notation and prove or disprove the following using
the basic definition of O(big oh) ?
2n^3+n^2+10= O (n^3).
(Click here)
Check Important Question with Answer Video On [YOUTUBE]
BLOCK 1
Ques. 7 Explain the big omega notation? Using the definition of big Omega (Ω) ?
6n^2 +20n ≠ Ω (n^3).
Ques. 8 Write linear search algorithms and explain best, average, and
worst-case time complexity ?
BLOCK 2
Ques. 2 Define the minimum cost spanning tree and use Krushal’s algorithms to
find the minimum cost spanning tree with the help of an example ?
Ques. 3 Write the Prim’s algorithms to find the minimum cost spanning tree ?
(Click here)
Check Important Question with Answer Video On [YOUTUBE]
BLOCK 2
Ques. 5 Apply QuickSort to sort the following array. Show all the steps ?
15,5,10,8,7,2,20,30
What are the worst case and best case in QuickSort algorithms
ASK