Scribd
Upload
429 views16 pages

DMS Question Paper

This document contains 60 multiple choice questions related to discrete mathematical structures. The questions cover topics like logic, sets, relations, functions, graphs, trees, automata and computability. Sample questions include identifying logically equivalent statements, properties of sets and relations, graph concepts like adjacency matrices, tree properties and finite state machines.

Uploaded by

Ambika Jaiswal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
429 views16 pages

DMS Question Paper

This document contains 60 multiple choice questions related to discrete mathematical structures. The questions cover topics like logic, sets, relations, functions, graphs, trees, automata and computability. Sample questions include identifying logically equivalent statements, properties of sets and relations, graph concepts like adjacency matrices, tree properties and finite state machines.

Uploaded by

Ambika Jaiswal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 16

M.Sc.

SEMESTER II (CBCS SCHEME) Computer Science


Paper Code: 2453
Paper: 2MCS4 (1)
Sub: DISCRETE MATHEMATICAL STRUCTURES.
1. p ↔ q is logically equivalent to ________.
a) (p → q) → (q → p)
b) (p → q) ∨ (q → p)
c) (p → q) ∧ (q → p)
d) (p ∧ q) → (q ∧ p)
Answer Option: c

2. In a disjunction, even if one of the statements is false, the whole disjunction is still...
a) False
b) Negated
c) True
d) Both true and false
Answer Option: c

3. It is impossible for a valid argument to have true premises and…


a) A true conclusion
b) A negated conclusion
c) A conditional
d) A false conclusion
Answer Option: d

4. ~ A v ~ B is logically equivalent to?


a) ~ A → ~ B
b) ~ A ∧ ~ B
c) A → ~B
d) B V A
Answer Option: c
5. Which of the following satisfies commutative law?
a) ∧
b) v
c) ↔
d) All of the mentioned
Answer Option: d

6. What is the dual of (A ∧ B) v (C ∧ D)?


a) (A V B) v (C v D)
b) (A V B) ^ (C v D)
c) (A V B) v (C ∧ D)
d) (A ∧ B) v (C v D)
Answer Option: b

7. A → (A ∨ B) is a __________
a) Tautology
b) Contradiction
c) Contingency
d) None of the mentioned
Answer Option: a

8. Which of the following is De-Morgan’s law?


a) P ∧ (Q v R) Ξ (P ∧ Q) v (P ∧ R)
b) ~(P ∧ R) Ξ ~P v ~R, ~(P v R) Ξ ~P ∧ ~R
c) P v ~P Ξ True, P ∧ ~P Ξ False
d) None of the mentioned
Answer Option: b
9. Which of the following are valid?
i) P → (P v Q)
ii) ~ P→ (P ∧ Q)
iii) (P∧(P→Q)) →Q
iv) (P→Q) → (P v Q)
a) (i)Only
b) (i) (ii) Only
c) (iii) (iv) Only
d) (i) (iii) Only
Answer Option: b

10. [(PV~Q) →P] and (PVQ) are


a) equivalent
b) Non equivalent
c) Sometimes equivalent and sometimes non-equivalent
d) None of these
Answer Option: a

11. What is the Cardinality of the Power set of the set {0, 1, 2}?
a) 8
b) 6
c) 7
d) 9
Answer Option: a

12. If A has 4 elements B has 8 elements then the minimum and maximum number of
elements in A U B are ____________
a) 4, 8
b) 8, 12
c) 4, 12
d) None of the mentioned
Answer Option: b

13. If set C is {1, 2, 3, 4} and C – D = Φ then set D can be ___________


a) {1, 2, 4, 5}
b) {1, 2, 3}
c) {1, 2, 3, 4, 5}
d) None of the mentioned
Answer Option: c

14. The binary relation {(1,1), (2,1), (2,2), (2,3), (2,4), (3,1), (3,2)} on the set {1, 2, 3} is
__________
a) reflective, symmetric and transitive
b) irreflexive, symmetric and transitive
c) neither reflexive, nor irreflexive but transitive
d) irreflexive and antisymmetric
Answer Option: c

