karthik

Comprehensive Question Preview

Search:

Questions Choices

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.

26

2.

3.

4.

12

1.

(41,17,209)

2.
Questions Choices

(41,17,697)

3.

(41,17,49)

4.

(41,17,640)

1.

1411

2.

1088

3.

1112

4.

3262

1.

2.

3.

4.

1.

2.

3.
Questions Choices

4.

1.

2.

3.

4.

1.

2.

3.

4.

1.

3 CNF-Sat

2.

4 CNF-Sat

3.
Questions Choices

5 CNF-Sat

4.

2 CNF-Sat

1.Query objects

2.

A ___________ represents a unit of work with the database and Session

most of the RDBMS supports transaction functionality 3.

Criteria objects

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

 1.

1.50
#include <stdio.h>
2.
int main()
1.00
{ printf("Hello World");
3.
printf("%.2f",(float)((int)3.5/2.0));
Compiler Error
return 0;}
4.

0.00

1.

#include <stdio.h> 1.50

int main() 2.

{ printf("Hello World"); 1.00

printf("%.2f",((int)3.5/2.0)); 3.

return 0;} Compiler Error

4.

0.00

#include<stdio.h>

void main()

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

} 3.

00000

a. 4.

b. 12345

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

2.

Statement 1: Private Cloud may 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

4.Both 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)

Ensuring isolation property is the responsibility of the 1.

 Recovery-management
component of the DBMS

2.

Concurrency-control
component of the DBMS

3.

Transaction-management
component of the DBMS

4.

Buffer management
component in DBMS

Questions Choices

1.

Framework activities

2.

Umbrella activities
__________ are applied throughout the software process.
3.

Planning activities

4.

Construction activities

1.

Masquerade

2.

A threat action that interrupts delivery of system services Falsification

by hindering system operation is known as ____________. 3.

Repudiation

4.

Obstruction
Questions Choices

1.

DDA

2.

An interface that provides I/O transfer of data directly Serial interface

to and from the memory unit and peripheral is termed a 3.

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 required block is not Write latency

present in the cache then ______ occurs. 3.

Write hit

4.

Write delay

1.

Finite automata --------------- memory No auxiliary memory

2.
Questions Choices

Finite

3.

Infinite

4.

none of the choices

1.

Only rear pointer changes

2.
If a queue is implemented using linked list by keeping
track of a front pointer and a rear pointer, which of these Neither of the pointers change
pointers will change during an insertion into a non-empty 3.
queue?
Only front pointer changes

4.

Both of the pointers change

1.

Only I is true

If the running time of algorithm A is Θ(g(n)), then 2.

(I) The worst-case running time of A is O(g(n)) Only II is true

(II) The best case running time of A is Ω(g(n)) 3.

Pick the correct choice both I and II are true

4.

Both I and II are false

1.

Poisson

2.
In Advanced Encryption Standard, _________ arithmetic is
Galois field
used in the Substitution-Box.
3.

Regular

4.
Questions Choices

Normal

1.

Select * from R natural join S

2.

Select * from R cross join S

In SQL the statement select * from R, S is equivalent to
3.

Select * from R union join S

4.

Select * from R inner join S

Questions Choices

1.

Θ(b^n )

2.

Let a, b ∈ R and b > 0. Θ(n^b )

The value of (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 3.
abstraction at
Both Physical and conceptual level

4.

All the 3 Levels ( Physical, Conceptual and View )

Questions Choices

Suppose that a bus

has 16 data lines and 1.
requires 4 cycles of 250
ns each to transfer 1 Megabyte/sec
data. The bandwidth of 2.
this bus would be 2
Megabytes/sec. If the 4 Megabytes/sec
cycle time of the bus 3.
was reduced to 125 ns
and the number of 8 Megabytes/sec
cycles required for
4.
transfer stayed the
same what would the 2 Megabytes/sec
bandwidth of the bus?

The relation scheme

student performance
(name, courseNo,
rollNo, grade) has the
following functional
dependencies: 1.

2 NF

2.3 NF 3.
name, courseNo -->
grade BCNF
Rol INo, courseNo —> 4.
grade
name —> rollNo 4 NF
rollNo —> name

The highest normal form

of this relation scheme
is:

1.

O(n)

2.
The solution of the
recurrence T(n) = T(n − 1) O(n^2 logn)
+ log n is
3.

O(nlogn)

4.
Questions Choices

O(logn)

1.

queue
Which of the following 2.
data structures is most
efficient in terms of both array
space and time to 3.
reverse a string of
characters? linked list

4.

stack

1.

Searching an unsorted list for a given item

Which of the following 2.

operations is performed Inserting a node after the node with a given location
more efficiently by
doubly linked list than by 3.
a singly linked list? Traversing the list to process each node

4.

Deleting a node whose location is given

1.

Informed search

Which of the following 2.

search uses the Depth-first search
problem-specific
knowledge outside the 3.
definition of the problem Breadth-first search

4.

Uninformed search

1.

{a(cd)^nb|n>=1}
(a+b)(cd)*(a+b) denotes
2.
the following set
Questions Choices

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

3.

{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

----------------------- is a 2.
design pattern to SOAP
provide services to other
application through 3.
protocol. Spring MVC

4.

Spring

Showing 31 to 40 of 995 entries

Questions Choices

1.

. Match the following. P-4. Q-1, R-2, S-3

List-I List-II 2.

P. Regular expression 1. Lexical analysis P-1, Q-3, R-4, S-2

Q. Pushdown automata 2. Code generation 3.

R. Dataflow analysis 3. Syntax analysis P-3, Q-4, R-1, S-2

S. Register allocation 4. Code optimization 4.

P-2, Q-1, R-4, S-3

. Relations that are generated from the ER model will 1.

always be in 1NF
Questions Choices

2.

2NF

3.

3NF

4.

4NF

1.

Network protocol

2.

1. SOAP is a format for sending messages and is also Data Transfer Protocol
called as 3.

Communication protocol

4.

None

1.

a. Plain text

2.

1. Which one of the following is not mandatory in a a. Cipher text

symmetric key cryptosystem? 3.

a. Secret key

4.

a. Session key

1.

Struts Services

2.
1. __________is used to convert your application into
Web Services
Web-Application.
3.

Java Service

4.
Questions Choices

Browser Action

1.

16-bit

2.
1. In Data Encryption Standard, the encryption 24-bit
algorithm generates 16 different ____ subkeys, one for
each of the 16 encryption rounds 3.

32-bit

4.

48-bit

1.

That a bean should be created for the

class

2.

That a bean should not be created for

the class
1. @Component annotation on 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

2.
1. _________________ web services make use of SOAP
HTTP protocol as a medium of communication
between client and server. 3.

Spring MVC

4.

Spring
Questions Choices

1.

restrict-url

2.

1. Element used to restrict access to a particular intercept-url

URL. 3.

intercept-restrict

4.

none of these

1.

1. Match the following where ‘n’ is the number of 1-b, 2-c,3-a,4-d

elements in the list. 2.
1. Sorting a. O(1) 1-c,2-b,3-a,4-d
2. Binary search b. O(nlogn) 3.
3. Linear search c. O(logn) 1-b,2-c,3-d, 4-a
4. Search in a hash table d. O(n) 4.

1-a, 2-c,3-b,4-d

Showing 41 to 50 of 995 entries

Questions Choices

1.

True
1. STATE TRUE / FALSE: The service provider
implements the service and makes it available on 2.
the Internet.
False

3. 4.

1.

1. The basic Web Services platform is CSS + HTTP

combination of _____ and _______ 2.

XML + HTML
Questions Choices

3.

XML + HTTP

4.

CSS + JAVA

1.

Universal Description, Development and

Integration

2.

Universal Development, Design and

Integration
1. UDDI stands for
3.

Universal Description, Discovery and

Integration

4.

Universal testing, Discovery and

Integration

1. What is the output of the following recursive 1.

function when cal(2,4) is called? Output is 6
int func(int x, int y) 2.
{
if (y==2) Output is 4
return 1; 3.
else
return x * func(x,y-1); Output is 2
} 4.

Output is 5

1.

REST is a web Service Standard

2.
1. Which of the following best describes REST?
REST is a Cloud – native API framework.

3.

REST is a microservices – based protocol.

Questions Choices

4.

REST is an architectural style.

1.

WSDL

2.

1. Which of the following is a component of a UDDI

Web Service architecture? 3.

SOAP

4.

SOAP, WSDL and UDDI

1.

Service Registry

2.
1. Which of the following role of web service Service Provider
architecture implements the service and makes it
available on the Internet? 3.

Service Requestor

4.

none

1.

True

2.

1. A bean can have more than one name using False

multiple id attributes? 3.

May be

4.

Can't say

1.
1. Convex hull is defined as the smallest
__________ that encloses all the given points in 2-D Polygon
space.
2.
Questions Choices

Rectangle

3.

Ellipse

4.

Circle

1. Find the time complexity of the code segment

below.

function daa(A, n, T)

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

return m

return unsuccessful

Showing 51 to 60 of 995 entries

Previous1…567…100Next

Questions Choices

1.

1. Given the following three points in 2D-space, Clockwise

find the orientation of P3 P5 with P4 2.

Counter Clockwise
Questions Choices

3.

Collinear

4.

Cannot be determined.

1.

P and NP are disjoint

2.

1. Identify the relationship between P and NP P is a subset of NP

complexity classes of algorithms. 3.

NP is a subset of P

4.

P and NP are equal

1.

1. Identify which graph below is a bipartite

graph. 2.

3.
Questions Choices

4.

1. In the network flow graph, the flow edges are

marked in red. Identify the path from the list
below which is a valid augmenting path when
“Ford Fulkerson algorithm for finding max flow” is 1.
applied. s-A-t

2.

s-B-t

3.

s-B-A-t

4.

s-B-A-B-t

1. Match the following with respect to a network 1.

flow graph.
1-c,2-b,3-a, 4-d
1. Flow conservation constraint a. Source and sink
2.
nodes should not be in the same set
1-b,2-d, 3-a, 4-c
2. Capacity constraint b. Incoming flow
equals the outgoing flow from a vertex 3.
Questions Choices

3. s-t cut c. The edges must have 1-b, 2-d,3-c, 4-a

either capacity or flow greater than 0
4.
4. Augmenting path d. Flow cannot
1-a, 2-b, 3-d, 4-c
exceed the capacity over an edge

1.
1. Match the following.
1-d, 2-c, 3-a, 4-b
1.Divide and conquer a. overlapping
subproblems 2.

2. Dynamic programming b. state space tree 1-d, 2-a, 3-b, 4-c

3. Backtracking c. branching decision 3.

in a state space tree 1-a, 2-d, 3-c, 4-b
4. Branch and bound d. disjoint 4.
subproblems
1-d, 2-a, 3-c, 4-b

1.

O(nn)

2.

1. Pick out one from below that does not come O(n!)
under complexity class “NP” 3.

O(n3)

4.

O(2n)

1.

O(nlogn)

2.

1. Pick out one from below that does not come O(n3)
under complexity class “P”. 3.

O(n3logn)

4.

O(2n)

1. Pick out the algorithm whose time complexity

1.
is not O(n3)
Questions Choices

Matrix multiplication

2.

Floyd’s algorithm

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 which is false. determined

3.

The deterministic algorithms are efficient

4.

The nondeterministic algorithms are

efficient

Showing 61 to 70 of 995 entries

Questions Choices

1.

1. Polynomial reduction is transitive

implies the following is true where L1 and L2 2.
are unknown problems. Pick out the
correct option.

3.
Questions Choices

4.

1.

2.

1. The relationship between NP, NP-Hard

and NP-Complete (NPC) is the following 3.

4.

1.

Component

2.

Object
1. What is Bean in Spring?
3.

Class

4.

Container

1.

O(nlogn)

1. What is the average time complexity 2.

of randomized quicksort? O(n^2)

3.

O(n^2logn)
Questions Choices

4.

O(n^3)

1.

O(VE)

2.
1. What is the time complexity of
Edmond Karps algorithm where ‘V’ is the O(VE2)
set of vertices and ‘E’ is the number of 3.
edges in the network flow graph.
O(V2E)

4.

O(V2 E2)

1.

Brute force

2.
1. Which algorithm strategy listed below Heuristic
guarantees in producing near optimal
solution with reasonable time complexity? 3.
Approximate

4.

Nondeterministic

1.

static factory method

2.

1. Which of the following method can be default-init method

used to use to instantiate a method? 3.

destroy method

4.

lazy-init method

1.
What is an event in delegation event model
used by Java programming language? An event is an object that describes a state change
in a source
Questions Choices

2.

An event is an object that describes a state change

in processing

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 javax.servlet.Servlet?
3.

concrete class

4.

final class

1.
What will be the effect of the following
Creates a new file “a.txt”
code snippet in Java?

2.

Opens an existing file “a.txt”

3.

Compilation error

4.
Questions Choices

Raises an exception which will not be handled by

the code

Showing 71 to 80 of 995 entries

Questions Choices

1.

request.getParameterNames()

2.

Which of the following code is used to get names response.getParameterNames()

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

Header.getParameterNames()

4.

request.extractParameterNames()

1.

Header.getProtocol()

2.
Which of the following code retrieves name and
version of the protocol in Servlet programming? response.getProtocol()
(Objects in the options closely represent the 3.
classes from which they are created)
request.getProtocol()

4.

request.getNameVersionProtocol()

1.

3. Let f(n) = 2n and g(n) = n^3 + 10. Assume that 10

we write g(n) = O(f(n)) using the standard
2.
definition of big-oh notation. Then the value of n0
is 9

3.
Questions Choices

4.

1.

Starting angle, ending angle, center x , center

y, radius

2.

Ending angle, starting angle, center x , center

51. "arc" function is used to draw an arc with the y, radius
parameter values as in order of 3.

Center x , center y, starting angle, ending

angle, radius

4.

Radius, Center x , center y, starting angle,

ending angle

1.

Dots

2.

Pixels
51. In computer graphics, pictures or graphics
objects are presented as a collection of discrete 3.
picture elements called__________
Coordinates

4.

Points

Find the false statement/s? 1.

(A) There is unique minimal DFA for every regular A and B

language
2.
(B) All non-deterministic Turing machine can’t be
B and C
converted to an equivalent deterministic Turing
machine 3.
(C) All RE is not a CFL A and D
Questions Choices

(D) All subset of a recursively enumerable set is 4.

not recursive
D only

Which of the following statements is false?

1.D ONLY 2.
(A) Every NFA can be converted to an equivalent
DFA A ONLY

(B) Every non-deterministic Turing machine can 3.

be converted to an equivalent deterministic
B ONLY
Turing machine
4.
(C) Every regular language is also a context-free
language C ONLY
(D) Every subset of a recursively enumerable set
is recursive

1.

11

John is asked to make an automaton which 2.

accepts a given string for all the occurrence of 9
‘1001’ in it. How many number of transitions
would John use such that, the string processing 3.
application works? 12

4.

15

1.

.L1= {w | w does not contain the string tr } 2.

L2= {w | w does contain the string tr} 1

Given ∑= {t, r}, The difference of the minimum 3.

number of states required to form L1 and L2? 2

4.

Cannot be said

Consider the following languages: 1.

Questions Choices

L1 = {0^i1^j | i != 2j} Only L3

L2 = {0^i1^j | i = 2j+1} 2.

L3 = {0^i1^j | i = j} Only L3 & L2

L4 = {0^i1^j | i != j} 3.

Which of these is/are context-free: Only L4 & L3

4.

L1, L2, L3, and L4

Showing 81 to 90 of 995 entries

Questions Choices

1.

regular

2.

not context-free but

context sensitive
Consider the language given below:
3.
{a^m b^n C^(m+n) | m, n ≥ 1} It is a ___________ language.
not context-sensitive
but type-0

4.

not regular but

context-free

1.

xyx*y*yyx

2.

Consider the RE for all strings starts with xy and ends with yyx is. xy(xy)*yyx

3.

xy(x+y)*yyx

4.

xyx*y*xyyyx
Questions Choices

1.

a, S + a

For the given grammar 2.

S →S + a | S × a | a a, S + S × a

For a sentence a + a × a, the handles in the right-sentential form of the 3.

reduction are a, a + a and a + a × a

4.

a, S + a and S × a

1.

Precedence of + over
∗ is confirmed

Given the grammar 2.

E→T∗E ∣T Parsing is ambiguous

T→F+T ∣F 3.

F→a∣b Right to left

assessment of ∗ and
Which of the following statements is wrong? + occurs

4.

Parsing is
unambiguous

1.

r≤P≥l

If G is the CFG, r is the total number of rightmost derivations, l is the total 2.

number of leftmost derivations, as well as P refers to the total number of r=P=l
parse trees, then assume that r, l, and P are computed for some given
particular string. Here, for a given ‘G’ CFG and given ‘w’ string, what is the 3.
relation between all three of these? r≥P≤l

4.

r ≥ P =l

If we consider an arbitrary NFA (non-deterministic finite automaton) with 1.

N states in total, the maximum number of states that are there in an
equivalent DFA (minimised) is at least: N!
Questions Choices

2.

2N

3.

2^N

4.

N^2

1.

DFA – 4, NFA – 3

2.

If you consider a regular expression r, in which r = (11 + 111)* over Ʃ = {0, DFA – 3, NFA – 3
1}, then the number of states in minimal DFA and NFA respectively are: 3.

DFA – 3, NFA – 4

4.

DFA – 4, NFA – 4

1.

9 states

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

11 states

4.

15 states

1.

c*ad*

Regular expression for the given DFA is 2.

c*a(d+bc*a)*

3.

c*ad*ba*d*

4.
Questions Choices

c*a(d*+bc*a)*

1.

10

2.

The total number of states to build the given language using DFA: 11

L = {w | w has exactly 2 a’s and at least 2 b’s} 3.

12

4.

13

Showing 91 to 100 of 995 entries

Previous1…91011…100Next

VIT (Vellore Campus)

Comprehensive Question Preview

Search:

Questions Choices

1.

{xϵ {0,1} *|x is all binary

number with even
Which among the following looks similar to the given expression? length}

((0+1). (0+1)) * 2.

{xϵ {0,1} |x is all binary

number with even
length}
Questions Choices

3.

{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 regular expressions are equivalent ? 2.

a. (01)* and (10)* 1 b only

b. x (xx) * and (xx) * x 3.

c. x+ and x+x*+ c only

4.

a , b and c

1.

(m*n* + o*)*

2.
Which one of these given regular expressions isn’t equivalent to this
((mn)* + o*)*
regular expression:
3.
(m + n + o) *
(m*n*o*)*

4.

(m* + n* + o*)*

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

4.

1, 3, 4

L1 is accepted by the NFA, obtained by changing the accepting state

1.
of M to a non-accepting state and vice versa. Which of the following
statements is true? L1 = {0, 1}* – L

2.

L1 = {0, 1}*

3.

L1 ⊆ L

4.

L1=L

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

3.

n+1

4.

2n – 1

1.

L1 is regular but not L2

2.
Let L1 = {w ∈ {0,1}∗ | w has at least as many occurrences of (110)’s as
(011)’s} L2 is regular but not L1

Let L2 = {w ∈ {0,1}∗ | w has at least as many occurrences of (000)’s as 3.

(111)’s} Both L2 and L1 are
Which one of the following is TRUE? regular

4.

Neither L1 nor L2 are

regular

. The number of tokens in the following C code segment is 1.

Questions Choices

1. switch(inputvalue) 27

2. { 2.

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

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

5. } 26

4.

24

1.

i) A → A’a ii) A’ → AB /
Dc iii) D → a / c

2.

i) A → aA’ ii) A’ → AD /
Bc iii) D → c
Consider the grammar A → aAB / aBc / aAc Find the left factoring
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

1.

(a+b)*ba(a+b)*

2.
Consider the regular expression a*(ba*)* which among the following
a+(a+ba)*
designates the identical set as
3.

(a*b)*ba*

4.

(b*a)*b*

Showing 101 to 110 of 995 entries

Questions Choices

The number of tokens in the following C code segment is 1.

34

switch(A) 2.

{ 37

case 1 : m =n*p; break; 3.

case 2 : s =u*v; break; 33

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

} 35

1.
Which one of the following is FALSE?
A only

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

1.
Which one of the following is true for this finite state automaton?
b*ab*ab*

2.

b*a(a+b)*

3.

b*ab*ab*ab*

4.

(a+b)*b

Which one of the following is/are FALSE? 1.

A and B

(A) All non-deterministic finite automata can be converted to equivalent 2.

deterministic finite automata B, C and D
(B) Every NFA can be converted to an equivalent PDA. 3.
Questions Choices

(C) Complement of every context-free language is not recursive. C only

(D) Every nondeterministic Push down automata can’t be converted to 4.

an equivalent deterministic Push down automata.
D only

1.

0.5, 0.3, 0.2

0.4, 0.2, 0.2

0.8

2.

0.5, 0.3
1. Apply approximation algorithm that applies first fit 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

2.Private

VMware is a ---------- cloud deployment model? 3.

Dedicated

4.

Hybrid

1.

Cloud vendors offer PaaS solutions , not in the form of iPaaS

2.
Questions Choices

mPaaS

3.

cPaaS

4.

ePaaS

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 cloud
s

1.

World wide web

2.

Organize your
Desktop Systems

3.
Cloud computing can be defined as
Computing resource
that can be accessed
on demand

4.

A method that
creates a pool of
similar resources

Which of the following is an example of Private cloud? 1.

Questions Choices

IBM Smart cloud

2.

Amazon EC2

3.

Amazon VPC

4.

Google App Engine

Showing 111 to 120 of 995 entries

Questions Choices

1.

A, B & C
Why cloud servers ?
2.
A. Integration
A, C & D
B. Scalability
3.
C. Cost effectiveness
B, C & D
D. Billing
4.

1.

Unit that manages the performance, use, and

delivery of cloud services

2.

Mediator within cloud service providers and

cloud consumers
Cloud carrier is a
3.

Conduct independent assessment of cloud

services, security, performance

4.

The end-user who browses or utilizes the

services
Questions Choices

1.

PaaS

2.

SaaS
Code development is -------------- service
3.

FaaS

4.

IaaS

1.

On-demand Self Service

The NIST Characteristics of the Cloud 2.

doesn’t include Resource grouping

3.Scalability 4.

Elasticity

1.

SaaS

2.

Which of the following is google app engine NaaS

implementation? 3.

IaaS

4.

PaaS

1.

Cloud Provider

2.
For additional value-added services from
the cloud, the consumer needs to Cloud Auditor
communicate --------
3.

Cloud Broker

4.
Questions Choices

Cloud Carrier

1.

IaaS

2.

In which of the following service models the NaaS

hardware is virtualized in the cloud? 3.

PaaS

4.

SaaS

1.

Integrate applications and data across

multiple clouds

2.

Point out the wrong statement about Cloud Migrate existing on-premises workloads
solutions 3.

Traditional infrastructure among existing

application

4.

Open and secure public platform for business

1.

Interoperability & Interoperability

2.

Intermediation & Auditing

1. Role of a cloud provider is / are
3.

Resource abstraction & Interoperability

4.

Auditing & Resource abstraction

1.
1. Who is the father of cloud computing?
Sharon B. Codd
Questions Choices

2.

Edgar Frank Codd

3.

J.C.R. Licklider

4.

Charles Bachman

Showing 121 to 130 of 995 entries

Questions Choices

1.

2 pairs, 1 Quad, 0 Octet

2.

1. The K-Map for following function will have 2 pairs, 2 Quad, 1 Octet
F(w,x,y,z) = ∑(0,1,2,4,5,6,8,9,12,13,14) 3.

1 pair, 2 Quad, 1 Octet

4.

0 pair, 2 Quad, 1 Octet

1.

DeMorgan’s Theorem

2.
1. The pair of following statements represents Duality
(xy)’=x’ + y’; (x+y)’=x’y’
(x+y’)’=x’ + y; (x+y’)=x’y 3.

Inversion

4.

Both ‘a’ an ‘b’

1.
1. Which of the following is used for storing 1 bit digital
NAND gate
data
2.
Questions Choices

NOR Gate

3.

Flip Flop

4.

Register

1.

X + X Y =X

2.

X( X +Y) = XY
1. Which of the following statement is not correct?
3.

X+XY = X

4.

ZX + Z X Y = ZX +ZY

1.

the variable value.

2.

When applied to a variable, what does the unary & the variable address.
operator yield?
3.

the variable format.

4.

the variable right value.

1.

Only one value

2.

Maximum of two values

How many values can a C Function return at a time.?
3.

Maximum of three values

4.

Maximum of 8 values
Questions Choices

1.

an address value represented in

hexadecimal.

2.

an address value represented in

Pointer variable may be assigned_______. octal.

3.

the address of another variable.

4.

an address value represented in

binary.

1.

7) Choose correct statement about C array pointers. I and II only

I. You can compare two array elements with *p == *(p+i) 2.

II. You can compare two pointers with p1==p2. II and III only

III. Accessing out of bounds index element is valid and it 3.

returns a garbage value. IV only
IV. You cannot add the pointers 4.

I, II and III only

7) Find the output of the program:

1.
#include<stdio.h>
10
#include<stdlib.h>
2.

it will print the address stored in ptr1

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

*ptr2 = free(ptr1);
Questions Choices

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

return 0;

7) Find the output of the program:

#include<stdio.h>

#include<stdlib.h>

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

free(ptr1);

return 0;

Showing 131 to 140 of 995 entries

Questions Choices

7) In this program the allocated memory block can 1.

store int only

2.
Questions Choices

#include<stdio.h> float only

#include<stdlib.h> 3.

string only

int main() 4.

{ int and float both

int *ptr;

ptr = malloc(10);

return 0;

7) This program will allocate the memory of ___ bytes

for pointer “ptr”.

1.
#include<stdio.h>
2
#include<stdlib.h>
2.

4
int main()
3.
{
8
int *ptr;
4.
ptr = (int*)malloc(sizeof(int)*4);
16
ptr = realloc(ptr,sizeof(int)*2);

return 0;

1.

Change the location of memory

allocated by malloc() or calloc().

7) What is the functionality of realloc() function? 2.

Reallocates memory deleted by

free() function.

3.
Questions Choices

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>
1.
#include<stdlib.h>
0

2.
int main()
-1
{
3.
int *ptr;
garbage value
ptr = (int *)calloc(1,sizeof(int));
4.
if (ptr != 0)
2
printf("%d\n",*ptr);

return 0;

7) What is the output?

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

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

Questions Choices

void main() { 24

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

p = a; 34

++*p; 3.

printf("%d ", *p); 22

p += 2; 4.

printf("%d ", *p); 23

1.

7) When the pointer is NULL, then the function realloc malloc()

is equivalent to the function ________ 2.
A. calloc()
B. 3.
C. free()
D. printf() 4.

printf()

1.

int *p, a=10

2.

int a=10,*p=&a

7) Identify the wrong declaration statement________. 3.

int *p=&a, =10

4.

int int a;

int p=&a;

1.
7) The fastest way to exchange two rows in a two- exchange the addresses of each
dimensional array is________. element in the two rows.

2.
Questions Choices

exchange the elements of the two

rows.

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.

1.

7) What is the output of the following code? 10

main() 2.

{ printf(%d\n,sum(5)); } 16

int sum(int n) 3.

{ if(n<1) return n; 14

else return(n+sum(n-1)); 4.

15

Showing 141 to 150 of 995 entries

Questions Choices

1.

2.

7) What is the result of the expression (23*2) % (int) 1

5.5?
3.

error

4.

Find the output of the program 1.

#include<stdio.h> 10
Questions Choices

#include<stdlib.h> 2.

20

int main() 3.

{ Segmentation fault

int *ptr; 4.

*ptr = 10; Address of ptr

ptr = 20;

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

return 0;

1.

f is pointer variable.

2.
Identify the correct statement for given expression
as________. f is a fixed address and not a variable.

float f [10], *fptr = f 3.

f is an array variable.

4.

f is an address that can be modified.

1.

float to double.

2.

Loss in precision occurs for typecasting char to short.

from____________. 3.

float to int.

4.

long to float.

On freeing a dynamic memory, if the pointer value is 1.

not modified, then the pointer points to? NULL
Questions Choices

2.

Other dynamically allocated memory

3.

The same de-allocated memory

location

4.

It points back to location it was

initialized with

1.

2.

1
The number of arguments used in malloc () is_______.
3.

4.

1.

float values.

2.

The operator % can be applied only to __________ . double values.

3.

character values.

4.

integer values.

1.

*
The operators exclusively used in connection with
2.
pointers are________.
&

3.
Questions Choices

4.

* and &

1.

declaring user-defined data types.

2.

declaring variant variables.

The typedef statement is used for________.
3.

for typecasting of variables.

4.

for typing static variables.

What is the output of C Program with arrays and

pointers.?

int main()
1.
{
23
int ary[] = {43, 23, 42};
2.
int *p, *q;
43 garbage_value
p = ary;
3.
q = ary+3;
43 42
printf("%d %d",*p, *q);
4.
return 0;
compiler error
}

Showing 151 to 160 of 995 entries

Search:

Questions Choices

When a function is recursively called all automatic 1.

variables are ___________. stored in stack.
Questions Choices

2.

stored in queue.

3.

stored in array.

4.

stored in linked list.

1.

memory is allocated by using malloc ().

2.

memory is freed by a garbage collector.

Which of the following is the most accurate 3.

statement about runtime 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)

2.
How can you write a[i][j][k][l] in equivalent pointer
((**(*(a+i)+j)+k)+l)
expression?
3.

(*(*(*(a+i)+j)+k)+l)

4.

*(*(*(*(a+i)+j)+k)+l)

1.

switch
The keyword used to transfer control from a
2.
function back to the calling function is
go

3.
Questions Choices

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 following C

program?

#include<stdio.h>

int f(int *a, int n)

1.
{
-9
if (n <= 0)return 0;
2.
else if(*a%2 == 0) return *a+f(a+1,n-1);
5
else return *a-f(a+1, n-1);
3.
}
15
int main ( )
4.
{
19
int a[ ] = {12, 7, 13, 4, 11, 6};

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

return 0;

}
Questions Choices

1.

deterministic, probabilistic

2.

Monte Carlo randomized algorithm’s correctness is probabilistic, deterministic

_______ and time complexity is ___________. 3.

non-deterministic, deterministic

4.

deterministic, non-deterministic

1.

float

2.

What is the default return type if it is not specified in void

function definition? 3.

int

4.

short int

1.

Storage services

2.

Autoscaling comes among which Amazon web Communication services

services 3.

Additional services

4.

Compute services

1.

persistent objec

1. The Hibernate architecture consists of? 2.

session factory

3.
Questions Choices

transaction

4.

All of the above

Showing 161 to 170 of 995 entries

Previous1…161718…100Next

VIT (Vellore Campus)

Comprehensive Question Preview

Search:

Questions Choices

1.

Yes
1. What do you think about the statement - "session being
2.No
a thread-safe object"?

3. 4.

1.

First fit looks for the tight-fitting

hole for the item

2.

Next fit places item in the current

1. Choose the statement from below which is correct bin or in the next bin
related to the bin packing approximation algorithm. 3.

Best fit looks for the first hole

large enough for the item

4.

Next fit and First fit produce same

result always

1. A series of equal space time pulses may be easily 1.

generated by which type of counter circuit? Johnson Shift
Questions Choices

2.

Clock Shift

3.

Binary Shift

4.

Ring Counter

1.

A counter has the capability to

store n bit of information whereas
a register has one bit.

2.

1. The primary difference between a counter and a A register counts data.

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 – what will be the
2.
output?
The value is 10, 0
<div ng-app="" ng-init="values=[10, 20, 30]">
3.
<p>The value is {{values[0]}}, {{values[3]}}</p>
The value is 10, NaN
</div>
4.

The value is 10,

Figure out which of these is part of the Google cloud 1.

service models? i & ii
i) Workspace 2.
ii) Computer Engine i & iii
Questions Choices

iii) Cloud Pricing Calculator 3.

ii & iii

4.

i, ii, iii

1.

1&4
1. Cloud computing architecture is a combination of?
2.
1.Service-oriented architecture
2& 3
2. Grid architecture
3.
3. Utility architecture
3& 4
4. Event-driven architecture.
4.

2& 4

1.

Which is/ are True about FaaS A,B&C

A. A subset of serverless 2.

B. Event-driven computing A,B&D

C. Run and manage microservices applications 3.

D. Require significant maintenance for updating and D

managing operating systems. 4.

B&D

1.

B&C
Challenges in Cloud Computing
2.
A. Conflict to legacy programs
A&C
B. Provenance
3.
C. QoS Measurement
D&C
D. Reduction in Latency
4.

A&D

Match the following 1.

Questions Choices

1. Storage & Content a. Message Queuing 1-a ,2-b,3-c,4-d

delivery Services
2.
2. Networking b. Glacier
1-b ,2-a,3-c,4-d

3.
3. Application service c. Direct Connect 1-a ,2-b,3-d,4-c
4. Deployment & d. Elastic Beanstalk 4.
Management
1-b ,2-c,3-a,4-d

Showing 171 to 180 of 995 entries

Previous1…171819…100Next

VIT (Vellore Campus)

Comprehensive Question Preview

Search:

Questions Choices

1.

Y= M4M6M7

2.
1. Express Y = (A+B+C' ) (A+ B'+C' )(A+B+C) in
Y= M0M1M3
maxterm designation
3.

Y= m4m6m7

4.

Y= m0m1m3

1.

DMA bus
Which of the following bus is used to transfer
2.
data from main memory to peripheral device?
IO bus

3.
Questions Choices

Address BUs

4.

Data bus

1.

user-level virtualization

2.

OS-level virtualization
Library-level virtualization is also known as
3.

process- level virtualization

4.

application level virtualization

1.

Xen

2.

Which one of the following is not a type-1 Hyper-V

hypervisor? 3.

KVM

4.

Virtualbox

1.

keylistener()

2.

method are used to register a keyboard event addkistener()

listener. 3.

addkeylistener()

4.

eventkeyboardlistener()

which of these events will be notified if scroll 1.

bar is manipulated? windowevent
Questions Choices

2.

actionevent

3.

adjustmentevent

4.

componenteven

1.

addmouse()

2.

which of these methods are used to register a addmouselistener()

mouse motion listener? 3.

addmousemotionlistner()

4.

eventmousemotionlistener()

1.

getid()

2.

which of these methods can be used to getevent()

determine the type of event? 3.

getsource()

4.

geteventobject()

1.

java.awt

2.
which of these packages contains all the
classes and methods required for event java.event
handling in java?
3.

java.applet

4.
Questions Choices

java.awt.event

1.

genereic servlets

what type of servlets use these methods 2.httpservlets 3.

doget(), dopost(),dohead, dodelete(),
dotrace()? built-in servlets

4.

standard servlets

Showing 181 to 190 of 995 entries

Questions Choices

1.

servletinputstream

2.

servletoutputstream

3.

servletcharstream

4.

servletbinarystream
which class provides stream to read binary
data such as image etc. from the request
object?
Questions Choices

1.

only setattribute

2.

only getattribute

3.

both setattribute and getattribute

4.

which methods are used to bind the

objects on httpsession instance and get
the objects?
Questions Choices

bindobject and getobject

1.

only rmi communication

2.

only http communication

3.

only socket communication

Which of these ways used to communicate
from an applet to servlet?

4.

rmi, http, and socket communication

1.
which type of servletengine is a server that
add-on servletengine
includes built-in support for servlets?
2.
Questions Choices

embedded servletengine

3.

standalone servletengine

4.

standard serveletengine

1.

public member

2.

private member

3.

protected member

4.

a class member declared protected

becomes member of subclass of which
type?

static member

As per NIST cloud reference architecture, 1.

which one of the following is/are role of
cloud auditor? Only I
Questions Choices

I) Security audit 2.

II) Privacy audit Only II

III) Service audit 3.

Both I and II

4.

I, II and III

1.
Here a single program is executed by all Single Program Multiple Data (SPMD)
tasks simultaneously. At any moment in
time, tasks can be executing the same or 2.
different instructions within the same Multiple Program Multiple Data (MPMD)
program. These programs usually have the
necessary logic programmed into them to 3.
allow different tasks to branch or Von Neumann Architecture
conditionally execute only those parts of
the program they are designed to execute. 4.

MIMD

1.

Integrity and Access Management

2.

IAM is one of the cloud security solutions. Identity and Access Management
IAM stands for 3.

Integrity and Authorization Management

4.

Identity and Authorization Management

1.

An Irregular Set
If R represents a regular language, which of
the following represents the Venn-diagram 2.
most correctly? R*

3.

R complement

4.
Questions Choices

R reverse

1.

2.
If the instruction, Add R1,R2,R3 is executed
in a system which is pipe-lined, then the ~2
value of S is (Where S is term of the Basic 3.
performance equation)
~1

4.

Showing 191 to 200 of 995 entries

Questions Choices

1.

2.

In a MapReduce programming model, the number 5

of mapper for word counting problem is 3.

4.

depends on the data segment

In HDFS architecture, the actual data are stored

1.
on the following node
Only I
I) Name Node
2.
II) Data node
Questions Choices

III) Slave node Both I and II

3.

Both I and III

4.

Both II and III

1.

{w | w is a string of odd length}

2.

Let for ∑= {0,1} R= (∑∑∑) *, the language of R would {w | w is a string of length multiple of 3}
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 with the addition of more
Scalability refers to a parallel system’s (hardware processors
and/or software) ability
3.

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.

Synchronous communication operations referred Involves only those tasks executing a

to communication operation

2.
Questions Choices

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
Synchronous communications being members in a common 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.

1.
Two processors A and B have clock frequencies of
700 Mhz and 900 Mhz respectively. Suppose A can Processor A
execute an instruction with an average of 3 steps
2.
and B can execute with an average of 5 steps. For
the execution of the same instruction which Processor B
processor is faster ?
3.
Questions Choices

Processor A and B

4.

Insufficient Information

1.

prototype( )

2.

prototype(void)

3.

public prototype(void)

4.

public prototype( )

what is the prototype of the default constructor of

this class?

public class prototype { }

Questions Choices

1.

small algorithm

2.

hash algorithm
Which Algorithm is better choice for pipelining?
3.

merge-sort algorithm

4.

quick-sort algorithm

1.

finalize()

2.

which function is used to perform some action delete()

when the object is to be destroyed? 3.

main()

4.

deleteAll()

Showing 201 to 210 of 995 entries

Questions Choices

1.

finally

2.

which of the following handles the exception throw handler

when a catch is not used? 3.

default handler

4.

java run time system

Questions Choices

1.

catchable

2.

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

string

4.

throwable

1.

throws

2.

throw
which of the following keyword is used by
calling function to handle exception thrown by
called function? 3.

try

4.

catch

1.

only I

Which of the following services that need to be 2.

negotiated in Service Level Agreements ?
Both I and III
I) Logging
II)Auditing 3.
III) Regulatory compliance Both II and III

4.

I, II and III
Questions Choices

1.

default constructor is called at the time of

declaration of the object if a constructor has
not been defined.

2.
which of the following statements are
constructor can be parameterized.
incorrect?
3.

finalize() method is called when a object goes

out of scope and is no longer needed.

4.finalize() method must be declared

protected.

1.

filestream

2.

which of these class contains the methods fileinputstream

used to write in a file? 3.

bufferedoutputstream

4.

filebufferstream

1.

ioexception

2.

which of these exception is thrown in cases fileexception

when the file specified for writing is not found? 3.

filenotfoundexception

4.

fileinputexception

1.
Which of these is a process of writing the state
serialization
of an object to a byte stream?
2.
Questions Choices

externalization

3.

file filtering

4.

object streaming

1.

upper

2.

which of these keywords is used to refer to super

member of base class from a sub class? 3.

this

4.

sub

1.

get()

2.

which of these methods are used to read in read()

from file? 3.

scan()

4.

readfileinput()

Showing 211 to 220 of 995 entries

Questions Choices

1.

obtainstacktrace()
which of these methods is used to print stack trace?
2.

printstacktrace()
Questions Choices

3.

getstacktrace()

4.

displaystacktrace()

1.

getexception()

2.

which of these methods return description of an getmessage()

exception? 3.

obtaindescription()

4.

obtainexception()

1.

2.

which of these values is returned by read() method is 1

end of file (eof) is encountered? 3.

-1

4.

null

1.

Flexible and efficient allocation of

resources

2.
Which one of the following is not a benefit of Lowers the cost of IT infrastructure
virtualization?
3.

Remote access and rapid scalability

4.

Security risk
Questions Choices

1.

MQTT Client

2.

