Course Description
Course Aims and objectives
Course outlines
Text book and references
Prerequisite
Grading policy
Instructors and office hours
Syllabus
Time table
Lecture Notes
Attached Files
Previous Exams
Course Description
| This course is an introduction to the formal mathematical concepts of computer science for the beginning student and covers a wide variety of diverse topics that serve as the mathematical framework for the design and analysis of algorithms. Topics include elementary logic, set theory and sequences, induction and recursion, permutations and combinations, probability theory, relations and functions, tree structures, and an introduction to graph theory and finite state machines. |
Course Aims And Objective
| By the end of this course the student is expected to be able to ? Describe and integrate basic definitions and theorems concerning sets, functions, and relations, ? Use mathematical tools of logic and induction, ? Show the application of these tools to computer science, ? Create and understand a formal proof, ? Use combinations and probability theory required in the design and analysis of algorithms, and ? Create state and transition diagrams. ; |
Course Outline
| Fundamentals | |
| This part contains a miscellany of basic material in the course. | |
| Logic | |
| This part covers logic and related material, including methods of proof and mathematical induction. | |
| Counting | |
| This part deals with permutations, combinations, the pigeon-hole principle, elements of probability, and recurrence relations. | |
| Relation | |
| This part presents basic types and properties of relations, along with their representation as directed graph. | |
| Functions | |
| This part deals with the notion of a function and gives important examples of functions, including functions of special interest in computer science. | |
| Trees | |
| This part introduces directed and undirected trees along with applications of these ideas. | |
| Graphs and Finite-State Machines | |
| This part focuses on elementary graph theory and devoted to finite-state machines. | |
| Experiments in Discrete Mathematics | |
| This part gives a collection of experiments dealing with extensions or previews of topics in various parts of the course. |
Text book and references
| The Main Book | |
| Title | Discrete Mathematical Structures |
| Author(s) | B. Kolman , RC. Busby and |
| Edition | 6th Edition |
| Publisher | Prentice Hall, 2009 |
401101
Grading Policy
| Activity | Weight |
Instructors And Office Hours
| The Instructors of the Course | |
| Name: | عمر علي عوده شطناوي |
| Office Hours: | Sunday, Tuesday, Thursday: 10:30-11:30 ; Monday, Wednesday: 08:15-09:15 & 12:30-13:30 |
| Office Phone: | +962 2 6297000 ext. 3360 |
| Instrcutor Mail: | dromali@aabu.edu.jo |
Miscellaneous
Time Table
| Subject | Hours | |
| Sets | 3 | |
| Division in the Integer | 3 | |
| Propositions | 3 | |
| Conditional Statements | 3 | |
| Mathematical Induction | 3 | |
| Permutations | 3 | |
| Elements of Probability | 3 | |
| Relations | 3 | |
| Equivalence Relations | 3 | |
| Functions | 3 | |
| Labeled, Searching | 3 | |
| Euler | 3 | |
| Finite State Machine | 3 | |
| Experiments in Discrete Mathematics | 3 |
Lecture Notes
| Lecture Notes | ||
| 901200 | ||
| Discrete1.pdf | View | |
| Discrete4.pdf | View | |
| Discrete12.pdf | View | |
| Discrete1- Part2.pdf | View | |
| Discrete9-Part1.ppt | View | |
| Discrete11.ppt | View | |
| Discrete8.pdf | View | |
| Discrete1.pdf | View | |
| Discrete2.pdf | View | |
| Discrete10.pdf | View | |
| DM Syllabus-spring.pdf | View | |
| Discrete3.pdf | View | |
| Discrete7.pdf | View | |
| Discrete5.pdf | View | |
| Discrete2-1.pdf | View | |
| Discrete14 | ||
| part1.pdf | View | |
| Discrete14 | ||
| part2.pdf | View | |
| Discrete3 | ||
| Modified.pdf | View | |
| Discrete9-Part2.ppt | View | |
| Discrete6.pdf | View | |
| Discrete13.pdf | View | |
Previous Exams
| Previous Exams |