241-303 Discrete Maths: Prelim/0 1 Discrete Maths (OLD) Objective – –to give some background on the course 241-303, Semester 1, 2015-2016 Who I am: Andrew.

Slides:



Advertisements
Similar presentations
5/19/2015CS 2011 CS 201 – Data Structures and Discrete Mathematics I Syllabus Spring 2014.
Advertisements

Introduction to CS170. CS170 has multiple sections Each section has its own class websites URLs for different sections: Section 000:
Goran Šuković, University of Montenegro 1/21 Compiler Construction Course at University of Montenegro 7 th Workshop on “Software Engineering Education.
Discrete Maths Objective to give some background on the course , Semester 2, Who I am: Andrew Davison WiG Lab
COMP171 Data Structures and Algorithms Spring 2009.
COMP 110 Introduction to Programming Tabitha Peck M.S. January 9, 2008 MWF 3-3:50 pm Philips 367.
CS/CMPE 535 – Machine Learning Outline. CS Machine Learning (Wi ) - Asim LUMS2 Description A course on the fundamentals of machine.
CS 331 / CMPE 334 – Intro to AI CS 531 / CMPE AI Course Outline.
CSc 160 Overview of Fundamentals of Computer Programming II Spring (SO1) 2004.
COMP171 Data Structures and Algorithm Huamin Qu Lecture 1 (Sept. 1, 2005)
COMP171 Data Structures and Algorithm Qiang Yang Lecture 1 ( Fall 2006)
COMP 110 Introduction to Programming Mr. Joshua Stough August 22, 2007 Monday/Wednesday/Friday 3:00-4:15 Gardner Hall 307.
COMP 14 – 02: Introduction to Programming Andrew Leaver-Fay August 31, 2005 Monday/Wednesday 3-4:15 pm Peabody 217 Friday 3-3:50pm Peabody 217.
Computer Science 102 Data Structures and Algorithms V Fall 2009 Lecture 1: administrative details Professor: Evan Korth New York University 1.
Introduction to C++ Penn State University
Cli/Serv.: Prelim/01 Client/Server Distributed Systems v Lecturer:Dr. Andrew Davison Info. Eng. Research Lab (rm 101)
AGD: 1. Preliminaries1 Objective o to give some background on the course Animation and Games Development , Semester 1, Who we.
Seminar II: Prelims/0 1 Seminar II Objective – –to give some background on the course , Semester 2, Who I am: Andrew Davison WiG.
COMP Introduction to Programming Yi Hong May 13, 2015.
CS 103 Discrete Structures Lecture 01 Introduction to the Course
CPT: Prelim/01 Computer Programming Techniques v Objectives –to give some background on this subject CPT, Semester Preliminaries.
Discrete Maths Objective to introduce mathematical induction through examples , Semester 2, Mathematical Induction 1.
Course Introduction Software Engineering
CST 229 Introduction to Grammars Dr. Sherry Yang Room 213 (503)
Introduction to Discrete Mathematics J. H. Wang Sep. 14, 2010.
Course overview Course title: Discrete mathematics for Computer Science Instructors: Dr. Abdelouahid Derhab Credit.
CSCE 1040 Computer Science 2 First Day. Course Dr. Ryan Garlick Office: Research Park F201 B –Inside the Computer Science department.
OOP (Java): Prelim/ OOP (using Java) Objective – –to give some background on the course Semester 2, Who we are: Andrew Davison.
Catie Welsh January 10, 2011 MWF 1-1:50 pm Sitterson 014.
CSCI 51 Introduction to Computer Science Dr. Joshua Stough January 20, 2009.
ASDA: Prelim/ Advanced Data Structures and Algorithms Objective – –to give some background on the course Semester 2, Who I am: Andrew.
Computer Science 102 Data Structures and Algorithms CSCI-UA.0102 Fall 2012 Lecture 1: administrative details Professor: Evan Korth New York University.
1 WELCOME TO COMPUTER SCIENCE 1027b COMPUTER SCIENCE FUNDAMENTALS II Lecturers: Eric Schost (001) John Barron (002)
Discrete Mathematics CS204 Spring CS204 Discrete Mathematics Instructor: Professor Chin-Wan Chung (Office: Rm 3406, Tel:3537) 1.Lecture 1)Time:
Course Introduction Andy Wang COP 4530 / CGS 5425 Fall 2003, Section 4.
King Saud UniversityCSC112 - First Semester CSC 112 Java Programming I Introduction.
OSes: 0. Prelim 1 Operating Systems v Objectives –to give some background on this subject Certificate Program in Software Development CSE-TC and CSIM,
Adv. UNIX: Prelim/01 Advanced UNIX v Who I am: –Andrew Davison CoE, Info. Eng. Research Lab. (Room 101) v Objectives –to.
JTA. Prelim/01 Java Technology and Applications v Objective –to give some background on the course CoE Masters Programme, PSU Semester.
CSCE 1030 Computer Science 1 First Day. Course Dr. Ryan Garlick Office: Research Park F201 B –Inside the Computer Science department.
COMP1927 Course Introduction 16x1
Compilers: Prelim/0 1 Compiler Structures Objective – –to give some background on the course , Semester 1, Who I am: Andrew Davison.
King Saud University1 CSC 112 Java Programming I Introduction.
Course Info Instructor U.T. Nguyen Office: CSEB Office hours: Tuesday, 14:30-15:30 Thursday, 12:00-12:45 By.
Data Structures and Algorithms in Java AlaaEddin 2012.
Course Introductions.  Introduction to java  Basics of Java  Classes & Objects  Java Collections and APIs  Algorithms and their analysis  Recursion.
B.A. (Mahayana Studies) Introduction to Computer Science November March Preliminaries Some background information for this course.
1 CENG 707 Data Structures and Algorithms Nihan Kesim Çiçekli Department of Computer Engineering Middle East Technical University Fall 2013.
Theory of Computation. Introduction to The Course Lectures: Room ( Sun. & Tue.: 8 am – 9:30 am) Instructor: Dr. Ayman Srour (Ph.D. in Computer Science).
CS140 – Computer Programming 1 Course Overview First Semester – Fall /1438 – 2016/2017 CS140 - Computer Programming 11.
CENG 707 Data Structures and Algorithms
Course Overview - Database Systems
CS101 Computer Programming I
COMP 283 Discrete Structures
CENG 213 Data Structures Dr. Cevat Şener
Principles of Computing – UFCFA Lecture-1
Computer Science 102 Data Structures CSCI-UA
Artificial Intelligence (CS 461D)
Artificial Intelligence (CS 370D)
Psychological Science I: Statistics
CS 201 – Data Structures and Discrete Mathematics I
CS 201 – Data Structures and Discrete Mathematics I
Welcome to CS 1010! Algorithmic Problem Solving.
Course Overview - Database Systems
Welcome to CS 1340! Computing for scientists.
CENG 213 Data Structures Nihan Kesim Çiçekli
26 July 2011 SC 611 Class 1.
Compiler Structures 0. Preliminaries
Principles of Computing – UFCFA Week 1
Academic Integrity.
Presentation transcript:

