CSCI 2610/2611, Spring 2000
Last modified: 5/6/00
Quizzes and practice problems
I apologize for the strange form of the quizzes. They were converted
to html by Microsoft word, which does an astoundingly bad job.
Syllabus
This is a computer programming course using C++. Please see the
syllabus for details.
System notes
Notes are available on how to compile, run and debug programs
in the lab in Austin 320. See
system notes.
Problem solving notes
Notes are available on the fundamentals of problem solving using C++.
See problem solving notes.
Example programs
A few
example programs
are available for you to use a guides.
Assignments
Assignments will be posted here as they become available.
Typically, there will be one assignment per week.
You will be able to work on the assignments during the lab, but you will
probably need to do some work on your own as well. You can work
in Austin 320 or elsewhere. You can use any C++ compiler.
Summary of material covered
- Jan 11. We discussed the syllabus and began the basics of C++.
We covered material on variables, types and assignment. This material
is covered in section 2.1 of Savitch.
- Jan 13. We covered expressions and input and output. We briefly
introduced if statements and while statements.
This material is in 2.2, 2.3 and 2.4 of Savitch.
Lecture notes are available.
- Jan 18. We covered the main program, the most basic aspects
of functions and started on loop design techniques. We will cover
functions and loops in a lot more detail in the future, so if you
had some difficulty understanding, your misunderstandings will
probably be dealt with shortly.
For those who could not come due to the snow,
notes are available. See the next entry
for another example.
- Jan 20. We discussed conditions and did a loop design example.
Lecture notes are available.
- Jan 27. We discussed data-oriented loop design and how
functions work. The loop design example done in class is the data-oriented
example in the Jan 20 lecture notes, computing powers. For a discussion of
functions, see Savitch, 3.3-3.5.
- Feb 1. We discussed function contracts, and did some examples
of functions. Lecture notes are available.
- Feb. 3. We discussed recursion.
Lecture notes are available.
- Feb 8. Quiz 1 was given. We discussed more on recursion, and
discussed call-by-reference. Call-by-reference is decribed in section
4.2 of the text.
- Feb 10. We began discussing object-oriented programming and
file operations. Material is from Chapter 5 of the text.
- Feb 15. We had second attempt at quiz 1. We discussed more
on files an object-oriented programming from Chapter 5 of the text.
- Feb 17. We finished files, and began Chapter 6 of the text.
We are now seeing how to create our own objects. To do that, we
create a type of object. This is something like a blueprint
for creating objects. There are two general kinds of objects: open
and closed. An open object lets all of its variables be publicly
accessible. A closed object keeps its variables private. The type,
or blueprint for an open object is called a structure. The type of
a closed object is called a class. We are
starting by looking at creation of open objects and structures.
Read Section 6.1 of the text for how to write and use structures.
- Feb 22. We discussed more on object-oriented programming.
You should read Chapter 6 of the text.
- Feb 24. We discussed more on object-oriented programming.
We looked at a class to handle dates. We did not finish all of the
class, but hit the high points.
- Feb 29. (See Gregorian calendar. Today is a special case
that will not come along for another 400 years. Wow!)
We discussed how to break a
program up into modules and how to write a class as a separate
header file and implementation file. Assignment 7 contains some
of this material.
- Mar 2.We finished object-oriented computing, discussing
constructors for classes. We began discussing a few other language
features, covering for-loops.
- Mar 7. We will discuss do loops and switch statements, and begin
arrays.