Current instructor
Original student reviews · all captured dates
Marc is just not a very good lecturer, and I sometimes thinks he actively hates teaching. He clearly likes the material, but I would not use him as a resource to ask questions. Grading is overall very generous if you actually complete the bonus points, just takes some time.Rate My Professors ↗
Not bad, just spend a well amount of time to obsorbRate My Professors ↗
This will be an extremely difficult class, no matter who teaches it. Marc does a decent job with the material; I think people are upset they have to actually think critically and not ChatGPT everything. The Star Wars theme is a nice touch, and if you do the work and pay attention, passing is guaranteed, and an A is well within reach.Rate My Professors ↗
An absolute piece of (fill in the blanks). Doesn't explain what he teaches and instead if someone asks for clarification, he would start denigrating them for asking "basic and obvious" questions. A bit suprising why the university still lets him teach this course given that it's a compulsory course for a lot of students.Rate My Professors ↗
Unlike most I actually enjoyed Marc's lectures and I feel like I learned a lot in this class. However I hate the way the class is organized. The final is so hard, every question is unnecessarily confusing, and they're not similar to the practice questions. It just measures your ability to write down random stuff and pray for partial credit.Rate My Professors ↗
People here blurr the lines between content and professor. Yes, Marc's lecture style is a bit bland and is pretty poor for people not strong in math. But the subject itself is notoriously difficult, heck you briefly talk about unsolved CS problems who said this would be easy? I flunked the final but everyone passes the class in the endRate My Professors ↗
Personal experiences, not a representative survey. Profile matching and captured coverage are shown in the source details.
This course covers core algorithm-design paradigms and computational intractability.
Offering recorded · Spring 2027 · Sources
Past student reviews · Marc Renault
Marc Renault taught a difficult course where students reported lectures were rushed, poorly explained, or disconnected from homework, while others noted clear expectations and generous grading for bonus points. Opinions on his demeanor varied sharply, with some finding him kind and reachable, while others described him as rude, unhelpful, or dismissive of student questions.
historical GPA · grades
Fall 2022–Spring 2026Individual study for seniors completing theses for honors in the Computer Sciences major, continuing COMP SCI 681.
Offering recorded · Spring 2027 · Sources
No recorded grade history
Distinct courses recorded per term
Explore courses taught by this instructor →| Term | Course | Title |
|---|---|---|
| Spring 2027 | COMPSCI 577 | Introduction to Algorithms |
| Spring 2027 | COMPSCI 682 | Senior Honors Thesis |
| Fall 2026 | COMPSCI 298 | Directed Study in Computer Science |
| Fall 2026 | COMPSCI 577 | Introduction to Algorithms |
| Fall 2026 | COMPSCI 681 | Senior Honors Thesis |
Teaching history may be incomplete. Course pages contain course-specific feedback and citations.
{
"instructor_uid": "instructor_5b07ff954db288ff1052dd87",
"source": "enrollment",
"source_instructor_id": "mrenault",
"identity_basis": "netid",
"identity_status": "source_identified",
"name": "Marc Renault",
"email": "MRENAULT@WISC.EDU",
"first_observed_at": "2026-09-07 15:55:43.033547+00:00",
"last_observed_at": "2026-10-14 17:50:09.728220+00:00",
"ratings": {
"review_count": 168,
"quality": 2.33,
"difficulty": 4.2,
"quality_count": 168,
"difficulty_count": 168,
"profile_id": "rmp:2316450",
"source_url": "https://www.ratemyprofessors.com/professor/2316450",
"match_basis": "exact_name",
"observed_at": "2026-10-14 18:55:59.896038+00:00",
"courses": {
"course_de12e29109d0c90ee086fcec": {
"review_count": 124,
"quality": 1.77,
"difficulty": 4.5,
"quality_count": 124,
"difficulty_count": 124
},
"course_9a1a7bf1933981bcbaca47ac": {
"review_count": 6,
"quality": 2.33,
"difficulty": 3.67,
"quality_count": 6,
"difficulty_count": 6
},
"course_9b1d5f832c492d1c4a3ce19c": {
"review_count": 35,
"quality": 4.09,
"difficulty": 3.23,
"quality_count": 35,
"difficulty_count": 35
},
"course_37a551eb9007bebe6a41c6b3": {
"review_count": 2,
"quality": 5,
"difficulty": 4,
"quality_count": 2,
"difficulty_count": 2
}
},
"bayesian_quality": 2.4714035723932413,
"prior_mean": 3.65919358049647,
"prior_weight": 20
},
"current": true,
"courses": [
{
"course_uid": "course_cf2713cdfa735f076079251d",
"course_id": "COMPSCI 682",
"title": "SENIOR HONORS THESIS",
"credits_min": 3,
"credits_max": 3,
"gpa": 4
},
{
"course_uid": "course_de12e29109d0c90ee086fcec",
"course_id": "COMPSCI 577",
"title": "INTRODUCTION TO ALGORITHMS",
"credits_min": 4,
"credits_max": 4,
"gpa": 3.04
}
],
"revision": "fc1811fa52e581ea57a35c0cf3343f8740a8ffbf",
"instructor_url": "/instructors/MARC_RENAULT"
}