Scribd
Upload
51 views2 pages

Capital University of Science and Technology

This document is the midterm exam for a discrete structures course taken in the spring 2021 semester. It contains 4 questions assessing different course learning outcomes. Question 1 has two parts assessing propositional logic and rule inferences. Question 2 has two parts assessing propositional logic proofs. Question 3 has three parts assessing sets, functions, and recurrence relations. Question 4 has three parts assessing recurrence relations, filling a table for a recurrence relation problem, and evaluating a summation. The exam is out of a total of 40 marks and students are given 90 minutes to complete it.

Uploaded by

faizagardazi
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
51 views2 pages

Capital University of Science and Technology

This document is the midterm exam for a discrete structures course taken in the spring 2021 semester. It contains 4 questions assessing different course learning outcomes. Question 1 has two parts assessing propositional logic and rule inferences. Question 2 has two parts assessing propositional logic proofs. Question 3 has three parts assessing sets, functions, and recurrence relations. Question 4 has three parts assessing recurrence relations, filling a table for a recurrence relation problem, and evaluating a summation. The exam is out of a total of 40 marks and students are given 90 minutes to complete it.

Uploaded by

faizagardazi
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

Capital University of Science and

Technology
Department of Computer Science
CS2053– Discrete Structures
Midterm Exam (BS CS)
Semester: Spring 2021 Max Marks: 40
Date: May 22, 2021 Time: 90 Min
Instructors: Mr. Awais Haider (S4)
Instructions:
 There are FOUR questions on TWO pages. Attempt all questions.
 This exam carries 20% weight towards course evaluation.

Name: Reg. No.

PART I

Question No. 1. (CLO – 1) (5+5= 10)

I. If I do not like school or I want to eat fish then my country is beautiful. If my


country is beautiful then it has four provinces or there are many jobs for students. My
country has not six provinces and not four oceans. If it has not four oceans then there
is no job for students. What is the conclusion of this story.

II. You have these premises a→b,~c∨d, a∨c,~(~b→d). drive a valid conclusion
using rule of inferences.

Question No. 2. (CLO – 1) (5+5=10)

I. Prove that If x and y are real positive integers and √ xy is not equal
2 x +4 y−2 y
then x≠ y
4

II. To prove (p∧(p→q)∧(s∨r)∧(r→~q))→(s∨t) without using truth table.

CS2053 Discrete Structures Page 1 of 2


PART II

Question No. 3. (CLO – 2) (4+2+4=10)

I. How many set of functions can be form with domain ($,&,%) and co-domain
(p,q,r). Write all set of functions and also their names.
1 0
II. Find A[n] for all positive integers n. if A=
1 1
3
p +2 p+ 7
III. Let f (p) = ⌈ ⌉ Find f (x) if
2
a) x = {your date of birth}. b) x = {your registration number digit}.
Note: for example your date of birth is 12-04-1990 so x={1,2,0,4,1,9,9,0}, and if your
registration number is BCS 203111 then x={2,0,3,1,1,1}

Question No. 4. (CLO – 2) (3+3+4=10)

I. Let us consider a sequence 0, 1, 2, 5, 12, 29, 70, 169, 408,…


Drive it’s recurrence relation
II. Considered a recurrence relation an+1=an+bn, n≥1
where n is no of months. Let an and bn denote the number of pairs of adult and baby pigeon
respectively on the first day of the nth month. Each adult pair on the first day of the nth
month is still an adult pair on first day of the next month and each baby pair on the first day
of the nth month becomes an adult pair on the first day of the next month. Fill rest of the
entries of the table and name the an+1 sequence.

n 1 2 3 4 5 6 7 8 9 10 11 12
an 0 1 2
bn 1 0 1
an+1

100
III. Find ∑ (( j+ 1)2− 1j )
j=2

CS2053 Discrete Structures Page 2 of 2

You might also like