1.

begin either with 0 or 1

2.

end with 0

3.

end with 00

4.

contain the substring 00

1.

15

2.

3.

26

4.

1
1.

26

2.

3.

4.

12
1.

(41,17,209)
2.

(41,17,697)

3.

(41,17,49)

4.

(41,17,640)
1.

1411

2.

1088

3.

1112

4.

3262
1. 3
2. 9
3. 0
4. 7

1.

2.

3.

4.
1.

2.
3.

4.

1.

2.

3.

4.

1.

3 CNF-Sat

2.

4 CNF-Sat

3.

5 CNF-Sat

4.
 2 CNF-Sat

A ___________ represents a unit of

[Link] objects
work with the database and most of
2. Session
the RDBMS supports transaction
3. Criteria objects
functionality
4. Transaction
1.

Composition Rule

2.

Reflexivity Rule
If X → Y and YZ → W then XZ
→ W is
3.

Union Rule

4.

Pseudo transitive Rule

1.

Low Rate Usage

2.

Least Rate Usage

LRU stands for
3.

Least Recently Used

4.

Low Required Usage

#include <stdio.h>

int main()
1. 1.50
2. 1.00
{ printf("Hello World");
3. Compiler Error
4. 0.00
printf("%.2f",(float)((int)3.5/2.0));

return 0;}
 #include <stdio.h>

int main()
1. 1.50
{ printf("Hello World");
2. 1.00
3. Compiler Error
printf("%.2f",((int)3.5/2.0));
4. 0.00
return 0;}

#include<stdio.h>

void main()
1.
{
Garbage values
int a[5];
2.
Int I;
Address Address Address Address Address
for(i=0;i<=4;i++)
3.
printf(“%d “,a[i]);
00000
}
4.

12345
a.
b.
c.
d.
#include<stdio.h>
1.
void main()
Garbage values
{
2.
static int a[5];
Address Address Address Address Address
Int I;
3.
for(i=0;i<=4;i++)
00000
printf(“%d “,a[i]);
4.
}
12345
a.
b.
c.
d.

1.

Statement 1 is true

Statement 1: Private Cloud may 2.

exist only on-premises.
Both the statements are true
Statement 2: Private Cloud can be
managed by a third party 3.

Statement 2 is true

[Link] the statements are false

1.

Feistel networks

2.

Rijndael networks
__________ do not encrypt an entire
block per iteration.
3.

Feister networks

4.

Both (a) and (b)

1.

Recovery-management component of the DBMS

2.
Ensuring isolation property is the
Concurrency-control component of the DBMS
responsibility of the
3.

Transaction-management component of the DBMS

4.
 Buffer management component in DBMS
1.
Framework activities
2.
__________ are applied throughout Umbrella activities
the software process. 3.
Planning activities
4.
Construction activities
1.
Masquerade
A threat action that interrupts delivery 2.
of system services by hindering Falsification
system operation is known as 3.
____________. Repudiation
4.
Obstruction
1.
DDA
An interface that provides I/O transfer 2.
of data directly to and from the Serial interface
memory unit and peripheral is termed 3.
a BR
4.
DMA
1.
inorder traversa
2.
level order traversal
BFS on a rooted tree is equivalent to
3.
postorder traversal
4.
preorder traversal
1.
Write Miss
2.
During a write operation if the
Write latency
required block is not present in the
3.
cache then ______ occurs.
Write hit
4.
Write delay
1.

No auxiliary memory
Finite automata --------------- memory
2.
Finite
 3.
Infinite
4.

none of the choices

1.
Only rear pointer changes
If a queue is implemented using
2.
linked list by keeping track of a front
Neither of the pointers change
pointer and a rear pointer, which of
3.
these pointers will change during an
Only front pointer changes
insertion into a non-empty queue?
4.
Both of the pointers change
If the running time of algorithm A is
Θ(g(n)), then 1.
Only I is true
(I) The worst-case running time of A 2.
is O(g(n)) Only II is true
3.
(II) The best case running time of A is both I and II are true
Ω(g(n)) 4.
Both I and II are false
Pick the correct choice
1.
Poisson
2.
In Advanced Encryption Standard,
Galois field
_________ arithmetic is used in the
3.
Substitution-Box.
Regular
4.
Normal
1.
Select * from R natural join S
2.
In SQL the statement select * from R, Select * from R cross join S
S is equivalent to 3.
Select * from R union join S
4.
Select * from R inner join S
1.
Θ(b^n )
2.
Let a, b ∈ R and b > 0. The value of Θ(n^b )
(n + a)^b is 3.
Θ(nb)
4.
Θ(n + b)
 1.
Physical level
2.
Object based data models are used in Both conceptual and view level
describing the abstraction at 3.
Both Physical and conceptual level
4.
All the 3 Levels ( Physical, Conceptual and View )
Suppose that a bus has 16 data lines
and requires 4 cycles of 250 ns each to
transfer data. The bandwidth of this 1. 1 Megabyte/sec
bus would be 2 Megabytes/sec. If the 2. 4 Megabytes/sec
cycle time of the bus was reduced to 3. 8 Megabytes/sec
125 ns and the number of cycles 4. 2 Megabytes/sec
required for transfer stayed the same
what would the bandwidth of the bus?
The relation scheme student
performance (name, courseNo, rollNo,
grade) has the following functional
dependencies:
1. 2 NF
name, courseNo --> grade 2. 3 NF
Rol INo, courseNo —> grade 3. BCNF
name —> rollNo 4. 4 NF
rollNo —> name

The highest normal form of this

relation scheme is:
1.
O(n)
2.
The solution of the recurrence T(n) = O(n^2 logn)
T(n − 1) + log n is 3.
O(nlogn)
4.
O(logn)
1.
queue
Which of the following data structures 2.
is most efficient in terms of both space array
and time to reverse a string of 3.
characters? linked list
4.
stack
1.
Which of the following operations is Searching an unsorted list for a given item
performed more efficiently by doubly 2.
linked list than by a singly linked list? Inserting a node after the node with a given location
3.
 Traversing the list to process each node
4.
Deleting a node whose location is given
1.
Informed search
2.
Which of the following search uses
Depth-first search
the problem-specific knowledge
3.
outside the definition of the problem
Breadth-first search
4.
Uninformed search
1.
{a(cd)^nb|n>=1}
2.

{a(cd)^n>=1}U{b(cd)^n|n>=1}

(a+b)(cd)*(a+b) denotes the following 3.

set {a(cd)^na|n>=0}U{a(cd)^nb|n>=0}U{b(cd)^na|n>=0}U{b(cd)^nb|n>
0}
4.

{ac^nd^nb|n>=1}
1.
Service oriented architecture
2.
----------------------- is a design pattern
SOAP
to provide services to other application
3.
through protocol.
Spring MVC
4.
Spring
. Match the following.

List-
I List-II
1.
P. Regular expression 1. P-4. Q-1, R-2, S-3
Lexical analysis 2.
P-1, Q-3, R-4, S-2
Q. Pushdown automata 2. 3.
Code generation P-3, Q-4, R-1, S-2
4.
R. Dataflow analysis 3. P-2, Q-1, R-4, S-3
Syntax analysis

S. Register allocation 4.
Code optimization
 1.
1NF
2.
. Relations that are generated from the 2NF
ER model will always be in 3.
3NF
4.
4NF
1.
Network protocol
2.
1. SOAP is a format for sending Data Transfer Protocol
messages and is also called as 3.
Communication protocol
4.
None
1.
a. Plain text
2.
1. Which one of the following is not
a. Cipher text
mandatory in a symmetric key
3.
cryptosystem?
a. Secret key
4.
a. Session key
1.
Struts Services
2.
1. __________is used to convert your Web Services
application into Web-Application. 3.
Java Service
4.
Browser Action
1.
16-bit
1. In Data Encryption Standard, the 2.
encryption algorithm generates 16 24-bit
different ____ subkeys, one for each 3.
of the 16 encryption rounds 32-bit
4.
48-bit
1.
That a bean should be created for the class
2.
1. @Component annotation on That a bean should not be created for the class
class indicates 3.
That auto wiring should be enabled for the class.
4.
That auto wiring should not be enabled for the class.
 1.
RESTful
1. _________________ web 2.
services make use of HTTP protocol SOAP
as a medium of communication 3.
between client and server. Spring MVC
4.
Spring
1.
restrict-url
2.
1. Element used to restrict access intercept-url
to a particular URL. 3.
intercept-restrict
4.
none of these
1. Match the following where ‘n’
is the number of elements in the list.

1. Sorting a. 1.
O(1) 1-b, 2-c,3-a,4-d
2.
2. Binary search b. 1-c,2-b,3-a,4-d
O(nlogn) 3.
1-b,2-c,3-d, 4-a
3. Linear search c. 4.
O(logn) 1-a, 2-c,3-b,4-d

4. Search in a hash table d.

O(n)
1. STATE TRUE / FALSE: The 1.
service provider implements the True
service and makes it available on the2.
Internet. False
1.
CSS + HTTP
2.
XML + HTML
1. The basic Web Services 3.
platform is combination of _____ and XML + HTTP
_______ 4.
CSS + JAVA

[Link]
[Link]
1.
1. UDDI stands for Universal Description, Development and Integration
2.
 Universal Development, Design and Integration
3.
Universal Description, Discovery and Integration
4.
Universal testing, Discovery and Integration
1. What is the output of the
following recursive function when
cal(2,4) is called?
1.
Output is 6
int func(int x, int y)
2.
{
Output is 4
if (y==2)
3.
return 1;
Output is 2
else
4.
return x * func(x,y-1);
Output is 5
}

1.
REST is a web Service Standard
2.
1. Which of the following best REST is a Cloud – native API framework.
describes REST? 3.
REST is a microservices – based protocol.
4.
REST is an architectural style.
1.
WSDL
2.
1. Which of the following is a
UDDI
component of a Web Service
3.
architecture?
SOAP
4.
SOAP, WSDL and UDDI
1.
Service Registry
1. Which of the following role of 2.
web service architecture implements Service Provider
the service and makes it available on 3.
the Internet? Service Requestor
4.
none
1.
True
2.
1. A bean can have more than one
False
name using multiple id attributes?
3.
May be
4.
 Can't say
1.
Polygon
2.
1. Convex hull is defined as the
Rectangle
smallest __________ that encloses all
3.
the given points in 2-D space.
Ellipse
4.
Circle
1. Find the time complexity of the
code segment below.

function daa(A, n, T)

L := 0

R := n − 1

while L ≤ R do
1.
m := floor((L + R) / 2) O(n)
2.
if A[m] < T then O(n!)
3.
L := m + 1 O(log n)
4.
else if A[m] > T then O(nl

R := m − 1

else:

return m

return unsuccessful

1. Given the following three points

in 2D-space, find the orientation of P3 1.
P5 with P4 Clockwise
2.
Counter Clockwise
3.
Collinear
4.
Cannot be determined.
 1.
P and NP are disjoint
2.
1. Identify the relationship
P is a subset of NP
between P and NP complexity classes
3.
of algorithms.
NP is a subset of P
4.
P and NP are equal
1.

2.

1. Identify which graph below is a 3.

bipartite graph.

4.

1.
1. In the network flow graph, the
s-A-t
flow edges are marked in red. Identify
2.
the path from the list below which is a
s-B-t
valid augmenting path when “Ford
3.
Fulkerson algorithm for finding max s-B-A-t
flow” is applied. 4.
s-B-A-B-t

1. Match the following with

respect to a network flow graph.

1. Flow conservation constraint a.

Source and sink nodes should not be in
the same set 1.
1-c,2-b,3-a, 4-d
2. Capacity constraint b. 2.
Incoming flow equals the outgoing 1-b,2-d, 3-a, 4-c
flow from a vertex 3.
1-b, 2-d,3-c, 4-a
3. s-t cut c. 4.
The edges must have either capacity or 1-a, 2-b, 3-d, 4-c
flow greater than 0

4. Augmenting path d.
Flow cannot exceed the capacity over
an edge
1. Match the following.

[Link] and conquer a.

1.
overlapping subproblems
1-d, 2-c, 3-a, 4-b
2.
2. Dynamic programming b.
1-d, 2-a, 3-b, 4-c
state space tree
3.
1-a, 2-d, 3-c, 4-b
3. Backtracking c.
4.
branching decision in a state space tree
1-d, 2-a, 3-c, 4-b
4. Branch and bound d.
disjoint subproblems
 1.
O(nn)
2.
1. Pick out one from below that
O(n!)
does not come under complexity class
3.
“NP”
O(n3)
4.
O(2n)
1.
O(nlogn)
2.
1. Pick out one from below that
O(n3)
does not come under complexity class
3.
“P”.
O(n3logn)
4.
O(2n)
1.
Matrix multiplication
2.
1. Pick out the algorithm whose Floyd’s algorithm
time complexity is not O(n3) 3.
Warshall's algorithm
4.
Matrix Addition
1.
The steps in a deterministic algorithm are uniquely defined
2.
The outcome of each step in a nondeterministic algorithm cannot be
1. Pick out the statement below
determined
which is false.
3.
The deterministic algorithms are efficient
4.
The nondeterministic algorithms are efficient
1.

2.

1. Polynomial reduction is
transitive implies the following is true
where L1 and L2 are unknown 3.
problems. Pick out the correct option.

4.
 1.

2.

3.

1. The relationship between NP, 4.

NP-Hard and NP-Complete (NPC) is
the following

1.
Component
2.
Object
1. What is Bean in Spring?
3.
Class
4.
Container
1.
O(nlogn)
2.
1. What is the average time O(n^2)
complexity of randomized quicksort? 3.
O(n^2logn)
4.
O(n^3)
1.
O(VE)
1. What is the time complexity of
2.
Edmond Karps algorithm where ‘V’ is
O(VE2)
the set of vertices and ‘E’ is the
3.
number of edges in the network flow
O(V2E)
graph.
4.
O(V2 E2)
1.
1. Which algorithm strategy listed
Brute force
below guarantees in producing near
2.
optimal solution with reasonable time
Heuristic
complexity?
3.
 Approximate
4.
Nondeterministic

1. Which of the following method 1. static factory method

can be used to use to instantiate a 2. default-init method
method? 3. destroy method
4. lazy-init method
1.
An event is an object that describes a state change in a source

2.
What is an event in delegation event An event is an object that describes a state change in processing
model used by Java programming
language? 3.
An event is a class used for defining object, to create events

4.
An event is an object that describes any change by the user and system
1.
interface
2.
abstract class
What is [Link]?
3.
concrete class
4.
final class
What will be the effect of the 1.
following code snippet in Java? Creates a new file “[Link]”

2.
Opens an existing file “[Link]”

3.
Compilation error

4.
Raises an exception which will not b e handled by the code
1.
[Link]()

Which of the following code is used to 2.

get names of the parameters in servlet? [Link]()
(Objects in the options closely
represent the classes from which they 3.
are created) [Link]()

4.
[Link]()
 1.
[Link]()
Which of the following code retrieves
2.
name and version of the protocol in
[Link]()
Servlet programming? (Objects in the
3.
options closely represent the classes
[Link]()
from which they are created)
4.
[Link]()
1.
10
3. Let f(n) = 2n and g(n) = n^3 + 10. 2.
Assume that we write g(n) = O(f(n)) 9
using the standard definition of big-oh 3.
notation. Then the value of n0 is 8
4.
7
1.
Starting angle, ending angle, center x , center y, radius
2.
51. "arc" function is used to draw an
Ending angle, starting angle, center x , center y, radius
arc with the parameter values as in
3.
order of
Center x , center y, starting angle, ending angle, radius
4.
Radius, Center x , center y, starting angle, ending angle
1.
Dots
2.
51. In computer graphics, pictures or
Pixels
graphics objects are presented as a
3.
collection of discrete picture elements
Coordinates
called__________
4.
Points

Find the false statement/s?

(A) There is unique minimal DFA for

every regular language
1.
(B) All non-deterministic Turing A and B
machine can’t be converted to an 2.
equivalent deterministic Turing B and C
machine 3.
A and D
(C) All RE is not a CFL 4.
D only
(D) All subset of a recursively
enumerable set is not recursive
Which of the following statements is
false?

(A) Every NFA can be converted to an

equivalent DFA

(B) Every non-deterministic Turing 1.D ONLY

machine can be converted to an 2. A ONLY
equivalent deterministic Turing 3. B ONLY
machine 4. C ONLY

(C) Every regular language is also a

context-free language

(D) Every subset of a recursively

enumerable set is recursive
1.
John is asked to make an automaton 11
which accepts a given string for all the 2.
occurrence of ‘1001’ in it. How many 9
number of transitions would John use 3.
such that, the string processing 12
application works? 4.
15
1.
0
2.
.L1= {w | w does not contain the string 1
tr } 3.
2
L2= {w | w does contain the string tr} 4.
Cannot be said
Given ∑= {t, r}, The difference of the
minimum number of states required to [Link]
form L1 and L2? string-tr-%7DL2-%7Bw-w-does-contain-the-string-tr%7DGiven-sum
%7Bt--r%7D--The-
dif#:~:text=The%20two%20languages%20L1%20and,and%20%22tr
tor%22%20are%20not.
Consider the following languages:
1.
L1 = {0^i1^j | i != 2j}
Only L3
2.
L2 = {0^i1^j | i = 2j+1}
Only L3 & L2
3.
L3 = {0^i1^j | i = j}
Only L4 & L3
4.
L4 = {0^i1^j | i != j}
L1, L2, L3, and L4
Which of these is/are context-free:
 1.
regular
Consider the language given below: 2.
not context-free but context sensitive
{a^m b^n C^(m+n) | m, n ≥ 1} It is a 3.
___________ language. not context-sensitive but type-0
4.
not regular but context-free
1.
xyx*y*yyx
Consider the RE for all strings starts 2.
with xy and ends with yyx is. xy(xy)*yyx
3.
xy(x+y)*yyx
4.
xyx*y*xyyyx
1.
For the given grammar
a, S + a
2.
S →S + a | S × a | a
a, S + S × a
3.
For a sentence a + a × a, the handles in
a, a + a and a + a × a
the right-sentential form of the
4.
reduction are
a, S + a and S × a
Given the grammar
1.
E→T∗E ∣T Precedence of + over ∗ is confirmed
2.
T→F+T ∣F Parsing is ambiguous
3.
F→a∣b Right to left assessment of ∗ and + occurs
4.
Which of the following statements is Parsing is unambiguous
wrong?

If G is the CFG, r is the total 1.

number of rightmost derivations, l r ≤ P ≥ l
is the total number of leftmost 2.
derivations, as well as P refers to r=P=l
the total number of parse trees, then 3.
assume that r, l, and P are computed r ≥ P ≤ l
for some given particular string. 4.
Here, for a given ‘G’ CFG and r ≥ P =l
given ‘w’ string, what is the
relation between all three of these?
 1.
If we consider an arbitrary NFA N!
(non-deterministic finite 2.
automaton) with N states in total, 2N
the maximum number of states that 3.
are there in an equivalent DFA 2^N
(minimised) is at least: 4.
N^2
1.
DFA – 4, NFA – 3
2.
DFA – 3, NFA – 3
3.
DFA – 3, NFA – 4
4.
DFA – 4, NFA – 4

If you consider a regular expression

r, in which r = (11 + 111)* over Ʃ =
{0, 1}, then the number of states in
minimal DFA and NFA
respectively are:

1.
9 states
2.
In the finite automaton with 10 states
minimum state deterministic that 3.
accepts a given language L={w | w 11 states
ε {0,1} *, the total number of 0s as 4.
well as 1s in w that would be 15 states
divisible by 3 & 5, respectively}
would have: Reason:

Modulo 3 gives remainder as ( 0, 1, 2 ) , and Modulo 5 gives

remainder as ( 0, 1, 2, 3, 4 ). Hence 3 * 5 sates, i.e. there will
be 15 states in the automaton to represent this.
Regular expression for the given 1.
DFA is c*ad*
2.
 c*a(d+bc*a)*
3.
c*ad*ba*d*
4.
c*a(d*+bc*a)*

1.
10
The total number of states to build
2.
the given language using DFA:
11
3.
L = {w | w has exactly 2 a’s and at
12
least 2 b’s}
4.
13
1.
{xϵ {0,1} *|x is all binary number with even length}
Which among the following looks 2.
similar to the given expression? {xϵ {0,1} |x is all binary number with even length}
3.
((0+1). (0+1)) * {xϵ {0,1} *|x is all binary number with odd length}
4.
{xϵ {0,1} |x is all binary number with odd length}
1.
a only
Which of the folowing pairs of
2.
regular expressions are equivalent ?
b only
3.
a. (01)* and (10)* 1
c only
4.
b. x (xx) * and (xx) * x
a , b and c
c. x+ and x+x*+
[Link]
following-pairs-of-regular-expression
1.
(m*n* + o*)*
Which one of these given regular
2.
expressions isn’t equivalent to this
((mn)* + o*)*
regular expression:
3.
(m*n*o*)*
(m + n + o) *
4.
(m* + n* + o*)*
 [Link]
7-2/
Given the language L = {ab, aa, 1.
baa}, which of the following strings 1, 2, 3
are in L*? 2.
2, 3, 4
1) abaabaaabaa 3.
1, 2, 4
2) aaaabaaaa 4.
1, 3, 4
3) baaaaabaaaab
[Link]
4) baaaaabaa ab-aa-baa-which-of-the--6092478dc2f5138793870dce
L1 is accepted by the NFA,
obtained by changing the accepting 1.
state of M to a non-accepting state L1 = {0, 1}* – L
and vice versa. Which of the 2.
following statements is true? L1 = {0, 1}*
3.
L1 ⊆ L
4.
L1=L

[Link]
question-55/

Let w be any string of length n is

{0,1}*. Let L be the set of all 1.
substring of w. n–1
State the minimum number of states 2.
in a NDFA that accepts L? n
3.
n+1
4.
2n – 1

1.
Let L1 = {w ∈ {0,1}∗ | w has at
L1 is regular but not L2
least as many occurrences of
2.
(110)’s as (011)’s}
L2 is regular but not L1
3.
Let L2 = {w ∈ {0,1}∗ | w has at
Both L2 and L1 are regular
least as many occurrences of
4.
(000)’s as (111)’s}
Neither L1 nor L2 are regular
Which one of the following is
[Link]
TRUE?
question-45/
 1.
27
. The number of tokens in the 2.
following C code segment is 29
3.
1. switch(inputvalue) 26
4.
2. { 24

3. case 1 : b =c*d; break;

4. default : b =b++; break;

5. }

1.
i) A → A’a ii) A’ → AB / Dc iii) D → a / c
2.
i) A → aA’ ii) A’ → AD / Bc iii) D → c
3.
i) A → aA’ ii) A’ → AD / Bc iii) D → B / c
4.
i) A → aA’ ii) A’ → AB / Dc iii) D → B / c / a

Consider the grammar A → aAB /

aBc / aAc Find the left
factoring

1.
Consider the regular expression (a+b)*ba(a+b)*
a*(ba*)* which among the 2.
following designates the identical a+(a+ba)*
set as 3.
(a*b)*ba*
4.
(b*a)*b*
1.
The number of tokens in the
34
following C code segment is
2.
37
 3.
33
switch(A) 4.
35
{

case 1 : m =n*p; break;

case 2 : s =u*v; break;

default : q =q++; break;

}
Which one of the following is
FALSE?

1.
(A) There is unique minimal DFA
A only
for every regular language
2.
B only
(B) Every NFA can be converted to
3.
an equivalent PDA.
C only
4.
(C) Complement of every context-
D only
free language is recursive.

(D) Every nondeterministic PDA

can be converted to an equivalent
deterministic PDA.
Which one of the following is true
for this finite state automaton?
1.
b*ab*ab*
2.
b*a(a+b)*
3.
b*ab*ab*ab*
4.
(a+b)*b

Which one of the following 1.

is/are FALSE? A and B
2.
B, C and D
3.
(A) All non-deterministic finite C only
automata can be converted to 4.
equivalent deterministic finite D only
automata

(B) Every NFA can be converted to

an equivalent PDA.

(C) Complement of every context-

free language is not recursive.

(D) Every nondeterministic Push

down automata can’t be converted
to an equivalent deterministic Push
down automata.
1.
0.5, 0.3, 0.2
0.4, 0.2, 0.2
0.8
1. Apply approximation 2.
algorithm that applies first fit 0.5, 0.3
strategy to pack the items into bins. 0.4, 0.2, 0.2, 0.2
O.8
3.
0.5, 0.3
0.4, 0.2, 0.2
0.8, 0.2
4.
0.5, 0.4
0.3, 0.2, 0.2
0.8, 0.2
1.
Public
[Link]
VMware is a ---------- cloud
3.
deployment model?
Dedicated
4.
Hybrid
1.
iPaaS
2.
mPaaS
3.
Cloud vendors cPaaS
offer PaaS solutions , not in the 4.
form of ePaaS

Reason:

Integration Platform as a service – iPaas

 Mobile Platform as a service – mPaas
Communication Platform as a service - cPaas
1.
All hybrid clouds are multi clouds
2.
All multi clouds are hybrid clouds
Point out the wrong statement
3.
All Dedicated clouds are private clouds
4.
All hybrid clouds are heterogeneous clouds
1.
World wide web
2.
Organize your Desktop Systems
Cloud computing can be defined as
3.
Computing resource that can be accessed on demand
4.
A method that creates a pool of similar resources
1.
IBM Smart cloud
2.
Which of the following is an Amazon EC2
example of Private cloud? 3.
Amazon VPC
4.
Google App Engine
Why cloud servers ?
1.
A, B & C
A. Integration
2.
A, C & D
B. Scalability
3.
B, C & D
C. Cost effectiveness
4.
D
D. Billing
1.
Unit that manages the performance, use, and delivery of
cloud services
2.
Mediator within cloud service providers and cloud
Cloud carrier is a consumers
3.
Conduct independent assessment of cloud services,
security, performance
4.
The end-user who browses or utilizes the services
Code development is -------------- 1.
service PaaS
 2.
