End Semester Exam Data Structures and Algorithms CP-202

Feb 15, 2021 Computer Engineering 2019 Time 3:00 hrs

Fall 2020

1. Keep it genuine, duplicate work may end in cancellation of script.

2. Early submission gets extra credit, haste slowly.
3. Submission time 1300 hrs this day.
4. Report tested and verified code in your solution, no separate .cpp required
5. You can present hand writ as well.
6. Submit your solutions in .docx or in .pdf files (NO ZIPS)
7. Return your solutions at Muhammad.rizwan@uettaxila.edu.pk

Q.1 Perform experimental analysis of the heap sort and selection sort algorithms for efficiency.
Give comparisons in various situations with respect to varied input sizes.

Q.2 It is desirable to present all domestic civil airports of Pakistan in a map (graph) in order to
maintain records of their exact location and distance with respect to each other. Choose a
suitable memory representation for your graph and implement that scheme in order to
have an exact model of country’s airfields.

Q.3 Workout and report minimum number of bits required to encode this Italian proverb using
Huffman’s encoding method
“Do not think that one enemy is insignificant, or that a thousand friends are too many.”.
Also report the compression ratio achieved.

Q.4 Build an MST out of graph built in Q.2