CS502 Assignment No 2 Solution Spring 2019 With Step by Step Guide and References

Info!  Please Don't Make 100% copy of your assignment Solution. Make some changes so that your solution look differrent than other students. If you make Exact copy of then you can get marks zero.

Solution Idea of CS502 Assignment No 2 2019 Fundamental Algorithm Due Date 29-05-2019

Question 1:   (Marks: 10)
a) Draw the final Min-Heap structure for the following array; show the final result (tree) only.

1, 5, 7, 25, 13, 19, 12, 30, 27, 26

Solution Q1 (a)

Reference: p40

b) Draw the final Max-Heap structure for the following array; show the final result (tree) only.

30, 27, 19, 25, 26, 5, 12, 1, 13, 7

Solution Q1 (b)

Question 2:   You are given an array; you have to apply partition algorithm of quick sort on this array. You are required to show all the steps of partition algorithm.

9

1

7

20

12

18

2

15

4

17

Solution Q2

Solution of Question 2 is given in video below, please watch the video to get question 2 solution.

Reference: page 46

To Get full Solution with step by step watch video Given Below;

Watch the Video below to know that how to solve this assignment with step by step guide and references

How to Submit:

You need to submit this file in Microsoft Word (doc, docx) file formate on or before due date.

If you have any Problem regarding your assignment Solution then you can contact Us or leave a Comment below. You can also subscribe our Official YouTube Channel to get guided videos of all assignments, quizes or GDB. You can also join our Official WhatsApp Groups by Click on the links Below.

Description	Links
YouTube Channel:	Infopalacess Official Tuts
WhatsApp Group 1:	VU Assignments Portal by Infopalacess 2
WhatsApp Group 2	VU Assignments Portal by Infopalacess 2
WhatsApp Group 3	3- VU Solutions by Infopalacess