The word comes from the name of a Persian mathematician Abu Ja’far Mohammed ibn-i Musa al Khowarizmi is called?

(a)

Flowchart

(b)

Flow

(c)

Algorithm

(d)

Syntax

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

Time complexity of bubble sort in best case is

(a)

θ (n)

(b)

θ (nlogn)

(c)

θ (n2)

(d)

θ (n(logn) 2)

The Θ notation in asymptotic evaluation represents

(a)

Base case

(b)

Average case

(c)

Worst case

(d)

NULL case

If a problem can be broken into subproblems which are reused several times, the problem possesses which property?

(a)

Overlapping subproblems

(b)

Optimal substructure

(c)

Memoization

(d)

Greedy

Which of the following is a finite set of instructions to accomplish a particular task?

(a)

Flowchart

(b)

Functions

(c)

Algorithm

(d)

Abstraction

Which of the following are the characteristics of an algorithm?
(i) Definiteness
(ii) Correctness
(iii) Effectiveness

(a)

i, ii

(b)

ii, iii

(c)

Only ii

(d)

i, ii and iii

Which of the following is not a characteristic of an algorithm?

(a)

Definiteness

(b)

Correctness

(c)

Data structure

(d)

Effectivenes

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.

Which of the following is not a searching technique?
(i) Linear
(ii) Binary
(iii) Selection
(iv) Merge

(a)

Only i

(b)

Only ii

(c)

Only iii

(d)

iii and iv

The way of defining an algorithm is called

(a)

Pseudo strategy

(b)

Programmic strategy

(c)

Algorithmic strategy

(d)

Data structured strategy

Which characteristics of algorithm defined the operation involving division by zero?

(a)

Finiteness

(b)

Definiteness

(c)

Input

(d)

Correctness

How many asymptotic notations are mostly used to represent time complexity of algorithms?

(a)

Three

(b)

Two

(c)

One

(d)

Many

Linear search is also called

(a)

Sequential search

(b)

Quick search

(c)

Binary search

(d)

Selection search

What is Sorting?

What is searching? Write its types.

Give an example of data structures

How the efficiency of an algorithm is defined?

What does analysis of an algorithm deals with?

How the analysis of algorithms and performance evaluation can be divided?Explain.

Name the two factors, which decide the efficiency of an algorithm.

Define algorithmetic strategy?

What are the three asymptotic notations used to represent time complexity of algorithms?

Write a note on Big omega asymptotic notation.

List the characteristics of an algorithm.

What are the factors that influence time and space complexity.

Write a note on Asymptotic notation.

List the manipulation manipulated effectively through data structures by algorithm.

Write a note on time/space trade off

Write a pseudo code for linear search

Write a pseudo code for Binary search

Write a pseudo code for bubble sort algorithm

Write a pseudo code for selection sort Algorithm.

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

Explain the characteristics of an algorithm.

Discuss about Linear search algorithm.

Explain the concept of Dynamic programming with suitable example.

Explain complexity of an algorithm.

Define efficiency of an algorithm? How the efficiency of an algorithm was determined?

Explain the selection sort Algorithm with an example.

Explain the sorting algorithm that uses n-1 number passes to get the final sorted list.