CS502 Assignment No.2

[ayesha]

Fundamentals of Algorithms (CS502)

Assignment#02

Total marks = 20

 Submission Deadline =10-01-2018

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 [e-mail]

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.

 

3. 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

[+ M.Tariq Malik]

Please Discuss here about this assignment.Thanks

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 

Click Here For Detail.

&

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

 

Please Click on the below link to see…

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

[25hog7tvxizy1]

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

[Arslan Haider]

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

[25hog7tvxizy1]

i cannot understand by these statements

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

[Arslan Haider]

sort the activities according to start time in first. 

sort the activities according to finish time in second.

schedule both

[25hog7tvxizy1]

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

[Arslan Haider]

sort with increasing start times in 1.

sort with increasing finish times in 2.

schedule and select separately.

[25hog7tvxizy1]

thanks

[Arslan Haider]

welcome

[Ubaid]

aoa plz share q1 solution ?

[+ M.Tariq Malik]

CS502 Assignment#02 Idea Solution

[Arslan Haider]

this idea is fir question 1 part 2