Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged nielit2017oct-assistanta-cs
0
votes
1
answer
31
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
570
views
admin
asked
Apr 1, 2020
Graph Theory
nielit2017oct-assistanta-cs
discrete-mathematics
graph-theory
degree-of-graph
+
–
2
votes
3
answers
32
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 8
Consider the following C code segment: int Ls Prime(n) { int i,n; for(i=2;i<=sqrt(n);i++) if(n%i ==0) { printf( NOT Prime.\n ); return 0; } return 1; } Let $T(n)$ denote the number of times the for loop is executed by the program on input $n.$ ... $T(n) = \Omega (1)$ $T(n) = O(n)$ and $T(n) = \Omega (\sqrt{n})$ None of these
Consider the following C code segment:int Ls Prime(n) { int i,n; for(i=2;i<=sqrt(n);i++) if(n%i ==0) { printf(“NOT Prime.\n”); ...
admin
868
views
admin
asked
Apr 1, 2020
Algorithms
nielit2017oct-assistanta-cs
algorithms
time-complexity
+
–
0
votes
1
answer
33
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
554
views
admin
asked
Apr 1, 2020
Theory of Computation
nielit2017oct-assistanta-cs
theory-of-computation
recursive-and-recursively-enumerable-languages
+
–
0
votes
1
answer
34
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
+
–
4
votes
4
answers
35
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 11
Synthesized attribute can easily be simulated by an LL grammar ambiguous grammar LR grammar none of the above
Synthesized attribute can easily be simulated by anLL grammarambiguous grammarLR grammarnone of the above
admin
1.3k
views
admin
asked
Apr 1, 2020
Compiler Design
nielit2017oct-assistanta-cs
compiler-design
syntax-directed-translation
+
–
3
votes
2
answers
36
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 12
The logic of pumping lemma is a good example of the pigeon-hole principle the divide and conquer technique recursion iteration
The logic of pumping lemma is a good example ofthe pigeon-hole principlethe divide and conquer techniquerecursioniteration
admin
959
views
admin
asked
Apr 1, 2020
Theory of Computation
nielit2017oct-assistanta-cs
theory-of-computation
pumping-lemma
+
–
1
votes
3
answers
37
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 13
Given relations $R(w,x)$ and $S(y,z),$ the result of SELECT DISTINCT $w,x$ from $R,S$ $R$ has no duplicates and $S$ is non-empty $R$ and $S$ have no duplicates $S$ has no duplicates and $R$ is non-empty $R$ and $S$ has the same number of tuples
Given relations $R(w,x)$ and $S(y,z),$ the result of SELECT DISTINCT $w,x$ from $R,S$$R$ has no duplicates and $S$ is non-empty$R$ and $S$ have no duplicates$S$ has no du...
admin
830
views
admin
asked
Apr 1, 2020
Databases
nielit2017oct-assistanta-cs
databases
sql
+
–
1
votes
1
answer
38
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
901
views
admin
asked
Apr 1, 2020
Databases
nielit2017oct-assistanta-cs
databases
relational-model
+
–
0
votes
1
answer
39
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
2
answers
40
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 16
If $P$ is risk probability, $L$ is loss, then Risk Exposure $(RE)$ is computed as. $RE = P/L$ $RE = P + L$ $RE = P \ast L$ $RE = 2 \ast P \ast L$
If $P$ is risk probability, $L$ is loss, then Risk Exposure $(RE)$ is computed as.$RE = P/L$ $RE = P + L$$RE = P \ast L$$RE = 2 \ast P \ast L$
admin
1.6k
views
admin
asked
Apr 1, 2020
Probability
nielit2017oct-assistanta-cs
engineering-mathematics
probability
+
–
1
votes
1
answer
41
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
962
views
admin
asked
Apr 1, 2020
Quantitative Aptitude
nielit2017oct-assistanta-cs
general-aptitude
quantitative-aptitude
+
–
2
votes
1
answer
42
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
643
views
admin
asked
Apr 1, 2020
Calculus
nielit2017oct-assistanta-cs
engineering-mathematics
calculus
maxima-minima
+
–
0
votes
1
answer
43
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
+
–
8
votes
3
answers
44
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 20
The possible number of Boolean function of $3$ variables $X,Y$ and $Z$ such that $f(X,Y,Z) = f(X’,Y’,Z’)$ $8$ $16$ $64$ $32$
The possible number of Boolean function of $3$ variables $X,Y$ and $Z$ such that $f(X,Y,Z) = f(X’,Y’,Z’)$$8$$16$$64$$32$
admin
1.3k
views
admin
asked
Apr 1, 2020
Digital Logic
nielit2017oct-assistanta-cs
digital-logic
boolean-algebra
+
–
1
votes
3
answers
45
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 21
What is the modality of relationship, if there is no explicit need for relationship to occur? Zero Two Three One
What is the modality of relationship, if there is no explicit need for relationship to occur?ZeroTwoThreeOne
admin
1.0k
views
admin
asked
Apr 1, 2020
Databases
nielit2017oct-assistanta-cs
databases
relational-model
+
–
1
votes
4
answers
46
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 22
If the original size of data is $40$ then after adding error detection redundancy bit the size of data length is $26$ $36$ $46$ $56$
If the original size of data is $40$ then after adding error detection redundancy bit the size of data length is$26$$36$$46$$56$
admin
6.8k
views
admin
asked
Apr 1, 2020
Computer Networks
nielit2017oct-assistanta-cs
computer-networks
error-detection
+
–
0
votes
1
answer
47
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
+
–
1
votes
2
answers
48
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 24
Bit stuffing refers to Inserting a $’0’$ in user data stream to differentiate it with a flag Inserting a $’0’$ in flag stream to avoid ambiguity Appending a nibble to the flag sequence Appending a nibble to the user data stream
Bit stuffing refers toInserting a $’0’$ in user data stream to differentiate it with a flagInserting a $’0’$ in flag stream to avoid ambiguityAppending a nibble t...
admin
728
views
admin
asked
Apr 1, 2020
Computer Networks
nielit2017oct-assistanta-cs
computer-networks
bit-stuffing
+
–
0
votes
3
answers
49
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 25
A micro programmed control unit Is faster than a hardwired unit Facilitates easy implementation of a new instruction Is useful when small programs are to be run All of the above
A micro programmed control unitIs faster than a hardwired unitFacilitates easy implementation of a new instructionIs useful when small programs are to be runAll of the ab...
admin
910
views
admin
asked
Apr 1, 2020
CO and Architecture
nielit2017oct-assistanta-cs
co-and-architecture
control-unit
microprogramming
+
–
0
votes
2
answers
50
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 26
If the channel is band limited to $6\;kHz$ and signal to noise ratio is $16,$ what would be the capacity of channel? $16.15$ kbps $23.24$ kbps $40.12$ kbps $24.74$ kbps
If the channel is band limited to $6\;kHz$ and signal to noise ratio is $16,$ what would be the capacity of channel?$16.15$ kbps$23.24$ kbps$40.12$ kbps$24.74$ kbps
admin
1.2k
views
admin
asked
Apr 1, 2020
Computer Networks
nielit2017oct-assistanta-cs
computer-networks
+
–
0
votes
0
answers
51
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 27
At $100\%$ modulation, the power in each sideband is _______ of that of carrier. $50\%$ $40\%$ $60\%$ $25\%$
At $100\%$ modulation, the power in each sideband is _______ of that of carrier.$50\%$$40\%$$60\%$$25\%$
admin
352
views
admin
asked
Apr 1, 2020
Digital Signal Processing
nielit2017oct-assistanta-cs
non-gate
+
–
0
votes
1
answer
52
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
569
views
admin
asked
Apr 1, 2020
Information Theory
nielit2017oct-assistanta-cs
non-gate
+
–
0
votes
2
answers
53
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 29
Which of the following algorithm solve the all-pair shortest path problem? Dijakstra’s algorithm Floyd’s algorithm Prim’s algorithm Warshall’s algorithm
Which of the following algorithm solve the all-pair shortest path problem?Dijakstra’s algorithmFloyd’s algorithmPrim’s algorithmWarshall’s algorithm
admin
1.0k
views
admin
asked
Apr 1, 2020
Algorithms
nielit2017oct-assistanta-cs
algorithms
graph-algorithms
+
–
1
votes
3
answers
54
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 30
An algorithm is made up of two modules $M1$ and $M2.$ If order of $M1$ is $f(n)$ and $M2$ is $g(n)$ then he order of algorithm is $max(f(n),g(n))$ $min(f(n),g(n))$ $f(n) + g(n)$ $f(n) \times g(n)$
An algorithm is made up of two modules $M1$ and $M2.$ If order of $M1$ is $f(n)$ and $M2$ is $g(n)$ then he order of algorithm is$max(f(n),g(n))$$min(f(n),g(n))$$f(n) + g...
admin
1.0k
views
admin
asked
Apr 1, 2020
Algorithms
nielit2017oct-assistanta-cs
algorithms
time-complexity
+
–
1
votes
2
answers
55
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 31
Which of the following definitions generates the same languages as $L,$ where $L = \{x^{n}y^{n},n \geq 1\}$ $E \rightarrow xEy \mid xy$ $xy \mid x^{+}xyy^{+}$ $x^{+}y^{+}$ $(i)$ $(i)$ and $(ii)$ only $(ii)$ and $(iii)$ only $(ii)$ only
Which of the following definitions generates the same languages as $L,$ where$L = \{x^{n}y^{n},n \geq 1\}$$E \rightarrow xEy \mid xy$$xy \mid x^{+}xyy^{+}$$x^{+}y^{+}$ $(...
admin
626
views
admin
asked
Apr 1, 2020
Theory of Computation
nielit2017oct-assistanta-cs
theory-of-computation
context-free-language
+
–
0
votes
1
answer
56
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
57
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
58
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.8k
views
admin
asked
Apr 1, 2020
Databases
nielit2017oct-assistanta-cs
databases
transaction-and-concurrency
deadlock-prevention-avoidance-detection
+
–
0
votes
3
answers
59
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 35
Disk request come to a disk driver for cylinders in the order $10,22,20,2,40,6$ and $38,$ at a time when the disk drive is reading from cylinder $20$. The seek time is $6\text{ ms}$ per cylinder. The total seek time, if the disk arm scheduling algorithm is first-come-first-served is $900$ ms $850$ ms $360$ ms $876$ ms
Disk request come to a disk driver for cylinders in the order $10,22,20,2,40,6$ and $38,$ at a time when the disk drive is reading from cylinder $20$. The seek time is $6...
admin
1.0k
views
admin
asked
Apr 1, 2020
Operating System
nielit2017oct-assistanta-cs
operating-system
disk-scheduling
+
–
2
votes
1
answer
60
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
+
–
Page:
« prev
1
2
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register