Lists Questions

MCQ bookmark_border

151.

What are different ways of implementing free lists and which is simple among them?

A

best fit, first fit, worst fit, simple-first fit

B

best fit, first fit, worst fit, simple-best fit

C

best fit, first fit, worst fit, simple-worst fit

D

best fit simple-best fit

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

152.

What is buddy memory management of free lists ?

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

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

153.

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

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

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

154.

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

A

internal fragmentation

B

it takes so much space

C

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

D

both a and c are correct

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

155.

Assume there is a free list which contains nodes and is filled with a value if it is already assigned and the value will be the size of requested block else will be 0. 

z = startpoint;
 while ((z < end) &&    \\ didn't reach end
   (*z <= len))          \\ too small to satisfy request
 {           
   assign this block
 }

The below code represents what ?

A

code for first fit

B

code for best fit

C

code for worst fit

D

none of the mentioned

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

156.

How are free blocks linked together mostly and in what addressing order?

A

circular linked list and increasing addressing order

B

linked list and decreasing addressing order

C

linked list and in no addressing order

D

none of the mentioned

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

157.

Accessing free list very frequently for wide range of addresses can lead to

A

paging

B

segmentation fault

C

memory errors

D

cache problems

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

158.

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.

A

i-only

B

ii-only

C

Both i and ii

D

None of the above

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

159.

What is the complexity of searching for a particular element in a Singly Linked List?

A

O(n)

B

O(1)

C

logn

D

nlogn

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

160.

Which of the following statements are correct with respect to Singly Linked List(SLL) and Doubly Linked List(DLL)?

A

Complexity of Insertion and Deletion at known position is O(n) in SLL and O(1) in DLL

B

SLL uses lesser memory per node than DLL

C

DLL has more searching power than SLL

D

All of the mentioned

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion