Design And Analysis of Algorithms

Which is the 4th step in Algorithm design and Analysis process?

• Understand the problem

• code the algorithm

• Prove correctness

• Analyze the algorithm

Which is the best case notation to check the efficiency of the algorithm?

• Ω (Omega) notation

• O (Big Oh) notation

• o (little oh) notation

• Θ (Theta) notation

Identify aymptotic notation given in the figure?

• O (Big Oh) notation

• Ω (Omega) notation

• Θ (Theta) notation

• None of the above

The time complexity for TOH in best & worst case is given by _________

• n

• logn

• n2(n-square)

• 2n

What is the worst case time complexity of selection sort & bubble sort?

• θ(n3)(n-cube)

• θ(n2)(n-square)

• θ(n)

• θ(2n)

What type of algorithm technique involves dividing the problems into sub-problems and combining the solution to get the final solution?

• Divide & Decrease

• Decrese & Transform

• Divide & Conquer

• Divide & Transform

What is the time complexity of Merge sort?

• 𝜽(𝒏)

• 𝜽(𝒍𝒐𝒈𝒏)

• 𝜽(𝒏𝒍𝒐𝒈𝒏)

• 𝜽(𝒏𝒍𝒐𝒈𝟐𝒏)

Which is not the 3 major variations of decrease and conquer?

• Decrease by Constant

• Decrease by value

• Decrease by Constant factor

• Variable size decrease

Which data structure used in BFS traversal method?

(a)  

What is the Topological Order for the given graph using Source Removal Method?

• C5, C2, C3, C4, C1

• C1, C2, C3, C4, C5

• C4, C2, C5, C1, C3

• C5, C4, C1, C2, C3