In circular linked list, insertion of node requires modifica...

MCQ

In circular linked list, insertion of node requires modification of?

One pointer

Two pointer

Three pointer

Requires no modification

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

How does implicit free lists(garbage collection) works in adding memory to free list ?

whichever comes last will be added to free list

whichever comes first will be added to free list

certain blocks cannot be used if there are no pointers to them and hence they can be freed

makes a probabilistic guess

Discussion

MCQ

What does a xor linked list have ?

every node stores the XOR of addresses of previous and next nodes

actuall memory address of next node

every node stores the XOR of addresses of previous and next two nodes

every node stores xor 0 and the current node address

Discussion

MCQ

Applications of Linked List are

Simulation, event driven systems

Postfix and prefix manipulations

Dictionary systems, polynomial manipulations

Fixed block storage allocation, garbage collection

Discussion

MCQ

A variant of linked list in which last node of the list points to the first node of the list is?

Singly linked list

Doubly linked list

Circular linked list

Multiply linked list

Discussion

MCQ

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;
  }
}

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

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

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

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

Discussion

Banking

Engineering

General

Medical

Question Discussion & Solution

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Data Structure Topics

Data Structure Basics

Abstract data types

Arrays

Lists

Stacks

Queues

Trees

Binary Trees

B Trees

Heaps

Hash based structures

Graphs

Mixed

Banking

Engineering

General

Medical

Question Discussion & Solution

report Report Error

forum Community Discussion

auto_awesome Similar Questions

report Report Error

report Report Error

report Report Error

report Report Error

report Report Error

category More Data Structure Topics

Data Structure Basics

Abstract data types

Arrays

Lists

Stacks

Queues

Trees

Binary Trees

B Trees

Heaps

Hash based structures

Graphs

Mixed

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Data Structure Topics