CS 106A: Programming Methodology, Spring 2017

Rules and Information:

Same as on the midterm exam (see rules below).

Syntax Reference Sheet:

• syntax reference sheet (will be given out attached to your exam as a reference; bring your textbook to reference any other Java syntax/libraries)

Practice Exams:

• practice final #1 | key (based on Spring 2014 practice final exam)
  • CodeStepByStep: referenceMystery1, longestSortedSequence, isUnique, transactionFee, inheritanceMystery1, Ostrich, collectionMystery1, isSubMap, SignMaker
• practice final #2 | key (based on Spring 2014 final exam)
  • CodeStepByStep: referenceMystery2, contains, array2dMystery2, wideFlip, advance, inheritanceMystery2, Dragonfly, collectionMystery2, getMajorityLastName, KooshBall
• practice final #3 | key (based on Spring 2015 final exam)
  • CodeStepByStep: referenceMystery3, evenBeforeOdd, array2dMystery3, mirror, advance, inheritanceMystery3, Raptor, collectionMystery3, rarestAge, CircleMaker
• practice final #4 | key (based on Spring 2016 final exam)
  • CodeStepByStep: referenceMystery4, split, array2dMystery4, tile, inheritanceMystery4, Tigger, collectionMystery4, teacher, AcronymMaker
• More practice problems can be found from the links to past quarters below, and in your section handouts, and in the textbook.
• Sample final exam(s) posted here are intended to be similar to the actual final. The number of problems and type of problems on the actual exam will be relatively similar to what is seen on these practice exams, though we do not promise that it will be exactly the same in length or in difficulty.

Practice Exams from Past Quarters:

If you want more practice problems, here are links to some past exams given in 106A by other instructors. They don't exactly match the current exam format, so they may be of limited use. Some of the problems on these tests don't match the topics, difficulty level, and/or type of questions we currently plan to ask. Also note that some of these quarters do not match our exam policies such as whether the test is open or closed-book/notes, etc., so any notes about such policies on these exams do not apply this quarter. These links are provided merely as a convenience to help you study.

• Winter 2017 (Chris Piech): practice final 1 | key | additional practice final problems | key
• Winter 2016 (Eric Roberts): practice final 1 | key | practice final 2 | key
• Winter 2015 (Keith Schwarz): practice "midterm 2" | key
• Winter 2014 (Keith Schwarz): practice final 1 | practice final 2 (no keys available)
• Autumn 2013 (Mehran Sahami): practice final | key | additional review problems
• Spring 2012 (Eric Roberts): practice final 1 | key | practice final 2 | key
• Winter 2012 (Keith Schwarz): practice final 2 (no key available)
• Spring 2011 (Brandon Burr): practice final 1 | key | practice final 2 | key
• Autumn 2010 (Mehran Sahami): final review problems | key
• Winter 2010 (Eric Roberts): practice final 2 | key (practice final 1 is a repeat of others already linked)

Topics to Study:

The actual final exam will have roughly 8-9 total problems. Those problems will be selected from the following categories. For each category, you may be asked to read code (look at a piece of existing code and answer questions about it, such as writing its output), and/or write code (write a piece of code such as a method, class, or short program that solves a problem about that topic).

• value and reference semantics: demonstrate your understanding of objects vs. primitive values by tracing code that passes several objects, primitives, or arrays as parameters
• objects and classes: write a class and/or add behavior to an existing class
• inheritance and polymorphism: look at a confusing piece of code involving inheritance and interpret its output; and/or, write a class that uses inheritance to extend some existing base class
• arrays
• multi-dimensional arrays (possibly from the pixels of a graphical image, possibly not)
• collections: interpret the output of an existing piece of code that uses the collections ArrayList and/or HashMap, and/or write code that uses these collections to solve a problem
• graphical user interfaces (GUIs): write a complete graphical program that uses GUI components and events to produce a given behavior
• Note: Though the final focuses on material taught since the time of the midterm, programming is inherently cumulative in that new topics build upon old ones. So you may be asked to solve problems that involve, though not necessarily focus primarily upon, past topics such as strings, int, double, boolean, random numbers, loops, if/else, parameters, return, expressions, variables, constants, file input with Scanner, and so on.

• The following topics are guaranteed NOT to be required to solve any problem on the final exam:
  • Karel the Robot
  • "real" Java transition without Stanford libraries (taught in Week 10 lecture)
  • designing your own data structure (seen in some of the non-Marty practice final problems from past quarters)
  • searching and sorting algorithms (taught in some past quarters)
  • Java layout managers such as FlowLayout, GridLayout, BorderLayout, etc.
  • graphical shapes not used in lecture/homework, such as GArc, GPolygon
  • converting numbers to/from other bases, such as binary (base-2) or hexadecimal (base-16)
  • do/while loops and the break or continue statements (regular while loops may be needed, though)
  • the switch statement
  • static methods or data (other than static final constants)
  • any Stanford libraries not explicitly taught in class/homework
  • anything else not explicitly covered in lecture / section / homework

Syntax Reference Sheet:

• syntax reference sheet (will be given out attached to your exam as a reference; bring your textbook to reference any other Java syntax/libraries)

Practice Exams:

• practice midterm #1 - 14sp | key | code (Eclipse project for testing your answers)
  • CodeStepByStep: expressions, parameters, loopMystery, InnerBorderKarel, coinFlip, Frogger, removeDuplicates/FromFile, countUnique
• practice midterm #2 - 14sp | key | code
  • CodeStepByStep: expressions, parameters, arrayMystery, TriangleKarel, checkDates, PicturePanel, evenBeforeOdd, dnaErrors
• practice midterm #3 - 14sp | key | code
  • CodeStepByStep: expressions, parameters, loopMystery, HourglassKarel, randomWalk, ShapeStamper, sameDashes, collapsePairs
• practice midterm #4 - 15sp | key | code
  • CodeStepByStep: expressions, parameters, arrayMystery, FillerKarel, startEndLetter, CircleJumper, wordCount, nCopies
• practice midterm #5 - 16sp | key | code
  • CodeStepByStep: expressions, parameters, loopMystery, StackerKarel, playRoulette, GoogleyEyes, isPalindrome/removePalindromes
• slides from exam review session, led by our SL Kate Rydberg (thanks, Kate!)
• More practice problems can be found in the textbook and in your section handouts.
• Sample midterm exam(s) posted here are intended to be very similar to the actual midterm. The number of problems and type of problems on the actual exam will be much like what is seen on these practice exams.

Additional Sample Problems:

If you want more practice problems, here are links to some past exams given in 106A by other instructors. They don't exactly match the current exam format, so they may be of limited use. Some of the problems on these tests don't match the topics, difficulty level, and/or type of questions we currently plan to ask. These links are provided merely as a convenience to help you study.

• Winter 2017 (Chris Piech): midterm | key
• Winter 2016 (Eric Roberts): practice midterm 1 | key | practice midterm 2 | key
• Winter 2015 (Keith Schwarz): practice midterm 1 | key | practice midterm 2 | key
• Winter 2014 (Keith Schwarz): practice midterm 1 | (no key) | practice midterm 2 | (no key)
• Autumn 2013 (Mehran Sahami): practice midterm | key
• Winter 2013 (Keith Schwarz): practice midterm (no key)
• Summer 2012 (Brandon Burr): practice midterm | key
• Spring 2012 (Eric Roberts): practice midterm | key

Rules and Information:

