The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
GATE Overflow
Facebook Login
Google Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
Recent questions tagged booleanoperations
+1
vote
0
answers
1
Self Doubt
Which if the following are correct? (Multiple Possible) A ExNOR (BC) = (A ExNOR B) (A ExNOR C) A ExOR (B + C) = (A ExOR B) + (A ExOR C) A ExNOR (B + C) = (A ExNOR B) + (A ExNOR C) None of These
asked
Aug 8
in
Digital Logic
by
smsubham
Loyal
(
7.6k
points)

57
views
digitallogic
booleanexpressions
booleanalgebra
booleanoperations
+2
votes
1
answer
2
Precedence Of Logical Operators in C
#include <stdio.h> #include <iostream> using namespace std; int main() { printf("Hello World"); int a = 10, b = 20, c= 30, d = 40; int e = ++a  ++b  ++c && ++d; // DoubtFull Line cout<<"a = "<<a<< ... final Output should be: a = 11 b = 20 c = 31 d = 41. but the output is a = 11 b = 20 c = 30 d = 40
asked
Mar 1
in
Programming
by
Jason
Active
(
1.5k
points)

65
views
programminginc
booleanoperations
+4
votes
0
answers
3
Precedence and Associativity of Logical AND and OR
asked
Oct 16, 2017
in
Programming
by
Shubhanshu
Boss
(
15.2k
points)

121
views
programminginc
booleanoperations
+5
votes
3
answers
4
TIFR2014B17
Let $f: \left\{0, 1\right\}^{n} \rightarrow \left\{0, 1\right\}$ be a boolean function computed by a logical circuit comprising just binary AND and binary OR gates (assume that the circuit does not have any feedback). Let PARITY : $\left\{0, 1\right\} ... . , 1) = 1$ $f$ is the MAJORITY function. $f$ is the PARITY function. $f$ outputs $1$ at exactly one assignment of the input bits.
asked
Nov 20, 2015
in
Digital Logic
by
makhdoom ghaya
Boss
(
40.2k
points)

432
views
tifr2014
booleanoperations
+10
votes
2
answers
5
GATE19982.8
Which of the following operations is commutative but not associative? AND OR NAND EXOR
asked
Sep 26, 2014
in
Digital Logic
by
Kathleen
Veteran
(
59.5k
points)

2.5k
views
gate1998
digitallogic
easy
booleanoperations
+16
votes
3
answers
6
GATE19981.13
What happens when a bitstring is XORed with itself $n$times as shown: $\left[B \oplus (B \oplus ( B \oplus (B \dots n \text{ times}\right]$ complements when $n$ is even complements when $n$ is odd divides by $2^n$ always remains unchanged when $n$ is even
asked
Sep 26, 2014
in
Digital Logic
by
Kathleen
Veteran
(
59.5k
points)

1.4k
views
gate1998
digitallogic
normal
booleanoperations
+8
votes
5
answers
7
GATE19991.7
Which of the following expressions is not equivalent to $\bar{x}$? $x \text{ NAND } x$ $x \text{ NOR } x$ $x \text{ NAND } 1$ $x \text{ NOR } 1$
asked
Sep 23, 2014
in
Digital Logic
by
Kathleen
Veteran
(
59.5k
points)

913
views
gate1999
digitallogic
easy
booleanoperations
+10
votes
4
answers
8
GATE199202i
Choose the correct alternatives (more than one may be correct) and write the corresponding letters only: The operation which is commutative but not associative is: AND OR EXOR NAND
asked
Sep 13, 2014
in
Digital Logic
by
Kathleen
Veteran
(
59.5k
points)

468
views
gate1992
easy
digitallogic
booleanoperations
To see more, click for the
full list of questions
or
popular tags
.
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
Read/Unread questions
kvs pgt
Algorithms GO Classroom
Programming and DS GO Classroom
Discrete Mathematics GO Classroom
Follow @csegate
Gatecse
Recent questions tagged booleanoperations
Recent Blog Comments
following link is Kvs_Pgt_Question Paper...
@Arjun sir how to remove such post? should i hide...
[email protected]
.Plz do share @Sanjay sharma
Please post it as question
This is blog area post it as question
39,815
questions
46,794
answers
140,934
comments
58,863
users