Quiz on Data Structures

In this tree, where would the new value "7" be placed?

• On the left "leaf" of "4"
• On the right "leaf" of "6"
• On the left "leaf" of "15"
• Over the top of the current number "5"

In a graph if E=(u,v) means _____________

• u is adjacent to v but v is not adjacent to u

• e begins at u and ends at v

• u is processor and v is successor

• both b and c

Given a binary search tree, insert 27, 15, 63, 99, 70 and 85 (in this order) into the binary search tree. What is the post-order traversal?

• 5,15,27,34,47,54,63,70,72,75,83,85,88,94,99,101

• 72,54,34,5,27,15,47,63,70,83,75,88,85,101,94,99

• 15,27,5,47,34,70,63,54,75,85,99,94,101,88,83,72

• 15,27,5,47,34,63,54,70,75,85,99,94,101,88,83,72

• none of the above

Which one of the following is an application of queue data structure

• When a resource is shared among multiple consumers

• When data is transferred asynchronously

• Load Balancing

• All of the above

Which type of traversal of binary search tree outputs the value in sorted order?

• Pre-order

• Post-order

• In-Order

• None

Which of the following is not the type of queue?

 

• Priority queue

• Single-ended queue

• Circular queue

• Ordinary queue

What kind of Data structure would you expect to find utilised to store operations in a CPU?

• Stack
• Queue
• List
• Tree

In a circular queue implementation using array of size 5, the array index starts with 0 where front and rear values are 3 and 4 respectively. Determine the array index at which the insertion of the next element will take place.

• 5

• 0

• 1

• 2

Which of the following is the disadvantage of the array?

• Stack and Queue data structures can be implemented through an array

• Index of the first element in an array can be negative

• Wastage of memory if the elements inserted in an array are lesser than the allocated size

• Elements can be accessed sequentially

How can we initialize an array in C language?

• int arr[2]=(10, 20)

• int arr(2)={10, 20}

• int arr[2] = {10, 20}

• int arr(2) = (10, 20)