Probability and Statics ADP/BS 2 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.
More Probability and Statics papers
See all
Probability and Statics ADP IT/BSIT 3 Semester/Term University Of Sargodha (UOS) 2026
Uploaded 2 months ago
Download ↓
Probability and Statics BSCS University Of Sargodha (UOS) 2021
Uploaded 1 year ago
Download ↓
Probability and Statics BS 2 Semester/Term University Of Sargodha (UOS) 2021
Uploaded 1 year ago
Download ↓
Probability and Statics BS Statistics/MPhil Information Technology 2 Semester/Term University Of Sargodha (UOS) 2020
Uploaded 1 year ago
Download ↓
Probability and Statics BSSE 2015 Mid Term UOS
Uploaded 3 years ago
Download ↓
Probability and Statics BSSE 2015 UOS
Uploaded 3 years ago
Download ↓
Paper text
University of Sargodha
ADP/BS 2" Semester (F-24) Examination 2025
Subject: CS/AT/SE Pa ital Logic Design (CMPC-5204
Time Allowed: 02:30 Hours Maximum Marks: 40
Note: \ Objective part is compulsory. Attempt any three questions from subjective part.
+ (Mlustrate your answer with diagram where needed), ~
eNO co
Objective Part (Compulsory) ACN M
A
Q.1. Write short answers of the following in 2-3 lines each on your answer sheet’) ~ (2*8)
1 Represent the decimal number 6,248 in BCD.
iis Find the complement of the functions.F = x(JZ + yz).
ni. Demonstrate the validity of the following identities by means of truth tables: DeMorgan’s theorem
for three variables: (X+Y+2)= (XY
2)
iv. Why we use K-Map?
v." What is Multiplexer?
vi. What is Complements theorem?
vit” Define don’t-care conditions.
viii. What is a carry propagate adder?
Subjective Part (8%3)
. Draw logic diagram of four-to-one-line multiplexer. \
Lo Draw the circuit diagram of half adder and full adder. Draw truth table of half adder. Also write
Boolean expression of half adder only. Showhow a full adder can be converted to a full subtracter?
Q.4. Draw seven segment logic diagram and its truth table.
Q.5. Simplify the following Boolean functions, using Karnaugh maps
F(A,B,C,D)=3 (4,6,7, 15).
Q.6. Draw the following circuit with NANDs and NORs only.
' - LK-9293/18-11-25 ween
ustadni.com