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
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
(MCS-031 Design and Analysis of Algorithm)
Annual Examination, 2017
Time 3 Hours. Full Marks 80
Answer any Five Questions.
All questions carry equal marks.
1. Arrange the following growth rates in increasing order of time and give the space complexity
for each
O(5 log O(x log O(x2log
2. Differentiate between dynamic programming and greedy approach to solve different
problems.
3. Write a recursive function to multiply two natural numbers.
4. Explain the difference between Push down Automata and Finite Automata with an
example.
5. Define 'Halting Problem" of Turing Machines. Show stepwise sorting of elements using
Heapsort algorithm to the following max heap.
6. What is Context-Free Language? Define ambiguity in Context-Free Grammar (CFG). Show that
the grammar: is ambiguous.
7. If L1 and L2 are two Context-Free languages, then show that L1.L2is also Context Free
language.
8. Compare and contrast between Heap sort and Merge sort. Give examples for each type.
9. Write short notes on
Depth First search.
Breadth First search
Best First Search
10. Describe different types of minimum spanning trees with examples.
Master of Computer Application Part-I
PAPER-VII
(MCS-031 Design and Analysis of Algorithm)
Annual Examination, 2017
Time 3 Hours. Full Marks 80
Answer any Five Questions.
All questions carry equal marks.
1. Arrange the following growth rates in increasing order of time and give the space complexity
for each
O(5 log O(x log O(x2log
2. Differentiate between dynamic programming and greedy approach to solve different
problems.
3. Write a recursive function to multiply two natural numbers.
4. Explain the difference between Push down Automata and Finite Automata with an
example.
5. Define 'Halting Problem" of Turing Machines. Show stepwise sorting of elements using
Heapsort algorithm to the following max heap.
6. What is Context-Free Language? Define ambiguity in Context-Free Grammar (CFG). Show that
the grammar: is ambiguous.
7. If L1 and L2 are two Context-Free languages, then show that L1.L2is also Context Free
language.
8. Compare and contrast between Heap sort and Merge sort. Give examples for each type.
9. Write short notes on
Depth First search.
Breadth First search
Best First Search
10. Describe different types of minimum spanning trees with examples.
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