Menu

Question Discussion & Solution

MCQ
Q.
Which of the following statement is true?

i) Using singly linked lists and circular list, it is not possible to traverse the list backwards.

ii) To find the predecessor, it is required to traverse the list from the first node in case of singly linked list.

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.
In circular linked list, insertion of node requires modification of?
forum Discussion
MCQ
2.
Linked lists are best suited
forum Discussion
MCQ
3.
Consider the following linked list representation. Which of the following statement is used to create a node ?

struct node {
      int data;
      struct node *next;
}start = NULL;
struct node *new_node;
forum Discussion
MCQ
4.
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 Discussion
MCQ
5.
If in a linked list address of first node is 1020 then what will be the address of node at 5th position ?
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