26 July 2011 SC 611 Class 1.

Slides:



Advertisements
Similar presentations
Based on Rosen, Discrete Mathematics & Its Applications, 5e (c) Michael P. Frank Modified by (c) Haluk Bingöl 1/18 Module #0 - Overview.
Advertisements

Analysis & Design of Algorithms (CSCE 321)
CS 581: Introduction to the Theory of Computation Lecture 1 James Hook Portland State University
1 CS233601: Discrete Mathematics Department of Computer Science National Tsing Hua University.
CS/CMPE 535 – Machine Learning Outline. CS Machine Learning (Wi ) - Asim LUMS2 Description A course on the fundamentals of machine.
About the Course Lecture 0: Sep 2 AB C. Plan  Course Information and Arrangement  Course Requirement  Topics and objectives of this course.
Overview Discrete Mathematics and Its Applications Baojian Hua
Administrative Issues ICS 151 Fall 2007 Instructor: Eli Bozorgzadeh.
Discrete Structures for Computer Science Ruoming Jin MW 5:30 – 6:45pm Fall 2009 rm MSB115.
CSNB143 – Discrete Structure
About the Course Lecture 0: Sep 10 AB C. Plan  Course Information and Arrangement  Course Requirement  Topics and objectives of this course.
CS 103 Discrete Structures Lecture 01 Introduction to the Course
Discrete Mathematics Transparency No. 0-1 Discrete Mathematics Cheng-Chia Chen September 2009.
CSNB143 – Discrete Structure. Learning Outcomes – At the end of this course, students should be able to use all basic concepts of mathematical structures.
Introduction to Discrete Mathematics J. H. Wang Sep. 14, 2010.
Course overview Course title: Discrete mathematics for Computer Science Instructors: Dr. Abdelouahid Derhab Credit.
CSC Discrete Mathematical Structures Dr. Karl Ricanek Jr.
Discrete Maths: Prelim/0 1 Discrete Maths (OLD) Objective – –to give some background on the course , Semester 1, Who I am: Andrew.
Course Guide CS 285 Discrete Mathematics Dr. Eng. Manal Farrag Prince Sultan University, College for Women
Discrete Mathematics 이재원 School of Information Technology
Relationships Between Structures “→” ≝ “Can be defined in terms of” Programs Groups Proofs Trees Complex numbers Operators Propositions Graphs Real.
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
CPSC 121: Models of Computation Unit 0 Introduction George Tsiknis Based on slides by Patrice Belleville and Steve Wolfman.
Computational Structures Tim Sheard & James Hook Portland State University Class Preliminaries.
BE207 Numerical Analysis using Matlab Lecturer DR Abdullah Awad Faculty of Engineering.
Design and Analysis of Algorithms (09 Credits / 5 hours per week) Sixth Semester: Computer Science & Engineering M.B.Chandak
MCA 301: Design and Analysis of Algorithms Instructor Neelima Gupta
1 CSC 281 Discrete Mathematics for Computer Science Dr.Yuan Tian Syllabus.
CS/APMA 202 Spring 2005 Aaron Bloomfield. Sequences in Nature
1.  This course covers the mathematical foundations of computer science and engineering. It provides an introduction to elementary concepts in mathematics.
Laboratory of Natural Information Processing 26 July 2010 SC105 Class 1.
1 COMP2121 Discrete Mathematics Introduction Hubert Chan [O1 Abstract Concepts] [O2 Proof Techniques] [O3 Basic Analysis Techniques]
CS140 – Computer Programming 1 Course Overview First Semester – Fall /1438 – 2016/2017 CS140 - Computer Programming 11.
ENG3380 Computer Organization
Programming and Data Structures
ESC101: Introduction to Computing
MSc in Advanced Computer Science Induction 2016/17
Design and Analysis of Algorithms (09 Credits / 5 hours per week)
Computer Engineering Department Islamic University of Gaza
Welcome to Computers in Civil Engineering 53:081 Spring 2003
MATH/COMP 340: Numerical Analysis I
COMP 283 Discrete Structures
CENG 213 Data Structures Nihan Kesim Çiçekli
Lecture 1 Introduction/Overview Text: Chapters 1, 2 Wed. 1/28/04
Welcome to CMSC 203 – Discrete Structures Spring 2003
CS5040: Data Structures and Algorithms
Computer Architecture Syllabus
CSC 111 Course orientation
Principles of Computing – UFCFA Lecture-1
CSC 361 Artificial Intelligence
Computer Science 102 Data Structures CSCI-UA
Introduction to MA Day 1.
Introduction to MA Day 1.
Design and Analysis of Algorithms (07 Credits / 4 hours per week)
Introduction to Discrete Mathematics
ENG3380 Computer Organization
Welcome to MAT 142.
CS 281: Discrete Mathematics for Computer Science
Welcome to MAT 142.
CS 250, Discrete Structures, Fall 2014 Nitesh Saxena
CS 250, Discrete Structures, Fall 2014 Nitesh Saxena
Principles of Computing – UFCFA Week 1
Administrative Issues
Computer Engineering Department Islamic University of Gaza
Administrative Issues
Design and Analysis of Algorithms (04 Credits / 4 hours per week)
CS 250, Discrete Structures, Fall 2015 Nitesh Saxena
CS 232 Geometric Algorithms: Lecture 1
Presentation transcript:

