Rutgers describes the class as a rigorous mathematical framework for language and computation, and student discussion consistently frames it as rewarding but theory-heavy.

The public Rutgers syllabus calls for frequent homework plus one or two midterms and a take-home final, which points to steady term-long effort.

The official syllabus spends large blocks on major theory units, so the course appears steady and dense rather than unusually rushed week to week.

The official course materials emphasize homework and exams; there is no clear signal of build-style projects being central.

One or two midterms plus a take-home final are a major official assessment path, so exam performance still drives a lot of the course outcome.

Both the Rutgers description and the course's dependence on formal languages, computability, complexity, and proofs make the math-theory load unmistakably high.

The subject has vocabulary, but the public evidence points more toward proof reasoning and conceptual transfer than toward memorizing facts in isolation.

Regular languages, automata, decidability, reductions, and complexity theory all sit at a very abstract level compared with implementation-centered electives.

Rutgers requires Algorithms first, and both the prerequisite chain and student comments suggest that proof comfort and discrete-style reasoning matter a lot.

The official syllabus is textbook-backed and homework-driven, so there is a meaningful reading burden even though proof work matters more than sheer page count.