SaaS
3.
FaaS
4.
IaaS
1.
On-demand Self Service
2.
The NIST Characteristics of
Resource grouping
the Cloud doesn’t include
[Link]
4.
Elasticity
1.
SaaS
2.
Which of the following is google NaaS
app engine implementation? 3.
IaaS
4.
PaaS
1.
Cloud Provider
2.
For additional value-added services
Cloud Auditor
from the cloud, the consumer needs
3.
to communicate --------
Cloud Broker
4.
Cloud Carrier
1.
IaaS
2.
In which of the following
NaaS
service models the hardware is
3.
virtualized in the cloud?
PaaS
4.
SaaS
1.
Integrate applications and data across multiple clouds
2.
Point out the wrong statement Migrate existing on-premises workloads
about Cloud solutions 3.
Traditional infrastructure among existing application
4.
Open and secure public platform for business
1.
1. Role of a cloud provider is /
Interoperability & Interoperability
are
2.
 Intermediation & Auditing
3.
Resource abstraction & Interoperability
4.
Auditing & Resource abstraction
1.
Sharon B. Codd
2.
1. Who is the father of cloud Edgar Frank Codd
computing? 3.
J.C.R. Licklider
4.
Charles Bachman
1.
2 pairs, 1 Quad, 0 Octet
2.
2 pairs, 2 Quad, 1 Octet
3.
1 pair, 2 Quad, 1 Octet
4.
0 pair, 2 Quad, 1 Octet

The K-Map for following function

will have
F(w,x,y,z) =
∑(0,1,2,4,5,6,8,9,12,13,14)

1.
DeMorgan’s Theorem
1. The pair of following 2.
statements represents Duality
(xy)’=x’ + y’; (x+y)’=x’y’ 3.
(x+y’)’=x’ + y; (x+y’)=x’y Inversion
4.
Both ‘a’ an ‘b’
1.
NAND gate
1. Which of the following is used
2.
for storing 1 bit digital data
NOR Gate
3.
 Flip Flop
4.
Register
1.
X + X Y =X
2.
X( X +Y) = XY
3.
X+XY = X
4.
ZX + Z X Y = ZX +ZY

1. Which of the following

statement is not correct?

1.
the variable value.
2.
When applied to a variable, what
the variable address.
does the unary & operator yield?
3.
the variable format.
4.
the variable right value.
1.
Only one value
2.
How many values can a C
Maximum of two values
Function return at a time.?
3.
Maximum of three values
4.
Maximum of 8 values
1.
an address value represented in hexadecimal.
Pointer variable may be 2.
assigned_______. an address value represented in octal.
3.
the address of another variable.
 4.
an address value represented in binary.
7) Choose correct statement
about C array pointers.
1.
I and II only
I. You can compare two array
2.
elements with *p == *(p+i)
II and III only
3.
II. You can compare two pointers
IV only
with p1==p2.
4.
I, II and III only
III. Accessing out of bounds index
element is valid and it returns a
Reason:
garbage value.
Adding two pointers are illegal in C
IV. You cannot add the pointers

7) Find the output of the

program:

#include<stdio.h>

#include<stdlib.h>

1.
int main() 10
2.
{ it will print the address stored in ptr1
3.
int *ptr1, *ptr2; it will print the address stored in ptr2
4.
ptr1 = malloc(4); it will give an error

*ptr1 = 10; Reason:

*ptr2 = free(ptr1); free() function will return no value.

printf("%d\n",*ptr2);

return 0;

}
7) Find the output of the
program:

#include<stdio.h>

#include<stdlib.h>

int main()

{
1.
int *ptr1; it will print “Printer” until the process has been stopped by
any external entity
while(1){ 2.
it will print nothing
ptr1 = malloc(512*4); 3.
segmentation fault
if(ptr1 == 0) 4.
it will print NULL
break;

sleep(1);

printf("Printer\n");

free(ptr1);

return 0;

7) In this program the allocated 1.

memory block can store int only
2.
float only
3.
#include<stdio.h> string only
4.
#include<stdlib.h> int and float both

Reason:
 int main() When the malloc() is used without typecasting the default
type is void*.
{

int *ptr;

ptr = malloc(10);

return 0;

7) This program will allocate the

memory of ___ bytes for pointer
“ptr”.

#include<stdio.h>

#include<stdlib.h>
1.
2
2.
int main()
4
3.
{
8
4.
int *ptr;
16
ptr =
(int*)malloc(sizeof(int)*4);

ptr = realloc(ptr,sizeof(int)*2);

return 0;

1.
Change the location of memory allocated by malloc() or
calloc().
2.
7) What is the functionality of
Reallocates memory deleted by free() function.
realloc() function?
3.
It is used to modify the size of the previously allocated
memory space.
4.
allocate memory for the first time
7) What is the output of this
program?

#include<stdio.h>

#include<stdlib.h>
1.
0
2.
-1
int main()
3.
garbage value
{
4.
2
int *ptr;
Reason:
ptr = (int
*)calloc(1,sizeof(int));
The memory allocated by calloc() contains 0 until
process does not make any change to it.
if (ptr != 0)

printf("%d\n",*ptr);

return 0;

7) What is the output?

void main()

int i=fun(18); 1.
17
printf("%d",--i); 2.
16
} 3.
18
int fun(int i) 4.
19
{

return i++;

}
7) What will be the output of the
following C code?

void main() {

int a[] = {1,2,3,4,5}, *p;

1.
24
p = a;
2.
34
++*p;
3.
22
printf("%d ", *p);
4.
23
p += 2;

printf("%d ", *p);

7) When the pointer is NULL,

then the function realloc is
equivalent to the function 1.
________ malloc()
2.
A. calloc()
3.
B. free()
4.
C. printf()

D. printf()
1.
int *p, a=10
2.
int a=10,*p=&a
7) Identify the wrong declaration
3.
statement________.
int *p=&a, =10
4.
int int a;
int p=&a;
1.
exchange the addresses of each element in the two rows.
7) The fastest way to exchange
2.
two rows in a two-dimensional
exchange the elements of the two rows.
array is________.
3.
store the addresses of the rows in an array of pointers and
exchange the pointers.
 4.
exchange both address and pointers in each row.
7) What is the output of the
following code?
1.
main() 10
2.
{ printf(%d\n,sum(5)); } 16
3.
int sum(int n) 14
4.
{ if(n<1) return n; 15

else return(n+sum(n-1));
1.
2
2.
7) What is the result of the
1
expression (23*2) % (int) 5.5?
3.
error
4.
0
Find the output of the program

#include<stdio.h>

#include<stdlib.h>

int main()
1.
{ 10
2.
int *ptr; 20
3.
*ptr = 10; Segmentation fault
4.
ptr = 20; Address of ptr

printf("%d\n",*ptr);

return 0;

}
 1.
f is pointer variable.
Identify the correct statement for
2.
given expression as________.
f is a fixed address and not a variable.
3.
float f [10], *fptr = f
f is an array variable.
4.
f is an address that can be modified.
1.
float to double.
2.
Loss in precision occurs for char to short.
typecasting from____________. 3.
float to int.
4.
long to float.
1.
NULL
On freeing a dynamic memory, if 2.
the pointer value is not modified, Other dynamically allocated memory
then the pointer points to? 3.
The same de-allocated memory location
4.
It points back to location it was initialized with
1.
0
2.
1
3.
2
The number of arguments used in 4.
malloc () is_______. 3

Reason:
(int*)malloc(3*sizeof(int)

It is clear from the above example that malloc() takes only

one argument as input, that is the number of bytes to be
allocated
1.
float values.
2.
The operator % can be applied only double values.
to __________ . 3.
character values.
4.
integer values.

Reason:
 The modulus operator only works on integers. For floating
point values use fmod or fmodf.
1.
*
2.
The operators exclusively used in
&
connection with pointers
3.
are________.
.
4.
* and &
1.
declaring user-defined data types.
2.
The typedef statement is used
declaring variant variables.
for________.
3.
for typecasting of variables.
4.
for typing static variables.
What is the output of C Program
with arrays and pointers.?

int main()

int ary[] = {43, 23, 42};

1.
int *p, *q; 23
2.
p = ary; 43 garbage_value
3.
q = ary+3; 43 42
4.
printf("%d %d",*p, *q); compiler error

return 0;

1.
stored in stack.
When a function is recursively
2.
called all automatic variables are
stored in queue.
___________.
3.
stored in array.
 4.
stored in linked list.
1.
memory is allocated by using malloc ().
2.
Which of the following is the most
memory is freed by a garbage collector.
accurate statement about runtime
3.
memory?
allocated memory can be freed by calling free ().
4.
memory is allocated by using malloc (), allocated memory
can be freed by calling free().
1.
(((***(a+i)+j)+k)+l)
How can you write a[i][j][k][l] in
2.
equivalent pointer expression?
((**(*(a+i)+j)+k)+l)
3.
(*(*(*(a+i)+j)+k)+l)
4.
*(*(*(*(a+i)+j)+k)+l)
1.
switch
2.
The keyword used to transfer
go
control from a function back to the
3.
calling function is
return
4.
exit
1.
Call by value

2.
call by reference
The default parameter passing
mechanism is
3.
call by value result

4.
Call by function
What is the value printed by the 1.
following C program? -9
2.
#include<stdio.h> 5
3.
int f(int *a, int n) 15
4.
{ 19
 if (n <= 0)return 0;

else if(*a%2 == 0) return

*a+f(a+1,n-1); [Link]
question-35/
else return *a-f(a+1, n-1);

int main ( )

int a[ ] = {12, 7, 13, 4, 11, 6};

printf("%d", f(a,6));

return 0;

}
1.
deterministic, probabilistic
Monte Carlo randomized 2.
algorithm’s correctness is _______ probabilistic, deterministic
and time complexity is 3.
___________. non-deterministic, deterministic
4.
deterministic, non-deterministic
1.
float
2.
void
3.
What is the default return type if it int
is not specified in function 4.
definition? short int

Reason:

If a function declaration does not specify a return type,

the compiler assumes an implicit return type of int .
1.
Storage services
2.
Autoscaling comes among which Communication services
Amazon web services 3.
Additional services
4.
Compute services
 Reason:

Amazon EC2 Auto Scaling helps you maintain

application availability and lets you automatically add
or remove EC2 instances using scaling policies that
you define (EC2 – COMPUTE SERVICE)
1.
persistent object
2.
1. The Hibernate architecture
session factory
consists of?
3.
transaction
4.
All of the above
1.
Yes
[Link]
1. What do you think about the
statement - "session being a thread-
3. 4.
safe object"?
Reason:
Session is not a thread-safe object which means that any
number of threads can access data from it simultaneously.
1.
First fit looks for the tight-fitting hole for the item
2.
Next fit places item in the current bin or in the next bin
3.
1. Choose the statement from
Best fit looks for the first hole large enough for the item
below which is correct related to
4.
the bin packing approximation
Next fit and First fit produce same result always
algorithm.
Reason:

Check to see if the current item fits in the current bin. If so, then
place it there, otherwise start a new bin.
1.
Johnson Shift
2.
Clock Shift
1. A series of equal space time 3.
pulses may be easily generated by Binary Shift
which type of counter circuit? 4.
Ring Counter

Reason:
 In Ring counter, the feedback of the output of the FF is fed to
the same FF’s input. Thus, it generates equally spaced timing
pulses.
1.
A counter has the capability to store n bit of information
whereas a register has one bit.
2.
1. The primary difference
A register counts data.
between a counter and a register is
3.
A register has no specific sequence of states.
4.
A counter has no particular sequence of states.
1.
The value is 10, 30
1. Consider the below statement 2.
– what will be the output? The value is 10, 0
3.
<div ng-app="" ng- The value is 10, NaN
init="values=[10, 20, 30]"> 4.
The value is 10,
<p>The value is {{values[0]}},
{{values[3]}}</p> Reason:

Because array indexing starts with 0 and ends with length of

</div> the array -1. In the above statement, there are only 3
elements and the last index is 2. Thus the
statement {{values[3]}} will print nothing.
Figure out which of these is
1.
part of the Google cloud service
i & ii
models?
2.
i & iii
i) Workspace
3.
ii & iii
ii) Computer Engine
4.
i, ii, iii
iii) Cloud Pricing Calculator
1.
1. Cloud computing architecture
1&4
is a combination of?
2.
2& 3
[Link]-oriented architecture
3.
3& 4
2. Grid architecture
4.
2& 4
3. Utility architecture
Reason:
4. Event-driven architecture.
 Cloud computing architecture is a combination of
service-oriented architecture and event-driven
architecture.
1.
A,B&C
Which is/ are True about 2.
FaaS A,B&D
3.
A. A subset of serverless D
4.
B. Event-driven computing B&D

C. Run and manage microservices [Link]

applications d%20Functions%2Das%2Da,messaging%2C%20api%20g
ateways%2C%20etc.
D. Require significant
maintenance for updating and [Link]
managing operating systems.
maximum answer is :A,B,C

Challenges in Cloud Computing 1.

B&C
A. Conflict to legacy programs 2.
A&C
B. Provenance 3.
D&C
C. QoS Measurement 4.
A&D
D. Reduction in Latency
Match the following

1. Storage & a. Message

Content Queuing 1.
delivery Services 1-a ,2-b,3-c,4-d
2.
2. Networkingb. Glacier
1-b ,2-a,3-c,4-d
3.
1-a ,2-b,3-d,4-c
3. Applicationc. Direct
4.
service Connect
1-b ,2-c,3-a,4-d
4. Deploymend. Elastic
t& Beanstalk
Management
1.
. Express Y = (A+B+C' ) (A+
Y= M4M6M7
B'+C' )(A+B+C) in maxterm
2.
designation
Y= M0M1M3
3.
Y= m4m6m7
 4.
Y= m0m1m3

1.
DMA bus
2.
Which of the following bus is used
IO bus
to transfer data from main memory
3.
to peripheral device?
Address BUs
4.
Data bus
1.
user-level virtualization
2.
Library-level virtualization is also OS-level virtualization
known as 3.
process- level virtualization
4.
application level virtualization
1.
Xen
2.
Hyper-V
3.
KVM
4.
Which one of the following is not a
Virtualbox
type-1 hypervisor?

1.
method are used to register a keylistener()
keyboard event listener. 2.
addkistener()
 3.
addkeylistener()
4.
eventkeyboardlistener()
1.
windowevent
2.
which of these events will be
actionevent
notified if scroll bar is
3.
manipulated?
adjustmentevent
4.
componenteven
1.
addmouse()
2.
which of these methods are used to addmouselistener()
register a mouse motion listener? 3.
addmousemotionlistner()
4.
eventmousemotionlistener()
1.
getid()
2.
which of these methods can be used getevent()
to determine the type of event? 3.
getsource()
4.
geteventobject()
1.
[Link]
2.
[Link]
3.
which of these packages contains
[Link]
all the classes and methods required
4.
for event handling in java?
[Link]

➔ Awt means(Abstract Window Toolkit )

1.
genereic servlets
what type of servlets use these [Link]
methods doget(), dopost(),dohead, 3.
dodelete(), dotrace()? built-in servlets
4.
standard servlets
 1.
servletinputstream
2.
which class provides stream to read servletoutputstream
binary data such as image etc. from
3.
the request object?
servletcharstream
4.
servletbinarystream
1.
only setattribute
2.
which methods are used to bind the only getattribute
objects on httpsession instance and 3.
get the objects? both setattribute and getattribute
4.
bindobject and getobject
1.
only rmi communication
2.
Which of these ways used to only http communication
communicate from an applet to 3.
servlet? only socket communication
4.
rmi, http, and socket communication
1.
add-on servletengine
2.
which type of servletengine is a
embedded servletengine
server that includes built-in support
3.
for servlets?
standalone servletengine
4.
standard serveletengine
1.
public member
2.
private member
a class member declared protected 3.
becomes member of subclass of protected member
which type? 4.
static member

Reason:
A class member declared protected becomes a private
member of subclass.
1.
As per NIST cloud reference
Only I
architecture, which one of the
2.
following is/are role of cloud Only II
auditor? 3.
Both I and II
I) Security audit 4.
I, II and III
II) Privacy audit

III) Service audit

Here a single program is executed
by all tasks simultaneously. At any
moment in time, tasks can be 1.
executing the same or different Single Program Multiple Data (SPMD)
instructions within the same 2.
program. These programs usually Multiple Program Multiple Data (MPMD)
have the necessary logic 3.
programmed into them to allow Von Neumann Architecture
different tasks to branch or 4.
conditionally execute only those MIMD
parts of the program they are
designed to execute.
1.
Integrity and Access Management
2.
IAM is one of the cloud security Identity and Access Management
solutions. IAM stands for 3.
Integrity and Authorization Management
4.
Identity and Authorization Management
If R represents a regular language, 1.
which of the following represents An Irregular Set
the Venn-diagram most correctly? 2.
R*
3.
R complement
4.
R reverse

Reason:
The given diagram represents the Kleene operation over the
Regular Language R in which the final states become the
initial and the initial state becomes final.
1.
3
If the instruction, Add R1,R2,R3 is
2.
executed in a system which is pipe-
~2
lined, then the value of S is (Where
3.
S is term of the Basic performance
~1
equation)
4.
6
 1.
3
2.
In a MapReduce programming
5
model, the number of mapper for
3.
word counting problem is
7
4.
depends on the data segment
1.
Only I
In HDFS architecture, the actual 2.
data are stored on the following Both I and II
node 3.
Both I and III
I) Name Node 4.
Both II and III
II) Data node
Apache Hadoop HDFS Architecture follows a Master/Slave
Architecture, where a cluster comprises of a single NameNode
III) Slave node
(Master node) and all the other nodes are DataNodes (Slave
nodes). DataNodes are the slave nodes in HDFS. The actual
data is stored on DataNodes.
1.
{w | w is a string of odd length}
2.
Let for ∑= {0,1} R= (∑∑∑) *, the {w | w is a string of length multiple of 3}
language of R would be 3.
{w | w is a string of length 3}
4.
{w | w is a string of at most length 3}
1.
To demonstrate a proportionate increase in parallel speedup
with the removal of some processors
2.
To demonstrate a proportionate increase in parallel speedup
Scalability refers to a parallel
with the addition of more processors
system’s (hardware and/or
3.
software) ability
To demonstrate a proportionate decrease in parallel
speedup with the addition of more processors
4.
A sequential execution of a program, one statement at a
time
1.
Involves only those tasks executing a communication
operation
Synchronous communication
2.
operations referred to
It exists between program statements when the order of
statement execution affects the results of the program.
3.
 It refers to the practice of distributing work among tasks so
that all tasks are kept busy all of the time. It can be
considered as minimization of task idle time.
4.
Involves many tasks executing a communication operation
1.
It require some type of “handshaking” between tasks that
are sharing dat(A) This can be explicitly structured in code
by the programmer, or it may happen at a lower level
unknown to the programmer.
2.
It involves data sharing between more than two tasks,
which are often specified as being members in a common
Synchronous communications
group, or collective
3.
It involves two tasks with one task acting as the
sender/producer of data, and the other acting as the
receiver/consumer.
4.
It allows tasks to transfer data independently from one
another.
Two processors A and B have clock
1.
frequencies of 700 Mhz and 900
Processor A
Mhz respectively. Suppose A can
2.
execute an instruction with an
Processor B
average of 3 steps and B can
3.
execute with an average of 5 steps.
Processor A and B
For the execution of the same
4.
instruction which processor is faster
Insufficient Information
?
1.
prototype( )
2.
prototype(void)
what is the prototype of the default
constructor of this class?
3.
public prototype(void)
public class prototype { }
4.
public prototype( )

1.
small algorithm
2.
Which Algorithm is better choice hash algorithm
for pipelining? 3.
merge-sort algorithm
4.
quick-sort algorithm
 1.
finalize()
2.
which function is used to perform
delete()
some action when the object is to
3.
be destroyed?
main()
4.
deleteAll()
1.
finally
2.
which of the following handles the
throw handler
exception when a catch is not used?
3.
default handler
4.
java run time system
1.
catchable

2.
which of the following is a super runtimeexceptions
class of all exception type classes?
3.
string

4.
throwable
1.
throws

which of the following keyword is 2.

used by calling function to handle throw
exception thrown by called
function? 3.
try

4.
catch
1.
Which of the following services
only I
that need to be negotiated in
2.
Service Level Agreements ?
Both I and III
I) Logging
3.
II)Auditing
Both II and III
4.
III) Regulatory compliance
I, II and III
1.
which of the following statements
default constructor is called at the time of declaration of the
are incorrect?
object if a constructor has not been defined.
 2.
constructor can be parameterized.
3.
finalize() method is called when a object goes out of scope
and is no longer needed.
[Link]() method must be declared protected.
1.
filestream
2.
which of these class contains the fileinputstream
methods used to write in a file? 3.
bufferedoutputstream
4.
filebufferstream
1.
ioexception
2.
which of these exception is thrown
fileexception
in cases when the file specified for
3.
writing is not found?
filenotfoundexception
4.
fileinputexception
1.
serialization
2.
Which of these is a process of
externalization
writing the state of an object to a
3.
byte stream?
file filtering
4.
object streaming
1.
upper
2.
which of these keywords is used to
super
refer to member of base class from
3.
a sub class?
this
4.
sub
1.
get()
2.
which of these methods are used to read()
read in from file? 3.
scan()
4.
readfileinput()
which of these methods is used to 1.
print stack trace? obtainstacktrace()
 2.
printstacktrace()
3.
getstacktrace()
4.
displaystacktrace()
1.
getexception()
2.
which of these methods return
getmessage()
description of an exception?
3.
obtaindescription()
4.
obtainexception()
1.
0
2.
which of these values is returned by
1
read() method is end of file (eof) is
3.
encountered?
-1
4.
null
1.
Flexible and efficient allocation of resources
2.
Which one of the following is not a Lowers the cost of IT infrastructure
benefit of virtualization? 3.
Remote access and rapid scalability
4.
Security risk
1.
MQTT Client
2.
Which one of the following is not a MQTT Server
MQTT component? 3.
MQTT Broker
4.
MQTT Connection
1.
Very large files
2.
Which one of the following is not
Streaming data access
applicable for HDFS ( Haddop
3.
Distributed File System)
Commodity hardware
4.
Low latency data access
Which one of the following is not 1.
true about full virtualization? unmodified guest OS to be run in isolation
 2.
completely simulates the underlying hardware
3.
fully decouples the guest OS
4.
Guest OS completely aware of its virtualization
1.
Enterprise is responsible for security end-to-end
2.
Which one of the following is the
Used individually managed security tools
unique challenge of cloud security
3.
than the traditional cyber security?
Static resources contain security boundaries
4.
Dynamic resources blurred security boundaries
1.
Token
2.
Which one of the following is used
Topic
to publish/subscribe the message
3.
through MQTT protocol?
Keyword
4.
Ticket
1.
Mapper
Which one of the following takes
2.
set of data and converts it into
Reducer
another set of data, where
3.
individual elements are broken
Shuffler
down into tuples (key/value pairs).
4.
Splitter
1.
Mapper
Which one of the following takes 2.
the output from a map as an input Reducer
and combines those data tuples into 3.
a smaller set of tuples? Shuffler
4.
Merger
1.
augmenting path
A simple acyclic path between 2.
source and sink which pass through critical path
only positive weighted edges is 3.
called residual path
4.
maximum path
Class P is the set of 1.
_______________ that can be Decision problem
solved in worst-case polynomial 2.
time optimization problem
3.
optimization decision problem
4.
Unsolvable problm
1.
Undirected and unweighted graphs
2.
Floyd Warshall Algorithm can be Undirected graphs
applied on __________ 3.
Directed graphs
4.
Acyclic graph
1.
always
If a problem is NP-complete there 2.
is ________________no approximately
polynomial-time algorithm to find 3.
an optimal solution most likely
4.
very likely
1.
LIFO branch and bound
2.
Which of the following is not a
FIFO branch and bound
branch and bound strategy to
3.
generate branches
Lowest cost branch and bound
4.
Highest cost branch and bound
What will be the output of the
following Java program?
1.
false
2.
true
3.
1
4.
Compilation error

1.
0
What will be the output of the
2.
following Java program?
2
3.
Runtime Error
 4.
Compilation error

1.
Run time
2.
When does Exceptions in Java
Compilation time
arises in code sequence?
3.
Deployment time
4.
Linking time
1.
Integration Testing
Generally, which testing is used 2.
when shrink-wrapped software Smoke testing
products are being established and 3.
part of an integration testing? Regression Testing
4.
Validation testing
1.
User's end
2.
In which environment we can Developer's end
performed the Alpha testing? 3.
User's and developer's end
4.
tester
1.
Function testing
2.
Which of the following is not part System testing
of the Test type? 3.
Statement testing
4.
Database testing
1.
Which one of the following Code inspection is carried out once the code has been unit
assertions concerning code tested
inspection and code walk-through 2.
is true? Code inspection and code walk-through are synonyms
3.
 Adherence to coding standards is checked during code
inspection
4.
Code walk-through is usually carried out by an independent
test team
1.
How many bits are required in the 7
operation code? If a Computer uses 2.
a memory unit with 1 M words of 6
32 bits each. A binary instruction 3.
code is stored in one word of 20
memory. The instruction has four 4.
parts: an indirect bit, an operation 5
code, a register code part to specify [Link]
one of 64 registers, and an address 2019-part-2-question-10
part
32 – (1+6+20)
1.
10 micro sec
An 8-bit serial-in/serial-out shift
2.
register is used with a clock
50 micro sec
frequency of 100 kHz What is the
3.
time delay between the serial input
60 micro sec
and the Q5 output?
4.
40 micro sec
1.
Consider a system with an 80% hit 230ns
ratio, 50 Nano-seconds times to 2.
search the associative registers, 750 950ns
Nano-seconds times to access 3.
memory. What is the effective 640ns
memory access time? 4.
310ns
1.
In a six-stage pipeline assuming 16
that there are no branch 2.
instructions. If we want to execute 15
15 instructions. What is the time 3.
required to execute these 21
instructions? 4.
20
1.
DMA is an approach of performing data transfers in bulk
between memory and the external device without the
Which of the following is true intervention of the processor.
about DMA? 2.
The DMA controller acts as a processor for DMA transfers
and does not overlooks the entire process.
3.
 The DMA controller has 6 registers.
