DAA Quiz

Kruskal’s algorithm is used to ______

• a) find minimum spanning tree

• b) find single source shortest path

• c) find all pair shortest path algorithm

• d) traverse the graph

Dynamic Programming is often used for (choose all that apply):

• Optimization problems that involve making a choice that leave one or more subproblems to be solved.

• Problems previously solved using divide and conquer that have over lapping subproblems

• Non polynomial solution problems

• Subproblems where resources are shared

What two pieces of information allow you to analyse an algorithm?

• Time Complexity
• Space Complexity
• Size Complexity
• Complex Complexity
• Simplicity Complex

What order of complexity does this graph represent?

• Exponential

• Polynomial

• Linear

• Logarithmic

What is the worst case running time of the above pseudo code?

• O(n)
• O(n log n)
• O(n²)
• O(n³)

What is the worst case running time of the above pseudo code?

• O(2)
• O(n)
• O(n-2)
• O(n²)

What order of complexity does this graph represent?

• Exponential

• Polynomial

• Linear

• Logarithmic

What is the worst case running time of the above pseudo code?

• O(n)
• O(n log n) 
• O(n²)
• O(n³)

What is the worst case running time of the above pseudo code?

• O(n)
• O(log n)
• O(n log n)
• O(n²)

Which type of sort algorithm is this?

• Bubble

• Merge

• Insertion