CSS interview questions part 23
CSS interview questions part 23
Take as many assements as you can to improve your validate your skill rating
Total Questions: 20
1. For every matching parenthesis, print their indices.
Correct Answer is : E > F
2. What is direct addressing?
Correct Answer is : E ~ F
3. When is it appropriate to use direct addressing?
Correct Answer is : E.class
4. What is the search complexity in direct addressing?
Correct Answer is : E + F
5. What is the time complexity to insert an element into the direct address table?
Correct Answer is : .class
6. What is the advantage of using a dynamic set in direct addressing?
Correct Answer is : element,element
7. What is the time complexity to delete an element from the direct address table?
Correct Answer is : attribute
8. How is a bit vector better compared to a normal array for implementing the hash table?
Correct Answer is : attribute*=value
9. Every Directed Acyclic Graph has at least one sink vertex.
Correct Answer is : :empty
10. Which of the following is a topological sorting of the given graph?
Correct Answer is : :focus
11. With V(greater than 1) vertices, how many edges at most can a Directed Acyclic Graph possess? a) (V*(V-1))/2 b) (V*(V+1))/2 c) (V+1)C2 d) (V-1)C2
Correct Answer is : :link
12. The topological sorting of any DAG can be done in ________ time. a) cubic b) quadratic c) linear d) logarithmic
Correct Answer is : :only-child
13. If there are more than 1 topological sorting of a DAG is possible, which of the following is true.
Correct Answer is : :root
14. What sequence would the BFS traversal of the given graph yield?
Correct Answer is : :visited
15. What would be the output of the following C++ program if the given input is
0 0 0 1 1
0 0 0 0 1
0 0 0 1 0
1 0 1 0 0
1 1 0 0 0
#include
using namespace std;
bool visited[5];
int G[5][5];
void fun(int i)
{
cout<>G[i][j];
for(int i=0;i<5;i++)
visited[i]=0;
fun(0);
return 0;
}
Correct Answer is : IE
16. Which of the given statement is true?
Correct Answer is : firefox
17. For any two different vertices u and v of an Acyclic Directed Graph if v is reachable from u, u is also reachable from v?
Correct Answer is : IE
18. What is the value of the sum of the minimum in-degree and maximum out-degree of an Directed Acyclic Graph?
Correct Answer is : IE
19. Dijkstra’s Algorithm will work for both negative and positive weights?
Correct Answer is : chrome
20. A graph having an edge from each vertex to every other vertex is called a ___________
Correct Answer is : h-offset
