Jeremy Bolton, PhD Assistant Teaching Professor

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

CTP Prep – On-Line Course Introduction to Course Essentials of Treasury Management D.J. Masson, Ph.D., CTP, Cert-ICM The Treasury Academy Fall 2012 © 2012.
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:
COMP171 Data Structures and Algorithms Spring 2009.
CS 581: Introduction to the Theory of Computation Lecture 1 James Hook Portland State University
COMP171 Data Structures and Algorithms Spring 2009.
Welcome to MAT 170. Basic Course Information Instructor Office Office Hours Beth Jones PSA 725 Wednesday and Friday 10:40 am – 11:30 am and by appointment.
Welcome to MAT 170. Basic Course Information Instructor Office Office Hours Beth Jones PSA 725 Tuesday and Thursday 8 am – 8:30 am Tuesday and Thursday.
COMP171 Data Structures and Algorithm Huamin Qu Lecture 1 (Sept. 1, 2005)
COMP171 Data Structures and Algorithm Qiang Yang Lecture 1 ( Fall 2006)
CS 103 Discrete Structures Lecture 01 Introduction to the Course
Introduction to Discrete Mathematics J. H. Wang Sep. 14, 2010.
WELCOME TO 1 st Period HONORS PRECALCULUS Barb Dobbert.
CSC Discrete Mathematical Structures Dr. Karl Ricanek Jr.
Welcome to CSCI 230/B279 Computing I Spring 2004 Dale Roberts, Lecturer Department of Computer and Information Science IUPUI.
Discrete Mathematics CS204 Spring CS204 Discrete Mathematics Instructor: Professor Chin-Wan Chung (Office: Rm 3406, Tel:3537) 1.Lecture 1)Time:
Introduction COMP283 – Discrete Structures. JOOHWI LEE Dr. Lee or Mr. Lee ABD Student working with Dr. Styner
Expectations What Do YOU Expect To Learn What Do YOU Expect To Learn  How to Compute  How to Solve Equations  How to Solve (textbook) Problems  More.
CIS 842: Specification and Verification of Reactive Systems Lecture ADM: Course Administration Copyright , Matt Dwyer, John Hatcliff, Robby. The.
1 BUS 3500 MANAGEMENT INFORMATION SYSTEMS Abdou Illia, Ph.D. (Monday 8/24/2015)
1 CS 381 Introduction to Discrete Structures Lecture #1 Syllabus Week 1.
1 CSC 281 Discrete Mathematics for Computer Science Dr.Yuan Tian Syllabus.
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.
CSE Wireless and Adhoc networks Instructor: Ayman Alharbi Computer Engineering Dept. (Head of dept. ) Why ?
Course Overview Stephen M. Thebaut, Ph.D. University of Florida Software Engineering.
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.
Math 1010 Lecture 1, 8/24/2016 Alexander Reznikov.
1 COMP2121 Discrete Mathematics Introduction Hubert Chan [O1 Abstract Concepts] [O2 Proof Techniques] [O3 Basic Analysis Techniques]
Welcome to CHEM-141! Welcome!
Computer Network Fundamentals CNT4007C
Computer Engineering Department Islamic University of Gaza
Agenda What is ALEKS? 1 Getting Started 2 Learning in ALEKS 3
Principles of Algebra 6th grade math
COMP 283 Discrete Structures
Software Process ICS 225 Spring 2002
WELCOME (Back) …TO THE CAMPUS OF TOMORROW.
Computer Networks CNT5106C
MyStatLab Student help/instructions MTH/233
Jeremy Bolton, PhD Assistant Teaching Professor
Welcome to the a Department of Engineering Education !
Expectations What Do YOU Expect To Learn How to Compute
CS5040: Data Structures and Algorithms
EE 312 Course Introduction
Kelly Pratt-Booth World History Teacher Rank II
Discrete Mathematics for Computer Science
Using MyMathLab Features
COSC051: Computer Science I
CS410: Text Information Systems (Spring 2018)
CPSC 441: Computer Communications
CS 201 – Data Structures and Discrete Mathematics I
CS 201 – Data Structures and Discrete Mathematics I
Course Overview Juan Carlos Niebles and Ranjay Krishna
Computer Networks CNT5106C
MathXL® Student Overview QRB/501
Hybrid Course Overview & Requirements
Northern Michigan University MA161
Using MyMathLab Features
COMS 161 Introduction to Computing
Physics 215–Elementary Modern Physics
PHYS 202 Intro Physics II Catalog description: A continuation of PHYS 201 covering the topics of electricity and magnetism, light, and modern physics.
Welcome to MAT 142.
MyMathLab® Student Overview QRB/501
COMS 261 Computer Science I
CS 3950 Introduction to Computer Science Research
MyStatLab Student Overview QNT/561
Administrative Issues
Class administration 10/11/05.
Make a Plan for Success for School
Presentation transcript:

