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 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$
admin
asked
in
Operating System
Apr 1, 2020
by
admin
983
views
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
admin
asked
in
Databases
Apr 1, 2020
by
admin
814
views
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
admin
asked
in
Numerical Methods
Apr 1, 2020
by
admin
269
views
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
admin
asked
in
CO and Architecture
Apr 1, 2020
by
admin
959
views
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
admin
asked
in
Digital Logic
Apr 1, 2020
by
admin
502
views
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$
admin
asked
in
DS
Apr 1, 2020
by
admin
985
views
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\%$
admin
asked
in
IS&Software Engineering
Apr 1, 2020
by
admin
617
views
nielit2017oct-assistanta-it
is&software-engineering
software-testing
1
vote
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
admin
asked
in
CO and Architecture
Apr 1, 2020
by
admin
1.8k
views
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$
admin
asked
in
Operating System
Apr 1, 2020
by
admin
920
views
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
admin
asked
in
Object Oriented Programming
Apr 1, 2020
by
admin
826
views
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
admin
asked
in
Computer Networks
Apr 1, 2020
by
admin
907
views
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$
admin
asked
in
CO and Architecture
Apr 1, 2020
by
admin
855
views
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
admin
asked
in
Databases
Apr 1, 2020
by
admin
1.9k
views
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
admin
asked
in
Object Oriented Programming
Apr 1, 2020
by
admin
9.2k
views
nielit2017oct-assistanta-it
non-gate
object-oriented-programming
1
vote
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
admin
asked
in
Programming in C
Apr 1, 2020
by
admin
913
views
nielit2017oct-assistanta-it
programming
pointers
1
vote
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$
admin
asked
in
Digital Logic
Apr 1, 2020
by
admin
929
views
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
admin
asked
in
Databases
Apr 1, 2020
by
admin
710
views
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$
admin
asked
in
Computer Networks
Apr 1, 2020
by
admin
1.1k
views
nielit2017oct-assistanta-it
computer-networks
1
vote
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$
admin
asked
in
Digital Logic
Apr 1, 2020
by
admin
1.5k
views
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}$
admin
asked
in
Combinatory
Apr 1, 2020
by
admin
690
views
nielit2017oct-assistanta-it
combinatory
recurrence-relation
1
vote
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$
admin
asked
in
CO and Architecture
Apr 1, 2020
by
admin
2.0k
views
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
admin
asked
in
Algorithms
Apr 1, 2020
by
admin
854
views
nielit2017oct-assistanta-it
algorithms
hashing
Page:
« prev
1
2
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent questions tagged nielit2017oct-assistanta-it
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...