What is the Search complexity indirect addressing?

Hashing Techqinues which allocates Fixed number of brackets is classified as

Consider a Hash table T with 25 slots that stores 2000 elements, the load factor & For T is:

What can be the techniques to avoid collision?

Given an undirected graph G with V vertices and E edges, the sum of the degrees of all vertices is

Which of the following data structure is useful in traversing a given graph by breadth first search?

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 ____.

A complete graph can have

A directed graph is _______ it there is a path from each vertex to every other vertex in the digraph

From a complete graph, by removing maximum how may edge we can construct a spanning tree?

Which one is the most generalized single source shortest Path algorithm to find shortest Path in a graph even with negative weights?

In ­­­_______input is a directed acyclic Graph (DAG)

In a simple graph, the number of edges is equal to the twice the sum of the degrees of the vertices.

Floyd warshall Algorithm used to solve the shortest path problem has a time complexity of.

Which of the following data structure is non linear type?