Name of the College : Noorul Islam College of Engineering
University : Anna University
Degree : M.Sc
Department : Software Engineering
Subject Code/Name : XCS 355 – Design of Analysis
Year : 3rd
Semester : 5th
Document Type : Question Bank
Website : niceindia.com
Download Model/Sample Question Paper : https://www.pdfquestion.in/uploads/niceindia.com/3140-XCS_355_design_and_analysis_of_Algorithm.pdf
NICE Design of Analysis Question Paper
1. What is performance measurement? :
Performance measurement is concerned with obtaining the space and the time requirements of a particular algorithm.
Related : Noorul Islam College of Engineering XCS246 Object Oriented Programming M.Sc Question Bank : www.pdfquestion.in/3134.html
2. What is an algorithm? :
An algorithm is a finite set of instructions that, if followed, accomplishes a particular task. In addition, all algorithms must satisfy the following criteria :
1) input
2) Output
3) Definiteness
4) Finiteness
5) Effectiveness.
3. Define Program. :
A program is the expression of an algorithm in a programming language. Sometimes works such as procedure, function and subroutine are used synonymously program.
4. Write the For LOOP general format. :
The general form of a for Loop is
For variable : = value 1 to value 2 step
Step do
{
<statement 1>
<statement n >
}
5. What is recursive algorithm? :
An algorithm is said to be recursive if the same algorithm is invoked in the body. An algorithm that calls itself is Direct recursive. Algorithm A is said to be indeed recursive if it calls another algorithm, which in turn calls A.
6. What is space complexity? :
The space complexity of an algorithm is the amount of memory it needs to run to completion.
7. What is time complexity? :
The time complexity of an algorithm is the amount of computer time it needs to run to completion.
8. Give the two major phases of performance evaluation :
Performance evaluation can be loosely divided into two major phases :
(i) a prior estimates (performance analysis)
(ii) a Posterior testing(performance measurement)
9. Define input size. :
The input size of any instance of a problem is defined to be the number of words(or the number of elements) needed to describe that instance.
10. Define best-case step count. :
The best-case step count is the minimum number of steps that can be executed for the given parameters.
11. Define worst-case step count.
The worst-case step count is the maximum number of steps that can be executed for the given parameters.
12. Define average step count. :
The average step count is the average number of steps executed an instances with the given parameters.
13. Define the divide an conquer method. :
Given a function to compute on ‘n’ inputs the divide-and-comquer strategy suggests splitting the inputs in to’k’ distinct susbsets, 1<k <n, yielding ‘k’ subproblems. The subproblems must be solved, and then a method must be found to combine subsolutions into a solution of the whole. If the subproblems are still relatively large, then the divide-and conquer strategy can possibly be reapplied.
14. Define control abstraction. :
A control abstraction we mean a procedure whose flow of control is clear but whose primary operations are by other procedures whose precise meanings are left undefined.
15. What is the substitution method? :
One of the methods for solving any such recurrence relation is called the substitution method.
16. What is the binary search? :
If ‘q’ is always chosen such that ‘aq’ is the middle element(that is, q=[(n+1)/2), then the resulting search algorithm is known as binary search.
17. Define external path length? :
The external path length E, is defines analogously as sum of the distance of all external nodes from the root.
18. Define internal path length. :
The internal path length ‘I’ is the sum of the distances of all internal nodes from the root.
19. What is the maximum and minimum problem? :
The problem is to find the maximum and minimum items in a set of ‘n’ elements. Though this problem may look so simple as to be contrived, it allows us to demonstrate divideand- comquer in simple setting.
20. What is the Quick sort? :
n quicksort, the division into subarrays is made so that the sorted subarrays do not need to be merged later.