Question 21 : What is indexed skip list?
1. it stores width of link in place of element
2. it stores index values
3. array based linked list
4. indexed tree
View Answer   Discuss with Members

Question 22 : The self organizing list improves the efficiency of _______
1. binary search
2. jump search
3. sublist search
4. linear search
View Answer   Discuss with Members

Question 23 : What are the disadvantages in implementing buddy system algorithm for free lists ?
1. internal fragmentation
2. it takes so much space
3. we no more have the hole lists in order of memory address, so it is difficult to detect if 2 holes remain adjacent in memory and shall be merged into one hole
4. both a and c are correct
View Answer   Discuss with Members

Question 24 : Is a skip list like balanced tree?
1. true
2. false
3.
4.
View Answer   Discuss with Members

Question 25 : In the above question would using arrays and swaping of elements in place of xor linked list would have been more efficient ?
1. no not all
2. yes arrays would have been better than xor lists
3. both would be same in efficiency
4. can't say
View Answer   Discuss with Members

Question 26 : What is xor linked list ?
1. uses of bitwise XOR operation to decrease storage requirements for doubly linked lists
2. uses of bitwise XOR operation to decrease storage requirements for linked lists
3. uses of bitwise operations to decrease storage requirements for doubly linked lists
4. just another form of linked list
View Answer   Discuss with Members

Question 27 : Disadvantages of xor lists
1. Almost of debugging tools cannot follow the XOR chain, making debugging difficult
2. You need to remember the address of the previously accessed node in order to calculate the next node's address
3. In some contexts XOR of pointers is not defined
4. All of the mentioned
View Answer   Discuss with Members

Question 28 : 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 ?
1. linked list. because we can swap elements easily
2. arrays. because we can swap elements easily
3. xor linked list. because there is no overhead of pointers and so memory is saved
4. doubly linked list. because you can traverse back and forth
View Answer   Discuss with Members

Question 29 : To which datastructure are skip lists similar to in terms of time complexities in worst and best cases?
1. balanced binary search trees
2. binary search trees
3. binary trees
4. linked lists
View Answer   Discuss with Members

Question 30 : What is a skip list?
1. a linkedlist with size value in nodes
2. a linkedlist that allows faster search within an ordered sequence
3. a linkedlist that allows slower search within an ordered sequence
4. a tree which is in the form of linked list
View Answer   Discuss with Members