ENEL 315 Winter 1997
Summaries of Lecture Topics

Note carefully! I will not be putting my lecture notes on line. I expect students to attend lectures. If you miss a lecture, the best way to get the lecture notes is to borrow them from a fellow student.

``Related reading'' is material in the textbook that is directly connected to the topics covered in the lecture.

``Recommended reading'' is material in the textbook that is not directly connected to the topics covered in the lecture, but is important and useful background for review, for understanding lab programs, or for material in upcoming lectures.

Here is a link to the current week's lectures.

Week 1

Lecture #1 (Mon., Jan. 12)

Introduction to ENEL 315. Explanation of policies on the course outline.

Lecture #2 (Wed., Jan. 14)

Review of singly-linked lists and linked list traversal. Intro to a new data structure: doubly-linked list with dummy head node.
Recommended Reading: Horstmann, all of Chapter 2.

Lecture #3 (Fri., Jan. 16)

More about doubly-linked lists. Two simple kinds of friend relationships. Sketch of a header file for the TWList and TWIter types.
Recommended Reading: Horstmann, pages 41-50.

Week 2

Lecture #4 (Mon., Jan. 19)

Inserting an item into a TWList. Introduction to the bool type. Iterator objects; example uses of iterators on TWList objects.
Recommended Reading: Horstmann, pages 51-65.

Lecture #5 (Wed., Jan. 21)

More discussion of iterators.
Overview of some software development tools.
Recommended Reading: Horstmann, pages 359-374.

Lecture #6 (Fri., Jan. 23)

Models for building C++ programs from source. Translation units, object files, separate compilation and linking.
Recommended Reading: Multifile projects and Makefiles (handout).

Week 3

Lecture #7 (Mon., Jan. 26)

Introduction to the make program.
Recommended Reading: Multifile projects and Makefiles (handout).

Lecture #8 (Wed., Jan. 28)

A bit more about make.
Introduction to container classes and some common containers: Stack, Queue, PriorityQueue. Example use of a Stack.
Recommended Reading: Horstmann, pages 449-458.

Lecture #9 (Fri., Jan. 30)

Example use of a Queue and a PriorityQueue. A practical algorithm that uses a Queue--searching an airline route map.
Recommended Reading: none.

Lecture #10 (Mon., Feb. 2)

Some minor C++ features used in recent and/or upcoming labs:

• the conditional operator, as in
  y = (x >= 0) ? x : -x;
• enum types
• the explicit keyword

Recommended Reading: Horstmann, pages 317-318 (on one-argument ctors).

There were about 37 lectures in total in the course. I stopped posting these summaries because I was really busy and this page wasn't getting very many hits. I may complete the list sometime in Fall 1998 so second-year students can get some idea of what is coming in Winter 1999.

Back to top of page.