Question 1 : Are the below statements true about skiplists?
In a sorted set of elements skip lists can implement the below operations
i.given a element find closest element to the given value in the sorted set in O(logn)
ii.find the number of elements in the set whose values fall a given range in O(logn)
1. true
2. false
3.
4.
View Answer   Discuss with Members

Question 2 : Which of the following is not the rearranging method used to implement self-organizing lists?
1. count method
2. move to front method
3. ordering method
4. least frequently used
View Answer   Discuss with Members

Question 3 : The self organizing list improves _____
1. average access time
2. insertion
3. deletion
4. binary search
View Answer   Discuss with Members

Question 4 : What are different ways of implementing free lists and which is simple among them?
1. best fit, first fit, worst fit, simple-first fit
2. best fit, first fit, worst fit, simple-best fit
3. best fit, first fit, worst fit, simple-worst fit
4. best fit simple-best fit
View Answer   Discuss with Members

Question 5 : What are the important properties of xor lists
1. X⊕X = 0
2. X⊕0 = X
3. (X⊕Y)⊕Z = X⊕(Y⊕Z)
4. All of the mentioned
View Answer   Discuss with Members

Question 6 : Which of the following is true about the Move-To-Front Method for rearranging nodes?
1. node with highest access count is moved to head of the list
2. requires extra storage
3. may over-reward infrequently accessed nodes
4. requires a counter for each node
View Answer   Discuss with Members

Question 7 : What are implicit and explicit implementations of freelists?
1. garbage collection and new or malloc operators respectively
2. new or malloc and garbage collection respectively
3. implicit implementation is not favored
4. explicit implementation is not favored
View Answer   Discuss with Members

Question 8 : In _____________ method, whenever a node is accessed, it might move to the head of the list if its number of accesses becomes greater than the records preceding it.
1. least recently used
2. count
3. traspose
4. exchange
View Answer   Discuss with Members

Question 9 : Symbol tables during compilation of program is efficiently implemented using __________
1. a singly linked list
2. a doubly linked list
3. a self organizing list
4. an array
View Answer   Discuss with Members

Question 10 : What datastructures can be used in implementing a free list?
1. only linked list
2. linked list or sort trees
3. arrays
4. trees
View Answer   Discuss with Members