4.
The DMA has separate PSW
1.
Observed speedup of a code which has been parallelized,
defined as: wall-clock time of serial execution and wall-
clock time of parallel execution
2.
The amount of time required to coordinate parallel tasks. It
includes factors such as: Task start-up time,
Parallel Overhead is
Synchronizations, Data communications
3.
Refers to the hardware that comprises a given parallel
system - having many processors
4.
Refers to the hardware that comprises a given parallel
system - having single processors
1.
Bus request
The CPU activities the ................... 2.
output to inform the external DMA Bus Grant
that the buses are in the high- 3.
impedance state. Cycle stealing
4.
Bus relinquishes
1.
7
2.
How many bits are required in the
6
operation code? If a Computer uses
3.
a memory unit with 1 M words of
20
32 bits each. A binary instruction
4.
code is stored in one word of
5
memory. The instruction has four
parts: an indirect bit, an operation
32-1-6-20 = x
code, a register code part to specify
x= 5
one of 64 registers, and an address
part
[Link]
memory-unit-with-256k-word-of-32--
5da03e58f60d5d5cf6490289
1.
Same as a mode-5 counter followed by a mod- 2 counter
2.
1. A mod-2 counter followed by a A decade counter
mod-5 counter is 3.
A mod-7 counter
4.
Ripple carry Counter
1. A ring counter is same as 1.
 Up-down counter
2.
Parallel counter
3.
Shift register
4.
Ripple carry counter
1.
Half Adder
2.
1. In which of the following adder
Full Adder
circuits, the carry look ripple delay
3.
is eliminated ?
Parallel Adder
4.
Carry-Look-Ahead Adder
1.
OR Gate
2.
AND Gate
1. Odd parity of word can be 3.
conveniently tested by NOR Gate
4.
XOR Gate

Reason:
XOR outputs 1 only when the input has odd number of 1's.
1.
log2 (N) + 1
2.
1. The number of flip-flops log2(N-1)
required in a modulo N counter is 3.
log2 (N)
4.
N log2 (N)
1.
8 half-adders, 8 full-adders
2.
1. The number of full and half-
1 half-adder, 15 full-adders
adders required to add 16-bit
3.
numbers is
16 half-adders, 0 full-adders
4.
4 half-adders, 12 full-adders
1.
Toggle switch
2.
1. The ring counter is analogous
Latch
to
3.
Stepping Switch
4.
 JK Flip Flop

1.
Rise time
2.
1. The time required for a gate or Decay time
inverter to change its state is called 3.
Propagation time
4.
Charging time
1.
One
1. What is the minimum number 2.
of two-input NAND gates used to Two
perform the function of two input 3.
OR gate? Three
4.
Four
1.
Propagation delay is the time required for a gate to change
its state
2.
Noise immunity is the amount of noise which can be
applied to the input of a gate without causing the gate to
1. Which of the following
change state
statements is wrong ?
3.
Fan-in of a gate is always equal to fan-out of the same gate
4.
Operating speed is the maximum frequency at which digital
data can be applied to a gate

1.
AND, OR, NOT gates
2.
1. Which one of the following set
EX-NOR or EX-OR gates
of gates are best suited for 'parity'
3.
checking and 'parity' generation.
NAND gates
4.
NOR gates
 1.
Continuous Delivery
2.
Which of the following is/are a key Continuous Testing
component of DevOps? 3.
Continuous Integration
4.
All of the them
1.
Security is increased because of the automation process
2.
How does DevOps impact the
Security is increased by excluding it earlier in the process
security of an application or
3.
machine?
Security is reduced because of the automation process
4.
None
1.
Waterfall Software Delivery
2.
Identify the methodologies does
Lean Manufacturing
least impact the establishment of
3.
DevOps methodology.
Continuous Software Delivery
4.
Agile Software Delivery
1.
Design Engineers
2.
What are the PRIMARY Quality Assurance
stakeholders for DevOps? 3.
Testers
4.
All of the them
1.
A small team of people that own everything related to a
particular service
2.
Developers performing operations
What is DevOps?
3.
Developers and Operations team members working
together
4.
None of above
1.
Continuous Monitoring tool
2.
What is the use of Jenkins? Continuous Integration tool
3.
Version Control System tool
4.
 Continuous Testing tool
1.
Automate Everything
2.
Which of the following is not a Continuous Improvement
feature of continuous delivery. 3.
Bug fixes and experiments
4.
Gathering Requirement
1.
Code
2.
Which of the following is not a part Plan
of Develops life cycle _________ 3.
Build
4.
Operating
1.
Liam Debois
2.
Who is known as the father of Patrick Debois
DevOps? 3.
Walter Dandy
4.
None of these
1.

What is the minimal spanning tree

of the graph below by applying
Prim’s algorithm with 0 as the root
vertex? 2.

3.
 4.

1.
training data
2.
__________ data used to build a hidden data
data mining model. 3.
test data
4.
validation data
1.
Manhattan distance
2.
Following is powerful distance
Euclidean distance
metrics used by Geometric model
3.
_______________
All of above
4.
None of above
1.
feature
In the example of predicting 2.
number of babies based on stork’s observation
population, number of babies is 3.
_______________ outcome
4.
attribute
1.
given a set of news articles found on the web, group them
into set of articles about the same story
2.
given email labeled as spam or not spam, learn a spam
Of the following examples, which
filter
would you address using a
3.
supervised learning Algorithm?
given a database of customer data, automatically discover
market segments and group customers into different market
segments
4.
find the patterns in market basket analysis
1.
Some telecommunication company
supervised learning
wants to segment their customers
2.
into distinct groups, this is an
unsupervised learning
example of ________________
3.
 data extraction
4.
reinforcement learning
1.
unsupervised learning
You are given reviews of few
2.
Netflix series marked as positive,
semi supervised learning
negative and neutral. Classifying
3.
reviews of a new Netflix series is
supervised learning
an example of ____________
4.
reinforcement learning
1.
Interactive
2.
For supervised learning we have predictive
____ model 3.
descriptive
4.
prescriptive
1.
Problem Identification
2.
This is the cleaning/transforming
Identification of Required Data
the data set in the supervised
3.
learning model.
Data Pre-processing
4.
Definition of Training Data Set
1.
Accuracy
2.
Which of the following measure is Recall
not used for a classification model? 3.
Error rate
4.
Purity
1.
a. Uniform Resource Identifier
______________ a service, 2.
provides resource representation a. Application programming interface
such as JSON and set of HTTP 3.
Methods. a. Spring MVC
4.
a. SOAP
1.
_______________are computer
Web application
programs that are accessed over the
2.
internet through a computer’s web
DB applications
browser.
3.
 System log
4.
Protocol
1.
SecurityFlowExecutionListener
2.
To enable Spring security for web SecurityFlowExecution
flows 3.
FlowSecurity
4.
SecurityFlowListener
1.
Drive and Operations
2.
Digital and Operation
What do DevOps stand for?
3.
Development And Operations
4.
None of these
1.
402
2.
What is the HTTP Status Code 404
Related to Page Not Found? 3.
403
4.
401
1.
Bagging
2.
___________ uses ensembles of
Boosting
ML models each capturing a
3.
specific subspace of predictor space
Stacking
4.
None of the above
1.
Bagging
2.
____________ uses ensembles to
Boosting
capture different characteristics of a
3.
task, learning how to combine them
Stacking
4.
None of the above
1.
Series
Boosting builds ensembles in
2.
___________
Parallel
3.
 Series and parallel
4.
None of the above
1.
Bagging
2.
Ensemble methods is/are Boosting
______________ 3.
Stacking
4.
All of the above
1.
Series
2.
Stacking builds ensembles in Parallel
____________ 3.
Series and parallel
4.
None of the above
1.
Linear, binary
Logistic regression is a ______ 2.
regression technique that is used to Linear, numeric
model data having a _______ 3.
outcome. Nonlinear, binary
4.
Nonlinear, numeric
1.
Mean relative error
2.
What is called the average squared
Mean squared error
difference between classifier
3.
predicted output and actual output?
Mean absolute error
4.
Root mean squared error
1.
Data dictionaries
2.
Decision tables
3.
All the following tools are used for Structured English
process descriptions except: 4.
Pseudocode

(Data dictionaries tools are used for process descriptions

excepts
 A data dictionary is a file or a set of files that contains a
database's metadata. The data dictionary contains
records about other objects in the database, such as data
ownership, data relationships to other objects, and other
data.
)
1.
100-200
2.
200-400
Build & Fix Model is most
3.
appropriate for implementing
400-1000
programming exercises of
4.
.....................LOC (Line of Code)
above 1000

(Build & Fix Model is suitable for small projects &

programming exercises of 100 or 200)
1.
Develop the software.
2.
Improve the software process.
3.
CMM model in Software Improve the testing process.
Engineering is a technique of 4.
Identifying the errors during maintenance.

(Capability Maturity Model (CMM) is a strategy for

improving the software process, irrespective of the
actual life cycle model used)
1.
11
2.
12
How many characteristics does
3.
Value Adjustment Factor(VAF) in
13
Function Point Analysis have?
4.
14

(14 – System Characteristics)

1.
Waterfall
2.
Spiral
The model remains operative until
3.
the software is retired
Incremental
4.
Prototyping
 (The spiral model remains operative until the software is
retired.

The spiral model is a risk-driven software development

process model.
)
1.
divide-and-conquer
2.
A simple approach that is efficient brute-force
when it works but does not always 3.
work is greedy
4.
dynamic-programming

1.
NP-complete = NP
2.
NP-complete intersection P = empty
Assuming P != NP, which of the 3.
following is true NP-hard = NP
4.
P = NP-complete

(The answer is B (no NP-Complete problem can be

solved in polynomial time).
1.
True
2.
False
Both FIFO branch and bound 3.
strategy and backtracking leads to NIL
depth first search 4.
NIL

(FIFO branch and bound leads to breadth first search.

Whereas backtracking leads to depth )
1.
branch and bound is more efficient than backtracking
2.
branch and bound is not suitable where a greedy algorithm
is not applicable
Choose the correct statement from
3.
the following
branch and bound divides a problem into at least 2 new
restricted sub problems
4.
backtracking divides a problem into at least 2 new
restricted sub problems
 (Both backtracking as well as branch and bound are
problem solving algorithms. Branch and bound is less
efficient than backtracking. Branch and bound divides a
problem into at least 2 new restricted sub problems.)
1.
There can be a polynomial time algorithm for 3SAT
2.
There can be no polynomial algorithm for 3SAT
If class P is not equal to class NP
3.
3SAT is not polynomial time reducible to Clique
4.
Clique is not polynomial time reducible to 3SAT
1.
1
2.
2
In how many directions do queens 3.
attack each other 3
4.
4

(Horizontal,Vertical,Diagonal)
1.
Depth-first search
2.
Breadth-first search
In what manner is a state-space tree 3.
for a backtracking algorithm Twice around the tree
constructed 4.
Nearest neighbor first

(A state-space tree for a backtracking algorithm is

constructed in the manner of depth-first search so that it
is easy to look into.)
1.
vertex matching
2.
chromatic index
Minimum number of unique colors 3.
required for vertex coloring of a chromatic number
graph is called 4.
color number

(The minimum number of colors required for vertex

coloring of graph 'G' is called as the chromatic number of
G, denoted by X(G))
The approach to algorithm design 1.
for optimization problems that divide and conquer
makes direct use of the fact that the 2.
most apparent next component of a greedy
solution is part of the optimal 3.
solution is brute force
4.
dynamic programming
1.
It backtracks to the root
2.
It continues searching for other possible solutions
What happens when the 3.
backtracking algorithm reaches a It traverses from a different route
complete solution 4.
Recursively traverses through the same route

(When we reach a final solution using a backtracking

algorithm, we either stop or continue searching for other
possible solutions)
1.
1 intermediate vertex
2.
0 intermediate vertex
What happens when the value of k 3.
is 0 in the Floyd Warshall N intermediate vertices
Algorithm 4.
N-1 intermediate vertices

(When k=0, a path from vertex i to vertex j has no

intermediate vertices at all. Such a path has at most one
edge and hence dij(0) = wij.)
1.
A condition where any two vertices having a common edge
should not have same color
2.
A condition where any two vertices having a common edge
should always have same color
3.
What is vertex coloring of a graph A condition where all vertices should have a different color
4.
A condition where all vertices should have same color

(The condition for vertex coloring of a graph is that two

vertices which share a common edge should not have the
same color. If it uses k colors in the process then it is called k
coloring of graph.)
1.
Which data structure is used for
Stack
implementing a LIFO branch and
2.
bound strategy
Queue
 3.
Array
4.
Linked list
1.
branch and bound
2.
dynamic programming
3.
Which of the following can traverse greedy algorithm
the state space tree only in DFS 4.
manner Backtracking

(Both backtracking as well as branch and bound are

problem solving algorithms. Branch and bound can
traverse in DFS as well as BFS manner whereas
backtracking only traverses in DFS manner.)
1.
If we want to prove that a problem X is NP-Hard we take a
known NP-Hard problem and reduce Y to X
2.
The first problem that was proved as NP-complete was the
circuit satisfiability problem
Which of the following is true
3.
about NP-Complete and NP-Hard
NP-complete is a subset of NP Hard
problems
4.
NP hard

Answer:

ALL OF THE ABOVE Except 4 (ANSWER -1,2,3)

1.
greedy algorithm
2.
Which of the following methods
divide and conquer
can be used to solve n-queen’s
3.
problem
iterative improvement
4.
backtracking
1.
n-queen problem
2.
subset sum problem
Which of the problems cannot be
3.
solved by backtracking method
hamiltonian circuit problem
4.
travelling salesman problem
 (N-queen problem, subset sum problem, Hamiltonian
circuit problems can be solved by backtracking
method whereas travelling salesman problem is
solved by Branch and bound method.)
1.
Finding the shortest path
2.
Finding the efficient quantity to shop
Which one of the following is an 3.
application of the backtracking Ludo
algorithm 4.
Crossword

(Crossword puzzles are based on backtracking approach

whereas the rest are travelling salesman problem,
knapsack problem and dice game)
1.
160
You are given a knapsack that can 2.
carry a maximum weight of 60. 200
There are 4 items with weights [20, 3.
30, 40, 70] and values [70, 80, 90, 170
200]. What is the maximum value 4.
of the items you can carry using the 90
knapsack
(The maximum value you can get is 160. This can be
achieved by choosing the items 1 and 3 that have a total
weight of 60.)
1.
Maximum length instruction task and VM with minimum
speed
2.
Given set of tasks with length of
Maximum length instruction task and VM with maximum
instructions and set of VM with
speed
speed. Which one of the following
3.
is true about Max-Min task
Minimum instruction length task and VM with maximum
scheduling algorithm?
speed
4.
Minimum instruction length task and VM with minimum
speed
1.
Fair for multi tenant system
2.
Which one of the following is not a
Tenant cannot benefit by lying
characteristic of dominant resource
3.
fairness algorithm?
Tenant cannot envy another tenant’s allocation
4.
Not suitable for multi-resource requirement
 1.
each VM has its own OS
2.
Which one of the following is not
all containers share the same kernel of host machine
true about virtual machine as
3.
compared to containers?
VM snapshots are used occasionally
4.
boot up time is faster than containers
Consider the following two 1.
statements: Only S1 is correct
S1 - {02n | n ≥ 1|} is regular 2.
language. Only S2 is correct
S2 - {0m 1n 0m + n | m ≥ 1 and n ≥ [Link] S1 and S2 are correct 4.
1|} is a regular language Both S1 and S2 are wrong
1.
i) E → pE’ ii) E’ → pqT / ∈ iii) T → pqrF / ∈ iv) F →
pqrs / ∈
2.
i) E → pE’ ii) E’ → qrT / ∈ iii) T → rsF / ∈ iv) F → sp
Consider the grammar E → p / pq / / ∈
pqr / pqrs Find the left factoring 3.
i) E → pE’ ii) E’ → qT / ∈ iii) T → sF / ∈ iv) F → r /
∈
4.
i) E → pE’ ii) E’ → qT / ∈ iii) T → rF / ∈ iv) F → s /
∈
1.
xyx*y*yyx
2.
Consider the RE for all strings xy(xy)*yyx
starts with xy and ends with yyx is. 3.
xy(x+y)*yyx
4.
xyx*y*xyyyx
Find the regular expressions
1.
(0+1) *(00+11) (0+1) *
2.
(0+1) *(0+11) *(0+1) *
3.
(0+1) *(00+110) (0+1)
4.
(0+1) (00+11) (0+1) *

1.
The set of all strings over ∑ = {a,b} [a(a+b)*b + b(a+b)*a]
in which all strings that starts with 2.
and ends with same letter is [a(a+b)*a + b(a+b)*b]
3.
 a(a+b)*a
4.
b(a+b)*b
Which of the following substring
will the following notation result?
1.
0101011
2.
0101010
3.
010100
4.
100001

(The given DFA notation accepts the string of even

length and prefix ‘01’)

Which of the following are regular

sets? 1.
I and IV
I. { an b2m | n>=0, m>=0} 2.
I and III
II. {an bm |n=2m} 3.
I only
III. {an bm | n!= m} 4.
IV only
IV {xcy |x,y€{a,b)*}
Which NDFA correctly represents
the following RE?

a(bab)*∪a(ba)*
1.

Which NDFA correctly represents

the following RE? 2.

a(bab)*∪a(ba)*
 3.

4.

What happens in the following

JavaScript code snippet?

