×
Detail Form
We will send your result on your email id and phone no. please fill detail
1.
Which data structure is used in breadth first search of a graph to hold nodes?
2.
Identify the data structure which allows deletions at both ends of the list but insertion at only one end.
3.
Which of the following data structure is non linear type?
4.
Which of the following data structure is linear type?
5.
To represent hierarchical relationship between elements, Which data structure is suitable?
6.
A directed graph is ………………. if there is a path from each vertex to every other vertex in the digraph.
7.
In the …………….. traversal we process all of a vertex’s descendants before we move to an adjacent vertex.
8.
State True of False.
i) Network is a graph that has weights or costs associated with it.
ii) An undirected graph which contains no cycles is called a forest.
iii) A graph is said to be complete if there is no edge between every pair of vertices.
i) Network is a graph that has weights or costs associated with it.
ii) An undirected graph which contains no cycles is called a forest.
iii) A graph is said to be complete if there is no edge between every pair of vertices.
9.
The number of comparisons done by sequential search is
10.
In ……………, search start at the beginning of the list and check every element in the list.