Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Filter
Recent
Hot!
Most votes
Most answers
Most views
Previous GATE
Featured
Recent questions in Discrete Mathematics
1
vote
1
answer
241
Discrete Mathematics | Propositional Logic | Test 1 | Question: 5
A compound sentence is a $\textit{tautology}$ if it is true independently of the truth values of its component atomic sentences. A sentence is $\textit{atomic}$ if it contains no sentential connectives. A sentence $P$ ... ) $\neg P \rightarrow P$ $P \rightarrow \neg P$ $P \vee Q$ $P \vee \neg P$
ankitgupta.1729
asked
in
Mathematical Logic
Apr 11, 2023
by
ankitgupta.1729
238
views
testsbyankitg-dm-1
mathematical-logic
propositional-logic
1-mark
multiple-selects
2
votes
1
answer
242
Discrete Mathematics | Propositional Logic | Test 1 | Question: 6
A compound sentence is a $\textit{tautology}$ if it is true independently of the truth values of its component atomic sentences. A sentence is $\textit{atomic}$ if it contains no sentential connectives. Now, consider the following statements: For any ... (iii) are correct (i),(iii) and (iv) are correct (i),(ii) and (iv) are correct
ankitgupta.1729
asked
in
Mathematical Logic
Apr 11, 2023
by
ankitgupta.1729
201
views
testsbyankitg-dm-1
mathematical-logic
propositional-logic
1-mark
6
votes
0
answers
243
Discrete Mathematics | Propositional Logic | Test 1 | Question: 7
The $\textit{well-formed formulas (wff)}$ of propositional logic are obtained by using the following rules: 1. An atomic proposition $\phi$ is a well-formed formula. 2. If $\phi$ ... (P, Q and R are atomic propositions) Total number of well-formed formulas are ______
ankitgupta.1729
asked
in
Mathematical Logic
Apr 11, 2023
by
ankitgupta.1729
637
views
testsbyankitg-dm-1
numerical-answers
mathematical-logic
propositional-logic
2-marks
3
votes
1
answer
244
Discrete Mathematics | Propositional Logic | Test 1 | Question: 8
Consider the following truth table for the connective $\rightarrow:$ ... (i) and (iii) are correct (i) and (ii) are correct (i), (ii) and (iii) are correct
ankitgupta.1729
asked
in
Mathematical Logic
Apr 11, 2023
by
ankitgupta.1729
245
views
testsbyankitg-dm-1
mathematical-logic
propositional-logic
2-marks
2
votes
0
answers
245
Discrete Mathematics | Propositional Logic | Test 1 | Question: 9
Consider the following statements: "Ralph is a dog if he's not a puppet" can be formalized as $\neg$ (Ralph is a puppet) $\rightarrow$ (Ralph is a dog) "Ralph is not a dog because he's a puppet" ... correct $(i)$ and $(iii)$ are correct $(i),(ii)$ and $(iii)$ are correct
ankitgupta.1729
asked
in
Mathematical Logic
Apr 11, 2023
by
ankitgupta.1729
367
views
testsbyankitg-dm-1
mathematical-logic
propositional-logic
2-marks
3
votes
1
answer
246
Discrete Mathematics | Propositional Logic | Test 1 | Question: 10
Consider the following two statements: i. Sentence $\textit{Neither A nor B}$ can be represented by $A \downarrow B$ where $\downarrow$ is used in Boolean circuits for $\textit{nor}$ function. ii. Sentence $\textit{not at once A and B}$ ... $(i)$ is correct Only $(ii)$ is correct Both $(i)$ and $(ii)$ are correct None of the above
ankitgupta.1729
asked
in
Mathematical Logic
Apr 11, 2023
by
ankitgupta.1729
181
views
testsbyankitg-dm-1
mathematical-logic
propositional-logic
2-marks
5
votes
1
answer
247
Discrete Mathematics | Propositional Logic | Test 1 | Question: 11
A function $f:\{0,1\}^n \rightarrow \{0,1\}$ is called an $\textit{n-ary Boolean function}$ or $\textit{truth function}.$ We denote their totality by the set $\mathbf{B_n}.$ Now, $f \in \mathbf{B_n}$ is called $\textit{linear}$ ... of $\textit{n-ary linear Boolean functions}$ is: $2^{2^n}$ $2^{2^{n+1}}$ $2^n$ $2^{n+1}$
ankitgupta.1729
asked
in
Mathematical Logic
Apr 11, 2023
by
ankitgupta.1729
423
views
testsbyankitg-dm-1
mathematical-logic
propositional-logic
2-marks
6
votes
0
answers
248
Discrete Mathematics | Propositional Logic | Test 1 | Question: 12
The atomic propositional variables $p_0,p_1,...$ are $\textit{formulas},$ called $\textit{prime formulas},$ also called $\textit{atomic}$ formulas, or simply $\textit{primes}.$ ... a DNF nor a CNF. $p \vee \neg (\neg p \wedge q)$ is either a DNF or a CNF.
ankitgupta.1729
asked
in
Mathematical Logic
Apr 11, 2023
by
ankitgupta.1729
514
views
testsbyankitg-dm-1
mathematical-logic
propositional-logic
multiple-selects
2-marks
2
votes
1
answer
249
Discrete Mathematics | Propositional Logic | Test 1 | Question: 13
The set of logical symbols of a propositional language is called the $\textit{logical signature}.$ A logical signature is called $\textit{functionally complete}$ if every Boolean function is representable by a formula in this ... $\{\rightarrow\}$ is $\textit{not}$ functionally complete.
ankitgupta.1729
asked
in
Mathematical Logic
Apr 11, 2023
by
ankitgupta.1729
278
views
testsbyankitg-dm-1
mathematical-logic
propositional-logic
multiple-selects
2-marks
4
votes
1
answer
250
Discrete Mathematics | Propositional Logic | Test 1 | Question: 14
A compound sentence is a $\textit{tautology}$ if it is true independently of the truth values of its component atomic sentences. A sentence is $\textit{atomic}$ if it contains no sentential connectives. Let $P,Q$ and ... $(P \leftrightarrow P) \leftrightarrow P$ is a tautology Number of correct statements are ______
ankitgupta.1729
asked
in
Mathematical Logic
Apr 11, 2023
by
ankitgupta.1729
313
views
testsbyankitg-dm-1
numerical-answers
mathematical-logic
propositional-logic
2-marks
3
votes
2
answers
251
Discrete Mathematics | Propositional Logic | Test 1 | Question: 15
A compound sentence is a $\textit{tautology}$ if it is true independently of the truth values of its component atomic sentences. A sentence is $\textit{atomic}$ if it contains no sentential connectives. A sentence $P$ ... ) $\neg Q \rightarrow \neg P$ $Q \rightarrow P$ $P \rightarrow Q$ $\neg P \wedge Q$
ankitgupta.1729
asked
in
Mathematical Logic
Apr 11, 2023
by
ankitgupta.1729
404
views
testsbyankitg-dm-1
mathematical-logic
propositional-logic
multiple-selects
2-marks
4
votes
2
answers
252
GO Classes 2024 | Weekly Quiz 7 | Propositional Logic | Question: 1
Let $p,q$ be two atomic propositional assertions. Then which of the following is/are false? $(p \rightarrow q) \vee (p \rightarrow \neg q)$ is a tautology. $(p \rightarrow q) \vee (q \rightarrow p)$ ... $(p \rightarrow q) \vee (\neg q \rightarrow \neg p)$ is a tautology.
GO Classes
asked
in
Mathematical Logic
Apr 5, 2023
by
GO Classes
472
views
goclasses2024_wq7
goclasses
mathematical-logic
propositional-logic
multiple-selects
1-mark
8
votes
3
answers
253
GO Classes 2024 | Weekly Quiz 7 | Propositional Logic | Question: 2
Let’s consider the interpretation $v$ where $v(p) = F, v(q) = T, v(r) = T.$ Which of the following propositional formulas are satisfied by $v$? $(p \rightarrow \neg q) \vee \neg(r \wedge q)$ $(\neg p \vee \neg q) \rightarrow (p \vee \neg r)$ $\neg(\neg p \rightarrow \neg q) \wedge r$ $\neg (\neg p \rightarrow q \wedge \neg r)$
GO Classes
asked
in
Mathematical Logic
Apr 5, 2023
by
GO Classes
496
views
goclasses2024_wq7
goclasses
mathematical-logic
propositional-logic
multiple-selects
1-mark
8
votes
4
answers
254
GO Classes 2024 | Weekly Quiz 7 | Propositional Logic | Question: 3
Consider the following atomic propositions: $\text{R}$: It is Raining $\text{S}$ ... , and vice versa It is raining is equivalent to sonu is sick It is raining or sonu is sick but not both
GO Classes
asked
in
Mathematical Logic
Apr 5, 2023
by
GO Classes
521
views
goclasses2024_wq7
goclasses
mathematical-logic
propositional-logic
multiple-selects
1-mark
7
votes
1
answer
255
GO Classes 2024 | Weekly Quiz 7 | Propositional Logic | Question: 4
Consider the following arguments. $\text{Argument 1:}$ Kerry errs or Myrna fails to show. If Kerry errs, then he does not break the record. Myrna fails to show. Therefore, Kerry does break the record. $\text{Argument 2:}$ ... ? Only Argument $1$ is valid. Only Argument $2$ is valid. Both Arguments are valid. No Argument is valid.
GO Classes
asked
in
Mathematical Logic
Apr 5, 2023
by
GO Classes
341
views
goclasses2024_wq7
goclasses
mathematical-logic
propositional-logic
1-mark
5
votes
1
answer
256
GO Classes 2024 | Weekly Quiz 7 | Propositional Logic | Question: 11
Let $F$ and $G$ be two propositional formula. Which of the following is/are True? $F \vee G$ is a tautology iff at least one of them is a tautology If $F \rightarrow G$ is a tautology and $F$ is a tautology, then $G$ ... $(F \rightarrow G) \wedge (F \rightarrow \neg G)$ is a tautology iff $F$ is a contradiction.
GO Classes
asked
in
Mathematical Logic
Apr 5, 2023
by
GO Classes
640
views
goclasses2024_wq7
goclasses
mathematical-logic
propositional-logic
multiple-selects
2-marks
4
votes
1
answer
257
GO Classes 2024 | Weekly Quiz 7 | Propositional Logic | Question: 12
The implies connective $\rightarrow$ is one of the stranger connectives in propositional logic. Below are a series of statements regarding implications. Which of the following statements is/are TRUE? For any propositions $P$ and $Q,$ ... $R,$ the following statement is always true: $(P \rightarrow Q) \vee (R \rightarrow Q)$.
GO Classes
asked
in
Mathematical Logic
Apr 5, 2023
by
GO Classes
288
views
goclasses2024_wq7
goclasses
mathematical-logic
propositional-logic
multiple-selects
2-marks
11
votes
2
answers
258
GO Classes 2024 | Weekly Quiz 7 | Propositional Logic | Question: 13
Consider the following list of $137$ statements: $\left(S_1\right): $ There is exactly $1$ false statement in this list. $\left(S_2\right): $ There are exactly $2$ ... true. It is possible that more than one statement in this list is true. Exactly one statement in this list is true.
GO Classes
asked
in
Mathematical Logic
Apr 5, 2023
by
GO Classes
560
views
goclasses2024_wq7
goclasses
mathematical-logic
propositional-logic
2-marks
6
votes
2
answers
259
GO Classes 2024 | Weekly Quiz 7 | Propositional Logic | Question: 14
Which of the following logical arguments is/are valid? $\begin{aligned} & P \rightarrow(Q \rightarrow R) \\ & \neg R \\ \therefore & \neg P \\ & \end{aligned}$ ...
GO Classes
asked
in
Mathematical Logic
Apr 5, 2023
by
GO Classes
380
views
goclasses2024_wq7
goclasses
mathematical-logic
propositional-logic
multiple-selects
2-marks
8
votes
1
answer
260
GO Classes 2024 | Weekly Quiz 7 | Propositional Logic | Question: 15
The Logic Problem, taken from $\text{"WFF'N PROOF, The Game of Logic"}$ has these two assumptions: "Logic is difficult or not many students like logic." "If mathematics is easy, then logic ... is not easy or logic is difficult." "Logic is not difficult or mathematics is not easy."
GO Classes
asked
in
Mathematical Logic
Apr 5, 2023
by
GO Classes
318
views
goclasses2024_wq7
goclasses
mathematical-logic
propositional-logic
multiple-selects
2-marks
Page:
« prev
1
...
8
9
10
11
12
13
14
15
16
17
18
...
355
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Discrete Mathematics
(7.1k)
Mathematical Logic
(2.5k)
Set Theory & Algebra
(1.9k)
Combinatory
(1.6k)
Graph Theory
(1.1k)
Probability
(1.4k)
Linear Algebra
(1.1k)
Calculus
(792)
Optimization
(0)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent questions in Discrete Mathematics
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
Aptitude Overflow