Introductory Lecture. What is Discrete Mathematics? Discrete mathematics is the part of mathematics devoted to the study of discrete (as opposed to continuous)

Slides:



Advertisements
Similar presentations
Mathematicsfor Comter I Course Info Mathematics for Computer I Semester
Advertisements

Design & Analysis of Algoritms
Mathematical Sciences at Oxford Stephen Drape. 2 Who am I? Dr Stephen Drape Access and Schools Liaison Officer for Computer Science (Also a Departmental.
Discrete Maths Objective to give some background on the course , Semester 2, Who I am: Andrew Davison WiG Lab
Math 308 Discrete Mathematics Discrete Mathematics deals with “Separated” or discrete sets of objects (rather than continuous sets) Processes with a sequence.
1 CS233601: Discrete Mathematics Department of Computer Science National Tsing Hua University.
Language Specfication and Implementation - PART II: Semantics of Procedural Programming Languages Lee McCluskey Department of Computing and Mathematical.
About the Course Lecture 0: Sep 2 AB C. Plan  Course Information and Arrangement  Course Requirement  Topics and objectives of this course.
Math443/543 Mathematical Modeling and Optimization
CSE 830: Design and Theory of Algorithms
CS 101 Course Summary December 5, Big Ideas Abstraction Problem solving Fundamentals of programming.
From Discrete Mathematics to AI applications: A progression path for an undergraduate program in math Abdul Huq Middle East College of Information Technology,
1 More Counting Techniques Possibility trees Multiplication rule Permutations Combinations.
Discrete Structures for Computer Science Ruoming Jin MW 5:30 – 6:45pm Fall 2009 rm MSB115.
Module #1 - Logic Based on Rosen, Discrete Mathematics & Its Applications. Prepared by (c) , Michael P. Frank. Modified By Mingwu Chen 1 Module.
Discrete Structure CS 203 Introduction.
CSE115/ENGR160 Discrete Mathematics 01/17/12 Ming-Hsuan Yang UC Merced 1.
Philosophy of ICT and Islam Lecture 1: Philosophy of Science and Computing.
The Fundamentals: Algorithms, the Integers & Matrices.
Do we need theoretical computer science in software engineering curriculum: an experience from Uni Novi Sad Bansko, August 28, 2013.
Introduction to Computer and Programming CS-101 Lecture 6 By : Lecturer : Omer Salih Dawood Department of Computer Science College of Arts and Science.
Teaching Teaching Discrete Mathematics and Algorithms & Data Structures Online G.MirkowskaPJIIT.
CSNB143 – Discrete Structure
Discrete Mathematics I 暨南大学 信息科学技术学院 计算机科学系 黄 战 副教授 离散数学 I (全英)
About the Course Lecture 0: Sep 10 AB C. Plan  Course Information and Arrangement  Course Requirement  Topics and objectives of this course.
Nama : Jehan binti Jamian No.matrik : UK Discrete Mathematics Area of mathematics that deals with the study of discrete objects. Discusses languages.
CS 103 Discrete Structures Lecture 01 Introduction to the Course
Applications of discrete mathematics: Formal Languages (computer languages) Compiler Design Data Structures Computability Automata Theory Algorithm Design.
Discrete Mathematics, Part II CSE 2353 Fall 2007 Margaret H. Dunham Department of Computer Science and Engineering Southern Methodist University Some slides.
Discrete Mathematics Transparency No. 0-1 Discrete Mathematics Cheng-Chia Chen September 2009.
Discrete Structures for Computer Science Muad M. Abu-Ata Summer 2013.
Introduction to Discrete Mathematics J. H. Wang Sep. 14, 2010.
CSci 2011 Textbook ^Discrete Mathematics and Its Applications,  Rosen  6th Edition  McGraw Hill  2006.
Fundamentals of Algorithms MCS - 2 Lecture # 1
Course overview Course title: Discrete mathematics for Computer Science Instructors: Dr. Abdelouahid Derhab Credit.
Introductory Lecture Copyright © McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent of McGraw-Hill.
Discrete mathematics Kwon, Taekyoung Courtesy of Dr. Michael P. Frank University of Florida.
Korea Advanced Institute of Science and Technology, Dept. of EECS, Div. of CS, Information Systems Lab. 1/10 CS204 Course Overview Prof.
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 COMPUTATIONAL STRUCTURES CS Fall 2005.
Discrete Structures for Computing
MTH 201 Discrete Mathematics Fall Term MTH 201 Discrete Mathematics Fall Term INTERNATIONAL BURCH UNIVERSITY DEPARTMENT of INFORMATION.
Welcome to CMPSC 360!. Today Introductions Student Information Sheets, Autobiography What is Discrete Math? Syllabus Highlights
Major objective of this course is: Design and analysis of modern algorithms Different variants Accuracy Efficiency Comparing efficiencies Motivation thinking.
Discrete Structures – CS Text Discrete Mathematics and Its Applications Kenneth H. Rosen (7 th Edition) Chapter 1 The Foundations: Logic and Proofs.
Discrete Mathematics ( 離散數學 ) Ming-Jer Tsai. Outline What is Discrete Mathematics? Why learn Discrete Mathematics? What will be taught in the class? How.
Topics Paths and Circuits (11.2) A B C D E F G.
Onlinedeeneislam.blogspot.com1 Design and Analysis of Algorithms Slide # 1 Download From
New Curricula Proposal at FSMN by Miroslav Ćirić & Predrag Krtolica.
Discrete mathematics Kwon, Tae-kyoung
5 Lecture in math Predicates Induction Combinatorics.
1.  A step by step process to solve any problem is called algorithm.  Algorithm is a process which take some values as input and provide us output.
Introductory Lecture. What is Discrete Mathematics? Discrete mathematics is the part of mathematics devoted to the study of discrete (as opposed to continuous)
Design and Analysis of Algorithms Faculty Name : Ruhi Fatima Course Description This course provides techniques to prove.
Discrete Structures MT217 Lecture 01. Course Objectives Express statements with the precision of formal logic Analyze arguments to test their validity.
CS 2130 Computational Structures (Discrete Mathematics for Computing)
Sub-fields of computer science. Sub-fields of computer science.
Computer Science Courses
CSC 1300 – Discrete Structures
Discrete Mathematics and Its Applications
Objective of This Course
Introduction to Discrete Mathematics
KNOWLEDGE REPRESENTATION
What is Mathematics, really?
CompSci 1: Principles of Computer Science Lecture 1 Course Overview
Discrete Mathematics in the Real World
Design and Analysis of Algorithms
Discrete Mathematics and Its Applications
Computer Science Courses in the Major
Presentation transcript:

Introductory Lecture

What is Discrete Mathematics? Discrete mathematics is the part of mathematics devoted to the study of discrete (as opposed to continuous) objects. Calculus deals with continuous objects and is not part of discrete mathematics. Examples of discrete objects: integers, steps taken by a computer program, distinct paths to travel from point A to point B on a map along a road network, ways to pick a winning set of numbers in a lottery. A course in discrete mathematics provides the mathematical background needed for all subsequent courses in computer science and for all subsequent courses in the many branches of discrete mathematics.

Kinds of Problems Solved Using Discrete Mathematics How many ways can a password be chosen following specific rules? How many valid Internet addresses are there? What is the probability of winning a particular lottery? Is there a link between two computers in a network? How can I identify spam messages? How can I encrypt a message so that no unintended recipient can read it? How can we build a circuit that adds two integers?

Kinds of Problems Solved Using Discrete Mathematics What is the shortest path between two cities using a transportation system? Find the shortest tour that visits each of a group of cities only once and then ends in the starting city. How can we represent English sentences so that a computer can reason with them? How can we prove that there are infinitely many prime numbers? How can a list of integers be sorted so that the integers are in increasing order? How many steps are required to do such a sorting? How can it be proved that a sorting algorithm always correctly sorts a list?

Goals of a Course in Discrete Mathematics Mathematical Reasoning: Ability to read, understand, and construct mathematical arguments and proofs. Combinatorial Analysis: Techniques for counting objects of different kinds. Discrete Structures: Abstract mathematical structures that represent objects and the relationships between them. Examples are sets, permutations, relations, graphs, trees, and finite state machines.

Goals of a Course in Discrete Mathematics Algorithmic Thinking: One way to solve many problems is to specify an algorithm. An algorithm is a sequence of steps that can be followed to solve any instance of a particular problem. Algorithmic thinking involves specifying algorithms, analyzing the memory and time required by an execution of the algorithm, and verifying that the algorithm will produce the correct answer. Applications and Modeling: It is important to appreciate and understand the wide range of applications of the topics in discrete mathematics and develop the ability to develop new models in various domains. Concepts from discrete mathematics have not only been used to address problems in computing, but have been applied to solve problems in many areas such as chemistry, biology, linguistics, geography, business, etc.

Discrete Mathematics is a Gateway Course Topics in discrete mathematics will be important in many courses that you will take in the future: Computer Science: Computer Architecture, Data Structures, Algorithms, Programming Languages, Compilers, Computer Security, Databases, Artificial Intelligence, Networking, Graphics, Game Design, Theory of Computation, …… Mathematics: Logic, Set Theory, Probability, Number Theory, Abstract Algebra, Combinatorics, Graph Theory, Game Theory, Network Optimization, … The concepts learned will also be helpful in continuous areas of mathematics. Other Disciplines: You may find concepts learned here useful in courses in philosophy, economics, linguistics, and other departments.