GATE Exam > GATE Questions > Suppose a circular queue of capacity (n &minu...
Start Learning for Free
Suppose a circular queue of capacity (n −1) elements is implemented with an array of n elements.
Assume that the insertion and deletion operations are carried out using REAR and FRONT as array
index variables, respectively. Initially, REAR = FRONT = 0. The conditions to detect queue full
and queue empty are
Assume that the insertion and deletion operations are carried out using REAR and FRONT as array
index variables, respectively. Initially, REAR = FRONT = 0. The conditions to detect queue full
and queue empty are
- a)full: (REAR+1) mod n == FRONT
empty: REAR == FRONT - b)full: (REAR+1) mod n == FRONT
empty: (FRONT+1) mod n == REAR - c)full: REAR == FRONT
empty: (REAR+1) mod n == FRONT - d)full: (FRONT+1) mod n == REAR
empty: REAR == FRONT
Correct answer is option 'A'. Can you explain this answer?
| FREE This question is part of | Download PDF Attempt this Test |
Verified Answer
Suppose a circular queue of capacity (n −1) elements is implemen...
The counter example for the condition full : REAR = FRONT is
Initially when the Queue is empty REAR=FRONT=0 by which the above full condition is satisfied which is false
The counter example for the condition full : (FRONT+1)mod n =REAR is
Initially when the Queue is empty REAR=FRONT=0 and let n=3, so after inserting one element REAR=1 and FRONT=0, at this point the condition full above is satisfied, but still there is place for one more element in Queue, so this condition is also false
The counter example for the condition empty : (REAR+1)mod n = FRONT is
Initially when the Queue is empty REAR=FRONT=0 and let n=2, so after inserting one element REAR=1 and FRONT=0, at this point the condition empty above is satisfied, but the queue of capacity n-1 is full here
The counter example for the condition empty : (FRONT+1)mod n =REAR is
Initially when the Queue is empty REAR=FRONT=0 and let n=2, so after inserting one element REAR=1 and FRONT=0, at this point the condition empty above is satisfied, but the queue of capacity n-1 is full here
Initially when the Queue is empty REAR=FRONT=0 by which the above full condition is satisfied which is false
The counter example for the condition full : (FRONT+1)mod n =REAR is
Initially when the Queue is empty REAR=FRONT=0 and let n=3, so after inserting one element REAR=1 and FRONT=0, at this point the condition full above is satisfied, but still there is place for one more element in Queue, so this condition is also false
The counter example for the condition empty : (REAR+1)mod n = FRONT is
Initially when the Queue is empty REAR=FRONT=0 and let n=2, so after inserting one element REAR=1 and FRONT=0, at this point the condition empty above is satisfied, but the queue of capacity n-1 is full here
The counter example for the condition empty : (FRONT+1)mod n =REAR is
Initially when the Queue is empty REAR=FRONT=0 and let n=2, so after inserting one element REAR=1 and FRONT=0, at this point the condition empty above is satisfied, but the queue of capacity n-1 is full here
Most Upvoted Answer
Suppose a circular queue of capacity (n −1) elements is implemen...
Please provide the complete question so that I can assist you better.
|
Explore Courses for GATE exam
|
|
Similar GATE Doubts
Suppose a circular queue of capacity (n −1) elements is implemented with an array of n elements.Assume that the insertion and deletion operations are carried out using REAR and FRONT as arrayindex variables, respectively. Initially, REAR = FRONT = 0. The conditions to detect queue fulland queue empty area)full: (REAR+1) mod n == FRONTempty: REAR == FRONTb)full: (REAR+1) mod n == FRONTempty: (FRONT+1) mod n == REARc)full: REAR == FRONTempty: (REAR+1) mod n == FRONTd)full: (FRONT+1) mod n == REARempty: REAR == FRONTCorrect answer is option 'A'. Can you explain this answer?
Question Description
Suppose a circular queue of capacity (n −1) elements is implemented with an array of n elements.Assume that the insertion and deletion operations are carried out using REAR and FRONT as arrayindex variables, respectively. Initially, REAR = FRONT = 0. The conditions to detect queue fulland queue empty area)full: (REAR+1) mod n == FRONTempty: REAR == FRONTb)full: (REAR+1) mod n == FRONTempty: (FRONT+1) mod n == REARc)full: REAR == FRONTempty: (REAR+1) mod n == FRONTd)full: (FRONT+1) mod n == REARempty: REAR == FRONTCorrect answer is option 'A'. Can you explain this answer? for GATE 2024 is part of GATE preparation. The Question and answers have been prepared according to the GATE exam syllabus. Information about Suppose a circular queue of capacity (n −1) elements is implemented with an array of n elements.Assume that the insertion and deletion operations are carried out using REAR and FRONT as arrayindex variables, respectively. Initially, REAR = FRONT = 0. The conditions to detect queue fulland queue empty area)full: (REAR+1) mod n == FRONTempty: REAR == FRONTb)full: (REAR+1) mod n == FRONTempty: (FRONT+1) mod n == REARc)full: REAR == FRONTempty: (REAR+1) mod n == FRONTd)full: (FRONT+1) mod n == REARempty: REAR == FRONTCorrect answer is option 'A'. Can you explain this answer? covers all topics & solutions for GATE 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Suppose a circular queue of capacity (n −1) elements is implemented with an array of n elements.Assume that the insertion and deletion operations are carried out using REAR and FRONT as arrayindex variables, respectively. Initially, REAR = FRONT = 0. The conditions to detect queue fulland queue empty area)full: (REAR+1) mod n == FRONTempty: REAR == FRONTb)full: (REAR+1) mod n == FRONTempty: (FRONT+1) mod n == REARc)full: REAR == FRONTempty: (REAR+1) mod n == FRONTd)full: (FRONT+1) mod n == REARempty: REAR == FRONTCorrect answer is option 'A'. Can you explain this answer?.
Suppose a circular queue of capacity (n −1) elements is implemented with an array of n elements.Assume that the insertion and deletion operations are carried out using REAR and FRONT as arrayindex variables, respectively. Initially, REAR = FRONT = 0. The conditions to detect queue fulland queue empty area)full: (REAR+1) mod n == FRONTempty: REAR == FRONTb)full: (REAR+1) mod n == FRONTempty: (FRONT+1) mod n == REARc)full: REAR == FRONTempty: (REAR+1) mod n == FRONTd)full: (FRONT+1) mod n == REARempty: REAR == FRONTCorrect answer is option 'A'. Can you explain this answer? for GATE 2024 is part of GATE preparation. The Question and answers have been prepared according to the GATE exam syllabus. Information about Suppose a circular queue of capacity (n −1) elements is implemented with an array of n elements.Assume that the insertion and deletion operations are carried out using REAR and FRONT as arrayindex variables, respectively. Initially, REAR = FRONT = 0. The conditions to detect queue fulland queue empty area)full: (REAR+1) mod n == FRONTempty: REAR == FRONTb)full: (REAR+1) mod n == FRONTempty: (FRONT+1) mod n == REARc)full: REAR == FRONTempty: (REAR+1) mod n == FRONTd)full: (FRONT+1) mod n == REARempty: REAR == FRONTCorrect answer is option 'A'. Can you explain this answer? covers all topics & solutions for GATE 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Suppose a circular queue of capacity (n −1) elements is implemented with an array of n elements.Assume that the insertion and deletion operations are carried out using REAR and FRONT as arrayindex variables, respectively. Initially, REAR = FRONT = 0. The conditions to detect queue fulland queue empty area)full: (REAR+1) mod n == FRONTempty: REAR == FRONTb)full: (REAR+1) mod n == FRONTempty: (FRONT+1) mod n == REARc)full: REAR == FRONTempty: (REAR+1) mod n == FRONTd)full: (FRONT+1) mod n == REARempty: REAR == FRONTCorrect answer is option 'A'. Can you explain this answer?.
Solutions for Suppose a circular queue of capacity (n −1) elements is implemented with an array of n elements.Assume that the insertion and deletion operations are carried out using REAR and FRONT as arrayindex variables, respectively. Initially, REAR = FRONT = 0. The conditions to detect queue fulland queue empty area)full: (REAR+1) mod n == FRONTempty: REAR == FRONTb)full: (REAR+1) mod n == FRONTempty: (FRONT+1) mod n == REARc)full: REAR == FRONTempty: (REAR+1) mod n == FRONTd)full: (FRONT+1) mod n == REARempty: REAR == FRONTCorrect answer is option 'A'. Can you explain this answer? in English & in Hindi are available as part of our courses for GATE.
Download more important topics, notes, lectures and mock test series for GATE Exam by signing up for free.
Here you can find the meaning of Suppose a circular queue of capacity (n −1) elements is implemented with an array of n elements.Assume that the insertion and deletion operations are carried out using REAR and FRONT as arrayindex variables, respectively. Initially, REAR = FRONT = 0. The conditions to detect queue fulland queue empty area)full: (REAR+1) mod n == FRONTempty: REAR == FRONTb)full: (REAR+1) mod n == FRONTempty: (FRONT+1) mod n == REARc)full: REAR == FRONTempty: (REAR+1) mod n == FRONTd)full: (FRONT+1) mod n == REARempty: REAR == FRONTCorrect answer is option 'A'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of
Suppose a circular queue of capacity (n −1) elements is implemented with an array of n elements.Assume that the insertion and deletion operations are carried out using REAR and FRONT as arrayindex variables, respectively. Initially, REAR = FRONT = 0. The conditions to detect queue fulland queue empty area)full: (REAR+1) mod n == FRONTempty: REAR == FRONTb)full: (REAR+1) mod n == FRONTempty: (FRONT+1) mod n == REARc)full: REAR == FRONTempty: (REAR+1) mod n == FRONTd)full: (FRONT+1) mod n == REARempty: REAR == FRONTCorrect answer is option 'A'. Can you explain this answer?, a detailed solution for Suppose a circular queue of capacity (n −1) elements is implemented with an array of n elements.Assume that the insertion and deletion operations are carried out using REAR and FRONT as arrayindex variables, respectively. Initially, REAR = FRONT = 0. The conditions to detect queue fulland queue empty area)full: (REAR+1) mod n == FRONTempty: REAR == FRONTb)full: (REAR+1) mod n == FRONTempty: (FRONT+1) mod n == REARc)full: REAR == FRONTempty: (REAR+1) mod n == FRONTd)full: (FRONT+1) mod n == REARempty: REAR == FRONTCorrect answer is option 'A'. Can you explain this answer? has been provided alongside types of Suppose a circular queue of capacity (n −1) elements is implemented with an array of n elements.Assume that the insertion and deletion operations are carried out using REAR and FRONT as arrayindex variables, respectively. Initially, REAR = FRONT = 0. The conditions to detect queue fulland queue empty area)full: (REAR+1) mod n == FRONTempty: REAR == FRONTb)full: (REAR+1) mod n == FRONTempty: (FRONT+1) mod n == REARc)full: REAR == FRONTempty: (REAR+1) mod n == FRONTd)full: (FRONT+1) mod n == REARempty: REAR == FRONTCorrect answer is option 'A'. Can you explain this answer? theory, EduRev gives you an
ample number of questions to practice Suppose a circular queue of capacity (n −1) elements is implemented with an array of n elements.Assume that the insertion and deletion operations are carried out using REAR and FRONT as arrayindex variables, respectively. Initially, REAR = FRONT = 0. The conditions to detect queue fulland queue empty area)full: (REAR+1) mod n == FRONTempty: REAR == FRONTb)full: (REAR+1) mod n == FRONTempty: (FRONT+1) mod n == REARc)full: REAR == FRONTempty: (REAR+1) mod n == FRONTd)full: (FRONT+1) mod n == REARempty: REAR == FRONTCorrect answer is option 'A'. Can you explain this answer? tests, examples and also practice GATE tests.
|
|
Explore Courses for GATE exam
|
|
Suggested Free Tests
Signup for Free!
Signup to see your scores go up within 7 days! Learn & Practice with 1000+ FREE Notes, Videos & Tests.
|
© EduRev
|
Education Revolution
|
|
Signup to see your scores
go up within 7 days!
Access 1000+ FREE Docs, Videos and Tests
Takes less than 10 seconds to signup