From the following sorting algorithms which algorithm needs the minimum number of swaps?

(a)

Bubble sort

(b)

Insertion sort

(c)

Selection sort

(d)

All the above

Which of the following is not a stable sorting algorithm?

(a)

Insertion sort

(b)

Quick sort

(c)

Merge sort

(d)

Selection sort

Time complexity of bubble sort in best case is

(a)

θ (n)

(b)

θ (nlogn)

(c)

θ (n2)

(d)

θ (n(logn) 2)

Which of the following is not an example of data structures?

(a)

Control statement

(b)

Structure

(c)

List

(d)

Dictionary

Which of the following is an example of data structures?

(a)

List

(b)

Tuple

(c)

Dictionary

(d)

All of these.

What is an Algorithm?

What is Sorting?

What is searching? Write its types.

What is algorithmic solution?

What is best algorithm?

List the characteristics of an algorithm.

Write a note on Asymptotic notation.

What do you understand by Dynamic programming?

Write a pseudo code for bubble sort algorithm

Write a pseudo code that defines Fibonacci Iterative algorithm with Dynamic programming approach.

What is Binary search? Discuss with example

Explain the Bubble sort algorithm with example.

Explain complexity of an algorithm.

Explain the selection sort Algorithm with an example.