SE 3M04 T1 2002
Exercises Answers
Material for final
The make up test is available as a PDF file.
The answers are available from the Answers page.
Material for first midterm
Make sure to review all the notes for each class, paying
close attention to definitions of terms. A good understanding of BNF, types, expressions,
formulas and MIS will definitely come in handy. There are question(s) on the midterm from
almost every single class.
Some sample questions:
- What does CMM stand for ?
- What are the 7 components of the Software Process?
- Is abbbaa a string of (b*a*) ? What about a+b*a* ?
- Is pop(pop(push(2,empty))) a valid expression from (int stack) ?
- Give 4 characteristics unique to the XP development process
- Write out the type ('a x ('b seq -> 'a seq)) -> 'a set in english.
Some more sample questions:
- [Hard] Give the BNF for the set of all strings on alphabet {a,b,c} that start with 2 a's,
always contain accb as a substring, and ends with b ?
- [Easy] Give the BNF for the set of all strings on alphabet {a,b,c} that start with 2 b's,
always contain accb as a substring, and ends with a ?
- Write out the type ('c x 'b) -> ('a x ('b seq -> 'a set)) in english.
Material for second midterm
All of the material for the first midterm is expected to be known. Expect questions
on material (like types and BNF) that was not well answered on the first midterm.
Some sample questions:
- Define 'module'
- What is a 'secret' ?
- What is an MIS ? [What does the acronym stand for, and what does it mean]
- What are the characteristics of good modules?
- Is it possible to tell (externally) if the implementation of a language is
through an interpreter or a compiler ?
- Name 5 kinds of software structures
- What does MVC stand for, and where would it be encountered?
- What are the elements of a Design ?
- What are the 4 purposes of an MID ?
- What is litterate programming?
- Given the Heap MIS (p.90), with Data being 'integer', simulate the following execution:
- put(1, 1)
- get()
- init()
- get()
- put(1,1)
- put(1,2)
- put(4,17)
- get()
- num(2)
- num(1)
- Write an MIS for searching. In other words, given an indexable data structure,
find if a given element x is in that structure and if so return (an) index of its
location. How does it differ from the Binary Search MIS (5.2.6) ?
- Is your previous MIS deterministic ? Should it be ?
Back to main page