Interview Questions

1. A queue is a data structure in which all insertions and deletions are made respectively at:

Options:

a. rear and front

b. front and front

c. front and rear

d. rear and rear

Reveal Answer

2. Queue is also known as:

Options:

a. Last in first out list

b. First in First Out list

c. Both A and B

d. None of above

Reveal Answer

3. One of the difference between Queue and Stack is:

Options:

a. Queue require dynamic memory, but stack do not

b. Stacks require dynamic memory, but queue do not

c. Queues use two ends of the structure; stack use only one

d. Stacks use two ends of the structure , Queues use only one

Reveal Answer

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

Options:

a. Data[1]

b. Data[2]

c. Data[11]

d. Data[12]

Reveal Answer

5. Consider the implementation of the queue using a circular array. What goes wrong if we try to keep all the items at the front of a partially-filled array (so that data[0] is always the front)

Options:

a. The constructor Would require linear time

b. The get_front function would require linear time

c. The insert function would require linear time

d. This is _empty function would require linear time

Reveal Answer

6. To implement the queue with a linked list, keeping track of a front pointer and a rear pointer. Which of these pointers will change during an insertion into a NONEMPTY queue?

Options:

a. Neither changes

b. Only front_ptr changes

c. Only rear_ptr changes

d. Both change

Reveal Answer

7. If the character ‘D,’C’,’B’,’A’ are placed in a queue (in that order), and then removed one at a item, in what order will they be removed?

Options:

a. ABCD

b. ABDC

c. DCAB

d. DCBA

Reveal Answer

8. Memory is allocated dynamically to a data structure during execution by------------ function

Options:

a. Malloc()

b. Calloc()

c. Realloc()

d. All the above

Reveal Answer

Interview Questions and Answer

1. A queue is a data structure in which all insertions and deletions are made respectively at:

2. Queue is also known as:

3. One of the difference between Queue and Stack is:

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

5. Consider the implementation of the queue using a circular array. What goes wrong if we try to keep all the items at the front of a partially-filled array (so that data[0] is always the front)

6. To implement the queue with a linked list, keeping track of a front pointer and a rear pointer. Which of these pointers will change during an insertion into a NONEMPTY queue?

7. If the character ‘D,’C’,’B’,’A’ are placed in a queue (in that order), and then removed one at a item, in what order will they be removed?

8. Memory is allocated dynamically to a data structure during execution by------------ function

Packages

Resources

About

Other links