Western Oregon University

Contact Information

·        Office: ITC 309

·        Phone: 503-838-8991

·        Fax: 503-838-8332

·        E-Mail: jcm@wou.edu

·        S-Mail:

Division of Computer Science
Western Oregon University
345 North Monmouth Avenue
Monmouth, Oregon  97361

Schedule for:

Dr. Marsaglia

Appointment Scheduling:

§  If you wish to make an appointment with me then you MUST email me with the time and day you select from my Office Hour chart.

§  You need to explain the REASON for your appointment request.

§  You MUST send your email more than a day before you wish to meet.

§  You MUST also get a response from me and only me guaranteeing that your appointment will be reserved.

§  I am the ONLY one who will create my appointments.

IS 320 Materials:

IS 320 Syllabus

IS 320 Course Calendar

RESOURCES

Assignments:

Link for “How to insert FlowChart symbols” using Microsoft Word

Binary Search tree definition and examples starting at Page 397 in Algorithms”

Create a Binary Search Tree with the following data values:

 13 4 6 7 21 11 15 16 9

Turn in at class Wednesday May 6th.

FlowCharts to study for Friday May 15th

Recursion:

Quick Sort Video Example:

Quizzes:

Quiz #1 April 24th in class

Quiz #1 Key

Quiz #2 Key

Quiz #3 Key

MID-Term-References

Final:

References:

FlowChartExample

InsertionSort and SelectionSort

Algorithms-Flowcharts-Overview

CS 406 Materials:

CS 406 Syllabus

Assignments:

CS 440 Materials:

CS 440 Syllabus

CS 440 Course Calendar

RESOURCES

“Back of the Envelope”

“Maximum Sub-Vector”

Assignments:

Sorting Assignment

Bin Packing Assignment

Programming Assignment:

If your V Number ends in 0 or 1  FFD implementation

If your V Number ends in 2 to 6  BFD implementation

If your V Number ends in 7 to 9  NFD implementation

P versus NP:

HTML version of 20 questions for Don Knuth

http://www.informit.com/articles/article.aspx?p=2213858

QUIZZES:

Algorithms: May 1st 2015 (Resources for the Quiz: Everything in Green)

Quiz #1 Key

POWERPOINT:

MID-Term-References

Final

CS 660 Materials:

CS 660 Syllabus

CS 660 Course Calendar

RESOURCES

“Back of the Envelope”

“Maximum Sub-Vector”

BackOfTheEnvelope

MaximumSubVector

Assignments:

Assign#1

Vector Algorithm

Assignment/Project

Safe Migrant Transportation from Africa to Europe

Algorithm will be a Depth-First-Search Strategy (DFS) on a weighted Graph Representation

1.View the following to become knowledgeable in the DFS algorithm:

2.Use the article above for the following data:

i.    From Libya to Italy to Chosen Country Destinations and relative distances

ii.    Relative costs for the edges of the graph

iii.    Cost factor to provide “SAFE” passage across the Mediterranean Ocean

a.      David: Initial Graph Design and Description of Coding Implementation

b.                Eman: Suggested Cost Distibution (for every path) from Libya to Destination

c.Alhanouf: Predicted Number of people allowed on each edge of the graph.

From Source to Destination

(all above) Due on Friday May 1st 2015

P versus NP:

QUIZZES:

POWERPOINT:

MID-Term-References

Final

·        Blackboard collaborate

·        Virginia Tech University Online Tutorials

·        Go Online Files CS 121

·        http://wps.prenhall.com/bp_go2007accv1_1/

Support WebSite

·        Oregon State Job Site

·        http://online.onetcenter.org/find/career?c=11&g=Go

·        Another Job reference site

·        http://www.qualityinfo.org/olmisj/OIC?areacode=4101000000&rpttype=full&action=report&occ=113021&go=Continue

·        http://www.statesmanjournal.com/apps/pbcs.dll/article?AID=/20101018/PREPSSPORTS/310180002