Transcript Lab 14 PowerPoint

CS1112-206/211/212–Fall 2009
Lab 14 – Last Lab
Tuesday, December 1, 2009
Wednesday, December 2, 2009
1
Takeaways from CS1112

There are many ways to solve a problem.

Some of them are more acceptable than others.


Three steps in writing a program:

Designing
Implementing
Testing

How to drive a car.

There is no free lunch.




How to have bananas in your dorm room?
You should spend most of your time in the first
and last steps.
Functions as Black Boxes
Time-and-Space Tradeoff
2
What to do after CS1112?

1112 -> 2800

Discrete Structures


1112 -> 1130 -> 2110

Object-Oriented Programming and Data Structures


Another paradigm of programming languages
2110 -> 3110

Data Structures and Functional Programming


Mathematical Foundations of Computer Science
More complex (but really useful) programming languages
2800 + 3110 -> 4820

Introduction to Analysis of Algorithms

How to go to as many parties as possible in limited time?
3
Time’s Up.




Thanks for being here and participating.
Hope you enjoy the section. I always do.
See you at Mobile Office Hours and the final exam.
Reminder: Final Exam




Date:
Time:
Place:
Monday, December 14, 2009
7-9:30PM
Barton Hall 100 West, Main Floor
Good luck!


See you around.
Feel free to (and please) say hi.
4