Branch Wise MCQComputer Science McqsData Structure

Data Structure MCQ Page-04

31.
A ……….. is a graph that has weights of costs associated with its edges.

32.
In general, the binary search method needs no more than ……………. comparisons.

33.
Linked lists are best suited …..

34.
The operation of processing each element in the list is known as ……

35.
The situation when in a linked list START=NULL is ….

36.
Each node in singly linked list has …….. fields.

37.
Which of the following is two way lists?

38.
Which is the pointer associated with the availability list

39.
Value of first linked list index is ….

40.
In linked lists there are no NULL links in