Exam 1 Week 3

Topics

• All lecture material through September 1.
• Content of lab_intro.
• Mathemaical foundations
  • Be able to give a solution to a recurence relation.
  • Be able to indicate the running time of common sorting and searching algorithms: examples
    • binary search
    • merge sort
• C++ Memory
  • Given some C++ code, show where in memory each variable is allocated (e.g., in a table representing the stack and the heap). You will see different combinations of
    • Regular variables
    • pointers
    • dereferences
    • function calls
  • Be able to spot programming errors, such as
    • uninitialized variables
    • dangling pointer dereferences (e.g., returning the address of a local variable)
  • You will NOT have to write any code! We’re saving that for examlet 2.