(A) Inner node
(B) Leaf node
(C) Root node
(D) None of the given options
Tag: Data Structure Mcqs
Which of the following is not a correct statement about Table ADT?
(A) In a table, the type of information in columns may be different
(B) A table consists of several columns, known as entities
(C) The row of a table is called a record
(D) A major use of table is in databases where we build and use tables for keeping information
In a perfectly balanced tree the insertion of a node needs?
(A) One rotation
(B) Two rotations
(C) Rotations equal to number of levels
(D) No rotation at all
Consider the following array 23 15 5 12 40 10 7 After the first pass of a particular algorithm, the array looks like 15 5 12 23 10 7 40 Name the algorithm used?
(A) Heap sort
(B) Selection sort
(C) Bubble sort
(D) Insertion sort
Which of the following can be the inclusion criteria for pixels in image segmentation?
(A) Texture
(B) Pixel intensity
(C) Threshold of intensity
(D) All of the given options
There is/are __ case/s for rotation in an AVL tree.
(A) 1
(B) 2
(C) 3
(D) 4
Which one is a self-referential data type?
(A) Stack
(B) Queue
(C) Link list
(D) All of the above
If a max heap is implemented using a partially filled array called data, and the array contains n elements (n > 0), where is the entry with the greatest value?
(A) data[0]
(B) data[n-1]
(C) data[n]
(D) data[2*n+1]