# Monthly Archives: April 2016

## Project due May 16

You may work alone or in groups of at most 2. The project has 3 parts. Part 1 (30%): Run an algorithm on an input set You are given a fragment of pseudocode below which describes an algorithm. (a) The pseudocode below … Continue reading

Posted in Project | 4 Comments

## Homework due and quiz #9 – Wednesday, May 4

8.3 #14, 15, 16 8.4 #2, 4, 8, 10, 12 It might not be immediately obvious because the wording is a little different, but the exercises from 8.4 are similar to the examples we saw in class today. If it’s … Continue reading

Posted in Homework, Quizzes | 2 Comments

## Merge and mergesort

Head’s up: after Wednesday’s quiz, we’ll use the master theorem to determine a big-O estimate for the complexity of the mergesort algorithm. Today you and your partner implemented the merge algorithm on the ordered sets of numbers that you chose. … Continue reading

## Two equivalent formulations of the binary search algorithm

First version: procedure binary search (: integer, : increasing integers) while    if then  else if then location else location return location Second version: procedure binary search (: integers, , : increasing integers) if then  return else if ( and … Continue reading

## Homework due and quiz #8 – Wednesday, April 20

Section 8.2 #11 Section 8.3 #8, 10, 11, 12, 13

## Homework due and quiz #7 – Wednesday, April 13

Section 8.1 #2a, 8, 14, 28, 30 Section 8.2 #4, 8

## Rivka Ligier Test #2 Review: 11.4 #15

Use the depth-first search to produce a spanning tree the given sample graph. Choose a as the root of this spanning tree and assume the vertices are ordered alphabetically. Excuse my horrible drawing 🙂

Posted in Uncategorized | 1 Comment

## Test #2 Review – Kamil Sachryn

Chapter 11.2 #13

Posted in Test #2 Review | 1 Comment

## Jose_Betance_Test_Review_2_11.4_#15_

Chapter 11.4 #15 See link below: 11.4 #15 -Jose Betance