Course description – The course is one of the most important building blocks of Computer Science. It teaches you how to think mathematically in terms of detailed proofs. The concepts taught in CS207 are central to the understanding of Computer Science and problem solving. Discrete structures is slightly different from the usual mathematics that students are used to. It involves rigorous proof techniques, theorems and results which are applicable to a wide variety of situations. The main topics include:
- Proofs and structures
- Counting and combinatorics
- Elements of graph theory
- Introduction to abstract algebra and number theory
Course pattern and logistics – There are 4 quizzes, a midsem and an endsem. The weightages depend on the instructor. Generally, quizzes are 7.5% each (25% overall), midsem is 35% and endsem is 40%. In the past 2 years, it has been seen that quizzes are slightly harder than the midsem and the endsem
Comments on the instructor – Professor Akshay S was the instructor for the course in Fall 2014 and 2015. He is an excellent instructor who has a brilliant understanding of the subject. The best part about him is that he is enthusiastic about the course and he actually wants the students to learn. He personally attends the tutorials and tries his best to ensure that each student is understanding the topic. Definitely, one of the best instructors our department has.
Who will find it interesting – Anyone who has interest in Mathematics and Computer Science will find the course interesting. The course offered by Prof. Akshay isn't open for non-CSE students. The non-CSE students can join the minor course offered separately. Note that this course is a bit heavy and demands your time. So, don't take this course if you are looking for a light course in which you can doze off during the lecture.
No comments:
Post a Comment