Question Detail

Sort which compares adjacent elements in a list and switches where necessary is

Insertion sort
Heap sort
Quick sort
Bubble sort

Answer: Option D

Similar Questions :

1. Repeated execution of simple computation may cause compounding of

round off errors
syntax errors
run time errors
logic errors

Answer: Option A

2. Which sorting method is slowest

Quick sort
Heap sort
Shell sort
Bubble sort

Answer: Option D

3. minimum number of stacks of size n required to implement a queue of size n

One
Two
Three
Four

Answer: Option B

4. Which statement we should ignore in structure programming

WHILE-DO
GO-TO
IT-ELSE
SWITCH

Answer: Option B

5. Recursive problems are implemented by

queues
stacks
linked lists
strings

Answer: Option B

Read more from - Data Structure Questions Answers - Chapter 1