Queues MCQs | Data Structure

MCQ

41.

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

A

O(n)

B

O(nlogn)

C

O(logn)

D

O(1)

Discussion

MCQ

42.

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?

A

Only front pointer

B

Only rear pointer

C

Both front and rear pointer

D

None of the mentioned

Discussion

MCQ

43.

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

A

AVAIL

B

FRONT

C

REAR

D

None of the mentioned

Discussion

MCQ

44.

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

A

At the head of link list

B

At the centre position in the link list

C

At the tail of the link list

D

None of the mentioned

Discussion

MCQ

45.

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

A

FRONT is null

B

REAR is null

C

LINK is empty

D

None of the mentioned

Discussion

MCQ

46.

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

A

Underflow

B

Overflow

C

Front value

D

Rear value

Discussion

MCQ

47.

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

A

Underflow

B

Overflow

C

Front value

D

Rear value

Discussion

MCQ

48.

With what data structure can a priority queue be implemented?

A

Array

B

List

C

Heap

D

All of the mentioned

Discussion

MCQ

49.

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

A

Huffman codes

B

Interrupt handling in operating system

C

Undo operation in text editors

D

Bayesian spam filter

Discussion

MCQ

50.

Select the appropriate code that inserts elements into the list based on the given key value.(head and trail are dummy nodes to mark the end and beginning of the list, they do not contain any priority or element)

A

public void insert_key(int key,Object item) 
{
	if(key<0)
	{
		Systerm.our.println("invalid");
		System.exit(0);
	}
	else
	{
		Node temp = new Node(key,item,null);
		if(count == 0)
		{
			head.setNext(temp);
			temp.setNext(trail);
		}
		else
		{
			Node dup = head.getNext();
			Node cur = head;
			while((key>dup.getKey()) && (dup!=trail))
			{
				dup = dup.getNext();
				cur = cur.getNext();
			}
			cur.setNext(temp);
			temp.setNext(dup);
		}
		count++;
	}
}

B

public void insert_key(int key,Object item) 
{
	if(key<0)
	{
		Systerm.our.println("invalid");
		System.exit(0);
	}
	else
	{
		Node temp = new Node(key,item,null);
		if(count == 0)
		{
			head.setNext(temp);
			temp.setNext(trail);
		}
		else
		{
			Node dup = head.getNext();
			Node cur = dup;
			while((key>dup.getKey()) && (dup!=trail))
			{
				dup = dup.getNext();
				cur = cur.getNext();
			}
			cur.setNext(temp);
			temp.setNext(dup);
		}
		count++;
	}
}

C

public void insert_key(int key,Object item) 
{
	if(key<0)
	{
		Systerm.our.println("invalid");
		System.exit(0);
	}
	else
	{
		Node temp = new Node(key,item,null);
		if(count == 0)
		{
			head.setNext(temp);
			temp.setNext(trail);
		}
		else
		{
			Node dup = head.getNext();
			Node cur = head;
			while((key>dup.getKey()) && (dup!=trail))
			{
				dup = dup.getNext();
				cur = cur.getNext();
			}
			cur.setNext(dup);
			temp.setNext(cur);
		}
		count++;
	}
}

D

public void insert_key(int key,Object item) 
{
	if(key<0)
	{
		Systerm.our.println("invalid");
		System.exit(0);
	}
	else
	{
		Node temp = new Node(key,item,null);
		if(count == 0)
		{
			head.setNext(temp);
			temp.setNext(trail);
		}
		else
		{
			Node dup = head.getNext();
			Node cur = head;
			while((key>dup.getKey()) && (dup!=trail))
			{
				dup = cur
				cur = cur.getNext();
			}
			cur.setNext(dup);
			temp.setNext(cur);
		}
		count++;
	}
}

Discussion

Banking

Engineering

General

Medical

Queues Questions

Report Error

Report Error

Report Error

Report Error

Report Error

Report Error

Report Error

Report Error

Report Error

Report Error

Banking

Engineering

General

Medical

Queues Questions

report Report Error

report Report Error

report Report Error

report Report Error

report Report Error

report Report Error

report Report Error

report Report Error

report Report Error

report Report Error

Report Error

Report Error

Report Error

Report Error

Report Error

Report Error

Report Error

Report Error

Report Error

Report Error