How does implicit free lists(garbage collection) works in ad...

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

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

In linked list implementation of a queue, where does a new element be inserted?

At the head of link list

At the centre position in the link list

At the tail of the link list

None of the mentioned

Discussion

MCQ

Linked list is considered as an example of ___________ type of memory allocation.

Dynamic

Static

Compile time

None of the mentioned

Discussion

MCQ

Given 10,8,6,7,9
swap the above numbers such that finally you got 6,7,8,9,10
so now reverse 10
9,7,6,8,10
now reverse 9
8,6,7,9,10
7,6,8,9,10
6,7,8,9,10
at this point 6 is ahead so no more reversing can be done so stop.
To implement above algorithm which datastructure is better and why ?

linked list. because we can swap elements easily

arrays. because we can swap elements easily

xor linked list. because there is no overhead of pointers and so memory is saved

doubly linked list. because you can traverse back and forth

Discussion

MCQ

What is xor linked list ?

uses of bitwise XOR operation to decrease storage requirements for doubly linked lists

uses of bitwise XOR operation to decrease storage requirements for linked lists

uses of bitwise operations to decrease storage requirements for doubly linked lists

just another form of linked list

Discussion

MCQ

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;

new_node=(struct node *)malloc((struct node));

new_node=(struct *)malloc(sizeof(struct node));

new_node=(struct node)malloc(sizeof(struct node));

new_node=(struct node *)malloc(sizeof(struct node));

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