Discrete Maths: Prelim/0 1 Discrete Maths (OLD) Objective – –to give some background on the course , Semester 1, Who I am: Andrew Davison WiG Lab 0. Preliminaries Please ask questions

Discrete Maths: Prelim/0 2 Overview 1. Outline of the Course 2. Meeting Times / Locations 3. Workload 4.Exercises 5. Course Materials 6. Books 7.Interesting Maths URLs

Discrete Maths: Prelim/ Outline of the Course To teach discrete maths useful for a deeper understanding of computer engineering: – –for understanding algorithms e.g. recursion – –proving that programs work continued

Discrete Maths: Prelim/0 4 – –for choosing data structures e.g. for use by a Web search agent – –for understanding advanced computing tools/techniques e.g. regular expressions, grammars continued

Discrete Maths: Prelim/0 5 Mathematical ideas are the building blocks of all of computer engineering/science. Understanding the maths behind computing allows you to answer “why”. – –e.g. Why does recursion work? All the maths in this course is of direct use in different areas of computing.

Discrete Maths: Prelim/0 6 Prerequisites You must have passed “Computer Programming Techniques” (or similar) – –knowledge of C is assumed

Discrete Maths: Prelim/0 7 Three-part Course Structure 1. Mathematical induction, loop invariants, recursion, running time of programs. 2. Graph algorithms and theory, trees. 3. Automata, regular expressions, context free grammars.

Discrete Maths: Prelim/ Meeting Times / Location Monday 14:00 – 14:50R201 Thursday10:00 – 11:50R201 Please come to see me if you have any questions; do not send me .

Discrete Maths: Prelim/ Workload Mid-term exam:35%(2 hours) Final exam:45%(3 hours) Two exercises:20% (2*10) weeks 7-8 and weeks 15-16

Discrete Maths: Prelim/0 10 Non-Attendence Penalty I may take registration at the start of a class. If someone is not there, they lose 1% (unless they have a good excuse). A maximum of 10% can be lost – –deducted from your final mark

Discrete Maths: Prelim/ Exercises The two exercises are worth a total of 20% (each worth 10%). They will be maths problems, perhaps with some simple algorithms to design/write. continued

Discrete Maths: Prelim/0 12 Planned exercise times (which may change): – –ex. 1 handout: weeks 7-8 – –ex. 2 handout: weeks Cheating will result in 0 marks. – –YOU HAVE BEEN WARNED!!

Discrete Maths: Prelim/ Course Materials I will hand out only the exercises. All the handouts (and other materials) will be placed on-line at Software.coe/DiscreteMaths/ oldSyllabus/ Print out and BRING TO CLASS

Discrete Maths: Prelim/ Books Discrete Mathematics and its Applications Kenneth H. Rosen McGraw Hill, 2012, 7th edition Discrete Mathematics for Computer Scientists John K. Truss Addison-Wesley, 1999, 2nd edition In the CoE Library very good continued

Discrete Maths: Prelim/0 15 Discrete Mathematics (DM) Richard Johnsonbaugh Macmillian Pub. Co., 1997, 4th ed. – –less mathematical, more examples – –there is a copy in the main PSU library – –I have a copy

Discrete Maths: Prelim/ Interesting Maths URLs Maths Archives: Discrete Maths: – – discreteMath.html – –links to maths courses, lecture notes MA: Images and Mathematics – – images.html continued

Discrete Maths: Prelim/0 17 Maths Puzzles (some not yet solved): – – msdos/discrete.math/.html – – (The brain games, puzzles and pastime Web site) – – (the rec.puzzles newsgroup archive) continued

Discrete Maths: Prelim/0 18 Math Comics/Cartoons: – – Comics.html Maths Software: – – activities/ (Java) – –