check your scores on blackboard
Scores for graded assignments are available for you to see on blackboard (http://ilearn.ucr.edu).
get your graded homeworks and exams back
Graded hwks and exams will be returned in labs, or you can stop by the instructor's office and pick them up. Each homework and each programming assignment is worth 100 points (this is divided evenly between problems, that is if there are five problems each is worth 20 points, if there are 4 problems each is worth 25 points)
who graded what
- Final2: Neal (2,5), Anna (?), Lan (?), Wojtek (?)
- Final1: Neal (2,6), Anna (?), Lan (?), Wojtek (?)
- Prog6: Wojtek
- Hwk6: Anna (?), Lan (?)
- Prog5: Lan
- Hwk5: Wojtek (1,2,3), Anna (4,5)
- Prog4: Anna
- Hwk4: Wojtek (3,4,5), Lan (1,2)
- Prog3: Wojtek
- Hwk3: Anna (1,2), Lan (3)
- Midterm: Neal (5,6), Anna (2), Lan (4), Wojtek (3)
- Hwk2: Anna (problems 1,2) and Wojtek (3,4)
- Prog2: Lan
- Hwk1: Lan Liu (1,5) and Wojtek Jawor (2,3,4).
- Prog1: Anna Majkowska.
grading scale
grading: homeworks (20%), projects (25%), lab participation (5%), class participation (5%), one midterm (20%), final exam (25%)There will be a total of 6 homeworks and 6 programming assignments, each equally weighted within its category. Your weighted average will be computed as
- 0.20 * (sum of homework scores)/6
- + 0.25 * (sum of prog asst scores)/6
- + 0.20 * (midterm score)
- + 0.25 * (final exam score)
- + 0.05 * (lab participation)
- + 0.05 * (class participation)
Your weighted average will then be used to determine your letter grade as follows:
grading scale (weighted average, grade):
- 0-50 F
- 50-52 D-
- 52-57 D
- 57-60 D+
- 60-63 C-
- 63-67 C
- 67-70 C+
- 70-73 B-
- 73-77 B
- 77-80 B+
- 80-85 A-
- 85-90 A
- 90-100 A+
Roughly, I will try to make the grades correspond to the following skill sets:
- C = Know algorithms and data structures we've studied in class, can simulate them on examples, know worst-case big-O running times, can implement them in C++. Can explain why these algorithms and data structures are correct, and how their run-time analyses go. Know how to run the debugger to catch most run-time errors in programs. Can complete somewhat complicated programming assignments involving templates, classes, etc, provided basic design is provided.
- B = Skills for C (above) and: given a new algorithm or data structure, can analyze running time and show correctness. Can adapt known algorithms to related problems. Comfortable and competent with the concept of "algorithm" independent of program. Comfortable running the debugger and competent at interpreting g++ compiler error messages and tracking down compile-time errors. Can distinguish a sound analysis of an algorithm (a proof) from an unsound one. Able to judge correctness of a proposed line of reasoning regarding correctness or running time of a program or algorithm.
- A = Skills for B and: can design and analyze efficient new algorithms and data structures. Comfortable with all algorithms, data structures, and techniques taught in the course. Able to debug even challenging compile-time and run-time errors in reasonable time. Completely comfortable with concepts underlying worst-case analysis of algorithms and data structures.
distributions of scores
overall grades: 1 A+, 5 A, 8 A-, 4 B+, 5 B, 8 B-, 10 C+, 7 C, 2 C-, 5 D+, 4 D, 11 F, 10 withdraw, 4 failed for cheating
If you're curious to compare your scores to others':
- distribution of total scores on FINAL (out of 72)
- distribution of OVERALL weighted average at end of course
- /Hwk1Dist and /Prog1Dist -- see the distributions of all students' scores on hw1 and prog1
- midterm distributions (all the scores on the midterm, sorted, then plotted left to right. 1 = 100%)
- distribution of total weighted average so far (with 40% of grade determined):
