Linked Lists in Data Structures MCQ question and answer with solution

A. i, ii, iii, iv

B. i, ii, iii

C. i, ii

D. i

A.

struct node 
{                                                                           
    int data;                            
    struct node *previous; 
    struct node *top;
};

B.

struct node 
{                                                                           
    int data;
    struct node *next; 
    struct node *top;
};

C.

struct node 
{                                                                           
    int data; 
    struct node *next; 
    struct node *previous;
    struct node *top;
};

D.

struct node 
{                                                                           
    int data;   
    struct node *next; 
    struct node *previous;
};

A. O(n)

B. O(1)

C. O(log n)

D. O(n²)

A. O(n) to O(logn) where n is number of elements

B. O(n) to O(1) where n is number of elements

C. no change

D. O(n) to O(n²) where n is number of elements

A. modified version of first fit

B. buddy allocation keeps several‭ free lists,‭ ‬each one holds blocks which are of one particular size

C. modified version of best fit

D. a tree representation of free lists

A. whichever comes last will be added to free list

B. whichever comes first will be added to free list

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

D. makes a probabilistic guess

A. linked list. because we can swap elements easily

B. arrays. because we can swap elements easily

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

D. doubly linked list. because you can traverse back and forth

A. binary search

B. jump search

C. sublist search

D. linear search

A. paging

B. segmentation fault

C. memory errors

D. cache problems

A. least recently used

B. count

C. traspose

D. exchange