Final Exam: Saturday, June 17th 3:00pm-6:00pm
Final Exam Location: TBA
A graph is a finite set of dots called vertices (or nodes) connected by
links called edges (or
Be able to read and write code using:
Supplement to Linked List Lecture
First some notation: When we show a pointer pointing to an object, its irrelevant where the arrowhead of
the pointer touches the object. Thus, these two pictures of a situation where two pointers point to the
CI1154: Week 2 Assignment Worksheet
Type your name here
To answer the following questions, please reference the information provided in the Week Two
Presentation Materials folder in the online courseroom and the specifications of your computer.
Composition with Initializer Lists
Learning how to use the VC debugger
For on-your-own study:
A few final topics required for Project #1
The slides are from Professor Nachenberg.
How to calculate growth patterns:
Suppose we have 2 NxN matricies (same size) A and B, and want to sum them into a new NxN matrix C.
We need to do N^2 additions, and we can see this very easily. However, let's come up with that N^2
number using a generali
Template Functions and Class
2010 David A. Smallberg
int minimum(int a, int b)
if (a < b)
double minimum(double a, double b)
if (a < b)
cin > k;
cout < minimum
Writing a computer
program that can
play chess or checkers!