Exam Details
| Subject | design and analysis of algorithm | |
| Paper | paper 7 | |
| Exam / Course | m.c.a | |
| Department | ||
| Organization | Nalanda Open University | |
| Position | ||
| Exam Date | April, 2017 | |
| City, State | bihar, patna |
Question Paper
NALANDA OPEN UNIVERSITY
Master of Computer Application Part-I
PAPER-VII SPL
(Design and Analysis of Algorithm)
Annual Examination, 2017
Time 3 Hours. Full Marks 80
Answer any Five Questions.
All questions carry equal marks.
1. What is an algorithm Explain the characteristics of an algorithm. Give an algorithm to find
the factorial of a number.
2. Write a recursive procedure for the following
To print the sum of first 10 natural numbers.
To print the sum of first 10 factorial numbers.
3. Compare and contrast different sorting algorithms with their complexities.
4. Write short notes on the following
Regular expression
Context free grammar
5. What is Push Down Automata How is it different from Finite Automata.
6. Compare and contrast between Heap sort and Merge sort. Give examples for each type..
7. Explain Principal of Optimality. Give an example of chained matrix multiplication.
8. Describe different types of minimum spanning trees with examples.
9. What is best case analysis Perform the best case analysis for Quick Sort.
10. Explain each of the following, with an appropriate example
Greedy algorithms..
Halting Problem
Master of Computer Application Part-I
PAPER-VII SPL
(Design and Analysis of Algorithm)
Annual Examination, 2017
Time 3 Hours. Full Marks 80
Answer any Five Questions.
All questions carry equal marks.
1. What is an algorithm Explain the characteristics of an algorithm. Give an algorithm to find
the factorial of a number.
2. Write a recursive procedure for the following
To print the sum of first 10 natural numbers.
To print the sum of first 10 factorial numbers.
3. Compare and contrast different sorting algorithms with their complexities.
4. Write short notes on the following
Regular expression
Context free grammar
5. What is Push Down Automata How is it different from Finite Automata.
6. Compare and contrast between Heap sort and Merge sort. Give examples for each type..
7. Explain Principal of Optimality. Give an example of chained matrix multiplication.
8. Describe different types of minimum spanning trees with examples.
9. What is best case analysis Perform the best case analysis for Quick Sort.
10. Explain each of the following, with an appropriate example
Greedy algorithms..
Halting Problem
Other Question Papers
Subjects
- (internet concepts and web design
- accounting & financial management
- advanced database design
- advanced discrete mathematics
- advanced internet technologies
- advanced internet technologies and computer graphics set-i
- advanced internet technologies and computer graphics set-ii
- application development with .net framework
- artificial intelligence and knowledge management
- c and assembly language programming
- communication skill
- communication skills
- computer graphics and multimedia
- computer networking
- computer organization
- computer organization and assembly language programming
- data and file structures
- data communication and computer networks
- database management system
- design and analysis of algorithm
- discrete mathematics
- internet concepts and web design
- introduction to database management systems
- lab (for data and file structures, networking and java programming)
- laboratory course
- management and information system
- mcs-041 : operating systems
- numerical and statistical computing
- object oriented analysis and design
- object oriented programming using java
- object oriented technologies and java programming
- operating system
- operating system concepts and networking management
- operating systems
- principles of management and information systems
- problem solving and programming
- problem solving using c
- software engineering
- system analysis and design
- systems analysis and design
- unix and oracle
- unix and oracle set-i
- unix and oracle set-ii