We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>

Looking For Something at vustudents.ning.com? Click Here to Search


+ Link For Assignments, GDBs & Online Quizzes Solution


+ Link For Past Papers, Solved MCQs, Short Notes & More



        Fundamentals of Algorithms CS502-

                     Spring 2015

              ASSIGNMENT #3


Your assignment must be uploaded/submitted at or before 24thJuly 2015 Uploading instructions Please view the assignment submission process document provided to you by the Virtual University to upload the assignment.

Rules for Marking

It should be clear that your assignment will not get any credit if:

O The assignment is submitted after due date.

O The submitted assignment does not compile or run. Or corrupt file

O The assignment is copied.

O Submit your solution in Microsoft Word document “doc/docx”


This assignment will help you to understand the concepts of Knapsack Problem and Huffman encoding.

The grip on these topics will help you to understand the cores of Dynamic Programming and Greedy paradigms and increase your confidence to apply these strategies for real world problems.


1.In order to attempt this assignment you should have full command on Lecture # 17to Lecture # 26

and also read the text book “Introduction to Algorithms” byThomaH.Cormen particularly for Huffman encoding technique for compressing the data.

2.In order to solve this assignment you have strong concepts about following topicsüKnapsack Problem(Dynamic Programming)üRadix Sort Books to read For solution Cormen, Leiserson, Rivest, and Stein (CLRS) 2001, Introduction to Algorithm, (2nd ed.) McGraw Hill.

Estimated Time

4 Hours For Question1 maximum time is 2.5 hours ,divide the time according to your ease 1.5 hour will enough to understand the logics0/1 Dynamic Programming and in 1 hour can design your problem solution according to given scenario; and for second problem focus on the radix sort and you can develop all this in 1.5 hour.

It all depends upon your sheer concentration.

Question# 1(10) Let’s assume,

You are working in Multinational Organization XYZ and your company is going to launch projects at broader level. Your Company has 140 Billion $ for investment. You area Business analyst in your company and you have to develop the strategy to maximize the earned profit following the given limits; projects Are to be launched in the year 2016.

•First project is about Research and Development of underdeveloped countries which has cost 40 billion $ and the profit earned will be54 Billion $, and

•The second project is to launch the Software Industries for security Enhancements in different countries which has cost 60 billion$ and profit earned will be 40billion $.

•The Third project is relating to Launch the Industry Plants Nano Technology design for the computing purposes the cost is 70 Billion $ giving the profit of

72 billion $


•The fourth project is to launch quality Medicine Formation

(Pharmaceutical Oriented) project to serve Humanity and has cost 76


$ and profit is 84 billion $ and

 •There is also fifth project which is relating to Chemical Industries in many countries which has cost 36 billion $ giving the profit of 40 billion $


Find out the projects to be selected to earn the maximum profit using

0-1 Knapsack you may assign explicit simple variables for your ease to proceed the calculations.


+ How to Follow the New Added Discussions at Your Mail Address?

+ How to Join Subject Study Groups & Get Helping Material?

+ How to become Top Reputation, Angels, Intellectual, Featured Members & Moderators?

+ VU Students Reserves The Right to Delete Your Profile, If?

See Your Saved Posts Timeline

Views: 16462


+ http://bit.ly/vucodes (Link for Assignments, GDBs & Online Quizzes Solution)

+ http://bit.ly/papersvu (Link for Past Papers, Solved MCQs, Short Notes & More)

+ Click Here to Search (Looking For something at vustudents.ning.com?)

+ Click Here To Join (Our facebook study Group)


Replies to This Discussion

sir ne kaha tu hai k doc/docx mein submit krni hai. mtlb k MS word ki file submit krni hai

kaha pr kaha hy dikhao mje please Dil NAwaz please

please shear cs502 assignment solution


Latest Activity

Nissa commented on + M.Tariq Malik's group EDU430 ICT in Education
8 minutes ago
Fahad liked + M.Tariq Malik's group CS206 Introduction to Network Design & Analysis
33 minutes ago
Fahad liked + M.Tariq Malik's group CS205 Information Security
34 minutes ago
Fahad joined + M.Tariq Malik's group
34 minutes ago
Fahad joined + M.Tariq Malik's group
35 minutes ago
Nissa joined + M.Tariq Malik's group
46 minutes ago
Sameer Babar and mubashir rehman are now friends
48 minutes ago
+ ! ! ! ! ! ! ! ! ! AG liked + ! ! ! ! !HaFiZa TeHreeM FaTiMa's discussion AAJZI or IZZAT.................
56 minutes ago
+ ! ! ! ! ! ! ! ! ! AG liked + ! ! ! ! ! ! maho+++'s discussion WASEYAT RASOL PAK S.A.W.W
56 minutes ago
+ ! ! ! ! ! ! ! ! ! AG liked sayyad saqib hussain shah's discussion HRM 626 HANDOUTS REQUIRED PLS
56 minutes ago
+ ! ! ! ! ! ! ! ! ! AG liked + M.Tariq Malik's discussion For All Assignments, GDBs, Quizzes Solutions
56 minutes ago
+ ! ! ! ! ! ! ! ! ! AG liked DANI's discussion Quiz no 1 fall 2019 isl201
56 minutes ago
Ahmad Raza liked + M.Tariq Malik's discussion MGT201 Assignment No 01 Spring 2019 Solution & Discussion
1 hour ago
Ahmad Raza joined + M.Tariq Malik's group
1 hour ago
Sameer Babar joined + M.Tariq Malik's group
2 hours ago
DANI liked DANI's discussion Quiz no 1 fall 2019 isl201
2 hours ago
Ahmad Raza liked + M.Tariq Malik's group MGT201 Financial Management
2 hours ago
Dua zahra posted a photo
2 hours ago
IQ-Black Bird CodeHolic replied to + ! ! ! ! ! Iuuoɔǝut ! ! ! ! +'s discussion What is the importance of Virtual University degree in Pakistan?
2 hours ago
+ M.Tariq Malik replied to + M.Tariq Malik's discussion CS402 Assignment No 01 Fall 2019 Solution & Discussion Due Date: 15-11-2019 in the group CS402 Theory of Automata
2 hours ago

© 2019   Created by + M.Tariq Malik.   Powered by

Promote Us  |  Report an Issue  |  Privacy Policy  |  Terms of Service