CS502 Assignment No 2 Solution Spring 2018

CS502 Assignment No 2 Spring 2018

Dear Students, Here you can read or Download CS502 - Fundamentals of Algorithms Assignment No 2 Solution and Discussion of Semester Spring 2018. Assignment Due Date is 29 MAY, 2018. Total Marks are 20. This assignment covers lesson no. 7 to 15. We are here to facilitate your learning and we do not appreciate the idea of copying or replicating solutions. Assignment Solution File has been added. Previously we shared CS502 Solved Mid-term Past Papers & Notes.

CS502 Assignment no 2 solution and discussion Spring 2018

CS502 Assignment Objectives:

Objectives of this Assignment are:

To understand the working of different sorting algorithms

To understand and implement Divide and Conquer strategy

CS502 Assignment Instructions:

Please read the following instructions carefully before solving & submitting the assignment:

The assignment will not be accepted after due date.

Zero marks will be awarded if the assignment does not open or the file is corrupt.

The assignment file must be an MS Word (.doc/.docx) file format; Assignment will not be accepted in any other format.

Zero marks will be awarded if assignment is copied (from other student or copied from handouts or internet).

Zero marks will be awarded if Student ID is not mentioned in the assignment file.

For any query about the assignment, contact only at CS502@vu.edu.pk

Please do not post queries related to assignment on MDB.

CS502 Assignment Question No 1:

Consider the following algorithm for sorting:

The main idea behind this sorting algorithm is as follows:

Find the smallest element in the array

Exchange it with the element in the first position

Find the second smallest element and exchange it with the element in the second position

Continue until the array is sorted

You are required to Sort the following array using the above sorting algorithm.

You have to strictly follow all the steps. Marks will not be awarded for partial/incomplete solution.

CS502 Assignment Question No 2:

Apply Merge Sort to sort the list "X, Y, L, O, M, E, T, E, R, S" in Ascending order.

Please Note: You need to provide separate tree structure diagram for each phase (i.e. divide phase and combine phase).