Question
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 ?
a.
linked list. because we can swap elements easily
b.
arrays. because we can swap elements easily
c.
xor linked list. because there is no overhead of pointers and so memory is saved
d.
doubly linked list. because you can traverse back and forth
Posted under Linked Lists Data Structures and Algorithms
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. 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...
Similar Questions
Discover Related MCQs
Q. 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
View solution
Q. What are the important properties of xor lists
View solution
Q. Disadvantages of xor lists
View solution
Q. What does first and last nodes of a xor linked lists contain ? (let address of first and last be A and B)
View solution
Q. What does a xor linked list have ?
View solution
Q. What is xor linked list ?
View solution
Q. What is indexed skip list?
View solution
Q. Is a skip list like balanced tree?
View solution
Q. How to maintain multi-level skip list properties when insertions and deletions are done?
View solution
Q. 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)
View solution
Q. The nodes in a skip list may have many forward references. their number is determined
View solution
Q. To which datastructure are skip lists similar to in terms of time complexities in worst and best cases?
View solution
Q. What is the time complexity improvement of skip lists from linked lists in insertion and deletion?
View solution
Q. Skip lists are similar to which of the following datastructure?
View solution
Q. What is a skip list?
View solution
Q. Consider a small circular linked list. How to detect the presence of cycles in this list effectively?
View solution
Q. Which of the following is false about a circular linked list?
View solution
Q. Which of the following application makes use of a circular linked list?
View solution
Q. What is the time complexity of searching for an element in a circular linked list?
View solution
Q. What differentiates a circular linked list from a normal linked list?
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Data Structures and Algorithms? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!
.png)
