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. Which of the languages is often translated to the pseudo code

PASCAL
FORTRAN
PL/I
BASIC

Answer: Option A

2. Which statement we should ignore in structure programming

WHILE-DO
GO-TO
IT-ELSE
SWITCH

Answer: Option B

3. The complexity of Binary search algorithm is

O(n)
O(log n)
O(n2)
O(n log n)

Answer: Option B

4. Deletion from one end and insertion from other end is

stack
branch
tree
queue

Answer: Option D

5. The memory address of the first element of an array is called

floor address
first address
foundation address
base address

Answer: Option D

Read more from - Data Structure Questions Answers - Chapter 1