# Data Structures

## Data Structures

 Question 1 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
Match the Binary Tree type

 A I-C, II-B, III-D, IV-A B I-C, II-A, III-B, IV-D C I-C, II-B, III-A, IV-D D I-C, II-D, III-A, IV-B
 Question 2 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
Circular Queue is also known as

 A Ring Buffer B Square Buffer C Rectangle Buffer D Curve Buffer
 Question 3 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
Select operations that can be performed on a Queue Data Structure...

 A isEmpty() B pop() C push() D correctchoice isFull()
 Question 4 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
A variable is a named value that can be changed in the program.

 A False B True
 Question 5 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]

is

 A Full B Empty C Half full D saturated
 Question 6 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
Match the vector notation to the diagram

 A [3, 2] B [2, 3] C [-3, 2] D [-2, -3]
 Question 7 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
A three dimensional array in 'C' is declared as int A[x][y][z]. Consider that array elements are stored in row major order and indexing begins from 0. Here, the address of an item at the location A[p][q][r] can be computed as follows (where w is the word length of an integer):

 A &A[0][0][0] + w(y * z * q + z * p + r) B &A[0][0][0] + w(y * z * p + z*q + r) C &A[0][0][0] + w(x * y * p + z * q+ r) D &A[0][0][0] + w(x * y * q + z * p + r)
 Question 8 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]