University of Sargodha BS 2"d Term Examination 2015 Subject: Computer Science Paper: Discrete Structure (CMP-2211) Time Allowed: 2:30 Hours Maximum Marks: 80

University of Sargodha

BS 2"d Term Examination 2015

Subject: Computer Science

Paper: Discrete Structure (CMP-2211)

Time Allowed: 2:30 Hours

Maximum Marks: 80

Objective Part

(Compulsory)

Q 1: Write short answers of the following.

(2*16)

1 bitterentiate between bound and free variable with the help of an example?

2. Find the negation of this statement Ya Vy ( (x >

0) ^ (y <

0) → (xy <

0) Lom

3. Write the converse of this statement "If we prepare the exam, then we will getthe good

grade."

4. Write the addition rule of inference?

usta

5. Define Vacuous Proof?

6. Differentiate between subset the proper subset?

7. Is the function f(x) = x? from the set of integers to the set of integers one-to-one?

8. Find a formula for this sequence: 1, 1/2, 1/3, 1/4, 1/5, ...

9. Define the correctness of an algorithm?

10. Differentiate between sum and product rule with the help of an example

11. How many relations are there on set S= (a, b,

c)?

12. Differentiate between function and a relation?

13. Draw graph Ka?

14. Compute the degree of every vertex in this graph?

U3

VA •

15. List the members of the following sets.

n/*/x is a real number such that x2 = 4),

{x |x is an integer such that x2 = 240

16. Use truth table to determine whether (-p^ (p→q)) →

9) is a tautology.

Subjective Part

Note: Attempt any four out of six questions. All questions carry equal markcini.Com

Long Questions Maximum Marks 48

Q2:

I.

[6+6)

Translate this statement into quantifiers and predicates logic. "For all x, for all y, if x is

greater than zero and y is less than zero, then multiplying them together will produce a

negative number."

1. Let A- (a, b, c,

d) B= (1, 2, a, 3,

c) and C- Visit Website: ustadni.com