Jeremy Bolton, PhD Assistant Teaching Professor COSC030: Math Methods Jeremy Bolton, PhD Assistant Teaching Professor

Outline Welcome! Course Overview Course Expectations Grading Assignments Ethics Goals

Welcome! COSC-030 – Math Methods Instructor: Jeremy Bolton, Ph.D.   Instructor: Jeremy Bolton, Ph.D. Assistant Teaching Professor Department of Computer Science Email: jeremy.bolton@georgetown.edu Office Hours: Daily hours will be entered on Course calendar (or by appointment) TAs: TBD (see Course calendar for office hours)

Course Summary This course, designed to be taken concurrently with COSC-052, covers mathematical tools and principles that are valuable to the computer scientist. Topics include: propositional and predicate logic; mathematical proofs, including induction; counting and basic probability theory; logarithmic and exponential functions; elementary graph theory; and "Big-O" notation and asymptotics. This course prepares computer science majors and minors for subsequent course requirements. COSC 030 is a demanding course and will require a notable amount of time. Expect to spend 10-14 hours each week, or more, studying and solving problems.

Course Website http://jeremybolton.georgetown.domains/courses/mm/

Goals Provide fundamental mathematical concepts necessary for a CS track Each concept / topic will be extended in your upcoming courses Prepare you for overall expectations moving forward in a CS track

Course Structure The class will be run using an inverted (or flipped) format. The lectures are recorded and the students are expected to watch the recorded lectures before attending class. The time in class will be dedicated to solving problems relying on the concepts from lecture. Suggested weekly schedule (recipe for success): Complete assigned readings from text (1 – 2 hours) Watch corresponding lecture(s) (2 - 3 hours) Attempt/Complete Practice Problems (2 - 3 hours) Attend Class (2 - 3 hours) Attempt/Complete Assignments (2 - 3 hours)

1. Complete assigned readings from text READ (the words). Rosen does a good job explaining concepts. Try Hammack to supplement. Step through the many examples. Do not focus on memorizing Equations. Take notes and/or write down questions (to be answered in class or office hours).

2. Watch corresponding lecture(s) Watch the pre-recorded lectures Links found on course website. Take your own notes. Write down questions (to be answered in lecture or office hours.)

3. Attempt/Complete Practice Problems Suggested practice problems are listed on the course website. I suggest about 10 per Rosen Section. I encourage you to practice in groups; HOWEVER, you should also practice alone.

4. Attend Class Example day in class Come with questions Take Notes Quick Review of topics (~ 10 min) Q+A (~ 10 min) Examples / Group Exercises (~ 40 min) Challenge Problems (~ 15 min) Come with questions Take Notes

5. Attempt/Complete Assignments I encourage you to do this last. Treat the Assignments as exams and attempt to complete them without the use of notes / text. This will mimic an exam scenario – are you prepared?! help to identify any deficiencies in understanding – review the corresponding concepts Digitize and submit via Canvas

Test your Understanding Do you understand? Can you have an intelligent conversation about the topic? Can you explain the topic to a friend? Can you design your own practice problems and answer them? Can you prove that an answer is correct?

Study Methods Things TO DO Things NOT TO DO Study throughout the term (Do not “cram”). Follow the recipe! Test your understanding! Put in the time (You get out what you put in) Things NOT TO DO Do not “memorize” equations (instead “understand” concepts) Do not “study for exams” Do not undermine your own education

Grading and the “Curve” Due to the challenging nature of the course, the grading scale is unconventional. Essentially a “pre-curve” has been set You are in “competitive collaboration” General Observations

Extra Credit Challenge Questions 5 extra credit (final grade) points are up for grabs! These points will be split between the AM and PM classes In some classes challenge questions will be presented Extra correct answers will be recorded and the extra credit points will be split between the AM and PM classes proportionally based on number of correctly answered questions.

Questions Up next: tour of course website and review of syllabus.