Queues Questions

MCQ bookmark_border

51.

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

A

O(nlogn)

B

O(logn)

C

O(n)

D

O(n^2)

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

52.

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

A

A low priority process might have to wait indefinitely for the CPU

B

If the system crashes, the low priority systems may be lost permanently

C

Interrupt handling

D

None of the mentioned

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

53.

What are the advantages of priority queues?

A

Easy to implement

B

Processes with different priority can be efficiently handled

C

Applications with differing requirements

D

All of the mentioned

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

54.

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

A

O(nlogn)

B

O(logn)

C

O(n)

D

O(n^2)

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

55.

What is a dequeue?

A

A queue with insert/delete defined for both front and rear ends of the queue

B

A queue implemented with a doubly linked list

C

A queue implemented with both singly and doubly linked lists

D

None of the mentioned

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

56.

Select the function which performs insertion at the front end of the dequeue?

a)

public void function(Object item)
{
 Node temp = new Node(item,null);
 if(isEmpty())
 {
  temp.setNext(trail);
  head.setNext(temp);
 }
 else
 {
  Node cur = head.getNext();
  temp.setNext(cur);
  head.setNext(temp);
 }
 size++;
}

b)

public void function(Object item)
{
 Node temp = new Node(item,null);
 if(isEmpty())
 {
  temp.setNext(trail);
  head.setNext(trail);
 }
 else
 {
  Node cur = head.getNext();
  temp.setNext(cur);
  head.setNext(temp);
 }
 size++;
}

c)

public void function(Object item)
{
 Node temp = new Node(item,null);
 if(isEmpty())
 {
  Node cur = head.getNext();
  temp.setNext(cur);
  head.setNext(temp);
 }
 else
 {
  temp.setNext(trail);
  head.setNext(temp);
 }
 size++;
}

d) None of the mentioned

A

a

B

b

C

c

D

d

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

57.

What is the functionality of the following piece of code?

public void function(Object item)
{
	Node temp=new Node(item,trail);
	if(isEmpty())
	{
		head.setNext(temp);
		temp.setNext(trail);
	}
	else
	{
		Node cur=head.getNext();
		while(cur.getNext()!=trail)
		{
			cur=cur.getNext();
		}
		cur.setNext(temp);
	}
	size++;
}

A

Insert at the front end of the dequeue

B

Insert at the rear end of the dequeue

C

Fetch the element at the rear end of the dequeue

D

Fetch the element at the front end of the dequeue

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

58.

What are the applications of dequeue?

A

A-Steal job scheduling algorithm

B

Can be used as both stack and queue

C

To find the maximum of all sub arrays of size k

D

All of the mentioned

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

59.

Which of the following can be used to delete an element from the front end of the queue?

A

public Object deleteFront() throws emptyDEQException
{
	if(isEmpty())
		throw new emptyDEQException("Empty");
	else
	{
		Node temp = head.getNext();
		Node cur = temp;
		Object e = temp.getEle();
		head.setNext(cur);
		size--;
		return e;
	}
}j

B

public Object deleteFront() throws emptyDEQException
{
	if(isEmpty())
		throw new emptyDEQException("Empty");
	else
	{
		Node temp = head.getNext();
		Node cur = temp.getNext();
		Object e = temp.getEle();
		head.setNext(cur);
		size--;
		return e;
	}
}

C

public Object deleteFront() throws emptyDEQException
{
	if(isEmpty())
		throw new emptyDEQException("Empty");
	else
	{
		Node temp = head.getNext();
		Node cur = temp.getNext();
		Object e = temp.getEle();
		head.setNext(temp);
		size--;
		return e;
	}
}

D

public Object deleteFront() throws emptyDEQException
{
	if(isEmpty())
		throw new emptyDEQException("Empty");
	else
	{
		Node temp = head.getNext();
		Node cur = temp.getNext();
		Object e = temp.getEle();
		temp.setNext(cur);
		size--;
		return e;
	}
}

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

60.

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

A

O(nlogn)

B

O(logn)

C

O(n)

D

O(n^2)

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion