- Computer Science Engineering (CSE)
- Data Structures (DS)
- Linear Data Structures -Stacks and Queue...
- A normal queue, if implemented using an ...

Q. |
## A normal queue, if implemented using an array of size MAX_SIZE, gets full when |

A. | Rear = MAX_SIZE – 1 |

B. | Front = (rear + 1)mod MAX_SIZE |

C. | Front = rear + 1 |

D. | Rear = front |

Answer» A. Rear = MAX_SIZE – 1 |

View all MCQs in:
Data Structures (DS)

- The given array is arr = {1, 2, 4, 3}. Bubble sort is used to sort the array elements. How many iterations will be done to sort the array?
- The given array is arr = {1,2,4,3}. Bubble sort is used to sort the array elements. How many iterations will be done to sort the array with improvised version?
- In a circular queue, how do you increment the rear end of the queue?
- With what data structure can a priority queue be implemented?
- The queue which wraps around upon reaching the end of the array is called as____________.
- The given array is arr = {1,2,3,4,5}. (bubble sort is implemented with a flag variable)The number of iterations in selection sort and bubble sort respectively are,
- Given an array arr = {45,77,89,90,94,99,100} and key = 99; what are the mid values(corresponding array elements) in the first and second levels of recursion?
- Given an array arr = {45,77,89,90,94,99,100} and key = 100; What are the mid values(corresponding array elements) generated in the first and second iterations?
- What is the term for inserting into a full queue known as?
- The binary tree sort implemented using a self – balancing binary search tree takes time is worst case.

Login to Continue

It will take less than 2 minutes

Report MCQ