Final Exam
COP-3223H
Table of Contents
Exam format
| Type | Count |
|---|---|
| Multiple choice | 4 |
| Open ended | 5 |
| TOTAL | 9 |
| Graded | 8 |
There are 9 questions, but the score will be calculated out of 8, i.e., one question will count as extra credit. No particular questions are extra credit, but since there are 9 questions and the denominator is 8, one of the questions with the lowest score will serve as the extra credit.
Exam Procedure
- You will need the do the following to have your exam counted
- Be in the exam room physically.
- Use UCF here to record your attendance, or notify the instructor if you come in late.
- Submit your exam on time before leaving the room
- Show your UCF ID to instructional staff
- Submit your exam questions, showing your UCF ID card and your notes
- Do not take the question sheet (if received)
- You may keep your notes
- Sit at least one seat apart from other students (only if possible)
- Have on your desk only the following:
- Notes
- Blank scratch paper
- The exam
- Having any other items, devices, information sources, materials, or any other assistance to you or others is prohibited and will results in no credit for the exam, this includes but is not limited to
- Cell phones or other electronic devices
- Mechanical devices
- Information sources
- Communication devics
- Any other information open or available on your laptop
- Anything else
- Follow the University and course policies, such as the golden rule and prohibitions on unauthorized assistance
- SAS students will take the exam at SAS and they will take attendance
- Raise your hand and a proctor will come to you
- Stop taking the test no later than the end of the class period
Content
Struct
- declaring struct types
- declaring variables as structs
- using structs
- structs vs. pointers to structs
- structs as inputs/outputs to functions
Functions
- function semantics, inputs/outputs
- following sequences of statements
- creating new functions
Recursion
- solve problems using recursion
- follow the sequence of steps of a recursive function
- understand and use recursive steps and base cases
- understand backtracking problem solving
Pointers
- three basic operations: reference, deference get, and dereference assign
- using malloc/free, malloc's input and output
- pointers as input/output to a function
- following sequences of statements with pointer operations
- arrays vs. structs