How do you calculate the pointer difference in a memory effi...

MCQ

How do you calculate the pointer difference in a memory efficient double linked list?

head xor tail

pointer to previous node xor pointer to next node

pointer to previous node

pointer to next node

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

The time required to search an element in a linked list of length n is

O(1)

O(n)

0 (n2)

O(log2

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

MCQ

Which of the following statements are true ?
i) practical application of XOR linked lists are in environments with limited space requirements, such as embedded devices.

ii)xor lists are not suitable because most garbage collectors will fail to work properly with classes or structures that don

i, ii, iii, iv

i, ii, iii

i, ii

Discussion

MCQ

What are the disadvantages in implementing buddy system algorithm for free lists ?

internal fragmentation

it takes so much space

we no more have the hole lists in order of memory address, so it is difficult to detect if 2 holes remain adjacent in memory and shall be merged into one hole

both a and c are correct

Discussion

MCQ

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

1 4 6 6 4 1

1 3 5 1 3 5

1 2 3 5

1 3 5 5 3 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