Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Ollie
3
votes
1
NIELIT 2017 July Scientist B (IT) - Section B: 30
Consider the HTML table definition given below: <table border=1> <tr> <td rowspan=2>ab</td> <td colspan=2>cd</td> </tr> <tr> <td>ef</td> <td rowspan=2>gh</td> </tr> <tr><td colspan=2>ik</ ... $(2,2,3)$ $(2,3,2)$ and $(2,3,2)$ $(2,3,2)$ and $(2,2,3)$
Consider the HTML table definition given below:<table border=1 <tr <td rowspan=2>ab</td <td colspan=2>cd</td </tr <tr <td>ef</td <td rowspan=2>gh</td </tr <tr><td colspan...
863
views
answered
Jun 10, 2020
Web Technologies
nielit2017july-scientistb-it
non-gate
web-technologies
+
–
2
votes
2
NIELIT 2017 July Scientist B (IT) - Section B: 29
HTML(Hypertext Markup language) has language elements which permit certain actions other than describing the structure of the web document. Which of the following actions is NOT supported by pure HTML(without any server or client side ... interval. Automatically redirect to another page upon download. Display the client time as part of the page.
HTML(Hypertext Markup language) has language elements which permit certain actions other than describing the structure of the web document. Which of the following actions...
1.2k
views
answered
Jun 10, 2020
Web Technologies
nielit2017july-scientistb-it
non-gate
web-technologies
+
–
0
votes
3
NIELIT 2017 July Scientist B (IT) - Section B: 27
The Function Points(FP) calculated for software projects are often used to obtain an estimate of Lines of Code(LOC) required for that project. Which of the following statements is FALSE in this context? The relationship between FP and LOC depends ... 1.6 times the functionality of a single LOC of FORTRAN. FP and LOC are not related to each other.
The Function Points(FP) calculated for software projects are often used to obtain an estimate of Lines of Code(LOC) required for that project. Which of the following stat...
1.1k
views
answered
Jun 10, 2020
IS&Software Engineering
nielit2017july-scientistb-it
non-gate
is&software-engineering
function-point-metric
+
–
2
votes
4
NIELIT 2017 July Scientist B (IT) - Section B: 25
Which of the following statements are TRUE? The context diagram should depict the system as a single bubble. External entities should be identified clearly at all levels of DFDs. Control information should not be represented in a DFD. A data store can be ... to another data store or to an external entity. II and IV II and III I and III I,II and III
Which of the following statements are TRUE? The context diagram should depict the system as a single bubble.External entities should be identified clearly at all levels o...
967
views
answered
Jun 10, 2020
IS&Software Engineering
nielit2017july-scientistb-it
non-gate
is&software-engineering
+
–
1
votes
5
NIELIT 2016 DEC Scientist B (CS) - Section B: 60
The sequence of operation in which PCM is done is Sampling, quantizing, encoding Quantizing, sampling, encoding Quantizing, encoding, sampling None of the above
The sequence of operation in which PCM is done is Sampling, quantizing, encodingQuantizing, sampling, encodingQuantizing, encoding, samplingNone of the above
5.3k
views
answered
Jun 10, 2020
Digital Signal Processing
nielit2016dec-scientistb-cs
non-gate
+
–
0
votes
6
NIELIT 2016 DEC Scientist B (CS) - Section B: 52
The concept of order Big O is important because It can be used to decide the best algorithm that solves a given problem It is the lower bound of the growth rate of algorithm It determines the maximum size of a problem that can be solved in a given amount of time Both (A) and (B)
The concept of order Big O is important becauseIt can be used to decide the best algorithm that solves a given problemIt is the lower bound of the growth rate of algorith...
2.0k
views
answered
Jun 10, 2020
Algorithms
nielit2016dec-scientistb-cs
algorithms
time-complexity
+
–
0
votes
7
NIELIT 2016 DEC Scientist B (CS) - Section B: 41
The IETF standard documents are called: RFC RCF ID none of the above
The IETF standard documents are called:RFCRCFIDnone of the above
447
views
answered
Jun 10, 2020
Digital Signal Processing
nielit2016dec-scientistb-cs
non-gate
+
–
1
votes
8
NIELIT 2016 DEC Scientist B (CS) - Section B: 36
The graph that shows basic blocks and their successor relationship is called: DAG Control graph Flow graph Hamiltonian graph
The graph that shows basic blocks and their successor relationship is called:DAGControl graphFlow graphHamiltonian graph
1.7k
views
answered
Jun 10, 2020
Compiler Design
nielit2016dec-scientistb-cs
compiler-design
directed-acyclic-graph
+
–
2
votes
9
NIELIT 2016 DEC Scientist B (CS) - Section B: 30
The IOS class member function used for formatting IO is width(), precision(), read() width(), precision(), setf() getch(), width(), Io() unsetf() ,setf(), write()
The IOS class member function used for formatting IO iswidth(), precision(), read()width(), precision(), setf()getch(), width(), Io()unsetf() ,setf(), write()
1.4k
views
answered
Jun 10, 2020
Object Oriented Programming
nielit2016dec-scientistb-cs
non-gate
object-oriented-programming
+
–
0
votes
10
NIELIT 2016 MAR Scientist B - Section B: 1
The number of ways to cut a six sided convex polygon whose vertices are labeled into four triangles using diagonal lines that do not cross is $13$ $14$ $12$ $11$
The number of ways to cut a six sided convex polygon whose vertices are labeled into four triangles using diagonal lines that do not cross is$13$$14$$12$$11$
2.1k
views
answered
Jun 9, 2020
Graph Theory
nielit2016mar-scientistb
discrete-mathematics
graph-theory
+
–
0
votes
11
NIELIT 2016 MAR Scientist B - Section C: 52
Which of the following is possible in a token passing bus network? in-service expansion. unlimited number of stations. both (A) and (B). unlimited distance.
Which of the following is possible in a token passing bus network?in-service expansion.unlimited number of stations.both (A) and (B).unlimited distance.
629
views
answered
Jun 8, 2020
Information Theory
nielit2016mar-scientistb
non-gate
+
–
1
votes
12
NIELIT 2016 MAR Scientist B - Section C: 49
The extent to which the software can control to operate correctly despite the introduction of invalid input is called as reliability robustness fault tolerance portability
The extent to which the software can control to operate correctly despite the introduction of invalid input is called asreliabilityrobustnessfault toleranceportability
868
views
answered
Jun 8, 2020
IS&Software Engineering
nielit2016mar-scientistb
non-gate
is&software-engineering
+
–
0
votes
13
NIELIT 2016 MAR Scientist B - Section C: 48
The shell accepts command from the user maintains directories of files translates the keyboard’s character codes none of these
The shellaccepts command from the usermaintains directories of filestranslates the keyboard’s character codesnone of these
595
views
answered
Jun 8, 2020
Computer Peripherals
nielit2016mar-scientistb
non-gate
+
–
0
votes
14
NIELIT 2016 MAR Scientist B - Section C: 35
The file structure that redefines its first record at a base of zero uses the term relative organization. key fielding. dynamic reallocation. all of these.
The file structure that redefines its first record at a base of zero uses the termrelative organization.key fielding.dynamic reallocation.all of these.
953
views
answered
Jun 8, 2020
Operating System
nielit2016mar-scientistb
operating-system
file-system
file-organization
+
–
2
votes
15
NIELIT 2016 MAR Scientist B - Section C: 34
Global locks synchronize access to local resources. synchronize access to global resources. are used to avoid local locks. prevent access to global resources.
Global lockssynchronize access to local resources.synchronize access to global resources.are used to avoid local locks.prevent access to global resources.
709
views
answered
Jun 8, 2020
Databases
nielit2016mar-scientistb
databases
transaction-and-concurrency
lock
+
–
4
votes
16
NIELIT 2017 DEC Scientific Assistant A - Section B: 57
Starvation can be avoided by which of the following statements: By using shortest job first resource allocation policy . By using first come first serve resources allocation policy. (i) only (i) and (ii) only (ii) only None of the options
Starvation can be avoided by which of the following statements:By using shortest job first resource allocation policy .By using first come first serve resources allocatio...
2.3k
views
answered
Jun 8, 2020
Operating System
nielit2017dec-assistanta
operating-system
process-scheduling
+
–
1
votes
17
NIELIT 2017 DEC Scientific Assistant A - Section B: 7
If file size is large and if it is to be accessed randomly then which of the following allocation strategy should be best to use in a system? Linked allocation Indexed allocation Contiguous allocation None of the options
If file size is large and if it is to be accessed randomly then which of the following allocation strategy should be best to use in a system?Linked allocationIndexed allo...
2.2k
views
answered
Jun 7, 2020
Operating System
nielit2017dec-assistanta
operating-system
file-system
+
–
1
votes
18
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...
732
views
answered
Jun 6, 2020
Computer Networks
nielit2017oct-assistanta-cs
computer-networks
bit-stuffing
+
–
0
votes
19
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...
971
views
answered
Jun 6, 2020
Quantitative Aptitude
nielit2017oct-assistanta-cs
general-aptitude
quantitative-aptitude
+
–
1
votes
20
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
1.3k
views
answered
Jun 6, 2020
Compiler Design
nielit2017oct-assistanta-cs
compiler-design
syntax-directed-translation
+
–
0
votes
21
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
963
views
answered
Jun 6, 2020
Theory of Computation
nielit2017oct-assistanta-cs
theory-of-computation
pumping-lemma
+
–
0
votes
22
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...
555
views
answered
Jun 6, 2020
Theory of Computation
nielit2017oct-assistanta-cs
theory-of-computation
recursive-and-recursively-enumerable-languages
+
–
0
votes
23
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$
1.6k
views
answered
Jun 6, 2020
Digital Logic
nielit2017oct-assistanta-it
digital-logic
sequential-circuit
flip-flop
+
–
0
votes
24
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 ...
841
views
answered
Jun 5, 2020
Object Oriented Programming
nielit2017oct-assistanta-it
non-gate
+
–
0
votes
25
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 11
Which of these events will be generated if we close an applet’s window? ActionEvent ComponentEvent AdjustmentEvent WindowEvent
Which of these events will be generated if we close an applet’s window?ActionEventComponentEventAdjustmentEventWindowEvent
3.7k
views
answered
Jun 5, 2020
Web Technologies
nielit2017oct-assistanta-it
non-gate
+
–
2
votes
26
NIELIT 2016 MAR Scientist C - Section C: 26
The seek time of a disk is $30$ ms. It rotates at the rate of $30$ rotations/second. The capacity of each track is $300$ words. The access time is (approximately) $62$ ms $60$ ms $50$ ms $47$ ms
The seek time of a disk is $30$ ms. It rotates at the rate of $30$ rotations/second. The capacity of each track is $300$ words. The access time is (approximately)$62$ ms$...
1.0k
views
answered
Jun 4, 2020
Operating System
nielit2016mar-scientistc
operating-system
disk
+
–
0
votes
27
Cormen Edition 3 Exercise 8.3 Question 2 (Page No. 200)
Which of the following sorting algorithms are stable: insertion sort, merge sort, heapsort, and quicksort? Give a simple scheme that makes any sorting algorithm stable. How much additional time and space does your scheme entail?
Which of the following sorting algorithms are stable: insertion sort, merge sort, heapsort, and quicksort? Give a simple scheme that makes any sorting algorithm stable. H...
3.4k
views
answered
Jul 8, 2019
Algorithms
cormen
algorithms
sorting
stablesort
descriptive
+
–
1
votes
28
Formal Languages
If G= ({S} , {a}, {S--->SS} , S), then language L(G) is a)ϕ b)aa(a)* c)(aa)* d)None of these
If G= ({S} , {a}, {S ->SS} , S), then language L(G) isa)ϕb)aa(a)*c)(aa)*d)None of these
665
views
answered
Oct 15, 2018
Theory of Computation
theory-of-computation
finite-automata
grammar
+
–
3
votes
29
GATE CSE 1995 | Question: 2.4
What is the value of $X$ printed by the following program? program COMPUTE (input, output); var X:integer; procedure FIND (X:real); begin X:=sqrt(X); end; begin X:=2 FIND(X); writeln(X); end. $2$ $\sqrt{2}$ Run time error None of the above
What is the value of $X$ printed by the following program?program COMPUTE (input, output); var X:integer; procedure FIND (X:real); begin X:=sqrt(X); end; begin X:=2 FIND(...
7.1k
views
answered
Sep 9, 2018
Compiler Design
gate1995
compiler-design
parameter-passing
runtime-environment
easy
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register