Data Structure and Algorithms MCQs
21. Question
Cyclometric complexity of a flow graph G with n vertices and e edges is
Answer
22. Question
For a B-tree of height h and degree t, the total CPU time used to insert a node is
Answer
23. Question
The time complexity to build a heap with a list of n numbers is
Answer
24. Question
The value of postfix expression :
8 3 4 + – 3 8 2 / + * 2 $ 3 + is
8 3 4 + – 3 8 2 / + * 2 $ 3 + is
Answer
25. Question
Consider the following statements for priority queue :
S1 : It is a data structure in which the intrinsic ordering of the elements does determine the result of its basic operations.
S2 : The elements of a priority queue may be complex structures that are ordered on one or several fields.
Which of the following is correct ?
S1 : It is a data structure in which the intrinsic ordering of the elements does determine the result of its basic operations.
S2 : The elements of a priority queue may be complex structures that are ordered on one or several fields.
Which of the following is correct ?
Answer