Xor Linked List MCQ

Test your knowledge with important Xor Linked List MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30 + more Xor Linked List MCQs at Bissoy

• In the above question would using arrays and swaping of elements in place of xor linked list would have been more efficient?
  ক

  no not all

  খ

  yes arrays would have been better than xor lists

  গ

  both would be same in efficiency

  ঘ

  can’t say
• 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 ?
  ক

  linked list. because we can swap elements easily

  খ

  arrays. because we can swap elements easily

  গ

  xor linked list. because there is no overhead of pointers and so memory is saved

  ঘ

  doubly linked list. because you can traverse back and forth
• 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’t contain literal pointers iii)in order to calculate the address of the next node you need to remember the address of the previous node iv)xor lists are much efficient than single, doubly linked lists and arrays
  ক

  i, ii, iii, iv

  খ

  i, ii, iii

  গ

  i, ii

  ঘ

  i
• Which of the following is not the properties of XOR lists?
  ক

  X⊕X = 0

  খ

  X⊕0 = X

  গ

  (X⊕Y)⊕Z = X⊕(Y⊕Z)

  ঘ

  X⊕0 = 1
• Which of the following is an advantage of XOR list?
  ক

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

  খ

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

  গ

  In some contexts XOR of pointers is not defined

  ঘ

  XOR list decreases the space requirement in doubly linked list
• What does first and last nodes of a xor linked lists contain ? (let address of first and last be A and B)
  ক

  NULL xor A and B xor NULL

  খ

  NULL and NULL

  গ

  A and B

  ঘ

  NULL xor A and B
• What does a xor linked list have?
  ক

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

  খ

  actuall memory address of next node

  গ

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

  ঘ

  every node stores xor 0 and the current node address
• What is xor linked list?
  ক

  uses of bitwise XOR operation to decrease storage requirements for doubly linked lists

  খ

  uses of bitwise XOR operation to decrease storage requirements for linked lists

  গ

  uses of bitwise operations to decrease storage requirements for doubly linked lists

  ঘ

  just another form of linked list