Final: on Wednesday, May 9, 5:05 – 7:05 pm in Birge 145.
Topics: The final will be mildly cumulative with at least 90% of the problems coming from Chapters 6.5, 7.1, 188.8.131.52, 10.1,2,3,5, 11,1,2 in Rosen
Review: will be on 5/8, 4 – 6 pm in 1121 Humanities. Tejas will go over the review problems.
6.5 15, 33
7.1 25, 33
9.1 41, 42
9.3 13, 31
9.4 9, 27
9.5 25, 43
10.2 27, 41
10.3 32, 57
10.5 7, 46
11.1 17, 23
11.2 7, 23
You will be allowed to bring a 5x7 note card with formulas to the exam.
Study recommendation: do about two odd numbered problems from each section covered on the exam. The back of the book has answers to these problems.
If you find that you do not understand the methods, go through the worked examples in the text.
If you need help:
· use Piazza
· see any of the TAs or me during office hours.
Names and Sections
720 Van Vleck
Fr 12:30 – 2:30 pm
101-25 Van Vleck
MF 11:55 – 12:55 pm
Muni Sreenivas Pidy
101-24 Van Vleck
TTh 4 – 5 pm
518 Van Vleck
T 1 - 2 pm, W 3:30 - 4:30 pm
Tu Th 2:30 – 3:45 pm
B130 Van Vleck
Text: Kenneth H. Rosen, Discrete Mathematics and its Applications, seventh Edition, ISBN 978-0-07-338309-5.
As the title Introduction to Discrete Mathematics suggests, Math 240 is a course on the fundamentals of discrete (as opposed to continuous) mathematics. It is a requirement for the BS degree program in Computer Engineering offered by the ECE department. The course is a foundational math course for this program and is meant to be taken early in the program; it is also a good foundation for higher mathematics courses. You will be introduced to many new concepts and topics, and we shall not spend a long time on any one of them. This course is intended for students in Computer Science and Electrical and Computer Engineering
Math 221 or Math 217
Credit Hours: 3
This means that you should expect to put in an extra 6 hours per week (aside from class time) on average working on this course. This includes:
- reading the text
- doing homework problems
- preparing for exams
- getting help, when necessary
Logic, proofs (chapter 1).
Sets, functions, sequences, sums matrices (chapter 2).
Algorithms (chapter 3).
Number Theory (chapter 4 except 4.6).
Induction and Recursion (chapter 5.).
Counting (chapter 6, except 6.6).
Discrete Probability (chapter 7.1).
Relations (chapter 9)
Graphs (chapter 10.1, 2, 3, 5).
Trees (chapter 11.1, 2).
You will be able to achieve a total of 200 points in this class:
There will be two in-class midterms and one cumulative final. The scores will be curved. The curve for the course grade will NOT be determined until after the final exam. You will need to participate in the final to pass the class. The time and location of the final are set by the university and cannot be changed. Do NOT make arrangements to leave town until after the final time.
Bring your student ID to each exam. Calculators are very useful in practical problems, but they can compensate for a lack of basic understanding. Therefore, calculator and other computing devices will not be allowed on exams in this course. There will be no make ups for exams. Please, contact your lecturer, if you have to miss an exam.
Homework problems will be on the syllabus page. Solutions must be submitted in Gradescope. Teams of 2 or at most 3 students may hand in one joint effort.
Making the most of your Math class:
attend the lectures and the discussion sections. In many years of teaching I found that nonattendance almost always goes along with poor grades.
start working on the homework assignments EARLY. If you cannot do a problem, ask for help. Hand in your attempts. Consider the homework as practice for the exams.
if you need help, don't delay. Go to see your TA or Lecturer. If you wait until almost the end of the semester, it is too late to make a significant impact on the grade.
If you are having difficulty, first talk to your TA or Lecturer. If you cannot come to the scheduled office hours, make an appointment to see either at a different time. Another place you can get help:
The math Lab is an especially good place to go if you have a quick homework question; more detailed questions are probably better directed to one of the TAs.
Location: B277 Van Vleck Hall (across from the Mathematics Library)
Hours: Monday through Thursday, 3:30 - 8:30 pm, and Sunday 3:30 - 6:50 pm.
Dates: starting the second week of classes (usually), through the end of the semester.
The Mathematics Department publishes a list of Mathematics graduate students who are willing to tutor students; copies are available on the second floor of Van Vleck Hall, next to the elevators.
Location: Varies; many tutors will meet in Van Vleck Hall: some will meet off-campus.
Cost: Fees vary from tutor to tutor; typical costs are $20 to $30 per hour.