View this PageEdit this PageAttachments to this PageHistory of this PageHomeRecent ChangesSearch the SwikiHelp Guide
Hotspots: Admin Pages | Turn-in Site |
Current Links: Case Final Project Summer 2007

Midterm 2 Review - Fall 2002

This second midterm in the Fall 2002 CS2340 class will include 4-5 questions, with some like the ones below and others drawn from the first Midterm Review page (Midterm Review - Fall 2002). See especially the coding and design questions from that set.

I won't post answers, but I will correct any mistakes I notice. If you don't post, I won't post.

You're welcome to post answers, questions about the answers, critiques or questions about answers that are already posted, etc.

Testing Object-Oriented Programs

See OOtesting.ppt

(a) How is testing O-O programs just like testing other programs?

(b) What features of O-O programs make testing different? How do these features make testing easier and/or harder?

Put your answers/comment/questions at Fall2002 Midterm 2 Review: O-O Testing

The SUnit testing framework

See SUnit.ppt

a. What is an object-oriented framework?

b. Why is unit testing of O-O programs so important that someone built a testing framework explicitly to support this task?

c. Explain how SUnit works as a framework to provide testing capabilities.

Put your answers/comment/questions at Fall2002 Midterm 2 Review: SUnit

UI Design

See ch6-hci.ppt

a. What are three ways to pick between user interface design alternatives?

b. Why is using a UI design process the best of the alternatives?

c. What are the three steps in the UI design process defined in Chapter 6?

Put your answers/comment/questions at Fall2002 Midterm 2 Review: UI Design

UI Evaluation

See ch6-hci.ppt

a. Describe the ways of evaluating a UI before user testing.

b. What are the key ideas regarding UI evaluation with users?

Put your answers/comment/questions at Fall2002 Midterm 2 Review: UI Evaluation

Parsing

See parsing.ppt

a. Explain how a recursive descent parser works.

b. Write Squeak code to implement a recursive descent parsing mechanism or these two productions:
Expression := Factor + Expression
Expression := Factor
Your parser should write a trace of its actions to Transcript.

c. The set of tokens recognized by a scanner is typically defined formally using finite state automata. The fintokens: message understood by instances of String in Squeak provides a "quick and dirty" way to extract a collection of tokens from a string. What is the fundamental limitation of findtokens: that makes it unsuitable as a general way to implement a scanner?

Put your answers/comment/questions at Fall2002 Midterm 2 Review: Parsing


Links to this Page