

Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Community
Ask the community for help and clear up your study doubts
Discover the best universities in your country according to Docsity users
Free resources
Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors
Material Type: Notes; Professor: Locklair; Class: Senior Seminar; Subject: Computer Science; University: Concordia University - Wisconsin; Term: Fall 2006;
Typology: Study notes
1 / 2
This page cannot be seen from the preview
Don't miss anything!
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
Don’t forget about CS:AO as great review Read chapter 11 in Brookshear -------------student brainstorm list------------ Draw process state diagram (actually a joke as Paul Driver hates this) Devise a TM to add – show deltas (transition functions) FA / FSM Draw circuit for this Boolean function (eg, NOR using only AND, OR) Draw circuit for this truth table What does this circuit do? (Answer via construction of truth table) How do you solve problems? Compare and contrast two PL paradigms SDLC Dorothy Sayers Mythical man-month Knuth CSC 490 Course Notes and Outline, © Dr. Gary Locklair, Fall 2006