M bullocks and N tractors take 10 days to plough a field. If we halve the number of bullocks and double the number of tractors, it takes 7 days to plough the same field. How many days it will take M bullocks alone to plough the field?
28.75 days
26.25 days
25.25 days
30 days
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
The average of 6 consecutive even numbers is 45. Find the highest number?
46
50
48
52
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66

A dishonest shopkeeper uses 80cm scale instead of metre scale and claims to sell at the cost price. What is his % profit?

30

33.33

25

20

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

The ratio of the number of boys and girls in a college is 8:7, if the percentage increase in the number of boys and girls are 25% and 20% respectively. What will be the new ratio?

14:17

18:21

25:21

5:4

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

John can do a piece of work in 18 days. Ali can do the same work in 24 days and Bishal in 36 days. John and Bishal worked for 4 days and handed it to Ali. Ali worked for some days and handed it again to John and Bishal 6 days before completing the work. For how many days did Ali work?

4 days

6.5 days

7 days

3.75 days

Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
What is the synonym of the word MALEFACTOR
FELONY

CULPABLE

CULPRIT

OFFENSIVE

Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33

Fill in the blank with the right homophone

____________ lands have no water.

Baron

Barren

Baxen

Barron

Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33

Fill in the blanks with right participle.

The car warrants __________

Wash

Washing

Being washed

Washed

Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
Read the passage and answer the question

Tripura is a state in northeastern India. The third-smallest state in the country, it covers 10,491 km2 (4,051 sq mi) and is bordered by Bangladesh to the north, south, and west, and the Indian states of Assam and Mizoram to the east. In 2011 the state had 3,671,032 residents, constituting 0.3% of the country's population.

The area of modern Tripura—ruled for several centuries by the Tripuri dynasty—was part of an independent princely state under the protectorate of the British Empire. The independent Tripuri Kingdom (also known as Hill Tippera) joined the newly independent India in 1949.

Tripura lies in a geographically disadvantageous location in India, as only one major highway, the National Highway 8, connects it with the rest of the country. Five mountain ranges—Boromura, Atharamura, Longtharai, Shakhan and Jampui Hills—run north to south, with intervening valleys; Agartala, the capital, is located on a plain to the west. The state has a tropical savanna climate, and receives seasonal heavy rains from the south west monsoon. Forests cover more than half of the area, in which bamboo and cane tracts are common. Tripura has the highest number of primate species found in any Indian state. Due to its geographical isolation, economic progress in the state is hindered. Poverty and unemployment continue to plague Tripura, which has a limited infrastructure. Most residents are involved in agriculture and allied activities, although the service sector is the largest contributor to the state's gross domestic product.

What is hindered in Tripura due to geographical isolation?

Population growth

Agriculture

Rains

Economic progress

Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
Choose a figure which would most closely resemble the unfolded form of figure C.

1
2
3
4
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
Consider the following Python code. What will be the output?

class A:

def _init_(self, value):

self.value = value

def _add_(self, other):

if isinstance(other, A):

return A(self.value + other.value)

elif isinstance(other, B):

return B(self.value + other.value + 5)

else:

return NotImplemented

def _radd_(self, other):

return self.value + other

class B(A):

def _add_(self, other):

if isinstance(other, A):

return B(self.value + other.value + 10)

else:

return NotImplemented

x = A(10)

y = B(20)

result = 5 + y + x + y

print(result)

60
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.00
What will be the output of the following Python code?

def outer_func(x):

def inner_func(y):

return x + y

return inner_func

decorated = outer_func(5)

def decorator(func):

def wrapper(a):

return func(a) * 2

return wrapper

@decorator

def add_ten(b):

return decorated(b + 10)

print(add_ten(5))

40
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.00
What will be the output of the following Python code?

class Demo:

def _init_(self):

self.x = 1

def change(self):

self.x = 10

class Demo_derived(Demo):

def change(self):

self.x=self.x+1

return self.x

def main():

obj = Demo_derived()

print(obj.change())

main()

2
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.00
What will be the output of the following Python code?

with open("output.txt", "w") as f:

f.write("Congoo\nMyan")

with open("output.txt", "r") as f:

lines = f.readlines()

print(lines[1].strip())

f.seek(0)

print(f.read().strip())

Myan
Congoo
Congoo\nMyan
An exception is thrown
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
How can assertions be disabled in Python?
Assertions are disabled by default
Passing -O when running Python
Both A and B are wrong
Assertions cannot be disabled in Python
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
Suppose cursor points to a node in a linked list (using the node definition with member functions called data and link). What Boolean expression will be true when the cursor points to the tail node of the list?
(cursor->link( ) == NULL)
(cursor == NULL)
(cursor->data( ) == NULL)
(cursor = cursor->link())
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33

