Applications of discrete mathematics: Formal Languages (computer languages) Compiler Design Data Structures Computability Automata Theory Algorithm Design.

Slides:

Advertisements

Similar presentations

Lecture 11: Algorithms and Time Complexity I Discrete Mathematical Structures: Theory and Applications.

Advertisements

Mathematicsfor Comter I Course Info Mathematics for Computer I Semester

CSE 202 – Formal Languages and Automata Theory 1 REGULAR LANGUAGE.

Recursively Defined Functions

Management Science 461 Lecture 2b – Shortest Paths September 16, 2008.

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

January 5, 2015CS21 Lecture 11 CS21 Decidability and Tractability Lecture 1 January 5, 2015.

Algorithms and Pseudocode Bioinformatics. Formulating Problems Clarify input and output elements Requires modeling the problem in some concise form Example:

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.

Math443/543 Mathematical Modeling and Optimization

CS333/ Topic 11 CS333 - Introduction CS333 - Introduction General information Goals.

CS Master – Introduction to the Theory of Computation Jan Maluszynski - HT Lecture 1 Introduction Jan Maluszynski, IDA, 2007

Overview Discrete Mathematics and Its Applications Baojian Hua

1 Efficiency of Algorithms. 2  Two main issues related to the efficiency of algorithms:  Speed of algorithm  Efficient memory allocation  We will.

Solution methods for Discrete Optimization Problems.

TR1413: Discrete Math for Computer Science Lecture 0: Introduction.

May 5, 2015Applied Discrete Mathematics Week 13: Boolean Algebra 1 Dijkstra’s Algorithm procedure Dijkstra(G: weighted connected simple graph with vertices.

Introduction to the Theory of Computation

Nama : Jehan binti Jamian No.matrik : UK Discrete Mathematics Area of mathematics that deals with the study of discrete objects. Discusses languages.

CS 454 Theory of Computation Sonoma State University, Fall 2012 Instructor: B. (Ravi) Ravikumar Office: 116 I Darwin Hall.

EECS 203: It’s the end of the class and I feel fine. Graphs.

© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Sixth Edition, Mc Graw-Hill, 2007 Ch.1 (Part 1): The Foundations: Logic and Proofs Introduction.

IT 60101: Lecture #201 Foundation of Computing Systems Lecture 20 Classic Optimization Problems.

Introduction to Discrete Mathematics J. H. Wang Sep. 14, 2010.

Graph Theory Hamilton Paths and Hamilton Circuits.

CS 390 Introduction to Theoretical Computer Science.

CS440 Computer Science Seminar Introduction to Evolutionary Computing.

May 1, 2002Applied Discrete Mathematics Week 13: Graphs and Trees 1News CSEMS Scholarships for CS and Math students (US citizens only) $3,125 per year.

6.1 Hamilton Circuits and Paths: Hamilton Circuits and Paths: Hamilton Path: Travels to each vertex once and only once… Hamilton Path: Travels to each.

Algorithms and their Applications CS2004 ( ) Dr Stephen Swift 4.1 Time Complexity and Asymptotic Notation.

Discrete Structures for Computing

Object Oriented Programming Assignment Introduction Dr. Mike Spann

Course presentation: FLA Fuzzy Logic and Applications 4 CTI, 2 nd semester Doru Todinca in Courses presentation.

Network Layer4-1 Distance Vector: link cost changes Link cost changes: r node detects local link cost change r updates distance table (line 15) r if cost.

Computer Science 210 Computer Organization Course Introduction.

By: Nelson Webster. Algorithm Engineers Algorithm engineers study the effectiveness and efficiency of procedures of solving problems on a computer.

By: Christophe Dufour Chrishon Adams Mischael Joseph.

I can describe the differences between Hamilton and Euler circuits and find efficient Hamilton circuits in graphs. Hamilton Circuits I can compare and.

Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 6 The Mathematics of Touring 6.1Hamilton Paths and Hamilton Circuits.

CSE 202 – Formal Languages and Automata Theory 1 REGULAR EXPRESSION.

Chapter 14 Section 3 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.

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

Mathematical modeling To describe or represent a real-world situation quantitatively, in mathematical language.

Exhaustive search Exhaustive search is simply a brute- force approach to combinatorial problems. It suggests generating each and every element of the problem.

Graphs 1 Neil Ghani University of Strathclyde. Where are we …. We studied lists: * Searching and sorting a list Then we studied trees: * Efficient search.

CS 2130 Computational Structures (Discrete Mathematics for Computing)

Limitation of Computation Power – P, NP, and NP-complete

Solving Complex Problems

Shortest Path Problems

Choose a Count down Time by Clicking a Button Below.

Nuffield Free-Standing Mathematics Activity

Ch.1 (Part 1): The Foundations: Logic and Proofs

Paper Code : BCA-27 Paper Title : Discrete Mathematics.

Chapter 2: Business Efficiency Lesson Plan

Roadmap to Programming work, right, fast KISS

Traveling Salesman Problem

Introduction to Algorithms

Discrete Mathematics and Its Applications

Formal Language.

Chapter 10: Mathematical proofs

Chapter 2: Business Efficiency Lesson Plan

Genome Assembly.

Chapter 2: Business Efficiency Business Efficiency

Unit-4: Dynamic Programming

Solution: Assume

Lecture One: Automata Theory Amjad Ali

Discrete Mathematics and Its Applications

Computer Science 210 Computer Organization

Presentation transcript:

Applications of discrete mathematics: Formal Languages (computer languages) Compiler Design Data Structures Computability Automata Theory Algorithm Design Relational Database Theory Complexity Theory (counting)

The Traveling Salesman Problem Example (counting): Important in circuit design many other CS problems ______________________ Given: n cities c 1, c 2,..., c n distance between city i and j, d ij Find the shortest tour.

The Traveling Salesman Problem Assume a very fast PC: 1 flop = 1 nanosecond = sec. 1,000,000,000 ops/sec = 1 GHz. A tour requires n-1 additions. How many different tours?

The Traveling Salesman Problem Choose the first city n ways, the second city n-1 ways, the third city n-2 ways, etc. # of tours = n (n-1) (n-2)....(2) (1) = n! (Combinations) Total number of additions T(n)= (n-1) n! (Rule of Product)

The Traveling Salesman Problem If n=8, T(n) = 78! = 282,240 flops takes time less than 1/3000 sec. HOWEVER If n=50, T(n) = 4950! = flops takes seconds = minutes = hours = days = weeks = years....a long time. You’ll be an old person before it’s finished. There are some problems for which we do not know if efficient algorithms exist to solve them!