Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged nielit-sta-2020
1
votes
1
answer
31
NIELIT Scientific Assistant A 2020 November: 50
Some code optimizations are carried out on the intermediate code because: they enhance the portability of the compiler to other target processors program analysis is more accurate on intermediate code than on machine code the ... cannot otherwise be used for optimization the information from the front end cannot otherwise be used for optimization
Some code optimizations are carried out on the intermediate code because:they enhance the portability of the compiler to other target processorsprogram analysis is more a...
gatecse
601
views
gatecse
asked
Dec 9, 2020
Compiler Design
nielit-sta-2020
compiler-design
code-optimization
normal
+
–
1
votes
0
answers
32
NIELIT Scientific Assistant A 2020 November: 51
Given $r_{12}=0.6, r_{13}=0.5$ and $r_{23}=0.8,$ the value of $r_{12.3}$ is : $0.47$ $0.40$ $0.74$ $0.64$
Given $r_{12}=0.6, r_{13}=0.5$ and $r_{23}=0.8,$ the value of $r_{12.3}$ is :$0.47$$0.40$$0.74$$0.64$
gatecse
394
views
gatecse
asked
Dec 9, 2020
Combinatory
nielit-sta-2020
combinatory
recurrence-relation
+
–
1
votes
3
answers
33
NIELIT Scientific Assistant A 2020 November: 52
In case of the dynamic programming approach the value of an optimal solution is computed in : Top down fashion Bottom up fashion Left to Right fashion Right to Left fashion
In case of the dynamic programming approach the value of an optimal solution is computed in :Top down fashionBottom up fashionLeft to Right fashionRight to Left fashion
gatecse
669
views
gatecse
asked
Dec 9, 2020
Compiler Design
nielit-sta-2020
compiler-design
dynamic-programming
+
–
1
votes
1
answer
34
NIELIT Scientific Assistant A 2020 November: 53
Which of the following is not true for tree and graph? A tree is a graph A graph is a tree Tree can have a cycle Tree is a $\text{DAG}$
Which of the following is not true for tree and graph?A tree is a graphA graph is a treeTree can have a cycleTree is a $\text{DAG}$
gatecse
447
views
gatecse
asked
Dec 9, 2020
Compiler Design
nielit-sta-2020
compiler-design
code-optimization
directed-acyclic-graph
+
–
1
votes
1
answer
35
NIELIT Scientific Assistant A 2020 November: 54
How many $\text{AND, OR}$ and $\text{XOR}$ gates are required for implementation of full adder? $1,2,2$ $2,2,1$ $3,2,2$ $3,0,1$
How many $\text{AND, OR}$ and $\text{XOR}$ gates are required for implementation of full adder?$1,2,2$$2,2,1$$3,2,2$$3,0,1$
gatecse
488
views
gatecse
asked
Dec 9, 2020
Digital Logic
nielit-sta-2020
digital-logic
combinational-circuit
+
–
1
votes
1
answer
36
NIELIT Scientific Assistant A 2020 November: 55
A $26-$bit address bus has maximum accessible memory capacity of ________ $\text{64 MB}$ $\text{16 MB}$ $\text{1 GB}$ $\text{4 GB}$
A $26-$bit address bus has maximum accessible memory capacity of ________$\text{64 MB}$$\text{16 MB}$$\text{1 GB}$$\text{4 GB}$
gatecse
605
views
gatecse
asked
Dec 9, 2020
CO and Architecture
nielit-sta-2020
co-and-architecture
memory-interfacing
+
–
1
votes
1
answer
37
NIELIT Scientific Assistant A 2020 November: 56
$\text{SRD}$ stands for __________. Software Requirements Definition Structured Requirements Definition Software Requirements Diagram Structured Requirements Diagram
$\text{SRD}$ stands for __________.Software Requirements DefinitionStructured Requirements DefinitionSoftware Requirements DiagramStructured Requirements Diagram
gatecse
446
views
gatecse
asked
Dec 9, 2020
IS&Software Engineering
nielit-sta-2020
is&software-engineering
+
–
1
votes
2
answers
38
NIELIT Scientific Assistant A 2020 November: 57
Which of the following problem is not $\text{NP}$ complete but undecidable? Partition Problem Halting Problem Hamiltonian Circuit Bin Packing
Which of the following problem is not $\text{NP}$ complete but undecidable?Partition ProblemHalting ProblemHamiltonian CircuitBin Packing
gatecse
483
views
gatecse
asked
Dec 9, 2020
Theory of Computation
nielit-sta-2020
theory-of-computation
p-np-npc-nph
+
–
1
votes
1
answer
39
NIELIT Scientific Assistant A 2020 November: 58
A stack can be implemented using queue, but then we need to use atleast : $3$ queues $2$ queues only one queue is sufficient none of the options
A stack can be implemented using queue, but then we need to use atleast :$3$ queues$2$ queuesonly one queue is sufficientnone of the options
gatecse
448
views
gatecse
asked
Dec 9, 2020
DS
nielit-sta-2020
data-structures
queue
+
–
1
votes
1
answer
40
NIELIT Scientific Assistant A 2020 November: 59
Adding the style attributes in $\text{HTML}$ elements, is known to be ___________. Internal Inline Outline External
Adding the style attributes in $\text{HTML}$ elements, is known to be ___________.InternalInlineOutlineExternal
gatecse
526
views
gatecse
asked
Dec 9, 2020
Web Technologies
nielit-sta-2020
web-technologies
+
–
1
votes
1
answer
41
NIELIT Scientific Assistant A 2020 November: 60
Term in the $\text{MVC}$ architecture that receives events is called _________. Receiver Controller Transmitter Modulator
Term in the $\text{MVC}$ architecture that receives events is called _________.ReceiverControllerTransmitterModulator
gatecse
381
views
gatecse
asked
Dec 9, 2020
Digital Signal Processing
nielit-sta-2020
digital-signal-processing
+
–
1
votes
1
answer
42
NIELIT Scientific Assistant A 2020 November: 61
Find the mode of the following data: ... $20.22$ $19.47$ $21.12$ $20.14$
Find the mode of the following data:$\begin{array}{|l|l||l|l||l||l|l|} \hline \text{Age} & \text{0-6}& \text{6-12} & \text{12-18} & \text{18-24} & \text{24-30} & \text{...
gatecse
555
views
gatecse
asked
Dec 9, 2020
Quantitative Aptitude
nielit-sta-2020
quantitative-aptitude
statistics
+
–
1
votes
1
answer
43
NIELIT Scientific Assistant A 2020 November: 62
A digital signature is required: for non-repudiation of communication by a sender for all e-mail sending for all $\text{DHCP}$ server for $\text{FTP}$ transactions
A digital signature is required:for non-repudiation of communication by a senderfor all e-mail sendingfor all $\text{DHCP}$ serverfor $\text{FTP}$ transactions
gatecse
472
views
gatecse
asked
Dec 9, 2020
Computer Networks
nielit-sta-2020
computer-networks
digital-signature
+
–
1
votes
1
answer
44
NIELIT Scientific Assistant A 2020 November: 63
What is the product of following matrix using Strassen's matrix multiplication algorithm? $ A=\begin {bmatrix} 1&3\\ 5 &7 \end{bmatrix} \;\;\;\;\;\; B=\begin {bmatrix} 8&4\\ 6 &2 \end{bmatrix} $ $C_{11}=80; C_{12}=07;C_{21}=15;C_{22}=34$ ... $C_{11}=15; C_{12}=07;C_{21}=80;C_{22}=34$ $C_{11}=26; C_{12}=10;C_{21}=82;C_{22}=34$
What is the product of following matrix using Strassen’s matrix multiplication algorithm?$$ A=\begin {bmatrix} 1&3\\ 5 &7 \end{bmatrix} \;\;\;\;\;\; B=\begin {b...
gatecse
546
views
gatecse
asked
Dec 9, 2020
Algorithms
nielit-sta-2020
algorithms
divide-and-conquer
+
–
1
votes
1
answer
45
NIELIT Scientific Assistant A 2020 November: 64
Which of the following is a correct time complexity to solve the $0/1$ knapsack problem where $n$ and $w$ represents the number of items and capacity of knapsack respectively? $O(n)$ $O(w)$ $O(nw)$ $O(n+w)$
Which of the following is a correct time complexity to solve the $0/1$ knapsack problem where $n$ and $w$ represents the number of items and capacity of knapsack respecti...
gatecse
670
views
gatecse
asked
Dec 9, 2020
Algorithms
nielit-sta-2020
algorithms
dynamic-programming
easy
knapsack-problem
time-complexity
+
–
1
votes
1
answer
46
NIELIT Scientific Assistant A 2020 November: 65
Finding the location of the element with a given value is : Traversal Search Sort None of the options
Finding the location of the element with a given value is :TraversalSearchSortNone of the options
gatecse
410
views
gatecse
asked
Dec 9, 2020
Algorithms
nielit-sta-2020
algorithms
searching
+
–
1
votes
1
answer
47
NIELIT Scientific Assistant A 2020 November: 66
Peephole optimization is a : Loop optimization Local optimization Constant folding Data flow analysis
Peephole optimization is a :Loop optimizationLocal optimizationConstant foldingData flow analysis
gatecse
457
views
gatecse
asked
Dec 9, 2020
Compiler Design
nielit-sta-2020
compiler-design
code-optimization
+
–
1
votes
1
answer
48
NIELIT Scientific Assistant A 2020 November: 67
Which one of the following statements is $\text{FALSE}$? Context-free grammar can be used to specify both lexical and syntax rules. Type checking is done before parsing High level language programs can be translated to different Intermediate Representations Arguments to a function can be passed using the program stack
Which one of the following statements is $\text{FALSE}$?Context-free grammar can be used to specify both lexical and syntax rules.Type checking is done before parsingHigh...
gatecse
422
views
gatecse
asked
Dec 9, 2020
Compiler Design
nielit-sta-2020
compiler-design
easy
compilation-phase
+
–
1
votes
1
answer
49
NIELIT Scientific Assistant A 2020 November: 68
Which of the following construct is not supported by Java Server Pages? $\text{JSP}$ Directives $\text{JSP}$ Scriptlets $\text{JSP}$ Actions $\text{JSP}$ Reaction
Which of the following construct is not supported by Java Server Pages?$\text{JSP}$ Directives$\text{JSP}$ Scriptlets$\text{JSP}$ Actions$\text{JSP}$ Reaction
gatecse
411
views
gatecse
asked
Dec 9, 2020
Java
nielit-sta-2020
java
+
–
1
votes
1
answer
50
NIELIT Scientific Assistant A 2020 November: 69
Type of conflicts that can arise in $\text{LR(0)}$ techniques are ________. Shift-reduce conflict Shift-Shift conflict Both “Shift-reduce conflict” & “Shift-Shift conflict” None of the options
Type of conflicts that can arise in $\text{LR(0)}$ techniques are ________.Shift-reduce conflictShift-Shift conflictBoth “Shift-reduce conflict” & “Shift-Shift conf...
gatecse
405
views
gatecse
asked
Dec 9, 2020
Compiler Design
nielit-sta-2020
compiler-design
parsing
+
–
1
votes
1
answer
51
NIELIT Scientific Assistant A 2020 November: 70
A computer has a single cache (off-chip) with a $3$ ns hit time and a $95\%$ hit rate. Main memory has a $50$ ns access time. If we add an on-chip cache with a $0.6$ ns hit time and a $98\%$ hit rate, the computer’s effective access time: $\text{2.8 ns}$ $\text{5.5 ns}$ $\text{0.7 ns}$ None of the options
A computer has a single cache (off-chip) with a $3$ ns hit time and a $95\%$ hit rate. Main memory has a $50$ ns access time. If we add an on-chip cache with a $0.6$ ns h...
gatecse
894
views
gatecse
asked
Dec 9, 2020
Operating System
nielit-sta-2020
operating-system
memory-management
+
–
1
votes
1
answer
52
NIELIT Scientific Assistant A 2020 November: 71
___________ CSS property allow to wrap a block of text around an image. wrap push float align
___________ CSS property allow to wrap a block of text around an image.wrappushfloatalign
gatecse
521
views
gatecse
asked
Dec 9, 2020
Web Technologies
nielit-sta-2020
web-technologies
+
–
2
votes
1
answer
53
NIELIT Scientific Assistant A 2020 November: 72
Let $\text{R=(A,B,C,D,E)}$ having following $\text{FDs}.\;\text{F}=\{\text{A}\rightarrow \text{BC, CD} \rightarrow \text{E, B}\rightarrow \text{D, E}\rightarrow \text{A}\}.$ Which of the following is not a Candidate key? $\text{A}$ $\text{B}$ $\text{E}$ $\text{BC}$
Let $\text{R=(A,B,C,D,E)}$ having following $\text{FDs}.\;\text{F}=\{\text{A}\rightarrow \text{BC, CD} \rightarrow \text{E, B}\rightarrow \text{D, E}\rightarrow \text{A}\...
gatecse
440
views
gatecse
asked
Dec 9, 2020
Databases
nielit-sta-2020
databases
database-normalization
candidate-key
+
–
1
votes
1
answer
54
NIELIT Scientific Assistant A 2020 November: 73
Anomalies are avoided by splitting the offending relation into multiple relations, is also known as __________. Accupressure Decomposition Precomposition Both decomposition & precomposition
Anomalies are avoided by splitting the offending relation into multiple relations, is also known as __________.AccupressureDecompositionPrecompositionBoth decomposition &...
gatecse
493
views
gatecse
asked
Dec 9, 2020
Databases
nielit-sta-2020
databases
database-normalization
+
–
1
votes
1
answer
55
NIELIT Scientific Assistant A 2020 November: 74
What is the output of the following program? abstract class sum { public abstract int sumOfTwo(int n1, int n2); public abstract int sumOfThree(int n1, int n2, int n3); public void disp(){ System.out.println("Method of class Sum"); } } class ... $26\\10\\\text{Method of class Sum}$ $\text{Method of class Sum}\\26\\10$ $\text{Error}$
What is the output of the following program?abstract class sum { public abstract int sumOfTwo(int n1, int n2); public abstract int sumOfThree(int n1, int n2, int n3); pub...
gatecse
402
views
gatecse
asked
Dec 9, 2020
Java
nielit-sta-2020
numerical-answers
java
+
–
1
votes
1
answer
56
NIELIT Scientific Assistant A 2020 November: 75
The ___________ field in $\textsf{IPv4}$ datagram is not related to fragmentation. Flag Offset TOS Identifier
The ___________ field in $\textsf{IPv4}$ datagram is not related to fragmentation.FlagOffsetTOSIdentifier
gatecse
386
views
gatecse
asked
Dec 9, 2020
Computer Networks
nielit-sta-2020
computer-networks
fragmentation
+
–
1
votes
1
answer
57
NIELIT Scientific Assistant A 2020 November: 76
The default character encoding in $\text{HTML5}$ is _________ $\text{UTF-16}$ $\text{UTF-32}$ $\text{UTF-8}$ $\text{ISO-8859-1}$
The default character encoding in $\text{HTML5}$ is _________$\text{UTF-16}$$\text{UTF-32}$$\text{UTF-8}$$\text{ISO-8859-1}$
gatecse
461
views
gatecse
asked
Dec 9, 2020
Web Technologies
nielit-sta-2020
web-technologies
html
+
–
1
votes
1
answer
58
NIELIT Scientific Assistant A 2020 November: 77
Black Box Software Testing method focuses on the : Boundary condition of the software Control structure of the software Testing of user Interface only Cyclomatic Complexity
Black Box Software Testing method focuses on the :Boundary condition of the softwareControl structure of the softwareTesting of user Interface onlyCyclomatic Complexity
gatecse
512
views
gatecse
asked
Dec 9, 2020
IS&Software Engineering
nielit-sta-2020
is&software-engineering
software-testing
+
–
1
votes
1
answer
59
NIELIT Scientific Assistant A 2020 November: 78
Which of the following scenarios may lead to an irrecoverable error in a database system? A transaction writes a data item after it is read by an uncommitted transaction A transaction reads a data item after it is read by an ... it is written by a committed transaction A transaction reads a data item after it is written by an uncommitted transaction
Which of the following scenarios may lead to an irrecoverable error in a database system?A transaction writes a data item after it is read by an uncommitted transactionA ...
gatecse
441
views
gatecse
asked
Dec 9, 2020
Databases
nielit-sta-2020
databases
transaction-and-concurrency
+
–
1
votes
1
answer
60
NIELIT Scientific Assistant A 2020 November: 79
Which of the following algorithms can be used to most efficiently find whether a cycle is present in a given graph? Prim’s Minimum Spanning Tree Algorithm Breadth First Search Depth First Search Kruskal’s Minimum Spanning Tree Algorithm
Which of the following algorithms can be used to most efficiently find whether a cycle is present in a given graph?Prim’s Minimum Spanning Tree AlgorithmBreadth First S...
gatecse
630
views
gatecse
asked
Dec 9, 2020
Algorithms
nielit-sta-2020
algorithms
graph-algorithms
+
–
Page:
« prev
1
2
3
4
5
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register