9,98 €
Mehr erfahren.
- Herausgeber: Poorav Publications
- Kategorie: Wissenschaft und neue Technologien
- Serie: IGNOU BCA Unsolved Paper Books Series
- Sprache: Englisch
Discrete Mathematics is a foundational pillar in computer science and mathematics, providing essential tools and frameworks for logical reasoning, algorithm design, and data structure development. For students pursuing the BCA program at the Indira Gandhi National Open University (IGNOU), mastering this subject is vital for academic and professional success. With this in mind, "IGNOU BCA Discrete Mathematics Previous Year Unsolved Papers MCS 013" has been compiled to offer learners a practical and focused approach to exam preparation by engaging them directly with real, unsolved questions from past examinations.
This book serves as more than just a repository of previous year question papers—it is a challenge-driven resource designed to strengthen problem-solving skills and deepen conceptual understanding. The unsolved format encourages independent thinking, critical analysis, and active learning. By working through these carefully selected questions, students can enhance their familiarity with exam patterns, identify key topics, and build the confidence necessary to tackle even the most complex problems in discrete mathematics. We are grateful to the educators and learners whose feedback and insight have helped shape this book, and we hope it becomes a valuable companion in your academic journey.
Das E-Book können Sie in Legimi-Apps oder einer beliebigen App lesen, die das folgende Format unterstützen:
Seitenzahl: 37
Veröffentlichungsjahr: 2024
Ähnliche
Preface
Discrete Mathematics is a foundational pillar in computer science and mathematics, providing essential tools and frameworks for logical reasoning, algorithm design, and data structure development. For students pursuing the BCA program at the Indira Gandhi National Open University (IGNOU), mastering this subject is vital for academic and professional success. With this in mind, "IGNOU BCA Discrete Mathematics Previous Year Unsolved Papers MCS 013" has been compiled to offer learners a practical and focused approach to exam preparation by engaging them directly with real, unsolved questions from past examinations.
This book serves as more than just a repository of previous year question papers—it is a challenge-driven resource designed to strengthen problem-solving skills and deepen conceptual understanding. The unsolved format encourages independent thinking, critical analysis, and active learning. By working through these carefully selected questions, students can enhance their familiarity with exam patterns, identify key topics, and build the confidence necessary to tackle even the most complex problems in discrete mathematics. We are grateful to the educators and learners whose feedback and insight have helped shape this book, and we hope it becomes a valuable companion in your academic journey.
Table of Contents
Preface
Chapter 1: Term-End Examination, June- 2014
Chapter 2: Term-End Examination, December- 2014
Chapter 3: Term-End Examination, June- 2015
Chapter 4: Term-End Examination, December- 2015
Chapter 5: Term-End Examination, June- 2016
Chapter 6: Term-End Examination, December- 2016
Chapter 7: Term-End Examination, June- 2017
Chapter 8: Term-End Examination, December- 2017
Chapter 9: Term-End Examination, June- 2018
Chapter 10: Term-End Examination, December- 2018
Chapter 11: Term-End Examination, June- 2019
Chapter 12: Term-End Examination, December- 2019
Chapter 13: Term-End Examination, June- 2020
Chapter 14: Term-End Examination, February- 2021
Chapter 15: Term-End Examination, June- 2021
Chapter 16: Term-End Examination, December- 2021
Chapter 17: Term-End Examination, June- 2022
Chapter 18: Term-End Examination, December- 2022
Chapter 19: Term-End Examination, December- 2023
MCS - 013
MCA-Revised / BCA-Revised
Chapter 1: Term-End Examination, June- 2014
MCS-013: DISCRETE MATHEMATICS
Time: 2 hours
Maximum Marks: 50
Note: (i). Question number 1 is compulsory.
(ii). Attempt any three questions from the rest.
1. (a) Letand wherex € R. Find (f+ g) (x) and (fg) (x)? 3
(b) Draw Venn diagram to represent A ▲ B where A and B are two sets.3
What is the probability that either A or B does not occur? 2
(e) Show that p ∨(q ∧ r) and (p∨q)∧(p∨r) are logically equivalent.3
(f) Prove that product of two odd integers is an odd integer? 3
(g) How many different strings can be made from the letters of the word "SUCCESS"
using all the letters? 3
where l(x) is length of string x. Show that R is an equivalence relation.5
3. (a) Write contrapositive, converse and the inverse of the implication
"The home team does not win whenever it is raining."3
(b) Draw the logic circuit for the expression Y=ABC+A' C' + B' C'4
(c) Determine the number of integer solutions to the equation+ + + =7, where 3
≥ 0 ∀i=1, 2, 3, 4.
4. (a) Five balls are to be placed in three boxes. Each box can hold all the five balls. In how
Many ways can we place the balls so that no box is empty if balls and boxes are
different? 5
(b) Show that r s can be derived from p (q s), .
R to R. 4
(c) List all the permutations of {a, b, c}. 2
MCS-013
MCA-Revised / BCA-Revised
