Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged nielit-sta-2020
1
votes
1
answer
61
NIELIT Scientific Assistant A 2020 November: 80
A software Requirements Specification $\text{(SRS)}$ document should avoid discussing which one of the following? User interface issues Non-functional requirements Design solutions Interfaces with third party software
A software Requirements Specification $\text{(SRS)}$ document should avoid discussing which one of the following?User interface issuesNon-functional requirementsDesign so...
gatecse
419
views
gatecse
asked
Dec 9, 2020
IS&Software Engineering
nielit-sta-2020
is&software-engineering
+
–
1
votes
1
answer
62
NIELIT Scientific Assistant A 2020 November: 81
In the Model-View-Controller (MVC) architecture, the model defines the ____________. Data-access layer Presentation layer Business-logic layer Interface layer
In the Model-View-Controller (MVC) architecture, the model defines the ____________.Data-access layerPresentation layerBusiness-logic layerInterface layer
gatecse
796
views
gatecse
asked
Dec 9, 2020
IS&Software Engineering
nielit-sta-2020
is&software-engineering
software-design
+
–
1
votes
1
answer
63
NIELIT Scientific Assistant A 2020 November: 82
To guarantee correction of upto $5$ errors in all cases, the minimum Hamming distance in a block code must be ______. $11$ $6$ $5$ $2$
To guarantee correction of upto $5$ errors in all cases, the minimum Hamming distance in a block code must be ______.$11$$6$$5$$2$
gatecse
537
views
gatecse
asked
Dec 9, 2020
Computer Networks
nielit-sta-2020
computer-networks
hamming-code
+
–
1
votes
2
answers
64
NIELIT Scientific Assistant A 2020 November: 83
Which of the following is correct recurrence for worst case of QuickSort? $T(n)=T(n-4)+T(n-2)+O(1)$ $T(n)=T(n-1)+T(0)+O(n)$ $T(n)=2T(n/2)+O(n)$ $T(n)=4T(n/2)+O(n)$
Which of the following is correct recurrence for worst case of QuickSort?$T(n)=T(n-4)+T(n-2)+O(1)$$T(n)=T(n-1)+T(0)+O(n)$$T(n)=2T(n/2)+O(n)$$T(n)=4T(n/2)+O(n)$
gatecse
522
views
gatecse
asked
Dec 9, 2020
Algorithms
nielit-sta-2020
algorithms
quick-sort
recurrence-relation
+
–
1
votes
1
answer
65
NIELIT Scientific Assistant A 2020 November: 84
The static keyword is used in public static void main() declaration in Java: To enable the $\text{JVM}$ to make call to the main(), as class has not been instantiated To enable the $\text{JVM}$ to make call to the main(), as class ... as class has not been loaded To enable the $\text{JVM}$ to make call to the main(), as class has not been finalized
The static keyword is used in public static void main() declaration in Java:To enable the $\text{JVM}$ to make call to the main(), as class has not been instantiatedTo en...
gatecse
465
views
gatecse
asked
Dec 9, 2020
Java
nielit-sta-2020
java
+
–
1
votes
1
answer
66
NIELIT Scientific Assistant A 2020 November: 85
Which flip-flop is used to make all types of shift registers? JK flip-flop D flip-flop T flip-flop All the options
Which flip-flop is used to make all types of shift registers?JK flip-flopD flip-flopT flip-flopAll the options
gatecse
541
views
gatecse
asked
Dec 9, 2020
Digital Logic
nielit-sta-2020
digital-logic
sequential-circuit
flip-flop
+
–
2
votes
1
answer
67
NIELIT Scientific Assistant A 2020 November: 86
A minimal super key (i.e, one of the super keys for which no proper subset is a superkey) is called: Super Key Candidate Key Primary Key Both Candidate and Primary Key
A minimal super key (i.e, one of the super keys for which no proper subset is a superkey) is called:Super KeyCandidate KeyPrimary KeyBoth Candidate and Primary Key
gatecse
479
views
gatecse
asked
Dec 9, 2020
Databases
nielit-sta-2020
databases
database-normalization
candidate-key
+
–
1
votes
1
answer
68
NIELIT Scientific Assistant A 2020 November: 87
Why does congestion occur? Because the routers and switches have tables Because the routers and switches have queues Because the routers and switches have cross-points None of the options
Why does congestion occur?Because the routers and switches have tablesBecause the routers and switches have queuesBecause the routers and switches have cross-pointsNone o...
gatecse
671
views
gatecse
asked
Dec 9, 2020
Computer Networks
nielit-sta-2020
computer-networks
congestion-control
+
–
2
votes
1
answer
69
NIELIT Scientific Assistant A 2020 November: 88
The given array is $\text{arr={1, 2, 4, 3}}$. Bubble sort is used to sort the array elements. How many passes will be done to sort the array? $4$ $2$ $1$ $3$
The given array is $\text{arr={1, 2, 4, 3}}$. Bubble sort is used to sort the array elements. How many passes will be done to sort the array?$4$$2$$1$$3$
gatecse
824
views
gatecse
asked
Dec 9, 2020
Algorithms
nielit-sta-2020
algorithms
sorting
bubble-sort
+
–
1
votes
1
answer
70
NIELIT Scientific Assistant A 2020 November: 89
Which of the following Interface is not supported by $\text{JDBC}$ for connecting to Database in Java Programming language? Statement Interface Prepared Statement Interface Callable Statement Interface Database Interface
Which of the following Interface is not supported by $\text{JDBC}$ for connecting to Database in Java Programming language?Statement InterfacePrepared Statement Interface...
gatecse
462
views
gatecse
asked
Dec 9, 2020
Java
nielit-sta-2020
java
+
–
1
votes
1
answer
71
NIELIT Scientific Assistant A 2020 November: 90
What does <main> include? Header Sidebar Article Footer
What does <main include?HeaderSidebarArticleFooter
gatecse
451
views
gatecse
asked
Dec 9, 2020
Web Technologies
nielit-sta-2020
web-technologies
html
+
–
1
votes
1
answer
72
NIELIT Scientific Assistant A 2020 November: 91
With the following syntax INSERT INTO table[(column[,column...])] VALUES (value[, value...]); you can: Insert one row at a time Insert multiple rows at a time Insert one column at a time Insert multiple columns at a time
With the following syntaxINSERT INTO table[(column[,column...])] VALUES (value[, value...]);you can:Insert one row at a timeInsert multiple rows at a timeInsert one colum...
gatecse
520
views
gatecse
asked
Dec 9, 2020
Databases
nielit-sta-2020
databases
sql
+
–
1
votes
1
answer
73
NIELIT Scientific Assistant A 2020 November: 92
If we don’t want to allow a floating div to the left side of an element, _________ $\text{CSS}$ property will we use. margin clear float padding
If we don’t want to allow a floating div to the left side of an element, _________ $\text{CSS}$ property will we use.marginclearfloatpadding
gatecse
822
views
gatecse
asked
Dec 9, 2020
Web Technologies
nielit-sta-2020
web-technologies
css
+
–
1
votes
1
answer
74
NIELIT Scientific Assistant A 2020 November: 93
When we perform in order traversal on a binary tree, we get the ascending order array. The tree is: Heap tree almost complete binary tree Binary search tree Cannot be determined
When we perform in order traversal on a binary tree, we get the ascending order array. The tree is:Heap treealmost complete binary treeBinary search treeCannot be determi...
gatecse
344
views
gatecse
asked
Dec 9, 2020
DS
nielit-sta-2020
data-structures
binary-search-tree
+
–
1
votes
1
answer
75
NIELIT Scientific Assistant A 2020 November: 94
Shift reduce parsing can also be called as: Reverse of the Right Most Derivation Right Most Derivation Left Most Derivation None of the options
Shift reduce parsing can also be called as:Reverse of the Right Most DerivationRight Most DerivationLeft Most DerivationNone of the options
gatecse
419
views
gatecse
asked
Dec 9, 2020
Compiler Design
nielit-sta-2020
compiler-design
parsing
lr-parser
+
–
1
votes
1
answer
76
NIELIT Scientific Assistant A 2020 November: 95
The router table contains addresses belonging to ___________ protocol(s). a single two multiple none of the options
The router table contains addresses belonging to ___________ protocol(s).a singletwomultiplenone of the options
gatecse
501
views
gatecse
asked
Dec 9, 2020
Computer Networks
nielit-sta-2020
computer-networks
network-protocol
+
–
1
votes
1
answer
77
NIELIT Scientific Assistant A 2020 November: 96
In an undirected graph, if we add the degrees of all vertices, it is: odd even cannot be determined always $n+1,$ where $n$ is number of nodes
In an undirected graph, if we add the degrees of all vertices, it is:oddevencannot be determinedalways $n+1,$ where $n$ is number of nodes
gatecse
412
views
gatecse
asked
Dec 9, 2020
Graph Theory
nielit-sta-2020
graph-theory
easy
degree-of-graph
+
–
1
votes
2
answers
78
NIELIT Scientific Assistant A 2020 November: 97
Domain constraints, functional dependency and referential integrity are special forms of _______ Foreign key Primary key Assertion Referential constraint
Domain constraints, functional dependency and referential integrity are special forms of _______Foreign keyPrimary keyAssertionReferential constraint
gatecse
521
views
gatecse
asked
Dec 9, 2020
Databases
nielit-sta-2020
databases
database-normalization
referential-integrity
+
–
1
votes
1
answer
79
NIELIT Scientific Assistant A 2020 November: 98
When retrieving data in particular table in PostgreSQL, we use the ______ statement. \dt ORDER BY SELECT FROM \i
When retrieving data in particular table in PostgreSQL, we use the ______ statement.\dtORDER BYSELECT FROM\i
gatecse
428
views
gatecse
asked
Dec 9, 2020
Databases
nielit-sta-2020
databases
sql
+
–
2
votes
1
answer
80
NIELIT Scientific Assistant A 2020 November: 99
A bag contains $10$ white balls and $5$ blue balls. A ball is drawn from the bag and its color is noted. This ball is put back in the bag along with $3$ more balls of the same color. A ball is drawn again from the bag at random. The probability that the first ball drawn is blue, given that the second ball drawn is blue, is: $1/3$ $3/4$ $8/9$ $4/9$
A bag contains $10$ white balls and $5$ blue balls. A ball is drawn from the bag and its color is noted. This ball is put back in the bag along with $3$ more balls of the...
gatecse
758
views
gatecse
asked
Dec 9, 2020
Probability
nielit-sta-2020
probability
conditional-probability
+
–
2
votes
2
answers
81
NIELIT Scientific Assistant A 2020 November: 100
The number of tokens in the following C/C++ statement is : printf("i=%d, &i=%xx", i&i); $9$ $6$ $10$ $12$
The number of tokens in the following C/C++ statement is :printf("i=%d, &i=%xx", i&i);$9$$6$$10$$12$
gatecse
597
views
gatecse
asked
Dec 9, 2020
Compiler Design
nielit-sta-2020
compiler-design
lexical-analysis
compiler-tokenization
+
–
3
votes
1
answer
82
NIELIT Scientific Assistant A 2020 November: 101
What is the time complexity of the following recursive function? int ComputFun(int n) { if(n<=2) return 1; else return (ComputFun(floor(sqrt(n)))+n); } $\Theta(n)$ $\Theta(\log n)$ $\Theta(n\log n)$ $\Theta(\log \log n)$
What is the time complexity of the following recursive function?int ComputFun(int n) { if(n<=2) return 1; else return (ComputFun(floor(sqrt(n)))+n); }$\Theta(n)$$\Theta(\...
gatecse
901
views
gatecse
asked
Dec 9, 2020
Algorithms
nielit-sta-2020
algorithms
recursion
time-complexity
+
–
1
votes
2
answers
83
NIELIT Scientific Assistant A 2020 November: 102
You have a network ID of $192.168.10.0$ and require at least $25$ host IDs for each subnet, with the largest amount of subnets available. Which subnet mask should you assign? $255.255.255.192$ $255.255.255.224$ $255.255.255.240$ $255.255.255.248$
You have a network ID of $192.168.10.0$ and require at least $25$ host IDs for each subnet, with the largest amount of subnets available. Which subnet mask should you ass...
gatecse
930
views
gatecse
asked
Dec 9, 2020
Computer Networks
nielit-sta-2020
computer-networks
subnetting
+
–
1
votes
1
answer
84
NIELIT Scientific Assistant A 2020 November: 103
Consider an array of positive integers between $123456$ to $876543$, which sorting algorithm can be used to sort these number in linear time? Impossible to sort in linear time Radix Sort Insertion Sort Bubble Sort
Consider an array of positive integers between $123456$ to $876543$, which sorting algorithm can be used to sort these number in linear time?Impossible to sort in linear ...
gatecse
640
views
gatecse
asked
Dec 9, 2020
Algorithms
nielit-sta-2020
algorithms
sorting
radix-sort
+
–
1
votes
1
answer
85
NIELIT Scientific Assistant A 2020 November: 104
Software consists of ___________ Set of instructions $+$ operating procedures Programs $+$ documentation $+$ operating procedures Programs $+$ hardware manuals Set of programs
Software consists of ___________Set of instructions $+$ operating proceduresPrograms $+$ documentation $+$ operating proceduresPrograms $+$ hardware manualsSet of program...
gatecse
418
views
gatecse
asked
Dec 9, 2020
IS&Software Engineering
nielit-sta-2020
is&software-engineering
software-design
+
–
1
votes
1
answer
86
NIELIT Scientific Assistant A 2020 November: 105
Assembly line scheduling and Longest Common Subsequence problems are an example of _______. Dynamic Programming Greedy Algorithms Greedy Algorithms and Dynamic Programming respectively Dynamic Programming and Branch and Bound respectively
Assembly line scheduling and Longest Common Subsequence problems are an example of _______.Dynamic ProgrammingGreedy AlgorithmsGreedy Algorithms and Dynamic Programming r...
gatecse
741
views
gatecse
asked
Dec 9, 2020
Algorithms
nielit-sta-2020
algorithms
dynamic-programming
+
–
1
votes
1
answer
87
NIELIT Scientific Assistant A 2020 November: 106
Changes are made to the system to reduce the future system failure chances is called __________. Preventive Maintenance Adaptive Maintenance Corrective Maintenance Perfective Maintenance
Changes are made to the system to reduce the future system failure chances is called __________.Preventive MaintenanceAdaptive MaintenanceCorrective MaintenancePerfective...
gatecse
556
views
gatecse
asked
Dec 9, 2020
IS&Software Engineering
nielit-sta-2020
is&software-engineering
software-design
+
–
1
votes
1
answer
88
NIELIT Scientific Assistant A 2020 November: 107
In the given program: class Dialog1 { public static void main(String args[]) { Frame f1=new Frame("INDIA"); f1.setSize(300,300); f1.setVisible(true); FileDialog d=new FileDialog(f1,"MyDialog"); d.setVisible(true); ... of the following statements are true? f1.setClear(true); f1.setVisible(true); f1.setlook(true); f1.setclean(true);
In the given program:class Dialog1 { public static void main(String args[]) { Frame f1=new Frame("INDIA"); f1.setSize(300,300); f1.setVisible(true); FileDialog d=new File...
gatecse
467
views
gatecse
asked
Dec 9, 2020
Java
nielit-sta-2020
java
+
–
1
votes
1
answer
89
NIELIT Scientific Assistant A 2020 November: 108
Which of the following are two main types of overloading in Java? Overloading and linking Overriding and linking Reusability and data-hiding Overloading and Overriding
Which of the following are two main types of overloading in Java?Overloading and linkingOverriding and linkingReusability and data-hidingOverloading and Overriding
gatecse
390
views
gatecse
asked
Dec 9, 2020
Java
nielit-sta-2020
java
+
–
1
votes
1
answer
90
NIELIT Scientific Assistant A 2020 November: 109
A program $\text{P}$ reads in $500$ integers in the range $[0\dots100]$ representing the scores of $500$ students. It then prints the frequency of each score above $50.$ What would be the best way for $\text{P}$ to store the ... An array of $50$ numbers An array of $100$ numbers An array of $500$ numbers A dynamically allocated array of $550$ numbers
A program $\text{P}$ reads in $500$ integers in the range $[0\dots100]$ representing the scores of $500$ students. It then prints the frequency of each score above $50.$ ...
gatecse
672
views
gatecse
asked
Dec 9, 2020
DS
nielit-sta-2020
data-structures
array
easy
+
–
Page:
« prev
1
2
3
4
5
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register