26 July 2011 SC 611 Class 1

Prof. Manish K. Gupta Laboratory of Natural Information Processing SC611 Mathematics for Computer Science Lecture 1: Admin Details & Background Image Credit: Nick Papadakis, Copyright P.W.K.R. and N.P. http://www.dna.caltech.edu/~pwkr/ Prof. Manish K. Gupta Laboratory of Natural Information Processing 26 July 2011 SC 611 Class 1

Outline of Presentation Admin Details Overview and Subject Classification Historical Introduction & Motivation 26 July 2011 SC 611 Class 1

Administrative Details SC 611 26 July 2011 SC 611 Class 1

Instructor http://courses.daiict.ac.in//course/view.php?id=212 Manish K Gupta (www.mankg.com) Biography (http://www.guptalab.org/mankg/public_html/WWW/shortbio.html ) Office: Room 2209 Faculty Block 2 Office Hours: 4:00-5:00 pm Friday Email: mankg@daiict.ac.in Phone: 91-79-30510549 Course Page: http://courses.daiict.ac.in//course/view.php?id=212 26 July 2011 SC 611 Class 1

Tutor/ Teaching Assistants TBA There could be some guest lectures. Guest Lectures 26 July 2011 SC 611 Class 1

Class Timings Lectures Tutorials Tuesday 4:00 pm (CEP 110) Thursday 4:00 pm (CEP 110) Friday 3:00 pm (CEP 110) Tutorials Friday 2:00 pm 26 July 2011 SC 611 Class 1

Attendance Policy Each of you must attend each lecture as I usually give a few questions (called type-2 questions) that you need to solve by that week itself and clear your doubts about it. Note that I usually ask them in the exams or quizzes. There could be a surprise quiz at any time in Lectures or Tutorials and sometime I may change the % of quiz for final grade to quite a lot. If for some reason beyond your control (for example you are sick) you are about to miss a lecture please send an email in advance to me (subject line: your roll number, name and SC611 Fall 2011) that you will not be able to attend the lecture that day. 26 July 2011 SC 611 Class 1

Overview and Subject Classification This exciting course is foundation to your MSc IT Discrete Mathematics (60%) Models of Computation (20%) Numerical Methods (20%) 26 July 2011 SC 611 Class 1

Course Outline-1 (Total Lectures =16-1=15) Week Tentative Topics 1 (July 25) Homework 1 Set and Set Operations, Relations, Functions 2 (Aug 1) Homework 2 Introduction to logic, Logic Propositional Equivalences, Predicate, Quantifiers and Proofs 3 (Aug 8) Homework 3 Partial orders and Lattices, Matrices, Sequence, Strings, Bit operations 4 (Aug 15) Aug 15 Holiday Homework 4 Counting problems and Pigeonhole principle, Permutations, Combinations and Discrete Probability, Proof Strategies 5 (Aug 22) Aug 22 Holiday Algorithms, Complexity 6 (Aug 29) Aug 31 Holiday Revision Summary (Aug 30) and Test 1 (Sep 1 to Sep 3) 26 July 2011 SC 611 Class 1

