Math Methods

(COSC 030) Spring 2015

 PROFESSOR:
Mahendran Velauthapillai, Ph.D.
Department of Computer Science           Phone: 202 687-5936 (Office)
331 St.Mary's Building                     
mahe@cs.georgetown.edu
                                  

OFFICE HOURS:

M,W 3.30 to 4.30 PM  or by appointment.


TEACHING ASSISTANTS:
   


Name
Office Hours
 
Location 
  
Email


Julian Lee
TR 3.15-4:445PM 
St. Mary's 330
jjl84@georgetown.edu 
Casandra Schwartz
MW 12:30-1:45
F 40:45-1:45
St. Mary's 330
cls247@georgetown.edu
Jullie Hocket
TW 5-7PM
St. Mary's 330
jlh279@georgetown.edu



Notes:
1) 1-07
2) 1-12
3) 1-14
4) 1-21
5) 1-27
6) 1-28



TEXT:

   

      

 
      
 Discrete Mathematics and its Applications      
 
 Kenneth H. Rosen (7th Ed) (required) 
   
   

      
Publisher
 
McGraw Hill
   
   

      
ISBN: 
 
 978-0-07-338309-5 
   
 
SYNOPSIS:
This course, designed to be taken concurrently with COSC 052, covers 
mathematical tools and principles that are valuable to the computer 
scientist. Topics are generally in the domain of discrete, rather 
than continuous, mathematics, and include, propositional and predicate logic; 
mathematical proofs, including induction; counting and basic probability 
theory; logarithmic and exponential functions; elementary graph theory; 
and "Big-O" notation and asymptotics.


Notes:

COURSE REQUIREMENTS:
   
   Home Work:   50% of your final grade
   Mid-Term 1:  10% of your final grade 
   Mid-Term 2:  15% of your final grade 
   Finals:      25% of your final grade 


IMPORTANT DATES:

 Mid-Term 1:   Feb 11  (W) 
 Mid-Term 2:   March 25 (W)
 Finals:       May 9 (Sat) 9:00-11:00 AM 


COURSE SCHEDULE:




Week
Topic 
 
Reading 
 
 
 1 
 
 Logic and Proofs 
 
 Chap 1 
 
 2 
 
 Sets and  Fuctions  
 
 Chap 2 
 
 3 
 
 Algorithms  
 
 Chap 3 
 
 4 
 
 Number Theory  
 
 Chap 4 
 
 5 
 
 Induction and Recursion  
 
 Chap 5 
 
 6 
 
 Induction and Recursion  
 
 Chap 5 
 
 7 
 
 Counting 
 
 Chap 6 
 
 8 
 
 Probability 
 
 Chap 7 
 
 9 
 
 Recurence Relations
 
 Chap 8 
 
 10 
 
 Relations
 
 Chap 9 
 
 11 
 
 Graphs
 
 Chap 10 
 
 12 
 
 Trees 
 
 Chap 11 
 
 13 
 
 Boolean Algebra 
 
 Chap 12 
 
 14 
 
 Boolean Algebra 
 
 Chap 12 
 
 15 
 
 Modeling and Computation 
 
 Chap 13 


HOME WORK:


>>>>


HW
Given
 
Due 
  
Points
  
 Problem 
  
 Sol 
 
 
1
1/7
1/12
10
Page 15: #28, 36
hw1sol 
 
2
1/12
1/14
10
Page 53: #12, 13
hw2sol 
 
3
1/14
1/21
20
Page 91: #6,11,18,38
hw3sol
 
4
1/21
1/26
20
Page 108 #9,30,34,38 
hw4sol 
 
5
1/26
1/28
20
Page 154 #48,52, 54,76 
hwxsol 
 
6
1/28
2/02
20
Page 167; #4,6, 12, 18  
hwxsol 



COURSE POLICY:

1. All  Home works should be turned in at the 
   beginning of the class.  Keep the graded home works
   until the semester is over. Do NOT discard your home works.

2. Late Home work will  NOT  be accepted. 
   If you cannot make it to class to turn in your home work
   its your responsibility to turn it in  prior 
   to the due date. 

3. Makeups and extensions will be given only for medical reasons.

                                   

COURSE ETHICS:
You can discuss the questions with your classmates, but do not copy the
solutions.