In Breadth First Search of Graph, which of the following data structure is used?
a) Stack. b) Queue. c) Linked List. d) None of these.
a) Stack. b) Queue. c) Linked List. d) None of these.
a) Nodes b) Edges c) Direction of edges d) Parallel edges
a) Inverse sorting b) Direct sorting c) Both a and b d) None of these
a) Different b) Same c) May be same d) None of these
a) Comparison sort b) Direct sort c) Insertion sort d) None of these
a) O(n) b) O(n2) c) O(3n) d) None of these.
a) Exchanging method b) Direct method c) Both a and b d) None of these
a) O(n2) b) O(n) c) O(2n) d) None of these.
a) Unswap b) Swaps c) Search d) Rotation
a) Selection sort b) Insertion sort c) Both a and b d) None of these.
a) Largest element b) Smallest element c) Both a and b d) None of these.
a) Straight forward approach b) Straight backward approach c) Both a and b d) None of these
a) Bubble sort b) Insertion sort c) Quick sort d) Merge sort
a) Insertion sort b) Heap sort c) Bubble sort d) Quick sort
a) Insertion sort b) Selection sort c) Quick sort d) None of these.
a) Insertion sort b) Selection sort c) Quick sort d) None of these