Register

Recent questions tagged nielit2017dec-scientistb

0 votes
2 answers
3
NIELIT 2017 DEC Scientist B - Section B: 3
Using bisection method, one root of $x^4-x-1$ lies between $1$ and $2$. After second iteration the root may lie in interval: $(1.25,1.5)$ $(1,1.25)$ $(1,1.5)$ None of the options.
Using bisection method, one root of $x^4-x-1$ lies between $1$ and $2$. After second iteration the root may lie in interval:$(1.25,1.5)$$(1,1.25)$$(1,1.5)$None of the opt...
User Avatar
0 votes
4 answers
4
NIELIT 2017 DEC Scientist B - Section B: 4
In a cache memory if total number of sets are ‘$s$’, then the set offset is: $2^8$ $\log_2s$ $s^2$ $s$
In a cache memory if total number of sets are ‘$s$’, then the set offset is:$2^8$$\log_2s$$s^2$$s$
User Avatar
2 votes
4 answers
5
NIELIT 2017 DEC Scientist B - Section B: 5
Which of the following is machine independent optimization? Loop optimization Redundancy Elimination Folding All of the option
Which of the following is machine independent optimization?Loop optimizationRedundancy EliminationFoldingAll of the option
User Avatar
3 votes
5 answers
6
NIELIT 2017 DEC Scientist B - Section B: 6
A stack organized computer has which of the following instructions? zero-address one-address two-address three-address
A stack organized computer has which of the following instructions?zero-addressone-addresstwo-addressthree-address
User Avatar
0 votes
4 answers
12
NIELIT 2017 DEC Scientist B - Section B: 12
Consider the following four processes with their corresponding arrival time and burst time: ... turn around time (in ms) for these processes using FCFS scheduling algorithm? $15$ $12.8$ $13$ none of the options
Consider the following four processes with their corresponding arrival time and burst time:$$\begin{array} \text{Process}&\text{Arrival time}&\text{Burst time(in ms)}\\ \...
User Avatar
0 votes
3 answers
14
NIELIT 2017 DEC Scientist B - Section B: 14
We have $10$-stage pipeline, where the branch target conditions are resolved at stage $5$. How many stalls are there for an incorrectly predicted branch? $5$ $6$ $7$ $4$
We have $10$-stage pipeline, where the branch target conditions are resolved at stage $5$. How many stalls are there for an incorrectly predicted branch?$5$$6$$7$$4$
User Avatar
0 votes
1 answer
15
NIELIT 2017 DEC Scientist B - Section B: 15
In how many ways $8$ girls and $8$ boys can sit around a circular table so that no two boys sit together? $(7!)^2$ $(8!)^2$ $7!8!$ $15!$
In how many ways $8$ girls and $8$ boys can sit around a circular table so that no two boys sit together?$(7!)^2$$(8!)^2$$7!8!$$15!$
User Avatar
1 votes
2 answers
16
NIELIT 2017 DEC Scientist B - Section B: 16
Which of the following is added to the page table in order to track whether a page of cache has been modified since it was read from the memory? Reference bit Dirty bit Tag bit Valid bit
Which of the following is added to the page table in order to track whether a page of cache has been modified since it was read from the memory?Reference bitDirty bitTag ...
User Avatar
0 votes
1 answer
20
NIELIT 2017 DEC Scientist B - Section B: 20
Let $u$ and $v$ be two vectors in $R^2$ whose Eucledian norms satisfy $\mid u\mid=2\mid v \mid$. What is the value $\alpha$ such that $w=u+\alpha v$ bisects the angle between $u$ and $v$? $2$ $1$ $\dfrac{1}{2}$ $-2$
Let $u$ and $v$ be two vectors in $R^2$ whose Eucledian norms satisfy $\mid u\mid=2\mid v \mid$. What is the value $\alpha$ such that $w=u+\alpha v$ bisects the angle bet...
User Avatar
0 votes
3 answers
21
NIELIT 2017 DEC Scientist B - Section B: 21
A system has $3$ processes sharing $4$ resources. If each process needs a maximum of $2$ units then, deadlock Can never occur Has to occur May occur None of the options
A system has $3$ processes sharing $4$ resources. If each process needs a maximum of $2$ units then, deadlockCan never occurHas to occurMay occurNone of the options
User Avatar
0 votes
1 answer
23
NIELIT 2017 DEC Scientist B - Section B: 23
Let $G$ be a complete undirected graph on $8$ vertices. If vertices of $G$ are labelled, then the number of distinct cycles of length $5$ in $G$ is equal to: $15$ $30$ $56$ $60$
Let $G$ be a complete undirected graph on $8$ vertices. If vertices of $G$ are labelled, then the number of distinct cycles of length $5$ in $G$ is equal to:$15$$30$$56$$...
User Avatar
0 votes
4 answers
25
NIELIT 2017 DEC Scientist B - Section B: 25
Consider the relational schema $R(A B C D)$ with following $FD$ set $F=\{A \to CE, B \to D, AE \to D\}$. Identify the highest normal form satisfied by the relation $R$. $2$NF BCNF $3$NF $1$NF
Consider the relational schema $R(A B C D)$ with following $FD$ set $F=\{A \to CE, B \to D, AE \to D\}$. Identify the highest normal form satisfied by the relation $R$.$2...
User Avatar
0 votes
1 answer
26
NIELIT 2017 DEC Scientist B - Section B: 26
The grammar $S\rightarrow aSb\mid bSa\mid SS\mid \varepsilon $ is: Unambiguous CFG Ambiguous CFG Not a CFG Deterministic CFG
The grammar $S\rightarrow aSb\mid bSa\mid SS\mid \varepsilon $ is:Unambiguous CFGAmbiguous CFGNot a CFGDeterministic CFG
User Avatar
1 votes
3 answers
28
NIELIT 2017 DEC Scientist B - Section B: 28
A RAM chip has $7$ address lines, $8$ data lines and $2$ chips select lines. Then the number of memory locations is __________ $2^{12}$ $2^{10}$ $2^{19}$ $2^{13}$
A RAM chip has $7$ address lines, $8$ data lines and $2$ chips select lines. Then the number of memory locations is __________$2^{12}$$2^{10}$$2^{19}$$2^{13}$
User Avatar
0 votes
2 answers
29
NIELIT 2017 DEC Scientist B - Section B: 29
Which of the following is not deliverable of the structured system analysis? Data flow diagram Prototype model Entity Relationship diagram Data dictionary
Which of the following is not deliverable of the structured system analysis?Data flow diagramPrototype modelEntity Relationship diagramData dictionary
User Avatar
2 votes
2 answers
30
NIELIT 2017 DEC Scientist B - Section B: 31
Consider a complete binary tree where the left and the right sub trees of the root are max-heaps. The lower bound for the number of operations to convert the tree to a heap is: $\Omega(\log n)$ $\Omega(n\log n)$ $\Omega(n)$ $\Omega(n^2)$
Consider a complete binary tree where the left and the right sub trees of the root are max-heaps. The lower bound for the number of operations to convert the tree to a he...
User Avatar
Page: