UMD CMSC 250 - Homework #3 (2 pages)

Previewing page 1 of 2 page document View the full content.
View Full Document

Homework #3



Previewing page 1 of actual document.

View the full content.
View Full Document
View Full Document

Homework #3

173 views

Other


Pages:
2
School:
University of Maryland, College Park
Course:
Cmsc 250 - Discrete Structures

Unformatted text preview:

CMSC 250 0201 0202 Homework 3 Fall 2005 Due Wed Sept 21 at the beginning of your discussion section You must write the solutions to the problems single sided on your own lined paper with all sheets stapled together and with all answers written in sequential order or you will lose points 1 Construct a logical expression that is equivalent to the following circuit P NOT AND Q OR X OR R NOT a P NOT OR Q AND NOT X R NOT b 2 For each of the following input signals a P 1 Q 0 R 1 and b P 0 Q 0 R 1 find the output X for each of the circuits given in the figures below P Q AND NOT OR AND R P NOT Q R OR AND NOT 1 NOT 3 Convert the following numbers from one base to another a 4510 2 16 b DEAB16 2 c 11011012 10 d 51410 4 Find the following 2 0011111 110110 010011001100 11011011101 5 For each of the following let W x y mean that x has visited y where the universe of discourse for x is the set of all students in your school P for people and the universe of discourse for y is the set of all Web sites S for sites For ease of writing assume all first names are unique among the members of this domain Express each of the following statements in a simple English sentence a W Sarah www att com b x P W x www imdb org c y S W Jose y d y S W Joe y W T om y e y S z P y David W David z W y z f x P y P z S x y W x z W y z 6 Let F x y be the statement x can fool y where the universe of discourse for both is the set of all people in the world P for people Use quantifiers to express each of the following statements a Everybody can fool Fred b Evelyn can fool everybody c Everybody can fool somebody d There is no one who can fool everybody e Everyone can be fooled by somebody f No one can fool both Fred and Jerry g Nancy can fool exactly two people h There is exactly one person whom everybody can fool i No one can fool him herself j There is someone who can fool exactly one person besides himself or herself 7 Explain why x U P x f orallx U Q x is not equivalent to x U P x Q x 2



View Full Document

Access the best Study Guides, Lecture Notes and Practice Exams

Loading Unlocking...
Login

Join to view Homework #3 and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Homework #3 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?