Capital University of Science and Technology

Department of Computer Science

SE2053- Discrete Structures
Mid Exam (BS SE)
Semester: Spring 2021 Max Marks:20
Date: May 20th , 2020 Time: 90 Min
Instructors: Ms. Faria Nazir
Instructions:
There are TWO questions in this paper on TWO pages.
This exam carries 20% weightage towards the final evaluation.
This is an OPEN BOOK, OPEN NOTES and OPEN STANDARDS PAPER.
Assume reasonable data where required.
Write your name and reg no. on each page.
Solve your exams on separate sheets and attach snapshots on word/pdf.
Save you file with you registration number.

Name: Reg. No.

Part-I (CLO-1)
Question No. 1. (2.5*4=10)

I. Show that (p ∧ q) → (p → q) is tautology using laws of equivalences.

II. Express the negation of these propositions using quantifiers, and then express the
negation in English
a) Some Swedish movies are not serious
b) All students in this class have a
good attitude.
III. Find the value of following summation.

IV. Determine whether each of these functions from Z to Z

is one-to-one or not and why?
a) f(n) = n + 1
b) f(n)=

CS/SE2053 Discrete Structures Page 1 of 2

 Part-II (CLO-2)

Question No. 2. (CLO-2) (5+5=10)

I. Show that the following is a valid argument:

All humans when they are alive, work. All humans that don’t alive, are dead. All dead
humans do not eat food. Hassan is not a working human. Therefore, Hassan does not
eat food
Hint: Needed Predicates A(𝑥) = "𝑥 Alive" W (𝑥) = "𝑥 works " D (𝑥) = "𝑥 Dead " F(𝑥)
= "𝑥 eat food"

II. Suppose x ∈ Z. If  7x+9 is even, then x is odd. Proof the following using
a) Contrapositive
b) Direct proof

CS/SE2053 Discrete Structures Page 2 of 2