Scribd
Upload
101 views

CS201 Mathematics For Computer Science I: Manindra Agrawal CS201: Lecture 1

This document outlines the syllabus for the CS201 Mathematics for Computer Science I course. The course will cover topics like sets, orders, proofs, counting, graph theory, and algebra over 14 weeks. Students will be assessed through midterm and final exams as well as assignments. Exams will be take-home and discussions are encouraged but copying is prohibited. The course includes weekly discussion sessions and exams will take place in October and December.

Uploaded by

Mohan Raghu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
101 views

CS201 Mathematics For Computer Science I: Manindra Agrawal CS201: Lecture 1

This document outlines the syllabus for the CS201 Mathematics for Computer Science I course. The course will cover topics like sets, orders, proofs, counting, graph theory, and algebra over 14 weeks. Students will be assessed through midterm and final exams as well as assignments. Exams will be take-home and discussions are encouraged but copying is prohibited. The course includes weekly discussion sessions and exams will take place in October and December.

Uploaded by

Mohan Raghu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 16

CS201

Mathematics for Computer Science I

Lecture 1

Manindra Agrawal CS201: Lecture 1 1 / 18


Instructor

Manindra Agrawal, Professor, Dept of CSE


Contact: [email protected]

Manindra Agrawal CS201: Lecture 1 3 / 18


Contents

Week 1-2: Sets, Orders, and Proofs


Sets, relations, functions, partial orders, equivalence
classes, proof techniques
Week 3-5: Counting
Permutations, combinations, binomial coefficients,
partitions, generating functions, inclusion-exclusion,
Ramsey theory
Week 6-7: Graph Theory
Degree, paths, cycles, trees, planar graphs
Week 8-14: Algebra
Groups, rings, fields, finite fields

Manindra Agrawal CS201: Lecture 1 4 / 18


Reference Books

Discrete mathematics and its applications, by Kenneth Rosen.


Discrete mathematics, by Norman Biggs.
Introduction to combinatorial mathematics, by Chung Liu.
Elementary number theory, by David Burton.

Manindra Agrawal CS201: Lecture 1 5 / 18


Grading

The course will have


Midsem, weightage 25%
Endsem, weightage 50%
Assignments, weightage 25%
80+% marks ⇒ A grade
20+% marks ⇒ D or higher grade

Manindra Agrawal CS201: Lecture 1 6 / 18


Exams

Exams will be take-home – no other good way to conduct them.


Discussion is encouraged, but no copying.
To ensure discussion, all students should form a group of size up to
three. Each group needs to submit only one answer.

Manindra Agrawal CS201: Lecture 1 7 / 18


Copying Policy

Any group caught copying in an assignment will get zero in that


assignment.
Any group caught copying in exams will get zero in that exam.

Manindra Agrawal CS201: Lecture 1 8 / 18


Schedule

Discussion hours on Mon-Thu at 12.00 hrs, and Fri at 17.00 hrs. First
one on Monday, September 7.
Midsem during Oct 12-18, 2020
Endsem during Dec 3-12, 2020

Manindra Agrawal CS201: Lecture 1 9 / 18


TAs

Dhanish Kumar, [email protected]


Ritesh Kumar, [email protected]
Banwari Lal, [email protected]
Mahesh Sreekumar Rajasree, [email protected]
Prateek Dwivedi, [email protected]

Manindra Agrawal CS201: Lecture 1 10 / 18


Sets

Sets are collections of objects.


It can be any collection:
I Collection of English alphabets
I Collection of students in this class
I Collection of countries in the world
I Collection of molecules in the universe
I Collection of objects satisfying any given property
Objects in a set are called elements of the set.

Manindra Agrawal CS201: Lecture 1 12 / 18


Sets

Sets are fundamental objects of mathematics.


I Every mathematical statement can be expressed as properties of a set.
I For example:
Every integer can be uniquely expressed as product of prime numbers
can be restated as:
No element repeats in the set of products of prime numbers and the
set equals the set of integers.

Manindra Agrawal CS201: Lecture 1 13 / 18


Sets

Every mathematical object can be viewed as a set:


I A geometric object, such as line, is viewed as the set of all points
making up the object.
I A mapping associating elements of one set to elements of another set
can also be viewed as a set. If f : A 7→ B is one such mapping then the
set representing f is:
{(a, f (a)) | a ∈ A}.

I Can numbers also be represented as a set?

Manindra Agrawal CS201: Lecture 1 14 / 18


Numbers as Sets

Represent number 0 as null set {}, also written as ∅.


Represent number 1 as set containing null set, that is, {∅}.
Represent number 2 as set containing null set and set representing 1,
that is, {∅, {∅}}.
And so on...
Negative numbers can also be represented in similar way.
Rational numbers can be represented as a set of two integers,
corresponding to numerator and denominator.
A real number can be represented as set of infinitely many rational
numbers converging to the real number.

Manindra Agrawal CS201: Lecture 1 15 / 18


Why?

Representing everything as sets allows for axiomatization of


mathematics.
I Axioms are a collection of basic assumptions from which all theorems
can be derived.
I The most popular axiomatization is called Zermalo-Fraenkel set theory,
named after its inventors.
I It has infinitely many axioms that can be grouped into nine groups.
I One of the axioms is Axiom of Regularity: every non-empty set x
contains an element y such that x ∩ y = ∅.
I Another is Axiom of Choice: given any set x whose every member is
non-empty, there exists a mapping f such that f (y ) ∈ y for every
y ∈ x.

Manindra Agrawal CS201: Lecture 1 16 / 18


Why?

Such aximatization lead to the famous Godel’s Incompleteness


Theorem which states that for every axiomatic system, there exist
statements which are true but not provable in the system.
Godel’s Second Incompleteness Theorem states that for any axiomatic
system that is reasonably powerful, its consistency cannot be proven
within the system unless it is inconsistent.

Manindra Agrawal CS201: Lecture 1 17 / 18


Why?

In addition, it provides a uniform framework to study mathematical


objects and their relationships.
Note that there are multiple ways of representing an object as a set.
We choose the one that is most convenient.
Often, the set representation is implicitly assumed, e.g., for numbers.

Manindra Agrawal CS201: Lecture 1 18 / 18

You might also like