CTIS154-01,02,03 Discrete Mathematics II Kadir A. Peker Tel: x5406.

Slides:



Advertisements
Similar presentations
Midwestern State University Department of Computer Science Dr. Ranette Halverson CMPS 2433 – CHAPTER 4 GRAPHS 1.
Advertisements

Based on Rosen, Discrete Mathematics & Its Applications, 5e (c) Michael P. Frank Modified by (c) Haluk Bingöl 1/18 Module #0 - Overview.
Today’s Agenda  Syllabus CS2336: Computer Science II.
CPT S 317: Automata and Formal Languages
CIT 596 Theory of computing Traditional course (CIS 511, CIS 262) and other similarly named courses in other universities are divided into 3 parts that.
9.2 The Traveling Salesman Problem. Let us return to the question of finding a cheapest possible cycle through all the given towns: We have n towns (points)
CS 46101–600/CS Design and Analysis of Algorithms Dr. Angela Guercio Spring 2010.
Discrete Maths Objective to give some background on the course , Semester 2, Who I am: Andrew Davison WiG Lab
1 CS233601: Discrete Mathematics Department of Computer Science National Tsing Hua University.
EEE393 Basic Electrical Engineering Kadir A. Peker Tel: x5406.
CS 232 Geometric Algorithms: Lecture 1 Shang-Hua Teng Department of Computer Science, Boston University.
Fall 2005Costas Busch - RPI1 CSCI-2400 Models of Computation.
CTIS 154 Discrete Mathematics II1 8.2 Paths and Cycles Kadir A. Peker.
EE 220 (Data Structures and Analysis of Algorithms) Instructor: Saswati Sarkar T.A. Prasanna Chaporkar, Programming.
Chapter 4 Graphs.
Discrete Mathematics Lecture 9 Alexander Bukharovich New York University.
University of Colorado - Dept of Aerospace Engineering Sciences - Introduction to FEM This is ASEN 5007: Introduction to Finite Element Methods.
CSNB143 – Discrete Structure
CS223 Algorithms D-Term 2013 Instructor: Mohamed Eltabakh WPI, CS Introduction Slide 1.
CS 103 Discrete Structures Lecture 01 Introduction to the Course
CPS120: Introduction to Computer Science Fall: 2002 Instructor: Paul J. Millis.
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.
Graph Theory Topics to be covered:
Introduction to Discrete Mathematics J. H. Wang Sep. 14, 2010.
CS 390 Introduction to Theoretical Computer Science.
40551 Logic Synthesis Optimization Dr. Yaser M. Agami Khalifa Fall 2004 Lecture # 1.
Discrete Maths: Prelim/0 1 Discrete Maths (OLD) Objective – –to give some background on the course , Semester 1, Who I am: Andrew.
Structures 7 Decision Maths: Graph Theory, Networks and Algorithms.
CS 200 Algorithms and Data Structures
MTH 201 Discrete Mathematics Fall Term MTH 201 Discrete Mathematics Fall Term INTERNATIONAL BURCH UNIVERSITY DEPARTMENT of INFORMATION.
Discrete Mathematics CS204 Spring CS204 Discrete Mathematics Instructor: Professor Chin-Wan Chung (Office: Rm 3406, Tel:3537) 1.Lecture 1)Time:
Digital Logic Design and Lab School of EECS Seoul National University.
CPS120: Introduction to Computer Science Winter 2002 Instructor: Paul J. Millis.
For Wednesday No reading No homework There will be homework for Friday, as well the program being due – plan ahead.
Introduction to computers and programming Instructor: Alex Iskold.
Saeid Pashzadeh Jan 2009 Theory of Computation 1.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
CSE 421 Algorithms Richard Anderson Lecture 27 NP-Completeness and course wrap up.
THEORY OF COMPUTATION Komate AMPHAWAN 1. 2.
CIRCUITS, PATHS, AND SCHEDULES Euler and Königsberg.
Materials Science Dr. Deniz UZUNSOY Friday AM A-504.
CEC 220 Digital Circuit Design Wednesday, January 7 CEC 220 Digital Circuit Design Slide 1 of 12.
Design and Analysis of Algorithms (09 Credits / 5 hours per week) Sixth Semester: Computer Science & Engineering M.B.Chandak
Data Structures and Algorithms in Java AlaaEddin 2012.
Principles of Imperative Computation Lecture 1 January 15 th, 2012.
CSE 421 Algorithms Richard Anderson Lecture 29 Complexity Theory NP-Complete P.
1.  This course covers the mathematical foundations of computer science and engineering. It provides an introduction to elementary concepts in mathematics.
Introductory Lecture. What is Discrete Mathematics? Discrete mathematics is the part of mathematics devoted to the study of discrete (as opposed to continuous)
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).
Shana Norman Dec 11, 2003 Final Project
Formal Languages and Automata Theory
Design and Analysis of Algorithms (09 Credits / 5 hours per week)
Discrete Mathematics Graph: Planar Graph Yuan Luo
CPT S 317: Automata and Formal Languages
COMP 283 Discrete Structures
6.4 Finite Boolean Algebra
Discrete Math II - Introduction -
Paper Code : BCA-27 Paper Title : Discrete Mathematics.
EECS 203 Lecture 20 More Graphs.
Refresh and Get Ready for More
Spanning Trees Discrete Mathematics.
Lecture 15: Graph Theory II
CMPT 438 Algorithms Instructor: Tina Tian.
Richard Anderson Lecture 29 Complexity Theory
A path that uses every vertex of the graph exactly once.
26 July 2011 SC 611 Class 1.
Richard Anderson Lecture 26 NP-Completeness
CPT S 317: Automata and Formal Languages
Richard Anderson Lecture 27 Survey of NP Complete Problems
Presentation transcript:

CTIS154-01,02,03 Discrete Mathematics II Kadir A. Peker Tel: x5406

Outline Book: –Discrete Mathematics (6th Edition) Richard Johnsonbaugh Will follow the book closely –3-4 weeks GRAPHS (Ch 8) –3 weeks TREES (Ch 9) –2 weeks BOOLEAN & COMBINATORIAL CIRCUITS (Ch 11) –3 weeks AUTOMATA, GRAMMARS, LANGUAGES Home page: – (Schedule, syllabus etc) –STARS

WEEK-1 Introduction. Introduction to graphs. WEEK-2 Paths and cycles. Hamiltonian cycles and the traveling salesman problem. WEEK-3 A shortest path algorithm. WEEK-4 Representation and isomorphism of graphs. Planar graphs and Euler's formula. WEEK-5 Introduction to trees, terminology. WEEK-6 Spanning trees. Minimal spanning trees. WEEK-7 Binary trees. Tree traversal. Decision trees and game trees. WEEK-8 MIDTERM WEEK WEEK-9 Boolean circuits, properties. Boolean algebras. WEEK-10 Boolean functions, circuits synthesis. Applications. WEEK-11 Sequential circuits and finite-state machines. WEEK-12 Finite state automata. Languages and grammars. WEEK-13 Non-deterministic FSA. Relationships between languages and automata. WEEK-14 Review.

Grading Midterm 1 25% Midterm 2 25% Final 35% Quiz 10% HW 5% Attandance will be collected

HOMEWORK 5% –Once every 1-2 week –Will drop 2 worst of homework grades –%20 off each late day (starting after class, same day) –May grade only some problems in the HW (without telling beforehand) –Do not copy from others (but you can discuss) Want you to: 1-review during the week (open the book at least once) 2-Learn the mechanics of problem solving (you may think you know when you see it in the class; but you don’t, until you do it yourself) –Some quiz questions from HW (same or similar)

Other Grading QUIZ 10% –2-4 quizes (will let you know before a quiz) Midterms may be outside the midterm week (will decide with Satilmis Topcu)

Office Hours (Tentative) MondayTuesdayWednesdayThursdayFriday 08: :30 CTIS C216 09: :30 CTIS C216 10: :30 Office Hour 11: :30 Office Hour 12: :30 13: :30 CTIS C216 EEE : :30 Office Hour 15: :30 CTIS C216 EEE Department Meeting CTIS C216 Commitee Meeting 16: :30 Other times: preferred. Can call. Can drop by and see if I am busy or not.