Consider the following graph. If we run breadth first search on this graph starting at any vertex, which one of the following is a possible order for visiting the nodes ?

MNOPQR
NQMPOR
QMNPRO
QMNPOR
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
Which traversal is the most suitable for deleting all the nodes in a binary tree ? (You can assume the tree to be binary)
Inorder
Preorder
Postorder
Any traversal
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
The number of comparisons required to search 48 in the hash table with chaining is pos = x % 10. The array of elements inserted into hashtable is 0, 32, 42, 200, 150, 22, 48, 120, 18, 108, 12, 110, 38, 24
1
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.00
Which of the following statement(s) is/are TRUE? [MSQ]
The minimum number of elements in a max heap of height 'n' is 2^n
The maximum number of elements in a max heap of height 'n' is 2^(n+1) -1
The average time complexity of finding max element from a min heap of size n is θ(n)
Heap sort is not an in-place sorting algorithm.
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.00
Which of the following data structures will allow merge sort to work in O(nlogn) time? [MSQ]
Array
Singly linked list
Doubly Linked list
Heap
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.00
An undirected graph G=(V, E) contains n ( n = 2k, for k > 1) nodes named as V1 , V2 , ...., Vn . Two nodes Vi and Vj are connected if and only if (i+j) % 2 = 0. Each edge (Vi ,Vj) is assigned a weight of (i+j). Further the graph has one edge from V1 to V2,

The length of a path from Vn to Vn-1 in the minimum spanning tree is____.

2n + 2
2n + 3
2n − 1
2n + 5
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
Let's assume that after scanning a file we found the following character frequencies:

Character

A

B

C

D

E

F

Frequency

12

2

7

13

14

85

How many numbers of bits saved using Huffman coding algorithm ____?

(Note: Assume each character is stored with three bits without using any algorithm)

161
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.00
Find the total profit in the following 0/1 knapsack problem. Weight of the knapsack is 5 units.

[ Note: Assume unlimited number of items is allowed ]

Weights

2

3

1

5

Profits

64

81

30

25

158
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.00
Can you identify the property of a transaction that the following statement describes?

“Either all operations of the transaction are reflected properly in the database, or none are”.

Atomicity
Consistency
Isolation
Durability
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
Consider the smartphone table and the functional dependencies on it.

smart_phone(name, model, manufacturer, battery)

FD1: model → name

FD2: model → manufacturer, battery

FD3: model, manufacturer → battery

Identify the correct statement related to the relation smartphone. [MSQ]

smart_phone is in Second Normal Form
smart_phone is in Third Normal Form
smart_phone cannot be normalized due to FD3
smart_phone is in First Normal Form
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.00
Multilevel index on a file with the following Information key field = 10 bytes, Block pointer = 4 bytes, Number of records = 25000, Size of the block = 1024 bytes.

Find the average number of block access (storing follows unspanned strategy)

(Assume first level index is Secondary index)

3
4
2
1
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
SELECT S.name

FROM Sailors S

WHERE NOT EXISTS ((SELECT A.bid

FROM Boats A) EXCEPT

(SELECT C.bid

FROM Reserves C

WHERE C.Sid=S.Sid))

What is above query returns ?

The names of sailors who have reserved all boats
The names of sailors who have reserved any boat
The name of sailors who have not reserved any boat
None
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
Which of the following is an example of ordinal data?
Temperature
Customer satisfaction rating (e.g., Poor, Fair, Good, Excellent)
Employee ID
Country names
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
A continuous attribute has values ranging from 1 to 50. You decide to discretize this attribute into 5 equal-width bins. Which bin would the value 33 fall into?
4
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.00
You apply sampling with replacement to a dataset of size 10, drawing 10 samples. What is the probability that a particular record will appear at least once?
1/e
1 - 1/e
2/e
1 - 2/e
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
Consider the continuous random variable with probability density function

The standard deviation of the random variables is

1/√3
1/√6
1/3
1/6
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
The standard deviation of a uniformly distributed random variable between 0 and 1 is
1/√12
1/√3
5/√12
7/√12
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
A random variable is uniformly distributed over the interval 2 to 10. Its variance will be
16/3
6
256/9
36
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
Poisson’s ratio for a metal is 0.35. Neglecting piezo-resistance effect, the gage factor of a strain gage made of this metal is

0.65
1
1.35
1.70
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
Let X be a random variable following normal distribution with mean +1 and variance 4.

Let Y be another normal variable with mean -1 and variance unknown. If

3
2
√2
1
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
If f(x) and g(x) are two probability density functions,