Course Outline-2 (Total Lectures =16) Week Tentative Topics 7 (Sep 5) Recursion, Graph Theory basics, Euler and Hamiltonian paths and circuits 8 (Sep 12) Homework 5 Shortest path algorithms, Isomorphism of graph, planner graph 9 (Sep 19) Homework 6 Trees basics, Tree Traversals, Spanning trees 10 (Sep 26) Homework 7 Sorting and searching algorithms FSM and Sate-transition relation, Regular expression 11 (Oct 3) Oct 6 Holiday Revision Summary (Oct 4) Test 2 (Oct 7 to Oct 11) 12 (Oct 10) Homework 8 Grammars and Context Free language, Introduction to numerical methods, round-off and truncation errors 26 July 2011 SC 611 Class 1

Course Outline-3 (Total Lectures =12-1=11) Week Tentative Topics 13 (Oct 17) Homework 9 Bisection and Iterative approaches, Interpolation and Extrapolation 14 (Oct 24) Holiday Week Oct 26, 27 &28 Holiday 15 (Oct 31) Homework 10 Simultaneous Equations and LR methods, Recurrence relations, Newton-Raphson method 16 (Nov 7) Course Evaluation Week Holiday Nov 7 & 10 Homework 11 Numerical integration, Curve-fitting 17 (Nov 14) Supplementary Lectures 18 (Nov 21) Test 3 (Nov 21 to Nov 26) 26 July 2011 SC 611 Class 1

Text Book http://www.mhhe.com/math/advmath/rosen/ Discrete Mathematics and Applications, Kenneth H. Rosen, 1999 http://www.mhhe.com/math/advmath/rosen/ Supplementary Books Schaum’s Outline of Theory and Problems of Numerical Analysis Francis Scheid Numerical methods for scientists and engineers, R.W. Hamming 13

Oct 24 to Oct 30 (Holiday Week) Semester Break: Week 14 (Oct 24) Oct 24 to Oct 30 (Holiday Week) 26 July 2011 SC 611 Class 1

Holidays Fall 2011 26 July 2011 SC 611 Class 1

Marks Distribution (Tentative) / Grading Policy Assignments/Tutorials 10% Mid Term Test 1 20% Mid Term Test 2 Quiz 15% Final (Test 3) 35% 26 July 2011 SC 611 Class 1

Advice on Problem Solving Please attend each lecture and tutorial Mark your doubts and clear them that week itself Step 0: Think about it for 15 minutes Step 1: Ask your peers Step 2: Ask your seniors Step 3: Ask the TAs Step 4: Ask the Tutors Step 5: Finally ask the Instructor (me) on Friday every week between 4:00 and 5:00 pm at Room 2209, Faculty Block 2 “It is better to solve the right problem the wrong way than to solve the wrong problem the right way” Richard W. Hamming http://evilutionarybiologist.blogspot.com/2009/12/you-and-your-research.html 26 July 2011 SC 611 Class 1

Course Web Page Course Web Page: http://courses.daiict.ac.in//course/view.php?id=212 Create your login with your daiict email address as and when you get it at http://courses.daiict.ac.in Register for the course SC611 at Moodle 26 July 2011 SC 611 Class 1

Motivation and Historical Introduction 26 July 2011 SC 611 Class 1

What is the purpose of Computing? “The purpose of computing is insight, not numbers. The purpose of computing numbers is not yet in sight.” Richard W. Hamming RW Hamming (1971). Introduction to Applied Numerical Analysis. McGraw Hill. 26 July 2011 SC 611 Class 1

In science if you know what you are doing you should not be doing it. In engineering if you do not know what you are doing you should not be doing it Richard W. Hamming Any Questions ? 26 July 2011 SC 611 Class 1