15.  A function is said to be ______________ if and only if f(a) = f(b) implies that a = b for
all a and b in the domain of f.
a) One-to-many
b) One-to-one
c) Many-to-many
d) Many-to-one
Answer Option: b

16. Set A has 3 elements and set B has 4 elements then number of injections defined from A
to B are?
a) 12
b) 24
c) 36
d) 48
Answer Option: b

17. For an inverse to exist it is necessary that a function should be __________


a) injection
b) bijection
c) surjection
d) none of the mentioned
Answer Option: b

18. For two sets C and D the set (C – D) ∩ D will be __________


a) C
b) D
c) Φ
d) None of the mentioned
Answer Option: c

19.  Suppose S is a finite set with 7 elements. How many elements are there in the largest
equivalence relation on S?
a) 56
b) 78
c) 49
d) 100
Answer Option: c

20. If A={1, 2, 3, 4}, then the number of the subsets of A that contain the element 2 but not 3,
is?
a) 16
b) 4
c) 8
d) 24
Answer Option: b

21. __________ is not necessarily a property of a Group.


a) Commutativity
b) Existence of inverse for every element
c) Existence of Identity
d) Associativity
Answer Option: a

22.  Intersection of subgroups is a ___________


a) group
b) subgroup
c) semigroup
d) cyclic group
Answer Option: b

23. Two groups are isomorphic if and only if __________ is existed between
them.
a) homomorphism
b) endomorphism
c) isomorphism
d) association
Answer Option: c

24. What would be the Prefix notation for the given equation?

A+(B*C)
a)+A*CB
b)*B+AC
c)+A*BC
d) *A+CB

Answer Option: c

25.Condition for monoid is __________

a)(a+e)=a
b)(a*e)=(a+e)
c)a=(a*(a+e)
d) (a*e)=(e*a)=a

Answer Option: d

26. An algebraic structure _________ is called a semigroup.

a)(P, *)
b) (Q, +, *)
c) (P, +)
d) (+, *)
Answer Option: a

27.  A group (M,*) is said to be abelian if ___________

a)(x+y)=(y+x)
b)(x*y)=(y*x)
c)(x+y)=x
d) (y*x)=(x+y)

Answer Option: b

28. What would be the Prefix notation for the given equation?

A+B*C^D
a)+A*B^CD
b)+A^B*CD
c)*A+B^CD
d) ^A*B+CD

Answer Option: a

29. A monoid is called a group if _______

a)(a*a)=a=(a+c)
b)(a*c)=(a+c)
c)(a+c)=a
d) (a*c)=(c*a)=e

Answer Option: d

30. What is the postfix expression for the following infix expression?

a/b^c-d
a)abc^/d-
b)ab/cd^-
c)ab/^cd-
d) abcd^/-

Answer Option: a

31. A Poset in which every pair of elements has both a least upper bound and
a greatest lower bound is termed as _______

a)sublattice
b)lattice
c)trail
d) walk

Answer Option: b

32.  If every two elements of a poset are comparable then the poset is called
________
a)sub ordered poset
b)totally ordered poset
c)sub lattice
d) semigroup
Answer Option: b

33. The graph given below is an example of _________

a) non-lattice poset
b) semilattice
c) partial lattice
d) bounded lattice
Answer Option: a
34. Every poset that is a complete semilattice must always be a _______

a) sublattice
b) complete lattice
c) free lattice
d) partial lattice
Answer Option: b
35.  The set for which the Boolean function is functionally complete is
__________

a) {*, %, /}
b) {., +, -}
c) {^, +, -}
d) {%, +, *}
Answer Option: b
36. a ⊕ b = ________
a) (a+b)(a`+b`)
b) (a+b`)
c) b`
d) a` + b`
Answer Option: a
37. Boolean algebra can be used ____________
a) For designing of the digital computers
b) In building logic symbols
c) Circuit theory
d) Building algebraic functions
Answer Option: a

 38. __________ is a disjunctive normal form.


