Explore topic-wise InterviewSolutions in .

Find the missing term in the sequence
15, 25, 40, 130,(?), 2560

Assume that DREAM PINK, CREAM, and ORANGE LAIT has the same Selling Price(SP). Which of the three is the most profitable to manufacture?

To build a house at a faster pace, the contractor increases the wages/ hour of each worker by $20\%$ and the working hours by $25\%$ . By how much percent has the daily earnings of each labourer increased?

Which of the two is smaller - $5^{\frac{1}{3}}$ or $6^{\frac{1}{4}}$?

Q4. A speaks truth in 60 percent of the cases and B in 90 percent of the cases. The percentage of cases they are likely to contradict each other in stating the same fact is:

Which of the following colleges, won a silver medal in Running? (Refer to the data in previous questions.)

The three roots of the equation $f\left(x\right)=0$ are $x=-2,0,3$. What are the three value of $x$ for which $f(x-3)=0$?

Which of the following is not true?
a) Given that the sides of a scalene triangle are integers, then one of the sides can be 1
b) The 3 medians of a triangle divide it into 6 similar triangles
c) An isosceles triangle can never be obtuse

There are $3$ decks of cards, each deck has $6$ cards marked $1,2,3,4,5,$ and $6$. What is the total number of possible ways of drawing one card from each deck, so that the sum of the three cards drawn is $7$?

Find the subject in the given sentence.

Next week my friend will come to live with us.

A wooden cask contains some tools i.e. exactly 12 nuts and 24 bolts. ${\left(\frac{1}{3}\right)}^{rd}$ of each of these are defective. If 2 tools are picked up one after the other without replacement, then what is the probability that both are not defective?

In the following table, the left column contains the names of standard graph algorithms and the right column contains the time complexities of the algorithms.



Match each algorithm with its time complexity.



$\begin{array}{cccc}& \text{List-I}& & \text{List-II}\\ \text{1.}& \text{Bellman-Ford algorithm}& \text{A.}& O\left(m\text{log}n\right)\\ \text{2.}& \text{Kruskal's algorithm}& \text{B.}& O\left(n^3\right)\\ \text{3.}& \text{Floyd-Warshall algorithm}& \text{C.}& O\left(nm\right)\\ \text{4.}& \text{Topological sorting}& \text{D.}& O(n+m)\end{array}$

A plane MH370 is reported to have crashed somewhere in the rectangular region shown in fig. The probability that it crashed inside the lake (shown in the figure) is $\frac{P}{110}$ . Find the value of 'P'. Type the answer in the blank below:

From a group of 20 persons, in how many ways can we arrange 10 persons around a circular table?

If Tom lives in room no. 22, then which two students live in room no. 26?

What are the last two digits of $2^{253}$?

Choose the most appropriate option to replace (?).
4000 2008 1012 ? 265 140.5 78.25

Who amongst A, B, C, D and E is the tallest?

I. A is taller than B. E is not the tallest.

II. C is taller than A. D is not the tallest.

Average speed of a train excluding stoppages is 45 km/hr and including stoppages is 36 km/hr. For how many minutes does the train stop per hour?

If $a^2+b^2+c^2=1$ then ab + bc + ac lies in the interval:

Given below are two overlapping unit circles. Find the area of the shaded region.

There are certain number of pipes with equal efficiencies and two tanks A and B. Capacity of A is double that of B. These pipes fill tank A for half a day. Then half of them fill A and rest fill B for rest of the day. By the end of the day, tank A is completely filled. And it takes a single pipe half of next day to fill the remaining of tank B. How many pipes are there in total?

A line is divided into two parts such that ${\frac{2}{3}}^{rd}$ of the first part is equal to ${\frac{5}{3}}^{rd}$ of the second part. Find the length of the first part if the total length of the line is 7 m.

Q38. Drum X is 1/2 full of oil and drum Y, which has twice the capacity of drum X , is 2/3 full of oil. If all of the oil in drum X is poured into drum Y, then drum Y will be filled to what fraction of its capacity?