Home /University Of Sargodha (UOS) /Discrete Structures

Discrete Structures BSIT University Of Sargodha (UOS) 2022

Discrete Structures BSIT University Of Sargodha (UOS) 2022 — 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.

More Discrete Structures papers

See all

Paper text

Q.2.

Subjective Part

(3*12)

In which order does a preorder and in order traversal visits the following tree.

ustadni.com

Q.3.

a) a and d

c) c and f

b) a and f

ustadni.com

1 3!

2

Q.4.

Q.5.

Q.6.

6

8

Use Divide and Conquer algorithm to put 6, 1, 2, 4, 3 into increasing order.

Describe the Linear Search algorithm and Find out the average case complexity of the linear search

algorithm, assuming that the element x is in the list.

Let p,q and r be the propositions

p: You have the flu

q: you miss the final examination

r: You pass the course

Express each of these propositions as an English sentence

a) p>q

b) q>-r

c) ~q→r

đ) (p^q)v(-q^T)

e) Puqvr

(p→-т) v (q→-т)

ustadni.com

ustadni.com

- LK-6491

ustadni.com

canned with Camscanne

istadni con