Discrete Mathematics for Computer Science

Slides:



Advertisements
Similar presentations
Computer Science 20 Discrete Mathematics for Computer Science All the Math you need for your Computer Science courses that you won’t learn in your Math.
Advertisements

5/19/2015CS 2011 CS 201 – Data Structures and Discrete Mathematics I Syllabus Spring 2014.
Introduction to CS170. CS170 has multiple sections Each section has its own class websites URLs for different sections: Section 000:
CS 581: Introduction to the Theory of Computation Lecture 1 James Hook Portland State University
Welcome to MAT 142. Basic Course Information Instructor Office Office Hours Beth Jones PSA 725 Tuesday 10:30 am – 12 noon Thursday 10:30 am – 12 noon.
About the Course Lecture 0: Sep 2 AB C. Plan  Course Information and Arrangement  Course Requirement  Topics and objectives of this course.
CSE 221: Probabilistic Analysis of Computer Systems Topics covered: Course outline and schedule Introduction Event Algebra (Sec )
CS101- Lecture 11 CS101 Fall 2004 Course Introduction Professor Douglas Moody –Monday – 12:00-1:40 – – –Web Site: websupport1.citytech.cuny.edu.
Welcome to MAT 142. Basic Course Information Instructor Office Office Hours Beth Jones PSA 725 Tuesday 10:30 am – 12 noon Thursday 10:30 am – 12 noon.
Overview Discrete Mathematics and Its Applications Baojian Hua
Welcome to MAT 142. Basic Course Information Instructor Office Office Hours Beth Jones PSA 725 Tuesday 10 am – 10:45 am Wednesday 8:15 am – 9:15 am Thursday.
Administrative Issues ICS 151 Fall 2007 Instructor: Eli Bozorgzadeh.
Overview Discrete Mathematics and Its Applications Baojian Hua
Discrete Structures for Computer Science Ruoming Jin MW 5:30 – 6:45pm Fall 2009 rm MSB115.
MATH 330: Ordinary Differential Equations Fall 2014.
CS 581: Introduction to the Theory of Computation Lecture 1 James Hook Portland State University
Nsm.uh.edu Math Courses Available After College Algebra.
MTH213 Experimental Mathematics Introduction. Goals of the Course Introduction to high level programming language (Python) and extensive math libraries.
Math 125 Statistics. About me  Nedjla Ougouag, PhD  Office: Room 702H  Ph: (312)   Homepage:
General information CSE : Probabilistic Analysis of Computer Systems
CS 103 Discrete Structures Lecture 01 Introduction to the Course
Syllabus and Class Policies MATH 130: Summer 2014.
Course Introduction Software Engineering
Introduction to Discrete Mathematics J. H. Wang Sep. 14, 2010.
Administrative Issues ICS 151 Winter 2010 Instructor: Eli Bozorgzadeh.
CSC Discrete Mathematical Structures Dr. Karl Ricanek Jr.
Introduction to Databases Computer Science 557 September 2007 Instructor: Joe Bockhorst University of Wisconsin - Milwaukee.
MTH 201 Discrete Mathematics Fall Term MTH 201 Discrete Mathematics Fall Term INTERNATIONAL BURCH UNIVERSITY DEPARTMENT of INFORMATION.
Discrete Mathematics CS204 Spring CS204 Discrete Mathematics Instructor: Professor Chin-Wan Chung (Office: Rm 3406, Tel:3537) 1.Lecture 1)Time:
Welcome to CMPSC 360!. Today Introductions Student Information Sheets, Autobiography What is Discrete Math? Syllabus Highlights
Online Problem Solving Using COPS Amin Jazaeri, PhD. COS Math & Science Accelerator/School of Physics, Astronomy and Computational Sciences Spring 2013.
Introduction COMP283 – Discrete Structures. JOOHWI LEE Dr. Lee or Mr. Lee ABD Student working with Dr. Styner
ECES-490 Course Policy Stewart D. Personick (SDP) S490_TN/
1 CSC 281 Discrete Mathematics for Computer Science Dr.Yuan Tian Syllabus.
Computer Networks CNT5106C
CS 225 Discrete Structures in Computer Science Winter, 2014: 157 Spring, 2014: 151 Summer, 2014: Two sections 97 and 53.
1.  This course covers the mathematical foundations of computer science and engineering. It provides an introduction to elementary concepts in mathematics.
CIT 592 Discrete Math Lecture 1. By way of introduction … Arvind Bhusnurmath There are no bonus points for pronouncing my last name correctly Please call.
ICS 151 Digital Logic Design Spring 2004 Administrative Issues.
Computer Science 20 Discrete Mathematics for Computer Science 1 All the Math you need for your Computer Science courses that you won’t learn in your Math.
Formal Languages and Automata Theory
Team-based Teaching of
Probabilistic Analysis of Computer Systems
Course Overview CS 4501 / 6501 Software Testing
ICS 6D Discrete Mathematics for Computer Science Fall 2014
MATH/COMP 340: Numerical Analysis I
Course Introduction 공학대학원 데이타베이스
COMP 283 Discrete Structures
Welcome to CMSC 203 – Discrete Structures Spring 2003
CSE 20 Survey CK Cheng UC San Diego
Nonlinear Finite Element Methods
US 130 Principles of Urban Sustainability
CSC 361 Artificial Intelligence
CS 201 – Data Structures and Discrete Mathematics I
CS 201 – Data Structures and Discrete Mathematics I
Chapter 0 The Course Plan.
Chapter 0 The Course Plan.
INTRODUCTION TO INFORMATION SYSTEMS AND TECHNOLOGY (NET 201)
Jeremy Bolton, PhD Assistant Teaching Professor
CSE1311 Introductory Programming for Engineers & Scientists
CS 281: Discrete Mathematics for Computer Science
Welcome to MAT 142.
26 July 2011 SC 611 Class 1.
Administrative Issues
Welcome to Physics 1D03 !.
Administrative Issues
Computer Networks CNT5106C
Administrative Issues
Syllabus and Class Policies
Introduction Lecture 1 Wed, Jan 17, 2007.
Presentation transcript:

