NEW
Font size
WorksheetsDM MODEL EXAM 1
Total questions: 45
Worksheet time: 3600secs
Express the statement " Good food is not cheap"in symbolic form
∼p→q
∼p→∼q
p→q
If the premises P,Q,R are inconsistent ,then
∼R is a conclusion from P and QTrue
False
Let P(x) be the statement x< 2 give counter example to the statement
∀xP(x) where the set f all real number is the universex=3
x=4
x=-3
x=-4
Give an indirect proof of the theorem if 3n+2 is odd, then n is
Even
Odd
Nne of the above
Contradiction
Tautology
Contigency
Nne of the above
(P→Q)∧∼(P∨Q) is
Tautology
Contradiction
Contigency
None of the above
How many bit string of length 10 either begin with three 0's or end with two 0's
342
352
423
243
How many number not exceeding 100 are divisible by 4 or 6
33
32
31
30
A coin is tossed 10 times where each toss comes up with a head od taill . how many possible outcomes contain at most 3 tails
180
167
176
186
What is the number of permutation of the letter of the word PEPPER
60
59
61
58
In an exam a minimum is to be secured in each of 8 subject for a pass , in how many ways can a student fail
525
255
552
155
A number lock consist of three rings each marked with the 10 different digits 0,1,2,3,........9 find the number of unsuccessful to open the lock
999
989
899
998
Find the number of edges and degree of each vertex in the complete graph k(5)
(10,4)
(4,10)
(3,9)
(9,3)
Which is correct regular graph
its vertices are of the same degree
its vertices are of the equal degree
its vertices are of the not equal degree
Can a simple graph with 8 vertices have edges
18
28
08
38
What is the maximum number of edge of a simple graph with 10 vertices
44
55
54
45
The degree of each vertex of a graph G if it has a hamilton circuit atleast
n/2
n
n(n-1)/2
n(n-1)(n-2)/2
How many non isomorphic connected simple graphs are there with 3 vertices
3
2
1
4
In an abelian group G then (a⋅b)2
a2⋅b2
b2⋅a2
a2
b2
G={1,1,i,-1}is a group under usual multiplication H={1,-1} is a subset of G
H is subgroup
H is normal subgroup
All the above
The following semi group which is not a group
(2z, . )
(z,.)
(2z,+)
(z,-)
Any group of prime order is cyclic
Yes
No
The inverse of an element in a group G is
Unique
equal
same
None of the above
Semi group homomorphism preserves the property of
Idempotency law
Demorgan law
Absorption law
Identity law
If a poset has a least element , then it is
same
unique
equal
All the above
Is the lattice of divisors of 32 a boolean algebra
yes
no
The boolean algebra (B,*,+,',0,1) given B=(0,1) then
0'=1
1'=0
all the above
In a boolean algebra B, then
a(a+b)=a
a+(a.b)=a
a(a.b)=a
a+(a+b)=a
a lattice that is not distributive and not
Modular
chain
cycle
none of the above
In the lattice has LUB AND GLB IS
1,0
0,1
1,1
0,0
PDNF of ∼P∨Q
(∼P∧Q)∨(∼P∧∼Q)∨(P∧Q)
(∼P∨Q)∧(∼P∨∼Q)∧(P∨Q)
Let p(x,,y) denote the statement x=y+3 ,what are the truth values of the proposition p(1,2)
true
false
Symbolise the expression for any x and y , if x is taller than y, then y is not taller than x.
∀x∀y(T(x,y)→T(y,x))
∃x∃y(T(x,y)→T(y,x))
The generating function for the sequence 1,a,a2,a3........
1/1-ax
1/1-x
a/1-x
1/1-a
Find the minimum number of students needed to make sure that 5 of them take the same engineering course ECE ,CSE ,EEE and MECH
18
17
15
16
How many positive integers not exceeding 1000 are divisible by 7 or 11
222
110
220
111
Does there exists a simple graph of oeder 4 and size 7
simple graph
digraph
sub graph
none of the above
A regular graph G has 10 edges and degree of any vertex is 5 find the number of vertices
5
4
3
2
Does there exist a simple graph with the degree sequence 3,3,3,3,2
graph
sub graph
simple graph
normal graph
When is a graph (G ,*) called abelian
a+b=b+a
a.b=b.a
a*b=b*a
a-b=b-a
The permutation f=(2 5 7 8 6 1 4 31 2 3 4 5 6 7 8) is
even
odd
neither odd nor even
Any group of prime order is
cyclic
semi group
normal group
none of the above
In a bolean algebra show that ab'+a'b=0 iff
a=a
a=b
b=a
b=b
In a boolean algebra B , then ab'+bc'+ca'=
a'b+b'c+c'a
ab+bc+ca
ab'+bc'+ca'
b'c+c'b+a'c
Every distributive lattice is
modular
cyclic
Complete lattice
none of the above
