| |  Final
Exam: Solutions
/ Grading Policy
Final
Exam
(Jan 21th, 2002 - Monday @14:00)
You are responsible for all the
chapters/sections in
the textbook that are covered in midterms plus
- The extra handouts
(copies are available at Zeki Kirtasiye) on Enumeration and Bitwise
Operators.
- Chapter 10, Section on
Bitwise Operators.
- Chapter 10, Section on
Enumeration Constants.
The exam format will be similar to the one in
the midterms.
Midterm
2: Solutions
/ Grading Policy
Midterm 2
(Dec 24th,
2001 - Monday @14:50)
Same rules as Midterm 1 apply.
You are responsible ONLY for the following chapters/sections in
the textbook.
- Chapter 1-5: coverage is the
same as that of Midterm 1.
- Chapter 6 - Arrays (excludes
searching and sorting arrays)
- Chapter 7 - Pointers:
Declarations and initialization, operators, calling functions by reference,
pointer expressions and pointer arithmetic, the relationship between
pointers and arrays, arrays of pointers (strings).
- Chapter 8 - Characters and Strings:
Fundamentals, character handling library, standard i/o library functions, general string
manipulation functions, comparison functions, search functions.
- Chapter 10 - Structures:
Definitions, initializing, accessing members.
- Chapter 11 - File Processing:
Data hierarchy, files and streams, creating a sequential access (ascii/text)
file, reading data from a sequential access file.
- Chapter 13 - The
Preprocessor: #include, #define, macros, conditional compilation, predefined
symbolic constants.
- Chapter 14 - Advanced Topics:
redirecting input/output, command-line arguments, compiling
multiple-source-file programs, suffixes for integer and floating-point
constants.
- Plus the extra handout
(copies available at Zeki Kirtasiye) on Pointers.
Midterm 1: Solutions
/ Grading Policy
Midterm 1 Coverage:
- Chapter 1- especially C Standard Library, Structured Programming, C
Environment.
- Chapter 2
- Chapter 3
- Chapter 4- excluding Structured Programming Summary
- Chapter 5- including Random Number Generation problem, but excluding A
Game of Chance. Including storage classes (only auto) and scope (only file
scope and block scope).
Hints for Exam 1:
- Majority of the questions will be selected
from the exercises (regular and self-review) given in the textbook. Be
prepared!
- There will be some definitions,
space-filling and multiple-choice questions, in addition to the complete
program or code segment writing questions.
- You
will
be responsible for following the Good Programming Practices given in the book
while writing C code in the exam.
- Check out the questions asked in ELE-492 last
semester (see the web page).
- Exam duration will be 105 +/-15 minutes.
Frequently Asked Questions:
Q: Do we have to memorize all the definitions in
the book?
A: No, you don't. You just have to understand
them well and define them in a logical manner when it is asked.
-
Q: Do we have to know the precedence of all the
operators? We prefer to use parentheses if we need to use them.
A: But there are situations where others do not
care to use parentheses. You may have to read and understand their code. But use
your brain power to figure out why the precedences' are so assigned:
parentheses come first, assignment types come last. Unary operators come second.
Arithmetic operators have higher precedence than relational operators, and they
have higher precedence than equality and logical operators. And so on.
| |
Send mail if any of your grades
(active version)
is missing or wrong
Check out the Final
Exam solutions
See TA's page for hot news!
|
