CS35: Grading

Grading breakdown

Percentage	Coursework
35%	Lab assignments
30%	Tests
30%	Final exam
5%	Class participation and Attendance

Tests

Tests will be given at the beginning of lab on the days posted in the schedule. Please arrive at class promptly to ensure that you don't lose time on the test. If you are unable to attend lab for a test, contact your lab instructor as soon as possible to make accommodations.

Tests will be evaluated using standards based grading. The purpose of this grading scheme is to keep all students focused on what matters most, which is learning the course content. Each test will evaluate several standards and if you do not achieve a standard on your first attempt, you will have two additional chances to meet those standards. Our goal is to give you the feedback you need after each attempt to improve your understanding so that you can then achieve the standard.

Tests will be evaluated in GradeScope. Be sure to view your feedback to determine whether you have met the standards being tested.

Test retakes will be offered on the two Mondays following when you took the original test. Retakes will be given in Martin 300 from 12:30-3pm on those Mondays. Drop in whenever you are available within that time frame.

Test Standards

Below are the standards that will be evaluated on each of the three tests during the semester. There are a total of eleven testing standards.

Test 1

1A. Demonstrate an ability to correctly implement C++ code.

1B. Demonstrate an ability to understand and debug C++ code.

1C. Demonstrate an ability to draw a stack diagram of C++ code execution.

1D. Demonstrate an ability to understand and explain object-oriented programming concepts.

Test 2

2A. Demonstrate an ability to prove that a given function has a particular Big-O run time.

2B. Demonstrate an ability to analyze the run time of algorithms and reason about their best and worst cases.

2C. Demonstrate the ability to trace sorting algorithms such as Quick sort and Merge sort.

Test 3

3A. Demonstrate an ability to properly perform proof by induction.

3B. Demonstrate an understanding of how binary search trees function.

3C. Demonstrate an understanding of how balanced trees function.

3D. Demonstrate an understanding of how heaps function.

Your overall test score will be calculated based on the number of standards you achieved. This score will make up 30% of your grade in this course.

Overall test score

Standards achieved	Test score
11	100%
10	91%
9	82%
8	73%
7	64%
6	55%
5	46%