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

CSE2213 Mid 203

This document is an exam paper for the Discrete Mathematics course at United International University, detailing the structure and rules for the mid-term exam. It includes various questions on set theory, logical expressions, and mathematical proofs, requiring students to demonstrate their understanding of the subject. The total marks for the exam are 20, and the duration is one hour.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
9 views2 pages

CSE2213 Mid 203

This document is an exam paper for the Discrete Mathematics course at United International University, detailing the structure and rules for the mid-term exam. It includes various questions on set theory, logical expressions, and mathematical proofs, requiring students to demonstrate their understanding of the subject. The total marks for the exam are 20, and the duration is one hour.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

United International University (UIU)

Dept. of Computer Science & Engineering (CSE)


Mid Exam. : : Trimester: Fall 2020
Course Code: CSE 2213, Course Title: DISCRETE MATHEMATICS
Total Marks: 20 Duration: 1 hour
Answer all the questions. Figures are in the right-hand margin indicate full marks.
“Any examinee found adopting unfair means will be expelled from the trimester / program
as per UIU disciplinary rules.”
Question 1.
a) (i) Find the sets A and B if A-B = {1, 5, 7, 8}, B – A= {2, 10}, and A ˄ B = {3, 6, 9}. [2.5]

(ii) Find out the following:


 If A={1,2}, then |p(p(A × p(A)))|=?
 Let S={x∊ | x is a divisor of 40 and 10 and less than 11}, find p(S).

b) For the following figures (A,B,C,D,E), find out if the following statement is [0.5×5=2.5]
true/false. If false, explain the reason briefly.

(a) A has an inverse function


(b) B is a one to one function
(c) C is one to one and onto function
(d) D is a onto function
(e) E is a one to one function

Question 2:
a) Determine whether ((r → s) ˄ (s → t) ) → (r → t) is a tautology using sequence of [2]
logical equivalences law.

b) Translate the following English sentences into logical expression using predicate, [1.5 x 2 = 3]
quantifiers and logical connectives. Domain consists of all people.
P(x): x is a student of UIU
Q(x): x has learnt C and C++ programming
R(x): x is learning Python
(i) There is a student in UIU who hasn’t learnt C and C++ but is learning
Python.
(ii) It is not that every student in UIU has learnt C and C++ programming but
some UIU students are learning python.
Question 3:
a) Translate the following sentence into a logical expression. [1 x 2 = 2]

(i) You can be a member of UIU Programming Club only if you are a student of
UIU and you have been admitted into the CSE department.
(ii) A necessary condition for you have shown up on Interview is you got the job

Page 1 of 2
b) Determine the truth values of the following propositions. Here, the domain of each [1 x 3 = 3]
variable consists of all real numbers.
(i) ) )
(ii) x((-x+1) =x )
2 2

(iii) > 0)
Question 4:
a) Prove the following by using the principle of mathematical induction, n is a positive [3]
integer.
) ) )
b) Prove by contraposition, If n3 − 1 is even, then n is odd. [2]

Page 2 of 2

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy