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

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

In dynamic programming, the technique of storing the previously calculated values is called ?

(a)

Saving value property

(b)

Storing value property

(c)

Memoization

(d)

Mapping

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.

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

An estimation of the time and space complexities of an algorithm is called

(a)

Algorithmic solution

(b)

Algorithmic Strategy

(c)

Algorithmic performance

(d)

Algorithmic analysis

Efficiency of an algorithm decided by

(a)

Time, Space

(b)

Definiteness, portability

(c)

Priori, Postriori

(d)

Input/output

Time and Space complexity could be considered for an

(a)

Algorithmic strategy

(b)

Algorithmic analysis

(c)

Algorithmic solution

(d)

Algorithmic efficiency

How many factors are used to measure the time efficiency of an algorithm?

(a)

Two

(b)

Three

(c)

Six

(d)

Many

Which of the following sorting algorithm is too slow and less efficient?

(a)

Bubble

(b)

Selection

(c)

Quick

(d)

Merge

A theoretical performance analysis of an algorithm is called_________

(a)

Posteriori testing

(b)

Priori estimates

(c)

Algorithmic efficiency

(d)

Algorithmic testing

Which of the following is the reverse of Big O?

(a)

Big \(\Omega \)

(b)

Big \(\mu \)

(c)

Big symbol

(d)

Big O

What is an Algorithm?

Define Pseudo code.

Who is an Algorist?

What is searching? Write its types.

What is algorithmic solution?

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.

Write a note on Big omega asymptotic notation.

Define memorization.

Discuss about Algorithmic complexity and its types.

What are the factors that influence time and space complexity.

Write a note on Asymptotic notation.

What do you understand by Dynamic programming?

Write a note on two factors in which space required by an algorithm is decided.

Write the different factors in which the time efficiency of an algorithm its measured

Write a pseudo code for bubble sort algorithm

Write a pseudo code for Insertion sort.

What is dynamic programming? What are the steps involved in dynamic programming?

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

Explain the characteristics of an algorithm.

What is Binary search? Discuss with example

Explain the Bubble sort algorithm with example.

Explain the concept of Dynamic programming with suitable example.

Explain Best, worst and Average case efficiency of an algorithm with an example.

Differentiate Algorithm and program

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