### CS301 Assignment No 2 Fall 2017

Dear Students, Here you can read or Download**CS301**- Data Structures

**Assign**

**ment No 2 Solution**and Discussion of Semester

**Fall 2017**. Assignment Due Date is 22 January, 2018. Total Marks are 20. Lectures Covered in this assignment are from 28 to 32.

**CS301 Assignment Solution**has been added. We are here to facilitate your learning and we do not appreciate the idea of copying or replicating solutions. Previously we shared

#### CS301 Assignment Instructions:

Please read the following instructions carefully before solving & submitting the assignment:It should be clear that your assignment will not get any credit (marks) if:

- The assignment is submitted after due date.
- The submitted assignment file is not in .doc or .docx format.
- The submitted assignment file does not open or corrupted.
- The assignment is copied (from other student or ditto copy from handouts or internet).

#### CS301 Assignment Uploading instructions:

- Do not wait for grace day. Grace Day is given only if there is problem with LMS on due date. Submit your solution within due date.
- Note that no assignment will be accepted through email if there is any problem in LMS on grace day.

#### CS301 Assignment Objective:

The objective of this assignment is- To make you familiar with working of heap data structure, techniques to implement and understand working of this data structure.

### CS301 Assignment Question:

[Marks 20]

Data: 4 3 2 8 9 5 11 18 12

**(a)**Consider the data given above and construct max heaping using step by step construction method. After building max heap show only final tree and array status. [Marks 5+5]**(b)**Use same data given above and construct max heap after Heapify whole tree at once. [Marks 5+5]### CS301 Assignment No 2 Solution Fall 2017

You can see the sample Solution file page preview below. and You can easily Download__CS301 Assignment No 2 Solution__File from the Download Button given below: