Discrete Structures IUB
Discrete Structures IUB
MCQs
1. __________ Mathematics concerns processes that consist of a sequence of individual steps?
(a) Differential (b) Discrete (c) Integral (d) None
2. A declarative statement which may be true or false but not both is called ____________?
(a) Negation (b) Proposition (c) Conjunction (d) None
12. A NOT-gate is a circuit with one input signal and ______ output signal?
(a) 0 (b) 1 (c) 2 (d) None
12. An AND-gate is a circuit with two input signals and ______ output signal?
(a) 0 (b) 1 (c) 2 (d) None
12. An OR-gate is a circuit with two input signals and ______ output signal?
(a) 0 (b) 1 (c) 2 (d) None
Short
5. Convert ( A ⋂ B )'= A ' ⋃ B ' into logical form and prove this by constructing truth table?
Long
Proofs Section
MCQs
13. Sum of two odd integers is an _________ integer?
(a) Odd (b) Even (c) Neither even nor odd (d) None
(a) Odd (b) Even (c) Neither even nor odd (d) None
Short
1. Define direct proof and give an example?
2. Show that the sum of two odd integers is even?
2. Define proof by contradiction and give an example?
1. Prove that for all integers a, b and c, if a∨b and b∨c then a∨c ?
2. Prove that √ 2 is irrational number?
MCQs
Longs
By using membership table and truth table, prove that ( A ∪ B )' =A ' ∩ B' ?
(a) Relation (b) Binary relation (c) Both a and b (d) None
29. The first elements of the ordered pairs of a relation R from set A to set B is called _______ of R ?
31. Let R be a relation on a set A . Then R is ________ if, and only if, for all a A , (a ,a) R?
31. Let R be a relation on a set A . Then R is ________ if, and only if, for all a , b A , if (a ,b) R ,
then ( b , a ) ∈ R ?
(a) Reflexive (b) symmetric (c) transitive (d) None
31. Let R be a relation on a set A . Then R is ________ if, and only if, for all a , b , c A , if (a ,b) R,
(b , c )R then ( a , c ) ∈ R ?
(a) Reflexive (b) symmetric (c) transitive (d) None
32. Let R be a relation on a set A . Then R is ________ if and only if, for all a , b A , if (a ,b) R ,
and (b , a) R then a=b ?
(a) Reflexive (b) anti-symmetric (c) transitive (d) None
33. A relation R on set A is said to be equivalence if it satisfies ________ properties?
Short
1. Define Cartesian product of two sets A and B and also find A × B if A={ 1 ,2 , 3 } and B= { a ,b }?
3. Let A = {eggs, milk, corn} and B = {cows, goats, hens}. Define a relation R from A to B by
(a ,b) R if and only if a is produced by b ?
4. Define an equivalence relation and give one example?
5. Define partial order relation and give one example?
6. Define bijective function and find all possible bijective functions on set A={ a , b , c }?
Long
1. Define a relation R on the set of all integers Z as follows: for all integers m and n ,
m R n mn(mod 3). Prove that R is an equivalence relation?
2. Find all possible bijective functions on set A={ 1 ,2 , 3 , 4 }?
Sequences and Series
MCQs
37. A sequence is a function whose domain is the subset of ________?
(a) Natural numbers (b) Integers (c) Whole Numbers (d) None
38. A sequence is denoted by ________?
(a) a n−a n−1 =d ∀ n ≥ 2 (b) a n−a n−1 =r ∀ n ≥ 2 (c) a n+ an−1=d ∀ n ≥ 2 (d) None
(c) a 1+ nd
n−1
(a) a 1+(n−1)d (b) a 1 r (d) None.
a+b b 2
(a) (b) a+ (c) (d) None
2 2 a+b
44. If a , A , b are in arithmetic sequence then A is called ______ of a and b ?
(a) geometric mean (b) harmonic mean (c) arithmetic mean (d) None
45. The arithmetic mean A between 4 and 6 is __________
n n n
(a) [ a + ( n−1 ) d ]
2 1
(b) [ a + ( n+1 ) d ]
2 1
(c)
2
[ 2 a1 + ( n−1 ) d ] (d) None
an an+1 an−1
(a) =r for all n ≥ 2 (b) =r for all n ≥ 2 (c) =r for all n ≥ 2 (d) None
an−1 an−1 an
49. The geometric mean G between two numbers a and b is _________?
a+b
(a) ± √ ab (b) √ ab (c) (d) None
2
50. If a=2 and b=18 , then G=¿ ¿?
1. Define Arithmetic Progression and find the 13th term of A. P if a 5=13 and a 17=49 ?
a+b
2. Define Arithmetic mean and show that the arithmetic mean A between a and b is A= ?
2
3. Define geometric progression and find the 12th term of the G. P 1+i ,2 i ,−2+2 i, ⋯?
4. If
1 1
a b
1
, and are in G. P. Show that the common ratio is ± a ?
c c √
5. Define Geometric mean and show that the Geometric mean G between a and b is G=± √ ab ?
1 1
6. Define Harmonic Progression and find the 9th term of H. P if its first term is and fifth term is ?
3 5
2 ab
7. Define Harmonic mean and show that the harmonic mean H between a and b is H= ?
a+ b
Longs
1. Which term of the A. P 5 , 2 ,−1 . ,⋯ , is −85 ?
2. Obtain the sum of all integers in the first thousand integers which are neither divisible by 2 nor by 5?
3. Find three consecutive numbers in G. P whose sum is 26 and their product is 216?
1 1 1
4. If the numbers , and are H. P, find k ?
k 2 k +1 4 k−1
54. 5 !=¿ ¿
57. nCr =¿ ¿?
1 n!
(a) nPr (b) (c) both (a) and (b) (d) None
r! r ! (n−r )!
58. nPr =¿ ¿?
n! n!
(a) (b) (c) both (a) and (b) (d) None.
(n−r )! r ! (n−r )!
59. 5 C 3+5 C 4=¿ ¿?
Shorts
Define permutation and find the value of n if nP 2=30 ?
How many signals can be made with 4 different flags when any number of them are to be used at a time?
In how many ways can be letters of the word MISSISSIPPI be arranged when all the letters are to be
used?
Define combination and find the value of n if n C 4=nC 5?
Longs
Graph Theory
MCQs
60. A ________ is a non-empty set of points called vertices and a set of line segments joining
pairs of vertices called edges?
(a) Set (b) Graph (c) Both a and b (d) None
61. The set of vertices of a graph G is usually denoted by
(a) deg (G) (b) deg (v ) (c) Both a and b (d) None
68. If G is any graph, then the sum of the degrees of all the vertices of G equals ______ the
number of edges of G ?
(a) One time (b) Two time (c) Three time (d) None
69. The total degree of a graph G is an _______ number?
(a) Odd (b) Even (c) Neither even nor odd (d) None
72. A closed walk is a walk that starts and ends at the ________ vertex
(a) different (b) Same (c) Both a and b (d) None
73. A circuit is a ________ walk that does not contain a repeated edge?
(a) Closed (b) Same (c) Open (d) None
74. Two vertices v and w of a graph G are connected if, and only if, there is a _______
from v to w ?
(a) Path (b) Walk (c) Closed walk (d) None
75. An _________ circuit for a graph G is a circuit that contains every vertex and every edge of
G
(a) Hamiltonian (b) Euler (c) Tree (d) None
75. A _________ circuit for a G is a simple circuit that contains every vertex of G
(a) Hamiltonian (b) Euler (c) Tree (d) None
Shorts
1. Define graph and give one example of graph?
2. Define simple graph and give an example?
3. Define complete graph and give one example?
4. Define Bipartite graph and give an example?
5. Define k -regular graph and give one example?
6. Define Euler circuit and give an example?
7. Define Hamiltonian graph and give an example?
Longs