Lecture Summaries - Week 15
Jump To:
[Lecture Index |
Previous Week's Lectures |
Final Week's Lectures]
Topics covered:
- What two-dimensional arrays are.
- Why we need two-dimensional arrays.
- How we declare a two-dimensional array.
- How we access an element within a two-dimensional array.
- How we run through a two-dimensional array.
- How we pass a two-dimensional array as parameters.
- How we can use a two-dimensional array to represent a Tic-Tac-Toe
board.
- A program to monitor users playing Tic-Tac-Toe.
(tictac.c).
Topics covered:
- Why it's important that a "good" program be correct, maintainable, and
efficient.
- How to use "profilers" to locate time-consuming functions.
- How to use pointers to speed up one-dimensional array traversing.
- A function to initialize all array elements to 0
(init1d.c).
- A faster function to initialize all array elements to 0
(init1d2.c).
- Why pointer traversal of a one-dimensional array is faster.
- How to use pointers to speed up two-dimensional array traversing.
- A function to initialize all two-d array elements to 0
(init2d.c).
- A faster function to initialize all array elements to 0
0 (init2d2.c).
- Why pointer traversal of a two-dimensional array is faster.
Reading: Chapter 9.2.
Topics covered:
- Summary of what was covered this semester.
- Summary of what's on the final.
- Summary of key skills required to pass this course:
- The ability to break large problems into smaller problems,
where the small problems are solvable by functions, and then
to combine these solutions to solve the original problem.
- The ability to implementing solutions to problems by applying
programming patterns.
- The ability to map conceptual data organizations to the
mechanisms for storing
data by provided by C (arrays, two-d arrays, and structures).
- The ability to find, explain, and fix errors (debugging).
Reading: Chapter 13.1 (pages 311-318).
[EE150 Home Page |
Top Of Page]