Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged isi
0
votes
1
answer
1
ISI Kolkata | MMA | 2022 --- A lie detector determines correctly ....
Picture of question
anupamsworld
asked
in
Probability
Jun 6
by
anupamsworld
132
views
isi
probability
engineering-mathematics
0
votes
1
answer
2
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.
jatin29
asked
in
Digital Logic
May 3
by
jatin29
129
views
digital-logic
decoder
isi
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.
sripo
asked
in
GATE
Nov 14, 2018
by
sripo
1.3k
views
iit
iisc
gate-preparation
cmi
isi
bits
0
votes
0
answers
4
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.
Anwesha Kashyap
asked
in
Theory of Computation
Jun 19, 2018
by
Anwesha Kashyap
225
views
isi
finite-automata
0
votes
0
answers
5
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.
Anwesha Kashyap
asked
in
Computer Networks
May 11, 2018
by
Anwesha Kashyap
270
views
isi
digital-logic
0
votes
1
answer
6
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$.
shivanisrivarshini
asked
in
Algorithms
Mar 20, 2018
by
shivanisrivarshini
272
views
isi
1
vote
0
answers
7
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.
shivanisrivarshini
asked
in
Databases
Mar 20, 2018
by
shivanisrivarshini
861
views
isi
databases
sql
0
votes
0
answers
8
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
shivanisrivarshini
asked
in
Digital Logic
Mar 20, 2018
by
shivanisrivarshini
260
views
isi
digital-logic
14
votes
4
answers
9
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$
Abhijit Sen
asked
in
Combinatory
Apr 6, 2017
by
Abhijit Sen
1.3k
views
isi
combinatory
discrete-mathematics
normal
0
votes
2
answers
10
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$
Abhijit Sen
asked
in
Set Theory & Algebra
Apr 1, 2017
by
Abhijit Sen
227
views
isi
inequality
To see more, click for the
full list of questions
or
popular tags
.
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
Life happens, just chill and do hardwork
ISRO RECRUITMENT FOR SCIENTIST B THROUGH GATE
POWER GRID CORPORATION OF INDIA LIMITED
INSTITUTE OF BANKING PERSONNEL SELECTION
GATE Overflow books for TIFR, ISRO, UGCNET and NIELIT
Subjects
All categories
General Aptitude
(2.4k)
Engineering Mathematics
(9.1k)
Digital Logic
(3.2k)
Programming and DS
(5.8k)
Algorithms
(4.5k)
Theory of Computation
(6.6k)
Compiler Design
(2.3k)
Operating System
(4.9k)
Databases
(4.5k)
CO and Architecture
(3.7k)
Computer Networks
(4.5k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(648)
Exam Queries
(841)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(855)
Recent questions tagged isi
Recent Blog Comments
@GO Classes @Deepak Poonia @Sachin...
@GO Classes @Deepak Poonia sir...
Maximum age limit changed from 35 yrs. to 28...
Hmm, sir totally getting your point ☺️☺️....
yes, that's fine. But saying so in a public forum...