Discrete Structures BS 3 Semester/Term University Of Sargodha (UOS) 2026
Discussion
Ask a question about this paper, or help someone else with theirs. Answers are emailed to whoever asked.
No questions yet — be the first to ask.
More Discrete Structures papers
See all
Discrete Structures University Of Sargodha (UOS) 2025
Uploaded 2 months ago
Download ↓
Discrete Structures (URCO-5101/URCO-5102/URCO-5103)- Subject: CS/IT/SE UOS - ADP/BS 1st Semester Examination 2025
Uploaded 9 months ago
Download ↓
Discrete Structures B.ED/BS 3 Semester/Term University Of Sargodha (UOS) 2023
Uploaded 1 year ago
Download ↓
Discrete Structures BSIT University Of Sargodha (UOS) 2022
Uploaded 1 year ago
Download ↓
Discrete Structures BS 3 Semester/Term University Of Sargodha (UOS) 2022
Uploaded 1 year ago
Download ↓
Discrete Structures BS 3 Semester/Term University Of Sargodha (UOS) 2021
Uploaded 1 year ago
Download ↓
Paper text
University of Sargodha oul
BS 3" Semester Examination 2026
Subject: IT Paper: Discrete Structures (CMPC-205)
Time Allowed: 2:30 Hours Maximum Marks: 60
Note: Objective Part is Compulsory. Attempt any three Question form Subjective Part,
Objective Part (Compulsory)
Q.1. Write short answers of the following in 2-3 lines each on your answer sheet. (2*12)
4. Give an example where XOR is used.
#. Give an example of a valid argument,
#i. What is a converse of "if p then gq?"
pie Given sets A and B, w is the cardinality of A - B? Give formula only.
~~ Give an example of injection only function
¥ Give and example of an uncountable and finite set
wi What is ged(a, 0), where are a < 0?
will Give three integers which are relatively prime.
Is 233 a Mersenne prime? Give reason.
2 Whatis an algorithm?
Xi Give an example a tractable problem:
i. Give an example of an unsolvable problem
Subjective Part (3*12)
A.2. Prove that empty set is a subset of every set
R.3. Define the inverse of a function. When does a function have an inverse? Does the
function fin) = 10 — »? from the set of positive integers to the set of integers have an
inverse? If so, what is it?
4. Give a big-O estimate for the number of operations, where an operation is'an addition or
a multiplication, used in this segment of an algorithm (ignoring comparisons used to test
the conditions in the while loop)
t=0
whilei