ITEC 380 2020spring ibarland

home—lectures—recipe—exams—hws—D2L—zoom (snow day)

Exams

• exam02

  See D2L discussions for the exam-instructions.
  Here is a practice exam & solution (solution available Sat noon, to help encourage a practice-take before looking at the solution).
  Our exam might include...
  • Anything on the exam01 list above.
  • Given a grammar, be able to design structs to represent parse trees for it (you'll have a choice of racket or Java).
  • write a recursive-descent parser for that grammar (returning the parse tree).
  • Be able to write functions which process that parse-tree, including functions that selectively stop processing sub-trees based on some criterion.
  • Questions based on bits of code from the W0-W4 implementations, possibly modifying that code.
  • prolog questions, including list-based processing.
  • questions very-similar to #1,#2 from this exam02-practice.
  • Questions the same-or-similar-to any question on exam01 are certainly fair game.

---

• exam01

  • The exam is 3hrs, asynchronous, open-note, closed-friend.
  • It will be due on D2L, 3hrs after you access the pdf from D2L. It will be available from 2020-Apr-09 (Thu) 12:30 through Apr-10 (Fri) 18:30.
  • The exam is geared to be finished within 1h30m, so the 3-hour limit already includes “interruption time” for minor things that may arise while you are taking it.
  • You may refer to your notes, the course textbook, any web pages on the course site (i.e. with prefix http://www.radford.edu/itec380/2020spring-ibarland/), as well as D2L and standard racket / Java documentation pages.
  • You will submit a .rkt file with runnable, well-written code, and any non-code answers in comments. You may use DrRacket or other editors/IDEs.

  The following practice-exam covers most of the topics we've covered:
  

  • language families
  • vocabulary terms & concepts
    (e.g. "parameter" vs. "argument" vs. "local variable"; "statically typed" vs. …, "compiled" vs. "interpreted")
  • The design recipe (incl. union types and product(compound) types), following recipe in racket.
    You will not need to write Java code following the design recipe (though we have recently how to do that directly, in Java).

    Note: In the flip-quiz for AncTrees, too many people didn't follow the template; they didn't pull out the ma and pa fields and then include the natural-recursive call.

  • scope (binding occurrence vs. a bound occurrence)
  • Higher-order functions: passing a function as an argument (either named, or as an anonymous lambda/λ expression); for functions which receive a function as an input, how to write the overall signature, as well as (of course) how to use that input.
  • Pros and cons of a functional approach
  • tail-recursion
  • grammars: derivations, trees, creating rules (incl. rules for lists-of-something), "ambiguous"

  Here is exam01-practice (w/ soln). Note that it does not necessarily cover all of the above topics.
  I suggest you sit and take the practice exam directly, writing down all answers (not just thinking about them in your head), before looking at the solution.

  Also, for all the D2L quizzes, be sure you know why you missed any points; ask on discussion-board (anonymously or otherwise) or office hours, if you're not sure. You should easily get 90-100% on all such quizzes, if similar questions were to be re-asked. (The flip-check D2L questions are notably easier than exam questions.)

home—lectures—recipe—exams—hws—D2L—zoom (snow day)