University :Mansoura University |
Faculty :Faculty of Computers and Information |
Department :Computer Science |
|
| 1- Course data :- |
| | Code: | ريض 111 | | Course title: | Mathematics-1 | | Year/Level: | أولى القسم العام | | Program Title: | | | Specialization: | | | Teaching Hours: | Theoretical: | 3 | Tutorial: | 3 | Practical: | |
|
| 2- Course aims :- |
| - Increased capacity to express mathematical models for real problems.
- Improved background for important mathematical topics for CS students.
- Increased ability to learn new methods.
- Increased ability to design new algorithms.
- Increased ability for using mathematical software.
- Understanding the main mathematical topics which must be known for studying CS
courses such as Logic design, Software engineering, AI and Programming Language.
|
| 3- Course Learning Outcomes :- |
| |
| 4- Course contents :- |
| | No | Topics | Week |
|---|
| 1 | Functions | | | 2 | Algebraic Structures | | | 3 | The Counting Techniques | | | 4 | The Binomial Theorem and Generating Functions | | | 5 | Recurrence Relations | | | 6 | The Complex Numbers | | | 7 | Polynomials and Partial Fractions | | | 8 | Series Summation | | | 9 | Introduction to Linear Algebra | | | 10 | Propositions and Predicates | | | 11 | Methods of Proofs | | | 12 | Introduction to Sets Theory | | | 13 | Relations | |
|
|
| 5- Teaching and learning methods :- |
| | S | Method |
|---|
| Computer + Data Show + power point slides, | | Blackboard, | | Free Discussion | | Different Software |
|
|
| 6- Teaching and learning methods of disables :- |
| No data found. |
|
| 7- Student assessment :- |
| A. Timing |
| | No | Method | Week |
|---|
| 1 | Mid-Term exam | 14 | | 2 | Reports | 15 | | 3 | Oral | 15 |
|
| B. Degree |
| | No | Method | Degree |
|---|
| 1 | Mid_term examination | 10 | | 2 | Final_term examination | 75 | | 3 | Oral examination | 5 | | 4 | Practical examination | | | 5 | Semester work | 5 | | 6 | Other types of asessment | 5 | | Total | 100% |
|
|
| 8- List of books and references |
| | S | Item | Type |
|---|
| 1 | Ahmed E. Naghamish, "Discrete Mathematics for Computer Science", 2004. | | | 2 | Edgar G. Goodaire and Michael M. Parmenter, "Discrete Mathematics with Graph Theory", 1998. | | | 3 | A. Arnold and I. Guessarian, "Mathematics for Computer Science", 1996. | | | 4 | Albert D. Polimeni and H. Joseph Straight, "Foundations of Discrete Mathematics", 2nd Edition, 1990. | | | 5 | Steven Roman, "An Introduction to Discrete Mathematics", 2nd Edition, 1989. | | | 6 | Different Web Sites. | | | 7 | Different Periodicals. | |
|
|
| 9- Matrix of knowledge and skills of the course |
| | S | Content | Study week |
|---|
| Functions | | | Algebraic Structures | | | The Counting Techniques | | | The Binomial Theorem and Generating Functions | | | Recurrence Relations | | | The Complex Numbers | | | Polynomials and Partial Fractions | | | Series Summation | | | Introduction to Linear Algebra | | | Propositions and Predicates | | | Methods of Proofs | | | Introduction to Sets Theory | | | Relations | |
|
|
| Course Coordinator(s): - |
| - Ahmed El Hussien Mujahed
|
| Head of department: - |
| Tarek Tawfek Ahmed Hamza |
