Skip to content

Algorithm Design and Analysis

SWE · Quiz · Spring 26

Paper 3 of 7By Shafiur Rahman Shafim (242) (2)Switch

Paper 3 of 7

This browser can’t show the PDF here

Open it, and your phone’s PDF viewer takes it, or download it.

Read the questions as text

Read off the PDF by AI, so it may have mistakes. The PDF is the original.

Daffodil International University Department of Software Engineering Faculty of Science & Information Technology ID & Section: Spring 2026; Course Code & Title: SE214, Algorithm Design & Analysis Time: 35 Minutes Marks: 15 1) Take 2 Strings as A= Your Father’s First Name, B = Your Mother’s First Name, Find the longest common sequence of these two strings showing the necessary steps. 5 2) Given Capacity of the sack: 8 kg, Calculate the maximum profit with a Dynamic approach. 5 Object | 1 | 2 | 3 | 4 | 5 Profit | 5 | 10 | 15 | 7 | 8 Weight | 1 | 3 | 5 | 4 | 1 3) Total Amount =11, available denominator {1,5,4,10}, Find the minimum number of coins with Dynamic solution. 5