Data Structure, Databases

Question: Which of these are standard operations of Stack Data Structure?
A
Push, delete

B
Insert, pop

C
Put, extract

D
Push, pop

Note: Not available
1. Report
Question: Suppose we have a circular array implementation of a queue, with ten items in the queue stored at data[2] through data[11]. The CAPACITY is 42. Where does the enqueue member function place the new entry in the array?
A
data[1]

B
data[2]

C
data[11]

D
data[12]

Note: Not available
1. Report
Question: A binary search tree is generated by inserting the following integers in the order: 50,15,62,5,20,58,91,3,8,37,60,24. How many nodes are in the left and right subtrees, respectively?
A
(4,7)

B
(7,4)

C
(8,3)

D
(3,8)

Note: Not available
1. Report
Question: What is the worst-case scenario for the binary search for finding a single item in an sorted array?
A
Constant time

B
Logarithmic time

C
Linear time

D
Quadratic time

Note: Not available
1. Report
Question: What is the maximum depth of recursive calls a function may make?
A
1

B
2

C
n (where n is the argument)

D
There is no fixed maximum

Note: Not available
1. Report
Question: Consider this binary search tree. Which will be the new root if you remove the root and replace it with something from the left subtree?
A
1

B
2

C
4

D
5

Note: Not available
1. Report
Question: The number of distinct simple graphs with up to three nodes is _______.
A
15

B
10

C
7

D
9

Note: Not available
1. Report
Question: In a selection sort algorithm, the number of passes required to perform the sort are ______.
A
N

B
N-1

C
N-2

D
N^2

Note: Not available
1. Report

First Prev 8 9 10 Next Last

Question: Which of these are standard operations of Stack Data Structure?

Question: Suppose we have a circular array implementation of a queue, with ten items in the queue stored at data[2] through data[11]. The CAPACITY is 42. Where does the enqueue member function place the new entry in the array?

Question: A binary search tree is generated by inserting the following integers in the order: 50,15,62,5,20,58,91,3,8,37,60,24. How many nodes are in the left and right subtrees, respectively?

Question: What is the worst-case scenario for the binary search for finding a single item in an sorted array?

Question: What is the maximum depth of recursive calls a function may make?

Question: Consider this binary search tree. Which will be the new root if you remove the root and replace it with something from the left subtree?

Question: The number of distinct simple graphs with up to three nodes is _______.

Question: In a selection sort algorithm, the number of passes required to perform the sort are ______.