Scribd
Upload
32 views2 pages

DMS 1ia With Awd

This document outlines the test structure for the Discrete Structures For Computing course for IV Semester UG students in the Faculty of Engineering and Technology. It includes a list of questions that students must answer, covering topics such as truth tables, logical equivalences, and proofs. The test is scheduled for October 2024 and is worth a maximum of 25 marks.

Uploaded by

meghanas
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
32 views2 pages

DMS 1ia With Awd

This document outlines the test structure for the Discrete Structures For Computing course for IV Semester UG students in the Faculty of Engineering and Technology. It includes a list of questions that students must answer, covering topics such as truth tables, logical equivalences, and proofs. The test is scheduled for October 2024 and is worth a maximum of 25 marks.

Uploaded by

meghanas
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

USN

Faculty of Engineering and Technology


IV Semester UG, Oct 2024
Test– I
School Faculty of Engineering Program Computer Science and Engineering
Semester IV Sem Section A,B,C,D,E
Course Discrete Structures For Computing Course Code UE23CS2403
Date Time
AY 2024-25 (Even Semester) Max. Marks 25

Note: Answer Any Five Full Questions, Choosing ONE full Question from each Section
Q. BT
Questions Marks CO
No. Level

Explain the following with truth table


1 6 2 2
Conjunction, Disjunction, Conditional, Biconditional
OR
Let p: A circle is a Conic
q: 5 is a real number
2 r: Exponential series is convergent 6 2 2
Rephrase the following Compound prepositions in Verbal form
i ¿ p ∧¿ ) ii) q → ( ∼ p ) iii ¿( p ∧ q)⟶(∼ r)

Construct the Truth Table for the following


3 4 3 3
i ¿( p ∧q)→(∼r )ii ¿ q ∧(∼r ⟶ p)
OR
Define Tautology. Identify the following compound prepositions are Tautology,
Contradiction or Contingency by using truth table.
4 4 3 3
i ¿ { p ⟶ ( q ⟶ r ) }⟶ {( p ⟶ q ) ⟶ ( p ⟶ r ) }

Apply the Laws of Logic to prove the following logical equivalence without using a
5 truth table. 5 3 3
i ¿ { p ∨ q ∨ ( ∼ p ∧∼ q ∧ r ) } ⟺ ( p∨ q ∨ r )ii){ ( p ∨q ) ∧( p ∨∼ q) } ∨ q ⟺ p ∨q
OR
Identify whether the following propositions form a valid or invalid argument.
If I study, I will not fail in the examination
6 If I do not Watch TV in the evening, I will study 5 3 3
I failed in the examination
I must have Watched TV in the evening

7 Test whether the following notation represents a valid argument or not: 4 4 2


i ¿q⟶ p ii) q ⟶ p
r ⟶s ∼q⟶∼ p
p ∨r p
USN

(q ∨ s ) p ⟶r
OR
Analyze the following statement and provide an indirect proof: "The product of two
even integers is an even integer."
8 4 4 2
Analyze the following statement and illustrate a proof by contradiction: "If n2 is an
odd integer, then n is odd."

Prove by mathematical induction for the statement: for each


9 6 5 4
n
( n) ( n +1) ( 2 n+ 1)
+¿ , ∑ i =1 +2 +3 ±−−−−−−∓n =
2 2 2 2 2
¿
6
n∈z i=1

determine the number of ways to arrange the integers 1, 2, 3, …, 10 in a line while


10 6 5 4
ensuring that no even integer appears in its natural position?

Course Coordinator Program Coordinator Dean- Faculty

You might also like