CSE 143

Coursework

Getting Help

Check Scores

Other

Exams

Final (due: Thursday, 12/17, 12 noon)

  • Use this link to access the final. Ideally you would print this file and then give yourself 110 minutes to work on solving the questions. If you don't have access to a printer, you can view the file on your computer or phone and write your answers on separate pieces of paper.
  • Use this link to access the key to the final. Obviously you should not look at this until after you have completed the exam. Using this key, put a slash through any incorrect answers to the non-programming questions (questions 1 and 3). You might want to look at the solutions to the programming problems, but you don't have to grade your answers to those questions.
  • Scan your exam and upload the scan (preferably a pdf) using the link for your section:
  • Schedule a time to discuss your exam with your TA.

Final Resources:

Final Content:

The final will have the following structure (although the problems might be reordered to facilitate copying):
Question Points Description
1 Binary Tree Traversal 6
2 Recursive Programming 9
3 Details of Inheritance 10
4 Collections Programming 5
5 Stacks/Queues 10
6 Binary Trees 10
7 Collections Programming 10
8 Comparable Class 10
9 Binary Trees 15
10 Linked Lists 15

Midterm (due: Saturday, 10/31, 11 pm)

  • Use this link to access the midterm. Ideally you would print this file and then give yourself 75 minutes to work on solving the questions. If you don't have access to a printer, you can view the file on your computer or phone and write your answers on separate pieces of paper.
  • Use this link to access the key to the midterm. Obviously you should not look at this until after you have completed the exam. Using this key, put a slash through any incorrect answers to the non-programming questions (questions 1-5). You might want to look at the solutions to the programming problems (questions 6-9), but you don't have to grade your answers to those questions.
  • Scan your exam and upload the scan (preferably a pdf) using the link for your section:
  • Schedule a time to discuss your exam with your TA.

Midterm Resources

Midterm Content

The midterm will cover material from chapters 1 through 7 of the textbook but will not include graphics. You are not allowed to use more advanced material to solve the programming problems. The midterm will have the following structure:
Question Points Description
1 10 expressions
2 12 parameter mystery
3 12 if/else simulation
4 12 while loop simulation
5 15 assertions
6 10 programming
7 10 file processing
8 10 arrays
9 9 programming (probably hard)
total 100