CSS interview questions part 24
CSS interview questions part 24
Take as many assements as you can to improve your validate your skill rating
Total Questions: 20
1. Floyd Warshall Algorithm used to solve the shortest path problem has a time complexity of __________
Correct Answer is : spread
2. All Graphs have unique representation on paper.
Correct Answer is : inset
3. Assuming value of every weight to be greater than 10, in which of the following cases the shortest path of a directed weighted graph from 2 vertices u and v will never change?
Correct Answer is : contain
4. What is the maximum possible number of edges in a directed graph with no self loops having 8 vertices?
Correct Answer is : background-origin
5. What would be the DFS traversal of the given Graph?
Correct Answer is : background-clip
6. What would be the value of the distance matrix, after the execution of the given code?
#include #define INF 1000000int graph[V][V] = { {0, 7, INF, 4}, {INF, 0, 13, INF}, {INF, INF, 0, 12}, {INF, INF, INF, 0} }; int distance[V][V], i, j, k; for (i = 0; i < V; i++) for (j = 0; j < V; j++) distance[i][j] = graph[i][j]; for (k = 0; k < V; k++) for (i = 0; i < V; i++) for (j = 0; j < V; j++) { if (distance[i][k] + distance[k][j] < distance[i][j]) distance[i][j] = distance[i][k] + distance[k][j]; return 0; }
a)
{ {0, 7, INF, 4}, {INF, 0, 13, INF}, {INF, INF, 0, 12}, {INF, INF, INF, 0} };
b)
{ {0, 7, 20, 24}, {INF, 0, 13, 25}, {INF, INF, 0, 12}, {INF, INF, INF, 0} };
c)
{ {0, INF, 20, 24}, {INF, INF, 13, 25}, {INF, INF, 0, 12}, {INF, INF, INF, 0} {INF, 0, 13, 25}, {INF, INF, 0, 12}, {24, INF, INF, 0} };
d) None of the mentioned
Correct Answer is : click and break it
7. What is the maximum number of edges present in a simple directed graph with 7 vertices if there exists no cycles in the graph?
Correct Answer is : Overlay pop-up
8. How many properties will an equivalent relationship satisfy?
Correct Answer is : cartoon pop-up
9. A relation R on a set S, defined as x R y if and only if y R x. This is an example of?
Correct Answer is : linear pop-up
10. Electrical connectivity is an example of equivalence relation.
Correct Answer is : pure-menu-horizontal
11. What is the worst case efficiency for a path compression algorithm?
Correct Answer is : pure-menu-disabled
12. Does path compression algorithm work during?
Correct Answer is : IE 6
13. What is the definition for Ackermann’s function?
Correct Answer is : .wrapper
14. ___________ is one of the earliest forms of a self-adjustment strategy used in splay trees, skew heaps.
Correct Answer is : .bg1
15. What is the depth of any tree if the union operation is performed by height?
Correct Answer is : sticky
16. When executing a sequence of Unions, a node of rank r must have at least 2r descendants.
Correct Answer is : IE
17. What is the value for the number of nodes of rank r?
Correct Answer is : z-index
18. What is the worst-case running time of unions done by size and path compression?
Correct Answer is : clip
19. In the Union/Find algorithm, the ranks of the nodes on a path will increase monotonically from?
Correct Answer is : absolute
20. How many strategies are followed to solve a dynamic equivalence problem?
Correct Answer is : static
