Honors Applied Discrete Math

Computer Engineering 16H

Spring 2003

Instructor:
Kevin Karplus karplus@soe.ucsc.edu
There are no TAs for CMPE 16H, but you may use the office hours and discussion sections of the CMPE 16 TAs if you need extra help.
Lecture times:
MWF 12:30-1:40 Natural Sciences Annex 103

Note: for the first day of class (Wed. April 2), please go to the CMPE 16 class at the same time in Baskin Engineering 152.

Office Hours:
Wed. 10:00-11:30 a.m.
Newsgroup:
ucsc.class.cmpe016
Textbook:
Kenneth H. Rosen Discrete Math and Its Applications 5th edition, McGraw Hill, 2003. (I'm sorry, but because homework problem and example numbers will differ, it will not be feasible to use older editions, even though the content is not substantially different. There was substantial rearrangement and new material for the fifth edition, so section numbers no longer correspond.)

What is Applied Discrete Math?

"Discrete math" refers to many different branches of mathematics (logic, naive set theory, number theory, group theory, graph theory, combinatorics, ...). Excluded are the fields that rely on "continuity" and "limits" (such as calculus, real numbers, complex numbers, ...). Because "discrete math" covers so much of mathematics, we can only cover a small fraction of it in this course.

For this course, we have selected a number of topics that are particularly useful to computer scientists and computer engineers. The key topics are listed in the extended description of the course that we prepared for our ABET accreditation process. Perhaps the most important and difficult concept in the course is the concept of mathematical induction, which is the foundation for computer science in the same way that calculus is the foundation for physics.

I think that the topics we have selected are some of the most fun ones in all of mathematics. I was originally (since I was about 10) planning to be a pure mathematician, and it wasn't until I was in grad school in mathematics that I found out that all the fun math (graph theory and combinatorics, which were what I was then interested in) was being done in computer science departments, and I switched departments after getting an M.S. in math. Over the years, I have become more and more applied (having gotten into computer music, then VLSI Design, then CAD for VLSI, and now protein-structure prediction), but I still find these branches of mathematics a lot of fun.

What is the difference between 16 and 16H?

Both CMPE 16 and CMPE 16H cover the same essential topics and use the same text, but CMPE 16H will go into a bit more depth and will cover a few topics not covered in 16. We may end up using the same exams for both 16 and 16H, in which case the extra material will appear only in the homework and not in the exams.

The main difference between 16 and 16H will be in the teaching style. For 16H, I want the students who are really interested in the material, who like math and proofs. I will be expecting students to come to class having already read the relevant section of the book and having already tried some of the homework problems.

My job will not be to provide canned lectures on the things I expect students to need instruction on, but to help students learn to solve problems. To do this I'll be doing "live-action math", solving problems and working through examples on the fly at student request. This will allow us to concentrate on the problems that cause students difficulty and to look more at problem-solving techniques.

There are some musings about my teaching style for this course that may be of interest to students in the class.

This style of course is not for everyone---if you don't have the motivation and discipline to read the book before class, you won't be able to ask useful questions. If you want polished presentations from which you can take clean notes, my "live-action math" may seem too scattered. On the other hand, if you want to learn how to think about these problems, rather than just seeing polished solutions that develop beautifully as if by magic, the teaching technique may work quite well.

How do I register for 16H?

Officially, 16H is an "interview-only" class. We won't actually have interviews---instead we'll have an application form for you to fill out on the first day of class (in the CMPE 16 classroom, not the CMPE 16H classroom). The form will ask for your name, your e-mail, your previous math experience, and possibly a few other questions.

Between the first and second day of class, I'll review the applications and send the course number to those students who have been permitted to enroll in 16H. We'll be relying heavily on student self-selection to choose who gets into CMPE 16H.


Academic Integrity

I hate to have to say this in an honors class, but everything you turn in with your name on it should be your own work. Claiming someone else's work as your own is an unforgivable academic sin. If you get help from someone else (even the TA or the professor), put an acknowledgement in writing on the paper you turn in. We won't penalize you for collaborative work (though we may ask you to change the amount of collaboration you do), but we will strongly penalize any copying or unacknowledged collaboration.

If you get caught cheating in this class, you will fail the class, and you will be unable to get honors in any School of Engineering major. If you get caught a second time, you will be disqualified from any School of Engineering major. All the faculty in the School of Engineering are quite intolerant of cheating and will treat even minor offenses very seriously.


Tentative Schedule

On April 14 and April 16, Kevin Karplus will be out of town. Please attend Patrick Tantalo's lectures for CMPE 16 on those days in Baskin Engineering 152.

The following table gives the approximate sections of Discrete Math and Its Applications that I hope to cover in each day's class. If we go a little faster, we will be able to cover some other sections as well (perhaps 6.3-6.6, 7.4, 8.1-8.2, or 9.1-9.2)
MondayWednesdayFriday
xxx Apr 2 (attend 16) Apr 4 (1.1-1.2)
Apr 7 (1.2-1.3, 10.1) Apr 9 (10.2-10.3) Apr 11 (10.4)
Apr 14 (attend 16) Apr 16 (attend 16) Apr 18 (1.4-1.6)
Apr 21 (1.6-1.8) Apr 23 (2.4) Apr 25 (3.1-3.2)
Apr 28 (3.2) Apr 30 (3.3) May 2 (3.3)
May 5 (3.4) May 7 (3.6) May (4.1-4.2)
May 12 (4.2-4.3) May 14 MIDTERM May 16 (4.3-4.4)
May 19 (4.5) May 21 (5.1-5.2) May 23 (5.2-5.3)
xxx May 28 (6.1) May 30 (6.2)
Jun 2 (7.1-7.2) Jun 4 (7.2-7.3) Jun 6 To be determined.
Homework assignments will be on a separate page. Stem-and-leaf plots of homework scores


slug icon to go to School of Engineering home page SoE home     UCSC Bioinformatics Home Page     Karplus's CMPE16/16H home page    

Questions about page content should be directed to

Kevin Karplus
Computer Engineering
University of California, Santa Cruz
Santa Cruz, CA 95064
USA
karplus@soe.ucsc.edu
1-831-459-4250