Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Search results for digital-logic+isro2015
10
votes
6
answers
1
ISRO2015-8
Minimum number of $2 \times 1$ multiplexers required to realize the following function, $f = \overline{A} \;\overline{B} C + \overline{A}\; \overline{B} \;\overline{C}$ Assume that inputs are available only in true form and Boolean a constant $1$ and $0$ are available. $1$ $2$ $3$ $7$
Minimum number of $2 \times 1$ multiplexers required to realize the following function, $f = \overline{A} \;\overline{B} C + \overline{A}\; \overline{B} \;\overline{C}$As...
go_editor
10.7k
views
go_editor
asked
Jun 16, 2016
Digital Logic
isro2015
digital-logic
multiplexer
+
–
31
votes
6
answers
2
GATE CSE 1995 | Question: 2.12, ISRO2015-9
The number of $1$'s in the binary representation of $(3\ast4096 + 15\ast256 + 5\ast16 + 3)$ are: $8$ $9$ $10$ $12$
The number of $1$'s in the binary representation of $(3\ast4096 + 15\ast256 + 5\ast16 + 3)$ are:$8$$9$$10$$12$
Kathleen
18.4k
views
Kathleen
asked
Oct 8, 2014
Digital Logic
gate1995
digital-logic
number-representation
normal
isro2015
+
–
24
votes
5
answers
3
GATE CSE 2005 | Question: 16, ISRO2009-18, ISRO2015-2
The range of integers that can be represented by an $n$ bit $2’s$ complement number system is: $-2^{n-1} \text{ to } (2^{n-1} -1)$ $-(2^{n-1} -1) \text{ to } (2^{n-1} -1)$ $-2^{n-1} \text{ to } 2^{n-1}$ $-(2^{n-1} +1) \text{ to } (2^{n-1} -1)$
The range of integers that can be represented by an $n$ bit $2’s$ complement number system is:$-2^{n-1} \text{ to } (2^{n-1} -1)$$-(2^{n-1} -1) \text{ to } (2^{n-1} -1)...
Kathleen
9.8k
views
Kathleen
asked
Sep 22, 2014
Digital Logic
gatecse-2005
digital-logic
number-representation
easy
isro2009
isro2015
+
–
24
votes
6
answers
4
GATE CSE 2009 | Question: 7, ISRO2015-3
How many $32K \times 1$ RAM chips are needed to provide a memory capacity of $ 256K$ bytes? $8$ $32$ $64$ $128$
How many $32K \times 1$ RAM chips are needed to provide a memory capacity of $ 256K$ bytes?$8$$32$$64$$128$
Kathleen
17.6k
views
Kathleen
asked
Sep 22, 2014
Digital Logic
gatecse-2009
digital-logic
memory-interfacing
easy
isro2015
+
–
9
votes
5
answers
5
ISRO2015-7
If half adders and full adders are implements using gates, then for the addition of two $17$ bit numbers (using minimum gates) the number of half adders and full adders required will be $0,17$ $16,1$ $1,16$ $8,8$
If half adders and full adders are implements using gates, then for the addition of two $17$ bit numbers (using minimum gates) the number of half adders and full adders r...
ajit
9.7k
views
ajit
asked
Oct 12, 2015
Digital Logic
isro2015
digital-logic
adder
+
–
12
votes
3
answers
6
ISRO2015-4
A modulus -$12$ ring counter requires a minimum of $10$ flip-flops $12$ flip-flops $8$ flip-flops $6$ flip-flops
A modulus -$12$ ring counter requires a minimum of$10$ flip-flops$12$ flip-flops$8$ flip-flops$6$ flip-flops
ajit
10.5k
views
ajit
asked
Oct 12, 2015
Digital Logic
isro2015
digital-logic
digital-counter
+
–
9
votes
5
answers
7
ISRO2015-10
The boolean expression $\text{AB + A}\text{B}'+\text{A}'\text{C + AC}$ is independent of the boolean variable $\text{A}$ $\text{B}$ $\text{C}$ None of these
The boolean expression $\text{AB + A}\text{B}'+\text{A}'\text{C + AC}$ is independent of the boolean variable$\text{A}$$\text{B}$$\text{C}$None of these
go_editor
6.8k
views
go_editor
asked
Jun 17, 2016
Digital Logic
isro2015
digital-logic
boolean-algebra
+
–
12
votes
4
answers
8
ISRO2015-78
The decimal number has $64$ digits. The number of bits needed for its equivalent binary representation is? $200$ $213$ $246$ $277$
The decimal number has $64$ digits. The number of bits needed for its equivalent binary representation is?$200$$213$$246$$277$
anand007
10.5k
views
anand007
asked
Jun 14, 2016
Digital Logic
isro2015
digital-logic
number-representation
+
–
13
votes
2
answers
9
ISRO2015-1
Which of the given number has its $\text{IEEE - 754}$ $32$-bit floating point representation as $\text{(0 10000000 110 0000 0000 0000 0000 0000)}$ $2.5$ $3.0$ $3.5$ $4.5$
Which of the given number has its $\text{IEEE - 754}$ $32$-bit floating point representation as $\text{(0 10000000 110 0000 0000 0000 0000 0000)}$$2.5$$3.0$$3.5$$4.5$
go_editor
5.0k
views
go_editor
asked
Jun 15, 2016
Digital Logic
isro2015
digital-logic
number-representation
floating-point-representation
ieee-representation
+
–
10
votes
4
answers
10
ISRO2015-5
The complement of the Boolean expression $\text{AB}(\overline{\text{B}}\text{C + AC})$ is $(\overline{\text{A}} + \overline{\text{B}})+(\text{B} + \overline{\text{C}}). (\overline{\text{A}} + \overline{\text{C}})$ ... $\text{(A+B)} . (\overline{\text{B}}+\text{C) (A+C)}$
The complement of the Boolean expression $\text{AB}(\overline{\text{B}}\text{C + AC})$ is$(\overline{\text{A}} + \overline{\text{B}})+(\text{B} + \overline{\text{C}}). (\...
go_editor
4.5k
views
go_editor
asked
Jun 16, 2016
Digital Logic
isro2015
digital-logic
boolean-algebra
+
–
9
votes
1
answer
11
ISRO2015-6
The code which uses $7$ bits to represent a character is : ASCII BCD EBCDIC Gray
The code which uses $7$ bits to represent a character is :ASCIIBCDEBCDICGray
Desert_Warrior
5.8k
views
Desert_Warrior
asked
May 24, 2016
Digital Logic
isro2015
digital-logic
number-representation
+
–
1
votes
1
answer
12
ISRO2015-EC Flipflop
What is the functionality of following digital circuit? A is input data, CLK is system clock ind Y is output. Falling edge detection of input A Clock division by $2$ Rising edge detection of input A Clock division by $4$
What is the functionality of following digital circuit? A is input data, CLK is system clock ind Y is output.Falling edge detection of input AClock division by $2$Rising ...
sh!va
744
views
sh!va
asked
Feb 22, 2017
Digital Logic
isro2015-ece
isro-ece
digital-logic
+
–
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