Register Number
|
|
|
|
|
|
|
|
(Established under
section 3 of UGC Act, 1956)
Course & Branch:
B.E/B.Tech-CSE/IT
Title of the Paper: Design & Analysis of Algorithms Max. Marks: 80
Sub. Code: SCSX1001 Time: 3 Hours
Date: 13/12/2010 Session: FN
______________________________________________________________________________________________________________________
PART
- A (10 X 2 = 20)
Answer ALL the Questions
1. How is an algorithm’s time efficiency
measured?
2. Write algorithm description for summation
of a set of numbers.
3. List any four applications where factoring
is used.
4. What is the value of 25th
factorial?
5. What is the strength of array technique?
6. Write the algorithm for finding the maximum
number in a set.
7. What are the classes of sorting algorithm?
8. What is diminishing incremental insertion?
9. List
any two situation where text line length adjustment is required.
10. What do you mean by left and right
justification of text?
PART – B (5
x 12 = 60)
Answer ALL the Questions
11. Design an algorithm for factorial
computation.
(or)
12. Briefly explain
(a) computational complexity
(b) Worse and Average case behavior
(c) Probabilistic average case analysis
13. Design an algorithm to compute the nth
Fibonacci number.
(or)
14. Develop
an algorithm for greatest common divisor of two numbers.
15. Develop
a procedure for removal of duplicate from an ordered array.
(or)
16. Explain
how to find out the kth smallest element in an array and write
suitable algorithm.
17. Explain two-way merging with suitable
example.
(or)
18. Briefly explain selection sort.
19. Discuss
in detail how to count the number of times a particular word occurs in a given
text.
(or)
20. Design
and implement a procedure for left and right justifying text.
0 comments:
Pen down your valuable important comments below