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
0
votes
1
answer
19471
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 7
The number of the edges in a regular graph of degree $’d’$ and $’n’$ vertices is Maximum of $n,d$ $n+d$ $nd$ $nd/2$
The number of the edges in a regular graph of degree $’d’$ and $’n’$ vertices is Maximum of $n,d$$n+d$$nd$$nd/2$
admin
572
views
admin
asked
Apr 1, 2020
Graph Theory
nielit2017oct-assistanta-cs
discrete-mathematics
graph-theory
degree-of-graph
+
–
0
votes
1
answer
19472
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 9
A language $L$ for which there exists a $TM\;\;’T’,$ that accepts every word in $L$ and either rejects or loops for every word that is not in $L,$ is said to be Recursive Recursively enumerable NP-HARD None of the above
A language $L$ for which there exists a $TM\;\;’T’,$ that accepts every word in $L$ and either rejects or loops for every word that is not in $L,$ is said to beRecurs...
admin
555
views
admin
asked
Apr 1, 2020
Theory of Computation
nielit2017oct-assistanta-cs
theory-of-computation
recursive-and-recursively-enumerable-languages
+
–
0
votes
1
answer
19473
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 10
Consider an $\varepsilon$-tree CFG. If for every pair of productions $A\rightarrow u$ and $A\rightarrow v$ If $\text{FIRST(u)} \cap \text{FIRST(v)}$ is empty then the CFG has to be $LL(1).$ If the CFG is $LL(1)$ then $\text{FIRST(u)} \cap \text{FIRST(v)}$ has to be empty. Both $(A)$ and $(B)$ None of the above
Consider an $\varepsilon$-tree CFG. If for every pair of productions $A\rightarrow u$ and $A\rightarrow v$If $\text{FIRST(u)} \cap \text{FIRST(v)}$ is empty then the CFG ...
admin
3.2k
views
admin
asked
Apr 1, 2020
Compiler Design
nielit2017oct-assistanta-cs
compiler-design
context-free-grammar
first-and-follow
+
–
1
votes
1
answer
19474
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 14
E-R model uses this symbol to represent weak entity set? Dotted rectangle Diamond Doubly outlined rectangle None of these
E-R model uses this symbol to represent weak entity set?Dotted rectangleDiamondDoubly outlined rectangleNone of these
admin
903
views
admin
asked
Apr 1, 2020
Databases
nielit2017oct-assistanta-cs
databases
relational-model
+
–
0
votes
1
answer
19475
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 15
By open domain CASE tools we mean tools available in open domain software packages which can be downloaded from the internet software packages to aid each phase of the systems analysis and design which can be downloaded free of cost from the internet source codes of CASE tools
By open domain CASE tools we meantools available in open domainsoftware packages which can be downloaded from the internetsoftware packages to aid each phase of the syste...
admin
559
views
admin
asked
Apr 1, 2020
IS&Software Engineering
nielit2017oct-assistanta-cs
non-gate
is&software-engineering
+
–
1
votes
1
answer
19476
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 17
A can is filled with $5$ paise coins. Another can is filled with $10$ paise coins. Another can is filled with $25$ paise coins. All the cans are given wrong labels. If the can labeled $25$ paise is not having the $10$ paise coins, what will the can, labeled $10$ paise have? $25$ paise $5$ paise $10$ paise cannot be determined
A can is filled with $5$ paise coins. Another can is filled with $10$ paise coins. Another can is filled with $25$ paise coins. All the cans are given wrong labels. If th...
admin
967
views
admin
asked
Apr 1, 2020
Quantitative Aptitude
nielit2017oct-assistanta-cs
general-aptitude
quantitative-aptitude
+
–
2
votes
1
answer
19477
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 18
What is the maximum value of the function $f(x) = 2x^{2} – 2x + 6$ in the interval $[0,2]?$ $6$ $10$ $12$ $5,5$
What is the maximum value of the function $f(x) = 2x^{2} – 2x + 6$ in the interval $[0,2]?$$6$$10$$12$$5,5$
admin
647
views
admin
asked
Apr 1, 2020
Calculus
nielit2017oct-assistanta-cs
engineering-mathematics
calculus
maxima-minima
+
–
0
votes
1
answer
19478
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 19
The value of the Integral $I = \displaystyle{}\int_{0}^{\pi/2} x^{2}\sin x dx$ is $(x+2)/2$ $2/(\pi-2)$ $\pi – 2$ $\pi + 2$
The value of the Integral $I = \displaystyle{}\int_{0}^{\pi/2} x^{2}\sin x dx$ is$(x+2)/2$$2/(\pi-2)$$\pi – 2$$\pi + 2$
admin
475
views
admin
asked
Apr 1, 2020
Calculus
nielit2017oct-assistanta-cs
engineering-mathematics
calculus
definite-integral
+
–
0
votes
1
answer
19479
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 23
Which of the following would not be specified in a communication protocol? Header contents Trailer contents Error Checking Data content of message
Which of the following would not be specified in a communication protocol?Header contentsTrailer contentsError CheckingData content of message
admin
1.6k
views
admin
asked
Apr 1, 2020
Computer Networks
nielit2017oct-assistanta-cs
computer-networks
network-protocols
+
–
0
votes
1
answer
19480
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 28
The capacity relationship is given by $C = W\log_{2}(1+S/N)$ $C = 2W\log_{2}(1+S/N)$ $C = W\log_{2}(1-S/N)$ $C = W\log_{10}(1+S/N)$
The capacity relationship is given by$C = W\log_{2}(1+S/N)$$C = 2W\log_{2}(1+S/N)$$C = W\log_{2}(1-S/N)$$C = W\log_{10}(1+S/N)$
admin
570
views
admin
asked
Apr 1, 2020
Information Theory
nielit2017oct-assistanta-cs
non-gate
+
–
0
votes
1
answer
19481
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 32
Choose the correct statements. A total recursive function is also a partial recursive function A partial recursive function is also a total recursive function A partial recursive function is also a primitive recursive function None of the above
Choose the correct statements.A total recursive function is also a partial recursive functionA partial recursive function is also a total recursive functionA partial recu...
admin
1.1k
views
admin
asked
Apr 1, 2020
Theory of Computation
nielit2017oct-assistanta-cs
theory-of-computation
recursion
+
–
0
votes
1
answer
19482
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 33
The address sequence generated by tracing a particular program executing in a pure demand paging system with $100$ records per page, with $1$ free main memory frame is recorded as follows. What is the number of Page Faults? $0100,0200,0430,0510,0530,0560,0120,0220,0240,0260,0320,0370.$ $15,4$ $6,4$ $7,2$ $4,6$
The address sequence generated by tracing a particular program executing in a pure demand paging system with $100$ records per page, with $1$ free main memory frame is re...
admin
2.1k
views
admin
asked
Apr 1, 2020
Operating System
nielit2017oct-assistanta-cs
operating-system
demand-paging
page-fault
+
–
1
votes
1
answer
19483
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 34
Assume transaction $A$ holds a shared lock $R.$ If transaction $B$ also requests for a shared lock on $R.$ It will result in deadlock situation immediately be granted immediately be rejected be granted as soon as it is released by $A$
Assume transaction $A$ holds a shared lock $R.$ If transaction $B$ also requests for a shared lock on $R.$ It willresult in deadlock situationimmediately be grantedimmedi...
admin
1.9k
views
admin
asked
Apr 1, 2020
Databases
nielit2017oct-assistanta-cs
databases
transaction-and-concurrency
deadlock-prevention-avoidance-detection
+
–
2
votes
1
answer
19484
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 36
Table employees has $10$ records. It has a non-NULL SALARY column which is also UNIQUE. The SQL statement SELECT COUNT(*) FROM EMPLOYEE WHERE SALARY > ALL (SELECT SALARY FROM EMPLOYEE); $10$ $9$ $5$ $0$
Table employees has $10$ records. It has a non-NULL SALARY column which is also UNIQUE. The SQL statementSELECT COUNT(*)FROM EMPLOYEEWHERE SALARY ALL (SELECT SALARY FROM...
admin
1.6k
views
admin
asked
Apr 1, 2020
Databases
nielit2017oct-assistanta-cs
databases
sql
+
–
3
votes
1
answer
19485
NIELIT 2017 DEC Scientific Assistant A - Section B: 11
Closed - Loop control mechanism try to : Remove congestion after it occurs Remove congestion after sometime Prevent congestion before it occurs Prevent congestion before sending packets
Closed - Loop control mechanism try to :Remove congestion after it occursRemove congestion after sometimePrevent congestion before it occursPrevent congestion before send...
admin
2.5k
views
admin
asked
Mar 31, 2020
Computer Networks
nielit2017dec-assistanta
computer-networks
congestion-control
+
–
0
votes
1
answer
19486
NIELIT 2017 DEC Scientific Assistant A - Section B: 13
Which multiple access technique is used by $\text{IEEE } 802.11$ standard for wireless $\text{LAN}$ ? $\text{CDMA}$ $\text{CSMA/CA}$ $\text{ALOHA}$ None of the options
Which multiple access technique is used by $\text{IEEE } 802.11$ standard for wireless $\text{LAN}$ ?$\text{CDMA}$$\text{CSMA/CA}$$\text{ALOHA}$None of the options
admin
2.0k
views
admin
asked
Mar 31, 2020
Computer Networks
nielit2017dec-assistanta
computer-networks
csma-ca
+
–
1
votes
1
answer
19487
NIELIT 2017 DEC Scientific Assistant A - Section B: 19
Let $P, Q, R$ be a regular expression over $\Sigma$. If $P$ does not contain null string, then $R=Q+RP$ has a unique solution ___________ . $Q^{*}P$ $QP^{*}$ $Q^{*}P^{*}$ $\left ( P^{*}O^{*} \right)^{*}$
Let $P, Q, R$ be a regular expression over $\Sigma$. If $P$ does not contain null string, then $R=Q+RP$ has a unique solution ___________ .$Q^{*}P$$QP^{*}$$Q^{*}P^{*}$$\l...
admin
1.3k
views
admin
asked
Mar 31, 2020
Theory of Computation
nielit2017dec-assistanta
theory-of-computation
regular-expression
+
–
2
votes
1
answer
19488
NIELIT 2017 DEC Scientific Assistant A - Section B: 21
The $2-3-4$ tree is a self-balancing data structure, which is also called : $2-4$ tree $B+$ tree $B-$ tree None of the options
The $2-3-4$ tree is a self-balancing data structure, which is also called :$2-4$ tree$B+$ tree$B-$ treeNone of the options
admin
1.6k
views
admin
asked
Mar 31, 2020
Databases
nielit2017dec-assistanta
databases
b-tree
+
–
2
votes
1
answer
19489
NIELIT 2017 DEC Scientific Assistant A - Section B: 22
Which type of algorithm is used to solve the "$8$ Queens" problem ? Greedy Dynamic Divide and conquer Backtracking
Which type of algorithm is used to solve the "$8$ Queens" problem ?GreedyDynamicDivide and conquerBacktracking
admin
4.4k
views
admin
asked
Mar 31, 2020
Algorithms
nielit2017dec-assistanta
algorithms
backtracking
easy
+
–
1
votes
1
answer
19490
NIELIT 2017 DEC Scientific Assistant A - Section B: 24
A subnet mask in class $C$ can have _____________ $1$’s with the remaining bits $0$’s. $10$ $24$ $12$ $7$
A subnet mask in class $C$ can have _____________ $1$’s with the remaining bits $0$’s.$10$$24$$12$$7$
admin
2.2k
views
admin
asked
Mar 31, 2020
Computer Networks
nielit2017dec-assistanta
computer-networks
subnetting
ip-addressing
+
–
Page:
« prev
1
...
969
970
971
972
973
974
975
976
977
978
979
...
3226
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register