Home > Download > SMU - Question Paper
> MSc IT > MT0043
Discrete Mathematics
This is the collection of
Sikkim Manipal University (SMU) question and answers for Discrete Mathematics. It will help
to prepare your examination. All question paper are
classified as per semester, subject code and question type of Part A, Part B and Part C with
multiple
choice options
as same as actual examination. SMU question papers includes
year 2025, 2024, 2023 Sem I, II, III, IV, V, VI examinations
of all subjects.
SMU question test set of old,
last and previous year are updated
regularly and it is absolutely free to use. Question paper includes Visual basic 6, VB.Net, C#, ASP.Net,
Web, Oracle, Database, SQL, Software Engineering, C, C++, OOPS, MBA, MCA, BSC IT I have requested
you kindly send me the question paper of Discrete Mathematics, SMU - Master of Science in Information Technology.
Course Name
MSc IT (Master of Science in Information Technology)
Subject Code MT0043 (Discrete Mathematics)
Get Questions
PART - A
PART - B
PART - C
Subject : Discrete Mathematics
MT0043 : PART - A
| Q. 1 | A COMPLETE SYMMETRIC DIGRAPHS OF N VERTICES CONTAINS |
| | A) | N (N-1) / 2 EDGES |
| B) | N (N-1) EDGES | | C) | N / 2 EDGES | | D) | NONE OF THE ABOVE | | | | | Q. 2 | GEORGE BOOLE WAS BORN ON WHICH YEAR AT LINCOLN IN ENGLAND |
| | A) | NOVEMBER 2, 1815 |
| B) | NOVEMBER 2, 1816 | | C) | NOVEMBER 3, 1815 | | D) | NOVEMBER 3, 1816 | | | | | Q. 3 | WHAT IS THE NEGATION OF THE FOLLOWING
P v ( P ^ Q ) |
| | A) | ~P v ( ~P ^ ~Q) |
| B) | ~P ^ ( ~P v ~Q) | | C) | ~P v ( ~P v ~Q) | | D) | ~P ^ ( ~P ^ ~Q) | | | | | Q. 4 | A COMPOUND PROPOSITION WHICH IS ALWAYS TRUE WHATEVER BE THE TRUTH VALUES OF ITS COMPONENTS IS CALLED |
| | A) | TAUTOLOGY |
| B) | CONTRADICTION | | C) | LOGICAL EQUIVALENCE | | D) | NONE OF THE ABOVE | | | | | Q. 5 | A CLOSED WALK IN WHICH NO VERTEX APPEAR MORE THAN ONCE IS CALLED |
| | A) | CIRCUIT |
| B) | PATH | | C) | DEGREES | | D) | NONE OF THE ABOVE | | | | | Q. 6 | DIGRAPHS THAT HAVE AT MOST ONE DIRECTED EDGE BETWEEN A PAIR OF VERTICES, BUT ARE ALLOWED TO HAVE SELF-LOOPS ARE CALLED |
| | A) | SIMPLE DIGRAPHS |
| B) | ASYMMETRIC DIGRAPHS | | C) | SYMMETRIC DIGRAPHS | | D) | COMPLETE DIAGRAPHS | | | | | Q. 7 | GIVEN A MATRIX OF RELATION, IF THE MATRIX HAS ALL 1’S ON ITS MAIN DIAGONAL, THE RELATION IS |
| | A) | TRANSITIVE RELATION |
| B) | EQUIVALENCE RELATION | | C) | REFLEXIVE RELATION | | D) | IRREFLEXIVE RELATOIN | | | | | Q. 8 | AN EDGE HAVING THE SAME VERTEX AS BOTH ITS END VERTICES IS CALLED |
| | A) | SELF LOOP |
| B) | NO SELF LOOP | | C) | DIRECTED GRAPH | | D) | NONE OF THE ABOVE | | | | | Q. 9 | { } IS CALLED AS WHICH TYPE OF SETS |
| | A) | SINGLETON SET |
| B) | NULL SET | | C) | NON-EMPTY SET | | D) | NONE OF THE ABOVE | | | | | Q. 10 | IF A={1,2,3} B={2,4,5}
FIND (A ∩ B) x (A-B)
|
| | A) | {(2,1),(2,3)} |
| B) | {(1,2,3)} | | C) | {(2),(1,3)} | | D) | NONE OF THE ABOVE | | | |
Click here to get
Discrete Mathematics (MT0043)
New Question
Home > Download > SMU - Question Paper
> MSc IT > MT0043