Discrete Structures

Computer Science 280
Spring 2005


Staff | Office Hours | Homework | Exams | Schedule | Course Description

Announcements

We use C(n,2) (n choose 2) coins each has probability p of being head, and each coin independent. There is a coin associated with every possible edge. For any pair of nodes v and w, we look at the corresponding coin , and add edge (v,w) if the coin is Head, otherwise we have no edge connecting v and w.

Staff

CS 280 STAFF Name Email (append .cornell.edu) Office
Instructor

va Tardos

eva@cs 5153 Upson Hall
TAs Kevin Canini krc25  
Tom Church  tfc23  
John Roberts jwr23  
Hari Nathan hsn4  
Joel Ossher jpo5  
Zachary Scherr  zls2  
Yogi Sharma yogi@cs 5132 Upson Hall

Textbook

Office Hours

CS280 
Office Hours

Monday Tuesday Wednesday Thursday Friday
10:00a-11:00a          
         
         
         
11:00a-12:00p         Eva Tardos
(5153 Upson)
    Yogi Sharma
(328A Upson)
 
     
     
12:00p-01:00p        
    Joel Ossher
(328A Upson)
   
       
       
01:00p-02:00p   Kevin Canini
(328C Upson)
   
Lecture
(KL B11)
Lecture
(KL B11)
  Lecture
(KL B11)
 
 
02:00p-03:00p Tom Church
(328C Upson)
 
       
Eva Tardos
(5153 Upson)
     
     
03:00p-04:00p        
       
  John Roberts
(328C Upson)
     
       
04:00p-05:00p        
       
Zachary Scherr
(328C Upson)
Hari Nathan
(328C Upson)
     
     
05:00p-06:00p      
     
         
         

CS280 
Office Hours

Monday Tuesday Wednesday Thursday Friday

Homework Information

Exam Information

There will be two prelims and one final in the course. The dates follow.

Grading

Course Description

Covers mathematical aspects of programming and computing. Topics will be chosen from the following: mathematical induction; logical proof; propositional and predicate calculus; combinatorics and discrete mathematics covering manipulation of sums, recurrence relations, and generating-function techniques; basic probability covering random variables, independence, expectation; basic number theory; sets, functions, and relations; partially ordered sets; graphs, algebraic structures.

 


Staff | Office Hours | Homework | Exams | Schedule | Course Description | Comments on PSs