Course Search

Search Results

Your search for courses · during 25SP · taught by ealexander · returned 2 results

• CS 202 Mathematics of Computer Science 6 credits

  This course introduces some of the formal tools of computer science, using a variety of applications as a vehicle. You’ll learn how to encode data so that when you scratch the back of a DVD, it still plays just fine; how to distribute “shares” of your floor’s PIN so that any five of you can withdraw money from the floor bank account (but no four of you can); how to play chess; and more. Topics that we’ll explore along the way include: logic and proofs, number theory, elementary complexity theory and recurrence relations, basic probability, counting techniques, and graphs.

  • Offered: Spring 2025
  • Liberal Arts Requirements: FSR, Formal or Statistical Reasoning
  • Prerequisites:

    Student has completed any of the following course(s): CS 111 – Introduction to Computer Science with a grade of C- or better or received a score of 4 or better on the AP Computer Science exam AND MATH 101 – Calculus with Problem Solving or MATH 111 – Introduction to Calculus or greater with a grade of C- or better or greater or received a score of 4 or better on the Calculus AB AP exam or received a score of 4 or better on the Calculus BC AP exam or received a score of 5 or better on the Mathematics IB exam or equivalent.

  • Tags: CS Required for Major LING Related Field CL: 200 level

  • CS  202.00 Spring 2025

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

• 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: Spring 2025
  • Liberal Arts Requirements: FSR, Formal or Statistical Reasoning
  • Prerequisites:

    Student has completed any of the following course(s): CS 200 – Data Structures with Problem Solving or CS 201 – Data Structures AND CS 202 – Mathematics of Computer Science or MATH 236 – Mathematical Structures with a grade of C- or better or equivalent. MATH 236 will be accepted in lieu of Computer Science 202.

  • Tags: CS Required for Major MATH Discrete Structures MATH Electives SDSC CS Elective CL: 200 level

  • CS  252.00 Spring 2025

  • Faculty:Eric Alexander 🏫 👤
  • Size:34
  • M, WHulings 316 9:50am-11:00am
  • FHulings 316 9:40am-10:40am