Home > Download > SMU - Question Paper
> MCA > MC0063
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 - Master of Computer Application.
Course Name
MCA (Master of Computer Application)
Subject Code MC0063 (Discrete Mathematics)
Get Questions
PART - A
PART - B
PART - C
Subject : Discrete Mathematics
MC0063 : PART - B
Q. 1 | WHICH OF THE FOLLOWING PROPERTIES ARE FOR UNION OPERATION 1) AUA = Ø 2) AUØ = A 3) AUU = U 4) A C AUB AND B C AUB 5) AUB = BUA |
| A) | 1,2,3,4,5 |
| B) | 2,3,4,5 | | C) | 1,3,4,5 | | D) | 1,2,3,5 | | | | Q. 2 | A COMPUTER COMPANY WANTS TO HIRE 25 PROGRAMMERS TO HANDLE SYSTEMS PROGRAMMING AND 40 PROGRAMMERS FOR APPLICATIONS PROGRAMMING. OF THOSE HIRED, TEN WILL BE EXPECTED TO PERFORM JOBS OF BOTH TYPES. HOW MANY PROGRAMMERS MUST BE HIRED? |
| A) | 55 |
| B) | 65 | | C) | 75 | | D) | 10000 | | | | Q. 3 | WHICH OF THE FOLLOWING ARE PROPERTIES OF TREES 1) THERE IS ONE AND ONLY ONE PATH BETWEEN EVERY PAIR OF VERTICES IN A TREE. 2) IF IN A GRAPH G THERE IS ONE AND ONLY ONE PATH BETWEEN EVERY PAIR OF VERTICES, G IS A TREE. 3) A TREE WITH N VERTICES |
| A) | 1,2,3,4,5 |
| B) | 1,2,3,4,5,6 | | C) | 1,2,3,4,6 | | D) | 1,2,3,5,6 | | | | Q. 4 | WHICH OF THE FOLLOWING ARE TYPES OF SETS 1) NULL SET ( EMPTY OR VOID SET ) 2) EQUAL SET 3) SINGLETON SET 4) NON-EMPTY SET 5) FINITE SETS 6) INFINITE SETS 7) CARDINAL NUMBER OF A FINITE SET 8) SUBSETS 9) PROPER SUBSETS < |
| A) | 1,2,3,4,5,6,8,9,10,11 |
| B) | 1,2,3,4,5,6,8,9 | | C) | 1,2,3,4,5,6,7,8,10 | | D) | 1,2,3,4,5,6,7,8,9,10,11 | | | | Q. 5 | WHICH OF THE FOLLOWING OPERATION CAN BE DONE ON SETS 1) UNION 2) INTERSECTION 3) COMPLEMENTATION 4) RELATIVE COMPLEMENT 5) DIFFERENCE OF SETS 6) SYMMETRIC DIFFERENCE |
| A) | 1,2,3,5,6 |
| B) | 1,2,4,5,6 | | C) | 1,2,3,4,6 | | D) | 1,2,3,4,5,6 | | | |
Click here to get
Discrete Mathematics (MC0063)
New Question
Home > Download > SMU - Question Paper
> MCA > MC0063