What is an Algorithms Course?

Luu, Michael; Ferland, Matthew; Rao, Varun Nagaraj; Arora, Arushi; Huynh, Randy; Reiber, Frederick; Wong-Ma, Jennifer; Shindler, Michael

doi:10.1145/3545945.3569820

Search citation statements

Order By: Relevance

Paper Sections

Select...

Course Description1

Example Guided Problem Set1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2024

Publication Types

Select...

Other2

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(2 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the taxonomy developed by Luu et al, 14 CS 374 covers algorithm strategies (greedy, divide-and-conquer, backtracking, transform and conquer (reductions), dynamic programming), some fundamental algorithms (graph traversal and shortest paths), basic algorithm analysis (mostly as review), basic automata and complexity theory (finite-state machines, regular languages, and NP-completeness), and some more advanced algorithms (graphs). Almost all graded work consists of open-ended algorithm design and proof questions, in weekly written homework assignments and exams; there is no graded programming component.…”

Section: Course Descriptionmentioning

confidence: 99%

See 1 more Smart Citation

Auto-graded Scaffolding Exercises For Theoretical Computer Science

Erickson,

Xia,

Robson

et al.

2023 ASEE Annual Conference &Amp; Exposition Proceedings

View full text Add to dashboard Cite

show abstract

Section: Course Descriptionmentioning

confidence: 99%

“…Dynamic programming is a core technique in algorithm design; it is also widely recognized as one of the most challenging topics in any algorithms course. 9,14,23,29 Developing a dynamic programming algorithm typically involves three distinct stages:…”

Section: Example Guided Problem Setmentioning

confidence: 99%