Relations Lab, Day 2

Return to List of Lectures

Previous Lecture

• Misc
  • SOFIs
    • Helpful to me in teaching this (or other) courses in future
    • Access through myGeneseo/KnightWeb
    • End tomorrow!
  • Final
    • Dec. 22 (Tuesday), noon
    • Comprehensive, but emphasizing material since 2nd hour exam (e.g., cell arrays, strings, files)
    • Rules and format similar to hour exams, especially open references
    • Except designed for 2 hours, you have 3
    • Donuts and cider
  • Reactions to textbook?
    • (Thanks for responses to online form)
    • Concise format was easy to read and to find things in
    • Recommend using it again
• Questions?
• Relations Lab
  • Extend grading date to Dec. 22 (same as Mad Libs)
  • Group design of union algorithm
    • Interface (i.e., function header) for algorithm looks like r = rUnion( r1, r2 )
    • Basic idea is to start with r1, then add everything from r2 not already in r1
    • Which refined to this pseudocode:
      

      r = r1
      for i = 1 to size( r2, 1 )
          tuple = true    % Stays true if row i of r2 should be added to result
          for j = 1 to size( r1, 1 )
              if r2(i,:) = r1(j,:)
                 tuple = false
              end
          end
          if tuple
             r = [ r; r2(i,:) ]
          end
      end

    • (Which is, as usual with pseudocode, Matlab-like, but not exactly what you need to write in Matlab)

(No Next Lecture)