Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Search results for isi
0
votes
1
answer
1
ISI2021-PCB-C10
Suppose instead of a decoder with n input bits (n is even) to access a memory of size 2^n, one uses two decoders of input sizes k bits and (n-k) bits. Explain how these two decoders can be used to access the memory of size 2^N. ... address decoding time. Justify your answer. Assume that the time complexity of the decoder is measured by the number of output lines of that decoder.
Suppose instead of a decoder with n input bits (n is even) to access a memory of size 2^n, one uses two decoders of input sizes k bits and (n-k) bits. Explain how these t...
jatin29
558
views
jatin29
asked
May 3, 2022
Digital Logic
digital-logic
decoder
isi
+
–
1
votes
1
answer
2
ISI Kolkata | MMA | 2022 --- A lie detector determines correctly ....
Picture of question
Picture of question
anupamsworld
514
views
anupamsworld
asked
Jun 6, 2022
Probability
isi
probability
engineering-mathematics
+
–
0
votes
0
answers
3
List of MTech Exams after GATE
This can be a duplicate question please give me a link of the exams along with when in the date of registration so that I don't miss the dates.I am aware that TIFR happens before GATE,but other institute exams after gate.
This can be a duplicate question please give me a link of the exams along with when in the date of registration so that I don't miss the dates.I am aware that TIFR happen...
sripo
1.6k
views
sripo
asked
Nov 14, 2018
GATE
iit
iisc
gate-preparation
cmi
isi
bits
+
–
1
votes
2
answers
4
Interview: ISI mtech CS
Provide a synchronizing mechanism using semaphores such that a tiger and an elephant are not allowed to drink water from a pond simultaneously whereas more than one tiger or more than one elephant can.
Provide a synchronizing mechanism using semaphores such that a tiger and an elephant are not allowed to drink water from a pond simultaneously whereas more than one tiger...
Anwesha Kashyap
2.0k
views
Anwesha Kashyap
asked
Jun 19, 2018
Operating System
isi-interview
operating-system
process-synchronization
semaphore
+
–
14
votes
4
answers
5
ISI 2017
For each positive integer $n$ consider the set $S_n$ defined as follows: $S_1 = \{1\},\:S_2 = \{2, 3\},\:S_3 = \{4,5,6\}, \: \dots $ and in general, $S_{n+1}$ consists of $n+1$ consecutive integers the smallest of which is one more than the largest integer in $S_n$. Then the sum of all the integers in $S_{21}$ equals to $1113$ $53361$ $5082$ $4641$
For each positive integer $n$ consider the set $S_n$ defined as follows: $S_1 = \{1\},\:S_2 = \{2, 3\},\:S_3 = \{4,5,6\}, \: \dots $ and in general, $S_{n+1}$ consists of...
Abhijit Sen
1.8k
views
Abhijit Sen
asked
Apr 5, 2017
Combinatory
isi
combinatory
discrete-mathematics
normal
+
–
5
votes
4
answers
6
ISI CSB Sample Questions 2017
Station $A$ is sending data to station $B$ over a full duplex error free channel. A sliding window protocol is being used for flow control. The send and receive window size is being used for flow control. The send and receive window sizes ... . The propagation delay over the link is $\text{300 micro sec}$. What is the max achievable throughput in this communication?
Station $A$ is sending data to station $B$ over a full duplex error free channel. A sliding window protocol is being used for flow control. The send and receive window si...
Preeti1012
1.4k
views
Preeti1012
asked
May 11, 2017
Computer Networks
isi-2017
computer-networks
sliding-window
numerical-answers
+
–
0
votes
0
answers
7
ISI CSB 2018 Question number C4.
C4. Construct a Deterministic Finite Automaton (DFA) to accept L={s1s2.....sn | n >=1; for each i=1,2,.....n, si € {0,1}, and the number of 1's minus the number of 0's in s1s2....si is zero,one or two} For example, the DFA should accept 11 or 1100 but not 1110.
C4. Construct a Deterministic Finite Automaton (DFA) to acceptL={s1s2.....sn | n >=1; for each i=1,2,.....n, si € {0,1}, and the number of 1's minus the number of 0's i...
Anwesha Kashyap
304
views
Anwesha Kashyap
asked
Jun 19, 2018
Theory of Computation
isi
finite-automata
+
–
1
votes
0
answers
8
ISI CSB 2017
Consider the following relational schema: $\text{DOCTOR}(\textit{DoctorName}, \textbf{RegistrationNumber}$) $\text{PATIENT}(\textbf{PatientID}, \textit{PatientName})$ $\text{ASSIGNED-TO}(\textit{ PatientID, DoctorName})$. The primary keys for the DOCTOR and ... calculus expression(or an equivalent SQL query) to find the names of all patients who are assigned to more than one doctor.
Consider the following relational schema:$\text{DOCTOR}(\textit{DoctorName}, \textbf{RegistrationNumber}$)$\text{PATIENT}(\textbf{PatientID}, \textit{PatientName})$$\text...
shivanisrivarshini
1.2k
views
shivanisrivarshini
asked
Mar 20, 2018
Databases
isi
databases
sql
+
–
0
votes
1
answer
9
TOMATO
If A, B, C and D are statements such that if at least one of A and B is true, then at least one of C and D must be true. Further, both A and C are false. Then (a) if D is false then B is false (b) both B and D are false (c) both B and D are true (d) if D is true then B is true.
If A, B, C and D are statements such that if at least one of A andB is true, then at least one of C and D must be true. Further, both Aand C are false. Then(a) if D is fa...
pmshukla96
481
views
pmshukla96
asked
May 8, 2018
Mathematical Logic
isi-tomato-book-question
+
–
0
votes
0
answers
10
ISI CSB 2017
Consider a simple code in which each codeword consists of $2$ data bits $[d1, d0]$ and $3$ check bits $[c2, c1, c0]$. The check bits are computed as follows: $c2 = d1 \oplus d0$, where $\oplus$ is the modulo - $2$ sum $c1 = d1$, and ... a codeword can be detected by this code? Justify your answer. (iii) How many errors in a codeword can be corrected by this code? Justify your answer.
Consider a simple code in which each codeword consists of $2$ data bits $[d1, d0]$ and $3$ check bits $[c2, c1, c0]$.The check bits are computed as follows:$c2 = d1 \oplu...
Anwesha Kashyap
425
views
Anwesha Kashyap
asked
May 11, 2018
Computer Networks
isi
digital-logic
+
–
0
votes
1
answer
11
TOMATO
For any two sets $S$ and $T$, $SΔT$ is defined as the set of all elements that belong to either $S$ or $T$ but not both, that is, $SΔT = (S\cup T) – (S\cap T)$. Let $A, B$ and $C$ be sets such that $A\cap B\cap C = \phi$, and the number of elements in each of $AΔB$, $BΔC$ and $CΔA$ equals $100$. Then the number of elements in $A\cup B\cup C$ equals
For any two sets $S$ and $T$, $SΔT$ is defined as the set of all elements that belong to either $S$ or $T$ but not both, that is, $SΔT = (S\cup T) – (S\cap T)$. Let $...
pmshukla96
638
views
pmshukla96
asked
Apr 28, 2018
Set Theory & Algebra
isi-tomato-book-question
set-theory&algebra
+
–
0
votes
1
answer
12
ISI CSB 2017
The left-to-right post-order traversal of a tree $T$ yields the following sequence of nodes: $\text{D K E F B G L M H I J C A.}$ For each node of $T$ ... $T$.
The left-to-right post-order traversal of a tree $T$ yields the following sequence of nodes:$$\text{D K E F B G L M H I J C A.}$$For each node of $T$, the deg...
shivanisrivarshini
434
views
shivanisrivarshini
asked
Mar 20, 2018
Algorithms
isi
+
–
0
votes
0
answers
13
ISI CSB 2017
Consider the Boolean function $F(x_1,x_2,......,x_{10})$ realised by the following combinational circuit. $\text{Determine the number of input combinations for which the output function F realised by }$ $\text{ the circuit becomes true (logic 1)}$ I'm getting $940$ Input combinations
Consider the Boolean function $F(x_1,x_2,......,x_{10})$ realised by the following combinational circuit.$\text{Determine the number of input combinations for which the o...
shivanisrivarshini
420
views
shivanisrivarshini
asked
Mar 20, 2018
Digital Logic
isi
digital-logic
+
–
2
votes
1
answer
14
Programming in C
How many asterisks (*) in terms of k will be printed by the following C function, when called as count(m) where m = 3k? Justify your answer. Assume that 4 bytes are used to store an integer in C and k is such that 3k can be stored in 4 bytes. void count(int n) { printf("*"); if(n>1) { count(n/3); count(n/3); count(n/3); } }
How many asterisks (*) in terms of k will be printed by the following Cfunction, when called as count(m) where m = 3k? Justify your answer.Assume that 4 bytes are used to...
smsubham
460
views
smsubham
asked
Feb 13, 2018
Programming in C
programming-in-c
isi-pcb-2015-sample
+
–
0
votes
2
answers
15
ISI 2017
I find alpha <x+y which gives me x+y<2. But the answer is A. Can someone please help. Consider the statement$:$ $x(\alpha-x)<y(\alpha-y)$ for all $x,y$ with $0<x<y<1.$ The statement is true if and only if $\alpha\geq 2$ if and only if $\alpha >2$ if and only if $\alpha <-1$ for no values of $\alpha$
I find alpha <x+y which gives me x+y<2. But the answer is A. Can someone please help. Consider the statement$:$$x(\alpha-x)<y(\alpha-y)$ for all $x,y$ with $0<x<y<1.$The ...
Abhijit Sen
390
views
Abhijit Sen
asked
Apr 1, 2017
Set Theory & Algebra
isi
inequality
+
–
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