a) product-of-sums
b) product-of-subtractions
c) sum-of-products
d) sum-of-subtractions
Answer Option: c

39. What are the canonical forms of Boolean Expressions?


a) OR and XOR
b) NOR and XNOR
c) MAX and MIN
d) SOM and POM
Answer Option: d

40. A deterministic automaton system can have ______ transition for a given
state of an input symbol.
a) exactly one
b) more than one
c) no transition
d) 2n transition
Answer Option: a

41. The number of elements in the adjacency matrix of a graph having 7


vertices is __________
a) 7
b) 14
c) 36
d) 49
Answer Option: d
42. What would be the number of zeros in the adjacency matrix of the given
graph?

a) 10
b) 6
c) 16
d) 0
Answer Option: a
43. What is the maximum number of possible non zero values in an adjacency
matrix of a simple graph with n vertices?
a) (n*(n-1))/2
b) (n*(n+1))/2
c) n*(n-1)
d) n*(n+1)
Answer Option: c

44. The number of edges from the root to the node is called __________ of the
tree.
a) Height
b) Depth
c) Length
d) Width
Answer Option: b

45.  Which of the following is not an advantage of trees?


a) Hierarchical structure
b) Faster search
c) Router algorithms
d) Undo/Redo operations in a notepad
Answer Option: d

46.  What is the speciality about the inorder traversal of a binary search tree?
a) It traverses in a non increasing order
b) It traverses in an increasing order
c) It traverses in a random fashion
d) It traverses based on priority of the node
Answer Option: b
47. What is the maximum possible number of edges in a directed graph with
no self loops having 8 vertices?
a) 28
b) 64
c) 256
d) 56
Answer Option: d

48.  A connected planar graph having 6 vertices, 7 edges contains


_____________ regions.
a) 15
b) 3
c) 1
d) 11
Answer Option: b

49. What is the number of edges present in a complete graph having n


vertices?
a) (n*(n+1))/2
b) (n*(n-1))/2
c) n
d) Information given is insufficient
Answer Option: b

50.  Which of the following is true?


a) A graph may contain no edges and many vertices
b) A graph may contain many edges and no vertices
c) A graph may contain no edges and no vertices
d) A graph may contain no vertices and many edges
Answer Option: b

51. There are ________ tuples in finite state machine.


a) 4
b) 5
c) 6
d) unlimited
Answer Option: b

52. Transition function maps.


a) Σ * Q -> Σ
b) Q * Q -> Σ
c) Σ * Σ -> Q
d) Q * Σ -> Q
Answer Option: d
53. Number of states require to accept string ends with 10.
a) 3
b) 2
c) 1
d) can’t be represented.
Answer Option: a
54. Languages of a automata is
a) If it is accepted by automata
b) If it halts
c) If automata touch final state in its life time
d) All language are language of automata
Answer Option: a
55. Regular expression for all strings starts with ab and ends with bba is.
a) aba*b*bba
b) ab(ab)*bba
c) ab(a+b)*bba
d) All of the mentioned
Answer Option: c
56. The basic limitation of finite automata is that
a) It can’t remember arbitrary large amount of information.
b) It sometimes recognize grammar that are not regular.
c) It sometimes fails to recognize regular grammar.
d) All of the mentioned
Answer Option: a

57. A turing machine that is able to simulate other turing machines:


a) Nested Turing machines
b) Universal Turing machine
c) Counter machine
d) None of the mentioned
Answer Option: b
58. Which of the following a turing machine does not consist of?
a) input tape
b) head
c) state register
d) none of the mentioned
Answer Option: d
59. The value of n if turing machine is defined using n-tuples:
a) 6
b) 7
c) 8
d) 5
Answer Option: b
60. The class of recursively enumerable language is known as:
a) Turing Class
b) Recursive Languages
c) Universal Languages
d) RE
Answer Option: d

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy