Home > Download > SMU - Question Paper
> BCA > BC0039
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 2024, 2023, 2022 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 - Bachelor of Computer Application.
Course Name
BCA (Bachelor of Computer Application)
Subject Code BC0039 (Discrete Mathematics)
Get Questions
PART - A
PART - B
PART - C
Subject : Discrete Mathematics
BC0039 : PART - A
| Q. 1 | THE SIMPLE WORDS OR THE EXPRESSIONS, WHICH CONNECT THE SIMPLE PREPOSITIONS, ARE KNOWN AS |
| | A) | CONNECTIVES |
| B) | TRUTH VALUE | | C) | COMPACTLY | | D) | NONE OF THE ABOVE | | | | | Q. 2 | A BOOLEAN FUNCTION WHICH CAN BE EXPRESSED AS SUM OF MINIMAL BOOLEAN FUNCTIONS IS CALLED |
| | A) | DISJUNCTIVE NORMAL FORM |
| B) | MINTERM NORMAL FORM | | C) | CANONICAL FORM | | D) | ALL OF THE ABOVE | | | | | Q. 3 | A COMPOUND PROPOSITION WHICH IS ALWAYS FALSE WHATEVER BE THE TRUTH VALUES OF ITS COMPONENTS IS CALLED |
| | A) | TAUTOLOGY |
| B) | CONTRADICTION | | C) | LOGICAL EQUIVALENCE | | D) | NONE OF THE ABOVE | | | | | Q. 4 | IF A={ X / X2-5X+6=0} B={2,4} C={4,5} FIND (A-B) x (B-C) |
| | A) | {(3,2)} |
| B) | {(2)} | | C) | {(2),(3)} | | D) | NONE OF THE ABOVE | | | | | Q. 5 | TABULAR METHOD IS ALSO KNOWN AS |
| | A) | RULE METHOD |
| B) | SET BUILDER METHOD | | C) | ROSTER METHOD | | D) | NONE OF THE ABOVE | | | | | Q. 6 | IN GRAPH G IF THERE EXISTS SOME GEOMETRIC REPRESENTATION OF G WHICH CAN BE DRAWN ON A PLANE SUCH THAT NO TWO OF ITS EDGES INTERSECT IS SAID TO BE |
| | A) | PLANAR |
| B) | NON-PLANAR | | C) | EULER’S | | D) | NONE OF THE ABOVE | | | | | Q. 7 | 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. 8 | IF SOME CLOSED WALK IN A GRAPH CONTAINS ALL THE EDGES OF THE GRAPH, THEN THE WALK IS CALLED |
| | A) | EULER LINE |
| B) | EULER GRAPH | | C) | BOTH A AND B | | D) | NONE OF THE ABOVE | | | | | Q. 9 | A RELATION ON A SET A IS SAID TO BE EQUIVALENCE RELATION, IF IT IS |
| | A) | REFLEXIVE |
| B) | SYMMETRIC | | C) | TRANSITIVE | | D) | ALL OF THE ABOVE | | | | | Q. 10 | HOW MANY WORDS OF THREE DISTINCT LETTERS CAN BE FORMED FROM THE ALPHABET(A,B,Y,Z) |
| | A) | 24 |
| B) | 120 | | C) | 48 | | D) | 240 | | | |
Click here to get
Discrete Mathematics (BC0039)
New Question
Home > Download > SMU - Question Paper
> BCA > BC0039