In how many different ways can the letter of the word “INDEPENDENCE” be arranged so that the vowels always come together?
33,600
16800
3360
22,400
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
Mr. Harry invested an amount of Rs.12600 divided in two different schemes P and Q at the simple interest rate of 12% p.a. and 9% p.a. respectively. If the total amount of simple interest earned in 3 years is Rs.4230, what is the difference between the invested amount in scheme P and scheme Q?
5800
3400
9200
4700
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
John walked 8km/hr instead of 13km/hr he would have walked 25km more. The actual distance travelled by him is
65km
40km
35km
30km
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
Study the following information and answer the questions given below:

Eight friends A, B, C, D, E, F, G and H are sitting around a circular table not necessarily in the same order. Three of them are facing outward while five are facing towards the centre. There are an equal number of males and females in the group.

C is facing the centre. E is sitting third to the right of C.

F is sitting third to the left of E. Three people are sitting between F and B. The immediate neighbours of B are females. G is sitting third to the right of F. D is sitting third to the right of A. A is not an immediate neighbour of E. The immediate neighbours of E are males and facing the centre. The immediate neighbours of D are females and face outside. The one sitting third to the left of B is a male. No female is an immediate neighbour of G.

Four of the following five are alike in a certain way based on their seating positions in the above arrangement and hence form a group. Which of the following differs from a group?

B
F
G
A
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66

Study the following information and answer the questions given below:

Eight friends A, B, C, D, E, F, G and H are sitting around a circular table not necessarily in the same order. Three of them are facing outward while five are facing towards the centre. There are an equal number of males and females in the group.

C is facing the centre. E is sitting third to the right of C.

F is sitting third to the left of E. Three people are sitting between F and B. The immediate neighbours of B are females. G is sitting third to the right of F. D is sitting third to the right of A. A is not an immediate neighbour of E. The immediate neighbours of E are males and facing the centre. The immediate neighbours of D are females and face outside. The one sitting third to the left of B is a male. No female is an immediate neighbour of G.

What is D’s position with respect to G?

Third to the right

First to the right

Second to the right

Second to the left

Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
Study the following information and answer the questions given below:

Eight friends A, B, C, D, E, F, G and H are sitting around a circular table not necessarily in the same order. Three of them are facing outward while five are facing towards the centre. There are an equal number of males and females in the group.

C is facing the centre. E is sitting third to the right of C.

F is sitting third to the left of E. Three people are sitting between F and B. The immediate neighbours of B are females. G is sitting third to the right of F. D is sitting third to the right of A. A is not an immediate neighbour of E. The immediate neighbours of E are males and facing the centre. The immediate neighbours of D are females and face outside. The one sitting third to the left of B is a male. No female is an immediate neighbour of G.

How many persons are sitting between H and C when counted from the left side of H?

one
two
three
four
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
What is the meaning of the word ' scrumptious'? [MSQ]
delicious
filthy
gorgeous
nasty
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.00
Which question word will you use for the answer 'because it was raining'
when
why
how
whose
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
Ladder: Stairs :: Feathers : ?
fly
birds
wings
aeroplane
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
Read the passage and answer the question

PASSAGE

When we imagine a forest, we think of green plants, shrubs, algae, insects, animals, butterflies, mushrooms, flowers, creepers and many more living beings that lend vibrancy to this wonderful aspect of nature.

Dead trees are referred to as ‘snags’. What happens when a tree dies in the forest? No one removes it, let alone destroys it, by burning or burying, it is just left to be. Of what good is a dead tree? Well, when a tree dies, the tree itself may have ceased to live, but it continues to foster the intricate ecosystem of biota that is truly enthralling. A dead tree is a valuable habitat for a host of other species like birds, insects and reptiles. It hosts algae, lichen and moss, which in turn provide food and sustenance to a host of other organisms. That is why in informed societies where forests are part of conservation plans, dead trees - whether standing or fallen - are left undisturbed to exist cheek-by-jowl with other constituents of the forest. A tree that has been dead for a very, very long time might start disintegrating with sustained response to sunlight, rain, moisture and wind. Even as it disintegrates, it turns into valuable compost with minerals and roughage that enriches the soil of the forest.

The Northern Illinois Forestry Association lists atleast 38 species of birds `` that sceavate nest holes or use existing holes in dead or dying trees are 29 species of mammals that use tree cavaliers for various purposes ”.

