# YOU may join our Telegram for all subjects PDF BOOKS. https://t.me/+Ccx9McEia7wyODg1

 Question 1 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
 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 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
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 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
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 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]