Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Vishalk17
7
answers
1
GATE CSE 1995 | Question: 2.21
The postfix expression for the infix expression $A+B*(C+D)/F+D*E$ is: $AB + CD + *F/D +E*$ $ABCD + *F/DE* ++$ $A * B + CD/F *DE ++$ $A + *BCD/F* DE ++$
The postfix expression for the infix expression $A+B*(C+D)/F+D*E$ is:$AB + CD + *F/D +E*$$ABCD + *F/DE* ++$$A * B + CD/F *DE ++$$A + *BCD/F* DE ++$
38.3k
views
answered
Sep 17, 2022
DS
gate1995
data-structures
stack
easy
+
–
4
answers
2
GATE CSE 2014 Set 2 | Question: 6
The dual of a Boolean function $F(x_1,x_2,\dots,x_n,+, .,')$, written as $F^D$ is the same expression as that of $F$ with $+$ and $⋅$ swapped. $F$ is said to be self-dual if $F = F^D$. The number of self-dual functions with $n$ Boolean variables is $2^n$ $2^{n-1}$ $2^{2^{n}}$ $2^{2^{n-1}}$
The dual of a Boolean function $F(x_1,x_2,\dots,x_n,+, .,')$, written as $F^D$ is the same expression as that of $F$ with $+$ and $⋅$ swapped. $F$ is said to be self-du...
12.4k
views
commented
Sep 11, 2022
Digital Logic
gatecse-2014-set2
digital-logic
normal
dual-function
+
–
4
answers
3
GATE CSE 2001 | Question: 2.17 | UGCNET-AUG2016-III: 21
What is printed by the print statements in the program $P1$ assuming call by reference parameter passing? Program P1() { x = 10; y = 3; func1(y,x,x); print x; print y; } func1(x,y,z) { y = y + 4; z = x + y + z } $\text{10, 3}$ $\text{31, 3}$ $\text{27, 7}$ None of the above
What is printed by the print statements in the program $P1$ assuming call by reference parameter passing?Program P1() { x = 10; y = 3; func1(y,x,x); print x; print y; } f...
12.4k
views
answered
Jul 22, 2022
Programming in C
gatecse-2001
programming-in-c
parameter-passing
normal
ugcnetcse-aug2016-paper3
+
–
8
answers
4
GATE CSE 2021 Set 1 | Question: 7
Let $p$ and $q$ be two propositions. Consider the following two formulae in propositional logic. $S_1: (\neg p\wedge(p\vee q))\rightarrow q$ $S_2: q\rightarrow(\neg p\wedge(p\vee q))$ Which one of the following choices is correct? Both $S_1$ and ... but $S_2$ is not a tautology $S_1$ is not a tautology but $S_2$ is a tautology Neither $S_1$ nor $S_2$ is a tautology
Let $p$ and $q$ be two propositions. Consider the following two formulae in propositional logic.$S_1: (\neg p\wedge(p\vee q))\rightarrow q$$S_2: q\rightarrow(\neg p\wedge...
8.4k
views
answered
May 1, 2022
Mathematical Logic
gatecse-2021-set1
mathematical-logic
propositional-logic
1-mark
+
–
11
answers
5
GATE CSE 2016 Set 2 | Question: 01
Consider the following expressions: $false$ $Q$ $true$ $P\vee Q$ $\neg Q\vee P$ The number of expressions given above that are logically implied by $P \wedge (P \Rightarrow Q)$ is ___________.
Consider the following expressions:$false$$Q$$true$$P\vee Q$$\neg Q\vee P$The number of expressions given above that are logically implied by $P \wedge (P \Rightarrow Q)$...
20.1k
views
answered
Apr 30, 2022
Mathematical Logic
gatecse-2016-set2
mathematical-logic
normal
numerical-answers
propositional-logic
+
–
5
answers
6
NIELIT 2016 MAR Scientist C - Section C: 65
In propositional logic, which of the following is equivalent to $p \rightarrow q$? $\sim p\rightarrow q$ $ \sim p \vee q$ $ \sim p \vee \sim q$ $p\rightarrow \sim q$
In propositional logic, which of the following is equivalent to $p \rightarrow q$?$\sim p\rightarrow q$$ \sim p \vee q$$ \sim p \vee \sim q$$p\rightarrow \sim q$
2.5k
views
answered
Apr 1, 2022
Mathematical Logic
nielit2016mar-scientistc
discrete-mathematics
mathematical-logic
+
–
9
answers
7
GATE CSE 1987 | Question: 10e
Show that the conclusion $(r \to q)$ follows from the premises$:p, (p \to q) \vee (p \wedge (r \to q))$
Show that the conclusion $(r \to q)$ follows from the premises$:p, (p \to q) \vee (p \wedge (r \to q))$
5.3k
views
answered
Apr 1, 2022
Mathematical Logic
gate1987
mathematical-logic
propositional-logic
proof
descriptive
+
–
3
answers
8
GATE CSE 1988 | Question: 2vii
Define the validity of a well-formed formula(wff)?
Define the validity of a well-formed formula(wff)?
1.9k
views
commented
Apr 1, 2022
Mathematical Logic
gate1988
descriptive
mathematical-logic
propositional-logic
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register