I

Important Information

Newest information at the top of each subtopic

Final Exam: Monday, December 10th, 7pm, HHS 2208

Syllabus: CS 240 Syllabus - Fall 2007.doc

Ada Installation Instructions for home computer:Ada_Installation_Instructions.doc

Useful URLs: For text’s source code

Lectures / Homework / Programming Assignments
Lecture 27 - December 3rd /
  • read the lecture notes:
  • read the section in the book on Hashing
  • review the material from the entire course, come in with questions
/ none
Lecture 26 - November 28th / Homework:
  • study the code in the graph specification, graph body, and professor Adams' programs THEN
  • either run the code for
  • depth first search
  • breadth first search
  • shortest path
  • or
  • draw a complicated graph and trace the code for a
  • depth first search
  • breadth first search
  • shortest path
  • There is nothing to turn in BUT there will be a quiz on the searches on Monday
/ none
Lecture 25 - November 26th / Study all about graphs in our text (chapter 11). There will be a quiz on the concepts and on the code (graph.adb, graph.ads). / finish up BinarySearchTree and Bulletproof.
Lecture 24 - November 19th / read about heap sort in our textbook.
Have a happy Thanksgiving!
Drive safely! / See modified BinarySearchTree specification and submission deadline.
Lecture 23 - November 14th / Look at your assignment 5 programs and see if you can make them bullet proof!
Add Search and Delete procedure to your binarySearchTree Program / See BulletProof on Blackboard under assignments
See BinarySearchTree on Blackboard under assignments
Lecture 22 - November 12th / Tell what the answer is to the last two questions about Big O in the lecture notes.
Write the program as described in the lecture notes and bring it to class (no folder) Note that it has been simplified from the description in class.
November 7th
In class assignment to be done in pairs during lecture. Assignment on Blackboard.
Lecture 21 - November 5th
REMEMBER: You have a partner with whom to do the assignment in lieu of class on Wednesday. It MUST be done between 5 and 7:30 on Wednesday the 7th and you MUST do it as a team. It has been posted as an assignment and will become available at 5pm on Wednesday. / Be prepared (next Monday) to answer the questions relating to mTimesn which are in the notes. / Finish by 5pm Nov 7th
LinkedListQueue redo
Josephus
Sort redo
Lecture 20 – October 31st / repair your Queue linked list programs. See webpage for information.
Lecture 19 - October 29th /
  • write the answers to page 7 from the exam on the copy of the page handed out in class.
  • on the back of the page, tell in words what the puzzle function does. The function is in the lecture notes.
/ 1. complete and modify programming assignment 11 so that, for each sort, it shows the contents of the array after each 'pass'.
2. write a program to solve the josephus problem (see the lecture notes).
Lecture 18 - October 24 MIDTERM EXAM
Lecture 17 - October 22
This contains the notes from today relabeled as Lecture 17 instead of Lecture 16. /
  • Study for the exam… Review ALL of the notes.

Lecture 16 – October 17 -
There was no explicit lecture 16. We talked about the random number generator and about the various sort programs.
randomNumberGenerator
testSorts /
  • Insert the other three sorts (insertion, selection, quick) into the testSort program.
/ Submit your work to Blackboard as assignment11.
Lecture 15 - October 15th /
  • Read through the lecture notes
  • Make an excel graph showing the line graphs for the following functions: N, log2N, Nlog2N N2 with appropriate values. You want to show enough values of N so that you can see that the lines differ but not so many that you can't see all of the lines. Bring printouts of your graphs to class.
  • BRING your textbooks to class
/ none if you turned the linked list queue implementation in, otherwise please complete it and submit it.
Lecture 14 - October 10th -
linkedListExamples
exceptionHandlingExamples
caseStatementExamples / see Assignment 10 on Blackboard
Lecture 13 - October 8th / finish the work you started on Queues. / See Assignment9 on Blackboard - due tomorrow night by 11:59pm
Lecture 12 - October 3rd
ourQueue.ads
showAnonymous.adb
ourQueue.adb
testQueue.adb / Complete as many of the functions in the package body ourQueue as you can. Put in stubs for all of them and syntax check it. Code them one at a time. For each procedure or function you code, syntax check and compile. As you succeed, you should add a call to the function or procedure to testQueue.adb, compile it, and run it. / Do what it says under homework… The blackboard version will be put up later.
Lecture 11 - October 1st
NOTE: all of the files are either .doc or .rtf files
firstVersion fraction_io.ads
secondVersion fraction_io.adb
thirdVersion Fractions.ads
fourthVersion fraction.adb
almostDone testFractions.adb
oops lookingGood
discrete_set.ads discrete_set.adb
set_test.adb class_set_test.adb / Study the code and the documents linked under Lecture 11
Lecture 10 – September 26th / Electronic submission of program due Sunday night by 11:59 pm
Printed version with sample input and output due in class on Monday. / See program description on Blackboard listed as Assignment8.
Lecture 9 – September 24th
Fractions.doc answers / Posted on Blackboard / none – just comment the code in the assignment posted on Blackboard.
Lecture 8 - September 19, 2007
updated version of binary_search_test2 / print out the code examples from Chapter 2 about the Bingo game and bring them to class on Monday. Come prepared to ask questions about anything in them you don’t understand. / finish the body of your Fractions specification and write a program to thoroughly test it. See Blackboard Assignment #6 for details.
Lecture 7 - September 17th -
Binary_Search_Test2_KEY
Seq_Search.ads
Seq Search.adb / Depends on what you completed of work previously assigned.
  • Everyone, write a test program to test the sequential search we constructed in class. Compile and run it and bring a printout of the test results to class.
  • If you didn't do assignment #4 on Fractions during class time, do it now and submit it by tomorrow night.
  • If you did problem #73 (the sequential search one, write the program to test your submission and run it and capture the test results and print them and bring them to class.
  • If you didn't do problem #73 but did #72 or #74, write a program to test what you did and run it an capture the test results and print them and bring them to class.
  • If you didn't do any of assignment #3 (problem 72, 73, or 74) do 72 or 74 (write the spec, the body for the spec and the test program. Compile and run the test program and capture and print the test results and bring them to class.
/ Submit ANY and ALL you write under Blackboard Assignment #5.
Lecture 6 - September 12th - Blackboard Assignment in lieu of class to be done during class time. / See Assignment #4
Lecture 5 - September 10th
using files
using end of file
in.txt - sample input file.
play with others /
  • study the lecture notes
  • look at the chapter 1 slides
  • look at the chapter 2 slides
/ Either: problem #72, #73 or 74 on page 71-75 of the text. See Blackboard Assignment for details of what to do and what must be submitted by 11:59pm on Tuesday, Sept 11th (tomorrow)
Lecture 4 – September 5th
  • ideal answer for HW#1
  • using files
/
  • will be posted

Lecture 3 – September 3rd
  • date.ads
  • show how loop control variable works.adb
  • play with enumerated types.adb
/
  • Homework #2 is on Blackboard under Assignments

Lecture 2 – August 30, 2007 /
  • do everything assigned previously that you didn’t do yet
  • read Chapter 1 of the text
  • Homework #1 is on Blackboard under Assignments due 9/3/07

Lecture_1 – August 27, 2007 /
  • install Ada
  • check exam schedules
  • run Discussion_Example1.adb
  • make folder cover
  • bring the 2 pink handouts to class
  • buy text