1 / 6

MTH 201 Discrete Mathematics 201 1 -201 2 Fall Term

DEPARTMENT of INFORMATION TECHNOLOGIES. INTERNATIONAL BURCH UNIVERSITY. MTH 201 Discrete Mathematics 201 1 -201 2 Fall Term. Azizah Ibrahim aibrahim@ibu.ba. Class Schedule. Class Schedule: Monday 9 :00-12:00, Office Hour: Open Door Policy. Course Objectives.

bozica
Download Presentation

MTH 201 Discrete Mathematics 201 1 -201 2 Fall Term

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. DEPARTMENT of INFORMATION TECHNOLOGIES INTERNATIONAL BURCH UNIVERSITY MTH 201 Discrete Mathematics 2011-2012FallTerm Azizah Ibrahim aibrahim@ibu.ba

  2. ClassSchedule • Class Schedule: Monday 9:00-12:00, • Office Hour:OpenDoorPolicy

  3. Course Objectives • Introduce the fundamental topics and techniques in discrete and combinatorial reasoning • Introduce wide variety application of Discrete mathematics in Computer Science • Apply theory and techniques from discrete methods, combinatorial and graph theory in the applications of computer science. •  Establish knowledge and understanding of data structures ,theory of computer languages and the analysis of algorithms using the theory and technique from discrete mathematics.

  4. Textbooks • Grimaldi, R. (2004) Discrete and Combinatorial Mathematics: An Applied Introduction .New York :Addison Wesley Pub.Co.Inc. 5th edition • 2. Kenneth H. Rosen (2003) Discrete Mathematics and its Applications : Mc Graw Hill. 5th edition

  5. Brief Contents • Chapter 1: FUNDAMENTALS OF LOGIC • Chapter 2: FUNDAMENTALS PRINCIPLES OF COUNTING • Chapter 3: SET THEORY • Chapter 4: MATHEMATICAL INDUCTIon • Chapter 5: PROPERTIES OF INTEGERS • Chapter 6: Relations and Functions • Chapter 7: Languages: finite state machines • Chapter 8: Graph Theory

  6. Grading • Midterm 30% • Final 40% • Project 20% • Attendance/Quiz 10%

More Related