View Count: 0 Duration: 24 mins Accessed date: Not Yet Viewed View Count: 0 Duration: 17 mins Accessed date: Not Yet Viewed
###### Post your comment / feedback here

Question No: 1 of 8
`A queue is a data structure in which all insertions and deletions are made respectively at: `
Options:
1. rear and front
2. front and front
3. front and rear
4. rear and rear
a
Explanation:

Question No: 2 of 8
`Queue is also known as: `
Options:
1. Last in first out list
2. First in First Out list
3. Both A and B
4. None of above
b
Explanation:

Question No: 3 of 8
`One of the difference between Queue and Stack is: `
Options:
1. Queue require dynamic memory, but stack do not
2. Stacks require dynamic memory, but queue do not
3. Queues use two ends of the structure; stack use only one
4. Stacks use two ends of the structure , Queues use only one
c
Explanation:

Question No: 4 of 8
`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:
1. Data[1]
2. Data[2]
3. Data[11]
4. Data[12]
d
Explanation:

Question No: 5 of 8
`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:
1. The constructor Would require linear time
2. The get_front function would require linear time
3. The insert function would require linear time
4. This is _empty function would require linear time
b
Explanation:

Question No: 6 of 8
`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:
1. Neither changes
2. Only front_ptr changes
3. Only rear_ptr changes
4. Both change
d
Explanation:

Question No: 7 of 8
```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:
1. ABCD
2. ABDC
3. DCAB
4. DCBA
d
Explanation:

Question No: 8 of 8
`Memory is allocated dynamically to a data structure during execution by------------ function `
Options:
1. Malloc()
2. Calloc()
3. Realloc()
4. All the above
d
Explanation:

1