Lists Questions

MCQ bookmark_border

121.

What differentiates a circular linked list from a normal linked list?

A

You cannot have the

B

It is faster to traverse the circular linked list

C

You may or may not have the

D

All of the mentioned

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

122.

How do you count the number of elements in the circular linked list?

A

public int length(Node head)
{
	int length = 0;
	if( head == null)
		return 0;
	Node temp = head.getNext();
	while(temp != head)
	{
		temp = temp.getNext();
		length++;
	}
	return length;
}

B

public int length(Node head)
{
	int length = 0;
	if( head == null)
		return 0;
	Node temp = head.getNext();
	while(temp != null)
	{
		temp = temp.getNext();
		length++;
	}
	return length;
}

C

public int length(Node head)
{
	int length = 0;
	if( head == null)
		return 0;
	Node temp = head.getNext();
	while(temp != head && temp != null)
	{
		temp = head.getNext();
		length++;
	}
	return length;
}

D

public int length(Node head)
{
	int length = 0;
	if( head == null)
		return 0;
	Node temp = head.getNext();
	while(temp != head && temp == null)
	{
		temp = head.getNext();
		length++;
	}
	return length;
}

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

123.

What is the functionality of the following piece of code? Select the most appropriate

public void function(int data)
{
	int flag = 0;
	if( head != null)
	{
		Node temp = head.getNext();
		while((temp != head) && (!(temp.getItem() == data)))
		{
			temp = temp.getNext();
			flag = 1;
			break;
		}
	}
	if(flag)
		System.out.println("success");
	else
		System.out.println("fail");
}

A

Print success if a particular element is not found

B

Print fail if a particular element is not found

C

Print success if a particular element is equal to 1

D

Print fail if the list is empty

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

124.

What is the time complexity of searching for an element in a circular linked list?

A

O(n)

B

O(nlogn)

C

O(1)

D

None of the mentioned

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

125.

Which of the following application makes use of a circular linked list?

A

Undo operation in a text editor

B

Recursive function calls

C

Allocating CPU to resources

D

All of the mentioned

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

126.

Choose the code snippet which inserts a node to the head of the list?

a)

public void insertHead(int data)
{
 Node temp = new Node(data);
 Node cur = head;
 while(cur.getNext() != head)
  cur = cur.getNext()
 if(head == null)
 {
  head = temp;
  head.setNext(head);
 }
 else
 {
  temp.setNext(head);
  head = temp;
  cur.setNext(temp);
 }
 size++;
}

b)

public void insertHead(int data)
{
 Node temp = new Node(data);
 while(cur != head)
  cur = cur.getNext()
 if(head == null)
 {
  head = temp;
  head.setNext(head);
 }
 else
 {
  temp.setNext(head.getNext());
  cur.setNext(temp);
 }
 size++;
}

c)

public void insertHead(int data)
{
 Node temp = new Node(data);
 if(head == null)
 {
  head = temp;
  head.setNext(head);
 }
 else
 {
  temp.setNext(head.getNext());
  head = temp;
 }
 size++;
}

d)

public void insertHead(int data)
{
 Node temp = new Node(data);
 if(head == null)
 {
  head = temp;
  head.setNext(head.getNext());
 }
 else
 {
  temp.setNext(head.getNext());
  head = temp;
 }
 size++;
}

A

a

B

b

C

c

D

d

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

127.

What is the functionality of the following code? Choose the most appropriate answer.

A

Return data from the end of the list

B

Returns the data and deletes the node at the end of the list

C

Returns the data from the beginning of the list

D

Returns the data and deletes the node from the beginning of the list

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

128.

What is the functionality of the following code? Choose the most appropriate answer.

A

Return data from the end of the list

B

Returns the data and deletes the node at the end of the list

C

Returns the data from the beginning of the list

D

Returns the data and deletes the node from the beginning of the list

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

129.

Which of the following is false about a circular linked list?

A

Every node has a successor

B

Time complexity of inserting a new node at the head of the list is O(1)

C

Time complexity for deleting the last node is O(n)

D

None of the mentioned

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

130.

Consider a small circular linked list. How to detect the presence of cycles in this list effectively?

A

Keep one node as head and traverse another temp node till the end to check if its

B

Have fast and slow pointers with the fast pointer advancing two nodes at a time and slow pointer advancing by one node at a time

C

Cannot determine, you have to pre-define if the list contains cycles

D

None of the mentioned

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion