Home /UOS — University of Sargodha /Discrete Structures

Discrete Structures ADP/BS 1 Semester/Term UOS — University of Sargodha 2026

Discrete Structures ADP/BS 1 Semester/Term UOS — University of Sargodha 2026 — page 1

Discussion

Ask a question about this paper, or help someone else with theirs. Answers are emailed to whoever asked.

Your email is only used to send you replies and occasional Ustadni updates. It is never shown publicly.

Log in to post under your name

No questions yet — be the first to ask.

Need Paper? See all →

Need a paper or stuck on a question? Ask here — students reply and you get an email.

Ask about a paper
  • Ayesha Mustafa· 11 days ago

    BS ZOOLOGY first semester Animal diversity ZOOL 101 - university of Punjab 2025

    0 replies Reply →
  • Abubakar· 11 days ago

    Literary criticism

    1 reply Reply →
  • Guest· 12 days ago

    this paper consists of 60 marks but now we have 35 marks paper.

    1 reply Reply →
  • saira khalid· 1 month ago

    air past paper nhi h

    1 reply Reply →
Ad

Paper text

University of Sargodha

ADP /BS 1st Semester Examination 2026

Subject: CS, IT & SE Paper: Discrete Structures (URCQ-5101) (URCQ-5102)

Time Allowed: 02:30 Hours Maximum Marks: 60

Note: Objective part is compulsory. Attempt any three questions from subjective part.

Objective Part (Compulsory)

Q.1. Write short answers of the following in 2-3 lines each on your answer sheet. (2*12)

i. Give an example of a fallacy.

ii. Give an example of a satisfiable compound proposition

iii. What is Cantor diagonalization argument?

iv. State continuum hypothesis.

v. When a problem is said to be solvable?

vi. Define cryptanalysis.

vii. Define key exchange protocol.

viii. What is a selection operator in relations?

ix. What are the properties in partial ordering?

x. Draw a pseudograph.

xi. What is the necessary property of an ordered tree?

xii. Give an example graph with a cut edge.

Subjective Part (3*12)

Q.2. Show that there are no solutions in integers x and y of x^2 +3y^2 =

8.

Q.3. Find a big-O estimate for Σj=1 n j(j +

1) .

Q.4. Describe an algorithm that uses only assignment statements that replaces the triple (x,y,z) with (y,z,x). What is the minimum number of assignment statements needed?

Q.5. Show that the “divides” relation is the set of positive integers in not an equivalence relation.

Q.6. Find all bridges in the following graph.

[Graph image]

LK-6180/28-04-26 -----(F-25)----------