CSE 21
Mathematics for Algorithms and Systems Analysis
(Foundations of Computer Science)
Spring 2013
Lectures:
Mondays / Wednesdays / Fridays: 8:00 - 8:50am
Price Center Theatre
Discussion Sections:
Wednesdays: 12:00-12:50pm -- Center Hall 109
Fridays: 2:00-2:50pm -- HSS 1330
Instructor:
Rick Ord
-- EBU3B 2102
Office Hours: Fridays 9-11am in my office, open office policy, or by appt
rord@ucsd.edu
TAs/Tutors:
CSE B275 for homework help and B230 for programming help
TA: Allyson Cauble-Chantrenne accauble@eng.ucsd.edu
Head Tutor: Yelly Bitton arbitton@ucsd.edu
See Office Hours page
Textbook:
David Hunter,
Essentials of Discrete Mathematics
, 2nd Edition, Jones and Bartlett, 2012.
Chapter 3 - Recursive Thinking
Recurrence Relations
Closed-Form Solutions and Induction
Recursive Definitions
Proof by Induction
Recursive Data Structures
Chapter 4 - Quantitative Thinking
Basic Counting Techniques
Selections and Arrangements
Counting with Functions
Discrete Probability
Counting Operations in Algorithms
Estimation
Chapter 5 - Analytical Thinking
Algorithms
Three Common Types of Algorithsm
Algorithm Complexity
Bounds on Complexity
Program Verification
Loop Invariants
Chapter 6 - Thinking Through Applications
Structure of Languages
Grading:
18 Homeworks
10%
5 Quizzes
20%
1 Midterm
30%
1 Final
40%
A-/A/A+
~90-100+%
B-/B/B+
~80-90%
C-/C/C+
~70-80%
D
~60-70%
F
< 60%
Back to
CSE 21 Home Page
[http://cseweb.ucsd.edu/~ricko/CSE21/]