The Carnegie Pulseabout the carnegie pulse | advertise | contact | subscriptions | join 
newsart & cultureopinionseventscourse schedule

My schedule
Most popular
View departments
View locations
View times

Find course by title:


15-354 Computational Discrete Mathematics

Department:Computer Science
Related URLs:

This course is about the computational aspects of some of the standard concepts of discrete mathematics (relations, functions, logic, graphs, algebra, automata), with emphasis on efficient algorithms. We begin with a brief introduction to computability and computational complexity. Other topics include: iteration, orbits and fixed points, order and equivalence relations, propositional logic and satisfiability testing, finite fields and shift register sequences, finite state machines, and cellular automata. Computational support for some of the material is available in the form of a Mathematica package.

  Popularity index
Rank for this semester:#0
Rank in this department:#0

  Students also scheduled
15-212 Principles of Programming
85-211 Cognitive Psychology
15-359 Special Topic: Probability and Comp...
15-113 Systems Skills in C
21-241 Matrix Algebra
73-100 Principles of Economics
15-213 Introduction to Computer Systems
15-410 Operating System Design and Impleme...
33-224 Stars, Galaxies and the Universe
36-225 Introduction to Probability and Sta...

  Spring 2005 times

No sections available for semester Spring 2005.

talkback to the pulse
No comments about this course have been posted, yet. Be the first to post!
Share your opinion on this course with other Pulse readers. Login below or register to begin posting.

Email address:

  (c) Copyright 2004 The Carnegie Pulse, Carnegie Mellon's first exclusively online student-run news source. campus mirror | RSS