var js = 0; 1.
An exception is thrown
while (js < 10) 2.
The values of js are logged or stored in a particular location
{ or storage
3.
[Link](js); The value of js from 0 to 9 is displayed in the console
4.
js++; An error is displayed

What will be the output of the

following JavaScript code snippet?
1.
// JavaScript Equalto Operators
false
2.
function equalto()
true
3.
{
compilation error
4.
int num=10;
runtime error
if(num==="10")
 return true;

else

return false;

What will be the output of the

following JavaScript code?

// JavaScript Comparison Operators

function compare()

{
1.
false
int num=2;
2.
true
char b=2;
3.
compilation error
if(a==b)
4.
runtime error
return true;

else

return false;

1.
4
2.
What will be the output of the 5
following JavaScript code? 3.
0
int a=0; 4.
Error
for(a;a<5;a++);
(The value of a will increase until it will become equal
[Link](a); to 5 after that the cursor will come out the loop.
There are no statements for the for loop therefore
only the value of a will increase. Hence the output will
be five.)
What will be the output of the
following JavaScript code?
1.
1, 2, 3, 6, 7, 8
var quiz=[1,2,3];
2.
123
var js=[6,7,8];
3.
123678
var result=[Link](js);
4.
1, 2, 3
[Link](result);

1.
Will the following JavaScript code An exception will be thrown
work? 2.
Memory leak
var js = (function(x) {return 3.
x*x;}(10)); Error
4.
Yes, perfectly
1.

2.

Given Language: L= {xϵ∑= {a, b}

|x has a substring ‘aa’ in the 3.
production}. Which of the
corresponding representation notate
the same?

4.

1.
What is the normal order of
1
activities in which traditional
2.
software testing is organized? (a)
2
Integration Testing (b) System
3.
Testing (c) Unit Testing (d)
3
Validation
4.
4
 1.
clear
Which session method begin a unit 2.
of work and return the associated cancelQuery
Transaction object? 3.
Transaction beginTransaction
4.
Transaction
1.
accuracy
2.
The importance of software design complexity
can be summarized in a single word 3.
efficiency
4.
quality
1.
Architectural design
Which design model is equivalent
2.
to the detailed drawings of the
Component-level design
access points and external utilities
3.
for a house?
Data design
4.
Interface design
1.
Negative
2.
FIND-S Algorithm starts from the
Positive
most specific hypothesis and
3.
generalize it by considering only
Negative or Positive
4.
None of the above
1.
Unsupervised Learning: Regression
Fraud Detection, Image
2.
Classification, Diagnostic, and
Supervised Learning: Classification
Customer Retention are
3.
applications in which of the
Unsupervised Learning: Clustering
following
4.
Reinforcement Learning
 1.
Drop missing rows or columns
2.
How do you handle missing or Replace missing values with mean/median/mode
corrupted data in a dataset? 3.
Assign a unique category to missing values
4.
All of the above
1.
The number of examples required for learning a hypothesis
in H1 is larger than the number of examples required for
H2
The VC dimension of hypothesis
2.
space H1 is larger than the VC
The number of examples required for learning a hypothesis
dimension of hypothesis space H2.
in H1 is smaller than the number of examples required for
Which of the following can be
3.
inferred from this?
No relation to number of samples required for PAC
learning.
4.
None of these
1.
A single layer feed-forward neural network with pre-
processing
2.
What is perceptron? A neural network that contains feedback
3.
A double layer auto-associative neural network
4.
An auto-associative neural network
1.
To develop learning algorithm for multilayer feedforward
neural network, so that network can be trained to capture
the mapping implicitly
2.
What is the objective of To develop learning algorithm for multilayer feedforward
backpropagation algorithm? neural network
3.
To develop learning algorithm for single layer feedforward
neural network
4.
All of the above
1.
Each node computes its weighted input
2.
Node could be in excited state or non-excited state
Which is true for neural networks?
3.
It has set of nodes and connections
4.
All of the above
 1.
Boosting
2.
Which of the following ensemble Bagging
model helps in reducing variance? 3.
Stacking
4.
Voting
1.
Adding more irrelevant attributes
2.
Which of the following helps in Generating a tree with fewer branches
avoiding overfitting in decision 3.
trees? Generating a complete tree then getting rid of some
branches
4.
All of the above
1.
Decision trees are prone to be overfit
2.
Which of the following is a Decision trees are robust to outliers
disadvantage of decision trees? 3.
Factor analysis
4.
None of the above
1.
Decision Tree
Which of the following is a widely 2.
used and effective machine learning Regression
algorithm based on the idea of 3.
bagging? Classification
4.
Random Forest
1.
AdaBoost
2.
Which of the following is an
Bootstrapping
example of sequential ensemble
3.
model?
Random forest
4.
All of the above
1.
Naive Bayesian
2.
Which of the following is not a PCA
supervised learning? 3.
Linear Regression
4.
Decision Tree Answer
 1.
AdaBoost
2.
Which of the following is not an Decision tree
example of ensemble method? 3.
Random Forest
4.
Bootstrapping
1.
It is useful only in high-dimensional spaces
2.
Which of the following is true It requires less memory
about SVM? 3.
SVM does not perform well when we have a large data set
4.
SVM performs well when we have a large data set
1.
Ensemble methods can take the form of using different
classifiers
2.
Which of the following is/are true Ensemble methods are simple and cheap
about ensemble methods? 3.
For the data from linear process, ensemble methods
performs better than the linear models
4.
None of these
1.
True
DevOps and ITIL have nothing in
2.
common.
False
3. 4.
1.
QA
2.
DevOps is an extension of Agile
__________________ 3.
Waterfall
4.
None of the above
1.
Implants Manual Errors
2.
Which of the following does not Enables anyone to perform tasks
benefit Automation in DevOps? 3.
Enables Speed, Reliability and Consistency
4.
None of the these
 1.
01100
The 2’s complement representation 2.
of 12 is 00100
3.
A. 10100
4.
01101
1.
MVC Architecture
2.
Angular is based on which Decorator pattern
architecture? 3.
MVVM Architectural pattern
4.
Observer Pattern
1.
model
2.
How is data shared between services
controller and view? 3.
factory
4.
scope
1.
XML
2.
In which format does AngularJS CSV
require to populate its data? 3.
JSON
4.
AngularJS accepts any format
1.
model specific
2.
controller specific
Scope is
3.
view specific
4.
application specific
1.
stores data
2.
What is the use of controllers in renders user Interface
MVC? 3.
controls model and view interactions
4.
None of these
 1.
ng-app
2.
Which directive is used to start an ng-start
Angular application? 3.
ng-init
4.
ng-begin
What will be the output for the
following code?
1.
The output is 1
2.
<div ng-app="""" ng-
The output is 15
init=""points=[1,15,19,2,40]"">
3.
The output is 19
<p>The output is {{ points[2] }}</
4.
p>
The output is 2
</div>
1.
Synchronization of data between the model and view
components
2.
Which of the following statement Synchronization of data between the model and controller
specifies the data-binding in components
AngularJS? 3.
Synchronization of data between the controller and view
components
4.
None of these
Which of the following does the
given NFA represent?

1.
{11, 101} * {01}
2.
{110, 01} * {11}
3.
{11, 110} * {0}
4.
{00, 110} * {1}

1.
Which of these is a regular set? I
2.
IV
 3.
I and III
4.
I and IV

1.
@angular/core
2.
Router is part of which of the @angular/router
following module? 3.
Both
4.
None of these
A computer uses a memory unit
with 256K words of 32 bits each. A
binary instruction code is stored in 1.
one word of memory. The 7, 7, 18
instruction has four parts: an 2.
indirect bit, an op-code, a register 18, 7, 7
code to specify one of 64 registers, 3.
and an address part. Which of the 6, 7, 18
following is the number of bits in 4.
the op-code, register code and 7, 6, 18
address part?

A processor has 250 distinct

1.
instructions and 80 general-purpose
9
registers. A 32-bit instruction word
2.
has one op-code, two register
8
operands, and one immediate data
3.
operand. The number of bits
10
available for the immediate data
4.
field is-------.
11
A processor has 58 distinct
1.
instructions and 28 general-purpose
14
registers. A 32-bit instruction word
2.
has one op-code, two register
8
operands, and one immediate data
3.
operand. The number of bits
12
available for the immediate data
4.
field is-------.
16
1.
Consider the following,
1, 2, and 3 only
2.
1. Op-code 1, 2, and 4 only
3.
2. Source address 1 and 3 only
4.
3. Destination address 1, 2, 3, and 4

4. Next instruction address [Link]

following-1-operation-code2-so--
Which of the above are typical 5f6e9fdc333099176e218199
elements of a machine instruction?

1.
Logical code
2.
In instruction format, the address of
Operand
any data location is said to be---
3.
Function code
4.
Instruction code
1.
Fetch cycle
2.
The operation of instruction’s
Decode cycle
carried out by----
3.
Execution cycle
4.
Instruction program
The size of instruction in a 1.
computer is 16 bits. Each 4
instruction has three operands and it 2.
follows register direct addressing 8
modes. The maximum number of 3.
op-codes that this processor can 16
have is------ 4.
32
1.
A CPU has 12 registers and uses 6
8
addressing modes. RAM is 64K X
2.
32. What is the maximum size of
9
the opcode field if the instruction
3.
has a register operand and a
10
memory address operand?
4.
11
1.
a. Factoring a prime number
1. The term factorization in
2.
cryptography denotes ______
a. Factoring the product of prime numbers
3.
 a. Dividing a prime number by another prime number
4.
a. Dividing the product of prime number with a fixed
integer
1.
a. Privacy
2.
1. One of the following services
a. Authentication
is not provided by a symmetric key
3.
cryptosystem
a. Key exchange
4.
a. Integrity
1.
a. 32 Bits
2.
1. The DES algorithm has a key a. 32 Bytes
length of _____ 3.
a. 64 Bits
4.
a. 64 Bytes
1.
a. Masquerade
2.
1. When a system/user/entity
a. Virtualization
tries to behave like a different one,
3.
it is called as ____
a. Active attack
4.
a. Passive attack
1.
a. Symmetric key
2.
1. _________ cryptography is
a. Asymmetric key
often used to work on lengthier
3.
messages.
a. Public key
4.
a. Group key
1.
a. network, application
2.
a. transport , application
3.
1. A packet-filter firewall filters a. network, transport
at the ___________ or 4.
_______ layer. a. a link and application

In computing, a firewall is a network security system that

monitors and controls the incoming and outgoing network
traffic based on predetermined security rules.[1] A firewall
 typically establishes a barrier between a trusted, secure
internal network and another outside network, such as the
Internet, that is assumed not to be secure or trusted.[2]
Firewalls are often categorized as either network firewalls
or host-based firewalls.
1.
a. Verification algorithm
1. A protocol involving a prover
2.
and a verifier that enables the
a. Authentication proof
prover to prove to a verifier without
3.
revealing any other information.
a. E Mail Security
This is called as ____
4.
a. Zero-Knowledge Proof
1.
a. Nonrepudiation
2.
1. Digital signature does not a. Privacy
provide _________ 3.
a. Authentication
4.
a. Integrity
1.
a. One way
2.
1. Hash functions are ________ a. Two way
functions 3.
a. Multiple way
4.
a. Three way
1.
a. Symmetric key
2.
1. In ______ cryptography
a. Asymmetric key
everybody has access to everyone’s
3.
public key
a. Secret key
4.
a. Private key
1.
44
1. In AES algorithm, when you 2.
have 10 rounds ,the total number of 32
words may present as round key is 3.
_____ 64
4.
16
1.
Maximum possible size of
a. 64 Bytes
padding bits in MD5
2.
 a. 512 Bytes
3.
a. 32 Bytes
4.
a. 128 Bytes
1.
1
1. Suppose P, Q ∈ E, where P = 2.
(x1,y1) and Q = (x2,y2), we can 2
consider how many cases of 3.
solution in elliptic curve arithmetic 3
4.
4
1.
a. Plaintext
2.
1. The information that gets
a. Cipher text
transformed in encryption is called
3.
_____
a. Parallel text
4.
a. Transformed text
1.
a. Real time access to key authority
2.
1. The major advantage of a. Reduced real time access to key authority
public -key certificates is ____ 3.
a. Increased real time access to key authority
4.
a. No real time access to key authority
1.
a. Factoring problem
2.
1. The major security threat to a. Brute Force Attack
RSA algorithm is ____________ 3.
a. Man-in the middle attack
4.
a. Birthday attack
1.
a. Factorization
2.
1. The major vulnerability of
a. Forgery
distributing the public key using –
3.
public announcement
a. Man-in the middle attack
4.
a. Birthday attack
1.
1. The process of making
a. Diffusion
relationship between cipher text
2.
and key as complex as possible is a. Confusion
called as ______ 3.
a. Decryption
4.
a. Encryption
1.
a. Elliptic curve cryptography
1. Which of the following 2.
algorithm was developed based on a. ElGamal
the difficulty of finding log base 2 3.
in a cyclic group ? a. DES
4.
a. RSA
1.
a. Identification
2.
1. Which of the following is not a. Authentication
an objective of network security? 3.
a. Locking
4.
a. Access control
1.
a. Hash algorithm
1. Which one of the following 2.
algorithm does not generate fixed a. HMAC algorithm
length digest from an arbitrary- 3.
length message? a. MD5
4.
a. RSA
1.
a. Bit by bit XOR
2.
. Which one of the following is a a. One bit circular shift
most insecure hash function? 3.
a. HMAC
4.
a. SHA-1
1.
a. Digital signature
2.
a. Decryption algorithm
1. Which one of the following
3.
refers to the technique used for
a. Protocol
verifying the integrity of the
4.
message?
a. Message Digest
Message Digest is a type of cryptographic hash function
that contains a string of digits that are created by the one-
way hashing formula. It is also known as a type of
 technique used for verifying the integrity of the message,
data or media, and to detect if any manipulations are made.
1.
a. S/MIME
2.
1. Which authentication
a. PGP
methodology will you recommend
3.
while mailing an audio file ?
a. HMAC
4.
a. Email Security
1.
a) Round Robin Scheduling algorithm
2.
Choose preemptive scheduling a) FCFS Scheduling algorithm
from the options below: 3.
a) SJF Scheduling algorithm
4.
a) Network Scheduling algorithm
1.
a) To avoid deadlock
2.
a) To deadlock recovery
Banker's algorithm is used ...
3.
a) To solve the deadlock
4.
a) To solve mutual exclusion
1.
a) LRU page replacement algorithm
2.
a) FIFO page replacement algorithm
Belady's anomaly affects 3.
a) Both of above
4.
a) Optimal Page Replacement page replacement
algorithm
1.
a) Permanent area
2.
a) Temporary area
Buffer is a ___________. b)
3.
Small area
4.
a) Large area
Consider a set of four processes 1.
with arrival and burst times of 1, 2, a) 12
3, 4, and 2, 4, 6, 7, respectively. 2.
Calculate the average waiting time a) 11.25
if the CPU scheduling policy is LJF 3.
preemptive. a) 12.25
4.
a) 9
1.
Consider a virtual memory system always decrease the number of page faults
with FIFO page replacement policy. 2.
For an arbitrary page access always increase the number of page faults
pattern, increasing the number of 3.
page frames in main memory sometimes increase the number of page faults
will 4.
a) never affect the number of page faults
Consider the virtual page reference
string 1, 2, 3, 2, 4, 1, 3, 2, 4, 1 On a 1.
demand paged virtual memory OPTIMAL < LRU < FIFO
system running on a computer 2.
system that main memory size of 3 OPTIMAL < FIFO < LRU
pages frames which are initially 3.
empty. Let LRU, FIFO and OPTIMAL = LRU
OPTIMAL denote the number of 4.
page faults under the corresponding a) OPTIMAL = FIFO
page replacements policy. Then
Consider three processes with
process ID 1, 2, and 3 and 1.
computing burst time units of 2, 4, a) 11, 12 and 13
and 8 respectively. Every process 2.
arrives at the same time. Consider a) 12, 13 and 14
the scheduling algorithm in the 3.
order of the longest remaining time a) 14, 13 and 12
first (LRTF). If there is a tie in 4.
LRTF, we will prioritize the a) 13, 12, 14
process with the highest process ID.
What is the turn around time of P1, [Link]
P2 and P3 respectively?
1.
a) With increasing the page frames, page faults decreases
always.
2.
a) Page faults increases always with increasing the page
For FIFO page replacement policy: frames.
3.
Page faults not affected with increasing the page frames.
4.
a) With increasing the page frames, page faults increases
sometime.
1.
If the quantum time of round robin
a) First in first out
algorithm is very large, then it is
2.
equivalent to:
a) Shortest Job Next
 3.
a) Lottery scheduling
4.
a) Shortest Remaining Time First (SRTF)
1.
a) the large amount of internal fragmentation
In a system with 32 bit virtual 2.
addresses and 1 KB page size, use the large amount of external fragmentation
of one-level page tables for virtual 3.
to physical address translation is the large memory overhead in maintaining page tables
not practical because of 4.
a) the large computation overhead in the translation
process
1.
a) First-In First-Out
2.
Non-preemptive scheduling
a) Round Robin
algorithms include which of the
3.
following?
a) Multilevel Queue Scheduling with Feedback
4.
a) Multilevel Queue Scheduling
1.
Kind of magnetic drum
2.
Memory allocation policy
Round robin is a
3.
Process scheduling policy
4.
Process synchronization policy
1.
a) prompt
2.
The command interpreter is also a) kernel
known as 3.
a) shell
4.
a) command
1.
operating systems
2.
multiprocessor systems
3.
The FCFS algorithm is particularly
time sharing systems
troublesome for ____________
4.
multiprogramming systems

In a time sharing system, each user needs to get a share of

the CPU at regular intervals.
 1.
a) Assembly
The process of assigning load
2.
addresses to the various parts of the
Parsing
program and adjusting the code and
3.
date in the program to reflect the
a) Relocation
assigned addresses is called
4.
Symbol resolution
1.
a) When a page fault occurs
2.
a) Processes on system frequently access pages not
Thrashing occurs when memory
3.
Processes on system are in running state
4.
a) Processes on system are in waiting state
1.
a) Large secondary memory
2.
Large main memory
Virtual memory is
3.
a) Illusion of large main memory
4.
a) Main memory
1.
a) Restarting computer
2.
What is the meaning of Booting in a) Install the program
the operating system? 3.
a) To scan
4.
a) To turn off
1.
a) The page is present in memory
2.
The deadlock occurs
When does page fault occur?
3.
a) The page does not present in memory
4.
a) The buffering occurs
1.
a) Private operating system
2.
Which is the Linux operating a) Windows operating system
system? 3.
a) Open-source operating system
4.
a) Network Operating System
 1.
a) Settle time
2.
Which of the following is major
a) Rotational latency
part of time taken when accessing
3.
data on the disk?
Seek time
4.
a) Waiting time
1.
instruction cache
2.
Which of the following is not a a) instruction register
form of memory? 3.
instruction opcode
4.
a) translation lookaside buffe
1.
a) Windows
2.
Which of the following is not an a) Linux
operating system? 3.
a) Oracle
4.
a) DOS
1.
a) Semaphore
2.
Which of the following
a) PCB
mechanisms is a locking
3.
mechanism?
a) Mutex
4.
a) Binary Semaphore
1.
a) FCFS
2.
Which of the following scheduling a) LIFO
reduces process flow time? 3.
a) SJF
4.
a) Round-robin
1.
a) Stack
2.
Which one of the following is NOT
a) Address Space
shared by the threads of the same
3.
process
File Descriptor Table
4.
a) Message Queue
 1.
a) Desktop Manager
2.
Which program runs first after
a) File Manager
booting the computer and loading
3.
the GUI?
a) Windows Explorer
4.
a) Authentication
1.
a) Operating system
2.
Who is responsible for keeping the a) CPU
process from the program? 3.
a) Monitor
4.
a) Memory
1.
A listener is a variable that is notified when an event occurs

2.
A listener is an object that is notified when an event occurs
What is a listener in context to
event handling in delegation event
3.
model in Java?
A listener is a non static method that is notified when an
event occurs

4.
A listener is a static method that is notified when an event
occurred
1.
addMouse()
Which of these methods from a 2.
Java event handling package is used addMouseListener()
to register a mouse motion listener? 3.
addMouseMotionListener()
4.
eventMouseMotionListener()
1.
KeyListener()
Which of these methods from a
2.
Java event handling package is used
addListener()
to register a keyboard event
3.
listener?
addKeyListener()
4.
eventKeyboardListener()
Which of these packages contains 1.
all the classes and methods required [Link]
for even handling in Java? 2.
[Link]
 3.
[Link]
4.
[Link]
Assume that we perform six stack
operations, namely pushing and
popping each of A, B and C such
that push(A) must occur before 1.
push(B) which must occur before ABC
push(C), In such a case, A, C, B 2.
can be a possible order for the pop CBA
operations,since this could be 3.
achieved by: push(A), pop(A), BAC
push(B), push(C), pop(C), pop(B). 4.
Satisfying this constraint, which CAB
one of the following orders could
not be a valid order for the pop
operations?
1.O(n*n) 2.
O(n)
The solution of the recurrence T (n)
3.
= 4T (n/2) +((n*n*n)/(logn*logn))
O(n*n*n)
is
4.
O(n*logn)
1.
String class
2.
Which of these class is superclass Object class
of every class in Java? 3.
Abstract class
4.
ArrayList class
1.
implements
Which of these keywords cannot be 2.
used for a class which has been static
declared final in Java? 3.
abstract
4.
public
1.
Agent
______ is an assumed entity which 2.
performs actions in an environment State
to gain some reward. 3.
Policy
4.
Value
 1.
Unknown
2.
______ is similar to 'any', but a
Similar
safer alternative when uncertain
3.
about the type.
Never
4.
None of these
1.
Q-Learning
_______ can optimize the ad
2.
recommendation system to
Supervised Learning
recommend products that are
3.
frequently bought together
Unsupervised Learning
4.
Semi- Supervised Learning
1.
Add one smoothing / laplace smoothing
2.
________ is a technique that
Zero smoothing
removes the problem of zero
probability in the Naive Bayes
3.
Algorithm.
Manhattan smoothing

4.
Mean smoothing
1.
Unconditional transfer
2.
_________ is the branch logic that
Controlled transfer
provides decision-making
3.
capabilities in the control unit:
Conditional transfer
4.
Logical transfer
1.
Regression algorithms
2.
__________ are the machine
Clustering algorithms
learning algorithms that can be used
3.
with unlabeled data.
Instance-based algorithms
4.
All of the above
1.
___________ determines the Service control
direction in which particular service 2.
requests may be initiated and Direction control
allowed to flow through the 3.
firewall. User control
4.
 Behaviour control
1.
RESTful
____________ is a messaging 2.
protocol for transferring data SOAP
between two computers based on 3.
XML over the internet. Spring MVC
4.
Spring
1.
Extreme programming
2.
____________ is an agile software
Quality function deployment
development approach.
3.
PSPEC
4.
Unified process
1.
Utility software
2.
____________ have been
Speed up utilities
developed specifically for pipelined
3.
systems.
Optimizing compilers
4.
None of the mentioned
1.
Self-healing
2.
____________ is a feature provided
Storage healing
by the Kubernetes open-source
3.
system.
Software healing
4.
None
1.
Web application
____________ is a set of 2.
definitions and protocols that allow Application Programming Interface
one application to communicate 3.
with another application. System log
4.
Protocol
1.
_____________ allows attackers to
Tautology
infer the data present in a database
2.
system even when the system is
Blind SQL injection
sufficiently secure to not display
3.
any erroneous information back to
Piggybacked queries
the attacker.
4.
 Illegal/logically incorrect queries
1.
Network attack surface
2.
_____________ refers to
Intruder attack surface
vulnerabilities in application,
3.
utility, or operating system code.
Human attack surface
4.
Software attack surface
1.
Load
_____________ is mainly used for 2.
improving the application Configuration
performance by helping to load the 3.
child objects on demand. Lazy loading
4.
CGF
1.
Union
2.
_____________ is not the unary Intersection
operator 3.
Set Difference
4.
Minus
1.
Deception
______________ is a circumstance 2.
or event that may result in an Unauthorized Disclosure
authorized entity receiving false 3.
data and believing it to be true. Disruption
4.
Usurpation
1.
______________ is an encryption Confusion
operation where the influence of 2.
one plaintext symbol is spread over Jumble
many ciphertext symbols with the 3.
goal of hiding statistical properties Misperception
of the plaintext. 4.
Diffusion
1.
$ docker kill
2.
______________ command is used
$ docker rm
for stopping a running container.
3.
$ docker stop
4.
 $ docker start
____________________ limits the 1.
information system access to Access Control
authorized users, processes acting 2.
on behalf of authorized users, or Systems and Services Acquisition
devices (including other 3.
information systems) and to the System and Communications Protection
types of transactions and functions 4.
that authorized users are permitted System and Information Integrity
to exercise. [Link]
1.
2
2.
3
A computer has 6 tape drives, with 3.
n processes competing for them. 4
Each process may need 2 drives. 4.
The maximum value of n for which 5
the system is guaranteed to be Each process needs 2 drives. So for deadlock just give each
deadlock free is: process one [Link] total 6 process can be given 1 drive
each and can cause [Link] to break deadlock just
reduce 1 [Link] maximum no. of process for the
system to be deadlock free is 5
1.
A counting semaphore has a value a) 42
of 8 at any given time of 2.
computation. On this semaphore, a) 2
15 P operations and 20 V 3.
operations were completed. The a) 13
semaphore's resulting value is: 4.
a) 3
A process has been allocated 3 page
frames. Assume that none of the 1.
pages of the process are available in 7
the memory initially. The process 2.
makes the following sequence of 8
page references (reference string): 3.
1, 2, 1, 3, 7, 4, 5, 6, 3, 1 If optimal 9
page replacement policy is used, 4.
how many page faults occur for the 10
above reference string?
1.
cookie
A ____________ is an object that
2.
maintains the connection between
session
Java object application and
3.
database.
cache
4.
 persist
1.
Stateful inspection firewall
A _______________ applies a set 2.
of rules to each incoming and Application proxy firewall
outgoing IP packet and then 3.
forwards or discards the packet. Packet filtering firewall
4.
Circuit-level proxy firewall
1.
Minimum Spanning Tree
A _____is a round trip path along n 2.
edges of G that visits every vertex Travelling salesman problem
once and return to its starting 3.
position Multistage graph
4.
Hamiltonian Circuit
1.
loss less join and dependency preserving
2.
loss less join but not dependency preserving
A BCNF is :
3.
not loss less join but dependency preserving
4.
dependency preserving
A dataset contains data collected by
the Tamil Nadu Pollution Control
1.
Board on environmental conditions
Multiple Linear Regression
(154 variables) from one of their
2.
monitoring stations. This data is
Simple Linear Regression
further analyzed to understand the
3.
most significant factors that affect
Logistic Regression
the Air Quality Index. The
4.
predictive algorithm that can be
Multiple Ordinal Regression
used in this situation is
___________.

1.

2.
A finite automata that will accept
only string X of length n will have n/2
_________ many states
3.

n+1
 4.

infinite
1.
Partial dependency
2.
A functional dependency between
Join dependency
two or more non-key attributes is
3.
called -------------------
Transitive dependency
4.
Trivial dependency
1.
A JMS template helps you to obtain True
and release the JMS connection and 2.
session. False
3. 4.
1.
control plane , data plane
A Kubernetes cluster has two main 2.
components : the _______ and storage plane, container plane
_________, machines used as 3.
compute resources. open plane , component plane
4.
None
1.

aaa

A language is represented by a 2.
regular expression (a)*(a+ba).
Which of the following string does aba
not belong to the regular set
represented by the above 3.
expression
ababa

4.
aa
1.

aaa
A language is represented by a
regular expression (a)*(a+ba).
2.
Which of the following string does
aba
not belong to the regular set
3.
represented by the above
ababa
expression.
4.
aa
 1.
Circular queue
2.
Priority queue
A linear list in which insertions to
3.
and deletions from are made either
Stack
end of the structure is a
4.
Dequeue

Dequeue – Doubly ended Queue

1.
op-code field & operand field
2.
only operand field
3.
only op-code field
4.
only register field
A machine language instruction
format consists of
[Link]
machine-language-instruction-
formats/#:~:text=Explanation%3A%20Machine%20langua
ge%20instruction%20format,is%20the%20operation%20co
de%20field.&text=Explanation%3A%20Machine%20lang
uage%20instruction%20format%20has%20both%20the%2
0fields.&text=Explanation%3A%20This%20format%20is
%20only%20one%20byte%20long.

1.

15 states

2.

7 states
A minimum state DFA accepting
3.
the language L={w|w belongs
{0,1}*} number of 0s and 1s in w
9 states
are divisible by 3 and 5,
respectively} has
4.

8 states

[Link]
question-29/

1.
True
A NFA converted to DFA has 2.
more than one final state.
False

3.

may be true

4.

always true
1.
TRUE
A package in [Link] contains all
2.
the files you need for a module.
FALSE
3. 4.
1.
50%
2.
70%
3.
A program P calls two subprograms 60%
P1 and P2. The P1 can fail 50% 4.
times and P2 can fail 40% times. 10%
The program P can fail:
40+30

[Link]
dec2012-iii-62

1.
A dynamically allocated array of 550 numbers
2.
A program P reads in 1000 integers
an array of 500 numbers
in the range [0, 100] representing
3.
the scores of 500 students. It then
an array of 50 numbers
prints the frequency of each score
4.
above 50. What would be the best
an array of 100 numbers
way for P to store the frequencies?
[Link]
in-500-integers-in-the-range-0--
5fbcd69f78d47d29d1b0f7ef
1.
A queue is implemented using an
Both operations can be performed in O(n) time
array such that ENQUEUE and
2.
DEQUEUE operations are
Both operations can be performed in O(1) time
performed efficiently. Which one of
3.
the following statements is
ENQUEUE can be performed in O(1) time and DEQUEUE
CORRECT? (n refers to the number
can be performed in O(n) time
of items in the QUEUE).
4.
 ENQUEUE can be performed in O(n) time and DEQUEUE
can be performed in O(1) time

[Link]
implemented-using-an-array-such-that-en--
5df4d003f60d5d4cbdd33e33
1.
worst case
2.
A randomized algorithm uses best case
random bits as input inorder to 3.
achieve a _____________ good average case
performance over all possible 4.
choice of random bits. Average and best

[Link]
random-inorder-achieve-performance-possible-choice
1.
A recursive function is defined as 2
follows: 2.
0
3.
1
4.
-1

If the value of h(4) is 88 then the [Link]

value of k is : -is-defined-as-follows-h-m--k--if-m-0-1--if-m-1-2-h-m-
ndash-1--4h-m-ndash-2--
A relation empdt1 is defined with 1.
attributes 1 NF only
2.
Empdata (empcode, name, street, 2 NF and hence also in 1 NF
city, state, pincode). 3.
3NF and hence also in 2NF and 1NF
For any pincode, there is only one 4.
city and state. Also, for given BCNF and hence also in 3NF, 2NF and 1NF
street, city and state, there is just
one pincode. [Link]
defined-with-attributes-empco--
In normalization terms, Empdata is 5a4786284533c40f72af3978#:~:text=For%20any%20pinco
a relation in de%2C%20there%20is,1%20NF%20only
1.
divide-and-conquer
A simple approach that is efficient 2.
when it works, but does not always brute-force
work, is 3.
Greedy
4.
 dynamic programming
1.
queue
2.
A singly circular linked list with a array
header pointing to the last node 3.
linked list
4.
stack
1.
Design modification
2.
A software requirement
User interface issues
specification (SRS) document must
3.
avoid which among following:
Interface with third party software
4.
Non-functional requirements
1.
BCNF
2.
Fourth Normal Form
A table is in the ………………….. 3.
if only candidate keys are the Fifth Normal Form
determinants 4.
Third Normal Form

[Link]
[Link]
1.
epsilon
2.
A
A*-A+ = 3.
A*
4.
A+
1.
Visibility
2.
Access modifiers control the Inheritance
______ of properties and methods 3.
Type
4.
Mocking
1.
According to the ISO-9126 (a)-(i), (b)-(ii), (c)-(iii), (d)-(iv)
Standard Quality Model. match the 2.
(a)-(ii), (b)-(i), (c)-(iv), (d)-(iii)
attributes given in List-I with their 3.
definitions in List-II: (a)-(ii), (b)-(iv), (c)-(i), (d)-(iii)
4.
(a)-(i), (b)-(ii), (c)-(iv), (d)-(iii)
List List
I II [Link]
9126-standard-quality-model--5ed8c2f8f60d5d2aa46d6746
i. R
elati
ons
hip
bet
wee
n
leve
a. F l of
unct perf
iona orm
lity anc
e
and
amo
unt
of
reso
urce
s

ii. C
hara
cter
istic
b. R
s
elia
rela
bilit
ted
y
wit
h
achi
eve
 men
t of
pur
pos
e

iii.
Eff
ort
nee
ded
c. E
to
ffici
mak
enc
e
y
for
imp
rov
eme
nt
iv.
Cap
abil
d. ity
Mai of
ntai soft
nabi war
lity e to
mai
ntai
n
Choose the correct option from the
ones given below:
1.
correct errors that were not discovered till testing phase

2.
Adaptive maintenance is a is carried out to port the existing software to a new
maintenance which __________. environment.
3.
improves the system performance
4.
both b and c
1.
Auto Scaling
2.
Amazon S3 stores data as objects EC2 Instances
within resources called ? 3.
Buckets
4.
Amazon RDS
1.
Semi unsupervised learning
2.
Among the following option
Supervised learning
identify the one which is not a type
3.
of learning
Reinforcement learning
4.
Unsupervised learning
1.
Virus
2.
Among the following, which will WORM
spread speed is faster? 3.
Malware
4.
Spyware
1.
Active attack
An attempt to learn or make use of 2.
information from the system that Passive attack
does not affect system resources is 3.
known as _____________ Actor attack
4.
Dynamic attack
An operating system has three user 1.
processes, each of which requires 3
two X units of resources. The 2.
smallest number of X units required 4
to ensure that no deadlocks occur is 3.
5
4.
6

[Link]
contains-3-user-processes-each--
5f5602d81472052f6ab2dba2
1.
inband attack
2.
inferential attack
3.
An _________ uses the same
out-of-band attack
communication channel for
4.
injecting SQL code and retrieving
out-of-channel attack
results
[Link]
injection-sqli/#:~:text=their%20damage%20potential.-
,In%2Dband%20SQLi,and%20to%20gather%20their%20r
esults.
1.
Strong entity set
2.
An entity set which does not have
Weak entity set.
enough attributes to form a Primary
3.
key is
Weak relationship set
4.
Strong relationship set
1.
Strong Entity Set
2.
An entity type whose existence is
Weak Entity Set
depend on another entity type is
3.
called ----------------
Derived Attribute
4.
Primary key
1.
LIFO buffer
2.
FIFO buffer
3.
An instruction pipeline can be
Stack
implemented by means of
4.
QUEUE

[Link]
architecture-
 notes/#:~:text=The%20implementation%20of%20the%20i
nstruction,in%2C%20first%2Dout%20buffer.
1.
ng-app
2.
ng-model
3.
AngularJS expressions bind ng-bind
AngularJS data to HTML the same 4.
way as the _________ directive ng-init

[Link]
mcq#:~:text=Show%20Answer%20Workspace-
,Answer%3A%20C%20is%20the%20correct%20option.,vi
ew%20in%20the%20AngularJS%20application.
1.
email filtering
2.
sentimental analysis
3.
Application of Machine learning is face recognition
__________ 4.
All of the above

[Link]
university/computer-science/machine-learning-mcq-
questions-and-answers/29821794
1.
Optimization
2.
Maximization
3.
Minimization
Approximation algorithm are best 4.
applied to ________ Decision

1.
Optimal
2.
Approximation algorithm provide
Decision
__________ solution
3.
Near-Optimal
4.
 all of these

[Link]
[Link]
1.
Physical, Logical, View
2.
View, Logical, Physical
Arrange the following levels of
3.
Data abstraction from the highest
View, Physical, Logical
level to lowest level (Logical,
4.
View, Physical)
Physical, View, Logical

[Link]
u30n3f4op2plyk8jkeldpbz6/
1.
It is an ordered list of values
2.
It is an ordered list of objects
3.
It is an ordered list of string
Arrays in JavaScript are defined by 4.
which of the following statements? It is an ordered list of functions

[Link]
answers/#:~:text=6.,which%20of%20the%20following%20
statements%3F&text=Explanation%3A%20An%20array%
20in%20JavaScript,of%20an%20array%20dynamically%2
0sized.
1.
5
2.
4
3.
Assume a system has 9 identical
3
resources and x processes
4.
competing for them. Each process
6
can request at most 3 resources.
What is the maximum value of x at
[Link]
which the system will not
deadlock?
Reason:

3n < n + 9
2n < 9
n < 4 (because 9/2 = 4.5 so take is 4)
Assume we perform a known- 1.
plaintext attack against Data
Encryption Standard with one pair
of plaintext and ciphertext. How
many keys do we have to test in a 2.
worst-case scenario if we apply an
exhaustive key search in a
straightforward way?
3.

4.

Key length is 56 bits -> so bits (2 i.e 0 or 1) so 256

1.

Assume we perform a known-

plaintext attack against Data 2.
Encryption Standard with one pair
of plaintext and ciphertext. How
many keys do we have to test in an 3.
average-case scenario if we apply
an exhaustive key search in a
straightforward way?
4.

Assume that a main memory with

only 4 pages, each of 16 bytes, is
initially empty. The CPU generates
1.
the following sequence of virtual
6 and 1, 2, 3, 4
addresses and uses the Least
2.
Recently Used (LRU) page
7 and 1, 2, 4, 5
replacement policy.
3.
8 and 1, 2, 4, 5
0, 4, 8, 20, 24, 36, 44, 12, 68, 72,
4.
80, 84, 28, 32, 88, 92
a) 9 and 1, 2, 3, 5
How many page faults does this
[Link]
sequence cause? What are the page
question-39/
numbers of the pages present in the
main memory at the end of the
sequence?
1.
Assume the array implementation
front = rear = null
of a circular queue. Which of the
2.
following conditions holds when
front = rear != null
there is only one element in the
3.
queue?
front=rear+1
 4.
front=rear-1
1.
Simplex
2.
Assuming a pre flow was
Ford Fulkerson
considered in which max flow
3.
algorithm?
Edmonds-karp
4.
Push-relabel
1.
Assuming the current disk cylinder
a) 51, 48, 54, 63, 64, 81, 34, 21, 15, 10, 3, 2
to be 49 and the sequence for the
2.
cylinders to be 2, 34, 48, 63, 51, 10,
a) 48, 51, 54, 63, 64, 81, 34, 21, 15, 10, 3, 2
3, 21, 54, 15, 64 and 81. Find the
3.
sequences of servicing using the
a) 48, 51, 54, 63, 64, 81, 2, 3, 10, 15, 21, 34
Shortest Seek Time First (SSTF)
4.
disk schedule algorithm.
a) 2, 3, 10, 15, 21, 34, 48, 51, 54, 63, 64, 81
1.
{b^na^mc^p|n,m,p>=1}
2.
{ba^nc|n>=0}
3.
baa*c denotes the set
{ba^nc|n>=1}

4.

{w|w is a string of a,b,c}

1.
PCA produces features that are linear combinations of the
original features

2.
Both PCA and Lasso can be used PCA and Lasso are the same if you use the kernel trick
for feature selection. Which one
(aof the following statement is true? 3.
PCA and Lasso both allow you to specify how many
features are chosen
4.
Lasso do not selects a subset (not necessarily a strict
subset) of the original features
1.
True
By default, the JMS template uses
2.
SimpleMessageConverter for
False
converting TextMessage to or from
3. 4.
a string.
[Link]
jms-messages-transactions/
 1.
C hierarchy decides which operator
Is used first and order
2.
a.
Is speedy
3.
b.
Is important
4.
c.
None of the above
d.
[Link]
operator-115094/
1.
No
2.
Yes
3.

Sometimes
Can a DFSA simulate a NFSA
4.
Depends on NFA

[Link]
mcqs-with-answers
1.
Least Square Error
2.
Choose one of the options from the Maximum Likelihood
list below. What is the underlying 3.
method which is used to fit the Jaccard Distance
training data in the algorithm of 4.
logistic regression? Mean Absolute Error

[Link]
logistic-regression/
1.
Mean Squared Error (MSE)

Choose one of the options from the

2.
list below. Which metric would we
The area under the receiver operating characteristics curve
not be able to use to measure the
(or AUC-ROC score)
correctness of a logistic regression
model?
3.
Log-loss

4.
Accuracy
Choose the correct option
according to the given statements
regarding Risk Management.
1.
Statement 1: A risk is a potential Statement 1 and 2 are correct
problem - it might happen, it might 2.
not. Only statement 1 is correct

Statement 2: Managers, software 3.

engineers, and customers Only statement 3 is correct
participate in Risk Analysis and
Management. 4.
Statement 1 and 3 are correct
Statement 3: Only Managers
participate in Risk Analysis and
Management.
1.

∗ + a − bc/ − de − +f gh
Choose the equivalent prefix form 2.
of the following expression (a+ ∗ + a − bc − /de − +fgh
(b−c)) ∗ ((d−e)/(f + g − h)) 3.
∗ + a − bc/ − ed + −fgh
4.
∗ + ab − c/ − ed + −fgh
1.
Fewer Cost
2.
No need to build application from scratch
Choose the false statement about
3.
third party API from the following.
App developer to change third party API as per business
requirement
4.
No need to maintain
1.
Product-oriented Approach – Focus on system (or
software) quality
2.
Process-oriented Approach – Focus on how NFRs can be
Choose the incorrect statement with
used in the design process
respect to Non-Functional
3.
Requirement (NFR).
Quantitative Approach – Find measurable scales for the
functionality attributes
4.
Qualitative Approach – Study various relationships
between quality goals
Circular queue is superior to linear 1.
queue in Only I is true
2.
(I) Efficiency of implementation Only II is true
3.
(II) Effective space utilization Both I and II are true
4.
Pick the correct choice Both I and II are false
1.
Cloud
Cloud computing is a concept that 2.
involves pooling physical resources Real
and offering them as --------- 3.
resource? Virtual
4.
Service
1.
dockerpull{ImageName}
2.
Command used to download docker . dockerimages{ImageName}
image is ____________________ 3.
dockerNetwork{ImageName}
4.
dockerps{ImageName}
1.
Consider a business organization
7140 key pairs
with 120 employees. A new
2.
security policy demands encrypted
120 key pairs
message exchange with a
3.
symmetric cipher. How many keys
240 key pairs
are required, if you are to ensure a
4.
secret communication for every
60 key pairs
possible pair of communicating
parties?
i.e n*(n-1)/2 => 120*119 / 2
Consider three processes (process
id 0, 1, 2 respectively) with
computing bursts time units of 3, 4 1.
and 7 respectively. All processes a) 7.33
arrive at the same time. Consider 2.
the scheduling algorithm with the a) 13
longest remaining time first 3.
(LRTF). In LRTF ties are broken a) 8.33
by giving priority to the process 4.
with the lowest process id. What is a) 12
the average waiting time for the
three processes?
Consider three processes with 1.
process ID 1, 2, and 3 and a) 9, 9 and 7
computing burst time units of 2, 4, 2.
and 8 respectively. Every process a) 6, 9 and 7
arrives at the same time. Consider 3.
the scheduling algorithm in the a) 12, 9 and 4
order of the longest remaining time 4.
first (LRTF). If there is a tie in a) 12, 7 and 9
LRTF, we will prioritize the
process with the highest process ID.
What is the waiting time of P1, P2
and P3 respectively?
1.
Slope
2.
One unit
Consider a simple linear regression 3.
model (1-variable case). If few Intercept
change the input variable by one 4.
unit, the output variable changes by No change
To explain I would say: For linear regression
Y=a+bx+error. If neglect error then Y=a+bx. If x increases
by 1, then Y = a+b(x+1) which implies Y=a+bx+b. So Y
increases by its slope.
1.
Select A from R;
2.
Consider a relation R(ABCD).
Select A, COUNT(*) from R;
Which of the following query is not
3.
correct?
Select A, C, COUNT(*) from R GROUP BY A, C;
4.
Select C, COUNT(*) from R GROUP BY C;
1.
AB, BC
Consider a relation scheme R = (A, 2.
B, C, D, E, H) on which the AC, AE, DA
following functional dependencies 3.
hold: {A–>B, BC–>D, E–>C, D– AEH, BEH, DEH
>A}. What are the candidate keys 4.
of R? AEC, BED, DEH
[Link]
database-miscellaneous
1.
Dependency preserving and lossless joins
2.
Consider a schema R(ABCD) and Dependency preserving but not lossless join
functional dependencies F={ A → 3.
B, C → D}. Then the Lossless join but not dependency preserving.
decomposition of R into R1 (AB) 4.
and R2(CD) is________. Neither dependency preserving nor lossless join

[Link]
question-23/
Consider a single dimension array
A of size n with indices 1, 2, . . . , n
1.
that houses two stacks. Stack A is
nA = nB
filled from index 1 towards right
2.
and stack B is filled from index n
nA = nB = n
towards left. If nA is the number of
3.
elements in stack A and nB is the
nA + nB = n
number of elements in stack B, then
4.
overflow occurs when a PUSH
nA + nB ≥ n
operation is performed on either
stack and
1.
q[1]
2.
q[0]
Consider a standard circular queue,
3.
q whose size is 11 with elements
q[9]
q[0], q[1], q[2], . . . , q[10]. The
4.
front and rear pointers are
q[10]
initialized to point at q[2]. In which
position will the ninth element be
added?

1.
Select * from student where regno=19MID0021
or phone=(select phone from student where phone=
Consider a Student table with 9999999999 order by phone);
schema Student(Regno, Name, 2.
DOB, ContactNo) and Regno as the Select * from student where regno like’19MID%’ or
primary key. Identify the equivalent phone=(select phone from student where phone=
query to the query "SELECT * 9999999999 order by phone);
FROM Student WHERE 3.
Regno=19MID0021 AND Select * from student where regno=19MID0021 and phone
Phone=9999999999;" Identify the in (9999999999, 9999999998);
correct query that is/are equivalent. 4.
Select * from student where regno=’19MID0021’
AND phone=(select phone from student where phone=
9999999999 order by phone);
1.
Consider the case of a non-negative 7
counting semaphore S. This 2.
semaphore then completed 11 P 6
operations and 5 V operations. 3.
What is the largest initial value of S 5
for which at least one P(S) 4.
operations are blocked? 4
 [Link]
question-59/

11-5 = 6
Consider the following operations
1.
performed on a stack of size 5 :
Underflow occurs
2.
Push(a); Pop(); Push(b); Push(c);
Overflow occurs
Pop(); Push(d); Pop(); Pop();
3.
Push(e)
Error occurs
4.
Which of the following statements
Stack operations are performed smoothly
is correct?
Consider the following processes,
with the arrival time and the length
of the CPU burst given in
1.
milliseconds. The scheduling
8.25
algorithm used is preemptive
2.
shortest remaining time first.
10.25
3.
What is the average turnaround
6.35
time of these processes?
4.
4.25

[Link]
following-processes-with-the-arrival--
5e07177f0216780d014c3017

1.
Consider the following statements
both are false
2. both are true 3.
I. 2^(n+1) = O(2^n )
II is true I is false
4.
II. 2^(2n) = O(2^n )
I is true II is false
Pick the correct choice.
[Link]
1.
Only S1 is correct
2.
Consider the following two
statements: S1: { 0^2n | n >= l} is a
Only S2 is correct
regu1ar language} S2: { 0^m 0^n
0^(m+n) | m >= 1 and n >= 2} is a
3.
regu1ar language Which of the
following statements is correct?
Both S1 and S2 are correct

4.
 None of S1 and S2 is correct
[Link]
following-two-statements-s1-02n-n-l-is-a-regu1ar-
language-s2-0m-0n-0mn-l-m-1-and-n-2-is-a-regu1ar-
language-which-of-the-following-statements-is-correct
1.
all strings over {x,y} with substring yy
2.
Consider the regular expression
all strings over {x,y} with at most two y’s
3.
(x+y)*y(x+y)*y(x+y)*
all strings over {x,y} containing at least two y’s
4.
all strings over {x,y} with substring xyy
1.
3
2.
Consider the regular language L = 5
(111 + 11111)*. The minimum 3.
number of states in any DFA 8
accepting the language is 4.
9

2N+1 = 23+1 = 9
1.
1NF
Consider the relation R (ABCDE): 2.
FD = { A → B, B → C, C → D, D 2NF
→ E} Find out the highest normal 3.
form 3NF
4.
BCNF
1.
Consider the table testable:
10
Create table testable( A integer, B
2.
integer, primary key (A),
5
unique(B), check(A between 1 and
3.
10), check (B between 1 and 5));
15
How many data records/tuples at
4.
most can this table contain?
50
Consider the transactions T1, T2,
and T3 and the schedules S1 and S2 1.
given below. Only S1 is conflict-serializable
T1: r1(X); r1(Z); w1(X); w1(Z) 2.
T2: r2(Y); r2(Z); w2(Z) Only S2 is conflict-serializable
T3: r3(Y); r3(X); w3(Y) 3.
S1: r1(X); r3(Y); r3(X); r2(Y); Both S1 and S2 are conflict-serializable.
r2(Z); w3(Y); w2(Z); r1(Z); w1(X); 4.
w1(Z) Neither S1 nor S2 is conflict-serializable.
S2: r1(X); r3(Y); r2(Y); r3(X);
r1(Z); r2(Z); w3(Y); w1(X);
w2(Z); w1(Z)
Which one of the following
statements about the schedules is
TRUE?
Consider the virtual page reference
string: 1, 2, 3, 2, 4, 1, 2, 3, 4, 1 on a 1.
demand paged virtual memory a) 6, 5, and 9
system running on a computer 2.
system that has main memory size a) 9, 5, and 8
of 3 page frames which are initially 3.
empty. Let LRU FIFO and a) 9, 6, and 7
OPTIMAL denote the number of 4.
page faults under the corresponding a) 6, 4, and 8
page replacement policy. Then,
what is page fault value of FIFO, Optimal < FIFO<LRU
OPTIMAL and LRU respectively?
1.
Simplex
2.
Constrained by legal flow was
Ford Fulkerson
considered in which max flow
3.
algorithm?
Edmonds-karp
4.
Push-relabel
Correctly match the following
pairs:
1.
1. Interrupt processing a. a) 1-b 2-d 3-a 4-c
ELEVATOR 2.
a) 1-c 2-d 3-a 4-b
2. Belady’s anomaly b. Round 3.
robin a) 1-d 2-c 3-b 4-a
4.
3. Disk scheduling c. LIFO a) 1-c 2-b 3-d 4-a

4. Time sharing d. FIFO

1.
Dependence matrix
2.
Coupling and cohesion can be SRS
represented using a: 3.
Cause-effect graph
4.
Structure chart
Cyclomatic complexity of a flow 1.
graph G with n vertices and e edges V(G)=e+n-2
is 2.
 V(G)=e-n+2
3.
V(G)=e+n+2
4.
V(G)=e-n-2
1.
Data imaging
2.
Data cloning, also called as Data virtualization
_____________ 3.
Data copy
4.
Data Mirroring
1.

k+1

2.
Definition of a language L with
alphabet {a} is given as following. n+1
L= { a^nk | k > 0, and n is a
positive integer constant} What is 3.
the minimum number of states 2^n+1
needed in a DFA to recognize L? 4.
2^k+1

[Link]
language-l-with-alphabet-a-is-gi--
558daf8f2a396511d048a809
1.
Write miss
2.
During a write operation if the
Write latency
required block is not present in the
3.
cache then ______ occurs.
Write hit
4.
Write delay
1.
Primary Key
2.
Each foreign key refers to a …….. Unique Key
key in a relation. 3.
Composite Key
4.
Candidate Key
1.
g(n) = Ω(f(n))
f(n) = O(g(n)) if and only if
2.
g(n) = ω(f(n))
 3.
g(n) = O(f(n))
4.
g(n) = o(f(n))
[Link]
do-i-prove-that-fn-ogn-if-and-only-if-gn-omegafn
1.
Intermediation
2.
Aggregation
3.
Figure out which is not a
Arbitrage
service of cloud Broker?
4.
Auditing

[Link]
cloud-computing-reference-architecture/
1.
comma character (,)
2.
Colon character (:)
3.
Filters can be added to expressions Hyphen character (-)
by using the ______, followed by a 4.
filter. Pipe character (|)

[Link]
expressions-by-using-the-followed-by-a-
[Link]#:~:text=Explanation%3A,)%2C%20followed%2
0by%20a%20filter.
Find output

#include <stdio.h>

void show(int, float);

1.
void main() Compiler Error
2.
{ Linker Error
3.
void (*s) (int, float); 1 3.00
4.
s=show; 1

(*s)(1,3.0);}
void show(int i, float j )

printf("%d %.2f",i,j);}

a.

b.

c.

1.
Optimization
2.
Decision
3.
Finding the shortest path is a
Hard
___________ problem
4.
All of these

[Link]
[Link]
1.

type-1

2.

type-2
Finite automata recognizes --------
grammars 3.

type-3

4.
type-0
 1.
2n+ 1
2.
For a software system under the 4n + 3
single fault assumption, the total 3.
number of test cases in boundary 6n - 2
value analysis for a problem with n 4.
inputs is: 4n+1

[Link]
triangle-problem/
1.
For which of the following tasks, (b) and (d)
stack is not suitable data structure? 2.
(b) and (c)
(a) Binary search in an array 3.
(a) and (c)
(b) Breadth first search 4.
(c) and (d)
(c) Implementing function calls
[Link]
(d) Process scheduling following-tasks-stack-is-not-sui--
5f5642df57c16fbaa2bc806e
1.
Given a set of news articles from many different websites,
find out what topics are the main topics covered.
2.
Given sales data from a large number of products in a
supermarket, estimate future sales for each of these
For which one the following task
products.
might K-means clustering be a
3.
suitable algorithm?
Given historical weather records, predict if tomorrow's
weather will be sunny or rainy.
4.
Given many emails, you want to determine if they are
Spam or Non-Spam emails.
 [Link]
cdb5096baa6
1.
convertAndSend()
2.
receiveAndConvert()
For your front desk and back office 3.
classes, you can send and receive a all of the mentioned
map using the:- 4.
none of the mentioned

[Link]
jms-messages-transactions/
1.
Dynamic Programming
2.
From the following which will not Divide and Conquer
return optimal solution 3.
Branch and Bound
4.
Approximation Algorithm
1.
Probably Approx Cost
2.
Probably Approximate Correct
3.
Full form of PAC is
Probability Approx Communication
_____________
4.
Probably Approximate Computation

[Link]
form-of-pac-is-_
1.
Given a training data set of 5,000
5000 × 16
instances, with each input instance
2.
having 15 dimensions and each
5000 × 15
output instance having 2
3.
dimensions, the dimensions of the
5002 × 15
design matrix used in applying
4.
linear regression to this data is
5000 × 17
Given an arbitrary 1.
non-deterministic
finite automaton N^2
(NFA). with N states,
the maximum 2.
number of states in 2^N
an equivalent 3.
minimized DFA is at 2N
least. 4.
 N!

1.

abaabaaabaa, aaaabaaaa, baaaaabaaaab

2.
aaaabaaaa, baaaaabaaaab, baaaaabaa
Given the language L = {ab, aa, baa}, which of the 3.
following strings are in L*?
abaabaaabaa, aaaabaaaa, baaaaabaa

4.

abaabaaabaa, baaaaabaa, abaabaaabaa

1.
Department address of every employee
Given the relations 2.
employee (name, salary, deptno) and department (deptno, Employees whose name is the same as their
deptname, address) department name
Which of the following queries cannot be expressed using 3.
the basic relational algebra operations (U, -, x, π, σ, p)? The sum of all employees’ salaries
4.
All employees of a given department
Given two statements:
1.
Both statements are true
I. Insertion of an element should be done at the last node
2.
in a circular list
Both statements are false
3.
II. Deletion of an element should be done at the last node
I is true and II is false
of the circular list.
4.
I is false and II is true
Which of the following is true?
1.
NP
2.
Hamiltonian cycle is an example of __________ P
3.
NP - Complete
4.
NP - Hard
1.
1
2.
2
Hibernate has __2___ cache types
3.
15
4.
20
 1.
Class Relational Mapping
2.
Class Object Mapping
Hibernate ORM stands for?
3.
Object Relational Mapping
4.
None of the above
1.
Block Diagram
2.
Dendrogram
Hierarchical agglomerative clustering is typically
visualized as?
3.
Binary Trees

4.
Graph
1.
RAD model
2.
High speed adaptation of waterfall model in which rapid
Incremental process model
development is achieved by using a component-based
3.
construction approach is
Evolutionary process model
4.
spiral model
1.
</…….>
2.
<!……>
How do we write comments in HTML?
3.
</……/>
4.
<…….!>
1.
It eliminates the need of Cloud
2.
It decentralizes the Cloud
How does Fog computing differ from cloud computing?
3.
It relies on the strong cloud
4.
No difference
1.
By allowing data to be processed where it is being
How does fog computing reduce latency and the used
resources necessary to transport data for processing? 2.
By moving data to the cloud more quickly for
processing
 3.
By positioning the cloud closer to the data access
point
4.
By creating a new cloud that creates faster
processing
1.
4 PUSH and 3 POP operations
2.
How many PUSH and POP operations will be needed to
5 PUSH and 4 POP operations
evaluate the following expression by reverse polish
3.
notation in a stack machine (A ∗ B) + (C ∗ D/E)?
6 PUSH and 2 POP operations
4.
5 PUSH and 3 POP operations
1. 1
How many security accounts per client is provided by 2. 3
Microsoft? 3. 5
4. 7
1.
12
2.
12
How many two state FA can be drawn over alphabet
3.
{0,1} which accepts (0+1)*
16
4.
60
1.
HyperText Markup Language
2.
HyperText Machine Language
HTML stands for __________
3.
HyperText Marking Language
4.
HighText Marking Language
1.
hypervisor
2.
IaaS offers an isolated environment to individual virtual machine sprawl
customers through? 3.
security vulnerabilities
4.
renting
1. Nagios
2. Jenkins
Identify the tool for DevOps?
3. Monit
4. All of the them
Identify the type of learning in which labeled training 1.
data is used. Semi unsupervised learning
 2.
Supervised learning
3.
Reinforcement learning
4.
Unsupervised learning
1.
putchar(65).
2.
putchar(‘x’).
Identify the wrong statement.
3.
putchar(“x”).
4.
putchar(‘ ‘).
1.
Software Requirement Specification
2.
IEEE 830-1993 is a recommended standard for Software design
3.
Testing
4.
Both (A) and (B)
1.
a) Decreases
2.
a) Increases
If the page size increases, the internal fragmentation is
3.
a) Remains constant
4.
a) Increases and then decreases
1.
2^n
2.
If a NFA contains n states then its DFA can have n
maximum of ______________ number of states 3.
2n
4.
A
1.
1.9 * 10 ^ -10 sec
2.
If a processor clock is rated as 1250 million cycles per 1.6 * 10 ^ -9 sec
second, then its clock period is ________ 3.
1.25 * 10 ^ -10 sec
4.
8 * 10 ^ -10 sec
If a storage class is not mentioned in the declaration then 1.
default storage class is_________. automatic.
 2.
static.
3.
external.
4.
register.
1.
4 bytes
2.
If a system is 64-bit machine, then the length of each 8 bytes
word will be _______ 3.
16 bytes
4.
64 bytes
1.
A→B
2.
If attribute A determines both attributes B and C, then it is B → A.
also true that: 3.
C → A.
4.
(B,C) → A.
1.
A → C.
2.
If attributes A and B determine attribute C, then it is also B → C.
true that: 3.
(A,B) is a composite determinant.
4.
C is a determinant.
1.
n
If M1 machine recognizing L with n states, then M2 2.
recognizing L* constructed Using Thompson n+1
construction will have ------------- states. 3.
n+2
4.
n-1
1.
The tuple of R has distinct values for T
2.
T cannot have a null value for the tuples in R
If T is a foreign key of the relation R then
3.
T is the key for some other relation
4.
T is a Primary key for R
If the number of conditions in a decision table is n, the 1. n
maximum number of rules (columns) possible is: 2. 2n
 3. 2n
4. log2 n
1.
NP
2.
If there exist a polynomial time reduction for a given
P
problem then it belongs to______
3.
NP - Complete
4.
NP – Hard
1.
Union all
2.
If we want to retain all duplicates, we must write Union some
________ in place of union. 3.
Intersect all
4.
Intersect some
1.
1NF
2.
If you have removed repeated groups of values from a
2NF
relation and also removed the partial key dependencies,
3.
then we would say that the given relation is in
3NF
4.
BCNF
1.
f (n) = O(g(n))

O means lesser than or equal to

2.
If f (n) is asymptotically smaller than g(n), then
f (n) = ω(g(n))
3.
f (n) = Ω(g(n))
4.
f (n) = o (g(n))
1.
regression
Imagine a Newly-Born starts to learn walking. It will try 2.
to find a suitable policy to learn walking after repeated means algorithm
falling and getting up. Specify what type of machine 3.
learning is best suited? reinforcement learning
4.
None
1.
In _________ first factor explains the largest portion of Factor Analysis
the total variance? 2.
PCA
 3.
Hierarchical agglomerative clustering
4.
K-means clustering
1.
64
2.
In Advanced Encryption Standard, for a 128-bit plain text 56
as input, _______ bits are encrypted in one iteration. 3.
16
4.
128
1.
32
2.
In Data Encryption Standard, for a 64-bit plain text as 64
input, _______ bits are encrypted in one round. 3.
56
4.
28
1.
Fraction
2.
In Elliptic Curve Cryptography the public key is a point Non-integer
on the curve, while the private key is an ______________ 3.
Integer
4.
Point on the curve
1.
Timer
2.
In Pretty Good Privacy (PGP) encryption, the time at Timestamp
which the signature was made is referred to as 3.
Counter
4.
Stamp
1.
32-bit
2.
In Secure Hash Algorithm (SHA-1), each round requires 1-bit
only bitwise Boolean operation with ______ registers 3.
8-bit
4.
16-bit
1.
In Secure Hash Algorithm (SHA-1), the compression 4
function consists of _____ rounds. 2.
20
 3.
80
4.
40
1.
TCP
2.
In Secure Sockets Layer (SSL), the ___________ defines
IP
a shared secret key that is used for conventional
3.
encryption of SSL payloads.
HTTP
4.
Handshake Protocol
1.
Associative
2.
In ____________ mapping, the data can be mapped Direct
anywhere in the Cache Memory. 3.
Set Associative
4.
Indirect
1.
Secure Sockets Layer (SSL)
2.
In _______________ , the padding can be any amount
Transport Layer Security (TLS)
that results in a total that is a multiple of the cipher's
3.
block length, up to a maximum of 255 bytes.
Hypertext Transfer Protocol (HTTP)
4.
Hypertext Transfer Protocol Secure (HTTPS)
1. no pointer
In a circularly linked list organization, insertion of a 2. 1 pointer
record involves the modification of 3. 2 pointers
4. 3 pointers
1. 3
In a MapReduce programming model, the number of 2. 5
mapper for word counting of a document with five 3. depends on the data segment
paragraph 4. 2

1.
Mapping
2.
In a MapReduce programming model, which one of the Sorting
following is not part of the MapReduce model? 3.
Reducing
4.
Merging
1.
In a memory-mapped I/O system, which of the following
LDA
will not be there?
2.
 ADD
3.
OUT
4.
IN
1.
more inputs are connected
2.
more outputs are connected
In a satisfiability problem, fan-out was due to
3.
one output connected to more input
4.
one input connected to more output
1.
data path
2.
In Advanced Encryption Standard, the _________ is also pathway
referred to as the state of the algorithm 3.
route
4.
trail
1.

2.

In Advanced Encryption Standard, the finite field

contains 256 elements and is denoted as _______. 3.

4.

1.
Right shift AQQn+1
2.
Subtract Multiplicand from A and ArRight shift
AQQn+1
In Booth's multiplication algorithm, if QnQn+1 = 10,
3.
what operation will you perform?
Add A and Multiplicand, and then Logical Right
shift AQQn+1
4.
Add A and Multiplicand, and then ArRight shift
AQQn+1
1.
In Booth's multiplication algorithm, if QnQn+1 = 01,
Right shift AQQn+1
what operation will you perform?
2.
 Subtract Multiplicand from A and ArRight shift
AQQn+1
3.
Add A and Multiplicand, and then Logical Right
shift AQQn+1
4.
Add A and Multiplicand, and then ArRight shift
AQQn+1
1. failover
In case of cluster or a service failure, the services are 2. transferover
instantly transferred to a replica cluster configuration 3. configover
where they resume functionality is called __________ 4. serviceover

1.
Development Group Expertise, Problem
Characteristics, User Expectations
2.
In choosing a development life-cycle model, one would Languages, Development Schedule, Competition
consider the 3.
System Context, User Population, Platforms
4.
Organizational Structure, User Tasks, Performanc
Criteria
1.
Knowing the value of the attribute A you cannot
look up the value of the attribute B
2.
You don’t need to know the value of the attribute
in order to look up the value of the attribute b
In database context ‘A determines B ‘ refers to
3.
Knowing the value of attribute B you can look up
the value of the attribute A
4.
Knowing the value of attribute A you can look up
the value of the attribute B
1.
O(N)

2.
In divide and conquer, the time is taken for merging the
O(N log N)
sub problems is
3.
O(N2)
4.
O(log N)
1.
Primary Attribute
In ER diagram, an attribute which can have many values
2.
for a single entity is called as
Composite Attribute
3.
 Derived Attribute
4.
Multivalued attribute
1.
Cardinality
2.
In Galois field, the number of elements in the field is Cartesian
called the _________ of the field. 3.
Union
4.
Group
1.
True
In Graham Scan Algorithm traversing the points by
2.
increasing angle yields a simple closed path.
False
3. 4.
1.
2
2.
3
In how many stages the MapReduce program executes?
3.
4
4.
5
1.
src=”_blank”
2.
In HTML, which attribute is used to create a link that alt=”_blank”
opens in a new window tab? 3.
target=”_self”
4.
target=”_blank”
1.
equals to two
2.
In multiclass classification number of classes must less than two
be_______________ 3.
greater than two
4.
None
1.
Binary
2.
In relational algebra, Cross Product (Cartesian product) is Unary
a/an________________ operator. 3.
Ternary
4.
Both Binary and Unary
 1.
The processor raises an error
2.
The value 32 gets added with the value of the
stack and pushes the result onto the stack top
3.
In the execution of instruction Add #32,
The value 32 gets added to the value of the
accumulator and the result is stored in the
accumulator.
4.
Add the value 32 with 32 and the result is stored i
the Accumulator.
1.
a JavaScript code in which the application will run
2.
a JSON file
In the below given statement, "myApp" parameter refers
3.
to ___
an HTML element in which the application will
run
4.
SQL queries
1.
head tag
2.
title tag
In which part of the HTML metadata is contained?
3.
html tag
4.
body tag
1.
Inputs
2.
In a hadoop mapreduce programming model, the number
Output
of maps is usually driven by the total size of
3.
____________
Task
4.
Memory
1.
Secure Sockets Layer (SSL)
2.
In_________ , the padding can be any amount that results
Transport Layer Security (TLS)
in a total that is a multiple of the cipher’s block length, up
3.
to a maximum of 255 bytes.
Hypertext Transfer Protocol (HTTP)
4.
Hypertext Transfer Protocol Secure (HTTPS)
Indeed, a step could be considered the smallest unit of 1.
work for a job. Input (what’s read) is passed to the Step Steplet
and potentially processed; then output (what’s written) is 2.
created from the step. Tasklet
 3.
All of the mentioned
4.
None of the mentioned
1.
JmsGatewaySupport
2.
JMS sender and receiver classes can also extend to JmsGateway
retrieve a JMS template:- 3.
All of the mentioned
4.
None of the mentioned
1.
Move the cluster centroids, where the centroids,
μk are updated.
2.
K-means is an iterative algorithm, and one of the
Test on the cross-validation set.
following step is repeatedly carry out in its inner loop
3.
Randomly initialize the cluster centroids
4.
Number of data objects
1.
pod status , container status.
2.
Kubernetes can effectively self-detect two types of
storage status, container status.
objects ____POD STATUS____ and _CONTAINER
3.
STATUS________.
pod status, storage status.
4.
self status, object status.
1.
True
Kubernetes is the type of cluster management software. 2.
False
3. 4.
1.
Google
2.
IBM
Kubernetes was developed by ______________
3.
Microsoft
4.
None of them
1.
Virtual machines
2.
Kubernetes is
Container
3.
Operating system
 4.
Micro services
1.
Container Storage Interface (CSI)
2.
Kubernetes' ____________ allows third-party vendors to
Configuration Storage Interface(CSI)
easily create storage solutions for containerized
3.
applications.
Kubernetes Storage Interface(KSI)
4.
None
1.
2(n – 1)
2.
Let a Relation R have attributes {a1, a2, a3,…, an} and
2(n – 1) + 1
the candidate key is “a1 a2 a3” then the possible number
3.
of super keys?
2(n – 3)
4.
2(n – 3) + 1
1.
5
2.
Let f(n) = n^2 and g(n) = 2n/4. Assume that we write f(n)
6
= O(g(n)) using the standard definition of big-oh notation.
3.
Then the value of n0 is
7
4.
8
1.
Θ(f(n) + g(n))
2.
Let f(n) and g(n) are asymptotically non-negative Θ(f(n).g(n))
functions. The value of max(f(n), g(n)) is 3.
Θ(f(n))
4.
Θ(g(n))
1.
O(n^2)
Let G be a graph with n vertices and m edges. What is the 2.
tightest upper bound on the running time on DFS of G? O(n)
Assume that the graph is represented using adjacency 3.
matrix. O(m+n)
4.
O(mn)
1.
L^+ = { }
Let L = {Epsilon} (i.e., L consist the empty string only). 2.
Then L^+ =? L^+ = {Epsilon }
3.
can not be defined
 4.
none of the choices
1.
ii
2.
ii and iii
let L={ab,aa,baa}. Which of the following strings are in
3.
L*. i)abaabaaabaa ii)aaaabaaaa iii)baaaaabaaaab
ii and iv
iv)baaaaabaa which strings are in L4?
4.
i,ii and iii

here i ii and iv are correct

1.
AB
2.
EC
Let R = ( A, B, C, D, E, F ) be a relation scheme with the 3.
following dependencies: C→F, E→A, EC→D, A→B. AD
Which of the following is a key of R? 4.
E

C and E not present in any RHS

1.
In BCNF
Let R(A, B, C, D, E, P, G) be a relational schema in
2.
which the following functional dependencies are known
In 3NF, but not in BCNF
to hold:
3.
AB —> CD, DE —> P, C --> E, P --> C and B —> G .
In 2NF, but not in 3NF
The relational schema R is
4.
Not in 2NF
1.
u-1
2.
v-1
Let u=’1101’, v=’0001’, then uv=11010001 and vu=
3.
[Link] the given information what is the
u-1v-1
identity element for the string?
4.
ε
( Identity relation: εw = wε = w, thus the one satisfyin
the given relation will be the identity element.)
1.
Both in single-link and complete-link clustering
Let us consider single-link and complete-link hierarchical 2.
clustering. In which of these approaches, it is possible for It is possible in single-link clustering
a point to be closer to points in other clusters than the
points in its own cluster? 3.
It is possible in complete-link clustering
4.
 Neither in single-link nor in complete-link values
1.
Let f (n) and g(n) be asymptotically positive functions. only I
Which of the following is true? 2.
only II
(I) f (n) = O((g(n)) implies g(n) = O(f (n)) 3.
both I and II
(II) f (n) + g(n) = Θ(min(f (n), g(n))) 4.
neither I nor II
Linked lists are superior to arrays because 1.
because of only I
(I) Size of a linked list need not be specified at compile- 2.
time because of both I and II
3.
(II) Linked list do not need contiguous memory locations because of only II
4.
Pick the correct choice not because of I and II
[Link] 2.
Artificial Intelligence
3.
Machine learning is an application of ___________
Both A and B
4.
None of the above
1.
True
MapJobRegistry instance. This is critical—it is the central
2.
store for information regarding a given Job.
False
3. 4.
1.
True
MapJobRegistry instance. This is critical—it is the central
2.
store for information regarding a given Job.
False
3. 4.
Match the List 1 to List 2 and choose the correct option.
1.
1. Requirement Elicitation ——- a. Module development
1-c , 2-a , 3-d , 4-b
and integration
2.
1-c , 2-a , 3-b , 4-d
2. Design——————————b. Analysis
3.
1-a , 2-c , 3-d , 4-b
3. Implementation——————c. Structure and
4.
behavioral
1-b , 2-c , 3-a , 4-d
4. Maintenance ——————— d. Performance tuning
Match the following. 1.
A – 2, B – 3, C – 1, D – 4
List-I List-II 2.
A – 2, B – 1, C – 4, D – 3
A. Myhill-Nerode Theorem 1. Graph coloring 3.
A – 2, B – 4, C – 1, D – 3
B. Arden's Theorem 2. language L is 4.
regular or not A – 2, B – 3, C – 4, D – 1

C. Register allocation 3. Expression

evaluation

D. Operator precedence 4. Regular

expression
1.
yes
2.
No
Max-flow is unique for the graph provided
3.
May be
4.
None of these
1.
Request and Response
2.
Publish and Subscribe
MQTT protocol works on the principle of .....
3.
Push and Pull
4.
Send and Receive
1.
loop
2.
function
in structural language, we can't add a new sort of
3.
variable
4.
constant
1.
Iteration size
2.
Cost
in the Spiral model of software development, the primary
3.
determinant in selecting activities in each iteration is
Adopted process such as Rational Unified Process
or Extreme Programming
4.
Risk
1.
.njs
2.
[Link] files have extension?
.node
3.
.js
 4.
.nj
1.
Command Prompt
2.
nodejs Editor
[Link] files must be initiated in the?
3.
Both A and B
4.
None of the above
1.
https
2.
http
[Link] has a built-in module called?
3.
server
4.
module
1.
single-threaded
2.
non-blocking
[Link] runs?
3.
asynchronously programming
4.
All of the above
1.
asynchronous
2.
[Link] uses _____ASYNCHRONOUS________ synchronous
programming. 3.
Both A and B
4.
None of the above
1.
10
2.
5
Numeric enums first value is defaulted to what?
3.
1
4.
0
1.
Element directives
On which of the following types of components can we 2.
create a custom directive? Attribute
3.
CSS
 4.
All of these
One of the most attractive applications of public-key 1.
algorithms is the establishment of a secure session key for Alice
a private-key algorithm such as Advanced Encryption 2.
Standard over an insecure channel. Assume Bob has a Bob
pair of public/private keys for the RSA cryptosystem. 3.
Suppose they develop a simple protocol using RSA which Both
allows the two parties Alice and Bob to agree on a shared 4.
secret key. Who determines the key in this protocol? Third party
1.
NP
2.
P
Optimized version of subset sum is a ______
3.
NPC
4.
NP-Hard
1.
IBM 370/168
2.
VAX 11/780
Out of the following which is not a CISC machine.
3.
Intel 80486
4.
Motorola A567
1.
Circuit Satisfiability
2.
3 CNF SAT
Parse tree construction was a part of which NPC problem
3.
Sub set sum
4.
All of these
1.
Optimization
2.
Path existance identification is an _____________ Decision
problem 3.
Hard
4.
All of these
1.
instruction execution
2.
Pipelining strategy is called implement
instruction pre fetch
3.
instruction decoding
 4.
instruction manipulation
1.
True
Pods do not, by themselves, self-heal. 2.
False
3. 4.
1.
Two private cloud
2.
Two public cloud
Point out the correct statements about hybrid cloud 3.
At least one private cloud & one public cloud
4.
Many clouds from two or more different cloud
providers
1.
Two
2.
Pretty Good Privacy (PGP) encryption makes use of Three
______ types of keys 3.
Four
4.
Five
1.
cloud services over the internet
2.
dedicated service over public cloud
Private clouds are
3.
service for unique / dedicated task
4.
distributed systems for a consumer
1.
Simulation of limited resources allocation
2.
Simulation of recursion
Queues serve major role in
3.
Simulation of arbitrary linked list
4.
Expression evaluation
1.
Merging
2.
Quick sort uses which of the following method to Partitioning
implement sorting 3.
Selection
4.
Exchanging
 1.
divide and conquer
2.
greedy
Quicksort uses which approach to algorithm design
3.
brute force
4.
dynamic programming
1.
Reinforcement Learning
2.
Real-Time decisions, Game AI, Learning Tasks, Skill Supervised Learning
acquisition, and Robot Navigation are applications of 3.
Unsupervised Learning
4.
Semi- Supervised Learning
Regarding user-level threads and kernel-supported
threads, consider the following remarks.
1.
1. Use-level threads are transparent to the kernel 2, 3, & 4
2.
2. Context switch is faster with kernel- supported threads 1, 2, & 3
3.
3. Kernel-supported threads can be scheduled 1, 3, & 4
independently 4.
2&4
4. For user-level threads, a system call can block the
entire process
1.
2
Relation R has eight attributes ABCDEFGH. Fields of R 2.
contain only atomic values. F = {CH -> G, A -> BC, B -> 4
CFH, E -> A, F -> EG} is a set of functional 3.
dependencies (FDs) so that F+ is exactly the set of FDs 8
that hold for R. 4.
How many candidate keys does the relation R have? No Limit

AD,BD,ED,FD
1.
No redundancy
Relation R with an associated set of functional 2.
dependencies, F is decomposed into BCNF. The Redundancy with prime attribute
redundancy based on functional dependencies in the 3.
resulting set relations is. Proportional to the size of F+
4.
Redundancy with candidate key.
Replication Controllers and Deployment Controllers are 1.
part of ___________ Etcd manager
 2.
Kubeadm
3.
API Controller Manager
4.
Master Controller Manager
1.
Recursive structure
2.
Abstract data type
Representation of data structures in memory is known as
3.
Storage Structure
4.
File structure
1.
Register Transfer Notation
2.
Register Transmission Notation
RTN stands for ___________
3.
Regular Transmission Notation
4.
Regular Transfer Notation
1.
O(N)

2.
O(N log N)
Running time of Jarvis march is
3.
O(N2)

4.
O(log N)
1.
dynamic
2.
static
SaaS does not necessarily mean that the software is?
3.
sololithic
4.
diolithic
1.
single-tenancy
2.
SaaS supports multiple users and provides a shared data multi-tenancy
model through _________ model 3.
multiple-instance
4.
single-instance
 1.
a) the same regardless of the purpose of the
system
2.
quite simple to implement, even on large
Scheduling is
mainframes
3.
a) unrelated to performance considerations
4.
a) allowing job to use the processor
1.
Feistel
2.
Secure Hash Algorithm (SHA-1) is based on a Merkle-Damgård
___________ construction 3.
Rijndael
4.
Norman
1.

2.

Secure Hash Algorithm (SHA-1) produces a 160-bit

output of a message with a maximum length of ________ 3.
bit.

4.

1.
Transmission Control Protocol (TCP)
2.
Secure Sockets Layer (SSL) is designed to make use of
User Datagram Protocol (UDP)
__________________ to provide a reliable end-to-end
3.
secure service
Network Control Protocol
4.
Transmission Protocol
1.
hierarchically valid certificate
2.
Secure/Multipurpose Internet Mail Extension (S/MIME) user
relies on a ______ for key exchange. 3.
sender
4.
receiver
SessionFactory provides an instance of Session. 1.
 TRUE
2.
FALSE
3. 4.
1.
SimpleJobLauncher, whose sole purpose is to give you a True
mechanism to launch batch jobs, where a “job” in this 2.
case is our batch solution. False
3. 4.
1.
SimpleJobLauncher, whose sole purpose is to give you a True
mechanism to launch batch jobs, where a “job” in this 2.
case is our batch solution.+ False
3. 4.
1.
SRS
2.
Customer feedback reports
Software maintenance takes inputs from:
3.
SDD
4.
Coding standards
1.
Project Deadline and Budget
2.
Certainty and Profit
Software risk always involves two characteristics. What
are those characteristics?
3.
Staff size and Budget
4.
Uncertainty and Loss
1.
MD5
2.
SHA
Spring Security algorithms to secure password
3.
Security
4.
none
1.
True
Spring Batch models solutions using XML schema. 2.
False
3. 4.
1.
Spring Batch provides a mechanism to offload processing chunking
to another process. 2.
remote chunking
 3.
remote
4.
none of the mentioned
1.
Spring provides an implementation of True
SimpleMessageConvertor to handle the translation of a 2.
JMS message received. False
3. 4.
1.
SimpleMessageListenerContainer
2.
Spring provides several types of message listener DefaultMessageListenerContainer
containers:- 3.
all of the mentioned
4.
None of the mentioned
1.
Stack A has the entries a, b, c (with a on top). Stack B is b, a, c
empty. An entry popped out of stack A can be printed 2.
immediately or pushed to stack B. An entry popped out of b, c, a
the stack B can be only be printed. In this arrangement, 3.
which of the following permutations of a, b, c is not c, a, b
possible? 4.
a, b, c
1.
Coding
2.
Statistically, the maximum percentage of errors belong to Design
following phase of software development life cycle. 3.
Specification
4.
Installation and maintenance
1.
input attribute
2.
Supervised learning and unsupervised clustering both
hidden attribute
require _______. Which is correct according to the
3.
statement
output attribute
4.
categorical attribute
1.
Suppose that there are two entity sets, R1 and R2 with
R3(A, B, C, P, Q, R, N)
attributes A, B, C and P, Q, R respectively. Here, A is the
2.
key for R1 and Q is the key for R2. If there exists a many-
R3(A, Q, N)
to-many relationship R3 from R1 to R2 with an attribute
3.
N, what would be the schema for R3 after converting the
R3(A, Q)
ER diagram into schemas?
4.
 R3(A, B, C, Q, N)
1.
The variance of each distribution is small in all
directions
Suppose we are given data comprising n points of several
different k classes. Each class has a different probability
2.
distribution from which the sample points are drawn. We
Each class has the same mean
do not have the class labels. We use k-means clustering to
3.
try to guess the classes. Which one of the following
Some of the classes are not normally distributed
circumstances would undermine its effectiveness?
4.
You choose k != n, the number of sample points

1.
[Link]
2.
javascript [Link]
Syntax to Initiate the [Link] File is?
3.
node [Link]
4.
node filename
1.
JmsTemplate
2.
Template which can send and receive JMS messages with EMail
much less code 3.
All of the mentioned
4.
None of the mentioned
1.
normal encoding
2.
The _______________ is useful when the data consists
normal encryption
largely of octets that correspond to printable ASCII
3.
characters.
quoted-printable transfer encoding
4.
base64 transfer encoding
1.
modular exponentiation
The addition operation in Elliptic Curve Cryptography is 2.
the counterpart of modular multiplication in RSA, and modulation
multiple addition is the counterpart of 3.
____________________ exponentiation
4.
multiplication
The addressing mode executes the instruction within the 1.
CPU without using any other operands. Direct
2.
A. Immediate
 3.
Implied
4.
Register
1.
Indirect
2.
The addressing mode which is most suitable for changing
Immediate
the normal sequence of execution is-----
3.
Relative
4.
Indexed
1.
Direct
The addressing mode which uses the PC instead of 2.
general purpose register is--- Relative
3.
A. Indexed with offset
4.
Indirect
1.
Form-based login service
2.
The basic security services registered and configured by Logout Service
Spring Security. 3.
HTTP Basic authentication
4.
all the above
1.
Answering probabilistic query
2.
Solving queries
The Bayes rule can be used in _____
3.
Increasing complexity
4.
Decreasing complexity
1.
Virtual page number
2.
Page frame number
The essential content(s) in each entry of a page table is /
3.
are
Both virtual page number and page frame
number
4.
Access right information
The following code snippet is to be tested for statement 1.
coverage: T1, T2, T3
2.
begin T2, T4
3.
if (a==b) (S1; exit ;) T3, T4
4.
else if (c==d) (S2 ; ) T1, T2, T4

else (S3; exit ; ) [Link]

question-44/
S4;

end

The test cases T1, T2, T3 and T4 given below are

expressed in terms of properties satisfied by values of
variables declared as a, b, c and d. The exact values are
not given.

T1: a, b, c and d are all equal

T2: a, b, c and d are all distinct

T3: a = b and c! =d

T4: a!= b and c=d

Which of the test suites given below ensures the coverage

of statements S1, S2, S3 and S4?
The following figure represents access graphs of two
modules M1 and M2. The filled circles represent methods
and the unfilled circles represent attributes. If method m
is moved to module M2 keeping the attributes where they
1.
are, what can we say about the average cohesion and
There is no change
coupling between modules in the system of two modules?
2.
Average cohesion goes up but coupling is reduced
3.
Average cohesion goes down and coupling is
reduced
4.
Average cohesion and coupling increase

[Link]
figure-represents-access-graphs-of-t--
609228c8a5a893539d57dfed

The following is a solution to the Dining Philosophers

1.
Problem that avoids deadlock:
 a) ensure that all philosophers pick up the left
fork and the right fork
2.
a) ensure that all philosophers pick up the left
fork before the right fork
3.
a) ensure that all philosophers pick up the right
fork before the left fork
4.
a) ensure that one particular philosopher picks u
the left fork before the right fork, and that all othe
philosophers pick up the right fork before the left
fork
1.
77
2.
1
The greatest common divisor of 7469 and 2464 is
3.
0
4.
22
1.
Traffic Padding
2.
The insertion of bits into gaps in a data stream to frustrate
Digital Signature
traffic analysis attempts is referred to as
3.
___________________.
Notarization
4.
Authentication Exchange
1.
Add 28 with the value of R3 and store the result i
R3.
The instruction Add #28,R3 does---
2.
Add 28 with the address stored in R3 and store the
A.
result in R3
3.
B.
Add the value of R3 with the value of memory
location 28
C
4.
Add the value 28 with the value of a memory
location that is stored in R3.
1.
Perfective
2.
The modification of software to match changes in
Adaptive
environment falls under which category of software
3.
maintenance?
Corrective
4.
Preventive
 1.
Accumulator
2.
Cache Memory location
The operands of zero address instructions are stored in,
3.
Stack
4.
CPU registers
1.
can take only non-zero values
2.
can take any value in the real space
The parameters obtained in linear regression
3.
are strictly integers
4.
always lie in the range [0,1]
1.
Data-flow diagram
2.
Structure chart
The primary tool used in structured design is a:
3.
Module
4.
Program flowchart
1.
contains address of next node
2.
may contain null character
The address field of a linked list
3.
contains address of next pointer
4.
both (A) and (B)
1.
Deterministic
2.
The Algorithm in which every operation is uniquely Non-Deterministic
defined is called _______ 3.
Approximation
4.
Backtracking
1.
the number of command line strings including the
execution command.
2.
The arguments argc in main( ) counts_______.
the number of command line strings excluding the
execution command.
3.
the number of lines in a program.
 4.
the number of characters in a program
1.
Data Theft
2.
The assurance that data received are exactly as sent by an
Data Mugging
authorized entity (i.e., contain no modification, insertion,
3.
deletion, or replay) is known as _____________.
Data Reception
4.
Data Integrity
1.
simple attribute
2.
The attribute that can be divided into other attribute is composite attribute
called 3.
multi-valued attribute
4.
derived attribute
1.
The average number of steps taken to execute the set of
isa
instructions can be made to be less than one by following
2.
pipelining
[Link]
3.
of-steps-taken-to-execute-the-s
super-scaling
4.
sequential
1.
it sometimes fails to recognize grammars that are
regular
The basic limitation of FSM is that
2.
The explanation: Because there is no memory associated
it sometimes recognized grammars that are not
with [Link] more on [Link] -
regular
[Link]
of-finite-automata-is-that
3.
it cannot remember arbitrary large amounts of
information
4.

all of the comments are true

1.
Reference bit
2.
The bit used to indicate whether the block was recently Dirty bit
used or not is _______ 3.
Control bit
4.
Idol bit
 1.
Solution Space
2.
The Candidate-Elimination Algorithm represents the Version Space
__________ 3.
Elimination Space
4.
All of the above
1.
Supervised learning
2.
The categories in which Machine learning approaches can Unsupervised learning
be traditionally categorized are ______ 3.
Reinforcement learning
4.
All of the above

1.
The CFG are closed for (i) and (iv)
2.
(i) Intersection (i) and (iii)
3.
(ii) Union (ii) and (iv)
(iii) Concatenation 4.
(ii), (iii) and (iv)
(iv) Star operation
[Link]
not-closed-under--5dc433def60d5d06904b11a7
1.
require different amount of time
2.
require about the same amount of time
3.
The concept of pipelining
require different amount of time with time difference between any
is most effective in
two tasks being same
improving performance if
4.
the tasks being
require different amount with time difference between any two tasks
performed in different
being different
stages
[Link]
3#:~:text=The%20concept%20of%20pipelining%20is,any%20two%2
0tasks%20being%20same

1.
The condition flag Z is The operation has resulted in an error
set to 1 to indicate 2.
_______ The operation requires an interrupt call
3.
 The result is zero
4.
There is no empty register available

[Link]
Architecture/Microoperations/discussion/4435
1.
Structural hazard
2.
Stalk
The contention for the
3.
usage of a hardware
Deadlock
device is called
4.
______________
None of the mentioned

[Link]
answers-online-quiz/
1.
kernel parameters
2.
selection of kernel
The effectiveness of an
3.
SVM depends
soft margin parameter
upon________________
4.
All of the above

[Link]
1.
Locality of reference
2.
Memory localization
3.
The effectiveness of the Memory size
cache memory is based 4.
on the property of Memory hierarchy
________
Reason:

This means that the cache depends on the location in the

memory that is referenced often.
1.
queue
2.
The efficient data
linked list
structure to insert/delete
3.
a number to/from a
doubly linked list
stored set of numbers is
4.
binary tree
 [Link]
question-paper/discussion/12000
1.
0 -1 +2
2.
0 -1 -2
3.
0 +1 -2
4.
0 +1 +1
The encoded form of the
multiplier, 11010 in (11010) => (110 010 000) =>(-1 -2 0)
Modified Booth’s
algorithm is,

1.
-6
2.
4
3.
The expression x=
-4
4+2%-8 evaluates to
4.
6
a.
[Link]
evaluates-this-expression#:~:text=Save%20this%20answer.-
,Show%20activity%20on%20this%20post.,4%20%2B%202%20whic
h%20is%206.
1.
The tree representing how close the data points are to each other

2.
The final output of
The number of cluster centroids
Hierarchical clustering
is-
3.
A map defining the similar data points into individual groups
4.
Takes each data point as an individual x number of cluster
 [Link]
learning/clustering
1.
The first fit algorithm
True
never uses more bins
2.
than the next fit
False
algorithm
3. 4.
1.
A
2.
B
3.
C
4.
The five items: A, B, C, D
D and E are pushed in a
stack, one after other
starting from A. The
stack is popped four
items and each element is
inserted in a queue. The
two elements are deleted
from the queue and
pushed back on the stack.
Now one item is popped
from the stack. The
popped item i

1.
The following postfix
1, 5
expression with single
2.
digit operands is
3, 2
evaluated using stack. 8 2
3.
3 ∧ / 2 3 ∗ + 5 1 ∗ −. The
6, 1
top two elements of the
4.
stack after the first ∗ is
5, 7
evaluated are
 1.
The [Link]() method is TRUE
used to read files on your 2.
computer FALSE
3. 4.
1.
Extendible hashing
2.
The hashing technique
Linear hashing
that allows a hash file
3.
either to expand or to
Non-linear hashing
shrink dynamically is
4.
__________.
External hashing

[Link]
1.
Dynamic hashing
The hashing technique 2.
which allocates fixed Static hashing
number of buckets is 3.
classified as External hashing
4.
Internal hashing
The initial configuration 1.
of queue is a, b, c, d with 3 deletions 3 additions
a at the front. To get the 2.
configuration d, c, b, a 2 deletions 3 additions
how many deletions and 3.
additions required? 3 deletions 2 additions
4.
1 deletions 3 additions
The language { w ∈ Σ*|
w contains
1.
Many number of 0’s and 1’s
2.
Equal number of 0’s and 1’s
3.
At least two 0s, or exactly two 1s
4.
At least two 0s and exactly two 1s

1.

Finite state automata

2.
The lexical analysis for a
deterministic pushdown automata
modern language such as
Java needs the power of
3.
which one of the
following machine
Non-deterministic pushdown automata
models in a necessary
and sufficient sense?
4.

Turing machine

[Link]
modern-computer-languag--60b604ae9105dcecbf97cefd

1.
Logical Cohesion
2.
The lower degree of Coincidental Cohesion
cohesion is kind of 3.
Procedural Cohesion
4.
Communicational Cohesion
1.
dot (.) operator.
The member variable of
2.
structure is accessed by
arrow (->) operator
using______.
3.
asterisk * operator
 4.
ampersand & operator

[Link]
ed%20to%20access,operator%20is%20the%20correct%20answer.
1.
CMOS
2.
Memory sticks
The memory devices 3.
which are similar to Blue-ray devices
EEPROM but differ in 4.
the cost effectiveness is Flash memory
______
[Link]
similar-to-EEPROM-
but#:~:text=Explanation%3A%20The%20flash%20memory%20funct
ions,EEPROM%20but%20is%20much%20cheaper.
1.
createMessage()
2.
The MessageCreator
create()
interface declares
3.
method:-
createMsg()
4.
none of the mentioned
1.
The method of Exceptions
synchronising the 2.
processor with the I/O Signal handling
device in which the 3.
device sends a signal Interrupts
when it is ready is? 4.
DMA
1.
two
The minimum length
2.
for strings in the regular
zero
expression (
3.
10* + 001* )*
one
is_________
4.
infinite
1.
Eucledian
The most general form of
2.
distance is
Manhattan

3.
 Mean
4.
Minkowski (ANALYTICS VIDHYA)
1.
Left shift and A-M
2.
Right shift and A-M
3.
Left shift and A+M
4.
Right shift and A+M
The next operation to be
performed in non-
restoring division
algorithm if the sign bit
of the dividend is 1 is,

A.

C.

D.

1.
[Link]
2.
The [Link] modules can module
be exported using 3.
[Link]
4.
All of the above
1.
Cardinality
2.
The number of attributes Degree
in relation is called as its 3.
Tuples
4.
Entity
1.
Greater
The number of states in 2.
DFA is --------than the
number of states in NFA less
for the same Language.
3.
greater equal
4.
equal
1.
Access rate
The number successful 2.
accesses to memory Success rate
stated as a fraction is 3.
called as _____ Hit rate
4.
Miss rate
1.
machine learning algorithm
The output of training 2.
process in machine machine learning model
learning 3.
is________________ null
4.
accuracy
1.
call by function
2.
The pointers can be used call by reference.
to achieve_____. 3.
call by name
4.
call by procedure
1.
{ fi,{ fi}}
2.
{ fi}
The power set of fi is 3.
{ fi, fi}
4.
None of the Choices
1.
RAID
The process in which a
2.
file is partitioned into
Mirroring
smaller parts and
3.
different parts are stored
Stripping
in different disks is
4.
RAID classification
 1.
Polling
The process wherein the 2.
processor constantly Inspection
checks the status flags is 3.
called as ___________ Reviewing
4.
Echoing
1.
iterative model
2.
The quick design of a
prototype model
software that is visible to
3.
end users leads to _____.
spiral model
4.
waterfall model
1.
The reason for the To increase the internal memory of the system
implementation of the 2.
cache memory is The difference in speeds of operation of the processor and memory
________ 3.
To reduce the memory access time and cycle time
4.
To increase the memory access time
1.
Cardinality
2.
The number of attributes Degree
in relation is called as its 3.
Tuples
4.
Entity
1.
Greater
2.
The number of states in
less
DFA is --------than the
number of states in NFA
3.
for the same Language.
greater equal
4.
equal
1.
Access rate
The number successful
2.
accesses to memory
Success rate
stated as a fraction is
3.
called as _____
Hit rate
4.
 Miss rate
1.
machine learning algorithm
The output of training 2.
process in machine machine learning model
learning 3.
is________________ null
4.
accuracy
1.
call by function
2.
The pointers can be used call by reference.
to achieve_____. 3.
call by name
4.
call by procedure
1.
{ fi,{ fi}} (Quora)
2.
{ fi}
The power set of fi is 3.
{ fi, fi}
4.
None of the Choices
1.
RAID
The process in which a
2.
file is partitioned into
Mirroring
smaller parts and
3.
different parts are stored
Stripping
in different disks is
4.
RAID classification
1.
Polling
The process wherein the 2.
processor constantly Inspection
checks the status flags is 3.
called as ___________ Reviewing
4.
Echoing
1.
iterative model
The quick design of a 2.
software that is visible to prototype model
end users leads to _____. 3.
spiral model
4.
 waterfall model
1.
The reason for the To increase the internal memory of the system
implementation of the 2.
cache memory is The difference in speeds of operation of the processor and memory
________ 3.
To reduce the memory access time and cycle time
4.
To increase the memory access time
1.
The time complexity of O(N)
each point is pushed into 2.
the stack once, each point O(N log N)
is removed from the 3.
stack at most once in O(1)
Graham scan is 4.
O(log N)
1.
Block transfer
2.
The transfer between
Word transfer
CPU and Cache is
3.
______________
Set transfer
4.
Associative transfer
1.
The URL module splits TRUE
up a web address into 2.
readable parts. FALSE
3. 4.
1.

2.
The Epsilon-Closure of
any state q will contain Epsilon
the state
______________ 3.
irrespective of q.
p

4.
Final state
1.
There are ________
2
types of Pods in
2.
kubernets?
3
 3.
4
4.
6
1.
TextMessage
2.
There are several types of
MapMessage
messages defined in the
3.
JMS API, including:-
BytesMessage
4.
All of the mentioned
These computer uses the
stored-program concept.
1.
Memory is used to store
Single Program Multiple Data (SPMD)
both program and data
2.
instructions and central
Flynn’s taxonomy
processing unit (CPU)
3.
gets instructions and/ or
Von Neumann Architecture
data from memory. CPU,
4.
decodes the instructions
Harvard architecture
and then sequentially
performs them.
1.
Reinforcement learning algorithm
2.
Thompson sampling is Probabilistic algorithm
a___ 3.
Based on Bayes inference rule
4.
Sampling based algorithm
1.
Delete the last element of the list
Time of which of the 2.
following operations Delete the first element of the list
depends on the length of 3.
a singly linked list? Add an element after the last element of the list
4.
Interchange the first two elements of the list
1.
JPAFlowExecutionListener
2.
To integrate Hibernate HibernateFlowExecutionListener
with Spring Web flows. 3.
JTAFlowExecutionListener
4.
All of them
 1.
JmsTemplate
2.
To address different JMS JmsTemplate102
APIs, Spring provides :- 3.
All of the mentioned
4.
None of the mentioned
1.
Black Box Testing

To execute all loops at 2.

their boundaries and Alpha Testing
within their operational
bounds is an example of 3.
Recovery Testing
4.
White Box Testing
1.
function()
To include a module, use 2.
the ___________ require()
function with the name of 3.
the module. exports()
4.
module()
1.
send
2.
To send a JMS message
sendTo
with this template, you
3.
simply call:-
all of the mentioned
4.
none of the mentioned
1.
Transport Layer Security pseudorandom function
(TLS) makes use of a 2.
__________ to expand arithmetic function
secrets into blocks of 3.
data for purposes of key binomial function
generation or validation. 4.
Poisson function
1.
Two balanced binary O(m*n)
trees are given with m 2.
and n elements, O(m+n)
respectively. They can be 3.
merged into a balanced O(m*log n)
4.
binary search tree in O(m*log(m+n))
____________ time.

1.
bare metal hypervisor
2.
Type-1 hypervisor is also hosted hypervisor
called as 3.
type-0 hypervisor
4.
direct hypervisor
1.
Lowest path cost
2.
Uniformed-Cost Search
Heuristic cost
expands the node n
3.
with the
Highest path cost
4.
Average path cost
1.
Making sure that it is what the user really wants
2.
Verification is Checking that we are building the right system
__________________. 3.
Checking that we are building the system right
4.
Performed by an independent test team
Weakness in an
information system, 1.
system security Threat
procedures, internal 2.
controls, or Risk
implementation that 3.
could be exploited or Vulnerability
triggered by a threat 4.
source is known as Adversary
_______
1.
Representational State Transform
2.
What does the Acronym Representational State Transfer
REST stand for? 3.
Represent State Transform
4.
Represent State Transfer
What are the four 1.
dimensions of Usability, Reliability, Security, Flexibility
Dependability? 2.
 Availability, Reliability, Maintainability, Security
3.
Availability, Reliability, Security, Safety
4.
Security, Safety, Testability, Usability
1.
Real time Data intensive
2.
What are the key features Highly scalable servers for Web Applications
of [Link]? 3.
Builds fast and scalable network Applications
4.
All of the above
1.
Boolean, Number, String
2.
What are the three main
Object, Array, Symbol
'simple types' in
3.
TypeScript?
Array, Object, Boolean
4.
Object, String, Number
1.
A variable name should contain alphabets and numeric digits
2.
A variable name cannot begin with a digit
What are variables in
3.
Typescript?
It cannot contain spaces and special characters except underscore (_)
and dollar ($) sign
4.
All of these
1.
Containers (CHATGPT AND BARD)
2.
What can you deploy on Virtual machines
Kubernetes? 3.
System processes
4.
None of them
1.
include all of them in the increasing distance from Pi
What if several points on 2.
same edge of convex hull Just pick the one with maximum distance from Pi
in Graham Scan 3.
Algorithm Ignore the points and move on to pick the next point
4.
Include all the points
 1.
O(nlogn)
2.
What is average time
O(n^2)
complexity of
3.
randomized quick sort
O(n^2logn)
4.
O(nlogn^2)
1.
Data binding is the technique to save HTML data in the database
2.
Data binding is the technique to bind database data to HTML control
What is data binding in 3.
AngularJS? Data binding is the automatic synchronization of data between model
and view components
4.
Data binding is the automatic synchronization of data between model
and controller components
1.
The autonomous acquisition of knowledge through the use of
computer programs
2.
The autonomous acquisition of knowledge through the use of manual
What is Machine programs
learning? 3.
The selective acquisition of knowledge through the use of computer
programs
4.
The selective acquisition of knowledge through the use of manual
programs
1.
Streams data in asynchronously
2.
Streams data in synchronously
What is subscribe?
3.
Both
4.
None of these
What is the appropriate
1.
pairing of items in the
P-3, Q-2, R-4, S-1
two columns listing
2.
various activities
P-2, Q-3, R-1, S-4
encountered in a software
3.
life cycle?
P-3, Q-2, R-1, S-4
4.
P. Requirements
P-2, Q-3, R-4, S-1
Capture 1. Module
Development and
Integration

Q.
Design
2. Domain Analysis

R.
Implementation
3. Structural and
Behavioral Modeling

S.
Maintenance
4. Performance Tuning
1.
Task
2.
What is the basic
Pod
operational unit of
3.
Kubernetes?
Nodes
4.
Container
1.
</doctype html>
2.
What is the correct
<doctype html>
syntax of doctype in
3.
HTML5?
<doctype html!>
4.
<!doctype html>
1.
CostCLOUD = Σ(UnitCostCLOUD / (Revenue + CostCLOUD))
What is the correct 2.
formula to calculate the CostCLOUD = Σ(UnitCostCLOUD / (Revenue – CostCLOUD))
cost of a cloud 3.
computing deployment? CostCLOUD = Σ(UnitCostCLOUD x (Revenue – CostCLOUD))
4.
CostCLOUD = Σ(UnitCostCLOUD x (Revenue + CostCLOUD))
What is the cost involved 1.
for B2(outer loop) in the B2
code which calculating 2.
time complexity sum = 0; B2*(N+1)
for(i=0; i<N; i++) 3.
B2 for(j=0; j<N; j++) B2*N*(n+1)
sum += arr[i][j]; 4.
B2*N^2
 1.
bridge
2.
What is the default host
network used in docker? 3.
custom
4.
star
1.
Scalability
2.
What is the disadvantage Expensive (CHAT GPT )
of DevOps? 3.
Resource utilization
4.
Stability
1.
Register Memory
What is the high speed 2.
memory between the Cache Memory
main memory and the 3.
CPU called? Storage Memory
4.
Virtual Memory
1.
any[]
What is the inherited type 2.
for the variable example unknown[]
in `const example = 3.
['Hostel']`? string[]
4.
None of these
1.
so as to avoid worst case time complexity
What is the purpose of 2.
using randomized quick so as to avoid worst case space complexity
sort over standard quick 3.
sort to improve accuracy of input
4.
to improve average time complexity
1.
What is the significance
Conditionally independent
between a node and its
predecessors while
constructing bayesian
2.
network?
Functionally dependent

3.
Dependent
 4.
Both Conditionally dependent & Dependent
1.
The physical device that provides extra processing speed
2.
The physical device that provides extra storage
What is the use of HSM?
3.
The physical device that provides extra security for sensitive data
4.
All of them
1.
O(N)

2.
What is the worst case O(N log N)
complexity of quick hull
3.
O(N2)
4.
O(log N)
1.
{12,2}*
2.
{23,2}*
What is {1,2}* n {2,3}* 3.
{2}*
4.
{12,23}*
1.
Port 3000
2.
What port does Docker Port 5000
registry use? 3.
Port 8000
4.
None of them
1.
Implicit
What type of assignment 2.
is this variable, `const Explicit
fullName: string = 'VIT 3.
Hostel';`? Both
4.
None of these
What will be the output 1.
of the following 50
JavaScript code? 2.
10
<p id="demo"></p> 3.
5
<script> 4.
error
var js = 10;

js *= 5;

[Link]
d("demo").innerHTML =
js;

</script>
What will be the output
of the following Java
program? 1.
Hello
2.
World
3.
Hello World
4.
HelloWorld

1.
What will be the time
O(n^2)
complexity of code given
2.
(line seperation indicated
O(n log n)
by ",") sum=0,
3.
for(i=1;i<=n;i*=2),
O(n)
for(j=1;j<=n;j++), sum++
4.
O(n logn logn)
1.
Override
When a class extends
2.
another class and
Extends
replaces the members of
3.
its parent it is called ------
Inheriting
-------------?
4.
overload
1.

dot
When a state in a FA has
self loop its regular
2.
expression will have
star
 3.

binary+

4.
uniary +
1.
rational number
2.
When do FORD irrational Number
Fulkerson algorithm fails 3.
integer
4.
None of these
When the Graham scan
algorithm terminates, 1.
stack S contains exactly True
the vertices of CH(Q) ,in 2.
counterclockwise order False
of their appearance on 3. 4.
the boundary
1.
automata
2.
finite automata
When there are infinite
3.
distinguishable strings
then there cannot be a
regular expression

4.
both finite automata and regular expression
1.

dot

2.
When there is more than
one final state in the
star
reduced FA, then its
regular expression will
3.
contain _________
operator surely
binary +

4.
unary +
 1.
When using Branching, Branch target
the usual sequencing of 2.
the PC is altered. A new Loop target
instruction is loaded 3.
which is called ______ Forward target
4.
Jump instruction
1.

M2
When we concatenate
2.
two languages L1 and L2
recognized by machine
M1 and M2
M1 and M2 we obtain a
machine with final state
3.
same as that
of __________________
M1 or M2

4.
M1
1.
HIT
Whenever the data is 2.
found in the cache MISS
memory it is called as 3.
_________ FOUND
4.
ERROR
1.
At remote servers
2.
Where does fog
In the Cloud
computing reside in a
3.
company's network?
In a local network
4.
At the edge
1.
Behavioral Model
Which model in system 2.
modelling depicts the Context Model
static nature of the 3.
system? Structural Model
4.
Data Model
Which of the following is 1.
NOT an advantage of a) Smaller sizes of executable files
using shared, 2.
dynamically linked Lesser overall page fault rate in the system
libraries as opposed to 3.
using statically linked Faster program startup
libraries ? 4.
a) Existing programs need not be re-linked to take advantage of
newer versions of libraries
1.
Testing
2.
Which phase is not part
Abstraction
of the software lifecycle
3.
model?
Coding
4.
Maintenance
1.
Delphix
2.
RedGate SQL Clone
3.
Which among the VirtualizeMe (vME)
following is not a tool for 4.
data cloning? KNIME

Reason:

KNIME Analytics Platform is an open source software that allows users to

access, blend, analyze, and visualize data, without any coding.
1.
Naive Bayes
Which among the 2.
following algorithms are Support Vector Machines
used in Machine 3.
learning? K-Nearest Neighbors
4.
All of the above
1.
Set
2.
Which AngularJS filter
Sub-set
selects a subset of items
3.
from an array?
Ng-set
4.
Filter
1.
#
Which character is used
2.
to represent when a tag is
!
closed in HTML?
3.
/
 4.
\
1.
$ docker PS
2.
Which command is used
$ Sudo docker run container name
for running the images as
3.
a container?
$ Sudo docker run -i -t alpine /bin/bash
4.
All of the them
1.
Value
2.
Factory
Which components can 3.
be injected as a Service
dependency in 4.
AngularJS? All of these

Reason:

AngularJS provides a set of components that can be injected in the form

of dependencies such as factory, value, constant, service, and provider
1.
<u>
2.
Which element is used to
<mark>
get highlighted text in
3.
HTML5?
<highlight>
4.
<b>
1.
Name node
Which entity of the
2.
HDFS architecture
Client
manages the file system
3.
namespace and controls
Data node
access to files?
4.
Slave node
1.
logarithmic
2.
Which function has a
numeric raised by variable(N^...)
higher growth factor?
3.
variable raised by number (2^...)
4.
All of these
Which HTML tag is used 1.
to insert an image? <img url=”[Link]” />
 2.
<img alt=”[Link]” />
3.
<img src=”[Link]” />
4.
<img link=”[Link]” />
1.
const ourTuple = ['hostel', 101]
2.
Which is a successful
const ourTuple = [101, 101, ' hostel', 'hostel']
example of this tuple
3.
`[number, string]`?
const ourTuple = [101, 'hostel']
4.
const ourTuple = [101]
1.
{{ [Link] }}
Which is the correct
2.
AngularJS statement to
{{ uppercase(studentName) }}
format the value of
3.
"studentName" in the
{{ [Link] }}
uppercase?
4.
{{ studentName | uppercase }}
1.
var variable_name = [Link]("app_name", []);
2.
Which is the correct
var variable_name = [Link]("app_name", []);
syntax to create a
3.
module?
var variable_name = [Link]("app_name", []);
4.
var variable_name = [Link]("app_name", []);
1.
Which is the correct joint
P(A,B,C,D,E) = P(A)P(B)P(C|A)P(D|A,B,C)P(E|D)
distribution for the
following Bayesian net?
2.
P(A,B,C,D,E) = P(E)P(C)P(D|E)P(A|C)P(B|D,E)

3.
P(A,B,C,D,E) = P(A)P(B)P(C)P(D)P(E)P(E|A,B,C,D)

4.
P(A,B,C,D,E) = P(A)P(B)P(D|A,B,C)P(E|D)
1.
Which is the following
Reinforcement Learning is computing-heavy and time-consuming, in
statement is true?
particular when the action space is large.
 2.
Realistic environments can have full observability.

3.
Parameters may enhance the speed of learning.

4.
In Reinforcement Learning method learning decision is independent
1.
import
Which keyword is used 2.
to make properties and module
methods available 3.
outside the module file? exports
4.
require
1.
[Link]()
2.
Which method appends
[Link]()
specified content to a
3.
file.
[Link]()
4.
None of the above
1.
createServer()
2.
getServer()
3.
Which method to create putServer()
an HTTP server? 4.
setServer()

Reason:

createServer() method turns your computer into an HTTP server. The

http. createServer() method creates an HTTP Server object
1.
Assumption, Association, Learning
2.
Which of the following
The investigation, Strategy, Coding
framework activities are
3.
carried out in Adaptive
Requirements gathering, Adaptive cycle planning, Iterative
Software Development
development
(ASD)?
4.
Process design, Prototyping, Testing
 Reason:

ASD -> 3 Framework activities are speculation, collaboration, learning

1.
Which of the following Booth’s Algorithm
algorithms is most 2.
suitable for the Modified Booth’s algorithm
multiplication of the 3.
numbers, 00111110 and Sign Magnitude algorithm
1110? 4.
Normal binary multiplication
1.
Regression
Which of the following 2.
are common classes of Classification
problems in machine 3.
learning? Clustering
4.
All of the above
1.
background-image-source
2.
background-image
3.
border-image-source
4.
border-image

Which of the following Reason:

CSS property can be used
to set the image as a
border instead of the
border style?

1.
static
Which of the following
2.
CSS property controls
position
how an element is
3.
positioned?
fix
4.
 set

Reason:

Controls how an element is positioned. When set to absolute or fixed, the

element is removed completely from the normal flow of the document.
When set to relative, the element is moved relative to its position in the
normal flow, but a space is left where it would normally have been
1.
border-collapse
2.
Which of the following border-width
CSS property defines the 3.
different properties of all padding
four sides of an element’s 4.
border in a single Border
declaration?
Reason:

The border-width property sets the width of an element’s four borders.

This property can have from one to four values.
1.
table:border
2.
table
3.
Which of the following border
CSS property is used to 4.
specify table borders in set: border
CSS?+
Reason:

table, th, td {
border: 1px solid;
}

1.
font-size
2.
Which of the following
text-size
CSS property sets the
3.
font size of text?
text
4.
size
1.
Which of the following set-shadow
CSS property sets the 2.
shadow for a box box-shadow
element? 3.
shadow
 4.
canvas-shadow

Reason:
The box-shadow CSS property adds shadow effects around an
element's frame.
1.
<ol>
2.
Which of the following
<ul>
HTML tag is used to
3.
create an unordered list?
<li>
4.
<uo>
1.
JavaScript is an Object-Based language
2.
JavaScript is Assembly-language
3.
JavaScript is an Object-Oriented language
Which of the following is 4.
correct about JavaScript? JavaScript is a High-level language
Reason:

any programming language that uses the idea of encapsulating state and
operations inside objects. Object-based languages need not support
inheritance or subtyping, but those that do are also termed object-
oriented.
1.
<track>
2.
Which of the following is <video>
not a HTML5 tag? 3.
<slider>
4.
<source>
1.
Missing of Bracket
2.
Which of the following is
Division by zero
not an error in
3.
JavaScript?
Syntax error
4.
Missing of semicolons
Which of the following is 1.
not the element alignment
associated with the 2.
HTML table layout? color
 3.
size
4.
spanning

Reason:

color is not the element associated with the html table layout.
1.
margin
2.
Which of the following is
color
not the property of the
3.
CSS box model?
width
4.
height
1.
Wannacry
2.
ILOVEYOU worm
3.
Which of the following is Morris worm
the first computer 4.
WORM? Stuxnet

Reason:

The Morris worm was released in 1988 and is widely considered

the first computer worm. However, it is better characterized as
the first worm to propagate widely on the then-nascent internet.
1.
Docker Hub
2.
Which of the following is
Docker Cloud
the native clustering for
3.
Docker?
Docker Swarm
4.
Docker Compose
1.
Web server
2.
Which of the following is
Web network
used to read an HTML
3.
page and render it?
Web browser
4.
Web matrix
Which of the following 1.
machine learning Classification
techniques helps in 2.
detecting the outliers in Clustering
data? 3.
Anomaly detection
4.
All of the above

Reason:

The machine learning algorithm which helps in detecting the outliers is

known as anomaly detection.
1.
Managerial risks
2.
Technology risks
Which of the following
3.
risks are derived from the
Estimation risks
software or hardware
4.
technologies that are
Organizational risks
used to develop the
system?
Reason:

The risks associated with technology might affect the product

development
1.
<textarea> </textarea>
2.
Which of the following
<text></text>
tag is used to create a text
3.
area in HTML Form?
<input type=”text” />
4.
<input type=”textarea” />
1.
(10|6)
2.
Which of the following (false && true)
expressions is illegal?
3.
bool (x) = (bool)10
4.
float y = 12.67;
1.
Which of the following
text-align
property is used to align
2.
the text in a table?
align
a)
3.
b)
text
c)
4.
d)
align-text
 1.
<h2>
Which of the following 2.
tag is used for inserting <h1>
the largest heading in 3.
HTML? <h6>
4.
<h4>
1.
merge sort
2.
insertion sort
3.
Which of the following linear search
algorithm can’t be used 4.
with linked list? binary search

Reason:

Binary search is not feasible to implement in a linked list since we cannot

access an element at a random location directly from a linked list.
1.
Hibernate Query Language
2.
Which of the following
Clean Readable Code
are advantages of
3.
Hibernate?
Exception Handling
4.
All of the above
Which of the following
are correct ways to
1.
increase security in Fog
I only
computing?
2.
Both I and II
3.
Both II and III
I. Decentralization
4.
II. Network
I, II and III
Segmentation
III. Edge Security
1.
Which of the following I only
are disadvantages of fog 2.
computing? Both I and II
3.
I. Congestion may Both II and III
occur between the host 4.
I, II and III
and the fog node due to
increased traffic

II. Power consumption

increases when another
layer is placed between
the host and the cloud.
II. Scheduling tasks
between host and fog
nodes along with fog
nodes and the cloud is
simple.
1.
Single Page Applications
2.
which of the following
JSON APIs based Applications
areas, [Link] is not
3.
advised to be used?
CPU intensive applications
4.
Data Intensive Realtime Applications (DIRT)
1.
Which of the following [Link]()
code retrieves session ID
specified by the client in 2.
programming using [Link]()
Servlets?(Objects in the
options closely represent 3.
the classes from which [Link]()
they are created)
4.
[Link]()
1.
$ npm --version
2.
Which of the following
$ npm getVersion
command will show
3.
version of Node?
$ node getVersion
4.
$ node --version
1.
Which of the following 2-phase locking protocol
concurrency control 2.
protocols ensures both Strict 2PL
conflict serializability 3.
and freedom from Timestamp
deadlock? 4.
Both (a) and (c)
Which of the following
1. text-decoration: bold 2. font-weight: bold 3. font-style: bold 4. text-
CSS property is used to
align: bold
make the text bold?
Which of the following
CSS selector is used to
specify a rule to bind a 1. tag [Link] [Link] [Link] class and tag
particular unique
element?
Which of the following
CSS selectors are used to
1. tag [Link] 3. class [Link] class and tag
specify a group of
elements?
Which of the following
CSS style property is
[Link] [Link] [Link]-style 4.@font-face
used to specify an italic
text?
1.
Equivalent partitioning
2.
Environment partitioning
3.
Which of the following
Procedure division
divides the input domain
4.
into classes containing
Compilation division
data?
Reason:

Equivalent partitioning divides the input domain into classes

containing data.
1.
singly linked list
Which of the following
2.
implementations is ideal
doubly linked list
for returning the element
3.
at a given position from a
array implementation
list?
4.
doubly circular linked list
1.
Choose k to be the smallest value so that at least 99% of the variance
is retained
Which of the following is
a reasonable way to
select the number of 2.
principal components k? Choose k to be the smallest value so that at least 1% of the variance is
retained

3.
 Choose k to be the largest value so that at least 99% of the variance is
retained
4.
Choose k to be the largest value so that at least 1% of the variance is
retained
1.
security
2.
Which of the following is
data storage
among the primary uses
3.
of cloud computing?
data privacy
4.
operational cost
1.
exponential
Which of the following is 2.
an intractable algorithm numeric raised by variable(N^...)
functionalities? 3.
variable raised by number (2^...)
4.
All of these
1.
Ensures serializability
2.
Prevents Deadlock
3.
Detects Deadlock
4.
Which of the following is Recover from Deadlock
correct with respect to
the Two-phase commit
protocol? Reason:

The two phase commit protocol is a distributed algorithm which lets all
sites in a distributed system agree to commit or rollback a transaction
based upon consensus of all participating [Link] any database server is
unable to commit its portion of the transaction, all database servers
participating in the transaction must be prevented from committing
their work.
It ensures serializability but does not ensures freedom from deadlock.
1.
A good way to initialize K-means is to select K (distinct) examples
from the training set and set the cluster centroids equal to these
Which of the following is selected examples.
false about partitional 2.
clustering approach? For some datasets, the "right" or "correct" value of K (the number of
clusters) can be ambiguous, and hard even for a human expert
looking carefully at the data to decide.
3.
 If we are worried about K-means getting stuck in bad local optima,
one way to ameliorate (reduce) this problem is if we try using
multiple random initializations.
4.
Once an example has been assigned to a particular centroid, it will
never be reassigned to another centroid.
1.
[Link] can create, open, read, write, delete, and close files on the
server
2.
[Link] can generate static page content
Which of the following is 3.
false? [Link] can collect form data
4.
[Link] can add, delete, modify data in your database

Reason:
[Link] can generate dynamic page content.
1.
definiteness
Which of the following is 2.
not a necessary feature of finiteness
an algorithm, as per the 3.
definition? correctness
4.
efficiency
1.
Not null
2.
Unique
3.
Which of the following is Check predicate
not an Integrity 4.
constraint ? Positive

Reason:

Positive is a value and not a constraint.

1.
Type of the cluster
Which of the following is
not required by K-means 2.
clustering? Defined distance metric

3.
Number of clusters
4.
Initial guess as to cluster centroids
 1.
The process object is an instance of EventEmitter.

2.
Which of the following is
process emits exit event when process is about to exit.
true about process global
3.
object?
process emits uncaughtException when when an exception bubbles
all the way back to the event loop.
4.
All of the above
1.
The subproblems cannot be overlapped
2.
The subproblems can be overlapped
3.
The subproblems need not be of the same type as the main problem
4.
Which of the following is
The number of subproblems must be even
true in divide and
conquer strategy
Reason:

1.

Every subset of a regular set is regular

2.
Every finite subset of a non-regular set is regular
Which of the following is
3.
TRUE?
The union of two non-regular sets is not regular

4.
Infinite union of finite sets is regular
1.
Slave Node
2.
Which of the following is Master Node
used to schedules jobs 3.
and tracks the assign jobs Job Tracker
to Task tracker? 4.
Task Tracker

Reason:
JobTracker : Schedules jobs and tracks the assign jobs to Task tracker.
 1.
stack
Which of the following is 2.
useful in traversing a queue
given graph by breadth 3.
first search? set
4.
lst
1.
Make the new node point to the head pointer of the current list
2.
Which of the following is
Create a new node using dynamic memory allocation
wrong while inserting a
3.
node in the beginning of
Make the head pointer of the current list point to the new node
list?
4.
Make the next pointer of the new node point to current head of the
list
1.
[Link]
Which of the following 2.
package contains servlet [Link]
classes? 3.
[Link]
4.
[Link]
1.
Clique
2.
Vertex Cover
3.
2-SAT
4.
Which of the following Circuit Sat
problem is not in NP
Reason:

The existence of a path from one node to another can be

determined by trivial graph traversal algorithms like BREADTH
FIRST SEARCH or DEPTH FIRST SEARCH. Both BFS and
DFS take polynomial time of O(V + E) time, where V = #vertices
and E = #edges in G. Hence proved that 2SAT is in P.
1.
(a+b+aa+bb+aba+bba)*
2.
Which of the following
(aaa+bbb)*
regular expression
3.
denotes a language
((a+b) (a+b) (a+b))*
comprising of all
4.
possible strings over
(aaa+ab+a)+(bbb+bb+a)
{a,b} of length n where n
is a multiple of 3?

1.
r(*) =r*
2.

(r * s*)*= (r+s) *
Which of the following
regular expression
3.
identity is true?
(r+s) *=r*+s*
4.

r*s*=r*+s*
1.
Best-first search
Which of the following 2.
search algorithm is Depth-first search
optimal and complete 3.
when h(n) is consistent Best-first search and depth first search
4.
A* search
1.
Best-first search
2.
Depth-first search
3.
Meta level state space
4.
Which of the following
Greedy Best first search
search method is helpful
to find better by learning

1.
Which of the following Data Encryption Standard is not a Feistel cipher
statement is correct? 2.
Data Encryption Standard is a Feistel cipher
 3.
Advanced Encryption Standard is not a Feistel cipher
4.
Statements (b) and (c).
1.
For Data Encryption Standard, data are encrypted in 64-bit blocks
using a 56-bit key
2.
Data Encryption Standard is reasonably efficient in software and very
fast and small in hardware
Which of the following 3.
statement is not correct? For Data Encryption Standard, data are encrypted in 56-bit blocks
using a 66-bit key
4.
By encrypting with Data Encryption Standard (DES) three times in a
row, triple DES (3DES) is created.

64 – bit block means 56 – bit key

1.
Advanced Encryption Standard is a byte-oriented cipher
2.
Advanced Encryption Standard is a bit-oriented structure
Which of the following 3.
statement is not correct? Data Encryption Standard is a bit-oriented structure
4.
Both (a) and (c)

AES is byte-oriented, while DES is bit-oriented.

1.
In Data Encryption Standard, the S-Boxes are essentially random
tables that fulfil certain properties.
2.
Which of the following In Advanced Encryption Standard, the S-Boxes have a strong
statement is not correct? algebraic structure.
3.
Statement (a) is true, but (b) is false
4.
Both Statements (a) and (b) are true.
1.
A firewall provides a location for monitoring security-related events.
2.
Audits and alarms can be implemented on the firewall system.
Which of the following 3.
statement is not correct? A firewall can serve as the platform for IPsec
4.
The firewall may protect fully against internal threats, such as a
disgruntled employee or an employee who unwittingly cooperates
with an external attacker.
 1.

NFA is more powerful than DFA

2.

DFA is more powerful than NFA

3.
NFA and DFA have equal power
Which of the following
statement is true?
4.

All the are true

Which of the following

statement(s) is/are
correct?

(a) The output of a 1.

scanner is groups of Only (b)
characters. 2.
Both (b) and (c)
(b) Total number of 3.
tokens in printf("i=%d, (a), (b), and (c)
&i=%x,j=%d", i, &I,j); 4.
are 12. (a), (b)

(c) Symbol table can be

implemented by using
binary search tree
1.
Attributes are statistically dependent of one another given the class
value.

Which of the following

statements about Naive 2.
Bayes is incorrect? Attributes are equally important.

3.
Attributes are statistically independent of one another given the class
value.
 4.
Attributes can be nominal or numeric
1.
Detecting fraudulent credit card transactions
Which of the following
2.
tasks can be best solved
Predicting the amount of rainfall based on various cues
using Clustering.
3.
Training a robot to solve a maze
4.
Estimating future sales for each of these products.
1.
asymptotically equal
2.
asymptotically less than equal
Which of the identity is 3.
true related to Big theta asymptotically less than
notation? 4.
asymptotically greater than

Reason:

It is like (==)
meaning the rate of growth is equal to a specified value.
1.
Left outer join
Which of the join 2.
operations do not Right outer join
preserve non matched 3.
tuples? Inner join
4.
Natural join
1.
transitivity
Which of the property 2.
fail in case of time reflexivity
complexity? 3.
Symmetry
4.
None of these
1.
Recurrence relation for number of comparisons in binary search is
T(n) = T(n/2)+2
Which of the statement is 2.
in correct? Recurrence realtion of merge sort is T(n) = 2T(n/2)+O(n)
3.
Recurrence of quick sort in worst case is T(n)
4.
 3-way merge sort is T(n)=3T(n/3)+O(n)
1.
FileStream
Which of these class
2.
contains the methods
FileInputStream
used to write to a file in
3.
Java?
BufferedOutputStream
4.
FileBufferStream
1.
IOException
2.
FileException
Which of these exception 3.
is thrown by close() and FileNotFoundException
read() methods in Java? 4.
FileInputOutputException

Reason:

Both close() and read() method throw IOException.

1.
super
2.
constant
Which of these keywords 3.
can be used to prevent class
inheritance of a class in 4.
Java? final

Reason:

To prevent inheritance, use the keyword "final" when creating the

class.
1.
try
Which of these keywords 2.
is used to manually throw finally
an exception in Java? 3.
throw
4.
catch
1.
try
Which of these keywords
2.
is used to monitor
finally
exceptions in Java?
3.
throw
4.
 catch
1.
get()
2.
read()
Which of these methods 3.
are used to read in from scan()
file in Java? 4.
readFileInput()

Reason:
Each time read() is called, it reads a single byte from the file and
returns the byte as an integer value. read() returns -1 when the end of
the file is encountered.
1.
put()
Which of these methods 2.
is used to write() into a putFile()
file in Java? 3.
write()
4.
writeFile()
1.
try
Which of these words is 2.
not a part of exception finally
handling in Java? 3.
thrown
4.
catch
1.
Low depth
2.
High fan-out
Which one of the 3.
following characteristics Large width
of a design indicates a 4.
poor design? High fan-in

Reason:

In general, the higher the fan-out of an object, the poorer is the overall
system design.
1.
Which one among the
Load / Ingest the Source Data
following does not
2.
belong to the primary
Record the data
steps of cloning
3.
workflow.
Clone / Replicate the Data
 4.
Provision of the Data to DevTest Environments
1.
a) After releasing any resource, never request it again.
2.
a) Before requesting a new resource, all existing resources must be
released.
3.
a) Never request a lower-numbered resource than the one that was
Which one is not covered previously requested.
under an acceptable 4.
deadlock prevention Before execution, the request and all necessary resources are
policy? allocated

Reason:

In deadlock prevention scheme, The operating system requests a

resource after releasing the resource held by him, if needed. This
is not a condition that a process cannot request a resource.
1.
Capacity Constraint
2.
Skew Symmetry
3.
Which one is not part of Flow conservation
conditions for network 4.
flow? Capacity flow

Reason:

There are three requirements for the path to be a flow - capacity

constraints, skew symmetry, and the flow conservation
1.
pod
2.
node
3.
Which one of the
etcd
following can be
4.
considered as the primary
None of them
data store of Kubernetes?
Reason:

The primary data store of Kubernetes is etcd, which is

responsible for storing all Kubernetes cluster data
Which one of the 1.
following is the contract SAL
for performance 2.
negotiated between you SLA
and a service provider? 3.
SAS
4.
SSL
1.
[Link]
Which one of the
2.
following is not the
[Link]
function of Facebook
3.
Graph API for dealing
[Link] – does update
with comments?
4.
[Link]
Which one of the
following is/are the
step(s) to be followed
while integrating an API 1.
to app? only I
2.
I) Hire an API Both I and III
integration expert 3.
Both II and III
II) Get API keys and 4.
authorization token I, II and III

III) Integrate API

framework for the App
1.

The set of all strings containing the substring 00.

2.
Which one of the
The set of all strings containing at most two 0s.
following languages over
alphabet {0,1} is
3.
described by the regular
expression:
The set of all strings containing at least two 0s
(0+1)*0(0+1)*0(0+1)*?

4.

The set of all strings that begin and end with either 0 or 1.
1.
Which one of the
following regular 0*(11*0)*
expressions over {0,1}
denotes the set of all 2.
0*1010*
strings not containing 3.
100 as a substring? 0*(10+1)*
4.
0*1*01
1.
Jarvis
2.
Which one takes lesser
Graham
time in the construction
3.
of convex hull?
closest pair
4.
All of these
1.
Depth-first search
Which search is 2.
implemented with an Breadth-first search
empty first-in-first-out 3.
queue Bidirectional search
4.
Unidirectional Search
1.
Uninformed search
2.
Informed search
3.
Simple reflex search
Which search strategy is 4.
also called as blind Simple Search
search

Reason:

n blind search, We can search the states without having

any additional information. So uninformed search method
is blind search.
 1.
pseudo
2.
Weakly
Which specific 3.
polynomial selection will Strongly
be better while selecting 4.
the augmentation path in All of these
case of max flow
algorithm?
Reason:

Ford-Fulkerson algorithm -> method of choosing the augmented

path is strongly polynomial
1.
<input>
2.
Which tag is used to
<select>
create a dropdown in
3.
HTML Form?
<text>
4.
<drop>
1.
Query languages and utilities
2.
Which two files are used
DML and query language
during operation of the
3.
DBMS ?
Data dictionary and transaction log
4.
Data dictionary and query language
Which type of WORM
works by encrypting data 1.
on the victim's system? Internet worms
Perpetrators can use this 2.
type of worm Cryptoworms
in ransomware attacks, 3.
following up with the Email worms
victim and demanding 4.
payment in exchange for file sharing worms
a key to decrypt the files.
1.
BCNF is stricter than 3 NF
Which-one of the 2.
following statements Lossless, dependency -preserving decomposition into 3 NF is always
about normal forms is possible
FALSE? 3.
Loss less, dependency - preserving decomposition into BCNF is
always possible
 4.
Any relation with two attributes is BCNF

Reason:

Lossless, dependency preserving decomposition is possible in certain cases

only. It is important to note that BCNF is not dependency preserving in all
cases but in some cases only.
1.
best
While analyzing time
2.
complexity which of the
Worse
following case will not
3.
be considered?
Null
4.
Average
1.
ID
While using the direct
2.
mapping technique, in a
word
16 bit system the higher
3.
order 5 bits are used for
Tag
________
4.
Block
While using the
following statement

FILE
1.
*fp=fopen(“file.c”,”r”);
Print error
2.
If file.c does not exist, it
Will open new file
will
3.
return NULL
a.
4.
None of the above
b.

c.

1.
Both Compiling & Interpreting the JavaScript
2.
Why JavaScript Engine Parsing the javascript
is needed? 3.
Interpreting the JavaScript
4.
Compiling the JavaScript
 1.
PaaS
2.
Windows Azure and
IaaS
[Link] are example
3.
of?
SaaS
4.
NaaS
1.
ignored

2.
With Bayes classifier,
treated as equal compares
missing data items are
3.
treated as unequal compares
4.
replaced with a default value
1.
An algorithm to search for an element in a singly linked list requires
O(n) operations in the worst case
2.
With regard to linked An algorithm for deleting the first element in a singly linked list
lists, which of the requires O(n) operations in the worst case.
following statements is 3.
false? An algorithm for finding the maximum value in a circular linked list
requires O(n) operations in the worst case.
4.
An algorithm for deleting the middle element of a circular linked list
requires O(n) operations in the worst case.
1.
<div ng-app="" ng-init="Name:'Alex';Age:21">
Write a statement with 2.
<div> element to <div ng-app="" ng-init="Name:'Alex',Age:21">
initialize two variables 3.
(name and age)? <div ng-app="" ng-init="Name='Alex',Age=21">
4.
<div ng-app="" ng-init="Name='Alex';Age=21">
Write statement to print i
1.
and j value
s=show;
2.
#include <stdio.h>
show();
3.
void show(int, float);
show=s;
4.
void main()
None of the above
{

void (*s) (int, float);

--------------------------

(*s)(1,3.0);}

void show(int i, float j )

printf("%d %.2f",i,j);}

a.

b.

c.
1.
Virtual memory
2.
Write Through technique
Main memory
is used in which memory
3.
for updating the data
Auxiliary memory
4.
Cache memory
1.
Notify
You can implement the 2.
interface to send e-mail Error
notifications in case of 3.
errors. ErrorNotifier
4.
None of the mentioned
1.
You can't create multiple True
containers from the same 2.
image in docker. False
3. 4.
1.
Zen File System
2.
ZFS stands for
Zetta File system
_____________
3.
Zettabyte File System
4.
 Zero File system
“Imagine that you were
recently hired as a
software engineer to a
company that specializes
in aircraft navigation
control software. While
orientating yourselves to
the company’s work 1.
practices, you observe You should immediately resign from the company and file a
that they in fact do not complaint with the relevant standard institution
conduct a few tests that 2.
they should in order You should do nothing and let the matter slide
comply with the relevant 3.
safety standard. When Although you are new to the company, and you hardly know anything
you inquire about this about the internal processes and politics, you should insist on
from the project company changing its work practices immediately; failing which you
manager, he dismisses it threaten to report the matter
saying that those tests 4.
unnecessary (and takes Since you are new to the company, and you are unfamiliar with the
an unreasonably long internal processes and politics, you should first find-out more about
time to conduct, as well issue and its background
as being superfluous) and
that they have managed
with the other so long,
without any problems.”

1.
DML Compiler
………….. processes the 2.
DDL statements into a DDL Interpreter
set of table containing 3.
meta data. Query Optimizer
4.
Data Dictionary Manager
Which of the following is
NOT an advantage of 1 Smaller sizes of executable files
using shared, 2. Lesser overall page fault rate in the system
dynamically linked 3. Faster program startup
libraries as opposed to 4. Existing programs need not be re-linked to take advantage of
using statically linked newer versions of libraries
libraries ?