## Click on any option to know the CORRECT ANSWERS

 Question 1
 A uses of bitwise XOR operation to decrease storage requirements for doubly linked lists B uses of bitwise XOR operation to decrease storage requirements for linked lists C uses of bitwise operations to decrease storage requirements for doubly linked lists D just another form of linked list

Question 1 Explanation:
Why we use bitwise XOR operation is to decrease storage requirements for doubly linked lists.

 Question 2
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

Question 2 Explanation:
Every node stores the XOR of addresses.

 Question 3
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

Question 3 Explanation:
NULL xor A and B xor NULL.

 Question 4
 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's address C In some contexts XOR of pointers is not defined D All of the mentioned

Question 4 Explanation:
All the listed options are right.

 Question 5
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