Practical File questions [Fundamentals of Computer Applications] for MCA 5th Sem Sec-A Students (2016-2019)

Practical File for Fundamentals of Computer Applications 5th Sem Session 2016-19

1. What is an Algorithm? What are the qualities of an algorithm?

2. What are asymptotic notations? Explain with the help of suitable diagrams and examples.

3. What is the need to study data structures when designing algorithms?

4. Write the control abstraction for :
i) Greedy Technique
ii) Divide & Conquer
iii) Data Trading Explain graph coloring problem in detail.

5. What is its practical utility. Write an algorithm for the graph coloring problem using greedy technique. Also find its complexity.

6. Write an algorithm for merge sort using Divide and Conquer technique. Also write a program in C to realise this algorithm. Find the complexity of algorithm.

7. What is the difference between Knapsack Problem and 0-1 Knapsack Problem. Write an algorithm for solving KNAPSACK problem using greedy technique. Also find its complexity.

8. What is the importance of backtracking in algorithm design. Write an algorithm for the solution to 8-Queens problem using backtracking. Find its complexity.

9.Write an algorithm for travelling salesman problem using dynamic programming. Also find its complexity.