​Course Name:

CSE 205: Algorithms

​Assignment :
​Final

​Submitted By​ ​Submitted To

Name: Sikder Md Mahbub Alam Name : Rokeya Ruku
Roll: 183002005 lecturer , dept of CSE
Section:​ DB GUB

​Date of Submission: 6/7/2020

1st problem : Huffman encoding
Answer : So we can see using huffman coding we need 428 bit

but without using huffman we would need 157*8=1256 bit

so less bit needed for huffman coding (1256-428) =828 bit

2nd problem: knapsack using dynamic programming
Answer : So in order to maximize the value of his load the thief need
to take 3rd item and 4th item
3rd problem : so i am doing this just from curiosity , i know
you said to do 2 out of 3

sum of subset problem with backtracking :

Answer : i think only 1 subset can be answer , which is S ={ 0 , 0 , 1 ,0 , 1 }

in the picture i was impatient that’s why i couldn’t finish fully