MQTT Server
Which one of the following is not a MQTT component?
3.

MQTT Broker

4.

MQTT Connection

1.

Very large files

2.

Which one of the following is not applicable for HDFS ( Streaming data access
Haddop Distributed File System) 3.

Commodity hardware

4.

Low latency data access

1.

unmodified guest OS to be run in

isolation

2.

completely simulates the underlying

Which one of the following is not true about full hardware
virtualization?
3.

fully decouples the guest OS

4.

Guest OS completely aware of its

virtualization

1.
Which one of the following is the unique challenge of
cloud security than the traditional cyber security? Enterprise is responsible for security
end-to-end
Questions Choices

2.

Used individually managed security

tools

3.

Static resources contain security

boundaries

4.

Dynamic resources blurred security

boundaries

1.

Token

2.
Which one of the following is used to Topic
publish/subscribe the message through MQTT
protocol? 3.

Keyword

4.

Ticket

1.

Mapper

2.
Which one of the following takes set of data and
converts it into another set of data, where individual Reducer
elements are broken down into tuples (key/value 3.
pairs).
Shuffler

4.

Splitter

Showing 221 to 230 of 995 entries

Questions Choices

Which one of the following takes the output from a map as an input and
1.
combines those data tuples into a smaller set of tuples?
Questions Choices

Mapper

2.

Reducer

3.

Shuffler

4.

Merger

1.

augmenting
path

2.

A simple acyclic path between source and sink which pass through only positive critical path
weighted edges is called 3.

residual path

4.

maximum
path

1.

Decision
problem

2.

optimization
problem
Class P is the set of _______________ that can be solved in worst-
case polynomial time 3.

optimization
decision
problem

4.

Unsolvable
problm

Floyd Warshall Algorithm can be applied on __________ 1.

Questions Choices

Undirected
and
unweighted
graphs

2.

Undirected
graphs

3.

Directed
graphs

4.

Acyclic graph

1.

always

2.

approximatel
If a problem is NP-complete there is ________________no polynomial-time y
algorithm to find an optimal solution
3.

most likely

4.

very likely

1.

LIFO branch
and bound

2.

FIFO branch
Which of the following is not a branch and bound strategy to generate branches and bound

3.

Lowest cost
branch and
bound

4.
Questions Choices

Highest cost
branch and
bound

What will be the output of the following Java program?

1.

false

2.

true

3.

4.

Compilation
error

1.

2.

What will be the output of the following Java program? 3.

Runtime
Error

4.

Compilation
error
Questions Choices

1.

Run time

2.

Compilation
time
When does Exceptions in Java arises in code sequence?
3.

Deployment
time

4.

Linking time

1.

accuracy
The importance of software design can be summarized in a single word
2.

complexity
Questions Choices

3.

efficiency

4.

quality

Showing 231 to 240 of 995 entries

 1.

Architectural design

2.

Which design model is equivalent to the detailed drawings of the Component-level design
access points and external utilities for a house? 3.

Data design

4.

Interface design

1.

2.

What is the minimal spanning tree of the graph below by applying

Prim’s algorithm with 0 as the root vertex?

3.

4.
 1.

a. Symmetric key

2.

1. _________ cryptography is often used to work on lengthier a. Asymmetric key

messages. 3.

a. Public key

4.

a. Group key

1.

a. network, application

2.

1. A packet-filter firewall filters at the ___________ or a. transport , application

_______ layer. 3.

a. network, transport

4.

a. a link and application

1.

a. Verification algorithm

2.
1. A protocol involving a prover and a verifier that enables the a. Authentication proof
prover to prove to a verifier without revealing any other
information. This is called as ____ 3.

a. E Mail Security

4.

a. Zero-Knowledge Proof

1.

a. Nonrepudiation

2.
1. Digital signature does not provide _________
a. Privacy

3.

a. Authentication
 4.

a. Integrity

1.

a. One way

2.

a. Two way
1. Hash functions are ________ functions
3.

a. Multiple way

4.

a. Three way

1.

a. Symmetric key

2.

1. In ______ cryptography everybody has access to everyone’s a. Asymmetric key

public key 3.

a. Secret key

4.

a. Private key

1.

44

2.

1. In AES algorithm, when you have 10 rounds ,the total number 32

of words may present as round key is _____ 3.

64

4.

16

1.

a. 64 Bytes
1. Maximum possible size of padding bits in MD5
2.

a. 512 Bytes
 3.

a. 32 Bytes

4.

a. 128 Bytes

1.

2.
ANS :3. 3
Suppose P, Q ∈ E, where P = (x1,y1) and Q = (x2,y2), we can 2
consider how many cases of solution in elliptic curve arithmetic 3.

4.

1.

a. Plaintext

2.

1. The information that gets transformed in encryption is called a. Cipher text

_____ 3.

a. Parallel text

4.

a. Transformed text

1.

a. Real time access to

key authority

2.

a. Reduced real time

1. The major advantage of public -key certificates is ____
access to key authority

3.

a. Increased real time

access to key authority

4.
 a. No real time access to
key authority

1.

a. Factoring problem

2.

a. Brute Force Attack

1. The major security threat to RSA algorithm is ____________ 3.

a. Man-in the middle

attack

4.

a. Birthday attack

1.

a. Factorization

2.

a. Forgery
1. The major vulnerability of distributing the public key using –
public announcement 3.

a. Man-in the middle

attack

4.

a. Birthday attack

1.

a. Diffusion

2.

1. The process of making relationship between cipher text and a. Confusion

key as complex as possible is called as ______ 3.

a. Decryption

4.

a. Encryption

1.
1. Which of the following algorithm was developed based on the
difficulty of finding log base 2 in a cyclic group ? a. Elliptic curve
cryptography
 2.

a. ElGamal

3.

a. DES

4.

a. RSA

1.

a. Identification

2.

a. Authentication
1. Which of the following is not an objective of network security?
3.

a. Locking

4.

a. Access control

1.

a. Hash algorithm

2.

1. Which one of the following algorithm does not generate fixed a. HMAC algorithm
length digest from an arbitrary-length message? 3.

a. MD5

4.

a. RSA

1.

a. Bit by bit XOR

2.

a. One bit circular shift

1. Which one of the following is a most insecure hash function?
3.

a. HMAC

4.

a. SHA-1
 1.

a. Digital signature

2.

Which one of the following refers to the technique used for a. Decryption algorithm
verifying the integrity of the message? 3.

a. Protocol

4.

a. Message Digest

1.

a. S/MIME

2.

1. Which authentication methodology will you recommend while a. PGP

mailing an audio file ? 3.

a. HMAC

4.

a. Email Security

1.

Integration Testing

2.

Generally, which testing is used when shrink-wrapped software Smoke testing

products are being established and part of an integration testing? 3.

Regression Testing

4.

Validation testing

1.

User's end

2.
In which environment we can performed the Alpha testing?
Developer's end

3.

User's and developer's end

 4.

tester

1.

Function testing

2.

System testing
Which of the following is not part of the Test type?
3.

Statement testing

4.

Database testing

1.

Code inspection is carried

out once the code has been
unit tested

2.

Code inspection and code

walk-through are synonyms
Which one of the following assertions concerning code inspection
and code walk-through is true? 3.

Adherence to coding
standards is checked
during code inspection

4.

Code walk-through is
usually carried out by an
independent test team

1.

7
How many bits are required in the operation code? If a Computer
2.
uses a memory unit with 1 M words of 32 bits each. A binary
instruction code is stored in one word of memory. The instruction 6
has four parts: an indirect bit, an operation code, a register code
3.
part to specify one of 64 registers, and an address part
20

4.
 5

1.

10 micro sec

2.
An 8-bit serial-in/serial-out shift register is used with a clock 50 micro sec
frequency of 100 kHz What is the time delay between the serial
input and the Q5 output? 3.

60 micro sec

4.

40 micro sec

1.

230ns

2.
Consider a system with an 80% hit ratio, 50 Nano-seconds times 950ns
to search the associative registers, 750 Nano-seconds times to
access memory. What is the effective memory access time? 3.

640ns

4.

310ns

1.

16

2.
In a six-stage pipeline assuming that there are no branch 15
instructions. If we want to execute 15 instructions. What is the
time required to execute these instructions? 3.

21

4.

20
 1.

DMA is an approach of performing

data transfers in bulk between
memory and the external device
without the intervention of the
processor.

2.

Which of the following is true about DMA? 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
DOUBT
2.
The CPU activities the ................... output to inform the Bus Grant
external DMA that the buses are in the high-impedance
state. 3.

Cycle stealing

4.

Bus relinquishes

1.

7
How many bits are required in the operation code? If a 2.
Computer uses a memory unit with 1 M words of 32 bits
each. A binary instruction code is stored in one word of 6
memory. The instruction has four parts: an indirect bit, an 3.
operation code, a register code part to specify one of 64
registers, and an address part 20

4.

1.

Same as a mode-5 counter followed

by a mod- 2 counter

2.

1. A mod-2 counter followed by a mod-5 counter is A decade counter

3.

A mod-7 counter

4.

Ripple carry Counter

1.

Up-down counter

1. A ring counter is same as 2.

Parallel counter

3.
 Shift register

4.

Ripple carry counter

1.

Half Adder

2.

1. In which of the following adder circuits, the carry look Full Adder
ripple delay is eliminated ? 3.

Parallel Adder

4.

Carry-Look-Ahead Adder

1.

OR Gate

2.

AND Gate
1. Odd parity of word can be conveniently tested by
3.

NOR Gate

4.

XOR Gate

1.

log2 (N) + 1

2.

1. The number of flip-flops required in a modulo N log2(N-1)

counter is 3.

log2 (N)

4.

N log2 (N)

1.
1. The number of full and half-adders required to add
8 half-adders, 8 full-adders
16-bit numbers is
2.
 1 half-adder, 15 full-adders

3.

16 half-adders, 0 full-adders

4.

4 half-adders, 12 full-adders

1.

Toggle switch

2.

Latch
The ring counter is analogous to
3.

Stepping Switch

4.

JK Flip Flop

1.

Rise time

2.

1. The time required for a gate or inverter to Decay time

change its state is called 3.

Propagation time

4.

Charging time

1.

One

2.
1. What is the minimum number of two-input Two
NAND gates used to perform the function of two
input OR gate? 3.

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 change state

1. Which of the following 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 of gates are best EX-NOR or EX-OR gates
suited for 'parity' checking and 'parity' generation. 3.

NAND gates

4.

NOR gates

1.

Continuous Delivery

2.

Which of the following is/are a key component of Continuous Testing

DevOps? 3.

Continuous Integration

4.

All of the them

 1.

Security is increased because of the

automation process

2.

Security is increased by excluding it earlier

How does DevOps impact the security of an in the process
application or machine?
3.

Security is reduced because of the

automation process

4.

None

1.

Waterfall Software Delivery

2.

Identify the methodologies does least impact Lean Manufacturing

the establishment of DevOps methodology. 3.

Continuous Software Delivery

4.

Agile Software Delivery

1.

Design Engineers

2.

Quality Assurance
What are the PRIMARY stakeholders for DevOps?
3.

Testers

4.

All of the them

1.

A small team of people that own

What is DevOps?
everything related to a particular service

2.
 Developers performing operations

3.

Developers and Operations team

members working together

4.

None of above

1.

Continuous Monitoring tool

2.

Continuous Integration tool

What is the use of Jenkins?
3.

Version Control System tool

4.

Continuous Testing tool

1.

Automate Everything

2.

Which of the following is not a feature of Continuous Improvement

continuous delivery. 3.

Bug fixes and experiments

4.

Gathering Requirement

1.

Code

2.

Which of the following is not a part of Develops Plan

life cycle _________ 3.

Build

4.

Operating
 1.

Liam Debois

2.

Patrick Debois
Who is known as the father of DevOps?
3.

Walter Dandy

4.

None of these

1.

training data

2.

__________ data used to build a data mining hidden data

model. 3.

test data

4.

validation data

1.

Manhattan distance

2.

Following is powerful distance metrics used by Euclidean distance

Geometric model _______________ 3.

All of above

4.

None of above

1.

feature
In the example of predicting number of babies 2.
based on stork’s population, number of babies is
_______________ observation

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,

Of the following examples, which would you learn a spam filter
address using a supervised learning Algorithm? 3.

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.

supervised learning

2.
Some telecommunication company wants to unsupervised learning
segment their customers into distinct groups,
this is an example of ________________ 3.

data extraction

4.

reinforcement learning

1.

unsupervised learning

2.
You are given reviews of few Netflix series
marked as positive, negative and neutral. semi supervised learning
Classifying reviews of a new Netflix series is an 3.
example of ____________
supervised learning

4.

reinforcement learning
 1.

interactive

2.

predictive
For supervised learning we have ____ model
3.

descriptive

4.

prescriptive

1.

Problem Identification

2.

This is the cleaning/transforming the data set in the Identification of Required Data
supervised learning model. 3.

Data Pre-processing

4.

Definition of Training Data Set

1.

Accuracy

2.

Which of the following measure is not used for a Recall

classification model? 3.

Error rate

4.

Purity

1.

a. Uniform Resource Identifier

______________ a service, provides resource 2.

representation such as JSON and set of HTTP Methods.
a. Application programming
interface

3.
 a. Spring MVC

4.

a. SOAP

1.

Web application

2.

_______________are computer programs that are accessed DB applications

over the internet through a computer’s web browser. 3.

System log

4.

Protocol

1.

SecurityFlowExecutionListener

2.

SecurityFlowExecution
To enable Spring security for web 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.

What is the HTTP Status Code Related to Page Not Found? 402

2.
 404

3.

403

4.

401

1.

Bagging

2.

___________ uses ensembles of ML models each capturing Boosting

a specific subspace of predictor space 3.

Stacking

4.

None of the above

1.

Bagging

2.

____________ uses ensembles to capture different Boosting

characteristics of a task, learning how to combine them 3.

Stacking

4.

None of the above

1.

Series

2.

Parallel
Boosting builds ensembles in ___________
3.

Series and parallel

4.

None of the above

Ensemble methods is/are ______________ 1.

 Bagging

2.

Boosting

3.

Stacking

4.

All of the above

1.

Series

2.

Parallel
Stacking builds ensembles in ____________
3.

Series and parallel

4.

None of the above

1.

Linear, binary

2.

Logistic regression is a ______ regression technique that is Linear, numeric

used to model data having a _______ outcome. 3.

Nonlinear, binary

4.

Nonlinear, numeric

1.

Mean relative error

2.
What is called the average squared difference between
Mean squared error
classifier predicted output and actual output?
3.

Mean absolute error

4.
 Root mean squared error

1.

Data dictionaries

2.

All the following tools are used for process descriptions Decision tables
except: 3.

Structured English

4.

Pseudocode

1.

100-200

2.
Build & Fix Model is most appropriate for implementing 200-400
programming exercises of .....................LOC (Line of
Code) 3.

400-1000

4.

above 1000

1.

Develop the software.

2.

Improve the software process.

CMM model in Software Engineering is a technique of 3.

Improve the testing process.

4.

Identifying the errors during

maintenance.

1.

How many characteristics does Value Adjustment 11

Factor(VAF) in Function Point Analysis have? 2.

12
 3.

13

4.

14

1.

Waterfall

2.

Spiral
The model remains operative until the software is retired
3.

Incremental

4.

Prototyping

1.

divide-and-conquer

2.

A simple approach that is efficient when it works but does brute-force

not always work is 3.

greedy

4.

dynamic-programming

1.

NP-complete = NP

2.

NP-complete intersection P =
Assuming P != NP, which of the following is true empty

3.

NP-hard = NP

4.

P = NP-complete
 1.

True

2.

Both FIFO branch and bound strategy and backtracking leads False
to depth first search 3.

NIL

4.

NIL

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 the following 3.

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

1.

There can be a polynomial time

algorithm for 3SAT

2.

There can be no polynomial

If class P is not equal to class NP
algorithm for 3SAT

3.

3SAT is not polynomial time

reducible to Clique

4.
 Clique is not polynomial time
reducible to 3SAT

1.

2.

2
In how many directions do queens attack each other
3.

4.

1.

Depth-first search

2.

In what manner is a state-space tree for a backtracking Breadth-first search

algorithm constructed 3.

Twice around the tree

4.

Nearest neighbor first

1.

vertex matching

2.

Minimum number of unique colors required for vertex chromatic index

coloring of a graph is called 3.

chromatic number

4.

color number

1.
The approach to algorithm design for optimization problems divide and conquer
that makes direct use of the fact that the most apparent next
component of a solution is part of the optimal solution is 2.

greedy
 3.

brute force

4.

dynamic programming

1.

It backtracks to the root

2.

It continues searching for other

What happens when the backtracking algorithm reaches a possible solutions
complete solution 3.

It traverses from a different route

4.

Recursively traverses through the

same route

1.

1 intermediate vertex

2.

What happens when the value of k is 0 in the Floyd Warshall 0 intermediate vertex
Algorithm 3.

N intermediate vertices

4.

N-1 intermediate vertices

1.

A condition where any two

vertices having a common edge
should not have same color

What is vertex coloring of a graph 2.

A condition where any two

vertices having a common edge
should always have same color

3.
 A condition where all vertices
should have a different color

4.

A condition where all vertices

should have same color

1.

Stack

2.

Which data structure is used for implementing a LIFO Queue

branch and bound strategy 3.

Array

4.

Linked list

1.

branch and bound

2.

Which of the following can traverse the state space tree only dynamic programming
in DFS manner 3.

greedy algorithm

4.

backtracking

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

Which of the following is true about NP-Complete and NP- 2.

Hard problems The first problem that was proved
as NP-complete was the circuit
satisfiability problem

3.

NP-complete is a subset of NP
Hard
 4.
ANS: 1,2,3
NP hard

1.

greedy algorithm

2.

Which of the following methods can be used to solve n- divide and conquer
queen’s problem 3.

iterative improvement

4.

backtracking

1.

n-queen problem

2.

Which of the problems cannot be solved by backtracking subset sum problem

method 3.

hamiltonian circuit problem

4.

travelling salesman problem

1.

Finding the shortest path

2.

Finding the efficient quantity to

Which one of the following is an application of the shop
backtracking algorithm
3.

Ludo

4.

Crossword

You are given a knapsack that can carry a maximum weight 1.

of 60. There are 4 items with weights [20, 30, 40, 70] and
160
values [70, 80, 90, 200]. What is the maximum value of the
items you can carry using the knapsack 2.
 200

3.

170

4.

90

1.

Maximum length instruction task

and VM with minimum speed

2.

Maximum length instruction task

Given set of tasks with length of instructions and set of VM and VM with maximum speed
with speed. Which one of the following is true about Max-Min
task scheduling algorithm? 3.

Minimum instruction length task

and VM with maximum speed

4.

Minimum instruction length task

and VM with minimum speed

1.

Fair for multi

tenant system

2.

Tenant cannot
benefit by lying

Which one of the following is not a 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.

all containers
share the same
kernel of host
Which one of the following is not true about virtual machine as compared to machine
containers? 3.

VM snapshots
are used
occasionally

4.

boot up time is
faster than
containers

1.

Only S1 is correct

2.
Consider the following two statements:
S1 - {02n | n ≥ 1|} is regular language. Only S2 is correct
S2 - {0m 1n 0m + n | m ≥ 1 and n ≥ 1|} is a regular language 3.Both S1 and
S2 are correct 4.

Both S1 and
S2 are wrong

1.

i) E → pE’ ii) E’ →
pqT / ∈ iii) T →
pqrF / ∈ iv) F →
pqrs / ∈

Consider the grammar E → p / pq / pqr / pqrs Find the left factoring 2.

i) E → pE’ ii) E’ →
qrT / ∈ iii) T →
rsF / ∈ iv) F → sp /
∈
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.

xy(xy)*yyx
Consider the RE for all strings starts with xy and ends with yyx is.
3.

xy(x+y)*yyx

4.

xyx*y*xyyyx

