Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged nielit2017oct-assistanta-it
2
votes
2
answers
31
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 15
Consider a system having $’m’$ resources of the same type. These resources are shared by $3$ processes $A,B,C;$ which have peak time demands of $3,4,6$ respectively. The minimum value of $’m’$ that ensures that deadlock will never occur is $11$ $12$ $13$ $14$
Consider a system having $’m’$ resources of the same type. These resources are shared by $3$ processes $A,B,C;$ which have peak time demands of $3,4,6$ respectively. ...
admin
998
views
admin
asked
Apr 1, 2020
Operating System
nielit2017oct-assistanta-it
operating-system
resource-allocation
deadlock-prevention-avoidance-detection
+
–
2
votes
2
answers
32
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 16
For a database relation $R(a,b,c,d)$ where the domains of $a,b,c$ and $d$ include only atomic values, only the following functional dependencies and those that can be inferred from them hold. $a \rightarrow c$ ... form but not in second normal form Second normal form but not in third normal form Third normal form None of the above
For a database relation $R(a,b,c,d)$ where the domains of $a,b,c$ and $d$ include only atomic values, only the following functional dependencies and those that can be inf...
admin
834
views
admin
asked
Apr 1, 2020
Databases
nielit2017oct-assistanta-it
databases
database-normalization
+
–
0
votes
0
answers
33
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 17
The convergence of the bisection method is Cubic Quadratic Linear None
The convergence of the bisection method isCubicQuadraticLinearNone
admin
271
views
admin
asked
Apr 1, 2020
Numerical Methods
nielit2017oct-assistanta-it
+
–
3
votes
2
answers
34
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 18
A pipeline is having speed up factor as $10$ and operating with efficiency of $80\%.$ What will be the number of stages in the pipeline? $10$ $8$ $13$ None
A pipeline is having speed up factor as $10$ and operating with efficiency of $80\%.$ What will be the number of stages in the pipeline?$10$$8$$13$None
admin
973
views
admin
asked
Apr 1, 2020
CO and Architecture
nielit2017oct-assistanta-it
co-and-architecture
pipelining
+
–
0
votes
0
answers
35
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 19
In a ripple counter using edge-triggered $JK$ flip-flops, the pulse input is applied to Clock input of all flip-flops $J$ and $K$ input of one flip-flop $J$ and $K$ input of all flip-flops Clock input of one flip-flop
In a ripple counter using edge-triggered $JK$ flip-flops, the pulse input is applied toClock input of all flip-flops$J$ and $K$ input of one flip-flop$J$ and $K$ input of...
admin
506
views
admin
asked
Apr 1, 2020
Digital Logic
nielit2017oct-assistanta-it
digital-logic
sequential-circuit
flip-flop
+
–
2
votes
2
answers
36
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 20
The number of possible binary trees with $4$ nodes is $12$ $13$ $14$ $15$
The number of possible binary trees with $4$ nodes is$12$$13$$14$$15$
admin
1.0k
views
admin
asked
Apr 1, 2020
DS
nielit2017oct-assistanta-it
data-structures
binary-tree
+
–
0
votes
0
answers
37
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 21
A program $P$ calls two subprograms $P1$ and $P2.\;P1$ can fail $50\%$ time and $P2$ can fail $40\%$ times. The program $P$ can fail $50\%$ $10\%$ $60\%$ $70\%$
A program $P$ calls two subprograms $P1$ and $P2.\;P1$ can fail $50\%$ time and $P2$ can fail $40\%$ times. The program $P$ can fail$50\%$$10\%$$60\%$$70\%$
admin
621
views
admin
asked
Apr 1, 2020
IS&Software Engineering
nielit2017oct-assistanta-it
is&software-engineering
software-testing
+
–
1
votes
2
answers
38
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 22
In time division switches if each memory access takes $100\;ns $ and one frame period is $125\;\mu s,$ then the maximum number of lines that can be supported is $625$ lines $1250$ lines $2300$ lines $318$ lines
In time division switches if each memory access takes $100\;ns $ and one frame period is $125\;\mu s,$ then the maximum number of lines that can be supported is$625$ line...
admin
1.9k
views
admin
asked
Apr 1, 2020
CO and Architecture
nielit2017oct-assistanta-it
co-and-architecture
cache-memory
+
–
0
votes
2
answers
39
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 23
Which two are valid constructions for Thread? Thread(Runnable r, String name) Thread() Thread(int priority) Thread(Runnable r, ThreadGroup g) Thread(Runnable r, int priority) $1$ and $3$ $2$ and $4$ $1$ and $2$ $2$ and $5$
Which two are valid constructions for Thread?Thread(Runnable r, String name)Thread()Thread(int priority)Thread(Runnable r, ThreadGroup g)Thread(Runnable r, int priority) ...
admin
939
views
admin
asked
Apr 1, 2020
Operating System
nielit2017oct-assistanta-it
operating-system
process-and-threads
threads
+
–
0
votes
1
answer
40
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 24
Which of the following object types are generally autonomous, meaning that they can exhibit some behavior without being operated upon by another object. Passive Active Both (A) and (B) None of the mentioned
Which of the following object types are generally autonomous, meaning that they can exhibit some behavior without being operated upon by another object.PassiveActiveBoth ...
admin
838
views
admin
asked
Apr 1, 2020
Object Oriented Programming
nielit2017oct-assistanta-it
non-gate
+
–
0
votes
1
answer
41
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 25
The address of a class $B$ Host is to be split into subnets with a $3$-bit subnet number. What is the maximum number of subnets and maximum number of hosts in each subnet? $8$ subnets and $262142$ hosts $6$ subnets and $262142$ hosts $6$ subnets and $1022$ hosts $8$ subnets and $1024$ hosts
The address of a class $B$ Host is to be split into subnets with a $3$-bit subnet number. What is the maximum number of subnets and maximum number of hosts in each subnet...
admin
930
views
admin
asked
Apr 1, 2020
Computer Networks
nielit2017oct-assistanta-it
computer-networks
subnetting
+
–
0
votes
1
answer
42
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 26
Which level of RAID refers to disk mirroring with block striping? RAID level $1$ RAID level $2$ RAID level $0$ RAID level $3$
Which level of RAID refers to disk mirroring with block striping?RAID level $1$RAID level $2$RAID level $0$RAID level $3$
admin
862
views
admin
asked
Apr 1, 2020
CO and Architecture
nielit2017oct-assistanta-it
co-and-architecture
disk
+
–
4
votes
2
answers
43
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 27
Which of the following desired features are beyond the capability of relational algebra? Aggregate Computation Multiplication Finding transitive closure All of the above
Which of the following desired features are beyond the capability of relational algebra?Aggregate ComputationMultiplicationFinding transitive closureAll of the above
admin
2.0k
views
admin
asked
Apr 1, 2020
Databases
nielit2017oct-assistanta-it
databases
relational-algebra
+
–
0
votes
1
answer
44
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 28
What is ‘Basis of Encapsulation’? object class method all of the mentioned
What is ‘Basis of Encapsulation’?objectclassmethodall of the mentioned
admin
9.3k
views
admin
asked
Apr 1, 2020
Object Oriented Programming
nielit2017oct-assistanta-it
non-gate
object-oriented-programming
+
–
1
votes
3
answers
45
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 29
Consider the following declaration. int a, *b = &a, **c = &b; a = 4; **c = 5; If the statement b = (int *)**c Is appended to the above program fragment then Value of $b$ becomes $5$ Value of $b$ will be the address of $c$ Value of $b$ is unaffected None of these
Consider the following declaration.int a, *b = &a, c = &b; a = 4; c = 5;If the statementb = (int *) cIs appended to the above program fragment thenValue of $b$ becomes ...
admin
933
views
admin
asked
Apr 1, 2020
Programming in C
nielit2017oct-assistanta-it
programming
pointers
+
–
1
votes
1
answer
46
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 30
How many $2$-input multiplexers are required to construct a $2^{10}$ input multiplexer? $1023$ $31$ $10$ $127$
How many $2$-input multiplexers are required to construct a $2^{10}$ input multiplexer?$1023$$31$$10$$127$
admin
962
views
admin
asked
Apr 1, 2020
Digital Logic
nielit2017oct-assistanta-it
digital-logic
combinational-circuit
multiplexer
+
–
0
votes
1
answer
47
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 31
When transaction $Ti$ requests a data item currently held by $Tj,Ti$ is allowed to wait only if it has a time stamp smaller than that of $Tj$ (that is $Ti$ is order than Tj). Otherwise, $Ti$ is rolled back (dies). This is Wait-die Wait-wound Wound-wait Wait
When transaction $Ti$ requests a data item currently held by $Tj,Ti$ is allowed to wait only if it has a time stamp smaller than that of $Tj$ (that is $Ti$ is order than ...
admin
721
views
admin
asked
Apr 1, 2020
Databases
nielit2017oct-assistanta-it
databases
transaction-and-concurrency
+
–
0
votes
2
answers
48
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 32
The maximum data rate of a channel of $3000$-Hz bandwidth and SNR of $30$ db is $60000$ $15000$ $30000$ $3000$
The maximum data rate of a channel of $3000$-Hz bandwidth and SNR of $30$ db is$60000$$15000$$30000$$3000$
admin
1.1k
views
admin
asked
Apr 1, 2020
Computer Networks
nielit2017oct-assistanta-it
computer-networks
+
–
1
votes
3
answers
49
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 33
The number of columns in a state table for a sequential circuit with $’m’$ flip flops and $’n’$ input is $m+n$ $m+2n$ $2m+n$ $2m+2n$
The number of columns in a state table for a sequential circuit with $’m’$ flip flops and $’n’$ input is$m+n$$m+2n$$2m+n$$2m+2n$
admin
1.6k
views
admin
asked
Apr 1, 2020
Digital Logic
nielit2017oct-assistanta-it
digital-logic
sequential-circuit
flip-flop
+
–
0
votes
1
answer
50
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 34
The solution of the recurrence relation $a_{r} = a_{r-1} + 2a_{r-2}$ with $a_{0} = 2,a_{1} = 7$ is $a_{r} = (3)^{r} + (1)^{r}$ $2a_{r} = (2)^{r}/3 – (1)^{r}$ $a_{r} = 3^{r+1} – (-1)^{r}$ $a_{r} = 3(2)^{r} – (-1)^{r}$
The solution of the recurrence relation$a_{r} = a_{r-1} + 2a_{r-2}$ with $a_{0} = 2,a_{1} = 7$ is$a_{r} = (3)^{r} + (1)^{r}$$2a_{r} = (2)^{r}/3 – (1)^{r}$$a_{r} = 3^{r+...
admin
712
views
admin
asked
Apr 1, 2020
Combinatory
nielit2017oct-assistanta-it
combinatory
recurrence-relation
+
–
1
votes
2
answers
51
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 35
In a $10$-bit computer instruction format, the size of address field is $3$-bits. The computer uses expanding OP code technique and has $4$ two-address instructions and $16$ one-address instructions. The number of zero address instructions it can support is $256$ $356$ $640$ $756$
In a $10$-bit computer instruction format, the size of address field is $3$-bits. The computer uses expanding OP code technique and has $4$ two-address instructions and $...
admin
2.0k
views
admin
asked
Apr 1, 2020
CO and Architecture
nielit2017oct-assistanta-it
co-and-architecture
machine-instruction
instruction-format
+
–
2
votes
2
answers
52
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 36
The average search time for hashing with linear probing will be less if the load factor Is far less than one Equals one Is far greater than one None of the above
The average search time for hashing with linear probing will be less if the load factorIs far less than oneEquals oneIs far greater than oneNone of the above
admin
878
views
admin
asked
Apr 1, 2020
Algorithms
nielit2017oct-assistanta-it
algorithms
hashing
+
–
Page:
« prev
1
2
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
