Final Exam Review for CS 201

1. Types

   1. sizes are char <= short <= int <= long and float <= double

   2. string is a class, not a built in type.

   3. unsigned is a thing.

   4. unsigned char is a thing.

2. Printing

   1. cout formatting with http://faculty.cs.niu.edu/~mcmahon/CS241/c241man/node83.html

3. Pointers

   1. Address of a variable is &foo.

   2. Can you take the address of an expression like this: &(1+2).

   3. What does it mean to take the address of a pointer: &pointer

   4. In parameter passing, these are different
      foo(int *f)
      foo(int &f)

   5. * dereferences.

   6. int *a; *a = 1; // this is bad

   7. int *a = 1; // this is also bad.

   8. What does -> mean, and how does that relate to * and .

   9. What happens if you follow a bad pointer.

   10. Legal: pointer + int, pointer – int, pointer-pointer. Know what type each produces.

4. Arrays and pointers

   1. An array name is like a read only pointer

   2. data[5] == *(data+5)

   3. pointer++ and pointer-- only make sense on arrays and move by sizeof(type)

5. Files. Know how to do these things:

   1. ifstream

   2. ofstream

   3. fstream

   4. tellg

   5. seekg

   6. read

   7. write

   8. getline

   9. How do you open a file.

   10. Which operations cause the file pointer to move, and how?

   11. How can you decide if a file exists?

   12. How can you find the file size?

   13. How can you find the number of lines in a file.

6. Assert command

7. Recursion

   1. There is a base case and a one or more recursive cases.

   2. Know how to do simple recursion examples with math

   3. How to do simple recursion examples with linked lists

8. Standard Template Library

   1. I expect you can look up stuff

   2. When is a list, vector, or set the best choice?

   3. Know how declare a vector of ints, or a set of strings, etc.

   4. Bonus: Declare and use forward and reverse iterators

      1. auto is useful here.

9. Header files

   1. Know how to make a simple header file.

   2. Know what code normally goes in the *.h file, and the *.c file.

10. Linked Lists

    1. How to make, insert, delete, and search them.

    2. Know storage costs

    3. Know run time costs.

11. Circular Arrays

    1. How to implement one

    2. The conditions for empty and full

    3. How to advance a pointer

    4. Searching the array

    5. Adding to the front and back