0% found this document useful (0 votes)
48 views3 pages

DMS (End Sem Set2)

The document outlines the structure and contents of a Spring End Semester Examination for a 4th semester B.Tech program. It contains 10 questions in Section A and 6 additional sections (B through D) containing multiple choice and multi-part questions testing different learning levels. Sections become more complex with higher order thinking skills required as the document progresses.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
48 views3 pages

DMS (End Sem Set2)

The document outlines the structure and contents of a Spring End Semester Examination for a 4th semester B.Tech program. It contains 10 questions in Section A and 6 additional sections (B through D) containing multiple choice and multi-part questions testing different learning levels. Sections become more complex with higher order thinking skills required as the document progresses.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Semester: ......................................................

Programme: .................................................
Branch/Specialization: .................................

SPRING END SEMESTER EXAMINATION-2023


4th Semester, B.Tech (Programme)
SUBJECT-DMS
MA 2013
(For 2021-22 Admitted Batches)
Time: 3 Hours Full Marks: 50
Answer any SIX questions.
Question paper consists of four SECTIONS i.e. A, B, C and D.
Section A is compulsory.
Attempt minimum one question each from Sections B, C, D.
The figures in the margin indicate full marks.
Candidates are required to give their answers in their own words as far as practicable
and all parts of a question should be answered at one place only.

SECTION-A (Learning levels 1 and 2) Learning Course


levels as per Outcomes (CO)
Bloom’s
taxonomy
1. Answer the following questions. [1  10]
(a) Write the negation of the statement 𝑝 ∧ (𝑞 → 𝑟). LL 1 CO1
(b) State the rule of inference used in this argument: LL 2 CO1
“If it rains, I shall not go to school”, “if I don’t go to
school, I won’t need to do homework”, Therefore if it
rains , I won’t need to do homework.
(c) Write the logical translation of the statement “None of LL 2 CO1
my friends are perfect”.
(d) Let 𝑛(𝐴) = 𝑚, 𝑛(𝐵) = 𝑛, then what is the total number LL 2 CO2
of nonempty relations that can be defined from 𝐴 to 𝐵 ?
(e) A relation R on a set of real numbers defined as 𝑅 = LL 2 CO3
{(𝑎, 𝑏): 𝑎 ≤ 𝑏 } . Is it reflexive, symmetric, and
transitive?
(f) Find the maximal and minimal elements of the poset LL 1 CO3
({2,4,5,10,12, }, 𝔩).

(g) Write the recurrence relation capturing the optimal LL 1 CO4


execution time of the tower of Hanoi problem with 𝑛
disk.
(h) Let 𝐴 = {1,2,3, ⋯ ∞} and a binary operation " + " is LL 2 CO5
defined by 𝑎 + 𝑏 = 𝑎𝑏, ∀ 𝑎, 𝑏 ∈ 𝐴. Is (𝐴, +) a
semigroup, monoid or group?
(i) Let 𝐺 = {1, −1, 𝑖, −𝑖} is group under multiplication, then LL 2 CO5
find the inverses of ‘ 𝑖’ and ‘− 𝑖 ’.
(j) What is an integral domain? Give a suitable example. LL 1 CO6

SECTION-B (Learning levels 1,2, and 3) Learning Course


levels as per Outcomes (CO)
Bloom’s

KIIT-DU/2023/SOT/Spring End Semester Examination-2023


taxonomy
2. (a) Show that ~(𝑝 ↔ 𝑞) and 𝑝 ↔ ~𝑞 are logically equivalent. [4] LL 2 CO 1
(b) Find the solution to the recurrence relation 𝑎 = 6𝑎 − [4] LL 2 CO 4
11𝑎 + 6𝑎 with initial conditions 𝑎 = 2 , 𝑎 =
5, 𝑎 = 15.

3. (a) Using Principle of inclusion and exclusion find the sum of [4] LL 2 CO2
all integers from 1 to 100 that are multiple of 2 or 3.
(b) Shoe that residue classes modulo 5 is a group with respect [4] LL 2 CO 5
to addition.

SECTION-C (Learning Levels 3 and 4) Learning Course


levels as per Outcomes (CO)
Bloom’s
taxonomy
4. (a) Check the validity of the argument: “All clear explanations [4] LL 3 CO 1
are satisfactory”; “Some excuses are unsatisfactory”.
“Hence some excuses are not clear explanation”.
(b) Find the transitive closure of the relation using Warshall’s [4] LL 4 CO 2
algorithm.
𝑅 = {(𝑎, 𝑏), (𝑏, 𝑑), (𝑑, 𝑎), (𝑑, 𝑐)} on the set 𝐴=
{𝑎, 𝑏, 𝑐, 𝑑}.

5. (a) Prove by induction that for each natural number 𝑛 , the [4] LL 3 CO 1
number 2 − 1 is a multiple of 3.
(b) Define a Ring, zero divisor in a ring. Show that 𝑍 is ring [4] LL 4 CO 6
and find it’s zero divisors.

6. (a) Using strong mathematical induction, prove that if 𝑛 is an [4] LL 3 CO 1


integer greater than 1, then it is either a prime or can be
written as the product of primes.
(b) Let 𝑅 be a relation on 𝑄 defined by [4] LL 4 CO3
𝑅 = {(𝑎, 𝑏)|2(𝑎 − 𝑏) ∈ 𝑍}
Show that 𝑅 is an equivalence relation and find the
equivalence classes of [0] and .

SECTION-D (Learning levels 4,5,6) Learning Course


levels as per Outcomes (CO)
Bloom’s
taxonomy
7. (a) Use truth table and an explanation to prove that Modus [4] LL 5 CO1
ponens rule of inference is a valid form of an argument.
(b) Show that (𝑃(𝑆), ⊆) is a POSET and construct the Hasse [4] CO 3
diagram where 𝑃(𝑆) is the power set of 𝑆 = {1,2,3}. LL 6

8. (a) Solve the recurrence relation 𝑎 = 3𝑎 + 10𝑎 + [4] LL 5 CO 4


7. 5 with 𝑎 = 4, 𝑎 = 3.

KIIT-DU/2023/SOT/Spring End Semester Examination-2023


(b) If 𝐺 is a group such that (𝑎. 𝑏) = 𝑎 . 𝑏 for all 𝑎, 𝑏 ∈ 𝐺 , [4] CO 5
then show that 𝐺 must be abelian group. LL 6
*****

Signature of Paper Setter/Moderator: ……Dr Akshaya Kumar Panda………………………………………….

Full Name of Paper Setter/Moderator: ………………………………………………

Mobile No. of Paper Setter/Moderator: …………………………………….……….

KIIT-DU/2023/SOT/Spring End Semester Examination-2023

You might also like