1.22.03 - Quiz on Big-Oh. As we discussed yesterday, anyone wishing to gain Project points can do so. The Bonus Project is linked below..

[ Bonus Project ]

1.21.03 - Quiz on Truth Tables. Today we will review Big-Oh in preparation for Quiz tomorrow.

[ Calculating actual and formal running times | Notes on Truth Tables ]

1.20.03 - Today we will review Truth Tables in preparation for Quiz tomorrow.

[ Notes on Truth Tables ]

1.17.03 - The whole class will review the practice exam today.

[ Calculating actual and formal running times ]

1.16.03 - I will meet with Fabiana and Nao today and go over the practice exam since they did not finish them over the break..

[ Calculating actual and formal running times ]

1.15.03 - Yesterday didn't go as expected, but we did talk about the idea of a Heap data structure. That topic will return to us soon... Today we will discuss AP multiple choice exam.

[ Calculating actual and formal running times ]

1.14.03 - Let's go over those AP multiple choice exams!

[ Calculating actual and formal running times ]

12.13.02 - I have the AP Computer Science multiple choice exam from 1999, which I will give to all of you today in class.  Seniors, please take this home with you and do with it what you would like over the winter break.   All others, please set up a time with me for next week when you have two class periods in a row free.  Remember to include D format as one of the periods that is 'free.'  We will meet then and you can practice taking the test in one chunk.  During today's class we will discuss the topics and goals of the APCS exam. 

[ Calculating actual and formal running times ]

12.11.02 - Today we will talk about the homework.

[ Calculating actual and formal running times | Assignment 9 ]

12.10.02 - We will continue studying computational complexity by looking at other problems we can solve and calculate the running times for.  Assignment 9 is due tomorrow.

[ Calculating actual and formal running times | Assignment 9 ]

12.9.02 - We will spend this week studying computational complexity by analyzing the actual and formal running times of different algorithms and different classes of algorithms.  For homework, please read Astrachan chapter 11.4.

[ Calculating actual and formal running times ]

12.6.02 - vectorize() is due today.  We will test the application using Binary Search Trees and look at the remove() member function.

[ Templated Classes | Project 2 ]

12.4.02 - We will continue to work on project 2.  Function vectorize() is due on Friday.  We should hope to have the BST working with the MBCS by next week.

[ Templated Classes | Project 2 ]

12.3.02 - We need to write function vectorize(apvector <Comparable> & v), that converts the BST into an ordered vector.

[ Templated Classes | Project 2 ]

12.2.02 - Today we will work on integrating the BST code we have written with the MBCS.  First, you will need to get the remove function from my code.  Open up my incomplete solution for the Case Study/BST implementation.  Copy the remove function from there (we will have a look at it later) and then replace my code with all of the code from your implementation of BinarySearchTree.  Add function remove to your code.  Getting your solution to work together with mine will take some work, but we will work on it for a bit.

[ Templated Classes | Project 2 ]

11.21.02 - Continue work on Project 2.  Hopefully everyone will finish up today.  Happy Thanksgiving!!!

[ Templated Classes | Project 2 ]

11.20.02 - Continue work on Project 2.  It is due December 6th.

[ Templated Classes | Project 2 ]

11.19.02 - Continue work on Project 2.

[ Templated Classes | Project 2 ]

11.18.02 - Continue work on Project 2.

[ Templated Classes | Project 2 ]

11.15.02 - This was the initial due date for our project.  The new due date is Friday, December 6.  In the meantime we will move on to and work on a new topic.

[ Templated Classes | Project 2 ]