Discrete Mathematics for Computer Science All the Math you need for your Computer Science courses that you won’t learn in your Math Courses 1/27/14 CS20/CSCI E-20 w/thanks to Al Meyer Harvard CS20/CSCI E-20, with thanks to Albert R. Meyer

Some Topics Formal logic (p∨q) ∧¬(p∧q) Graphs and digraphs Probability Counting Number theory p ≡ qr (mod m) … see the “placement test” on the web site a f c d b 1/27/14 CS20/CSCI E-20 w/thanks to Al Meyer

Skills!!! How to do proofs How to read and write mathematics By contradiction By induction … How to read and write mathematics And typeset! How to collaborate How to present clearly and persuasively 1/27/14 CS20/CSCI E-20 w/thanks to Al Meyer

3 Principles of Course Philosophy Learning, not competing Absolute grading standards – no “curve” Class will post solutions to exam questions! Learn by doing, not by listening Consume the course material in many small bites 1/27/14 CS20/CSCI E-20 w/thanks to Al Meyer

Typical Class Day Before each class: In class Weekly So class week = Reading and check-in problems (30-60 mins) Watch mini-lecture (~20 minutes) In class Executive Summary (10 minutes) Sample problem (5 minutes) Collaborative problem solving in groups of 4 (35 mins) Weekly Homework (3-5 hours) Write up and post one problem solution So class week = 3 hours class time ~8 hours out-of-class time Most readings from MIT course notes 1/27/14 CS20/CSCI E-20 w/thanks to Al Meyer

Requirements Attendance is mandatory! 50-minute midterm exam (21 Feb) See “Course policies” for details Official/emergency absences ⇒ email cs20@seas.harvard.edu Class begins at 10:10 sharp Homework boxes removed at 10:30, no late submissions 50-minute midterm exam (21 Feb) 3-hour final during exam period 1/27/14 CS20/CSCI E-20 w/thanks to Al Meyer

Grading Mix Homework 40% Midterm 15% Final exam 30% Check-in questions 10% Write up in-class problems 5% (Poor attendance: Exclusion or failure) 1/27/14 CS20/CSCI E-20 w/thanks to Al Meyer

And now – the course in action! 1/27/14 CS20/CSCI E-20 w/thanks to Al Meyer