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.
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.
Hey Very Nice Blog!! Thanks For Sharing !!!
ReplyDeleteHey Very Nice Blog!! Thanks For Sharing !!!
ReplyDeleteThe article was fantastic which sharing lots of great advice here about with superb explanation with examples. Thanks for sharing!
ReplyDeleteGreat job!I praise your description and reasoning. On need to me is another significant benefits of online marketing. It is an interesting area that is truly growing.
ReplyDeleteThanks for sharing such an amazing blog. It is really helpful for me and I get my lots of solution with this blog.
ReplyDeleteYou just do a nice job. Keep it up, We are the top provider of and all over India.
ReplyDeleteYou just do a nice job. Keep it up. We are the finest provider of and all over India.
ReplyDeleteNice post it's helpful... Keep it up
ReplyDelete