Menu

Question Discussion & Solution

MCQ
Q.
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++;
}

forum Community Discussion

speaker_notes_off

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

login Login to Discuss

auto_awesome Similar Questions

MCQ
1.
Skip lists are similar to which of the following datastructure?
forum Discussion
MCQ
2.
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;
  }
}
forum Discussion
MCQ
3.
What are the time complexities of finding 8th element from beginning and 8th element from end in a singly linked list? Let n be the number of nodes in linked list, you may assume that n>8.
forum Discussion
MCQ
4.
How does implicit free lists(garbage collection) works in adding memory to free list ?
forum Discussion
MCQ
5.
Which of the following is false about a circular linked list?
forum Discussion

category More Data Structure Topics

article

Data Structure Basics

format_list_bulleted 128 MCQs
article

Abstract data types

format_list_bulleted 37 MCQs
article

Arrays

format_list_bulleted 134 MCQs
article

Lists

format_list_bulleted 166 MCQs
article

Stacks

format_list_bulleted 165 MCQs
article

Queues

format_list_bulleted 61 MCQs
article

Trees

format_list_bulleted 133 MCQs
article

Binary Trees

format_list_bulleted 120 MCQs
article

B Trees

format_list_bulleted 8 MCQs
article

Heaps

format_list_bulleted 36 MCQs
article

Hash based structures

format_list_bulleted 7 MCQs
article

Graphs

format_list_bulleted 157 MCQs
article

Mixed

format_list_bulleted 10 MCQs