
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
This exam paper is very easy to understand and very helpful to built a concept about the foundation of computers and discrete structures.The key points in these exam are:Onto Function, Non-Empty Subsets, Range and Image, Densities of Binary String, Finite-Length Binary Strings, Conditional Statement, Laws of Logic, Rules of Inference, Properties of Sets, Example of Modus Tollens, Valid Argument
Typology: Exams
1 / 1
This page cannot be seen from the preview
Don't miss anything!

Fall 2010 Examination 1 CMSC 203
T F If Σ = {0, 1} , then |Σ^6 | = 2^6. T F The negation of an implication is a disjunction. T F The densities of a binary string and its negation are equal. T F H(00001111, 10101010) = 4. T F The converse and inverse of a conditional statement are logically equivalent. T F The set of all finite-length binary strings is countable.