MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 5 Mcqs, each offering curated multiple-choice questions to sharpen your Data Structure knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
In the above question would using arrays and swaping of elements in place of xor linked list would have been more efficient? |
| A. | no not all |
| B. | yes arrays would have been better than xor lists |
| C. | both would be same in efficiency |
| D. | can t say |
| Answer» C. both would be same in efficiency | |
| 2. |
Which of the following is not the properties of XOR lists? |
| A. | X X = 0 |
| B. | X 0 = X |
| C. | (X Y) Z = X (Y Z) |
| D. | X 0 = 1 |
| Answer» E. | |
| 3. |
Which of the following is an advantage of XOR list? |
| 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. | XOR list decreases the space requirement in doubly linked list |
| Answer» E. | |
| 4. |
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 |
| Answer» B. actuall memory address of next node | |
| 5. |
What is xor linked list? |
| 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 |
| Answer» B. uses of bitwise XOR operation to decrease storage requirements for linked lists | |