CIS 1910 - Discrete Structures in Computing I W (3-2) [0.50]

An introduction to discrete structures and formal methodologies used in computer science, including Boolean, prepositional and predicate logic, finite set theory, functions, relations, and proof techniques.

**Posted By :**Blink

**Posted On :**January 13, 2011

**Comment :**

Suprisingly, it was harder then 2910. The lectures seemed moreso material presentation then teaching. You'll have to take your learning into your own hands. Also, the textbook is invaluable.

**Recommendation Rating**

**Posted By :**Josh Gaber

**Posted On :**December 8, 2010

**Comment :**

This is an important course, since the theory learned is applicable to various computing tasks. Unfortunately, it is never explained where specifically those concepts can be applied. The course is also paced slowly at some points and too quickly in others. An effective professor can make this a great course, but an ineffective one can make it torturous.

**Recommendation Rating**

**Posted By :**Anonymous

**Posted On :**October 25, 2010

**Comment :**

This course is a math heavy course. It wasn't taught in the most effective way as I fell asleep during the class sometimes, or I got distracted easily with something else. Since its a requirement for BComp, its good to take. Otherwise, unless you are interested in an algebra-type course, it may not be the best course to take.

**Recommendation Rating**