0% found this document useful (0 votes)
9 views8 pages

Midterm 2020

The document appears to be a midterm exam for a discrete mathematics course. It contains 5 problems assessing topics like propositional logic, sets, algorithms, cryptography, and consists of 40 total points.

Uploaded by

Jahongir Azzamov
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
0% found this document useful (0 votes)
9 views8 pages

Midterm 2020

The document appears to be a midterm exam for a discrete mathematics course. It contains 5 problems assessing topics like propositional logic, sets, algorithms, cryptography, and consists of 40 total points.

Uploaded by

Jahongir Azzamov
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
Download as pdf or txt
You are on page 1/ 8

–1 POINTS FOR EACH FIELD LEFT EMPTY OR FILLED WRONG

FIRST NAME: LAST NAME:

ID NUMBER: GROUP/SECTION:

STUDENT SIGNATURE: ROOM NUMBER

MIDTERM EXAMINATION

DISCRETE MATHEMATICS MSC 2050


COURSE NAME: COURSE NUMBER:

1 HOUR 30 MINUTES
EXAMINATION DURATION:

ADDITIONAL MATERIALS
ALLOWED TO BE USED: CALCULATOR

(1) FOLLOW ANY INSTRUCTIONS GIVEN BY PROCTORS.


COMPLIANCE IS REQUIRED! DO NOT ARGUE WITH A PROCTOR,
YOU GET "F" FOR MISSBEHAVING + other possible complications.
SPECIAL INSTRUCTIONS
(2) ONCE YOU ARE ALLOWED TO OPEN THE EXAMINATION BOOKLET,
YOU MUST PUT ONLY YOUR SIGNATURE ON EVERY ODD PAGE
(do NOT write your name/ID number inside the examination paper)

• Final answers must be written by only blue or black, non-erasable pen.


• Do NOT use highlighters or correction pen.

• IUT’s Examination Rules and Regulations apply.

Do NOT open the examination paper until directed to do so!


1. (8 points) Consider a proposition ¬(p → ¬q).
(a) (2 points) Construct the truth table of this proposition.
(b) (1 point) Using the truth table or otherwise show that ¬(p → ¬q) = p ∧ q.
(c) (3 points) Using the notations
s=“The diagnostic message is stored in the buffer”
r=“The diagnostic message is re-transmitted”
Translate the following propositions into logical expressions:
A) “ It is not the case that if the diagnostic message is stored in the buffer, then it is re-transmitted.”
B) “The diagnostic message is stored in the buffer and it is not re-transmitted.”
C) “The diagnostic message is not stored in the buffer only if it is re-transmitted.”
(d) (2 points) Determine whether these system specifications are consistent:
It is not the case that if the diagnostic message is stored in the buffer, then it is re-transmitted. The
diagnostic message is stored in the buffer and it is not re-transmitted. The diagnostic message is not
stored in the buffer only if it is re-transmitted.
NOTE: there are two equivalent system specifications.

DISCRETE Mathematics MSC 2050 Mid-term exam - Page 2 of 8 8th week of Fall 2019
STUDENT’s SIGNATURE:

DISCRETE Mathematics MSC 2050 Mid-term exam - Page 3 of 8 8th week of Fall 2019
2. (8 points)
(a) (2 points) Translate the following statement to an English sentence

∀m∀n∃p((m < p) ∧ (p < n))

(b) (2 points) Show that the statement in (a) is false over the domain of real numbers.
(c) (2 points) Change the statement in (a) (restrict the domain) so that the new statement is true over the
domain of real numbers.
(d) (2 points) Change the statement in (a) (restrict the domain) so that the new statement is true over the
domain of integers.

DISCRETE Mathematics MSC 2050 Mid-term exam - Page 4 of 8 8th week of Fall 2019
STUDENT’s SIGNATURE:

3. (10 points) Consider the sets

A = {−1, 2, 4, 6}

B = {n | n is integer and − 2 ≤ n ≤ 5}.

(a) (1 point) Find A ∪ B and B ∩ A.


(b) (1 point) Find A − B and B − A.
(c) (1 point) Find |A| and |B|.
(d) (1 point) Find P(A)
(e) (1 point) Construct any function from A to B
(f) (1 point) Find domain and range of the function in (e)
(g) (1 point) Find codomain of the function in (e)
(h) (1 point) Is the function in (e) one-to-one? Justify.
(i) (1 point) Is the function in (e) onto? Justify.
(j) (1 point) Is the function in (e) bijection? Justify.

DISCRETE Mathematics MSC 2050 Mid-term exam - Page 5 of 8 8th week of Fall 2019
4. (6 points) (a) (4 points) Write an algorithm in pseudocode, which counts number of 1s in a given bit string
of length n.
For example, in the case when the bit string is 10010 your algorithm must return 2.
(b) (2 points) Find the worst and average time complexities of your algorithm from (a).

DISCRETE Mathematics MSC 2050 Mid-term exam - Page 6 of 8 8th week of Fall 2019
STUDENT’s SIGNATURE:

5. (8 points) Consider the affine cypher on the English alphabet given by the encryption function e() =
(3 + 1) mod 26.
(a) (2 points) Find the inverse of 3 modulo 26.
(b) (2 points) Find the decryption function.
(c) (3 point) Decrypt the encrypted message “ORGWZOT ZD ZLURDDZEIN”. The alphabet below may be
helpful.

(d) (1 points) Explain why the decryption is not possible in case when the encryption function is e() =
(13 + 2) mod 26.

DISCRETE Mathematics MSC 2050 Mid-term exam - Page 7 of 8 8th week of Fall 2019
Do NOT fill P.1 P.2 P.3 P.4 P.5 Total
max points 8 8 10 6 8 40
your
score

DISCRETE Mathematics MSC 2050 Mid-term exam - Page 8 of 8 8th week of Fall 2019

You might also like