Opening the iTunes Store.If iTunes doesn't open, click the iTunes application icon in your Dock or on your Windows desktop.Progress Indicator
Opening Apple Books.If Apple Books doesn't open, click the Books app in your Dock.Progress Indicator

iTunes is the world's easiest way to organize and add to your digital media collection.

We are unable to find iTunes on your computer. To download from the iTunes Store, get iTunes now.

Already have iTunes? Click I Have iTunes to open it now.

I Have iTunes

Discrete Structures

by Pepperdine University

This course material is only available in the iTunes U app on iPhone or iPad.

Course Description

Catalog description
Application of formal methods to discrete analysis—mathematical induction, the correctness of algorithms, relations and functions, combinatorics, analysis of algorithms. Application of formal methods to the modeling of discrete structures of computer science—graphs, binary trees.

As this course is a continuation of Math 220 the objective is the same. Specifically, the philosophy of this course is expressed well by Robin Milner, the 1992 Turing Award winner, in an interview printed in Communications of the ACM, January, 1993:

The best thing to do, whether you’re of a theoretical or a practical bent, is to treat the subject as neither purely theoretical or purely practical. The worst thing you can do is to follow your bent, which would probably be on one of those sides, and ignore the other side. The whole richness of the subject comes from the interplay between practice and theory.

Many will pretty soon find themselves ignoring one of those components because they will naturally become very applications oriented or very basic-research oriented. But the longer we can keep the link between the theoretical frontier and the practical frontier, the better the whole thing will be. We should encourage the next generation to respect that link. If you don’t respect that, you lose a whole degree of freedom in the interest of the subject.

Both mathematics and computer science are based on logic as a tool to establish truth through various techniques of proof. The objective of this course is for us to learn formal logic as a theoretical foundation and its application to topics in discrete mathematics and computer science.

Customer Reviews

Good Class

This class is a second semester course in formal logic for computer science. If you haven’t checked out the previous semester, you should for context on this course (even if you feel comfortable with the material, it might be presented in a different style than you are used to). It is also available on iTunes U.

This class does a good job of presenting important theoretical material in a way that understandable. Visual and real world metaphors are used to describe concepts so that students can reason about the problems in a deductive way.

Discrete Structures
View in iTunes

Customer Ratings