Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Search results for gate1992+logic
78
votes
6
answers
1
GATE CSE 1992 | Question: 92,xv
Which of the following predicate calculus statements is/are valid? $(\forall (x)) P(x) \vee (\forall(x))Q(x) \implies (\forall (x)) (P(x) \vee Q(x))$ $(\exists (x)) P(x) \wedge (\exists (x))Q(x) \implies (\exists (x)) (P(x) \wedge Q(x))$ ... $(\exists (x)) (P(x) \vee Q(x)) \implies \sim (\forall (x)) P(x) \vee (\exists (x)) Q(x)$
Which of the following predicate calculus statements is/are valid?$(\forall (x)) P(x) \vee (\forall(x))Q(x) \implies (\forall (x)) (P(x) \vee Q(x))$$(\exists (x)) P(x) \w...
Arjun
16.6k
views
Arjun
asked
Sep 2, 2014
Mathematical Logic
gate1992
mathematical-logic
normal
first-order-logic
+
–
24
votes
4
answers
2
GATE CSE 1992 | Question: 02,xvi
Which of the following is/are a tautology? $a \vee b \to b \wedge c$ $a \wedge b \to b \vee c$ $a \vee b \to \left(b \to c \right)$ $a \to b \to \left(b \to c \right)$
Which of the following is/are a tautology?$a \vee b \to b \wedge c$$a \wedge b \to b \vee c$$a \vee b \to \left(b \to c \right)$$a \to b \to \left(b \to c \right)$
Kathleen
10.9k
views
Kathleen
asked
Sep 13, 2014
Mathematical Logic
gate1992
mathematical-logic
easy
propositional-logic
multiple-selects
+
–
25
votes
4
answers
3
GATE CSE 1992 | Question: 02-ii
All digital circuits can be realized using only Ex-OR gates Multiplexers Half adders OR gates
All digital circuits can be realized using onlyEx-OR gatesMultiplexersHalf addersOR gates
Kathleen
10.6k
views
Kathleen
asked
Sep 12, 2014
Digital Logic
gate1992
normal
digital-logic
digital-circuits
multiple-selects
functional-completeness
combinational-circuit
+
–
23
votes
4
answers
4
GATE CSE 1992 | Question: 01-i
The Boolean function in sum of products form where K-map is given below (figure) is _______
The Boolean function in sum of products form where K-map is given below (figure) is _______
Kathleen
5.3k
views
Kathleen
asked
Sep 12, 2014
Digital Logic
gate1992
digital-logic
k-map
normal
fill-in-the-blanks
+
–
25
votes
5
answers
5
GATE1992-04-b
A priority encoder accepts three input signals $\text{(A, B and C)}$ and produces a two-bit output $(X_1, X_0 )$ corresponding to the highest priority active input signal. Assume $A$ has the highest priority followed by $B$ and $C$ has the lowest ... none of the inputs are active the output should be $00$, design the priority encoder using $4:1$ multiplexers as the main components.
A priority encoder accepts three input signals $\text{(A, B and C)}$ and produces a two-bit output $(X_1, X_0 )$ corresponding to the highest priority active input signal...
Arjun
6.8k
views
Arjun
asked
Sep 22, 2015
Digital Logic
gate1992
digital-logic
combinational-circuit
multiplexer
descriptive
+
–
30
votes
4
answers
6
GATE CSE 1992 | Question: 02-i
The operation which is commutative but not associative is: AND OR EX-OR NAND
The operation which is commutative but not associative is:ANDOREX-ORNAND
Kathleen
7.4k
views
Kathleen
asked
Sep 12, 2014
Digital Logic
gate1992
easy
digital-logic
boolean-algebra
multiple-selects
+
–
16
votes
3
answers
7
GATE CSE 1992 | Question: 4-a
Consider addition in two's complement arithmetic. A carry from the most significant bit does not always correspond to an overflow. Explain what is the condition for overflow in two's complement arithmetic.
Consider addition in two's complement arithmetic. A carry from the most significant bit does not always correspond to an overflow. Explain what is the condition for overf...
Kathleen
2.6k
views
Kathleen
asked
Sep 13, 2014
Digital Logic
gate1992
digital-logic
normal
number-representation
descriptive
+
–
13
votes
1
answer
8
GATE CSE 1992 | Question: 15.a
Use Modus ponens $(A, A → B |= B)$ or resolution to show that the following set is inconsistent: $Q(x) \rightarrow P (x) \vee \sim R (a)$ $R (a) \vee \sim Q(a)$ $Q(a)$ $\sim P (y)$ where $x$ and $y$ are universally quantified variables, $a$ is a constant and $P, Q, R$ are monadic predicates.
Use Modus ponens $(A, A → B |= B)$ or resolution to show that the following set is inconsistent:$Q(x) \rightarrow P (x) \vee \sim R (a)$$R (a) \vee \sim Q(a)$$Q(a)$$\si...
Kathleen
3.4k
views
Kathleen
asked
Sep 13, 2014
Mathematical Logic
gate1992
normal
mathematical-logic
propositional-logic
descriptive
+
–
24
votes
4
answers
9
GATE1992-04-c
Design a $3$-bit counter using D-flip flops such that not more than one flip-flop changes state between any two consecutive states.
Design a $3$-bit counter using D-flip flops such that not more than one flip-flop changes state between any two consecutive states.
Arjun
3.4k
views
Arjun
asked
Sep 22, 2015
Digital Logic
gate1992
digital-logic
sequential-circuit
flip-flop
digital-counter
normal
descriptive
+
–
2
votes
0
answers
10
GATE CSE 1992 | Question: 06,a,b
A microprocessor is capable of addressing 1 megabyte of memory with a 20-bit address bus. The system to be designed requires 256 K bytes of RAM, 256 K bytes of EPROM, 16 I/O devices (memory mapped I/O) and 1 K byte of ... to two clock cycles for memory read and write. Assuming control signals similar to 8085, design the extra logic required for interfacing EERAM.
A microprocessor is capable of addressing 1 megabyte of memory with a 20-bit address bus. The system to be designed requires 256 K bytes of RAM, 256 K bytes of EPROM, 16 ...
Kathleen
1.1k
views
Kathleen
asked
Sep 13, 2014
Digital Logic
gate1992
digital-logic
descriptive
memory-interfacing
out-of-gate-syllabus
8085-microprocessor
+
–
To see more, click for the
full list of questions
or
popular tags
.
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register