Lists Questions

MCQ bookmark_border

141.

What does a xor linked list have ?

A

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

B

actuall memory address of next node

C

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

D

every node stores xor 0 and the current node address

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

142.

What does first and last nodes of a xor linked lists contain ? (let address of first and last be A and B)

A

NULL xor A and B xor NULL

B

NULL and NULL

C

A and B

D

NULL xor A and B

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

143.

Disadvantages of xor lists

A

Almost of debugging tools cannot follow the XOR chain, making debugging difficult

B

You need to remember the address of the previously accessed node in order to calculate the next node

C

In some contexts XOR of pointers is not defined

D

All of the mentioned

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

144.

What are the important properties of xor lists

A

X?X = 0

B

X?0 = X

C

(X?Y)?Z = X?(Y?Z)

D

All of the mentioned

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

145.

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

A

i, ii, iii, iv

B

i, ii, iii

C

i, ii

D

i

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

146.

What

A

nothing wrong. everything is fine

B

type casting at return is missing

C

parameters are wrong

D

total logic is wrong

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

147.

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 ?

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

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

148.

Free lists are used in

A

static memory allocation

B

dynamic memory allocation

C

contagious allocations

D

are used for speeding up linked list operations

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

149.

What are implicit and explicit implementations of freelists?

A

garbage collection and new or malloc operators respectively

B

new or malloc and garbage collection respectively

C

implicit implementation is not favored

D

explicit implementation is not favored

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

150.

What datastructures can be used in implementing a free list?

A

only linked list

B

linked list or sort trees

C

arrays

D

trees

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion