Data Structure (DS) MCQs | Page - 34

Q. 331) When converting binary tree into extended binary tree, all the original nodes in binary tree are___________.

Q. 332) Which of the following conditions checks available free space in avail list?

Q. 333) Which of the following sorting algorithm is of divide-and-conquer type?

Q. 334) STACK is also called as ______________.

Q. 335) Collection of related data items is called _______.

Q. 336) Breadth First search is used in____________.

Q. 337) A variable whose size is determined at compile time and cannot be changed at run time is_________.

Q. 338) Process of inserting an element in stack is called ____________.

Q. 339) Length of linear array can be found by using the formula_________

Q. 340) The average number of key comparisons done in a successful sequential search in a list of length n is___________.