Lists Questions

MCQ bookmark_border

111.

What is the output of following function for start pointing to first node of following linked list?
1->2->3->4->5->6

void fun(struct node* start)
{
  if(start == NULL)
    return;
  printf("%d  ", start->data); 
  
  if(start->next != NULL )
    fun(start->next->next);
  printf("%d  ", start->data);
}

A

1 4 6 6 4 1

B

1 3 5 1 3 5

C

1 2 3 5

D

1 3 5 5 3 1

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

112.

The following C function takes a simply-linked list as input argument. It modifies the list by moving the last element to the front of the list and returns the modified list. Some part of the code is left blank. Choose the correct alternative to replace the blank line.
typedef struct node 
{
  int value;
  struct node *next;
}Node;
  
Node *move_to_front(Node *head) 
{
  Node *p, *q;
  if ((head == NULL: || (head->next == NULL)) 
    return head;
  q = NULL; p = head;
  while (p-> next !=NULL) 
  {
    q = p;
    p = p->next;
  }
  _______________________________
  return head;
}

A

q = NULL; p->next = head; head = p;

B

q->next = NULL; head = p; p->next = head;

C

head = p; p->next = q; q->next = NULL;

D

q->next = NULL; p->next = head; head = p;

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

113.

The following C function takes a single-linked list of integers as a parameter and rearranges the elements of the list. The function is called with the list containing the integers 1, 2, 3, 4, 5, 6, 7 in the given order. What will be the contents of the list after the function completes execution?

struct node 
{
  int value;
  struct node *next;
};
void rearrange(struct node *list)
{
  struct node *p, * q;
  int temp;
  if ((!list) || !list->next) 
      return;
  p = list;
  q = list->next;
  while(q) 
  {
     temp = p->value;
     p->value = q->value;
     q->value = temp;
     p = q->next;
     q = p?p->next:0;
  }
}

A

1, 2, 3, 4, 5, 6, 7

B

2, 1, 4, 3, 6, 5, 7

C

1, 3, 2, 5, 4, 7, 6

D

2, 3, 4, 5, 6, 7, 1

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

114.

What is the time complexity to count the number of elements in the linked list?

A

O(1)

B

O(n)

C

O(logn)

D

None of the mentioned

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

115.

What is the functionality of the following code?

public void function(Node node)
{
	if(size == 0)
		head = node;
	else
	{
		Node temp,cur;
		for(cur = head; (temp = cur.getNext())!=null; cur = temp);
		cur.setNext(node);
	}
	size++;
}

A

Inserting a node at the beginning of the list

B

Deleting a node at the beginning of the list

C

Inserting a node at the end of the list

D

Deleting a node at the end of the list

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

116.

What is the space complexity for deleting a linked list?

A

O(1)

B

O(n)

C

Either O(1) or O(n)

D

O(logn)

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

117.

How would you delete a node in the singly linked list? The position to be deleted is given.

A

a

B

b

C

c

D

d

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

118.

Which of these is an application of linked lists?

A

To implement file systems

B

For separate chaining in hash-tables

C

To implement non-binary trees

D

All of the mentioned

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

119.

Which of the following piece of code has the functionality of counting the number of elements in the list?

A

a

B

b

C

c

D

d

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

120.

How do you insert an element at the beginning of the list?

A

public void insertBegin(Node node)
{
	node.setNext(head);
	head = node;
	size++;
}

B

public void insertBegin(Node node)
{
	head = node;
	node.setNext(head);
	size++;
}

C

public void insertBegin(Node node)
{
	Node temp = head.getNext()
	node.setNext(temp);
	head = node;
	size++;
}

D

public void insertBegin(Node node)
{
	Node temp = head.getNext()
	node.setNext(temp);
	node = head;
	size++;
}

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion