Note: by course policy, there are no alternate or make-up exams (other than for OAE or student athletics).
Stats:
AVERAGE | 59/80 | 74% |
---|---|---|
MEDIAN | 61/80 | 76% |
STDEV | 12 |
If you have questions about exactly what you missed and why, please first look over your exam answers and grading on GradeScope. The instructor, head TA, and Section Leaders don't have your exam and aren't able to answer detailed questions by email about what points you lost and why.
The system for final exam regrades is the same as on the midterm. (see regrade policy below). Final exam regrade requests must be received no later than 7 days after scores are published.
Also note: Final exam regrades will be handled only after course grades are submitted to Axess. If your course grade changes due to an exam regrade, we will file a grade change request to update your course grade.
Same as on the midterm exam (see rules below).
If you like to practice using CodeStepByStep, here are links to the coding/writing problems from this practice exam that are available on CSBS:
If you like to practice using CodeStepByStep, here are links to the coding/writing problems from this practice exam that are available on CSBS:
If you like to practice using CodeStepByStep, here are links to the coding/writing problems from this practice exam that are available on CSBS:
The actual exam will have 9-10 total problems. Some problems will ask you to read code (review a piece of existing code to analyze its behavior or show its output); others will ask to you write code (implement a function, class, or entire program that solves a specified task). Here are the topics covered this quarter and how we might assess content from this area. Material from the entire quarter is "fair game" , but you can expect that those topics that figured most prominently in lecture/section/homework will be assessed at greatest intensity/weight, and more minor excursions will have correspondingly lighter attention.
ListNode
objects, either singly or doubly-linked
TreeNode
objects, construct an encoding tree and use to encode/decode data
TreeSet
or ArrayList
, discuss implementation tradeoffs in terms of design, Big-Oh efficiency, code complexity
GWindow
class
=
operator, copy constructors, and deep copying
ArrayList<T>
If you want to test out your solutions in CodeStepByStep, here are direct links to each problem:
Note: If you are an SCPD student who took the exam remotely with a proctor, you may have received a different midterm exam that does not exactly match the one on this page. But you were graded according to the exam you were given.
* Stats below are curved scores, and they do reflect our curve as explained below.
curved pts | curved % | raw pts | raw % | |
---|---|---|---|---|
MEDIAN | 49.0 | 79.0% | 43.0 | 69.3% |
MEAN | 47.0 | 75.8% | 41.1 | 66.4% |
MAX | 62 | 100.0% | 61 | 98.3% |
STDEV | 10.8 | 17.4% | 10.9 | 17.7% |
Curve?: +6 points. Because the exam yielded scores that were lower than our targets, we have decided to add points to each student's exam score. The score shown on GradeScope is your raw score, so add this curve to it to see your curved score. Curved scores are capped at a max of 62/62 (100%).
Low Grades: Another topic some students ask about is: If their score was lower than they hoped, how much effect will that have on their grade, or what are their options, etc.? Most of the information to answer this can be found on this web site. The course info sheet lists the relative grading weight of homework vs. midterm vs. final exam, so you can use that to compute the rough effect on your grade of a particular midterm score. Also look at our FAQ page for info about pass/fail grading options, drop dates, and other information.
Picking up your exam: We do not return the paper exams, but you can see the digital scan of your exam in the GradeScope system once exam scores are published. You should log in (or create account as needed) using your Stanford email account. You should already be added to the course on Gradescope.
We work hard to grade consistently and correctly, but sometimes we make mistakes in grading. If you believe that the rubric was incorrectly applied to your answer, the procedure for regrades is the following:
If your complaint is about the correctness of your solution to a programming question, you must type up your code and run it in QT Creator or in CodeStepByStep (if problems are available in CSBS). You may fix any trivial syntax problems, but do not make any algorithmic changes to your code. Run it for yourself and see how nearly correct your solution is.
If after running the code files you still think your grade is incorrect, fill out this form. We will not accept any exam for a regrade unless the form is filled out in entirety, and we will not re-evaluate grading of the correctess of any programming questions without a typed copy of your solution being shown to us first.
Also note: When you submit an exam for a regrade, we will regrade your entire exam. If we notice anywhere that you were mistakenly given too many points, we will also correct this. So it is possible (though less likely) that a regrade request will result in you receiving a lower mark than what you started with.
All midterm regrade requests must be submitted to the instructor no later than Week8 Mon, at 5pm.
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. You can test your answer by typing it into Qt Creator or CodeStepByStep.
If you want to work on this practice exam's problems in CodeStepByStep, here are direct links to each problem:
If you want to work on this practice exam's problems in CodeStepByStep, here are direct links to each problem:
If you want to work on this practice exam's problems in CodeStepByStep, here are direct links to each problem:
#include
statements in your exam code.
The actual midterm exam will have roughly 7-8 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 function or short program that solves a problem about that topic).
Vector
, Grid
, Stack
, Queue
, Set
, Map
, or Lexicon
; understanding tradeoffs between various data structures
The following topics are guaranteed NOT to be required to solve any problem on the midterm:
iomanip
library (e.g. setw
, setprecision
)
HashSet
, HashMap
, and other ADTs we did not explicitly cover in lecture or use on homework
GWindow
class or any other code related to graphical user interfaces (GUIs)
Foo<T>
Week1 Sun 9:00 AM Week4 Tue 9:00 AM No other exam information has been posted yet. There will be an announcement on the main course web page when exam information is posted.
You are expected to follow the Stanford Honor Code.
If this is an assignment that allows pairs, the same rules apply to each team. For example, do not look at assignment solutions that do not belong to your team, and do not give your solution to anyone outside of your team.
Remember that we run similarity-detection software over all solutions, including this quarter and past quarters, as well as any solutions we find on the web.
If you need help solving an assignment, we are happy to help you. You can go to the LaIR, or the course message forum, or email your section leader, or visit the instructor / head TA during office hours. You can do it!
See Course Information handout for full Honor Code policies, or email us if you have any questions.