This document outlines 7 lab experiments for a computer science course. The experiments involve implementing various algorithms in C including Huffman coding using greedy strategy, finding maximum subarray using divide and conquer, assembly line scheduling and longest common subsequence using dynamic programming, subset sum using backtracking, matrix chain multiplication using dynamic programming, and graph coloring using backtracking.
This document outlines 7 lab experiments for a computer science course. The experiments involve implementing various algorithms in C including Huffman coding using greedy strategy, finding maximum subarray using divide and conquer, assembly line scheduling and longest common subsequence using dynamic programming, subset sum using backtracking, matrix chain multiplication using dynamic programming, and graph coloring using backtracking.
This document outlines 7 lab experiments for a computer science course. The experiments involve implementing various algorithms in C including Huffman coding using greedy strategy, finding maximum subarray using divide and conquer, assembly line scheduling and longest common subsequence using dynamic programming, subset sum using backtracking, matrix chain multiplication using dynamic programming, and graph coloring using backtracking.
1. Write a c program to implement the huffman code (use Greedy Strategy)
2. Write a c program to find the maximum subarray (use Divide and conquer) 3. Write a C Program to implement the assembly line scheduling problem using Dynamic programming 4. Write a C program to implement the Longest Common Subsequence using Dynamic programming 5. Write a C program to implement the Subset sum problem using Backtracking 6. Write a C program to implement the Matrix chain multiplication problem using Dynamic programming 7. Write a C program to implement the Graph Coloring problem using Backtracking