Data Structure MCQ Page-05
41. Each node in a linked list must contain at least ….. A. Three fields B. Two fields C. Four
Read More41. Each node in a linked list must contain at least ….. A. Three fields B. Two fields C. Four
Read More31. A ……….. is a graph that has weights of costs associated with its edges. A. Network B. Weighted graph
Read More21. The number of comparisons done by sequential search is ……………… A. (N/2)+1 B. (N+1)/2 C. (N-1)/2 D. (N+2)/2 Answer
Read More11. Which of the following is not the type of queue? A. Ordinary queue B. Single ended queue C. Circular
Read More1. Which if the following is/are the levels of implementation of data structure A. Abstract level B. Application level C.
Read More