JavaScript isn't enabled in your browser, so this file can't be opened. Enable and reload.
Algorithm
This is a set of simple multiple-choice questions, provided entirely for your self-assessment, and is based on the most fundamental aspects of data structure and algorithms. The level of the questions is no more than that of what one would encounter in an introductory Programming and Data Structures class in the freshman year at college.
Sign in to Google
to save your progress.
Learn more
Which of these is the Worst-case time complexity of Quick Sort - and cannot be expressed in lower order terms?
O(n)
O(nlogn)
O(n^2)
O(n^3)
O(logn)
Clear selection
Which of these is the worst-case time complexity of Merge Sort - and cannot be expressed in lower order terms?
O(n)
O(nlogn)
O(n^2)
O(n^3)
O(logn)
Clear selection
Which of these is the average case time complexity of Merge Sort - and cannot be expressed in lower order terms?
O(nlogn)
O(logn)
O(n^3)
O(n^2)
O(n)
Clear selection
Which of these is the time complexity involved in building a heap of n elements - and cannot be expressed in lower order terms?
O(n^2)
O(n^3)
O(nlogn)
O(n)
O(logn)
Clear selection
A heap is a particular kind of a binary search tree. This statement is:
True
False
Clear selection
The Floyd-Warshall all-pairs shortest path algorithm for finding the shortest distances between nodes in a graph is an example of:
A Dynamic Programming formulation.
A Greedy Algorithm
A recursion based divide and conquer technique.
Clear selection
A bitwise operation 'f' has an interesting characteristic, such that, if f(a,b) = c, it always turns out to be the case that f(b,a) = c; f(a,c) = b; f(c,a) = b; f(b,c) = a; f(c,b) = a. Which of these functions could 'f' possibly be?
f(a,b) = a XOR b
f(a,b) = a + b
f(a,b) = a - b
f(a,b) = a * b
Clear selection
A union-find data structure is commonly applied while implementing:
A depth-first search traversal of a graph.
A breadth-first search traversal of a graph.
Computing the minimum spanning tree of a graph using the Kruskal algorithm.
Computing the all-pairs shortest path in a graph.
Clear selection
Which of these is the worst-case time complexity for looking up a key in a binary search tree - and cannot be expressed in lower order terms?
O(n)
O(n log n)
O(n^2)
O(n^3)
O(log n)
Clear selection
The graph algorithm which forms an essential component of the 'make' or 'ant build' used by programmers and software developers is:
Flow maximization algorithm
Shortest path algorithm
Minimum spanning tree algorithm
Bipartite matching
Topological sort
Clear selection
Submit
Clear form
Forms
This content is neither created nor endorsed by Google.
Report Abuse
Terms of Service
Privacy Policy
Help and feedback
Contact form owner
Help Forms improve
Report