1.
Find the regular expressions
(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.

[a(a+b)*b +
The set of all strings over ∑ = {a,b} in which all strings that starts with and b(a+b)*a]
ends with same letter is 2.

[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

1.

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

IV only

Which NDFA correctly represents the following RE?

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

2.

3.

Which NDFA correctly

represents the
following RE?

a(bab)*∪a(ba)*

4.
What happens in the 1.
following JavaScript
code snippet? An exception is thrown

var js = 0; 2.

while (js < 10) The values of js are logged or stored in a particular location or storage

{ 3.

console.log(js); The value of js from 0 to 9 is displayed in the console

js++; 4.

} An error is displayed

What will be the output

of the following
JavaScript code
snippet?

// JavaScript Equalto 1.
Operators false
function equalto() 2.
{ true
int num=10; 3.
if(num==="10") compilation error doubt

return true; 4.
else runtime error
return false;

What will be the output 1.

of the following
false
JavaScript code?
2.
// JavaScript
Comparison Operators true

function compare() 3.
{ compilation error
int num=2; 4.
char b=2; runtime error
 if(a==b)

return true;

else

return false;

1.

4
What will be the output
of the following 2.
JavaScript code?
5
int a=0;
3.
for(a;a<5;a++);
0
console.log(a);
4.

error

What will be the output 1.

of the following 1, 2, 3, 6, 7, 8
JavaScript code?
2.
var quiz=[1,2,3];
123
var js=[6,7,8];
3.
var
result=quiz.concat(js); 123678

document.writeln(resu 4.
lt); 1, 2, 3

1.

An exception will be thrown

2.
Will the following
JavaScript code work? Memory leak

var js = (function(x) 3.
{return x*x;}(10));
Error

4.

Yes, perfectly
 1.

2.

Given Language: L=
{xϵ∑= {a, b} |x has a
substring ‘aa’ in the
production}. Which of
3.
the corresponding
representation notate
the same?

4.

What is the normal

order of activities in
which traditional 1.
software testing is
organized? (a) 1
Integration Testing (b)
2.
System Testing (c) Unit
Testing (d) Validation 2

3.

4.

Which session 1.
method begin a unit of
clear
work and return the
associated Transaction 2.
object?
cancelQuery

3.

Transaction beginTransaction

4.

Transaction

1.

Negative

2.
FIND-S Algorithm starts from the most specific Positive
hypothesis and generalize it by considering
only 3.

Negative or Positive

4.

None of the above

1.

Unsupervised Learning: Regression

2.
Fraud Detection, Image Classification, Supervised Learning: Classification
Diagnostic, and Customer Retention are
applications in which of the following 3.

Unsupervised Learning: Clustering

4.

Reinforcement Learning

1.

Drop missing rows or columns

2.
How do you handle missing or corrupted data
in a dataset? Replace missing values with
mean/median/mode

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

2.
The VC dimension of hypothesis space H1 is The number of examples required for learning a
larger than the VC dimension of hypothesis hypothesis in H1 is smaller than the number of
space H2. Which of the following can be examples required for
inferred from this?
3.

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
What is the objective of backpropagation implicitly
algorithm?
2.

To develop learning algorithm for multilayer

feedforward 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

Which is true for neural networks? state

3.

It has set of nodes and connections

4.

All of the above

1.

Boosting

2.

Which of the following ensemble model helps Bagging

in reducing variance? 3.

Stacking

4.

Voting

1.

Adding more irrelevant attributes

2.

Generating a tree with fewer branches

Which of the following helps in avoiding
overfitting in decision trees? 3.

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 disadvantage of Decision trees are robust to outliers

decision trees? 3.

Factor analysis

4.

None of the above

1.

Decision Tree

2.
Which of the following is a widely used and effective Regression
machine learning algorithm based on the idea of
bagging? 3.

Classification

4.

Random Forest

1.

AdaBoost

2.

Which of the following is an example of sequential Bootstrapping

ensemble model? 3.

Random forest

4.

All of the above

1.

Naive Bayesian

Which of the following is not a supervised learning? 2.

PCA

3.
 Linear Regression

4.

Decision Tree Answer

1.

AdaBoost

2.

Which of the following is not an example of Decision tree

ensemble method? 3.

Random Forest

4.

Bootstrapping

1.

It is useful only in high-dimensional

spaces

2.

It requires less memory

Which of the following is true 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 about ensemble Ensemble methods are simple and cheap
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 common. 2.

False

3. 4.

1.

QA

2.

Agile
DevOps is an extension of __________________
3.

Waterfall

4.

None of the above

1.

Implants Manual Errors

2.

Enables anyone to perform tasks

Which of the following does not benefit Automation
in DevOps? 3.

Enables Speed, Reliability and

Consistency

4.

None of the these

1.

01100

2.
The 2’s complement representation of 12 is
00100
A.
3.

10100

4.
 01101

1.

MVC Architecture

2.

Decorator pattern
Angular is based on which architecture?
3.

MVVM Architectural pattern

4.

Observer Pattern

1.

model

2.

services
How is data shared between controller and view?
3.

factory

4.

scope

1.

XML

2.

In which format does AngularJS require to populate its CSV

data? 3.

JSON

4.

AngularJS accepts any format

1.

model specific
Scope is
2.

controller specific
 3.

view specific

4.

application specific

1.

stores data

2.

renders user Interface

What is the use of controllers in MVC?
3.

controls model and view interactions

4.

None of these

1.

ng-app

2.

ng-start
Which directive is used to start an Angular application?
3.

ng-init

4.

ng-begin

1.

The output is 1
What will be the output for the following code?
2.

The output is 15
<div ng-app="""" ng-init=""points=[1,15,19,2,40]"">
3.
<p>The output is {{ points[2] }}</p>
The output is 19
</div>
4.

The output is 2

Which of the following statement specifies the data-

1.
binding in AngularJS?
 Synchronization of data between the
model and view components

2.

Synchronization of data between the

model and controller components

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.

@angular/router
Router is part of which of the following module?
3.

Both

4.

None of these

1.

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

4.

7, 6, 18

1.

2.
A processor has 250 distinct instructions and 80 general-purpose
registers. A 32-bit instruction word has one op-code, two register 8
operands, and one immediate data operand. The number of bits 3.
available for the immediate data field is-------.
10

4.

11

1.

14
A processor has 58 distinct instructions and 28 general-purpose
registers. A 32-bit instruction word has one op-code, two register 2.
operands, and one immediate data operand. The number of bits 8
available for the immediate data field is-------.
3.

12
 4.

16

1.

Consider the following, 1, 2, and 3 only

1. Op-code 2.

2. Source address 1, 2, and 4 only

3. Destination address 3.

4. Next instruction address 1 and 3 only

Which of the above are typical elements of a machine instruction? 4.

1, 2, 3, and 4

1.

Logical code

2.

Operand
In instruction format, the address of any data location is said to be---
3.

Function code

4.

Instruction code

1.

Fetch cycle

2.

Decode cycle
The operation of instruction’s carried out by----
3.

Execution cycle

4.

Instruction program

1.
The size of instruction in a computer is 16 bits. Each instruction has 4
three operands and it follows register direct addressing modes. The
maximum number of op-codes that this processor can have is------ 2.

8
 3.

16

4.

32

1.

2.
A CPU has 12 registers and uses 6 addressing modes. RAM is 64K X 9
32. What is the maximum size of the opcode field if the instruction has
a register operand and a memory address operand? 3.

10

4.

11

1.

a. Factoring a prime
number

2.

a. Factoring the
product of prime
numbers

1. The term factorization in cryptography denotes ______ 3.

a. Dividing a prime
number by another
prime number

4.

a. Dividing the
product of prime
number with a fixed
integer

1.

One of the following services is not provided by a symmetric key a. Privacy

cryptosystem 2.

a. Authentication
 3.

a. Key exchange

4.

a. Integrity

1.

a. 32 Bits

2.

a. 32 Bytes
1. The DES algorithm has a key length of _____
3.

a. 64 Bits

4.

a. 64 Bytes

1.

a. Masquerade

2.

1. When a system/user/entity tries to behave like a different one, a. Virtualization

it is called as ____ 3.

a. Active attack

4.

a. Passive attack

1.

a) Round Robin
Scheduling algorithm

2.

a) FCFS Scheduling
Choose preemptive scheduling from the options below:
algorithm

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
 1.

a) 12

2.
Consider a set of four processes with arrival and burst times of 1, 2, a) 11.25
3, 4, and 2, 4, 6, 7, respectively. Calculate the average waiting time
if the CPU scheduling policy is LJF preemptive. 3.

a) 12.25

4.

a) 9

1.

always decrease the

number of page faults

2.

always increase the

Consider a virtual memory system with FIFO page replacement number of page faults
policy. For an arbitrary page access pattern, increasing the number 3.
of page frames in main memory will
sometimes increase the
number of page
faults

4.

a) never affect the

number of page faults

1.

OPTIMAL < LRU < FIFO

Consider the virtual page reference string 1, 2, 3, 2, 4, 1, 3, 2, 4, 1 2.

On a demand paged virtual memory system running on a computer OPTIMAL < FIFO < LRU
system that main memory size of 3 pages frames which are initially
empty. Let LRU, FIFO and OPTIMAL denote the number of page 3.
faults under the corresponding page replacements policy. Then OPTIMAL = LRU

4.

a) OPTIMAL = FIFO
 1.

a) 11, 12 and 13
Consider three processes with process ID 1, 2, and 3 and
computing burst time units of 2, 4, and 8 respectively. Every 2.
process arrives at the same time. Consider the scheduling a) 12, 13 and 14
algorithm in the order of the longest remaining time first (LRTF). If
there is a tie in LRTF, we will prioritize the process with the highest 3.
process ID. What is the turn around time of P1, P2 and P3 a) 14, 13 and 12
respectively?
4.

a) 13, 12, 14

1.

a) With increasing the

page frames, page faults
decreases always.

2.

a) Page faults increases

always with increasing the
page frames.
For FIFO page replacement policy:
3.

Page faults not affected

with increasing the page
frames.

4.

a) With increasing the

page frames, page faults
increases sometime.

1.

a) First in first out

2.

a) Shortest Job Next

If the quantum time of round robin algorithm is very large, then it is
equivalent to: 3.

a) Lottery scheduling

4.

a) Shortest Remaining
Time First (SRTF)
 1.

a) the large amount of

internal fragmentation

2.

the large amount of

external fragmentation
In a system with 32 bit virtual addresses and 1 KB page size, use of
one-level page tables for virtual to physical address translation is 3.
not practical because of the large memory
overhead in maintaining
page tables

4.

a) the large computation

overhead in the translation
process

1.

a) First-In First-Out

2.

a) Round Robin
Non-preemptive scheduling 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.

a) kernel
The command interpreter is also known as
3.

a) shell

4.

a) command

1.

operating systems

2.

multiprocessor systems
The FCFS algorithm is particularly troublesome for ____________ 3.

time sharing systems

4.

multiprogramming
systems

1.

a) Assembly

2.
The process of assigning load addresses to the various parts of the Parsing
program and adjusting the code and date in the program to reflect
the assigned addresses is called 3.

a) Relocation

4.

Symbol resolution

1.

a) When a page fault

Thrashing occurs when
occurs

2.
 a) Processes on system
frequently access pages
not 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.

a) Install the program

What is the meaning of Booting in the operating system?
3.

a) To scan

4.

a) To turn off

1.

a) The page is present in

When does page fault occur? memory

2.

The deadlock occurs

 3.

a) The page does not present in

memory

4.

a) The buffering occurs

1.

a) Private operating system

2.

a) Windows operating system

Which is the Linux operating system? 3.

a) Open-source operating
system

4.

a) Network Operating System

1.

a) Settle time

2.

Which of the following is major part of time taken when a) Rotational latency
accessing data on the disk? 3.

Seek time

4.

a) Waiting time

1.

instruction cache

2.

a) instruction register
Which of the following is not a form of memory?
3.

instruction opcode

4.

a) translation lookaside buffe

 1.

a) Windows

2.

a) Linux
Which of the following is not an operating system?
3.

a) Oracle

4.

a) DOS

1.

a) Semaphore

2.

a) PCB
Which of the following mechanisms is a locking mechanism?
3.

a) Mutex

4.

a) Binary Semaphore

1.

a) FCFS

2.

Which of the following scheduling reduces process flow a) LIFO

time? 3.

a) SJF

4.

a) Round-robin

1.

a) Stack

Which one of the following is NOT shared by the threads of 2.

the same process a) Address Space

3.

File Descriptor Table

 4.

a) Message Queue

1.

a) Desktop Manager

2.

Which program runs first after booting the computer and a) File Manager
loading the GUI? 3.

a) Windows Explorer

4.

a) Authentication

1.

a) Operating system

2.

Who is responsible for keeping the process from the a) CPU

program? 3.

a) Monitor

4.

a) Memory

1.

A listener is a variable that is

notified when an event occurs

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

3.

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()

2.

Which of these methods from a Java event handling package addMouseListener()

is used to register a mouse motion listener? 3.

addMouseMotionListener()

4.

eventMouseMotionListener()

1.

KeyListener()

2.

Which of these methods from a Java event handling package addListener()

is used to register a keyboard event listener? 3.

addKeyListener()

4.

eventKeyboardListener()

1.

java.applet

2.

Which of these packages contains all the classes and java.awt

methods required for even handling in Java? 3.

java.event

4.

java.awt.event

Assume that we perform six stack operations, namely

pushing and popping each of A, B and C such that push(A) 1.
must occur before push(B) which must occur before
push(C), In such a case, A, C, B can be a possible order for ABC
the pop operations,since this could be achieved by: push(A),
2.
pop(A), push(B), push(C), pop(C), pop(B). Satisfying this
constraint, which one of the following orders could not be a CBA
doubt
valid order for the pop operations?
3.

BAC

4.

CAB

1.O(n*n) 2.

O(n)

The solution of the recurrence T (n) = 4T (n/2) 3.

+((n*n*n)/(logn*logn)) is O(n*n*n)

4.

O(n*logn)

1.

String class

2.

Object class
Which of these class is superclass of every class in Java?
3.

Abstract class

4.

ArrayList class

1.

implements

2.

Which of these keywords cannot be used for a class which static

has been declared final in Java? 3.

abstract

4.

public
 1.

Agent

2.
______ is an assumed entity which performs actions in an environment
to gain some reward. State

3.

Policy

4.

Value

1.

Unknown

2.

______ is similar to 'any', but a safer alternative when uncertain about the Similar
type. 3.

Never

4.

None of these

1.

Q-Learning

2.

Supervised Learning
_______ can optimize the ad recommendation system to recommend 3.
products that are frequently bought together
Unsupervised
Learning

4.

Semi- Supervised
Learning

1.
________ is a technique that removes the problem of zero probability in
Add one smoothing
the Naive Bayes Algorithm.
2.
 Zero smoothing

3.

Manhattan
smoothing

4.

Mean smoothing

1.

Unconditional
transfer

2.
_________ is the branch logic that provides decision-making capabilities Controlled transfer
in the control unit:
3.

Conditional transfer

4.

Logical transfer

1.

Regression
algorithms

2.

__________ are the machine learning algorithms that can be used with Clustering algorithms
unlabeled data. 3.

Instance-based
algorithms

4.

All of the above

1.

___________ determines the direction in which particular service Service control

requests may be initiated and allowed to flow through the firewall. 2.

Direction control
 3.

User control

4.

Behaviour control

1.

RESTful

2.

____________ is a messaging protocol for transferring data between two SOAP

computers based on XML over the internet. 3.

Spring MVC

4.

Spring

1.

Extreme
programming

2.

Quality function
____________ is an agile software development approach. deployment

3.

PSPEC

4.

Unified process

1.

Utility software

2.

Speed up utilities
____________ have been developed specifically for pipelined systems. 3.

Optimizing compilers

4.

None of the
mentioned
 1.

Self-healing

2.

____________ is a feature provided by the Kubernetes open-source Storage healing

system. 3.

Software healing

4.

None

1.

Web application

2.

Application
____________ is a set of definitions and protocols that allow one Programming
application to communicate with another application. Interface

3.

System log

4.

Protocol

1.

Tautology

2.

_____________ allows attackers to infer the data present in a database Blind SQL injection
system even when the system is sufficiently secure to not display any 3.
erroneous information back to the attacker.
Piggybacked queries

4.

Illegal/logically
incorrect queries

1.

_____________ refers to vulnerabilities in application, utility, or operating Network attack

system code. surface

2.
 Intruder attack
surface

3.

Human attack
surface

4.

Software attack
surface

1.

Load

2.

_____________ is mainly used for improving the application performance Configuration

by helping to load the child objects on demand. 3.

Lazy loading

4.

CGF

1.

Union

2.

Intersection
_____________ is not the unary operator
3.

Set Difference

4.

Minus

1.

Deception

2.
______________ is a circumstance or event that may result in an
authorized entity receiving false data and believing it to be true. Unauthorized
Disclosure

3.

Disruption
 4.

Usurpation

1.

Confusion

2.
______________ is an encryption operation where the influence of one Jumble
plaintext symbol is spread over many ciphertext symbols with the goal of
hiding statistical properties of the plaintext. 3.

Misperception

4.

Diffusion

1.

$ docker kill
doubt
2.

$ docker rm
______________ command is used for stopping a running container.
3.

$ docker stop

4.

$ docker start

1.

Access Control

2.

Systems and
____________________ limits the information system access to Services Acquisition
authorized users, processes acting on behalf of authorized users, or
devices (including other information systems) and to the types of 3.
transactions and functions that authorized users are permitted to System and
exercise. Communications
Protection

4.

System and
Information Integrity
 1.

2.
A computer has 6 tape drives, with n processes competing for them. Each 3
process may need 2 drives. The maximum value of n for which the system is
guaranteed to be deadlock free is: 3.

4.

1.

a) 42

2.
A counting semaphore has a value of 8 at any given time of computation. On a) 2
this semaphore, 15 P operations and 20 V operations were completed. The
semaphore's resulting value is: 3.

a) 13

4.

a) 3

1.

A process has been allocated 3 page frames. Assume that none of the 2.
pages of the process are available in the memory initially. The process 8
makes the following sequence of page references (reference string): 1, 2, 1,
3, 7, 4, 5, 6, 3, 1 If optimal page replacement policy is used, how many page 3.
faults occur for the above reference string? 9

4.

10

1.

cookie

A ____________ is an object that maintains the connection between Java 2.

object application and database. session

3.

cache
 4.

persist

1.

Stateful
inspection firewall

2.

Application proxy
A _______________ applies a set of rules to each incoming and outgoing IP firewall
packet and then forwards or discards the packet. 3.

Packet filtering
firewall

4.

Circuit-level proxy
firewall

1.

Minimum
Spanning Tree

2.

Travelling
A _____is a round trip path along n edges of G that visits every vertex once salesman
and return to its starting position problem

3.

Multistage graph

4.

Hamiltonian
Circuit

1.

loss less join and

dependency
preserving
A BCNF is :
2.

loss less join but

not dependency
preserving
 3.

not loss less join

but dependency
preserving

4.

dependency
preserving

1.

Multiple Linear
Regression

2.

A dataset contains data collected by the Tamil Nadu Pollution Control Simple Linear
Board on environmental conditions (154 variables) from one of their Regression
monitoring stations. This data is further analyzed to understand the most
significant factors that affect the Air Quality Index. The predictive algorithm
that can be used in this situation is ___________.
3.

Logistic
Regression

4.

Multiple Ordinal
Regression

1.

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

3.
 n+1

4.

infinite

1.

Partial
dependency

2.

Join dependency
A functional dependency between two or more non-key attributes is called -
------------------ 3.

Transitive
dependency

4.

Trivial
dependency

1.

True
A JMS template helps you to obtain and release the JMS connection and
2.
session.
False

3. 4.

1.

control plane , data

plane

2.

A Kubernetes cluster has two main components : the _______ and storage plane,
_________, machines used as compute resources. container plane

3.

open plane ,
component plane

4.
 None

1.

aaa

2.

A language is represented by a regular expression (a)*(a+ba). Which of aba

the following string does not belong to the regular set represented by the
above expression
3.

ababa

4.

aa

1.

aaa

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

ababa

4.

aa

1.

Circular queue
A linear list in which insertions to and deletions from are made either end
2.
of the structure is a
Priority queue

3.
 Stack

4.

Dequeue

1.

op-code field &

operand field

2.

only operand field

A machine language instruction format consists of
3.

only op-code field

4.

only register
field

1.

15 states

2.

7 states

A minimum state DFA accepting the language L={w|w belongs {0,1}*}

number of 0s and 1s in w are divisible by 3 and 5, respectively} has 3.

9 states

4.

8 states

1.

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

3.

doubt
may be true

4.

always true

1.

TRUE

A package in Node.js contains all the files you need for a module. 2.

FALSE

3. 4.

1.

50%

2.

A program P calls two subprograms P1 and P2. The P1 can fail 50% times 70%
and P2 can fail 40% times. The program P can fail: 3.

60%

4.

10%

1.

A dynamically
A program P reads in 1000 integers in the range [0, 100] representing allocated array of 550
the scores of 500 students. It then prints the frequency of each score numbers
above 50. What would be the best way for P to store the frequencies? 2.

an array of 500
numbers
 3.

an array of 50
numbers

4.

an array of 100
numbers

1.

Both operations can

be performed in O(n)
time

2.

Both operations can

be performed in O(1)
A queue is implemented using an array such that ENQUEUE and time
DEQUEUE operations are performed efficiently. Which one of the 3.
following statements is CORRECT? (n refers to the number of items in
the QUEUE). ENQUEUE can be
performed in O(1) time
and DEQUEUE can be
performed in O(n) time

4.

ENQUEUE can be
performed in O(n) time
and DEQUEUE can be
performed in O(1) time

1.

worst case

2.
A randomized algorithm uses random bits as input inorder to achieve a best case
_____________ good performance over all possible choice of random
bits. 3.

average case

4.

Average and best

1.
A recursive function is defined as follows:
2
 2.

3.

If the value of h(4) is 88 then the value of k is : 1

4.

-1

1.

1 NF only

2.
A relation empdt1 is defined with attributes
2 NF and hence also in
Empdata (empcode, name, street, city, state, pincode). 1 NF

For any pincode, there is only one city and state. Also, for given street, 3.
city and state, there is just one pincode.
3NF and hence also in
In normalization terms, Empdata is a relation in 2NF and 1NF

4.

BCNF and hence also

in 3NF, 2NF and 1NF

1.

divide-and-conquer

2.

A simple approach that is efficient 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 header pointing to the last node
array

3.

linked list
 4.

stack

1.

Design modification

2.

User interface issues

A software requirement specification (SRS) document must avoid 3.
which among following:
Interface with third
party software

4.

Non-functional
requirements

1.

BCNF

2.

A table is in the ………………….. if only candidate keys are the Fourth Normal Form
determinants 3.

Fifth Normal Form

4.

Third Normal Form

1.

epsilon

2.

A*-A+ = 3.

A*

4.

A+
 1.

Visibility

2.

Inheritance
Access modifiers control the ______ of properties and methods
3.

Type

4.

Mocking

1.
According to the ISO-9126 Standard Quality Model. match the
(a)-(i), (b)-(ii), (c)-(iii), (d)-
attributes given in List-I with their definitions in List-II:
(iv)
List I List II
2.
i. Relationship between level of performance and (a)-(ii), (b)-(i), (c)-(iv), (d)-
a. Functionality
amount of resources (iii)
ii. Characteristics related with achievement of 3.
b. Reliability
purpose
(a)-(ii), (b)-(iv), (c)-(i), (d)-
c. Efficiency iii. Effort needed to make for improvement (iii)
d. Maintainability iv. Capability of software to maintain 4.

Choose the correct option from the ones given below: (a)-(i), (b)-(ii), (c)-(iv), (d)-
(iii)

1.

correct errors that were

not discovered till testing
phase

2.
Adaptive maintenance is a maintenance which __________. is carried out to port the
existing software to a new
environment.

3.

improves the system

performance

4.
 both b and c

1.

Auto Scaling

2.

EC2 Instances
Amazon S3 stores data as objects within resources called ?
3.

Buckets

4.

Amazon RDS

1.

Semi unsupervised
learning

2.
Among the following option identify the one which is not a type of Supervised learning
learning
3.

Reinforcement learning

4.

Unsupervised learning

1.

Virus

2.

WORM
Among the following, which will spread speed is faster?
3.

Malware

4.

Spyware

1.

An attempt to learn or make use of information from the system that Active attack
does not affect system resources is known as _____________ 2.

Passive attack
 3.

Actor attack

4.

Dynamic attack

1.

2.
An operating system has three user processes, each of which 4
requires two X units of resources. The smallest number of X units
required to ensure that no deadlocks occur is 3.

4.

1.

inband attack

2.

An _________ uses the same communication channel for injecting inferential attack
SQL code and retrieving results 3.

out-of-band attack

4.

out-of-channel attack

1.

Strong entity set

2.

An entity set which does not have enough attributes to form a Weak entity set.
Primary key is 3.

Weak relationship set

4.

Strong relationship set

 1.
Strong Entity Set
51 .
2.
Weak Entity Set
3.
An entity type whose existence is depend on another entity type is called -----------
Derived Attribute
-----
4.
Primary key

1.
LIFO buffer
2.
FIFO buffer
An instruction pipeline can be implemented by means of
3.
Stack
4.
QUEUE

1.
ng-app
2.
AngularJS expressions bind AngularJS data to HTML the same way as the ng-model
_________ directive 3.
ng-bind
4.
ng-init

1.
email filtering
2.
sentimental
Application of Machine learning is __________ analysis
3.
face recognition
4.
All of the above

1.
Optimization
2.
Maximization
Approximation algorithm are best applied to ________
3.
Minimization
4.
Decision
 1.
Optimal
2.
Decision
Approximation algorithm provide __________ solution
3.
Near-Optimal
4.
all of these

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

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

1.
5
2.
Assume a system has 9 identical resources and x processes competing for them.
4
Each process can request at most 3 resources. What is the maximum value of x at
3.
which the system will not deadlock?
3
4.
6
 1.

2.

Assume we perform a known-plaintext attack against Data Encryption Standard

with one pair of plaintext and ciphertext. How many keys do we have to test in a
3.
worst-case scenario if we apply an exhaustive key search in a straightforward way?

4.

1.

52. 2.

Assume we perform a known-plaintext attack against Data

Encryption Standard with one pair of plaintext and ciphertext. 3.
How many keys do we have to test in an 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, 1.

is initially empty. The CPU generates the following sequence of 6 and 1, 2, 3, 4
virtual addresses and uses the Least Recently Used (LRU) page 2.
replacement policy. 7 and 1, 2, 4, 5
0, 4, 8, 20, 24, 36, 44, 12, 68, 72, 80, 84, 28, 32, 88, 92 3.
How many page faults does this sequence cause? What are the 8 and 1, 2, 4, 5
page numbers of the pages present in the main memory at the 4.
end of the sequence? a) 9 and 1, 2, 3, 5

1.
Assume the array implementation of a circular queue. Which of front = rear = null
the following conditions holds when there is only one element in 2.
the queue? front = rear != null
3.
 front=rear+1
4.
front=rear-1

1.
DOUBT Simplex
2.
Ford Fulkerson
Assuming a pre flow was considered in which max flow algorithm?
3.
Edmonds-karp
4.
Push-relabel

1.
a) 51, 48, 54, 63, 64, 81, 34, 21,
15, 10, 3, 2
2.
Assuming the current disk cylinder to be 49 and the sequence for a) 48, 51, 54, 63, 64, 81, 34, 21,
the cylinders to be 2, 34, 48, 63, 51, 10, 3, 21, 54, 15, 64 and 81. 15, 10, 3, 2
Find the sequences of servicing using the Shortest Seek Time First 3.
(SSTF) disk schedule algorithm. a) 48, 51, 54, 63, 64, 81, 2, 3, 10,
15, 21, 34
4.
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
Both PCA and Lasso can be used for feature selection. Which one
of the following statement is true?
2.
PCA and Lasso are the same if you
use the kernel trick
 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 SimpleMessageConverter for
2.
converting TextMessage to or from a string.
False
3. 4.

1.
Is used first and order
C hierarchy decides which operator
2.
a.
Is speedy
b.
3.
c.
Is important
d.
4.
None of the above

1.
No
2.
Yes
3.
Can a DFSA simulate a NFSA
Sometimes

4.
Depends on NFA

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

Choose one of the options from the list below. Which metric
1.
would we not be able to use to measure the correctness of a
Mean Squared Error (MSE)
logistic regression model?
 2.
The area under the receiver operating
characteristics curve (or AUC-ROC
score)

3.
Log-loss

4.
Accuracy

1.
Choose the correct option according to the given statements Statement 1 and 2 are correct
regarding Risk Management. 2.
Statement 1: A risk is a potential problem - it might happen, it Only statement 1 is correct
might not.
Statement 2: Managers, software engineers, and customers 3.
participate in Risk Analysis and Management. Only statement 3 is correct
Statement 3: Only Managers participate in Risk Analysis and
Management. 4.
Statement 1 and 3 are correct

1.
∗ + a − bc/ − de − +f gh
2.
Choose the equivalent prefix form of the following expression ∗ + a − bc − /de − +fgh
(a+ (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
Choose the false statement about third party API from the scratch
following. 3.
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 used in the
Choose the incorrect statement with respect to Non- design process
Functional Requirement (NFR). 3.
Quantitative Approach – Find
measurable scales for the
functionality attributes
4.
Qualitative Approach – Study various
relationships between quality goals

1.
Only I is true
Circular queue is superior to linear queue in 2.
(I) Efficiency of implementation Only II is true
(II) Effective space utilization 3.
Pick the correct choice Both I and II are true
4.
Both I and II are false

1.
Cloud
2.
Cloud computing is a concept that involves pooling physical
Real
resources and offering them as --------- resource?
3.
Virtual
4.
Service

1.
dockerpull{ImageName}
2.
Command used to download docker image is . dockerimages{ImageName}
____________________ 3.
dockerNetwork{ImageName}
4.
dockerps{ImageName}

Consider a business organization with 120 employees. A new 1.

security policy demands encrypted message exchange with a 7140 key pairs
symmetric cipher. How many keys are required, if you are to 2.
ensure a secret communication for every possible pair of 120 key pairs
communicating parties? 3.
 240 key pairs
4.
60 key pairs

54.

1.
Consider three processes (process id 0, 1, 2 respectively) with
a) 7.33
computing bursts time units of 3, 4 and 7 respectively. All
2.
processes arrive at the same time. Consider the scheduling
a) 13
algorithm with the longest remaining time first (LRTF). In LRTF ties
3. DOUBT
are broken by giving priority to the process with the lowest
a) 8.33
process id. What is the average waiting time for the three
4.
processes?
a) 12

1.
Consider three processes with process ID 1, 2, and 3 and
a) 9, 9 and 7
computing burst time units of 2, 4, and 8 respectively. Every
2.
process arrives at the same time. Consider the scheduling DOUBT
a) 6, 9 and 7
algorithm in the order of the longest remaining time first (LRTF). If
3.
there is a tie in LRTF, we will prioritize the process with the highest
a) 12, 9 and 4
process ID. What is the waiting time of P1, P2 and P3
4.
respectively?
a) 12, 7 and 9

1.
Slope
2.
One unit
Consider a simple linear regression model (1-variable case). If
few change the input variable by one unit, the output variable
changes by
3.
Intercept
4.
No change

1.
Select A from R;
2.
Select A, COUNT(*) from R;
Consider a relation R(ABCD). 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
2.
Consider a relation scheme R = (A, B, C, D, E, H) on which the
AC, AE, DA
following functional dependencies hold: {A–>B, BC–>D, E–>C, D–
3.
>A}. What are the candidate keys of R?
AEH, BEH, DEH
4.
AEC, BED, DEH

1.
Dependency preserving and
lossless joins
2.
Dependency preserving but not
Consider a schema R(ABCD) and functional dependencies F={ A
lossless join
→ B, C → D}. Then the decomposition of R into R1 (AB) and R2(CD)
3.
is________.
Lossless join but not dependency
preserving.
4.
Neither dependency preserving nor
lossless join

1.
Consider a single dimension array A of size n with indices 1, 2, . . . nA = nB
, n that houses two stacks. Stack A is filled from index 1 towards 2.
right and stack B is filled from index n towards left. If nA is the nA = nB = n
number of elements in stack A and nB is the number of elements 3.
in stack B, then overflow occurs when a PUSH operation is nA + nB = n
performed on either stack and 4.
nA + nB ≥ n

1.
q[1]
Consider a standard circular queue, q whose size is 11 with 2.
elements q[0], q[1], q[2], . . . , q[10]. The front and rear pointers q[0]
are initialized to point at q[2]. In which position will the ninth 3.
element be added? q[9]
4.
q[10]

1.
Consider a Student table with schema Student(Regno, Name, Select * from student where
DOB, ContactNo) and Regno as the primary key. Identify the regno=19MID0021
equivalent query to the query "SELECT * FROM Student WHERE or phone=(select phone from
Regno=19MID0021 AND Phone=9999999999;" Identify the student where phone= 9999999999
correct query that is/are equivalent. order by phone);
2.
 Select * from student where regno
like’19MID%’ or phone=(select
phone from student where phone=
9999999999 order by phone);
3.
Select * from student where
regno=19MID0021 and phone in
(9999999999, 9999999998);
4.
Select * from student where
regno=’19MID0021’
AND phone=(select phone from
student where phone= 9999999999
order by phone);

1.
7
Consider the case of a non-negative counting semaphore S. This 2.
semaphore then completed 11 P operations and 5 V operations. 6
DOUBT
What is the largest initial value of S for which at least one P(S) 3.
operations are blocked? 5
4.
4

55.

1.
Underflow
occurs
2.
Consider the following operations performed on a stack of size 5 : Overflow occurs
Push(a); Pop(); Push(b); Push(c); Pop(); Push(d); Pop(); Pop(); Push(e) 3.
Which of the following statements is correct? Error occurs
4.
Stack operations
are performed
smoothly

1.
8.25
Consider the following processes, with the arrival time and the length of the CPU
2.
burst given in milliseconds. The scheduling algorithm used is preemptive shortest
10.25
remaining time first.
3.
What is the average turnaround time of these processes?
6.35
4.
 4.25

1.
both are false
Consider the following statements
2. both are
I. 2^(n+1) = O(2^n )
true 3.
II. 2^(2n) = O(2^n )
II is true I is false
Pick the correct choice.
4.
I is true II is false

1.
Only S1 is
correct
2.

Only S2 is
correct
Consider the following two statements: S1: { 0^2n | n >= l} is a regu1ar language} S2:
{ 0^m 0^n 0^(m+n) | m >= 1 and n >= 2} is a regu1ar language Which of the following
3.
statements is correct?
Both S1 and S2
are correct

4.
None of S1 and
S2 is correct

1.
all strings over
{x,y} with
substring yy
2.
all strings over
Consider the regular expression {x,y} with at most
(x+y)*y(x+y)*y(x+y)* two y’s
3.
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 = (111 + 11111)*. The minimum number of states in
5
any DFA accepting the language is
3.
8
4.
9

1.
1NF
2.
Consider the relation R (ABCDE): FD = { A → B, B → C, C → D, D → E} Find out the 2NF
highest normal form 3.
3NF
4.
BCNF

1.
10
Consider the table testable: 2.
Create table testable( A integer, B integer, primary key (A), unique(B), check(A 5
between 1 and 10), check (B between 1 and 5)); 3.
How many data records/tuples at most can this table contain? 15
4.
50

1.
Only S1 is
conflict-
serializable
2.
Consider the transactions T1, T2, and T3 and the schedules S1 and S2 given below.
Only S2 is
T1: r1(X); r1(Z); w1(X); w1(Z)
conflict-
T2: r2(Y); r2(Z); w2(Z)
serializable
T3: r3(Y); r3(X); w3(Y)
3.
S1: r1(X); r3(Y); r3(X); r2(Y); r2(Z); w3(Y); w2(Z); r1(Z); w1(X); w1(Z)
Both S1 and S2
S2: r1(X); r3(Y); r2(Y); r3(X); r1(Z); r2(Z); w3(Y); w1(X); w2(Z); w1(Z)
are conflict-
Which one of the following statements about the schedules is TRUE?
serializable.
4.
Neither S1 nor
S2 is conflict-
serializable.
 1.
a) 6, 5, and 9
Consider the virtual page reference string: 1, 2, 3, 2, 4, 1, 2, 3, 4, 1 on a demand
2.
paged virtual memory system running on a computer system that has main memory
a) 9, 5, and 8
size of 3 page frames which are initially empty. Let LRU FIFO and OPTIMAL denote
3.
the number of page faults under the corresponding page replacement policy. Then,
a) 9, 6, and 7
what is page fault value of FIFO, OPTIMAL and LRU respectively?
4.
a) 6, 4, and 8

1.
Simplex
2.
56 .
Ford Fulkerson
3.
Constrained by legal flow was considered in which max flow algorithm?
Edmonds-karp
4.
Push-relabel

1.
a) 1-b 2-d 3-
a 4-c
2.
Correctly match the following pairs:
a) 1-c 2-d 3-
1. Interrupt processing a. ELEVATOR
a 4-b
2. Belady’s anomaly b. Round robin
3.
3. Disk scheduling c. LIFO
a) 1-d 2-c 3-
4. Time sharing d. FIFO
b 4-a
4.
a) 1-c 2-b 3-
d 4-a

1.
Dependence
matrix
2.
SRS
Coupling and cohesion can be represented using a:
DOUBT1 3.
Cause-effect
graph
4.
Structure chart

1.
Cyclomatic complexity of a flow graph G with n vertices and e edges is V(G)=e+n-2
2.
 V(G)=e-n+2
3.
V(G)=e+n+2
4.
V(G)=e-n-2

1.
Data imaging
2.
Data virtualization
Data cloning, also called as _____________
3.
Data copy
4.
Data Mirroring

1.

k+1

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

1.
Write miss
2.
During a write operation if the required block is not present in the cache then Write latency
______ occurs. 3.
Write hit
4.
Write delay

1.
Primary Key
2.
Unique Key
Each foreign key refers to a …….. key in a relation.
3.
Composite Key
4.
Candidate Key

f(n) = O(g(n)) if and only if 1.

 g(n) = Ω(f(n))
2.
g(n) = ω(f(n))
3.
g(n) = O(f(n))
4.
g(n) = o(f(n))

1.
Intermediation
2.
Aggregation
Figure out which is not a service of cloud Broker?
3.
Arbitrage
4.
Auditing

1.
comma character (,)
57 . 2.
Colon character (:)
Filters can be added to expressions by using the 3.
______, followed by a filter. Hyphen character (-)
4.
Pipe character (|)

Find output
#include <stdio.h>
void show(int, float);
void main()
1.
{
Compiler Error
void (*s) (int, float);
2.
s=show;
Linker Error
(*s)(1,3.0);}
3.
1 3.00
void show(int i, float j )
4.
{
1
printf("%d %.2f",i,j);}
a.
b.
c.

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

1.

type-1

2.

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

type-3

4.
type-0

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

1.
For which of the following tasks, stack is not (b) and (d)
suitable data structure? 2.
(a) Binary search in an array (b) and (c)
(b) Breadth first search 3.
(c) Implementing function calls (a) and (c)
(d) Process scheduling 4.
(c) and (d)

1.
Given a set of news articles from many different
websites, find out what topics are the main
For which one the following task might K-means topics covered.
clustering be a suitable algorithm? 2.
Given sales data from a large number of
products in a supermarket, estimate future sales
for each of these products.
 3.
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.

1.
convertAndSend()
2.
For your front desk and back office classes, you can receiveAndConvert()
send and receive a map using the:- 3.
all of the mentioned
4.
none of the mentioned

1.
Dynamic Programming
2.
From the following which will not return optimal Divide and Conquer
solution 3.
Branch and Bound
4.
Approximation Algorithm

1.
Probably Approx Cost
2.
Probably Approximate Correct
Full form of PAC is _____________
3.
Probability Approx Communication
4.
Probably Approximate Computation
 1.
58. 5000 × 16
2.
Given a training data set of 5,000 instances, with each input 5000 × 15
instance having 15 dimensions and each output instance having 3. doubt
2 dimensions, the dimensions of the design matrix used in 5002 × 15
applying linear regression to this data is 4.
5000 × 17

1.

N^2

2.
Given an arbitrary non-deterministic finite automaton (NFA). with 2^N
N states, the maximum number of states in an equivalent 3.
minimized DFA is at least.
2N

4.

N!

1.
sort(int *a).
2. doubt
Given int a[5];how to declare array in the function definition if the
sort(int a[5])
function call is sort(a)______.
3.
sort(int *a),sort(int a[5])
4.
sort(int a).

1.

abaabaaabaa, aaaabaaaa,
baaaaabaaaab

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

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
deptname, address) same as their department name
Which of the following queries cannot be expressed using the 3.
basic relational algebra operations (U, -, x, π, σ, p)? The sum of all employees’ salaries
4.
All employees of a given
department

1.
Given two statements: Both statements are true
I. Insertion of an element should be done at the last node in a 2.
circular list Both statements are false
II. Deletion of an element should be done at the last node of the 3.
circular list. I is true and II is false
Which of the following is true? 4.
I is false and II is true

1.
NP
2.
P
Hamiltonian cycle is an example of __________
3.
NP - Complete
4.
NP - Hard

1.
1
2.
2
Hibernate has _____ cache types
3.
15
4.
20

1.
Class Relational Mapping
Hibernate ORM stands for? 2.
Class Object Mapping
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
59. 2.
Incremental process model
High speed adaptation of waterfall model in which rapid development 3.
is achieved by using a component-based 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
used
2.
By moving data to the cloud
How does fog computing reduce latency and the resources necessary
more quickly for processing
to transport data 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 evaluate the
5 PUSH and 4 POP operations
following expression by reverse polish notation in a stack machine (A ∗
3.
B) + (C ∗ D/E)?
6 PUSH and 2 POP operations
4.
5 PUSH and 3 POP operations

1.
1
2.
How many security accounts per client is provided by Microsoft? 3
3.
5
4.
7

1.
12
2.
12
How many two state FA can be drawn over alphabet {0,1} which 3.
accepts (0+1)* 16
4.
60

1.
HyperText Markup Language
2.
HTML stands for __________
HyperText Machine Language
3.
HyperText Marking Language
 4.
HighText Marking Language

1.
hypervisor
2.
virtual machine sprawl
IaaS offers an isolated environment to individual customers through?
3.
security vulnerabilities
4.
renting

1.
Nagios
2.
Jenkins
Identify the tool for DevOps?
3.
Monit
4.
All of the them

1.
Semi unsupervised learning
2.
60 .
Supervised learning
3.
Identify the type of learning in which labeled training data is used.
Reinforcement learning
4.
Unsupervised learning

1.
putchar(65).
2.
putchar(‘x’).
Identify the wrong statement.
3.
putchar(“x”).
4.
putchar(‘ ‘).

1.
Software Requirement
IEEE 830-1993 is a recommended standard for Specification
2.
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 maximum of
n
______________ 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 second, then its 1.6 * 10 ^ -9 sec
clock period is ________ 3.
1.25 * 10 ^ -10 sec
4.
8 * 10 ^ -10 sec

1.
automatic.
2.
If a storage class is not mentioned in the declaration then default static.
storage class is_________. 3.
external.
4.
register.

1.
If a system is 64-bit machine, then the length of each word will be 4 bytes
_______ 2.
8 bytes
3.
 16 bytes
4.
64 bytes

1.
A→B
2.
If attribute A determines both attributes B and C, then it is also true B → A.
that: 3.
C → A.
4.
(B,C) → A.

1.
A → C.
2.
B → C.
If attributes A and B determine attribute C, then it is also true that: 3.
(A,B) is a composite
determinant.
4.
C is a determinant.

1.

doubt
n
61.
2.
If M1 machine recognizing L with n states, then M2 recognizing L* constructed n+1
Using Thompson construction will have ------------- states. 3.
n+2
4.
n-1

1.
The tuple of R has
distinct values for T
2.
If T is a foreign key of the relation R then
T cannot have a null
doubt value for the tuples in
R
3.
 T is the key for some
other relation
4.
T is a Primary key for R

1.
n
2.
If the number of conditions in a decision table is n, the maximum number of 2n
rules (columns) possible is: 3.
2n
4.
log2 n

1.
NP
2.
If there exist a polynomial time reduction for a given problem then it belongs P
to______ 3.
NP - Complete
4.
NP - Hard

1.
Union all
2.
Union some
If we want to retain all duplicates, we must write ________ in place of union.
3.
Intersect all
4.
Intersect some

1.
1NF
2.
If you have removed repeated groups of values from a relation and also
2NF
removed the partial key dependencies, then we would say that the given
3.
relation is in
3NF
4.
BCNF

1.
f (n) = O(g(n))
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
2.
Imagine a Newly-Born starts to learn walking. It will try to find a suitable policy means algorithm
to learn walking after repeated falling and getting up. Specify what type of 3.
machine learning is best suited? reinforcement
learning
4.
None

1.
Factor Analysis
2.
PCA
3.
In _________ first factor explains the largest portion of the total variance?
Hierarchical
agglomerative
clustering
4.
K-means clustering

1.
64
2.
In Advanced Encryption Standard, for a 128-bit plain text as input, _______ bits 56
are encrypted in one iteration. 3.
16
4.
128
 1.
32
62. 2.
64
In Data Encryption Standard, for a 64-bit plain text as input, _______ bits are 3.
encrypted in one round. 56
4.
28

1.
Fraction
2.
In Elliptic Curve Cryptography the public key is a point on the curve, while Non-integer
the private key is an ______________ 3.
Integer
4.
Point on the curve

1.
Timer
2.
In Pretty Good Privacy (PGP) encryption, the time at which the signature Timestamp
was made is referred to as 3.
Counter
4.
Stamp

1.
32-bit
2.
In Secure Hash Algorithm (SHA-1), each round requires only bitwise 1-bit
Boolean operation with ______ registers 3.
8-bit
4.
16-bit

1.
4
2.
In Secure Hash Algorithm (SHA-1), the compression function consists of 20
_____ rounds. 3.
80
4.
40

In Secure Sockets Layer (SSL), the ___________ defines a shared secret key 1.
that is used for conventional encryption of SSL payloads. TCP
 2.
IP
3.
HTTP
4.
Handshake Protocol

1.
Associative
2.
In ____________ mapping, the data can be mapped anywhere in the Cache Direct
Memory. 3.
Set Associative
4.
Indirect

1.
Secure Sockets Layer
(SSL)
2.
Transport Layer Security
In _______________ , the padding can be any amount that results in a total
(TLS)
that is a multiple of the cipher's block length, up to a maximum of 255
3.
bytes.
Hypertext Transfer
Protocol (HTTP)
4.
Hypertext Transfer
Protocol Secure (HTTPS)

1. no pointer 2.
1 pointer
In a circularly linked list organization, insertion of a record involves the 3.
modification of 2 pointers
4.
3 pointers

1.
3
2.
5
In a MapReduce programming model, the number of mapper for word
3.
counting of a document with five paragraph
depends on the data
segment
4.
2
63.

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.
LDA
2.
In a memory-mapped I/O system, which of the following ADD
will not be there? 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.

In Advanced Encryption Standard, the finite field contains

256 elements and is denoted as _______. 2.

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, what
3.
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.
Right shift AQQn+1
2.
Subtract Multiplicand from A and
ArRight shift AQQn+1
In Booth's multiplication algorithm, if QnQn+1 = 01, what
3.
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.
failover
2.
In case of cluster or a service failure, the services are
transferover
instantly transferred to a replica cluster configuration where
3.
they resume functionality is called __________
configover
4.
serviceover

1.
Development Group Expertise, Problem
Characteristics, User Expectations
In choosing a development life-cycle model, one would
2.
consider the
Languages, Development Schedule,
Competition
3.
 System Context, User Population,
Platforms
4.
Organizational Structure, User Tasks,
Performance 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 A in order to look up the value
In database context ‘A determines B ‘ refers to
of the attribute b
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

64.

1.
O(N)

2.
In divide and conquer, the time is taken for merging
O(N log N)
the sub problems is
3.
O(N2)
4.
O(log N)

1.
Primary Attribute
2.
In ER diagram, an attribute which can have many Composite Attribute
values for a single entity is called as 3.
Derived Attribute
4.
Multivalued attribute

In Galois field, the number of elements in the field 1.

is called the _________ of the field. Cardinality
 2.
Cartesian
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.
In how many stages the MapReduce program 3
executes? 3.
4
4.
5

1.
src=”_blank”
2.
In HTML, which attribute is used to create a link alt=”_blank”
that opens in a new window tab? 3.
target=”_self”
4.
target=”_blank”

1.
equals to two
2.
In multiclass classification number of classes less than two
must be_______________ 3.
greater than two
4.
None

1.
Binary
2.
In relational algebra, Cross Product (Cartesian
Unary
product) is 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 in
the Accumulator.

1.
a JavaScript code in which the application will run
2.
In the below given statement, "myApp" parameter a JSON file
refers to ___ 3.
an HTML element in which the application will run
4.
SQL queries

65.

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 of maps Output
is usually driven by the total size of ____________ 3.
Task
4.
Memory
 1.
Secure Sockets Layer (SSL)
2.
Transport Layer Security (TLS)
In_________ , the padding can be any amount that results in a total
3.
that is a multiple of the cipher’s block length, up to a maximum of
Hypertext Transfer Protocol
255 bytes.
(HTTP)
4.
Hypertext Transfer Protocol
Secure (HTTPS)

1.
Steplet
2.
Indeed, a step could be considered the smallest unit of work for a
Tasklet
job. Input (what’s read) is passed to the Step and potentially
3.
processed; then output (what’s written) is created from the step.
All of the mentioned
4.
None of the mentioned

1.
JmsGatewaySupport
2.
JMS sender and receiver classes can also extend to retrieve a JMS JmsGateway
template:- 3.
All of the mentioned
4.
None of the mentioned

1.
Move the cluster centroids,
where the centroids, μk are
updated.

K-means is an iterative algorithm, and one of the following step is 2.

repeatedly carry out in its inner loop Test on the cross-validation set.

3.
Randomly initialize the cluster
centroids
4.
Number of data objects

1.
Kubernetes can effectively self-detect two types of objects
pod status , container status.
________ and _________.
2.
 storage status, container status.
3.
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.
Container
Kubernetes is
3.
Operating system
4.
Micro services
66.

1.
Container Storage
Interface (CSI)
2.
Configuration Storage
Kubernetes' ____________ allows third-party vendors to easily create storage
Interface(CSI)
solutions for containerized applications.
3.
Kubernetes Storage
Interface(KSI)
4.
None

1.
2(n – 1)
2.
Let a Relation R have attributes {a1, a2, a3,…, an} and the candidate key is “a1 2(n – 1) + 1
a2 a3” then the possible number of super keys? 3.
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) = O(g(n)) using the 6
standard definition of big-oh notation. Then the value of n0 is 3.
7
4.
8

1.
Θ(f(n) + g(n))
2.
Let f(n) and g(n) are asymptotically non-negative functions. The value of Θ(f(n).g(n))
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 tightest upper bound
2.
on the running time on DFS of G? Assume that the graph is represented using
O(n)
adjacency matrix.
3.
O(m+n)
 4.
O(mn)

1.
L^+ = { }
2.
L^+ = {Epsilon }
Let L = {Epsilon} (i.e., L consist the empty string only). Then L^+ =?
3.
can not be defined
4.
none of the choices

1.
ii
2.
let L={ab,aa,baa}. Which of the following strings are in L*. i)abaabaaabaa
ii and iii
ii)aaaabaaaa iii)baaaaabaaaab iv)baaaaabaa which strings are in L4?
3.
ii and iv
4.
i,ii and iii

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

1.
In BCNF
2.
Let R(A, B, C, D, E, P, G) be a relational schema in which the following
In 3NF, but not in
functional dependencies are known to hold:
BCNF
AB —> CD, DE —> P, C --> E, P --> C and B —> G .
3.
The relational schema R is
In 2NF, but not in 3NF
4.
Not in 2NF

1.
u-1
Let u=’1101’, v=’0001’, then uv=11010001 and vu= 00011101.Using the given 2.
information what is the identity element for the string? v-1

3.
 u-1v-1
4.
ε

67.

1.
Both in single-link
and complete-link
clustering

2.
It is possible in
Let us consider single-link and complete-link hierarchical clustering. In which
single-link clustering
of these approaches, it is possible for 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.
only I
Let f (n) and g(n) be asymptotically positive functions. 2.
Which of the following is true? only II
(I) f (n) = O((g(n)) implies g(n) = O(f (n)) 3.
(II) f (n) + g(n) = Θ(min(f (n), g(n))) both I and II
4.
neither I nor II

1.
because of only I
2.
Linked lists are superior to arrays because because of both I and
(I) Size of a linked list need not be specified at compile-time II
(II) Linked list do not need contiguous memory locations 3.
Pick the correct choice because of only II
4.
not because of I and
II
 1.Blockchain 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 store for information
2.
regarding a given Job.
False
3. 4.

1.
True
MapJobRegistry instance. This is critical—it is the central store for information
2.
regarding a given Job.
False
3. 4.

1.
1-c , 2-a , 3-d , 4-b
Match the List 1 to List 2 and choose the correct option.
2.
1. Requirement Elicitation ——- a. Module Development and integration
1-c , 2-a , 3-b , 4-d
2. Design——————————b. Analysis
3.
3. Implementation——————c. Structure and behavioral
1-a , 2-c , 3-d , 4-b
4. Maintenance ——————— d. Performance tuning
4.
1-b , 2-c , 3-a , 4-d

1.
A – 2, B – 3, C – 1, D –
4

Match the following. 2.

List-I List-II A – 2, B – 1, C – 4, D –
A. Myhill-Nerode Theorem 1. Graph coloring 3
B. Arden's Theorem 2. language L is regular or not 3.
C. Register allocation 3. Expression evaluation A – 2, B – 4, C – 1, D –
D. Operator precedence 4. Regular expression 3

4.
A – 2, B – 3, C – 4, D –
1

1.
Max-flow is unique for the graph provided
yes
 2.
No
3.
May be
4.
None of these

1.
Request and
Response
2.
Publish and
MQTT protocol works on the principle of .....
Subscribe
3.
Push and Pull
4.
Send and Receive

68.

1.
loop

2.
function
n structural language, we can't add a new sort of
3.
variable

4.
constant

1.
Iteration size
2.
Cost
n the Spiral model of software development, the primary determinant in 3.
selecting activities in each iteration is Adopted process such as
Rational Unified Process
or Extreme Programming
4.
Risk

1.
Node.js files have extension?
.njs
 2.
.node
3.
.js
4.
.nj

1.
Command Prompt
2.
nodejs Editor
Node.js files must be initiated in the?
3.
Both A and B
4.
None of the above

1.
https
2.
http
Node.js has a built-in module called?
3.
server
4.
module

1.
single-threaded
2.
non-blocking
Node.js runs? 3.
asynchronously
programming
4.
All of the above

1.
asynchronous
2.
synchronous
Node.js uses _____________ programming.
3.
Both A and B
4.
None of the above

1.
Numeric enums first value is defaulted to what? 10
2.
 5
3.
1
4.
0

1.
Element directives
2.
On which of the following types of components can we create a custom Attribute
directive? 3.
CSS
4.
All of these

1.
One of the most attractive applications of public-key algorithms is the
Alice
establishment of a secure session key for a private-key algorithm such as
2.
Advanced Encryption Standard over an insecure channel. Assume Bob
Bob
has a pair of public/private keys for the RSA cryptosystem. Suppose they
3.
develop a simple protocol using RSA which allows the two parties Alice
Both
and Bob to agree on a shared secret key. Who determines the key in this
4.
protocol?
Third party

69.

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.
Parse tree construction was a part of which NPC 3 CNF SAT
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.
instruction pre fetch
Pipelining strategy is called implement
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
3.
Point out the correct statements about hybrid cloud
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.
loud 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

70.

1.
Merging
2.
Partitioning
Quick sort uses which of the following method to implement sorting
3.
Selection
4.
Exchanging

1.
divide and conquer
2.
Quicksort uses which approach to algorithm design greedy
3.
brute force
4.
 dynamic
programming

1.
Reinforcement
Learning
2.
Supervised Learning
Real-Time decisions, Game AI, Learning Tasks, Skill acquisition, and Robot
3.
Navigation are applications of
Unsupervised
Learning
4.
Semi- Supervised
Learning

1.
Regarding user-level threads and kernel-supported threads, consider the 2, 3, & 4
following remarks. 2.
1. Use-level threads are transparent to the kernel 1, 2, & 3
2. Context switch is faster with kernel- supported threads 3.
3. Kernel-supported threads can be scheduled independently 1, 3, & 4
4. For user-level threads, a system call can block the entire process 4.
2&4

1.
2
Relation R has eight attributes ABCDEFGH. Fields of R contain only atomic 2.
values. F = {CH -> G, A -> BC, B -> CFH, E -> A, F -> EG} is a set of functional 4
dependencies (FDs) so that F+ is exactly the set of FDs that hold for R. 3.
How many candidate keys does the relation R have? 8
4.
No Limit

1.
No redundancy
2.
Redundancy with
Relation R with an associated set of functional dependencies, F is decomposed prime attribute
into BCNF. The redundancy based on functional dependencies in the resulting 3.
set relations is. Proportional to the
size of F+
4.
Redundancy with
candidate key.

1.
Replication Controllers and Deployment Controllers are 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
RTN stands for ___________ Notation
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)
71.

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 model multi-tenancy
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 mainframes
Scheduling is
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.
Secure Hash Algorithm (SHA-1) produces a 160-bit output of a
message with a maximum length of ________ bit.
doubt
2.
 3.

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 secure service
3.
Network Control Protocol
4.
Transmission Protocol

1.
hierarchically valid certificate
2.
Secure/Multipurpose Internet Mail Extension (S/MIME) relies on a user
______ for key exchange. 3.
sender
4.
receiver

1.
TRUE
SessionFactory provides an instance of Session. 2.
FALSE
3. 4.

1.
True
SimpleJobLauncher, whose sole purpose is to give you a mechanism
2.
to launch batch jobs, where a “job” in this case is our batch solution.
False
3. 4.

1.
True
SimpleJobLauncher, whose sole purpose is to give you a mechanism
2.
to launch batch jobs, where a “job” in this case is our batch solution.
False
3. 4.
72.

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.
chunking
2.
remote chunking
Spring Batch provides a mechanism to offload processing to
another process. 3.
remote
4.
none of the mentioned
 1.
True
Spring provides an implementation of SimpleMessageConvertor to
2.
handle the translation of a JMS message received.
False
3. 4.

1.
SimpleMessageListenerContainer

2.
DefaultMessageListenerContainer
Spring provides several types of message listener containers:-
3.
all of the mentioned

4.
None of the mentioned

1.
b, a, c
Stack A has the entries a, b, c (with a on top). Stack B is empty. An
2.
entry popped out of stack A can be printed immediately or pushed
b, c, a
to stack B. An entry popped out of the stack B can be only be
3.
printed. In this arrangement, which of the following permutations
c, a, b
of a, b, c is not possible?
4.
a, b, c

1.
Coding
2.
Statistically, the maximum percentage of errors belong to following Design
phase of software development life cycle. 3.
Specification
4.
Installation and maintenance

1.
input attribute
2.
Supervised learning and unsupervised clustering both require hidden attribute
_______. Which is correct according to the statement 3.
output attribute
4.
categorical attribute
73.

1.
R3(A, B, C, P, Q, R, N)
Suppose that there are two entity sets, R1 and R2 with attributes A, B, C and P, 2.
Q, R respectively. Here, A is the key for R1 and Q is the key for R2. If there exists R3(A, Q, N)
a many-to-many relationship R3 from R1 to R2 with an attribute N, what would 3.
be the schema for R3 after converting the ER diagram into schemas? R3(A, Q)
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. 2.

Each class has a different probability distribution from which the sample Each class has the
points are drawn. We do not have the class labels. We use k-means clustering same mean
to try to guess the classes. Which one of the following circumstances would 3.
undermine its effectiveness? Some of the classes
are not normally
distributed
4.
You choose k != n, the
number of sample
points

1.
filename.js
2.
javascript filename.js
Syntax to Initiate the Node.js File is?
3.
node filename.js
4.
node filename

1.
JmsTemplate
2.
Template which can send and receive JMS messages with much less code EMail
3.
All of the mentioned
4.
 None of the
mentioned

1.
normal encoding
2.
normal encryption
The _______________ is useful when the data consists largely of octets that 3.
correspond to printable ASCII characters. quoted-printable
transfer encoding
4.
base64 transfer
encoding

1.
modular
exponentiation
The addition operation in Elliptic Curve Cryptography is the counterpart of 2.
modular multiplication in RSA, and multiple addition is the counterpart of modulation
____________________ 3.
exponentiation
4.
multiplication

1.
Direct
2.
The addressing mode executes the instruction within the CPU without using
Immediate
any other operands.
3.
A.
Implied
4.
Register

1.
Indirect
2.
The addressing mode which is most suitable for changing the normal Immediate
sequence of execution is----- 3.
Relative
4.
Indexed

1.
The addressing mode which uses the PC instead of general purpose register is- Direct
-- 2.
A. Relative
3.
 Indexed with offset
4.
Indirect

1.
Form-based login
service
2.
Logout Service
The basic security services registered and configured by Spring Security.
3.
HTTP Basic
authentication
4.
all the above

74.

The Bayes rule can be used in _____

1.
Answering probabilistic query

2.
Solving queries

3.
Increasing complexity

4.
Decreasing complexity

The essential content(s) in each entry of a page table is / are

1.
Virtual page number

2.
a) Page frame number

3.
Both virtual page number and page frame number

4.
a) Access right information

The following code snippet is to be tested for statement coverage:

begin

if (a==b) (S1; exit ;)

else if (c==d) (S2 ; )

else (S3; exit ; )

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?

1.
T1, T2, T3

2.
T2, T4

3.
T3, T4

4.
T1, T2, T4

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 are, what can we say about the average cohesion
and coupling between modules in the system of two modules?
1.
There is no change

2.
Average cohesion goes up but coupling is reduced

3.
Average cohesion goes down and coupling is reduced

4.
Average cohesion and coupling increase

The following is a solution to the Dining Philosophers Problem that avoids deadlock:

1.
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 up the left fork before the right fork, and that
all other philosophers pick up the right fork before the left fork

The greatest common divisor of 7469 and 2464 is

1.
77

2.
1

3.
0

4.
22

The insertion of bits into gaps in a data stream to frustrate traffic analysis attempts is referred to
as ___________________.

1.
Traffic Padding

2.
Digital Signature

3.
Notarization

4.
Authentication Exchange

The instruction Add #28,R3 does---

A.

B.

1.
Add 28 with the value of R3 and store the result in R3.

2.
Add 28 with the address stored in R3 and store the result in R3

3.
Add the value of R3 with the value of memory location 28

4.
Add the value 28 with the value of a memory location that is stored in R3.

The modification of software to match changes in environment falls under which category of
software maintenance?

1.
Perfective

2.
Adaptive

3.
Corrective

4.
Preventive

The operands of zero address instructions are stored in,

1.
Accumulator

2.
Cache Memory location

3.
Stack

4.
CPU registers

75.

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 defined is Non-Deterministic
called _______ 3.
Approximation
4.
Backtracking

1.
the number of command line
strings including the execution
command.
2.
the number of command line
The arguments argc in main( ) counts_______.
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, deletion,
3.
or replay) is known as _____________.
Data Reception
4.
Data Integrity

1.
simple attribute
2.
composite attribute
The attribute that can be divided into other attribute is called
3.
multi-valued attribute
4.
derived attribute

1.
isa
The average number of steps taken to execute the set of 2.
instructions can be made to be less than one by following pipelining
3.
super-scaling
 4.
sequential

1.

it sometimes fails to recognize

grammars that are regular

2.

it sometimes recognized
The basic limitation of FSM is that
grammars that are not regular

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 used or Dirty bit
not is _______ 3.
Control bit
4.
Idol bit

76.

1.
Solution Space
2.
The Candidate-Elimination Algorithm represents the Version Space
__________ 3.
Elimination Space
4.
All of the above

1.
Supervised learning
The categories in which Machine learning approaches can 2.
be traditionally categorized are ______ Unsupervised learning
3.
Reinforcement learning
 4.
All of the above

1.
(i) and (iv)
2.
The CFG are closed for
(i) and (iii)
(i) Intersection (ii) Union
3.
(iii) Concatenation (iv) Star operation
(ii) and (iv)
4.
(ii), (iii) and (iv)

1.
require different amount of time
2.
require about the same amount of time
3.
The concept of pipelining is most effective in improving
require different amount of time with time
performance if the tasks being performed in different
difference between any two tasks being
stages
same
4.
require different amount with time
difference between any two tasks being
different

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

1.
Structural hazard
2.
The contention for the usage of a hardware device is called Stalk
______________ 3.
Deadlock
4.
None of the mentioned

1.
The effectiveness of an SVM depends kernel parameters
upon________________ 2.
selection of kernel
 3.
soft margin parameter
4.
All of the above

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

1.
queue
2.
The efficient data structure to insert/delete a number linked list
to/from a stored set of numbers is 3.
doubly linked list
4.
binary tree

1.
0 -1 +2
2.
The encoded form of the multiplier, 11010 in Modified
0 -1 -2
Booth’s algorithm is,
3.
A
0 +1 -2
4.
0 +1 +1

77.

1.
-6
2.
The expression x= 4+2%-8 evaluates to 4
a. 3.
-4
4.
6

The final output of Hierarchical clustering is- 1.

 The tree
representing how
close the data
points are to each
other

2.
The number of
cluster centroids

3.
A map defining the
similar data points
into individual
groups
4.
Takes each data
point as an
individual x
number of cluster

1.
True
The first fit algorithm never uses more bins than the next fit algorithm 2.
False
3. 4.

1.
A
The five items: A, B, C, D and E are pushed in a stack, one after other starting from 2.
A. The stack is popped four items and each element is inserted in a queue. The two B
elements are deleted from the queue and pushed back on the stack. Now one item 3.
is popped from the stack. The popped item i C
4.
D

1.
1, 5
2.
The following postfix expression with single digit operands is evaluated using
3, 2
stack. 8 2 3 ∧ / 2 3 ∗ + 5 1 ∗ −. The top two elements of the stack after the first ∗ is
3.
evaluated are
6, 1
4.
5, 7

The fs.read() method is used to read files on your computer 1.

 TRUE
2.
FALSE
3. 4.

1.
Extendible
hashing
2.
The hashing technique that allows a hash file either to expand or to shrink Linear hashing
dynamically is __________. 3.
Non-linear
hashing
4.
External hashing

1.
Dynamic hashing
2.
Static hashing
The hashing technique which allocates fixed number of buckets is classified as
3.
External hashing
4.
Internal hashing

1.
3 deletions 3
additions
2.
2 deletions 3
The initial configuration of queue is a, b, c, d with a at the front. To get the additions
configuration d, c, b, a how many deletions and additions required? 3.
3 deletions 2
additions
4.
1 deletions 3
additions

1.
Many number of
0’s and 1’s
2.
The language { w ∈ Σ*| w contains 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

78.

1.

Finite state automata

2.

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

4.

Turing machine

1.
Logical Cohesion
2.
Coincidental Cohesion
The lower degree of cohesion is kind of 3.
Procedural Cohesion
4.
Communicational
Cohesion

The member variable of structure is accessed by using______. 1.

 dot (.) operator.
2.
arrow (->) operator
3.
asterisk * operator
4.
ampersand & operator

1.
CMOS
2.
The memory devices which are similar to EEPROM but differ in the cost Memory sticks
effectiveness is ______ 3.
Blue-ray devices
4.
Flash memory

1.
createMessage()
2.
create()
The MessageCreator interface declares method:-
3.
createMsg()
4.
none of the mentioned

1.
Exceptions
2.
The method of synchronising the processor with the I/O device in which Signal handling
the device sends a signal when it is ready is? 3.
Interrupts
4.
DMA

1.
two
2.
The minimum length for strings in the regular expression ( 10* + 001* )*
zero
is_________
3.
one
4.
infinite

1.
The most general form of distance is Eucledian
2.
 Manhattan

3.
Mean
4.
Minkowski

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

1.
module.expose
2.
module
The Node.js modules can be exported using
3.
module.exports
4.
All of the above

79.

1.
Cardinality
2.
Degree
The number of attributes in relation is called as its
3.
Tuples
4.
Entity

1.
Greater
2.
The number of states in DFA is --------than the number of
less
states in NFA for the same Language.
3.
greater equal
 4.
equal

1.
Access rate
2.
The number successful accesses to memory stated as a Success rate
fraction is called as _____ 3.
Hit rate
4.
Miss rate

1.
machine learning algorithm
2.
The output of training process in machine learning machine learning model
is________________ 3.
null
4.
accuracy

1.
call by function
2.
call by reference.
The pointers can be used 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 file is partitioned into smaller parts

and different parts are stored in different disks is 2.
Mirroring
 3.
Stripping
4.
RAID classification

1.
Polling
2.
The process wherein the processor constantly checks the Inspection
status flags is called as ___________ 3.
Reviewing
4.
Echoing

1.
iterative model
2.
The quick design of a software that is visible to end users prototype model
leads to _____. 3.
spiral model
4.
waterfall model

1.
To increase the internal memory of the
system
The reason for the implementation of the cache memory is 2.
________ 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

80.

1.
may be different
2.
The recognizing capabilities of NDFSM and
must be different
DFSM
3.

must be same
 4.
none of the above

1.
T(n) = T(n − 2) + C
2.
The recurrence relation for the recursive
T (n) = T (n − 1) + C
factorial algorithm is (Assume C is any integer
3.
constant)
T(n) = T( n/ 2 ) + C
4.
T(n) = T( n/ 2 − 1) + C

1.
11100
2.
The result of -8+5 using 1’s complement
00011
algorithm,
3.
A.
10011
4.
11101

1.
(a+b)*
2.
The set of all strings over the alphabet {a,b} (a+b)^+
(including epsilon} is denoted by 3.
a^+b^+
4.
a*b*

1.
Data hazard

2.
Stock
The situation wherein the data of operands are
not available is called ______
3.
Deadlock

4.
Structural hazard

The spatial aspect of the locality of reference

1.
means ________
 That the recently executed instruction is executed
again next
2.
That the recently executed won’t be executed again
3.
That the instruction executed will be executed at a
later time
4.
That the instruction in close proximity to the
instruction executed will be executed in future

1.
Database Schema
2.
The structure of the database in a formal
Conceptual Schema
language acceptable by the DBMS is
3.
represented by ----------------------
Internal Schema
4.
External Schema

1.
Regression problems
2.
The supervised learning problems can be Classification problems
grouped as ____________ 3.
Both A and B
4.
None of the above

1.
org.springframework.jms.Jms
The template handles the boilerplate tasks for 2.
you and also converts the JMS API org.springframework.jms.JmsException
JMSException hierarchy into Spring runtime 3.
exception:- org.springframework.jms.JmsTemplate
4.
none of the mentioned

1.
That the recently executed instruction won’t be
executed soon
2.
The temporal aspect of the locality of reference
That the recently executed instruction is temporarily
means ________
not referenced
3.
That the recently executed instruction will be
executed soon again
 4.
That the adjacent item of the recently executed
instruction will be executed soon

81.

1.
O(N)
2.
The time complexity of each point is pushed into the stack once,
O(N log N)
each point is removed from the stack at most once in Graham
3.
scan is
O(1)
4.
O(log N)

1.
Block transfer
2.
Word transfer
The transfer between CPU and Cache is ______________
3.
Set transfer
4.
Associative transfer

1.
TRUE
The URL module splits up a web address into readable parts. 2.
FALSE
3. 4.

1.

2.

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

4.
Final state
 1.
2
2.
3
There are ________ types of Pods in kubernets?
3.
4
4.
6

1.
TextMessage
2.
MapMessage
There are several types of messages defined in the JMS API,
including:-
3.
BytesMessage
4.
All of the mentioned

1.
Single Program Multiple Data
These computer uses the stored-program concept. Memory is (SPMD)
used to store both program and data instructions and central 2.
processing unit (CPU) gets instructions and/ or data from Flynn’s taxonomy
memory. CPU, decodes the instructions and then sequentially 3.
performs them. Von Neumann Architecture
4.
Harvard architecture

1.
Reinforcement learning algorithm

2.
Thompson sampling is a___
Probabilistic algorithm
3.
Based on Bayes inference rule
4.
Sampling based algorithm

1.
Delete the last element of the list
2.
Time of which of the following operations depends on the length
Delete the first element of the list
of a singly linked list?
3.
Add an element after the last
element of the list
 4.
Interchange the first two elements
of the list

1.
JPAFlowExecutionListener
2.
HibernateFlowExecutionListener
To integrate Hibernate with Spring Web flows.
3.
JTAFlowExecutionListener
4.
All of them

82.

1.
JmsTemplate
2.
JmsTemplate102
To address different JMS APIs, Spring provides :-
3.
All of the mentioned
4.
None of the mentioned

1.
Black Box Testing

2.
To execute all loops at their boundaries and within their operational Alpha Testing
bounds is an example of
3.
Recovery Testing
4.
White Box Testing

1.
function()
2.
To include a module, use the ___________ function with the name of the require()
module. 3.
exports()
4.
module()

To send a JMS message with this template, you simply call:- 1.

 send
2.
sendTo
3.
all of the mentioned
4.
none of the mentioned

1.
pseudorandom function
2.
Transport Layer Security (TLS) makes use of a __________ to expand arithmetic function
secrets into blocks of data for purposes of key generation or validation. 3.
binomial function
4.
Poisson function

1.
O(m*n)
2.
Two balanced binary trees are given with m and n elements, respectively.
O(m+n)
They can be merged into a balanced binary search tree in ____________
3.
time.
O(m*log n)
4.
O(m*log(m+n))

1.
bare metal hypervisor
2.
hosted hypervisor
Type-1 hypervisor is also called as
3.
type-0 hypervisor
4.
direct hypervisor

1.
Lowest path cost
2.
Heuristic cost
Uniformed-Cost Search expands the node n with the
3.
Highest path cost
4.
Average path cost

1.
Verification is __________________. Making sure that it is what
the user really wants
 2.
Checking that we are
building the right system
3.
Checking that we are
building the system right
4.
Performed by an
independent test team

1.
Threat
2.
Weakness in an information system, system security procedures, internal
Risk
controls, or implementation that could be exploited or triggered by a
3.
threat source is known as _______
Vulnerability
4.
Adversary

83.

1.
Representational State Transform
2.
Representational State Transfer
What does the Acronym REST stand for?
3.
Represent State Transform
4.
Represent State Transfer

1.
Usability, Reliability, Security, Flexibility
2.
What are the four dimensions of Availability, Reliability, Maintainability, Security
Dependability? 3.
Availability, Reliability, Security, Safety
4.
Security, Safety, Testability, Usability

1.
Real time Data intensive
2.
What are the key features of Node.js?
Highly scalable servers for Web Applications
3.
Builds fast and scalable network Applications
 4.
All of the above

1.
Boolean, Number, String
2.
What are the three main 'simple types' in Object, Array, Symbol
TypeScript? 3.
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 Typescript?
3.
It cannot contain spaces and special characters except
underscore (_) and dollar ($) sign
4.
All of these

1.
Containers
2.
Virtual machines
What can you deploy on Kubernetes?
3.
System processes
4.
None of them

1.
include all of them in the increasing distance from Pi
2.
What if several points on same edge of Just pick the one with maximum distance from Pi
convex hull in Graham Scan Algorithm 3.
Ignore the points and move on to pick the next point
doubt 4.
Include all the points

1.
O(nlogn)
What is average time complexity of 2.
randomized quick sort O(n^2)
3.
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 AngularJS?
3.
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 programs
What is Machine 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

84.

1.
Streams data in
asynchronously
2.
Streams data in
What is subscribe?
synchronously
3.
Both
4.
None of these

What is the appropriate pairing of items in the two columns listing 1.

various activities encountered in a software life cycle? P-3, Q-2, R-4, S-1
P. Requirements Capture 1. Module Development and Integration 2.
Q. Design 2. Domain Analysis P-2, Q-3, R-1, S-4
R. Implementation 3. Structural and Behavioral Modeling 3.
S. Maintenance 4. Performance Tuning P-3, Q-2, R-1, S-4
4.
P-2, Q-3, R-4, S-1

1.
Task
2.
Pod
What is the basic operational unit of Kubernetes?
3.
Nodes
4.
Container

1.
</doctype html>
2.
<doctype html>
What is the correct syntax of doctype in HTML5?
3.
<doctype html!>
4.
<!doctype html>

1.
CostCLOUD =
Σ(UnitCostCLOUD / (Revenue
+ CostCLOUD))
2.
CostCLOUD =
Σ(UnitCostCLOUD / (Revenue
What is the correct formula to calculate the cost of a cloud computing – CostCLOUD))
deployment? 3.
CostCLOUD =
Σ(UnitCostCLOUD x (Revenue
– CostCLOUD))
4.
CostCLOUD =
Σ(UnitCostCLOUD x (Revenue
+ CostCLOUD))

1.
B2
What is the cost involved for B2(outer loop) in the code which
2.
calculating time complexity sum = 0; for(i=0; i<N; i++) B2 for(j=0; j<N;
B2*(N+1)
j++) sum += arr[i][j];
3.
B2*N*(n+1)
 4.
B2*N^2

1.
bridge
2.
host
What is the default network used in docker?
3.
custom
4.
star

1.
Scalability
2.
Expensive
What is the disadvantage of DevOps?
3.
Resource utilization
4.
Stability

1.
Register Memory
2.
What is the high speed memory between the main memory and the Cache Memory
CPU called? 3.
Storage Memory
4.
Virtual Memory

1.
any[]
2.
What is the inherited type for the variable example in `const example = unknown[]
['Hostel']`? 3.
string[]
4.
None of these
85.

1.
so as to
avoid wors
case time
complexity
2.
so as to
avoid wors
case space
What is the purpose of using randomized quick sort over standard quick sort
complexity
3.
to improve
accuracy o
input
4.
to improve
average tim
complexity

1.
Conditiona
independe

2.
What is the significance between a node and its predecessors while constructing bayesian
Functional
network?
dependent

3.
Dependen
4.
Both
Conditiona
dependent
Dependen

1.
The physic
device tha
provides
What is the use of HSM?
extra
processing
speed
2.
 The physic
device tha
provides
extra stora
3.
The physic
device tha
provides
extra secu
for sensitiv
data
4.
All of them

1.
O(N)

2.
O(N log N)
What is the worst case 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.
Port 5000
What port does Docker registry use? 3.
Port 8000
4.
None of
them

1.
What type of assignment is this variable, `const fullName: string = 'VIT Hostel';`? Implicit
2.
 Explicit
3.
Both
4.
None of
these

1.
What will be the output of the following JavaScript code?
50
<p id="demo"></p>
2.
<script>
10
var js = 10;
3.
js *= 5;
5
document.getElementById("demo").innerHTML = js;
4.
</script>
error

What will be the output of the following Java program?

1.
Hello
2.
World
3.
Hello Worl
4.
HelloWorld

1.
O(n^2)
2.
O(n log n)
What will be the time complexity of code given (line seperation indicated by ",") sum=0,
3.
for(i=1;i<=n;i*=2), for(j=1;j<=n;j++), sum++
O(n)
4.
O(n logn
logn)
86.

1.
Override
2.
When a class extends another class and replaces the members of its parent Extends
it is called -------------------? 3.
Inheriting
4.
overload

1.

dot

2.

star

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

binary+

4.
uniary +

1.
rational number
2.
irrational Number
When do FORD Fulkerson algorithm fails
3.
integer
4.
None of these

1.
When the Graham scan algorithm terminates, stack S contains exactly the True
vertices of CH(Q) ,in counterclockwise order of their appearance on the 2.
boundary False
3. 4.

1.
When there are infinite distinguishable strings then there cannot be a
automata
 2.
finite automata
3.

regular expression

4.
both finite automata
and regular expression

1.

dot

2.

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

binary +

4.
unary +

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

1.

M2

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

M1 or M2

4.
 M1

1.
HIT
2.
MISS
Whenever the data is found in the cache memory it is called as _________
3.
FOUND
4.
ERROR

1.
At remote servers
2.
In the Cloud
Where does fog computing reside in a company's network?
3.
In a local network
4.
At the edge

87.

1.
Behavioral Model
2.
Which model in system modelling depicts the static nature Context Model
of the system? 3.
Structural Model
4.
Data Model

1.
a) Smaller sizes of executable files
2.
Lesser overall page fault rate in the
Which of the following is NOT an advantage of using system
shared, dynamically linked libraries as opposed to using 3.
statically linked libraries ? Faster program startup
4.
a) Existing programs need not be re-
linked to take advantage of newer
versions of libraries

1.
Which phase is not part of the software lifecycle model?
Testing
 2.
Abstraction
3.
Coding
4.
Maintenance

1.
Delphix
2.
RedGate SQL Clone
Which among the following is not a tool for data cloning?
3.
VirtualizeMe (vME)
4.
KNIME

1.
Naive Bayes
2.
Which among the following algorithms are used in Machine Support Vector Machines
learning? 3.
K-Nearest Neighbors
4.
All of the above

1.
Set
2.
Which AngularJS filter selects a subset of items from an Sub-set
array? 3.
Ng-set
4.
Filter

1.
#
2.
Which character is used to represent when a tag is closed !
in HTML? 3.
/
4.
\

1.
Which command is used for running the images as a $ docker PS
container? 2.
$ Sudo docker run container name
 3.
$ Sudo docker run -i -t alpine /bin/bash
4.
All of the them

1.
Value
2.
Which components can be injected as a dependency in Factory
AngularJS? 3.
Service
4.
All of these

1.
<u>
2.
<mark>
Which element is used to get highlighted text in HTML5?
3.
<highlight>
4.
<b>

88.

1.
Name node
2.
Which entity of the HDFS architecture
Client
manages the file system namespace and
3.
controls access to files?
Data node
4.
Slave node

1.
logarithmic
2.
numeric raised by variable(N^...)
Which function has a higher growth factor?
3.
variable raised by number (2^...)
4.
All of these

1.
Which HTML tag is used to insert an image?
<img url=”vitlogo.jpg” />
 2.
<img alt=”vitlogo.jpg” />
3.
<img src=”vitlogo.jpg” />
4.
<img link=”vitlogo.jpg” />

1.
const ourTuple = ['hostel', 101]
2.
Which is a successful example of this tuple const ourTuple = [101, 101, ' hostel', 'hostel']
`[number, string]`? 3.
const ourTuple = [101, 'hostel']
4.
const ourTuple = [101]

1.
{{ studentName.uppercase }}
2.
Which is the correct AngularJS statement to
{{ uppercase(studentName) }}
format the value of "studentName" in the
3.
uppercase?
{{ uppercase.studentName }}
4.
{{ studentName | uppercase }}

1.
var variable_name = angular.module("app_name", []);
2.
Which is the correct syntax to create a var variable_name = angular.module("app_name", []);
module? 3.
var variable_name = angular.module("app_name", []);
4.
var variable_name = angular.module("app_name", []);

Which is the correct joint distribution for the 1.

following Bayesian net? P(A,B,C,D,E) = P(A)P(B)P(C|A)P(D|A,B,C)P(E|D)

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.
Reinforcement Learning is computing-heavy and time-
consuming, in particular when the action space is
large.
2.
Realistic environments can have full observability.

Which is the following statement is true? 3.

Parameters may enhance the speed of learning.

4.
In Reinforcement Learning method learning decision is
independent

1.
import
2.
Which keyword is used to make properties
module
and methods available outside the module
3.
file?
exports
4.
require

1.
fs.appendFile()
2.
Which method appends specified content to fs.open()
a file. 3.
fs.writeFile()
4.
None of the above
89.

1.
createServer()
2.
getServer()
Which method to create an HTTP server?
3.
putServer()
4.
setServer()

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

1.
Booth’s Algorithm
2.
Which of the following algorithms is most suitable for the Modified Booth’s algorithm
multiplication of the numbers, 00111110 and 1110? 3.
Sign Magnitude algorithm
4.
Normal binary multiplication

1.
Regression
2.
Which of the following are common classes of problems in Classification
machine learning? 3.
Clustering
4.
All of the above

1.
background-image-source
2.
Which of the following CSS property can be used to set the background-image
image as a border instead of the border style? 3.
border-image-source
4.
border-image
 1.
static
2.
Which of the following CSS property controls how an element position
is positioned? 3.
fix
4.
set

1.
border-collapse
2.
Which of the following CSS property defines the different
border-width
properties of all four sides of an element’s border in a single
3.
declaration?
padding
4.
border

1.
table:border
2.
Which of the following CSS property is used to specify table table
borders in CSS? 3.
border
4.
set: border

1.
font-size
2.
text-size
Which of the following CSS property sets the font size of text?
3.
text
4.
size

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

1.
<ol>
2.
Which of the following HTML tag is used to create an unordered <ul>
list? 3.
<li>
4.
<uo>

1.
JavaScript is an Object-Based
language
2.
JavaScript is Assembly-language
Which of the following is correct about JavaScript? 3.
JavaScript is an Object-Oriented
language
4.
JavaScript is a High-level
language

1.
<track>
2.
<video>
Which of the following is not a HTML5 tag?
3.
<slider>
4.
<source>

1.
Missing of Bracket
2.
Division by zero
Which of the following is not an error in JavaScript?
3.
Syntax error
4.
Missing of semicolons

1.
alignment
Which of the following is not the element associated with the HTML 2.
table layout? color
3.
size
 4.
spanning

1.
margin
2.
color
Which of the following is not the property of the CSS box model?
3.
width
4.
height

1.
Wannacry
2.
ILOVEYOU worm
Which of the following is the first computer WORM?
3.
Morris worm
4.
Stuxnet

1.
Docker Hub
2.
Docker Cloud
Which of the following is the native clustering for Docker?
3.
Docker Swarm
4.
Docker Compose

1.
Web server
2.
Web network
Which of the following is used to read an HTML page and render it?
3.
Web browser
4.
Web matrix

1.
Classification
2.
Which of the following machine learning techniques helps in Clustering
detecting the outliers in data? 3.
Anomaly detection
4.
All of the above
91.

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

1.
<textarea> </textarea>
2.
<text></text>
Which of the following tag is used to create a text area in HTML Form?
3.
<input type=”text” />
4.
<input type=”textarea” />

1.
(10|6)
2.
(false && true)
Which of the following expressions is illegal?
3.
bool (x) = (bool)10
4.
float y = 12.67;

1.
text-align
Which of the following property is used to align the text in a table?
2.
a)
align
b)
3.
c)
text
d)
4.
align-text

1.
<h2>
2.
Which of the following tag is used for inserting the largest heading in
<h1>
HTML?
3.
<h6>
4.
 <h4>

1.
merge sort
2.
insertion sort
Which of the following algorithm can’t be used with linked list?
3.
linear search
4.
binary search

1.
Hibernate Query Language
2.
Clean Readable Code
Which of the following are advantages of Hibernate?
3.
Exception Handling
4.
All of the above

1.
Which of the following are correct ways to increase security in Fog
I only
computing?
2.
Both I and II
3.
I. Decentralization
Both II and III
II. Network Segmentation
4.
III. Edge Security
I, II and III

1.
Which of the following are disadvantages of fog computing?
I only
I. Congestion may occur between the host and the fog node due to
2.
increased traffic
Both I and II
II. Power consumption increases when another layer is placed
3.
between the host and the cloud.
Both II and III
II. Scheduling tasks between host and fog nodes along with fog nodes
4.
and the cloud is simple.
I, II and III

1.
Single Page Applications
2.
JSON APIs based Applications
which of the following areas, Node.js is not advised to be used? 3.
CPU intensive applications
4.
Data Intensive Realtime
Applications (DIRT)
92.

1.
request.getRequestedSessionId()

2.
Which of the following code retrieves session ID
response.getRequestedSessionId()
specified by the client in programming using
Servlets?(Objects in the options closely represent
3.
the classes from which they are created)
Header.getRequestedSessionId()

4.
request.getRequestedClientSessionId()

1.
$ npm --version
2.
Which of the following command will show version of $ npm getVersion
Node? 3.
$ node getVersion
4.
$ node --version

1.
2-phase locking protocol
2.
Which of the following concurrency control protocols
Strict 2PL
ensures both conflict serializability and freedom
3.
from deadlock?
Timestamp
4.
Both (a) and (c)

Which of the following CSS property is used to make 1. text-decoration: bold 2. font-weight: bold 3.
the text bold? font-style: bold 4. text-align: bold

Which of the following CSS selector is used to

1. tag 2.id 3.class 4.both class and tag
specify a rule to bind a particular unique element?

Which of the following CSS selectors are used to

1. tag 2.id 3. class 4.both class and tag
specify a group of elements?

Which of the following CSS style property is used to

1.style 2.font 3.font-style 4.@font-face
specify an italic text?

1.
Which of the following divides the input domain into Equivalent partitioning
classes containing data? 2.
Environment partitioning
 3.
Procedure division
4.
Compilation division

1.
singly linked list
2.
Which of the following implementations is ideal for doubly linked list
returning the element at a given position from a list? 3.
array implementation
4.
doubly circular linked list

1.
Choose k to be the smallest value so that at
least 99% of the variance is retained

2.
Choose k to be the smallest value so that at
Which of the following is a reasonable way to select
least 1% of the variance is retained
the number of principal components k?
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

93.

1.
security

2.
Which of the following is among the data storage
primary uses of cloud computing? 3.
data privacy

4.
operational cost
 1.
exponential
2.
Which of the following is an
numeric raised by variable(N^...)
intractable algorithm
3.
functionalities?
variable raised by number (2^...)
4.
All of these

1.
Ensures serializability
2.
Which of the following is correct with
Prevents Deadlock
respect to the Two-phase commit
3.
protocol?
Detects Deadlock
4.
Recover 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 selected examples.
2.
For some datasets, the "right" or "correct" value of K (the
number of clusters) can be ambiguous, and hard even for a
Which of the following is false about
human expert looking carefully at the data to decide.
partitional clustering approach?
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.
Node.js can create, open, read, write, delete, and close files on
the server
2.
Which of the following is false? Node.js can generate static page content
3.
Node.js can collect form data
4.
Node.js can add, delete, modify data in your database

Which of the following is not a 1.

necessary feature of an algorithm, definiteness
as per the definition? 2.
 finiteness
3.
correctness
4.
efficiency

1.
Not null
2.
Which of the following is not an Unique
Integrity constraint ? 3.
Check predicate
4.
Positive

1.
Type of the cluster

Which of the following is not 2.

required by K-means 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 true about
process emits exit event when process is about to exit.
process global object?
3.
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.
Which of the following is true in The subproblems can be overlapped
divide and conquer strategy 3.
The subproblems need not be of the same type as the main
problem
4.
 The number of subproblems must be even

94.

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 TRUE? 3.

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 used to schedules jobs and tracks Master Node
the assign jobs to Task tracker?

3.
Job Tracker
4.
Task Tracker

1.
stack
2.
Which of the following is useful in traversing a given graph queue
by breadth first search? 3.
set
4.
lst

1.
Which of the following is wrong while inserting a node in the Make the new node point to the head
beginning of list? pointer of the current list
2.
 Create a new node using dynamic
memory allocation
3.
Make the head pointer of the current list
point to the new node
4.
Make the next pointer of the new node
point to current head of the list

1.
javax.servlet
2.
java.servlet.http
Which of the following package contains servlet classes?
3.
java.servlet
4.
javafx.servlet

1.
Clique
2.
Vertex Cover
Which of the following problem is not in NP
3.
2-SAT
4.
Circuit Sat

1.
(a+b+aa+bb+aba+bba)*
2.
Which of the following regular expression denotes a (aaa+bbb)*
language comprising of all possible strings over {a,b} of 3.
length n where n is a multiple of 3? ((a+b) (a+b) (a+b))*
4.
(aaa+ab+a)+(bbb+bb+a)

1.
r(*) =r*
2.

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

r*s*=r*+s*
 1.
Best-first search
2.
Which of the following search algorithm is optimal and Depth-first search
complete when h(n) is consistent 3.
Best-first search and depth first search
4.
A* search

1.
Best-first search
2.
Which of the following search method is helpful to find Depth-first search
better by learning 3.
Meta level state space
4.
Greedy Best first search

95.

1.
Data Encryption Standard is not a Feistel cipher
2.
Which of the following statement Data Encryption Standard is a Feistel cipher
is correct? 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
Which of the following statement very fast and small in hardware
is not correct? 3.
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.

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

1.
In Data Encryption Standard, the S-Boxes are essentially random
tables that fulfil certain properties.
2.
Which of the following statement In Advanced Encryption Standard, the S-Boxes have a strong
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 statement
3.
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

Which of the following statement 3.

is true? NFA and DFA have equal power

4.

All the are true

Which of the following
statement(s) is/are correct? 1.
(a) The output of a scanner is Only (b)
groups of characters. 2.
(b) Total number of tokens in Both (b) and (c)
printf("i=%d, &i=%x,j=%d", i, &I,j); 3.
are 12. (a), (b), and (c)
(c) Symbol table can be 4.
implemented by using binary (a), (b)
search tree

1.
Attributes are statistically dependent of one another given the
class value.

2.
Which of the following statements
Attributes are equally important.
about Naive Bayes is incorrect?
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 tasks can 2.

be best solved using Clustering. Predicting the amount of rainfall based on various cues

3.
Training a robot to solve a maze
4.
Estimating future sales for each of these products.

1.
asymptotically equal
Which of the identity is true
2.
related to Big theta notation?
asymptotically less than equal
3.
 asymptotically less than
4.
asymptotically greater than

96.

1.
Left outer join
2.
Which of the join operations do not preserve Right outer join
non matched tuples? 3.
Inner join
4.
Natural join

1.
transitivity
2.
Which of the property 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
2.
Recurrence realtion of merge sort is T(n) =
Which of the statement is in correct?
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
2.
Which of these class contains the methods FileInputStream
used to write to a file in Java? 3.
BufferedOutputStream
4.
FileBufferStream
 1.
IOException
2.
Which of these exception is thrown by close()
FileException
and read() methods in Java?
3.
FileNotFoundException
4.
FileInputOutputException

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

1.
try
2.
Which of these keywords is used to manually finally
throw an exception in Java? 3.
throw
4.
catch

1.
try
2.
Which of these keywords is used to monitor finally
exceptions in Java? 3.
throw
4.
catch

1.
get()
2.
Which of these methods are used to read in read()
from file in Java? 3.
scan()
4.
readFileInput()

Which of these methods is used to write() into 1.

a file in Java? put()
 2.
putFile()
3.
write()
4.
writeFile()

97.

1.
try
2.
Which of these words is not a part of exception finally
handling in Java? 3.
thrown
4.
catch

1.
Low depth
2.
Which one of the following characteristics of a High fan-out
design indicates a poor design? 3.
Large width
4.
High fan-in

1.
Load / Ingest the Source Data
2.
Which one among the following does not belong Record the data
to the primary steps of cloning workflow. 3.
Clone / Replicate the Data
4.
Provision of the Data to DevTest Environments

1.
a) After releasing any resource, never request it
again.
Which one is not covered under an acceptable
2.
deadlock prevention policy?
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 previously requested.
4.
Before execution, the request and all necessary
resources are allocated

1.
Capacity Constraint
2.
Which one is not part of conditions for network Skew Symmetry
flow? 3.
Flow conservation
4.
Capacity flow

1.
pod
2.
Which one of the following can be considered as node
the primary data store of Kubernetes? 3.
etcd
4.
None of them

1.
SAL
2.
Which one of the following is the contract for
SLA
performance negotiated between you and a
3.
service provider?
SAS
4.
SSL

1.
FacebookGraphAPI.updateComment
2.
Which one of the following is not the function of FacebookGraphAPI.addComment
Facebook Graph API for dealing with comments? 3.
FacebookGraphAPI.putComment
4.
FacebookGraphAPI.deleteComment

Which one of the following is/are the step(s) to 1.

be followed while integrating an API to app? only I
I) Hire an API integration expert 2.
II) Get API keys and authorization token Both I and III
III) Integrate API framework for the App 3.
 Both II and III
4.
I, II and III

1.

The set of all strings containing the substring 00.

2.

The set of all strings containing at most two 0s.

Which one of the following languages over 3.

alphabet {0,1} is described by the regular
expression: (0+1)*0(0+1)*0(0+1)*? The set of all strings containing at least two 0s

4.

The set of all strings that begin and end with either 0
or 1.

98.

1.

0*(11*0)*

2.
Which one of the following regular expressions over {0,1} denotes the
0*1010*
set of all strings not containing 100 as a substring?
3.
0*(10+1)*
4.
0*1*01

1.
Jarvis
2.
Graham
Which one takes lesser time in the construction of convex hull?
3.
closest pair
4.
All of these

Which search is implemented with an empty first-in-first-out queue 1.

 Depth-first search
2.
Breadth-first search
3.
Bidirectional search
4.
Unidirectional Search

1.
Uninformed search
2.
Informed search
Which search strategy is also called as blind search
3.
Simple reflex search
4.
Simple Search

1.
pseudo
2.
Which specific polynomial selection will be better while selecting the Weakly
augmentation path in case of max flow algorithm? 3.
Strongly
4.
All of these

1.
<input>
2.
<select>
Which tag is used to create a dropdown in HTML Form?
3.
<text>
4.
<drop>

1.
Query languages and utilities
2.
DML and query language
3.
Which two files are used during operation of the DBMS ?
Data dictionary and
transaction log
4.
Data dictionary and query
language
 1.
Internet worms
Which type of WORM works by encrypting data on the victim's system? 2.
Perpetrators can use this type of worm in ransomware attacks, Cryptoworms
following up with the victim and demanding payment in exchange for a 3.
key to decrypt the files. Email worms
4.
file sharing worms

1.
BCNF is stricter than 3 NF
2.
Lossless, dependency -
preserving decomposition
into 3 NF is always possible
Which-one of the following statements about normal forms is FALSE? 3.
Loss less, dependency -
preserving decomposition
into BCNF is always possible
4.
Any relation with two
attributes is BCNF

1.
BCNF is stricter than 3 NF
2.
Lossless, dependency -
preserving decomposition
into 3 NF is always possible
Which-one of the following statements about normal forms is FALSE? 3.
Loss less, dependency -
preserving decomposition
into BCNF is always possible
4.
Any relation with two
attributes is BCNF

99.

1.
best
2.
While analyzing time complexity which of the
Worse
following case will not be considered?
3.
Null
4.
 Average

1.
ID
2.
While using the direct mapping technique, in a
word
16 bit system the higher order 5 bits are used
3.
for ________
Tag
4.
Block

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

1.
Both Compiling & Interpreting the JavaScript
2.
Parsing the javascript
Why JavaScript Engine is needed?
3.
Interpreting the JavaScript
4.
Compiling the JavaScript

1.
PaaS
2.
IaaS
Windows Azure and Force.com are example of?
3.
SaaS
4.
NaaS

1.
ignored

With Bayes classifier, missing data items are 2.

treated as equal compares

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.
An algorithm for deleting the first element in a singly
linked list requires O(n) operations in the worst case.
With regard to linked lists, which of the 3.
following statements is 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">
2.
Write a statement with <div> element to <div ng-app="" ng-init="Name:'Alex',Age:21">
initialize two variables (name and age)? 3.
<div ng-app="" ng-init="Name='Alex',Age=21">
4.
<div ng-app="" ng-init="Name='Alex';Age=21">

Write statement to print i and j value

#include <stdio.h>
void show(int, float);
void main()
1.
{
s=show;
void (*s) (int, float);
2.
--------------------------
show();
(*s)(1,3.0);}
3.
show=s;
void show(int i, float j )
4.
{
None of the above
printf("%d %.2f",i,j);}
a.
b.
c.

1.
Write Through technique is used in which Virtual memory
memory for updating the data 2.
Main memory
 3.
Auxiliary memory
4.
Cache memory

100.

1.
Notify

2.
You can implement the interface to send e-mail Error
notifications in case of errors. 3.
ErrorNotifier

4.
None of the mentioned

1.
True
You can't create multiple containers from the same image
2.
in docker.
False
3. 4.

1.
Zen File System
2.
Zetta File system
ZFS stands for _____________
3.
Zettabyte File System
4.
Zero File system

1.
“Imagine that you were recently hired as a software
You should immediately resign from the
engineer to a company that specializes in aircraft
company and file a complaint with the
navigation control software. While orientating yourselves
relevant standard institution
to the company’s work practices, you observe that they in
2.
fact do not conduct a few tests that they should in order
You should do nothing and let the matter
comply with the relevant safety standard. When you
slide
inquire about this from the project manager, he dismisses
3.
it saying that those tests unnecessary (and takes an
Although you are new to the company, and
unreasonably long time to conduct, as well as being
you hardly know anything about the
superfluous) and that they have managed with the other
internal processes and politics, you should
so long, without any problems.”
insist on company changing its work
 practices immediately; failing which you
threaten to report the matter
4.
Since you are new to the company, and
you are unfamiliar with the internal
processes and politics, you should first
find-out more about issue and its
background

1.
DML Compiler
2.
………….. processes the DDL statements into a set of table DDL Interpreter
containing meta data. 3.
Query Optimizer
4.
Data Dictionary Manager