MyQuestionIcon

1

You visited us 1 times! Enjoying our articles? Unlock Full Access!

Squaring an Inequality

An array X of...

Question

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 $\neq$ 0, is

A

⌈ l o g_{2} (i + 1) ⌉

No worries! We‘ve got your back. Try BYJU‘S free classes today!

B

⌈ l o g_{2} (i + 1) ⌉

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses

C

⌊ l o g_{2} i ⌋

No worries! We‘ve got your back. Try BYJU‘S free classes today!

D

⌈ l o g_{2} i ⌉

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Open in App

Solution

The correct option is B $⌈ l o g_{2} (i + 1) ⌉$

Index of every node is shown in the box. Floor (log (i + 1)) draw the tree and realise that the last element at each level is the best choice to arrive at a conclusion.

Suggest Corrections

thumbs-up

0

Similar questions

Q. Consider an array representation of an n element binary heap where the elements are stored from index 1 to index n of the array. For the element stored in index i of the array (i < =n), the index of the parent is

Q. Consider the following two C code segments. Y and X are one and two dimensional arrays of size n and

n \times n

respectively, where

2 \leq n \geq 10.

Assume that in both code segments, elements of Y are initialized to 0 and each element X[i][j] of array X is initialized to i + j. Further assume that when stored in main memory all elements of X are in same main memory page frame.

Code segment 1 :
// initialize elements of Y to 0
// initialize elements X [i][j] of X to i+j
for (i =0; i < n; i++)
Y [i] + = X [0] [i];

Code segment 2 :
// initialize elements of Y to 0
// initialize elements X[i][j] of X to i+j
for (i =0; i < n; i++)
Y [i] + = X [i] [0];

Which of the following statements is/are correct?

S1 : Final contents of array Y will be same in both code segments.

S2 : Elements of array X accessed inside the for loop shown in code segment 1 are contiguous in main memory.

S3 : Elements of array X accessed inside the for loop shown in code segment 2 are contiguous in main memory.

Q. The maximum number of nodes on level i of a binary tree is

Q. A binary min heap consisting of integers is implemented using array A[l ....n] in which root node is stored at A[1] and locations A[l] through A[n] store the 'n' integer values in the heap. The minimum number of comparisons required to find maximum element in a min heap of 99 elements is

n \times n

array v is defined as follows:

v [i, j] = i - j f o r a l l i, j

1 \leq i \leq n, 1 \leq j \leq n

The sum of the elements of the array v is

View More

Join BYJU'S Learning Program

similar_icon

Related Videos

lock

Squaring an Inequality

MATHEMATICS

Watch in App

explore_more_icon

Explore more

Squaring an Inequality

Standard XII Mathematics

Join BYJU'S Learning Program

CrossIcon