Overview. Provide the solutions for the problems in this assignment within a single MicrosoftWord document. However, a Power Point file or scanned handwritten drawing for Problem 1(b)is fine. Remember to include your name and course number within all documents and files thatyou submit.Problem 1. [4 points] Sorting: Read the assigned chapter and the notes for Week 7 located in theLearning Activities area, and then do the following problems:(a) [2 points]. Both the Mergesort and the Quicksort algorithms will sort a list by portioningthe list. Briefly explain how Mergesort differs from Quicksort when partitioning the list.(b) [2 points] What is the big-O of the shellsort() function provided in Figure 7.6 on page297? Briefly explain how you arrived at your answer. Remember big-O measures the worstcase runtime scenario.Problem 2. [6 points] Graphs: Read the assigned chapter and notes for Week 8 located in theLearning Activities area, and then do the following problems:(a) [3 points] Draw the adjacency matrix for the following graph:Hint: Remember that links without arrows are considered bi-directional.(b) [3 points] Briefly explain the differences between dense and sparse graphs. When is if morefeasible to use a linked representation for a graph over an adjacency matrix. Also, justifyyour answer using a mathematical definitions for sparse and dense graphs.

 

1Problem Set 4: Sorting and GraphsCS3330 Data Structures and AlgorithmsTerm 1 2016: August 15 – October 15Dr. Jack DavaultOverview. Provide the solutions for the problems in this assignment within a single MicrosoftWord document. However, a Power Point file or scanned handwritten drawing for Problem 1(b)is fine. Remember to include your name and course number within all documents and files thatyou submit.Problem 1. [4 points] Sorting:Read the assigned chapter and the notes for Week 7 located in theLearning Activities area, and then do the following problems:(a)[2 points]. Both the Mergesort and the Quicksort algorithms will sort a list by portioningthe list. Briefly explain how Mergesort differs from Quicksort when partitioning the list.(b)[2 points] What is the big-O of theshellsort()function provided in Figure 7.6 on page297? Briefly explain how you arrived at your answer. Remember big-O measures the worstcase runtime scenario.Problem 2. [6 points] Graphs:Read the assigned chapter and notes for Week 8 located in theLearning Activities area, and then do the following problems:(a)[3 points] Draw the adjacency matrix for the following graph:Hint:Remember that links without arrows are considered bi-directional.(b)[3 points] Briefly explain the differences between dense and sparse graphs. When is if morefeasible to use a linked representation for a graph over an adjacency matrix. Also, justifyyour answer using a mathematical definitions for sparse and dense graphs.Other Notes:Submit your solutions using the Problem Set 4 link provided in the Assignment area.As usual, please ask if you have questions in either theAsk the Instructorforums area or via e-mail.

• 1495430225-PS41.pdf

ComputerScienceExpert

(11)

Status NEW Posted 22 May 2017 05:05 AM My Price 9.00

-----------

Attachments

file 1495430226-Solutions file 2.docx preview (51 words )

H-----------ell-----------o S-----------ir/-----------Mad-----------am ----------- Th-----------ank----------- yo-----------u f-----------or -----------you-----------r i-----------nte-----------res-----------t a-----------nd -----------buy-----------ing----------- my----------- po-----------ste-----------d s-----------olu-----------tio-----------n. -----------Ple-----------ase----------- pi-----------ng -----------me -----------on -----------cha-----------t I----------- am----------- on-----------lin-----------e o-----------r i-----------nbo-----------x m-----------e a----------- me-----------ssa-----------ge -----------I w-----------ill----------- be----------- qu-----------ick-----------ly -----------onl-----------ine----------- an-----------d g-----------ive----------- yo-----------u e-----------xac-----------t f-----------ile----------- an-----------d t-----------he -----------sam-----------e f-----------ile----------- is----------- al-----------so -----------sen-----------t t-----------o y-----------our----------- em-----------ail----------- th-----------at -----------is -----------reg-----------ist-----------ere-----------d o-----------n -----------THI-----------S W-----------EBS-----------ITE-----------. ----------- Th-----------ank----------- yo-----------u -----------

Not Rated(0)

• Buy Answer