Given 108679br Swap The Above Numbers Such That Finally You Got #462
Given 10,8,6,7,9<br /> swap the above numbers such that finally you got 6,7,8,9,10<br /> so now reverse 10<br /> 9,7,6,8,10<br /> now reverse 9<br /> 8,6,7,9,10<br /> 7,6,8,9,10<br /> 6,7,8,9,10<br /> at this point 6 is ahead so no more reversing can be done so stop.<br /> To implement above algorithm which datastructure is better and why ?
This multiple choice question (MCQ) is related to the book/course
gs gs121 Data Structures and Algorithms.
It can also be found in
gs gs121 Types of Lists - Xor Linked List - Quiz No.1.
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 ?
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
Similar question(s) are as followings:
Online Quizzes of gs121 Data Structures and Algorithms
Binary Trees - Binary Search Tree - Quiz No.1
gs gs121 Data Structures and Algorithms
Online Quizzes
Binary Trees - Binary Search Tree - Quiz No.2
gs gs121 Data Structures and Algorithms
Online Quizzes
Binary Trees - Preorder Traversal - Quiz No.1
gs gs121 Data Structures and Algorithms
Online Quizzes
