ADP/BS 1 Semester/Term University Of Sargodha (UOS) 2025
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.
Paper text
University of Sargodha
ADP/BS 1% Semester Examination 2025
Subject: CSAT/SE Paper: Discrete Structures (URCQ-5101/URCQ-5102/URCQ-5103
Time Allowed: 02:30 Hours Maximum Marks: 60
Note: Objective partis compulsory. Attempt any three questions from subjective part.
(Illustrate your answer with diagram where needed).
Objective Part (Compulsory) 5
: 1 Ph
Q.1. Write short answers of the following in 2-3 lines each on your answer sheet. ( )
i. Finddualof (pV
F)A(qVT).
ii. Show that the conditional statement is tautology without using truth table
wen E . Pia) dE
iii. Write applications of minimum spanning tree.
iv. Using laws of logic, show that =~ (pA gq) A(p Vg =D.
v. What is a Satisfiable statement?
vi. Differentiate between a Function and a Relation.
vii. What is complete graph? :
viii. What do mean by best case complexity and worst complexity of an algorithm.
ix. What do mean by necessaries and sufficient condition give an example?
x. Show that ~(p@q) and p «> q are logically equivalent.
xi. State Modus Ponen rule of Inference.
xii. Define depth of a Node in a Tree. :
|
Subjective Part (3*12)
(Q.2. Let S(x) be the predicate “x is a student,” F (x) the predicate “x is a faculty member,” and A (x,y)
the predicate “x has asked y a question,” where the domain consists of all people associated with
your school. Use quantifiers to express each of these statements.
i. Every student has asked Professor Gross a question.
ii. Some student has not asked any faculty member a question.
iii. There is a faculty member who has asked every other faculty member a question.
Q.3. Definea Function, describe One-to-one, Onto, Into and Bijective Functions. Give example of each
one with diagram. ; Ng Eg Ban
Q.4. How many license plates can be made using either two uppercase English letters followed by four
digits or two digits followed by four uppercase English letters?
Q.5. Encrypt the message HOMEWORK using RSA system with n=55 and e=18.
Q.6.
a) Draw graph with given Adjacency Matrix
OBSsle 3 S05 4
3 erm] edt.)
SEES] (|
: ORE N02 0 2
gRROEEIs ¥o. 3
b) Find Incidence Matrix of the Graph given below
a b
. ¢ od
By
9) Col |) 6180/28.) fost BT