Data Structure (DS) MCQs | Page - 39

Q. 381) If every node u in G is adjacent to every other node v in G, A graph is said to be _______.

Q. 382) In a graph G if e=(u,v), then u and v are called ___________.

Q. 383) Which of the following is true while inserting a new node in the list?

Q. 384) Which of the following data structures are indexed structures?

Q. 385) The efficiency of a BFS algorithm is dependent on _______.

Q. 386) The average number of key comparisons done in a successful sequential search in a list of length n is ____________.

Q. 387) Divide and conquer is an important algorithm design paradigm based on _______.

Q. 388) The correctness of a divide and conquer algorithm is usually proved by _________.

Q. 389) The ____________ is used in an elegant sorting algorithm.

Q. 390) ____________ is finding a path/tour through the graph such that every vertex is visited exactly once.