CHAPTER – 4 - ALGORITHMIC STRATEGIES

I. BOOK BACK QUESTIONS:

1. The word comes from the name of a Persian mathematician Abu Ja'far Mohammad
ibn-i Musa al Khowarizmi is called?
a) Flowchart b) Flow c) Algorithm d) Syntax
2. From the following sorting algorithms which algorithm needs the minimum number of swaps?
a) Bubble sort b) Quick sort c) Merge sort d) Selection sort
3. Two main measures for the efficiency of an algorithm are
a) Processor and memory b) Complexity and capacity c) Time and space d) Data and space
4. The complexity e of linear search algorithm is
a) O(n) b) O(log n) c) O(n2) d) O(n log n)
5. From the following sorting algorithms which has the lowest worst case complexity?
a) Bubble sort b) Quick sort c) Merge sort d) Selection
sort
6. Which of the following is not a stable sorting algorithm?
a) Insertion sort b) Selection sort c) Bubble sort d) Merge sort
7. Time complexity of bubble sort in best case is
a) (n) b)  (log n) c)  (n2) d)  (n log n)2)
8. The notation in asymptotic evaluation represents
a) Best case b) Average case c) Worst case d) Null face
9. If a problem can be broken into sub problems which are reused several times , the
problem possesses which property?
a) Overlapping subproblems b) Optimal substructure
c) Memorization d) Greedy
10. In dynamic programming, the technique of storing the previously calculated values is called?
a) Saving value property b) Storing value property c) Memorization d) Mapping
II. PTA:
1. Step by step procedure for solving a given problem. (PTA - 2)
a) program b) pseudo code c) flowchart d) Algorithm
2. Which of the following is not a characteristics of an algorithm? (PTA - 3)
a) Input b) Program c) Finiteness d) simplicity
3. This is a theoretical performance analysis of an algorithm. ( PTA - 4)
a) priori estimates b) posteriori testing c) space factor d) time
factor
4. Which of the following algorithmic approach is similar to divide and conquer approach? (PTA -
5)
a) Insertion sorting b) Dynamic programming c) selection searching
d) Bubble programming
III. ADDITIONAL QUESTIONS
1. is a step-by-step procedure for solving a given problem.
a) Algorithm b) Flow chart c) Walkthrough d) None of
these
2. The execution time of an algorithm depends on factor. a) Programming language
used
b) Volume of data required c) Speed of the machine d) All the
above
3. is used to describe the best-case of an algorithm.
a) Big O b) Big  c) Big d)All the
above
4. Linear search also called search.
a) Binary b) sequential c) Random d) quick
5. sort is a simple sorting algorithm.
a) Bubble b) Merge c) Insertion d) Selection
6. Dynamic programming approach is similar to
a) Divide and Conquer b) Integration c) Merging d) None of
these
IV. PUBLIC & GOVERNMENT EXAM QUESTIONS:
1. Two main measures for the efficiency of an algorithm are (Mar - 20)
a) processor and memory b) complexity and capacity c) Time and space d) Data and space
2. Big  is the reverse of (MQP - 19)
a) Big O b) Big c)Big A d) Big S

I. BOOK BACK QUESTIONS:

1. What is an Algorithm?
2. Define Pseudo code.
3. What is an Algorist?
4. What is Sorting?
5. What is searching? Write its types.
II. PTA:
1. Write the pseudo code for linear search. (PTA - 4)
2. What are the different phases of analysis and performance evaluation of an algorithm? (PTA -
5)
3. What are the factors that measure the execution time of an algorithm? (PTA - 6)
4. Write a pseudo code for bubble sort algorithm. (PTA - 3)
III. GOVERNMENT QUESTIONS:
1. What is an Algorithm? (Mar - 20)

I. BOOK BACK QUESTIONS:

1. List the characteristics of an algorithm.
2. Discuss about Algorithmic complexity and its types.
3. What are the factors that influence time and space complexity.
4. Write a note on Asymptotic notation.
5. What do you understand by Dynamic programming?
II. PTA:
1. Write the pseudo code for linear search. (PTA - 4)
2. What are the different phases of analysis and performance evaluation of an algorithm? (PTA -
3. What are the factors that measure the execution time of an algorithm? (PTA - 6)
4. Write a pseudocode for bubble sort algorithm. (PTA - 3)
III. GOVERNMENT QUESTIONS:
1. Write a note on Asymptotic notation. (Mar - 20)

I. BOOK BACK QUESTIONS:

1. Explain the characteristics of algorithm.
2. Discuss about Linear search algorithm.
3. What is Binary search? Discuss with example.
4. Explain the Bubble sort algorithm with example.
5. Explain the concept of Dynamic programming with suitable example.
II. PTA:
1. Explain about complexity of an algorithm. (PTA - 3)
2. Write the pseudo code for selection sort algorithm. (PTA - 4)
III. GOVERNMENT QUESTIONS:
1. Discuss about linear search algorithm. (Mar - 20)