Tamil Nadu Open University (TNOU) 2009-2nd Sem M.C.A - - Data structures and algorithms -- X - Question Paper
M.C.A. DEGREE EXAMINATION, 2009
(SECOND SEMESTER)
(PAPER-X)
230. DATA STRUCTURES AND ALGORITHMS
(Old Regulation)
Dec.) (Time: three Hours
Maximum: 100 Marks
(5×20=100)
ans any 5 ques.
1.a) explain in detail about stack and its implementation. (10)
b)Write an algorithm for adding and removing elements from a queue (10)
2.a) discuss in detail about Linear search with example (10)
b)Explain strassen 's matrix multiplication (10)
3.a) explain in detail about trees and its kinds with example. (5)
b)Discuss in detail about knapsack issue (5)
4.a) discuss In detail about the eight –queen issue (10)
b)Discuss in detail about Travelling sales person issue (10)
5.a) explain about multi stage graphs with example (10)
b)Discuss in detail about greedy algorithm (10)
6.a) discuss in detail about hashing with examples (10)
b)Discuss in detail about backtracking (10)
7.a) define in detail about the NP-Hard and NP-complete issue. (10)
b)Explain in detail about NP-Hard graph issue. (10)
8.a) explain in detail about NP-Hard code Generation issue (10)
b)Explain the Algorithms for NP-Hard issues. (10)
~~~~~~~~~
1
Total no of Pages:
Register Number: 6945
Name of the Candidate:
M.C.A. Degree EXAMINATION, 2009
(second semester)
(Paper-X)
230. data structures and algorithms
(old regulation)
Dec.) (Time: 3 Hours
Maximum: 100 Marks
(520=100)
Answer any Five questions
1. a) Discuss in detail about stack and its implementation. (10)
b) Write an algorithm for adding and removing elements from a queue (10)
2. a) Explain in detail about Linear search with example (10)
b) Explain strassens matrix multiplication (10)
3. a) Discuss in detail about trees and its types with example. (5)
b) Discuss in detail about knapsack problem (5)
4. a) explain In detail about the 8 queen problem (10)
b) Discuss in detail about Travelling sales person problem (10)
5. a) Discuss about multi stage graphs with example (10)
b) Discuss in detail about greedy algorithm (10)
6. a) Explain in detail about hashing with examples (10)
b) Discuss in detail about backtracking (10)
7. a) Describe in detail about the NP-Hard and Np-complete problem. (10)
b) Explain in detail about NP-Hard graph problem. (10)
8. a) Discuss in detail about NP-Hard code Generation Problem (10)
b) Explain the Algorithms
for NP-Hard problems. (10)
~~~~~~~~~
| Earning: Approval pending. |
