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, 2018 | |
| City, State | bihar, patna |
Question Paper
N A L A N D A O P E N U N I V E R S I T Y
Master of Computer Application Part-I
PAPER-VII
(Design and Analysis of Algorithm)
Annual Examination, 2018
Time 3 Hours. Full Marks 80
Answer any Five Questions.
All questions carry equal marks.
1. Define algorithm? What are the different methodologies should involve in the design of an
algorithm. Give an algorithm to display whether the given number is prime or not.
2. Describe some well-known asymptotic functions and Notations with examples for each type.
3. Sort the given list using merge sort:
18, 25, 12, 15, 11, 17, 20.
Also find the number of comparisons and assignment operations required.
4. Define Quick sort? Give an example to illustrate Quick sort algorithm.
5. Write algorithm for Huffman code and Best First Search. What is minimax principle?
6. Explain Principal of Optimality. Give an example of chained matrix multiplication.
7. Describe different types of minimum spanning trees with examples.
8. What is Regular expression? Give rules to define Regular Expressions. Write a regular
expression over to generate all string that end with three a's. Also draw a finite
automata for the same.
9. Explain Chomsky classification of grammar. Draw a Push Down Automata to accept a
string which is a palindrome in b}.
10. Explain the following concepts
NP Hard
Binary Search
Undecidable problems.
Master of Computer Application Part-I
PAPER-VII
(Design and Analysis of Algorithm)
Annual Examination, 2018
Time 3 Hours. Full Marks 80
Answer any Five Questions.
All questions carry equal marks.
1. Define algorithm? What are the different methodologies should involve in the design of an
algorithm. Give an algorithm to display whether the given number is prime or not.
2. Describe some well-known asymptotic functions and Notations with examples for each type.
3. Sort the given list using merge sort:
18, 25, 12, 15, 11, 17, 20.
Also find the number of comparisons and assignment operations required.
4. Define Quick sort? Give an example to illustrate Quick sort algorithm.
5. Write algorithm for Huffman code and Best First Search. What is minimax principle?
6. Explain Principal of Optimality. Give an example of chained matrix multiplication.
7. Describe different types of minimum spanning trees with examples.
8. What is Regular expression? Give rules to define Regular Expressions. Write a regular
expression over to generate all string that end with three a's. Also draw a finite
automata for the same.
9. Explain Chomsky classification of grammar. Draw a Push Down Automata to accept a
string which is a palindrome in b}.
10. Explain the following concepts
NP Hard
Binary Search
Undecidable problems.
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