Home / All Edu Topics / CS502-Fundamentals of Algorithms Assignment No. 02

CS502-Fundamentals of Algorithms Assignment No. 02

CS502-Fundamentals of Algorithms Assignment No. 02 Fall 2016

CS502-Fundamentals of Algorithms Assignment No. 02

Assignment No. 02

Semester:Fall 2016
Fundamentals of Algorithms – CS502

 

Total Marks: 15

 

Due Date:04/12/2016

 

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.

 

Assignment Questions

 

Questions:                                                                                                           Marks 15

 

Question. 1                             (10 Marks)

 

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

 

 

 

Question. 2   (5 Marks)

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  

Best Of Luck

DOWNLOAD ASSIGNMENT

About admin

Check Also

ENGLISH CODE 386 AIOU SOLVED ASSIGNMENT 1 SPRING 2017

English code 386 aiou solved assignment 1 spring 2017 will be upload now. The assignment …

Leave a Reply

%d bloggers like this: