Question

What does the following piece of code do?

public Object function()
{
 if(isEmpty())
 return -999;
 else
 {
  Object high;
  high = q[front];
  return high;
 }
}

a.

Dequeue

b.

Enqueue

c.

Return the front element

d.

None of the mentioned

Posted under Data Structures and Algorithms

Answer: (c).Return the front element

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. What does the following piece of code do?

Add Comment

Similar Questions

Discover Related MCQs

Q. What is the need for a circular queue?

View solution

Q. What is the space complexity of a linear queue having n elements?

View solution

Q. In linked list implementation of queue, if only front pointer is maintained, which of the following operation take worst case linear time?

View solution

Q. In linked list implementation of a queue, where does a new element be inserted?

View solution

Q. In linked list implementation of a queue, front and rear pointers are tracked. Which of these pointers will change during an insertion into a NONEMPTY queue?

View solution

Q. In linked list implementation of a queue, front and rear pointers are tracked. Which of these pointers will change during an insertion into EMPTY queue?

View solution

Q. In case of insertion into a linked queue, a node borrowed from the __________ list is inserted in the queue.

View solution

Q. In linked list implementation of a queue, from where is the item deleted?

View solution

Q. In linked list implementation of a queue, the important condition for a queue to be empty is?

View solution

Q. The essential condition which is checked before insertion in a linked queue is?

View solution

Q. The essential condition which is checked before deletion in a linked queue is?

View solution

Q. With what data structure can a priority queue be implemented?

View solution

Q. Which of the following is not an application of priority queue?

View solution

Q. What is the time complexity to insert a node based on key in a priority queue?

View solution

Q. What is not a disadvantage of priority scheduling in operating systems?

View solution

Q. What are the advantages of priority queues?

View solution

Q. What is the time complexity to insert a node based on position in a priority queue?

View solution

Q. What is a dequeue?

View solution

Q. What are the applications of dequeue?

View solution

Q. What is the time complexity of deleting from the rear end of the dequeue implemented with a singly linked list?

View solution

View All MCQs on Data Structures and Algorithms

Suggested Topics

Are you eager to expand your knowledge beyond Data Structures and Algorithms? We've curated a selection of related categories that you might find intriguing.

Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!

Object Oriented Programming Using C++

Enhance your programming skills with our MCQs on Object Oriented Programming using...

Data Science

Discover the fascinating world of extracting insights from data with our Data Science...

Data Structures and Algorithms

Journey through the fundamentals of Data Structures and Algorithms with our extensive...

Digital Logic Design

Understand the foundation of digital computers with our Digital Logic Design MCQs....

MATLAB

Hone your computational mathematics skills with our MATLAB MCQs. Understand...

Systems Analysis and Design Methods

Get familiar with the process of designing and improving business systems with our...

Cryptography and Network Security

Secure your knowledge of information security with our Cryptography and Network...

CSS

Polish your web design skills with our CSS MCQs. Learn about selectors, properties,...

Digital Communication

Master the basics of electronic communication with our Digital Communication MCQs....