Day 28 - 7 December 2006 (Pearl Harbor Day)
Handout example GRE Computer Science questions (double-sided
handout)
Exam review continued
possible questions:
what does this code do? read a listing – should listing follow
“professional programming practice?”
create C++ code to hash a record into an array:
create pseudo code to sort:
output of this circuit (gates)
(list gate symbols and names)
describe the function of this “white box” (show gates)
(ie, create a truth table)
construct a half-adder (or a mux, or a de-mux) from gates
provide inputs/outputs via binary addition
discuss phases in s/w engr lifecycle
compare and contrast OS memory manager and processor manager
compare these two algorithms: which is better? (BigO)
write a recursive function to compute n!
what data structure would you use for this program application?
what control structure would you use for this program application?
finite automata
turing machine
proof
error-detection and correction capability
extra credit
CSC 490 Course Notes and Outline, © Dr. Gary Locklair, Fall 2006
