Recent questions tagged digital-logic / GATE Overflow for GATE CSE

0 votes

1 answer

271

MUX | digital-logic multiplexer | MadeEasy
Ans: 35 Please Explain

Ans: 35 Please Explain

abhinowKatore

891 views

abhinowKatore asked Dec 23, 2022

1 votes

0 answers

272

DRDO CSE 2022 Paper 1 | Question: 6 (b)
Let $\oplus$ sign denote bitwise addition modulo $2$. Let $n$ and $m$ be integers. Consider the set of $m$ equations on $n$ variables as follows. \[\begin{array}{l} a_{1,1} x_{1} \oplus a_{1,2} x_{2} \oplus \ldots \ ... $\{0,1\}$. What is the expected number of equations that can be satisfied if $x_i$'s are picked uniformly and independently at random.

Let $\oplus$ sign denote bitwise addition modulo $2$. Let $n$ and $m$ be integers.Consider the set of $m$ equations on $n$ variables as follows.\[\begin{array}{l}a_{1,1} ...

admin

303 views

admin asked Dec 15, 2022

2 votes

0 answers

273

DRDO CSE 2022 Paper 1 | Question: 6 (a)
Let $\oplus$ sign denote bitwise addition modulo $2$. Let $n$ and $m$ be integers. Consider the set of $m$ equations on $n$ variables as follows. \[\begin{array}{l} a_{1,1} x_{1} \oplus a_{1,2} x_{2} \oplus \ldots \oplus a_{1, n} x_{n}=b_{ ... $a_{1, n} x_{n}=b_{1}$ if all $x_{i}$'s are picked uniformly and independently at random from $\{0,1\}$.

Let $\oplus$ sign denote bitwise addition modulo $2$. Let $n$ and $m$ be integers.Consider the set of $m$ equations on $n$ variables as follows.\[\begin{array}{l}a_{1,1} ...

admin

328 views

admin asked Dec 15, 2022

1 votes

1 answer

274

DRDO CSE 2022 Paper 1 | Question: 21
For decimal number $-30$, the $16$-bit $2$'s complement representation is _________

For decimal number $-30$, the $16$-bit $2$'s complement representation is _________

admin

300 views

admin asked Dec 15, 2022

1 votes

1 answer

275

DRDO CSE 2022 Paper 1 | Question: 22
How many minimum number of $\text{NOR}$ gates are required to implement the function $F=A^{\prime} B^{\prime} C^{\prime}+A B C^{\prime}$

How many minimum number of $\text{NOR}$ gates are required to implement the function $F=A^{\prime} B^{\prime} C^{\prime}+A B C^{\prime}$

admin

296 views

admin asked Dec 15, 2022

1 votes

0 answers

276

DRDO CSE 2022 Paper 1 | Question: 23
For two flip-flops $F_{1}$ and $F_{2}$ and input $\mathrm{X}$, the next state and output is given as \[ \begin{array}{c} F_{1}(t+1)=\sum(1,2,5,6) \\ F_{2}(t+1)=\sum(3,7) \\ Y\left(F_{1}, F_{2}, X\right)=\sum(4,6) \end{array} \] Write functions for the next state and output of the circuit.

For two flip-flops $F_{1}$ and $F_{2}$ and input $\mathrm{X}$, the next state and output is given as\[\begin{array}{c}F_{1}(t+1)=\sum(1,2,5,6) \\F_{2}(t+1)=\sum(3,7) \\Y\...

admin

243 views

admin asked Dec 15, 2022

1 votes

0 answers

277

DRDO CSE 2022 Paper 1 | Question: 24
Given a truth table of the full adder for three inputs. Draw a full adder circuit with a decoder and two $\text{OR}$ ...

Given a truth table of the full adder for three inputs. Draw a full adder circuit with a decoder and two $\text{OR}$ gates.$$\begin{array}{|c|c|c|c|c|}\hline \mathrm{X} &...

admin

241 views

admin asked Dec 15, 2022

1 votes

1 answer

278

DRDO CSE 2022 Paper 1 | Question: 25
Simplify the Boolean function $F=W^{\prime} X^{\prime} Y^{\prime}+W X^{\prime} Y^{\prime}+W^{\prime} X Y Z^{\prime}+X^{\prime} Y Z^{\prime}$

Simplify the Boolean function $F=W^{\prime} X^{\prime} Y^{\prime}+W X^{\prime} Y^{\prime}+W^{\prime} X Y Z^{\prime}+X^{\prime} Y Z^{\prime}$

admin

329 views

admin asked Dec 15, 2022

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