Which one of the following statements is true ?

Mean of f(x) and g(x) are same; Variance of f (x) and g(x) are same
Mean of f(x) and g (x) are same; Variance of f (x) and g (x) are different
Mean of f(x) and g(x) are different; Variance of f (x) and g (x) are same
Mean of f(x) and g(x) are different; Variance of f (x) and g(x) are different
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
Let X1 and X2 be two independent exponentially distributed random variables with means 0.5 and 0.25, respectively. Then Y = min (X1, X2) is
exponentially distributed with mean 1/6
exponentially distributed witn mean 2
normally distributed with mean 3/4
normally distributed with mean 1/6
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
If a random variable X has a Poisson distribution with mean 5, then the expectation equals ____
54
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.00
The following system of linear equations, x + 2y = 4 , 2x + y = 3 , x + y = 1
has unique solution
has no solution
has many solutions
has two solutions
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
Consider a 2 x 2 square matrix Where x is unknown. If the Eigen values of

the matrix A are (σ + jω) and (σ - jω) , the x is equal to

+ jω
- jω
+ ω
- ω
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
[5 6 4]
[5 -3 1]
[2 0 1 ]
[2 -1 ½]
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33

-6
-10
5
3
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
Consider the following system of equations in three real variables

This system of equations has

No solution
A unique solution
More than one but a finite number of solutions

  1. An infinite number of solutions
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
a circle
a multi-loop closed curve
a hyperbola
an ellipse
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
The product of the non-zero Eigen values of the matrix

6
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.00
1024 and 1024
1024√2 and 1024√2
4√2 and 4√2
512√2 and 512√2
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
-1
-2
-3
2
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33

What’s the solution to the above integral?

2
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.00
Given,

Find dy/dx at t=1.

((0.43,0.45))
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.00
Which of the following is the inflection points for the function y = x^3 + 2x^2
x= -1
x= ⅔
x= -⅔
0
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
Find the area under z(t)=e^2t from t =1 to t =3.
198
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.00
What is the maximum value of z, if z = 10x + 6y subject to the constraints 3x + y ≤ 12, 2x + 5y ≤ 34, x ≥ 0, 0 ≥ y?
56
52
50
40
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
A data scientist is using a Naive Bayes classifier to categorize emails as either "spam" or "not spam." The features used for classification include:

Which of the following scenarios, if true, is most likely to violate the key assumptions of Naive Bayes and potentially impact its performance?

The length of the email follows a non-Gaussian distribution
The time of day is discretized into categories (morning, afternoon, evening, night)
The proportion of spam emails in the training data is lower than in real-world email traffic
There’s a strong correlation between the presence of the word "free" and the length of the email
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
Consider a dataset with only one attribute (categorical). Suppose there are 8 unordered values in this attribute, how many possible combinations are needed to find the best split point for building the decision tree classifier?
254
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.00
115
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.00
Which of the statements is true for the backpropagation learning algorithm?
It always converges to global minima
Convergence is independent of the initial weight values
It may converge to local minima
Learning time decreases with increase in number of hidden layers
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
-0.92
0.52
-0.23
0.47
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
import numpy as np

a = np.asarray ([1.2, -2.5, 2.4, 3])

a = np.exp(a)

a = a/np.sum(a)

1. It will compute the softmax of a

2. It will compute the element-wise sigmoid of a

3. It will compute the e-th power of each element of a

What does above code does

1 only
2 only
1 and 3 only
3 only
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
Which of the following is a categorical Feature?
Height of a person
Price of Petroleum
Mother tongue of a person
Amount of Rainfall in a day
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
Consider these two statements:

Which of these are true?

Both the statements are True
Statement 1 is true, and statement 2 is false
Statement 1 is false, and statement 2 is true
Both the statements are false
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
In Bayesian Networks, the factorization of the joint probability can be represented using:
Only the parents of each node.
Only the children of each node.
All neighbors of each node.
All ancestors of each node
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
When applying variable elimination to a Bayesian network, which of the following strategies generally leads to the lowest computational cost?
Eliminate nodes with the highest degree first.
Eliminate nodes with the lowest degree first.
Randomly eliminate nodes.

Eliminate leaf nodes first.
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
When dealing with evidence during variable elimination, which of the following steps is necessary?
Modify the CPTs of non-evidence nodes
Introduce a new factor for each evidence.
Set the rows in the CPTs corresponding to the evidence to 1
Restrict the domain of factors to fit the evidence
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
Which of the following problems in Gibbs sampling is rectified by the Metropolis-Hastings algorithm?
Slow convergence
Getting trapped in local modes
Sample rejection
Weight degeneracy
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66