What is the meaning of the idiom cheek-by-jowl?

Spacious
Very close together
overshadowed
Crowded
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
A minimum spanning tree has X edges and if there are 10 numbers of vertices in the given graph. Then X is ___
9
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.00
A binary tree T has 9 nodes. The inorder and preorder traversals of T yield the following sequences of nodes:

In Order: EACKFHDBG

Pre order:FAEKCDHGB

What will be the post order traversal for above tree?

ECKAHBGDF
ECKABHGDF
ECKHABGDF
ECAKHBGDF
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
What will be the equivalent postfix expression for:((A-B)/ ((D+E)*F))
AB-DE+F*/
AB-DEF+*/
ABD-E+F*/
AB-DE+F/*
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
Given two lists:

list1 = [1, 2, 3]

list2 = [4, 5]

What is the result of this nested list?

result = [[x + y for y in list2] for x in list1]

print(result)

[[6, 7], [5, 6], [7, 8]]
[[7, 8], [5, 6], [6, 7]]
[[5, 6], [6, 7], [7, 8]]
[[[7, 8], [6, 7], 5, 6]]
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
What is the result of this code?

values = [1, 2, 3]

functions = [lambda x: x**2, lambda x: x*3]

result = [list(map(f, values)) for f in functions]

print(result)

[[1, 2, 3], [3, 6, 9]]
[[4, 5, 9], [4, 6, 9]]
[[1, 4, 5], [1, 6, 9]]
[[1, 4, 9], [3, 6, 9]]
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
What is the output of fib(10)?

def fib(n, GATE={}):

if n in GATE:

return GATE[n]

if n <= 1:

return n

GATE[n] = fib(n-1, GATE) + fib(n-2, GATE)

return GATE[n]

print(fib(10))

55
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.00
What is the output of this code with nested closures?

def outer(a):

def middle(b):k/[p--[[[[-

def inner(c):

return a + b + c

return inner

return middle

f = outer(5)

g = f(10)

result = g(15)

print(result)

30
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.00
Given the list:

GATE = [{'name': 'John', 'age': 25}, {'name': 'Alice', 'age': 30}, {'name': 'Bob', 'age': 25}]

Sort by age in descending order, then by name in ascending order, but exclude entries where the age is less than 25.

filtered_sorted_GATE = sorted(

[p for p in GATE if p['age'] >= 25],

key=lambda x: (-x['age'], x['name'])

)

print(filtered_sorted_GATE)

[{'name': 'Alice', 'age': 30}, {'name': 'Bob', 'age': 25}, {'name': 'John', 'age': 25}]
[{'name': 'Bob', 'age': 25}, {'name': 'Alice', 'age': 30}, {'name': 'John', 'age': 25}]
[{'name': 'John', 'age': 25}, {'name': 'Alice', 'age': 30}, {'name': 'Bob', 'age': 25}]
[{'name': 'John', 'age': 25}, {'name': 'Bob', 'age': 25}, {'name': 'Alice', 'age': 30},]
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
Find the greedy algorithms [ MSQ ]

Prim’s algorithm
Floyd Warshall algorithm
Huffman coding
Dijkstra’s algorithm
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
Consider the following sequence of letters (Assume always select last element as pivot and array index starts with 0)

Q, U, I, C, K, S, O, R, T, E, X, A, M, P, L, E

What is the position of the pivot element after completion of the first pass_____?

3
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.00
The number of spanning trees possible for a complete graph with 5 vertices is ____
125
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.00
Consider the following graph

Apply a single source shortest path algorithm on the given graph using vertex ‘A’ as the source. What is the order in which vertices get removed from the priority queue for the above graph?

ABCHFDEG
ABCFHDEG
ABFCDHEG
ABFCHDEG
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
Match the following LIST-1 and LIST-2

I-V, II-R, III- U, IV-P
I-V, II-S, III- U, IV-R
I-U, II-R, III-V, IV-P
I-U, II-S, III-V, IV-R
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
Which of the following statement(s) is/are TRUE? [MSQ]
Minimum number of comparisons required to find the minimum and maximum element from the n elements in the array where n is odd=3(n-1)/2
Minimum number of comparisons required to find the min and max element from the n elements in the array where n is even=(3n/2) -2
The worst case time complexity to find maximum element in a binary search tree is O(n)
If we are merging two sorted lists of sizes m and n into a sorted list of size m+n then how many comparisons are required in worst case is m+n-1
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.00
Inorder to ensure that the value of salary is non-negative which of the following should be used?
Check(salary>0)
Check(salary<0)
Alter(salary>0)
Alter(salary<0)
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
The predicate in a where clause can involve Boolean operations such as "OR". The result of true OR unknown is_______ false OR unknown is _____ while unknown OR unknown is _____
Unknown, unknown, false
True, false, unknown
True, unknown, unknown
Unknown, false, unknown
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33

Given a relational schema r(A, B, C, D, E) and a set of FD’s {A → BC, CD → E, B → D, E → A} that holds on r. The decomposition of r into r1(A, B, C) and r2(A, D, E) is

I.Lossless decomposition

II.Dependency preserving

Which of the following is true?

I only
II only
Both I & II
We can't say
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66

Let transactions T1, T2 and T3 be defined to perform the following operations:

T1: Add 5 to A

T2: Double A

T3: Display A on the screen and then set it to 1 i.e., A = 1.

(Where A is same item in the database)

Suppose transactions T1, T2 and T3 are allowed to execute concurrently. If A has initial value zero, report the possible values of final value of A and the displayed value of A

1, 10
2, 5
7, 0
12, 0
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.00
Which of the following is a method for discretizing continuous data?
Binning
Smoothing
Aggregation
Normalization
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
A multidimensional data cube has 4 dimensions: Time, Product, Location, and Sales. If each dimension has 10 levels, how many unique data cells are there in the cube?
10000
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.00
You apply decimal scaling to normalize a value of 4567, and the maximum value in the dataset is 9999. What is the normalized value?
0.4567
0.235
0.789
0.5698
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
An unbiased coin is tossed 5 times. Suppose that a variable X is assigned the value k when k consecutive heads are obtained for k = 3, 4, 5, otherwise 𝑋 takes the value -1. The expected value of X, is
3/16
-⅛
-3/16
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
A, B and C are three mutually exclusive and exhaustive events. P(A) = 2P(B) = 6P(C). Find P(B).
0.1
0.3
0.6
0.4
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
If X is a Poisson variate with P(X = 0) = 0.6, then the variance of X is:
ln(5/3)
0
ln 15
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
A and B are two events such that P(B) = 0.4 and P(A ∪ B) = 0.6 If A and B are independent, then P(A) is
1/2
1/3
2/3
2/5
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
A coin is tossed successively three times. Find the Probability (P), Event (E), Sample space (S) of getting exactly one head or two heads, where n is number of occurrences. Consider the following statements:

(I) P(E)=1/4

(II) n(S)=8

(III) n(E)=6

(IV) P(E)=3/4

Which of the following option(s) are true: [MSQ]

Only I and II are correct
Only I and III are correct
Both II and IV are correct.
Only II, III and IV are correct
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.00

A continuous random variable X has the distribution function

F(x) = 0 if x < 1

The value of k is

1/16
1/4
1/8
1/2
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
Consider two exponentially distributed random variables X and Y, both having a mean of 0.50. Let Z = X + Y and r be the correlation coefficient between X and Y. If the variance of Z equals 0, then the value of r is ______
-1
0
2
3
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
A random variable X assumes values 1, 2, 3, ‚ ..., n with equal probabilities, if var (X) = E(X), then n is
4
5
7
9
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66

For which of the following values of λ and μ the system of equation

x + y + z = 6

x + 2y + 3z = 10

x + 2y + λ z = μ

has no solution

λ = 3 and μ ≠ 10
λ ≠ 3
λ ≠ 3 and μ = 10
λ = 3 and μ = 10
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
Let A be a 2 × 2 real matrix with det A = 6 and Trace A = 4. What is the value of trace A^2?
10
9
7
4
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
Let A be a 4 × 4 matrix such that -1, 1, -2, 3 are its eigenvalues. then trace (B) equals
5
0
-6
-8
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
0
1
a+b+c
3
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33

Consider solving the following system of simultaneous equations using LU decomposition.

where L and U are denoted as

Which one of the following is the correct combination of values for

Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66

Consider the system of linear equations.

x + 2y+ z = 5

2x + ay + 4z = 12

2x + 4y + 6z = b

The values of a and b such that there exists a non-trivial null space and the system admits infinite solutions are

a=8,b=14
a=4,b=12
a=8,b=12
a=4,b=14
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66

For the standard basis a linear transformation has the matrix representation

The image under T of (2,1,2) is

(11, 0, 1)
(11, 3, -5)
(7, 3, -1)
None
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66

Which of the following option(s) are true? [MSQ]

rank(T)=1
nullity(T)=0
nullity(T)=2
rank(T)=3
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.00
0
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
increases in [1/2, ∞)
decreases (-∞, 1/2]
increases in (-∞, 1/2]
decreases [1/2, ∞)
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33

The derivative of f(x) = cos (x) can be estimated using the approximation

The percentage error is calculated as

The percentage error in the derivative of f (x ) at x = π/6 radian, choosing h = 0.1 radian, is

< 0.1%
> 0.1% and < 1%
>1% and < 5%
>5%
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
A maximum at x = 1 and a minima at x = 5
A maxima at x =1 and a minima at x = −5
Only a maxima at x = 1
Only a minima at x = 1
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66

A path AB in the form of one quarter of a circle of unit radius is shown in the figure. Integration of (x + y)^2

on path of AB traversed in a counter-clockwise sense

π/2 - 1
π/2 + 1
π/2
1
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66

The volume enclosed by the surface f (x, y) = over the triangle bounded by the lines x = y; x = 0; y = 1 in

the xy plane is _______.

0.718
0.325
0.624
0.547
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
The forecasted values along with the true values for the observations in a time series are given in the following table. What is the MAPE for this forecasting? (Upto 2 decimals)

0.51
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.00
We usually use feature normalization before using the Gaussian kernel in SVM. What is true about feature normalization?

1. We do feature normalization so that new features will dominate others.

2. Sometimes, feature normalization is not feasible in the case of categorical variables.

3. Feature normalization always helps when we use the Gaussian kernel in SVM.

1
1 and 2
1 and 3
2 and 3
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
Suppose you are using RBF (radial basis factor) kernel in SVM with a high Gamma value. What does this signify?
The model would consider even far away points from the hyperplane for modeling
The model would consider only the points close to the hyperplane for modeling
The model would not be affected by the distance of points from the hyperplane for modeling
None
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
Given below is a scenario for training error TE and Validation error VE for a machine learning algorithm M1.

You want to choose a hyperparameter (H) based on TE and VE.

Which value of H will you choose based on the above table?

1
2
3
4
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
Which of the following statements is/are true about “Type I error” and “Type II error” errors?

1.Type I error is known as a false positive, and Type II error is known as a false negative.

2.Type I error is known as a false negative, and Type II error is known as a false positive.

3.Type I error occurs when we reject a null hypothesis when it is actually true.

Only 1
Only 2
Only 3
1 and 3
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
[0,0,0,1,1,1,1,1]

What is the entropy of the target variable?

-(5/8 log(5/8) + 3/8 log(3/8))
5/8 log(5/8) + 3/8 log(3/8)
3/8 log(5/8) + 5/8 log(3/8)
5/8 log(3/8) – 3/8 log(5/8)
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
What is the sequence of steps followed in training a perceptron?

1. For a sample input, compute an output

2. Initialize weights of perceptron randomly

3. Go to the next batch of dataset

4. If the prediction does not match the output, change the weights

2143
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.00
32
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.00
In an 8-puzzle problem, let the cost of each tile move be 1, and the heuristic

ℎ1 counts the number of misplaced tiles. If the initial state has 5 misplaced tiles, what would be the heuristic estimate

ℎ1 for the start node?

5
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.00
In the same 8-puzzle problem, another heuristic

ℎ2 uses the Manhattan distance. If three tiles have Manhattan distances of 2, 1, and 3 respectively from their goal positions, what is

ℎ2for this configuration?

6
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.00
In an informed search algorithm, which characteristic of a heuristic function is most important for ensuring optimality?
Completeness
Consistency
Precision
Minimal depth
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
Which of the following search algorithms would most likely produce the lowest memory usage on a graph with high branching factor and goal depth?
Breadth-First Search
Depth-First Search
A* Search
Uniform Cost Search
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66