Logistics :
- 4~5 quizzes : 30%, midsem - 25%, endsem - 40%, tutorial/class participation - 5%.
- Topics covered : Mathematical proofs and structures, counting and combinatorics, intro to graph theory, elements of number theory, elements of group theory and abstract algebra.
- Core course for CS department students. Those who wanted to take it as elective were asked to drop this course by the instructor.
Comments on course :
- Discrete Structures is a very useful and fundamental course for those who like the theoretical side of computer science.
- Much emphasis is given to proving the correctness of solutions rather than just finding the answer in exams.
- Concise and clear lecture slides are provided which makes the preparation for exams a bit easier.
- The key to doing well in this course is practice.
Comments on instructor :
- Very friendly, energetic and easily approachable. Gives good problem sets for tutorials and practice. Classes are interactive and worth attending.
- Sets lengthy question papers and expects complete and clear proof for full credit. Time management during examinations for this course is a must to score well.
References :
- Discrete.Mathematics.and.Its.Applications by Kenneth Rosen
- Introduction to Graph Theory by Douglas West
No comments:
Post a Comment