Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged nielit2017july-scientistb-cs
0
votes
1
answer
31
NIELIT 2017 July Scientist B (CS) - Section B: 31
At a room temperature of $300K$, calculate the thermal noise generated by two resistors of $10K\Omega$ and $20K\Omega$ when the bandwidth is $10KHz$. $1.2868\times10^{-6}V, 1.819\times10^{-6}V$ $6.08\times10^{-6}V, 15.77\times10^{-6}V$ $16.66\times10^{-6}V, 2.356\times10^{-6}V$ $1.66\times10^{-6}V, 0.23\times10^{-6}V$
At a room temperature of $300K$, calculate the thermal noise generated by two resistors of $10K\Omega$ and $20K\Omega$ when the bandwidth is $10KHz$.$1.2868\times10^{-6}V...
admin
1.4k
views
admin
asked
Mar 30, 2020
Digital Signal Processing
nielit2017july-scientistb-cs
non-gate
+
–
2
votes
2
answers
32
NIELIT 2017 July Scientist B (CS) - Section B: 32
A CPU generates $32$-bit virtual addresses. The page size is $4$ KB. The processor has a Translation Look-aside Buffer (TLB) which can hold a total of $128$ page table entries and is $4$-way set associative. The minimum size of the TLB tag is $\text{11 bits}$ $\text{13 bits}$ $\text{15 bits}$ $\text{20 bits}$
A CPU generates $32$-bit virtual addresses. The page size is $4$ KB. The processor has a Translation Look-aside Buffer (TLB) which can hold a total of $128$ page table en...
admin
1.2k
views
admin
asked
Mar 30, 2020
Operating System
nielit2017july-scientistb-cs
operating-system
memory-management
paging
translation-lookaside-buffer
+
–
0
votes
1
answer
33
NIELIT 2017 July Scientist B (CS) - Section B: 33
A computer uses $46$-bit virtual address, $32$-bit physical address, and a three-level paged page table organization. The page table base register stores the base address of the first-level table $(T1)$, which occupies exactly one page. Each entry of $T1$ stores ... is $64$ bytes. What is the size of a page in $KB$ in this computer? $2$ $4$ $8$ $16$
A computer uses $46$-bit virtual address, $32$-bit physical address, and a three–level paged page table organization. The page table base register stores the base addre...
admin
977
views
admin
asked
Mar 30, 2020
Operating System
nielit2017july-scientistb-cs
operating-system
virtual-memory
+
–
0
votes
0
answers
34
NIELIT 2017 July Scientist B (CS) - Section B: 34
A computer uses $46-bit$ virtual address, $32-bit$ physical address, and a three-level paged page table organization. The page table base register stores the base address of the first-level table ($T1$), which occupies exactly one page. Each ... that no two synonyms map to different sets in the processor cache of this computer? $2$ $4$ $8$ $16$
A computer uses $46-bit$ virtual address, $32-bit$ physical address, and a three–level paged page table organization. The page table base register stores the base addre...
admin
755
views
admin
asked
Mar 30, 2020
Operating System
nielit2017july-scientistb-cs
operating-system
virtual-memory
+
–
0
votes
1
answer
35
NIELIT 2017 July Scientist B (CS) - Section B: 35
A disk has $200$ tracks (numbered $0$ through $199$). At a given time, it was servicing the request of reading data from track $120$, and at the previous request, service was for track $90$. The pending requests (in order of their arrival) are for track numbers. ... ) and FCFS (First Come First Serve)? $2$ and $3$ $3$ and $3$ $3$ and $4$ $4$ and $4$
A disk has $200$ tracks (numbered $0$ through $199$). At a given time, it was servicing the request of reading data from track $120$, and at the previous request, service...
admin
875
views
admin
asked
Mar 30, 2020
Operating System
nielit2017july-scientistb-cs
operating-system
disk-scheduling
+
–
0
votes
1
answer
36
NIELIT 2017 July Scientist B (CS) - Section B: 36
Consider the following snapshot of a system running $n$ processes. Process $i$ is holding $X_i$ instances of a resource $R$, $ 1\leq i\leq n$. Currently, all instances of $R$ are occupied. Further, for all $i$, process $i$ has placed a request for an additional $Y_i$ ... $ \max(X_{p},X_{q})>1$ $ \min(X_{p},X_{q})>1$
Consider the following snapshot of a system running $n$ processes. Process $i$ is holding $X_i$ instances of a resource $R$, $ 1\leq i\leq n$. Currently, all instances o...
admin
864
views
admin
asked
Mar 30, 2020
Operating System
nielit2017july-scientistb-cs
operating-system
resource-allocation
deadlock-prevention-avoidance-detection
+
–
0
votes
1
answer
37
NIELIT 2017 July Scientist B (CS) - Section B: 37
A system has $n$ resources $R_0, \dots,R_{n-1}$, and $k$ processes $P_0, \dots, P_{k-1}$. The implementation of the resource request logic of each process $P_i$ is as follows: if(i%2==0){ if(i<n) request Ri; if(i+2<n) request Ri+2; } else ... following situations is a deadlock possible? $n=40,\: k=26$ $n=21,\:k=12$ $n=20,\:k=10$ $n=41,\:k=19$
A system has $n$ resources $R_0, \dots,R_{n-1}$, and $k$ processes $P_0, \dots, P_{k-1}$. The implementation of the resource request logic of each process $P_i$ is as fol...
admin
968
views
admin
asked
Mar 30, 2020
Operating System
nielit2017july-scientistb-cs
operating-system
resource-allocation
deadlock-prevention-avoidance-detection
+
–
1
votes
3
answers
38
NIELIT 2017 July Scientist B (CS) - Section B: 38
A system contains three programs and each requires three tape units for its operation. The minimum number of tape units which the system must have such that deadlocks never arise is _________. $6$ $7$ $8$ $9$
A system contains three programs and each requires three tape units for its operation. The minimum number of tape units which the system must have such that deadlocks nev...
admin
3.1k
views
admin
asked
Mar 30, 2020
Operating System
nielit2017july-scientistb-cs
operating-system
resource-allocation
deadlock-prevention-avoidance-detection
+
–
0
votes
3
answers
39
NIELIT 2017 July Scientist B (CS) - Section B: 39
Which of the following standard algorithms is not Dynamic Programming based? Bellman-Ford Algorithm for single source shortest path Floyd Warshall Algorithm for all pairs shortest paths $0-1$ Knapsack problem Prim’s Minimum Spanning Tree
Which of the following standard algorithms is not Dynamic Programming based?Bellman-Ford Algorithm for single source shortest pathFloyd Warshall Algorithm for all pairs s...
admin
6.2k
views
admin
asked
Mar 30, 2020
Algorithms
nielit2017july-scientistb-cs
algorithms
easy
dynamic-programming
+
–
1
votes
3
answers
40
NIELIT 2017 July Scientist B (CS) - Section B: 40
Kadane algorithm is used to find Maximum sum subsequence in an array Maximum sum subarray in an array Maximum product subsequence in an array Maximum product subarray in an array
Kadane algorithm is used to findMaximum sum subsequence in an arrayMaximum sum subarray in an arrayMaximum product subsequence in an arrayMaximum product subarray in an a...
admin
3.9k
views
admin
asked
Mar 30, 2020
DS
nielit2017july-scientistb-cs
data-structures
array
+
–
0
votes
0
answers
41
NIELIT 2017 July Scientist B (CS) - Section B: 41
Four Matrices $M_1, M_2, M_3$ and $M_4$ of dimensions $ p \times q$, $q \times r$, $r \times s$ and $s \times t$ respectively can be multiplied in several ways with different number of total scalar multiplications. For example, when ... $t=80$, then the number of scalar multiplications needed is $248000$ $44000$ $19000$ $25000$
Four Matrices $M_1, M_2, M_3$ and $M_4$ of dimensions $ p \times q$, $q \times r$, $r \times s$ and $s \times t$ respectively can be multiplied in several ways with diffe...
admin
970
views
admin
asked
Mar 30, 2020
Algorithms
nielit2017july-scientistb-cs
algorithms
dynamic-programming
matrix-chain-ordering
+
–
0
votes
2
answers
42
NIELIT 2017 July Scientist B (CS) - Section B: 42
Let $G$ be a graph with $n$ vertices and $m$ edges.What is the tightest upper bound on the running time of Depth First Search of $G$, when $G$ is represented using adjacency matrix? $O(n)$ $O(m+n)$ $O(n^2)$ $O(mn)$
Let $G$ be a graph with $n$ vertices and $m$ edges.What is the tightest upper bound on the running time of Depth First Search of $G$, when $G$ is represented using adjace...
admin
1.5k
views
admin
asked
Mar 30, 2020
Algorithms
nielit2017july-scientistb-cs
algorithms
graph-algorithms
+
–
2
votes
1
answer
43
NIELIT 2017 July Scientist B (CS) - Section B: 43
Which one of the following is a key factor for preferring $B$-trees to binary search trees for indexing database relations? Database relations have a large number of records Database relations are sorted on the primary key $B$-trees require less memory than binary search trees Data transfer from disks is in blocks
Which one of the following is a key factor for preferring $B$-trees to binary search trees for indexing database relations?Database relations have a large number of recor...
admin
1.1k
views
admin
asked
Mar 30, 2020
Databases
nielit2017july-scientistb-cs
databases
b-tree
+
–
0
votes
1
answer
44
NIELIT 2017 July Scientist B (CS) - Section B: 44
The Cyclomatic complexity of each of the modules $A$ and $B$ shown below is $10$. What is the Cyclomatic complexity of the sequential integration shown on the right hand side? $19$ $21$ $20$ $10$
The Cyclomatic complexity of each of the modules $A$ and $B$ shown below is $10$. What is the Cyclomatic complexity of the sequential integration shown on the right hand ...
admin
778
views
admin
asked
Mar 30, 2020
IS&Software Engineering
nielit2017july-scientistb-cs
non-gate
is&software-engineering
+
–
0
votes
1
answer
45
NIELIT 2017 July Scientist B (CS) - Section B: 45
What is the appropriate pairing of items in the two columns listing various activities encountered in a software life cycle? ... $P-2,Q-3,R-1,S-4$ $P-3,Q-2,R-1,S-4$ $P-2,Q-3,R-4,S-1$
What is the appropriate pairing of items in the two columns listing various activities encountered in a software life cycle?$$\begin{array}{llll}\text{P.} & \text{Require...
admin
1.1k
views
admin
asked
Mar 30, 2020
IS&Software Engineering
nielit2017july-scientistb-cs
non-gate
is&software-engineering
+
–
2
votes
0
answers
46
NIELIT 2017 July Scientist B (CS) - Section B: 46
Consider the following four schedules due to three transactions (indicated by the subscript) using read and write on a data item $x$, denoted by $r(x)$ and $w(x)$respectively. Which one of them is conflict serializable? $r_1(x);r_2(x);w_1(x);r_3(x);w_2(x)$ ... $r_2(x);w_2(x);r_3(x);r_1(x);w_1(x)$ $1$ $2$ $3$ $4$
Consider the following four schedules due to three transactions (indicated by the subscript) using read and write on a data item $x$, denoted by $r(x)$ and $w(x)$respecti...
admin
827
views
admin
asked
Mar 30, 2020
Databases
nielit2017july-scientistb-cs
databases
serializability
conflict-serializable
+
–
1
votes
2
answers
47
NIELIT 2017 July Scientist B (CS) - Section B: 47
What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no epsilon and unit production (i.e.,of type $A\to\epsilon$ and $A \to a)$ to parse a string with $n$ tokens? $n/2$ $n-1$ $2n-1$ $2^n$
What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no epsilon and unit production (i.e.,of type $A\to\epsilon$ and $A \...
admin
1.0k
views
admin
asked
Mar 30, 2020
Compiler Design
nielit2017july-scientistb-cs
compiler-design
grammar
+
–
1
votes
1
answer
48
NIELIT 2017 July Scientist B (CS) - Section B: 48
What is the complement of the language accepted by the NFA shown below? $\not{O}$ $\{\epsilon\}$ $a^*$ $\{a,\epsilon\}$ $1$ $2$ $3$ $4$
What is the complement of the language accepted by the NFA shown below?$\not{O}$$\{\epsilon\}$$a^*$$\{a,\epsilon\}$$1$$2$$3$$4$
admin
877
views
admin
asked
Mar 30, 2020
Theory of Computation
nielit2017july-scientistb-cs
theory-of-computation
finite-automata
+
–
2
votes
5
answers
49
NIELIT 2017 July Scientist B (CS) - Section B: 49
In a compiler, keywords of a language are recognized during parsing of the program the code generation the lexical analysis of the program dataflow analysis
In a compiler, keywords of a language are recognized duringparsing of the programthe code generationthe lexical analysis of the programdataflow analysis
admin
2.0k
views
admin
asked
Mar 30, 2020
Compiler Design
nielit2017july-scientistb-cs
compiler-design
lexical-analysis
+
–
0
votes
1
answer
50
NIELIT 2017 July Scientist B (CS) - Section B: 50
Match the problem domains in $\text{GROUP I}$ with the solution technologies in $\text{GROUP II}$ ... $P-3,Q-4,R-2,S-1$ $P-3,Q-1,R-4,S-2$ $P-4,Q-3,R-2,S-1$
Match the problem domains in $\text{GROUP I}$ with the solution technologies in $\text{GROUP II}$$$\begin{array}{llll} & \textbf{GROUP I}& {}& \textbf{GROUP II}\\ \text{(...
admin
949
views
admin
asked
Mar 30, 2020
Web Technologies
nielit2017july-scientistb-cs
non-gate
web-technologies
+
–
0
votes
1
answer
51
NIELIT 2017 July Scientist B (CS) - Section B: 51
A company needs to develop a strategy for software product development for which it has a choice of two programming languages $L1$and $L2$. The number of Lines Of Code (LOC) developed using $L2$ is estimated to be twice the LOC developed with $L1$ ... the project using $L1$is equal to the cost of the project using $L2$? $4000$ $5000$ $4333$ $4667$
A company needs to develop a strategy for software product development for which it has a choice of two programming languages $L1$and $L2$. The number of Lines Of Code (L...
admin
771
views
admin
asked
Mar 30, 2020
IS&Software Engineering
nielit2017july-scientistb-cs
non-gate
is&software-engineering
+
–
0
votes
1
answer
52
NIELIT 2017 July Scientist B (CS) - Section B: 52
A company needs to develop digital signal processing software for one of its newest inventions. The software is expected to have $40000$ lines of code. The company needs to determine the effort in person-months needed to develop this software using the basic ... $234.25$ $932.50$ $287.80$ $122.40$
A company needs to develop digital signal processing software for one of its newest inventions. The software is expected to have $40000$ lines of code. The company needs ...
admin
1.1k
views
admin
asked
Mar 30, 2020
IS&Software Engineering
nielit2017july-scientistb-cs
non-gate
is&software-engineering
+
–
0
votes
1
answer
53
NIELIT 2017 July Scientist B (CS) - Section B: 53
Which one of the following is NOT desired in a good Software Requirement Specifications (SRS) document? Functional Requirements Non-Functional Requirements Goals of Implementation Algorithms for Software Implementation
Which one of the following is NOT desired in a good Software Requirement Specifications (SRS) document?Functional RequirementsNon-Functional RequirementsGoals of Implemen...
admin
1.2k
views
admin
asked
Mar 30, 2020
IS&Software Engineering
nielit2017july-scientistb-cs
non-gate
is&software-engineering
+
–
2
votes
1
answer
54
NIELIT 2017 July Scientist B (CS) - Section B: 54
In a complete $k$-ary tree, every internal node has exactly $k$ children. The number of leaves in such a tree with $n$ internal nodes is $nk$ $(n-1)k+1$ $n(k-1)+1$ $n(k-1)$
In a complete $k$-ary tree, every internal node has exactly $k$ children. The number of leaves in such a tree with $n$ internal nodes is$nk$$(n-1)k+1$$n(k-1)+1$$n(k-1)$
admin
765
views
admin
asked
Mar 30, 2020
DS
nielit2017july-scientistb-cs
data-structures
tree
+
–
1
votes
1
answer
55
NIELIT 2017 July Scientist B (CS) - Section B: 55
Suppose $T(n)=2T(n/2)+n$, $T(0)=T(1)=1$ which one of the following is false? $T(n)=O(n^2)$ $T(n)=\Theta(n\log n)$ $T(n)=\Omega(n^2)$ $T(n)=O(n\log n)$
Suppose $T(n)=2T(n/2)+n$, $T(0)=T(1)=1$ which one of the following is false?$T(n)=O(n^2)$$T(n)=\Theta(n\log n)$$T(n)=\Omega(n^2)$$T(n)=O(n\log n)$
admin
897
views
admin
asked
Mar 30, 2020
Algorithms
nielit2017july-scientistb-cs
algorithms
recurrence-relation
+
–
0
votes
2
answers
56
NIELIT 2017 July Scientist B (CS) - Section B: 56
The part of machine level instruction, which tells the central processor what has to be done, is Operation code Address Locator Flip-Flop
The part of machine level instruction, which tells the central processor what has to be done, isOperation codeAddressLocatorFlip-Flop
admin
998
views
admin
asked
Mar 30, 2020
CO and Architecture
nielit2017july-scientistb-cs
co-and-architecture
+
–
0
votes
1
answer
57
NIELIT 2017 July Scientist B (CS) - Section B: 57
A system program that combines the separately complied modules of a program into a form suitable for execution assembler linking loader cross compiler load and go
A system program that combines the separately complied modules of a program into a form suitable for executionassemblerlinking loadercross compilerload and go
admin
762
views
admin
asked
Mar 30, 2020
Compiler Design
nielit2017july-scientistb-cs
compiler-design
linker
+
–
2
votes
4
answers
58
NIELIT 2017 July Scientist B (CS) - Section B: 58
Bug means A logical error in a program A difficult syntax error in a program Documenting programs using an efficient documentation tool All of the above
Bug meansA logical error in a programA difficult syntax error in a programDocumenting programs using an efficient documentation toolAll of the above
admin
1.7k
views
admin
asked
Mar 30, 2020
Programming in C
nielit2017july-scientistb-cs
programming
+
–
0
votes
4
answers
59
NIELIT 2017 July Scientist B (CS) - Section B: 59
Let $L$ be a language and $L’$ be its complement. Which one of the following is NOT a viable possibility? Neither $L$ nor $L’$ is RE. One of the $L$ and $L’$ is RE but not recursive;the other is not RE. Both $L$ and $L’$ are RE but not recursive. Both $L$ and $L’$ are recursive.
Let $L$ be a language and $L’$ be its complement. Which one of the following is NOT a viable possibility?Neither $L$ nor $L’$ is RE.One of the $L$ and $L’$ is RE bu...
admin
759
views
admin
asked
Mar 30, 2020
Theory of Computation
nielit2017july-scientistb-cs
theory-of-computation
recursive-and-recursively-enumerable-languages
+
–
0
votes
3
answers
60
NIELIT 2017 July Scientist B (CS) - Section B: 60
Let $L1$ be a recursive language, and let $L2$ be a recursively enumerable but not recursive language. Which one of the following is TRUE? $L1’$ is recursive and $L2’$is recursively enumerable. $L1’$ is recursive and $L2’$is not recursively enumerable. $L1’$ and $L2’$is recursively enumerable. $L1’$ is recursively enumerable and $L2’$is recursive.
Let $L1$ be a recursive language, and let $L2$ be a recursively enumerable but not recursive language. Which one of the following is TRUE?$L1’$ is recursive and $L2’$...
admin
840
views
admin
asked
Mar 30, 2020
Theory of Computation
nielit2017july-scientistb-cs
theory-of-computation
recursive-and-recursively-enumerable-languages
+
–
Page:
« prev
1
2
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register