lecture1

lecture1 - Discrete Computation Structures CSE 2353 Bhanu...

Info iconThis preview shows pages 1–8. Sign up to view the full content.

View Full Document Right Arrow Icon
Discrete Computation Structures CSE 2353 Bhanu Kapoor, PhD Department of Computer Science & Engineering Southern Methodist University, Dallas, TX [email protected] , 214-336-4973 August 27, 2009 Embrey 129, SMU, Dallas, Texas Lecture 01 1
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Lecture 01 Agenda ± Course Overview ² Text Book ² Grading ² Preliminary Schedule ² Course Contents Overview ± Application to Algorithms ± Next Lecture 2
Background image of page 2
Lecture 01 Agenda ± Course Overview ² Text Book ² Grading ² Preliminary Schedule ² Course Contents Overview ± Application to Algorithms ± Next Lecture 3
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Introduction ± CSE 2353: Discrete Computation Structures ± Purpose: a rigorous introduction to the discrete mathematical concepts used in design and analysis of algorithms ot a lab or programming course ² Not a lab or programming course ± Integral part of the computer science curriculum ± Knowledge of algorithms and related analyses useful in all aspects of Technology Industry 4
Background image of page 4
Textbook ± Textbook: Discrete Mathematical Structures: Theory and Applications : By D.S. Malik and M.K. Sen, ublishers: Thomson Course Technology Publishers: Thomson Course Technology ± Other Useful References ² Discrete Mathematics and Its Application by K. Rosen, cGraw Hill McGraw Hill. ± We will follow the textbook closely 5
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Class Schedule Week Dates Topics Book Chapters 01 08/27 Introduction, Foundations: Sets, Logic 01 02 09/01,03 Foundations: Algorithms 01 3 9/08 10 lgorithms tegers 1 02 03 09/08,10 Algorithms, Integers 01, 02 04 09/15,17 Integers and Mathematical Induction 02 05 09/22,24 Matrices, Relations 03, 04 06 09/29,10/01 Functions, Recap Part 1, Joint Class & Midterm Exam 1on 10/01/08 05 07 10/06,08 Counting, Recurrence 08 10/13 Fall Break 09 10/15 Recurrence 07, 08 10 10/20 Algorithms Complexity 09 11 10/27,29 Algorithms Complexity 09 12 11/03,05 Graph Theory, Recap Part 2, Midterm Exam 2 on 11/05/08 10 13 11/10,12 Graph Theory 10 14 11/17,19 Trees and Networks 11 15 11/24 Networks 11 16 12/01,03 Boolean Algebra 12 17 12/08 Recap for Final Exam 8 2/11 7 inal Exam Date TBD 6 18 12/11-17 Final Exam Date TBD
Background image of page 6
Course Overview: Part 1 ± Foundations: Sets, Logic, and Algorithms ²
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 8
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 11/11/2009 for the course CSE 2353 taught by Professor Bhanukapoor during the Spring '09 term at SMU.

Page1 / 23

lecture1 - Discrete Computation Structures CSE 2353 Bhanu...

This preview shows document pages 1 - 8. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online