1) What can be the techniques to avoid collision?
Ans: All of the above
2) In _______input is a directed acyclic Graph (DAG)
Ans: Topological sort
3) In a simple graph, the number of edges is equal to the twice the sum of the degrees of the vertices.
Ans: False
4) Which one is the most generalized single source shortest Path algorithm to find shortest Path in a graph even with negative weights?
Ans: Bellman ford Algorithm
5) What is the Search complexity indirect addressing?
Ans: O(1)
6) Floyd warshall Algorithm used to solve the shortest path problem has a time complexity of.
Ans: O(v3)
7) From a complete graph, by removing maximum how may edge we can construct a spanning tree?
Ans: e-n+1
8) Hashing Techqinues which allocates Fixed number of brackets is classified as
Ans: External Hashing
9) Consider a Hash table T with 25 slots that stores 2000 elements, the load factor & For T is:
Ans: 80
10) Which of the following data structure is non linear type?
Ans: Graph
11) A complete graph can have
Ans: nn-2 spanning tree
12) Given an undirected graph G with V vertices and E edges, the sum of the degrees of all vertices is
Ans: 2E
13) Let G be a simple graph with 20 vertices and 8 components. If we delete a vertex in G, then number of components in G should lie between ____.
Ans: 7 and 19
14) A directed graph is _______ it there is a path from each vertex to every other vertex in the digraph
Ans: Strongly Connected
15) Which of the following data structure is useful in traversing a given graph by breadth first search?
Ans: Queue
CSE PlaceMe Answer KeyAll Levels
