GATE CSE 2006 | GATE CSE Year Wise Previous Years Questions

GATE CSE

PREVIOUS NEXT

GATE CSE 2006

MCQ (Single Correct Answer)

-0.6

An array X of n distinct integers is interpreted as a complete binary tree. The index of the first element of the array is 0. If the root node is at level 0, the level of element X[i], i ≠ 0, is

⌊log₂ i⌋

⌈log₂ (i + 1)⌉

⌊log₂ (i + 1)⌋

⌈log₂ i⌉

GATE CSE 2006

MCQ (Single Correct Answer)

-0.6

An array X of n distinct integers is interpreted as a complete binary tree. The index of the first element of the array is 0. If only the root node does not satisfy the heap property, the algorithm to convert the complete binary tree into a heap has the best asymptotic time complexity of

O(n)

O(log n)

O(nlog n)

O(n log log n)

GATE CSE 2006

MCQ (Single Correct Answer)

-0.6

An array X of n distinct integers is interpreted as a complete binary tree. The index of the first element of the array is 0. The index of the parent of element X[i],i≠0 is?

⌊ i/2 ⌋

⌈ (i-1)/2 ⌉

⌈ i/2 ⌉

⌈ i/2 - 1 ⌉

GATE CSE 2006

MCQ (Single Correct Answer)

-0.6

Which of the following sequences of array elements forms a heap?

{23, 17, 14, 6, 13, 10, 1, 12, 7, 5}

{23, 17, 14, 6, 13, 10, 1, 5, 7, 12}

{23, 17, 14, 7, 13, 10, 1, 5, 6, 12}

{23, 17, 14, 7, 13, 10, 1, 12, 5, 7}

PREVIOUS NEXT

GATE CSE Papers

2024