Discrete Structure BSCS 2nd TERM Past paper 2015 UOS
University of Sargodha
BS 2nd 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)
- Differentiate between bound and free variable with the help of an example?
- Find the negation of this statement:
- Write the converse of this statement: “If we prepare the exam, then we will get the good grade.”
- Write the addition rule of inference?
- Define Vacuous Proof?
- Differentiate between subset and proper subset?
- Is the function from the set of integers to the set of integers one-to-one?
- Find a formula for this sequence:
- Define the correctness of an algorithm?
- Differentiate between sum and product rule with the help of an example?
- How many relations are there on set ?
- Differentiate between function and a relation?
- Draw graph .
- Compute the degree of every vertex in this graph?
- List the members of the following sets. a. b.
- Use truth table to determine whether is a tautology.
Subjective Part
I. 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.”
II. Let $ A = {a, b, c, d} $
$ B = {1, 2, 2, 3, 3} $
$ C = {2, b, a, 1} $