230. DATA STRUCTURES AND ALGORITHMS
Maximum : 100 Marks
Answer any FIVE questions.
All questions carry equal marks.
1. (a) Write an algorithm for linked list. (10)
(b) What is Hashing ? Explain in detail. (10)
2. (a) Write the various searching techniques with example. (10)
(b) Write an algorithm for single source shortest paths in greedy algorithm. (10)
3. (a) Explain the traveling salesperson problem in dynamic programming. (10)
(b) Write an algorithm for merge sort with example. (10)
4. (a) What do you mean by code optimization ? Explain in detail. (10)
(b) Explain knapsack problem with example for greedy algorithm. (10)
5. (a) Write short notes on Hamitonian cycles. (10)
(b) Explain the O/I knapsack problem for Branch and Bound. (10)
6. (a) What is Back tracking ? Explain the 8 - queens problem in Back tracking. (10)
(b) Explain the following :
(i) Sum of subsets. (5)
(ii) Graphs Coloring. (5)
7. (a) What is NP - Hard and NP - Hard complete problems ? (10)
(b) Discuss the NP - Hard Graph problems. (10)
8. (a) Explain the various scheduling problems of NP - Hard. (10)
(b) What are the usage of Bi - directional components and Depth First search ? (10)
No comments:
Post a Comment