11.13.02 - I am sorry to have to cancel class today.  Medical emergancy.  I probably will not be around tomorrow either :-(

[ Templated Classes | Project 2 ]

11.12.02 - We are continuing our work on project 2.  Remember that our ultimate goal is to get the Marine Biology Case Study to work with BSTs.  I will worry about the Case Study part and the remove command.  We will ultimately look at the details of it together.

[ Templated Classes | Project 2 ]

11.11.02 - Hopefully everyone has the insert and print functions finished by today. Next you will want to focus on the four necessary function that need to be implemented when your class has pointers: the copy constructor, default constructor, destructor and equal operator.

[ Templated Classes | Project 2 ]

11.8.02 - Both print and insert will use "wrapper functions," functions that get called from the function themselves.

[ Templated Classes | Project 2 ]

11.6.02 - Start with the insert and print functions. You should be in good shape if the two of those are up and running by Monday.

[ Templated Classes | Project 2 ]

11.5.02 - This unit on Binary Search Trees brings a lot of what we have done together in a meaningful way. Pointers, recursion and templated classes are good examples of topics we will be covering while working with. The link describing templated classes, below, is not thorough. Your cononical reference will be the Astrachan text.

[ Templated Classes | Project 2 ]

11.1.02 - We will talk about Binary Search Trees after having a look at the solution from the latest assignment. Have a great weekend!

[ friend keyword | Assignment 8 ]

10.30.02 - Linked lists are discussed in Chapter 12.2 of the Astrachan book. Inserting and deleting are discussed on 600-601, and the LinkStringSet class we need for Assignment 8 is described on pages 612-615.

[ friend keyword | Assignment 8 ]

10.29.02 - Please open the LinkedList folder within the Materials folder on the server. We will look at a simple Linked List implemenation for sets. Assignment 8 is due on Friday, and involves changing the set class as implemented.

[ Assignment 8 ]

10.28.02 - We will do our best to start discussing Linked Lists today.

10.25.02 - I am sorry to be cancelling class today. Please drop Assignment 7 into the dropbox.

[ Assignment 7 ]

10.23.02 - Continue working on Assignment 7 in class today. Once you have surpassed the more significant challenges of the assignment, we will start talking about novel uses for pointers.

[ Assignment 7 ]

10.22.02 - We will work on Assignment 7 today. Assignment 7 has us making a change to the Environment class so that the underlying data structure is modified to an apvector of pointers to Fish.

[ Assignment 7 ]

10.21.02 - Today's pointer discussion is very important. You should bring any questions you have from the chapter 12 reading. We will also try out a few things with pointers.

[ Assignment 7 ]

10.18.02 - Today we will discuss the advantages and disadvantages of the different solutions. Please read about pointers in chapter 12 of the Astrachan book for homework this weekend.

[ Assignment 6

10.16.02 - With the graphics working, we will now spend a few days working on making the project work in the unbounded ocean. I will provide you with the code. You should study the code and look at the complex components (functions ReOrder(), InserInOrder(), BinarySearch(), etc). You will also need to add your overloaded operators (< and >) from Assignment 6 to the project. If everything works, then your operators work.

[ Assignment 6 ]

10.15.02 - We can get the Graphics for the MBCS working. Please get the files from the materials folder, stored in folder "P:\Science\Computer Science\c-300\materials\MBCS Project 1". Replace fishsim.cpp, display.h and display.cpp with their graphical counterparts, and add waitnclear.h and waitnclear.cpp to the project. You also will need to add the entire CMUGraphics folder (which you can get from one of the folders in the materials folder) into the folder containing your project. Finally, you will need to add CMUGraphics.lib to the project.

[ Project 1 ]

10.11.02 - Everyone will have the opporunity to present their solution to one part of the project. Talya is out (Go Tennis!), so the rest will present the first three parts and Nao will present part 5 (Good luck, Nao!). Thanks for all of your hard work on the project - we have quickly become Marine Biology Case Study Experts. We will keep working with this for a while. Next up is the unbounded ocean. For now, though, please enjoy a weekend with no homework. See you Tuesday.

[ Project 1 ]

10.10.02 - Project 1 is due on Friday, which gives us two more class todays. After discussion in class yesterday, we will go forward with the plan to have you each present a part of the project on Friday. Since part 5 is the biggest challenge, you can choose in advance to speak about that part. Everyone else will be chosen at random - so you will need to be prepared to talk about all of the first four parts.

[ Project 1 ]

10.8.02 - Project 1 is due on Friday, which gives us three more class todays. On Friday, each of you will be asked to discuss the problem and solution of one part of the project. I don't want you to be nerve-wracked, but this does mean speaking in front of parents - potentially even your own.

[ Project 1 ]

10.4.02 - Project 1 is due in one week. That does not mean that you should work any less hard than you have been this week, it means that part 5 is harder than expected. I will be giving you some ideas, but you will need to work out the details independantly. Please work on this project this weekend before going to see the movie on Sunday. The time after the movie is likely to be difficult to focus on your homework. I will start adding nightly assignments to the work you are doing on the project on Tuesday next week.

[ The Emperor's Club | Project 1 ]

10.3.02 - Okay, so I finally caved and gave you extra time for the project. I would like to be able to collect it next Friday. Part 5 is pretty overwhelming, and I am glad to see that everyone is beginning to work more indendantly..

[ Project 1 ]

10.2.02 - Project 1 remains due on Friday. You should have the first three parts finished by the end of class today. Part 4 is not too bad once part 3 is done. If you are falling behind on these suggested deadlines, please let me know so we can set up a meeting. We will meet tomorrow during D.

[ Project 1 ]

10.1.02 - Project 1 remains due on Friday. You should certainly have the first two parts finished by the end of class today. Part 3 has some implications for the rest of the program, so the more you can work on that one today the better. Your goal will be to finish part 3 by the end of class tomorrow. Part 4 is easy once part 3 is done, so please expect to have that done as homework Wednesday night. Having the male fish chase the female fish is hard, so we will be sure to have Nao present her findings on Thursday.

[ Project 1 ]

9.30.02 - Assignment 5 is due today. Please place it (environ.cpp) in the dropbox. Today we will start on Project 1 which is tentatively due on Tuesday next week Friday.

[ Project 1 ]

9.27.02 - Let's recall and discuss the questions posed on Wednesday: In which member function does AddFish() get called the most? What does AllFish() do? Where does AllFish() get called? What would cause IsEmpty() to return true? Finally, we should look more closely at the Neighborhood and position classes. Monday, we start project 1.

[ Project 1 | Assignment 5 | Assignment 4 ]

9.25.02 - We have looked at class Fish, now it is time to have a little bit of a look at class Environment. Identify the following components in class Envrionment and understand how they relate to the program: In which member function does AddFish() get called the most? What does AllFish() do? Where does AllFish() get called? What would cause IsEmpty() to return true?.

[ Assignment 5 | Assignment 4 ]

9.24.02 - Today we will start by using the CodeWarrior Wizard to create a new Marine Biology Case Study project. We will run the project file to see how the case study works. Then we will begin picking apart the case study class by class. Today we will start with class Fish. Assignment 4 is due on Friday.

[ Assignment 4 | Assignment 3 ]

.MBCS.

9.23.02 - I really messed up on Friday. So we will move the calendar back a day, take the quiz and the class picture and discuss assignment 3, which is due tomorrow.

[ Assignment 3 ]

.MBCS.

9.20.02 - We will have a quiz today. Very short, based on the Memory game program. Then we can talk a bit about the matrix stuff needed for Assignment 3, which is due on Monday.

[ Assignment 3 ]

.MBCS.

9.18.02 - We will go over and finalize the Memory game program and hopefuly begin to discuss this Marine Biology Case Study. Please do not forget that I will be in my classroom during D format tomorrow to meet with anyone who wishes to meet with me and discuss the quiz coming up on Friday. Also, Assignment 3 will be due on Monday.

[ Assignment 3 | The Marine Biology Case Study ]

.Memory game project.

9.17.02 - Our Memory game program is so close to working. We will have a quiz on the Memory program on Friday. Tomorrow we will go over it in detail. In the meantime, please read the beginning of part II of the case study: pages 19-30.

[ The Marine Biology Case Study ]

.No class today.

9.16.02 - No morning classes today, so I will see you tomorrow. Please read Part I of the Marine Biology Case Study for Tuesday's class.

[ The Marine Biology Case Study ]

.The Memory Game.

9.12.02 and 9.13.02 - Almost done with the memory game!

Keep working on the code like it's homework

.The Memory Game.

9.10.02 - Today we will work together in class to organize the relationships between the classes we have built and write some code to implement.

.The Memory Game.

9.9.02 - Today we will talk about your results from Assignment 1 and turn that into header files for classes whose member functions we will implement Assignment 2 is to begin the task of writing the source code to implement the header files.

[ Assignment 2 ]

.Welcome.

9.6.02 - Welcome to Computer Programming III. Yesterday we spent some time getting to know each other again, and hearing about our summers. I am very excited about programming III this year, and know we will have tons of fun. Assignment 1 is due on Monday.

[ Assignment 1 | Class Guidelines ]

Type whatever you want here

Last Updated: