Course Search

Search Results

Your search for courses · during 2023-24 · tagged with MATH Discrete Structures · returned 2 results

• CS 252 Algorithms 6 credits

  A course on techniques used in the design and analysis of efficient algorithms. We will cover several major algorithmic design paradigms (greedy algorithms, dynamic programming, divide and conquer, and network flow). Along the way, we will explore the application of these techniques to a variety of domains (natural language processing, economics, computational biology, and data mining, for example). As time permits, we will include supplementary topics like randomized algorithms, advanced data structures, and amortized analysis.

  • Offered: Fall 2023, Winter 2024, Spring 2024
  • Liberal Arts Requirements: Formal or Statistical Reasoning
  • Prerequisites:

    Computer Science 200 or 201 and Computer Science 202 (Mathematics 236 will be accepted in lieu of Computer Science 202)

  • Tags: Math Electives Math Discrete Structures CS major required

  • CS  252.00 Fall 2023

  • Faculty:Layla Oesper 🏫 👤
  • Size:34
  • M, WOlin 149 12:30pm-1:40pm
  • FOlin 149 1:10pm-2:10pm

  • CS  252.00 Winter 2024

  • Faculty:Eric Alexander 🏫 👤
  • Size:28
  • M, WAnderson Hall 329 12:30pm-1:40pm
  • FAnderson Hall 329 1:10pm-2:10pm

  • CS  252.00 Spring 2024

  • Faculty:Layla Oesper 🏫 👤
  • Size:28
  • M, WCMC 210 11:10am-12:20pm
  • FCMC 210 12:00pm-1:00pm

  • CS  252.02 Spring 2024

  • Faculty:Jeff Ondich 🏫 👤
  • Size:28
  • M, WLanguage & Dining Center 104 9:50am-11:00am
  • FLanguage & Dining Center 104 9:40am-10:40am

• CS 254 Computability and Complexity 6 credits

  An introduction to the theory of computation. What problems can and cannot be solved efficiently by computers? What problems cannot be solved by computers, period? Topics include formal models of computation, including finite-state automata, pushdown automata, and Turing machines; formal languages, including regular expressions and context-free grammars; computability and uncomputability; and computational complexity, particularly NP-completeness.

  • Offered: Winter 2024, Spring 2024
  • Liberal Arts Requirements: Formal or Statistical Reasoning
  • Prerequisites:

    Computer Science 200 or 201 and Computer Science 202 (Mathematics 236 will be accepted in lieu of Computer Science 202)

  • Tags: CGSC Elective Linguistics Pertinent Course NEUR Elective Linguistics Related Field Math Electives Math Discrete Structures CS major required

  • CS  254.00 Winter 2024

  • Faculty:Anna Rafferty 🏫 👤
  • Size:34
  • M, WLeighton 305 9:50am-11:00am
  • FLeighton 305 9:40am-10:40am

  • CS  254.00 Spring 2024

  • Faculty:Josh Davis 🏫 👤
  • Size:34
  • M, WLeighton 305 1:50pm-3:00pm
  • FLeighton 305 2:20pm-3:20pm