
Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
The fall 1994 examination for the discrete structures course. It includes multiple-choice questions covering topics such as set theory, logic, and number theory.
Typology: Exams
1 / 1
This page cannot be seen from the preview
Don't miss anything!

T F The negation of the statement All students who take CMSC 203 and pass will get a Computer Science degree is the statement All students who take CMSC 203 and pass will not get a Computer Science Degree. T F The statements If I pass CMSC 203, then I will get a good job and If I do not get a good job, then I did not pass CMSC 203 are logically equivalent.
T F The set of the integers is partitioned by the set of positive integers and the set of negative integers.
T F If n and d are positive integers, then n = d(n div d) + (n mod d).
Theorem 2: If any integer n can be expressed as 3k, 3k + 1, or 3k + 2, then the product of three con- secutive integers is divisible by 3..
Theorem 4: For all integers a,b,c, and d, if a | (b + c) and a | d, then a | (b + c + d).
126 102