office hours assignments midterm
play

Office Hours Assignments Midterm CPSC 111, Intro to Computation - PowerPoint PPT Presentation

University of British Columbia Office Hours Assignments Midterm CPSC 111, Intro to Computation 2009W2: Jan-Apr 2010 reminder: TA office hours at DLC end Thu Assignment 3 due Fri Apr 16, 5pm deadline for having TAs check corrected


  1. University of British Columbia Office Hours Assignments Midterm CPSC 111, Intro to Computation 2009W2: Jan-Apr 2010 ■ reminder: TA office hours at DLC end Thu ■ Assignment 3 due Fri Apr 16, 5pm ■ deadline for having TAs check corrected afternoon midterms is the Thu lab tomorrow ■ electronic handin only Tamara Munzner ■ labs end this week ■ then solutions released ■ writeup hardcopy handed out mentioned ■ my office hours for rest of term hardcopy, ignore that! (fixed in online version) ■ Vista currently has unscaled, difference mark ■ Monday 4/19 4pm ■ Assignment 2 grading reports should arrive as Assignment 2 Correction Inheritance III, Graphical User Interfaces ■ by appointment through 4/23 by email very soon ■ after it's finalized, we'll add two more columns ■ send me email to book Lecture 35, Wed Apr 14 2010 ■ ugrad account email: check it or forward it to ■ scaled difference ■ not Mon 4/26 your real account ■ scaled combined ■ I'm out of town 4/24-4/27 borrowing from slides by Kurt Eiselt ■ A3 grading report target is Apr 26, so you ■ will check email at least once/day, but not have a few days to look through before final online all the time http://www.cs.ubc.ca/~tmm/courses/111-10 1 2 3 4 Weekly Questions Final Exam Material Covered Reading Summary ■ you'll get full credit if you handed in questions ■ final review session will be Mon Apr 24 ■ midterm 1 ■ http://www.cs.ubc.ca/~tmm/courses/111-10/#reading for 10 (out of the 12 possible) weeks ■ 10am-12pm, room WOOD 4 ■ primitives, constants, strings, classes, objects ■ given by grad TA Primal Wijesekera ■ midterm 2 ■ last one due today ■ final is Wed Apr 28, 3:30-6:30 pm, FSC 1005 ■ all of the above plus/especially: ■ reminder: weeklies all together count for 2% ■ exam will be 2.5 hours ■ conditionals, loops, arrays, sorting of your course grade ■ final ■ 3 hour slot reserved in case of fire alarms, etc ■ closed book/notes/laptops/calculators ■ all of the above plus/especially: ■ interfaces, inheritance ■ material covered ■ more on classes, objects ■ whole course, but significant emphasis on later topics not covered in previous exams ■ scope, static fields/methods, control flow ■ exception: GUIs will not be covered ■ pass by reference vs. pass by value 5 6 7 8 Practice Exams Exam Philosophy How To Prepare Programming Practice ■ One practice final (without solutions) up on ■ my exams tend to be hard and long ■ Read all the required reading ■ Two kinds of practice, both are important! ■ thus, I almost always end up scaling marks WebCT/Vista ■ difficult exams can be scaled ■ Another practice exam available under ■ Review lecture notes and code written in ■ Using computer, open book, Internet, ■ too-easy exams cannot distinguish those who know class Challenge link from course page discussing approach with friends, take as long material from those who don't http://www.ugrad.cs.ubc.ca/~cs111/ ■ available from web as you need to fully understand http://www.cs.ubc.ca/~tmm/courses/111-10/ ■ how to handle exams with deliberate time pressure ■ do not panic if you think you won't finish ■ Closed book, write on paper, don't talk to ■ do be strategic about how to spend your time ■ Practice, practice, practice -- write programs!! anybody about the question, time pressure ■ I recommend you look through entire exam before you ■ especially using inheritance and abstract jump into writing answers classes ■ spend a few minutes up front to plan best approach for your strengths 9 10 11 12 Alternate Book Practice Problem Recap: Inheritance Class Hierarchy Recap: Abstract Classes ■ If you're not getting it and want to try a different ■ Abstract class: not completely implemented The Coca-Cola Company has founded Vending University. VU has two Generic approach, run to the bookstore (or head to kinds of students. The full time students pay $250.00 per credit in tuition ■ serve as place holders in class hierarchy Vending up to a maximum of $3000.00 (12 credits), even if they enroll in more than Amazon.ca or Indigo.ca) and get a copy of... ■ partial description inherited by all descendants Machine 12 credits. Tuition for students in the executive program is computed is-a is-a ■ Usually contains one or more abstract methods is-a is-a differently; these students pay a $3000.00 "executive fee" plus $400.00 per Head First Java by Kathy Sierra and Bert Bates ■ has no definition: specifies method that should be implemented credit, with no ceiling or cap on the total. Each student has a name and is Beer French Fry Coke Pizza by subclasses enrolled for some integer number of credits. Machine Machine Machine Machine ■ just has header, does not provide actual implementation for Read this book, work all the is-a Write an abstract superclass called Student, and write concrete subclasses that method problems (there are zillions), called FullTimeStudent and ExecutiveStudent. The method for computing ■ Abstract class uses abstract methods to specify what ■ Is base class something that you would and you should have a the tuition should be called computeTuition(). Coke interface to descendant classes must look like ever want to instantiate itself? Machine2000 better grasp of what's going ■ without providing implementation details for methods that Now do it again, but with an interface called Student instead of an abstract on with Java. (I have no is-a make up interface superclass. financial interest in this book ■ descendent classes supply additional information so that or any bookseller.) Coke instantiation is meaningful Provide a test program that uses polymorphism to test your classes and MachineUA methods. 13 14 15 16

Recommend


More recommend