www.vustudents.ning.com

We non-commercial site working hard since 2009 to facilitate learning Read More. We can't keep up without your support. Donate.

CS502 Assignment No.2

Fundamentals of Algorithms (CS502)

Assignment#02

Total marks = 20

Lectures Covered:Thisassignment covers Lecture # 23 to 26.

Objectives:

Objectives of this assignment are:

• To implement Activity Selection Algorithm in real life problems
• Generation of Variable-length codes using Huffman Coding Algorithm

Instructions:

Please read the following instructions carefully before solving & submitting the assignment:

1. The assignment will not be accepted after due date.
2. Zero marks will be awarded to the assignment that does not open or the file is corrupt.
3. The assignment file must be an MS Word (.doc/.docx) file format; Assignment will not be accepted in any other format.
4. Zero marks will be awarded to the assignment if copied (from other student or copied from handouts or internet).
5. Zero marks will be awarded to the assignment if the Student ID is not mentioned in the assignment file.

For any query about the assignment, contact only at CS502@vu.edu.pk

Please do not post queries related to assignment on MDB.

Question # 1:                                                     10Marks (5+5)

In the context of Activity Selection Problem, consider the following set of activities:

 Activity A B C D E F G H I J K L M N O Start Time 2 4 6 1 6 3 1 8 5 6 7 4 2 5 7 Finish Time 9 5 7 3 8 5 2 9 8 9 9 8 3 6 8

You are required to find the optimal solution (usingGreedy Algorithm) for the following two greediness approaches:

1. Select the activities that start first and schedule them(5 marks)
2. Select the activities that finish first and schedule them(5 marks)

Note:

No need to provide any pseudo/working code. Just provide the results for each greediness approach of the following two steps in the below mentioned tabular form:

1. Sorted Activities
2. Final Selected Activities

 Activity StartTime Finish Time

Question # 2:                                                               10 Marks

Consider the following scenario in which a set of Alphabets along with their frequencies is given.  You are required to generate the output binary tree and find the Variable-length codes for the given Alphabets using the provided Huffman Coding Algorithm.

Total File Length: 210

Frequency table:

 A B C D E F 10 20 30 40 50 60

Huffman Coding Algorithm:

1. Consider all pairs: <frequency, symbol>.
2. Choose the two lowest frequencies, and make them brothers, with the root having the

combined frequency.

1. Iterate.

Note:

No need to provide all the steps of the binary tree generation.  Only mention the Final Binary Tree and the Variable-length codes for the given Alphabets in tabular form.

Your solution should be strictly according to the below-mentioned template.

Solution Template:

Alphabets: A, B, C, D, E, F

Total File Length: 100

Frequency table:

 A B C D E F 45 13 12 16 9 5

Output Tree:

 Letter to be encoded A B C D E F Frequency 45 13 12 16 9 5 Variable-length code 0 101 100 111 1101 1100

Good Luck

Views: 12267

Attachments:

Replies to This Discussion

Our main purpose here discussion not just Solution

We are here with you hands in hands to facilitate your learning and do not appreciate the idea of copying or replicating solutions. Read More>>

Discussed & be touched with this discussion. After discussion a perfect solution will come in a result at the end.

Note:-

For Important Helping Material related to this subject (Solved MCQs, Short Notes, Solved past Papers, E-Books, FAQ,Short Questions Answers & more). You must view all the featured Discussion in this subject group.

For how you can view all the Featured discussions click on the Back to Subject Name Discussions link below the title of this Discussion & then under featured Discussion corner click on the view all link.

Or visit this link

&

.•°How to Download past papers from study groups°•.

Please Click on the below link to see…

.... How to Find Your Subject Study Group & Join ....

somebody discuss about the 1st question how can we select the activities with respect to time....

the activities that start at or after the finish time of the previous activity, we have to schedule them.

i cannot understand by these statements

• Select the activities that start first and schedule them
• Select the activities that finish first and schedule them

sort the activities according to start time in first.

sort the activities according to finish time in second.

schedule both

it means that we only sort these according to start and finish time and then select activities.

sort with increasing start times in 1.

sort with increasing finish times in 2.

schedule and select separately.

thanks

welcome

aoa plz share q1 solution ?

CS502 Assignment#02 Idea Solution

Attachments:

this idea is fir question 1 part 2

1

2

3

4

5

VIP Member Badge & Others

How to Get This Badge at Your Profile DP

------------------------------------

Management: Admins ::: Moderators

Other Awards Badges List

Latest Activity

1 hour ago

.... Ghalat fehmi hai ap ki huh......

1 hour ago
sweet angel liked ＋ ꜞꜞ STrAnGEr ꜞꜞ ＋'s discussion منہ دکھائی میں لعل لیتے ہیں
1 hour ago
sweet angel liked ＋ ꜞꜞ STrAnGEr ꜞꜞ ＋'s discussion اے خدا ہمیں ملا دے
1 hour ago
1 hour ago
sweet angel liked Ziddi Queen's discussion غور طلب بات
1 hour ago
sweet angel liked Mani Siddiqui's discussion Android hacking / Mobile Hacking
1 hour ago
1 hour ago