CS502 Assignment No. 02 Solution Fall 2016

C502 Assignment No. 02 Fall 2016

CS502- Fundamentals of Algorithms Assignment No. 02 Solution Fall 2016 C502 Assignment No. 02 Assignment No. 02
Semester:Fall 2016
Fundamentals of Algorithms – CS502
Total Marks: 15
Due Date:04/12/2016

Also Read: PM Laptop Scheme for Virtual University Students 2016-17

CS502 Assignment Instructions:

Please read the following instructions carefully before submitting the assignment:

• You will submit your assignment before or on due date on VU-LMS.
• Assignment sent via Email will not be replied and accepted/graded in any case.
• If the submitted assignment does not open or file is corrupt, it will not be graded.
• Assignment should be completed by your own efforts it should not be copied from internet, handouts or books.
• You will submit solution only in the Microsoft Word File.
• Assignment is covered from lectures 1 to 15.

Also Read: ISL 201 Mid term SOlved Papers

CS502 Assignment Questions
CS502 Assignment Total Marks 15

CS502 Assignment Question No. 01 

(Marks=10)

Draw the final Max-Heap structure for the following array,Show the final result (tree) only.

50    31    45    30    2    7    40    12    28    1

CS502 Assignment Question No. 02

(Marks=5)

Which of the following sorting algorithms is stable? Write Yes/No against each algorithm

Sorting Algorithm                   Stable
Merge Sort
Heapsort
Quicksort
Counting Sort
Bubble Sort

You Can Also Download Solved Mid Term Papers, Short Notes, Assignment Solutions, Lecture Wise Questions Answers Files, Solved MCQs, Solved Quiz , Solved Mid Term Subjective Papers , Solved Mid Term Objective Papers From This Discussion For Preparation Mid Term Papers of Fall 2015-16.

CS502 Assignment No. 02 Solution

CS502 assignement 2 SOlved by Rubaisha.pdf, 89 KB
CS502 assignement 2 SOlved by Amanullah.docx, 247 KB