• The exam is to be completed individually and without any assistance from a partner or other students.
• The exam is open-book for the Art & Science of Java and Karel the Robot Learns Java textbooks, or any other relevant textbooks you want to bring. You can bring the current edition of the book, or the previous ring-bound "course reader" edition, but not a digital copy and not a printout of the book on loose paper. There may be a small number of "loaner" books available at the front of the room, but you will have limited access to these at best.
• The exam is closed-notes and closed for all other resources. You may not bring or use any printed materials such as handouts, slides, or practice exams. (A "syntax reference sheet" of necessary syntax will be given to you at the exam.) You may not use any computing devices of any kind including calculators, cell phones, music players, iPad/Kindles, or other electronic devices. Please do not have any of these devices out nor use any of them during the exam.
• Unless a question specifically mentions otherwise, your code you write will be graded purely on functionality (proper behavior and output) and not on style. So, for example, redundancy, bad variable names, bad indentation, or lack of comments will not reduce your score. Some problem describe various constraints that your code must follow to earn full credit. We might deduct points for extremely inelegant or inefficient code that dodges the spirit of the problem.
• You don't need to write any import statements in your exam code.
• Please do not abbreviate any code on the exam. Abbreviated code will be ignored during grading.
• Pseudo-code (writing English sentences and phrases) does not earn any points. For example, writing on the test, "In this part of the code, I want to open the file and read each line and print it," will not earn you any partial credit. Express your solutions as best you can in Java, not English.
• Please be quiet during the exam. If you have a question or need, please quietly exit the room and a nearby SL or TA will assist you.
• Any corrections or clarifications to the exam will be written at the front of the room.
• Please follow the Stanford Honor Code during the exam. Work on the exam alone and submit only your own work. Please also take action to prevent any inappropriate activity conducted by others, such as speaking to the person and asking them to stop, or reporting the activity to the instructor.
• If you wrote an answer on a back page or attached paper, please label this clearly to the grader and put your name on the paper.
• When you have finished the exam, please leave the room quietly and bring your exam to the instructor and SLs, who will be waiting just outside the exam room.

Topics to Study:

The actual midterm exam will have roughly 7-9 total problems. Those problems will test you on the following concepts. For each category, you may be asked to read code (look at a piece of existing code and answer questions about it, such as writing its output), and/or write code (write a piece of code such as a function or short program that solves a problem about that topic).

• Expressions and variables: given some Java expressions with numbers, strings, logic, etc., evaluate them and write the results; and/or, write Java code that uses expressions and operators to solve a problem.
• Java control statements: given a piece of Java code using Java statements like for loops, while loops, if/else, etc., evaluate it and write its output/results; and/or, write Java code that uses Java control statements to solve a problem.
• Karel programming: given a piece of Java code that gives instructions to Karel the robot, evaluate it and write/draw the resulting state of the Karel world; and/or, write a complete Karel program to accomplish a given result in Karel's world.
• Console programs: write Java code to perform console input/output using Stanford's libraries.
• Methods, parameters, returns: given a piece of Java code with several methods and parameters/returns, evaluate it and write its output/results; and/or, write a method of Java code that accepts various parameters and/or returns certain values.
• Randomness: write Java code to generate random behavior using the RandomGenerator class.
• String and char: given a piece of Java code that interacts with text data, evaluate it and write its output/results; and/or, write Java code that processes strings and characters to produce a given result.
• Scanner and file processing: write Java code that uses a Scanner to read data from a file in a given format and produce a particular result.
• Graphics programs: write Java code to implement a graphics program with certain behavior using Stanford's libraries; this may include drawing shapes such as GRect, GOval, etc., animation, and/or handling mouse events.
• Arrays: given a piece of Java code that manipulates an array, evaluate it and write its output/results; and/or, write Java code that manipulates an the elements of an array.

• The following topics are guaranteed NOT to be required to solve any problem on the midterm:
  • graphical shapes not used in lecture/homework, such as GArc, GPolygon
  • converting numbers to/from other bases, such as binary (base-2) or hexadecimal (base-16)
  • the printf method
  • do loops and the continue statement (regular while loops may be needed, though)
  • the switch statement
  • throwing exceptions with the throw statement
  • classes and objects, as described in the "classes and objects" lecture from week 5 (e.g. BankAccount)
  • any Stanford libraries not explicitly taught in class/homework
  • anything else not explicitly covered in lecture or homework
  • any material covered past the end of week 5 of the course (material from weeks 1-5 inclusive will be tested on the exam)

Here is a handout created by a past CS 106 instructor with advice about how to study for, and take, a CS 106A exam.

• Exam Strategies (by Julie Zelenski and Mehran Sahami, with small modifications by Marty Stepp)