Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Recent
Hot!
Most votes
Most answers
Most views
Previous GATE
Featured
Most answered questions
2
votes
1
answer
19501
NIELIT 2016 MAR Scientist C - Section C: 32
Two finite state machines are said to be equivalent if they have same number of states have same number of edges have same number of states and edges recognize same set of tokens
Two finite state machines are said to be equivalent if theyhave same number of stateshave same number of edgeshave same number of states and edgesrecognize same set of to...
admin
900
views
admin
asked
Apr 2, 2020
Theory of Computation
nielit2016mar-scientistc
theory-of-computation
finite-automata
+
–
1
votes
1
answer
19502
NIELIT 2016 MAR Scientist C - Section C: 33
In networking terminology UTP means Unshielded Twisted pair Ubiquitious Teflon port Uniformly Terminating port Unshielded T- connector port
In networking terminology UTP meansUnshielded Twisted pairUbiquitious Teflon portUniformly Terminating portUnshielded T- connector port
admin
554
views
admin
asked
Apr 2, 2020
Computer Networks
nielit2016mar-scientistc
computer-networks
+
–
1
votes
1
answer
19503
NIELIT 2016 MAR Scientist C - Section C: 35
Consider the schema $R=(\text{S T U V})$ and the dependencies $ S \rightarrow T, T \rightarrow U, U \rightarrow V$, and $V \rightarrow S.$ If $R=(R1 \text{ and } R2)$ be a decomposition such that $R1 \cap R2= \phi$ ... $\text{3 NF}$ in $\text{3 NF}$ but not in $\text{2 NF}$ in both $\text{2 NF}$ and $\text{3 NF}$
Consider the schema $R=(\text{S T U V})$ and the dependencies $ S \rightarrow T, T \rightarrow U, U \rightarrow V$, and $V \rightarrow S.$ If $R=(R1 \text{ and } R2)$ be...
admin
829
views
admin
asked
Apr 2, 2020
Databases
nielit2016mar-scientistc
databases
data-dependency
+
–
1
votes
1
answer
19504
NIELIT 2016 MAR Scientist C - Section C: 36
Odd parity of word can be conveniently tested by OR gate AND gate NOR gate XOR gate
Odd parity of word can be conveniently tested by OR gateAND gateNOR gateXOR gate
admin
1.8k
views
admin
asked
Apr 2, 2020
Digital Logic
nielit2016mar-scientistc
digital-logic
+
–
2
votes
1
answer
19505
NIELIT 2016 MAR Scientist C - Section C: 37
A sequential circuit outputs a $\text{ONE}$ when an even number$(>0)$ of one’s are input; otherwise the output is $\text{ZERO}.$ The minimum number of states required is $0$ $1$ $2$ $3$
A sequential circuit outputs a $\text{ONE}$ when an even number$(>0)$ of one’s are input; otherwise the output is $\text{ZERO}.$ The minimum number of states required i...
admin
1.2k
views
admin
asked
Apr 2, 2020
Digital Logic
nielit2016mar-scientistc
digital-logic
sequential-circuit
+
–
1
votes
1
answer
19506
NIELIT 2016 MAR Scientist C - Section C: 41
To build a mod-$19$ counter the number of flip-flop required is $3$ $5$ $7$ $8$
To build a mod-$19$ counter the number of flip-flop required is$3$$5$$7$$8$
admin
1.9k
views
admin
asked
Apr 2, 2020
Digital Logic
nielit2016mar-scientistc
digital-logic
flip-flop
+
–
1
votes
1
answer
19507
NIELIT 2016 MAR Scientist C - Section C: 44
Which of the following conditions must be met to avoid race around problem? $\Delta t< t_{p}< T$ $T>\Delta t> t_{p}$ $2t_{p}< \Delta t< T$ none of these
Which of the following conditions must be met to avoid race around problem?$\Delta t< t_{p}< T$$T>\Delta t t_{p}$$2t_{p}< \Delta t< T$none of these
admin
883
views
admin
asked
Apr 2, 2020
Digital Logic
nielit2016mar-scientistc
digital-logic
flip-flop
+
–
0
votes
1
answer
19508
NIELIT 2016 MAR Scientist C - Section C: 47
If a processor does not have any stack pointer register, then it cannot have subroutine call instruction it can have subroutine call instruction, but no nested subroutine calls nested subroutine calls are possible, but interrupts are not all sequences of subroutine calls and also interrupts are possible
If a processor does not have any stack pointer register, thenit cannot have subroutine call instructionit can have subroutine call instruction, but no nested subroutine c...
admin
654
views
admin
asked
Apr 2, 2020
CO and Architecture
nielit2016mar-scientistc
co-and-architecture
+
–
0
votes
1
answer
19509
NIELIT 2016 MAR Scientist C - Section C: 48
In a microprocessor, WAIT states are used to make the processor wait during a DMA operation make the processor wait during a power interrupt processing make the processor wait during a power shutdown interface slow peripherals to the processor
In a microprocessor, WAIT states are used to make the processor wait during a DMA operation make the processor wait during a power interrupt processingmake the processor ...
admin
611
views
admin
asked
Apr 2, 2020
Digital Signal Processing
nielit2016mar-scientistc
non-gate
microprocessors
+
–
1
votes
1
answer
19510
NIELIT 2016 MAR Scientist C - Section C: 49
We have a binary heap on $n$ elements and wish to insert $n$ more elements (not necessarily one after another) into this heap. Total time required for this is $\Theta (\log n)$ $\Theta (n)$ $\Theta (n \log n)$ $\Theta (n^{2})$
We have a binary heap on $n$ elements and wish to insert $n$ more elements (not necessarily one after another) into this heap. Total time required for this is$\Theta (\lo...
admin
717
views
admin
asked
Apr 2, 2020
DS
nielit2016mar-scientistc
data-structures
binary-heap
+
–
1
votes
1
answer
19511
NIELIT 2016 MAR Scientist C - Section C: 50
You are given the postorder traversal, $P$, of a binary search tree on the $n$ elements $1,2,\dots,n.$ You have to determine the unique binary search tree that has $P$ as its postorder traversal. What is the time complexity of the most efficient ... $\Theta(n)$ $\Theta(n \log n)$ None of the above, as the tree cannot be uniquely determined.
You are given the postorder traversal, $P$, of a binary search tree on the $n$ elements $1,2,\dots,n.$ You have to determine the unique binary search tree that has $P$ as...
admin
868
views
admin
asked
Apr 2, 2020
DS
nielit2016mar-scientistc
data-structures
binary-search-tree
+
–
3
votes
1
answer
19512
NIELIT 2016 MAR Scientist C - Section C: 52
Consider the process of inserting an element into a $Max\ Heap$, where the $Max\ Heap$ is represented by an $array$. Suppose we perform a binary search on the path from the new leaf to the root to find the position for the newly inserted element, the number of $comparisons$ ... $\Theta(n\log _{2} \log_2 n)$ $\Theta (n)$ $\Theta(n\log _{2}n)$
Consider the process of inserting an element into a $Max\ Heap$, where the $Max\ Heap$ is represented by an $array$. Suppose we perform a binary search on the path from ...
admin
2.0k
views
admin
asked
Apr 2, 2020
DS
nielit2016mar-scientistc
data-structures
binary-search
time-complexity
binary-heap
+
–
3
votes
1
answer
19513
NIELIT 2016 MAR Scientist C - Section C: 55
To sort many large objects or structures, it would be most efficient to place them in an array and sort the array pointers to them in an array and sort the array them in a linked list and sort the linked list references to them in an array and sort the array
To sort many large objects or structures, it would be most efficient to placethem in an array and sort the arraypointers to them in an array and sort the arraythem in a l...
admin
1.4k
views
admin
asked
Apr 2, 2020
DS
nielit2016mar-scientistc
data-structures
array
+
–
2
votes
1
answer
19514
NIELIT 2016 MAR Scientist C - Section C: 57
If initialization is a part of declaration of a structure, then storage class can be automatic register static anything
If initialization is a part of declaration of a structure, then storage class can beautomaticregisterstaticanything
admin
2.0k
views
admin
asked
Apr 2, 2020
Programming in C
nielit2016mar-scientistc
programming-in-c
+
–
2
votes
1
answer
19515
NIELIT 2016 MAR Scientist C - Section C: 58
For $x$ and $y$ are variables as declared below $\textit{double }x=0.005, \: y = – 0.01;$ What is the value of $\text{ceil }(x+y)$, where $\text{ceil }$ is a function to compute ceiling of a number? $1$ $0$ $0.005$ $0.5$
For $x$ and $y$ are variables as declared below $\textit{double }x=0.005, \: y = – 0.01;$ What is the value of $\text{ceil }(x+y)$, where $\text{ceil }$ is a function t...
admin
878
views
admin
asked
Apr 2, 2020
Programming in C
nielit2016mar-scientistc
programming-in-c
+
–
1
votes
1
answer
19516
NIELIT 2016 MAR Scientist C - Section C: 60
What will be the value of $x$ and $y$ after execution of the following statement(C language) n = 5; x = n++; y = -x; $5,-4$ $6,-5$ $6,-6$ $5,-5$
What will be the value of $x$ and $y$ after execution of the following statement(C language) n = 5; x = n++; y = -x;$5,-4$$6,-5$$6,-6$$5,-5$
admin
1.4k
views
admin
asked
Apr 2, 2020
Programming in C
nielit2016mar-scientistc
programming-in-c
+
–
1
votes
1
answer
19517
NIELIT 2016 MAR Scientist C - Section C: 62
The excess $3$ code is also called cyclic redundancy code weighted code self complimenting code algebraic code
The excess $3$ code is also called cyclic redundancy codeweighted codeself complimenting codealgebraic code
admin
606
views
admin
asked
Apr 2, 2020
Digital Logic
nielit2016mar-scientistc
digital-logic
+
–
3
votes
1
answer
19518
NIELIT 2016 MAR Scientist C - Section B: 4
If $A$ and $B$ are two related events, and $P(A \mid B)$ represents the conditional probability, Bayes’ theorem states that $P(A\mid B) = \dfrac{P(A)}{P(B)} P(B\mid A)$ $P(A\mid B) = P(A) P(B) P(B\mid A)$ $P(A\mid B) = \dfrac{P(A)}{P(B)}$ $P(A\mid B) = P(A)+P(B)$
If $A$ and $B$ are two related events, and $P(A \mid B)$ represents the conditional probability, Bayes’ theorem states that $P(A\mid B) = \dfrac{P(A)}{P(B)} P(B\mid A)$...
admin
787
views
admin
asked
Apr 2, 2020
Probability
nielit2016mar-scientistc
engineering-mathematics
probability
+
–
0
votes
1
answer
19519
NIELIT 2016 MAR Scientist C - Section B: 9
Consider three vectors $x=\begin{bmatrix}1\\2 \end{bmatrix}, y=\begin{bmatrix}4\\8 \end{bmatrix},z=\begin{bmatrix}3\\1 \end{bmatrix}$. Which of the folowing statements is true $x$ and $y$ are linearly independent $x$ and $y$ are linearly dependent $x$ and $z$ are linearly dependent $y$ and $z$ are linearly dependent
Consider three vectors $x=\begin{bmatrix}1\\2 \end{bmatrix}, y=\begin{bmatrix}4\\8 \end{bmatrix},z=\begin{bmatrix}3\\1 \end{bmatrix}$. Which of the folowing statements is...
admin
573
views
admin
asked
Apr 2, 2020
Linear Algebra
nielit2016mar-scientistc
engineering-mathematics
linear-algebra
eigen-vector
+
–
2
votes
1
answer
19520
NIELIT 2016 MAR Scientist C - Section B: 10
$\underset{x \rightarrow 0}{\lim} \dfrac{x^{3}+x^{2}-5x-2}{2x^{3}-7x^{2}+4x+4}=?$ $-0.5$ $(0.5)$ $\infty$ None of the above
$\underset{x \rightarrow 0}{\lim} \dfrac{x^{3}+x^{2}-5x-2}{2x^{3}-7x^{2}+4x+4}=?$ $-0.5$$(0.5)$$\infty$None of the above
admin
459
views
admin
asked
Apr 2, 2020
Calculus
nielit2016mar-scientistc
engineering-mathematics
calculus
limits
+
–
Page:
« prev
1
...
971
972
973
974
975
976
977
978
979
980
981
...
3230
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register