• Placement Questions

Placement Papers with Solutions

(#M40167076) HEXAWARE QUESTION Keep an EYE

A group of 630 children is arranged in rows for a group
photograph session. Each row contains three fewer
children than the row in front of it. What number of rows
is not possible

Asked In Hexaware Neeraj Dewangan (13 Days ago)

Unsolved

Is this Puzzle helpful?   (0)   (0) Submit Your Solution

(#M40167075) HEXAWARE QUESTION Keep an EYE

An airline has a certain free luggage allowance and
charges for excess luggage at a fixed rate per kg. Two
passengers, Raja and Rahim have 60 kg. of luggage
between them, and are charged Rs. 1,200 and Rs.
2,400, respectively for excess luggage. Had the entire
luggage belonged to one of them, the excess luggage
charge would have been Rs. 5,400. What is the weight
of Rahim’s luggage

Asked In Hexaware Neeraj Dewangan (13 Days ago)

Unsolved

Is this Puzzle helpful?   (0)   (0) Submit Your Solution

(#M40167074) IBPS QUESTION Time and Work Keep an EYE

A group of 20 boys took a contract to paint a shopping complex in 16 days. After 10 days they added 5 more boys and finished the work 2 days before the schedule. By how many days the schedule would have been delayed if these 5 boys were not added.

Asked In IBPS C.Manohar (18 Days ago)

Unsolved

Is this Puzzle helpful?   (0)   (0) Submit Your Solution Time and Work

(#M40167073) ELITMUS QUESTION logical Keep an EYE

While Sonia takes a walk, Rahul rides his bicycle along with her in the same direction. As soon as they
pot out of the gate, Rahul rides towards the end of the road and rides back to Sonia. He repeats this
one more time (2 rounds in total), riding at a uniform speed. After the second time, both of them walk
last 45 meters together, the total distance between their house gate and the end of the road is 125
meters. Sonia walks at the rate of 4 m/sec What is the cycling, speed of Rahul?
O
8 km/hr
O
14 km/h
O
16 km/hr
20 km/h

Asked In Elitmus SIDDESH A S (29 Days ago)

Unsolved

Is this Puzzle helpful?   (2)   (0) Submit Your Solution Time Distance and Speed

(#M40167072) ELITMUS QUESTION logical Keep an EYE

In lobo's Courtyard there is a strange rule that whenever you eat in that restaurant, your bill cannot
be greater than Rs 149 and you need to pay a tip which is 2 times the tens digit of the amount of your
bill You want to pay Rs. 10 as tip. You neither want your bill to be divisible by 2 nor by 3. What
percentage of your bill will you pay as tip?

Asked In Elitmus SIDDESH A S (29 Days ago)

Unsolved Read Solution (1)

Is this Puzzle helpful?   (1)   (1) Submit Your Solution

(#M40167071) RRB QUESTION Keep an EYE

A dealer buys a product at Rs. 1920, he sells it at a discount of 20% but still gets a profit of 20%. what is the selling price

Asked In RRB Aleena Rahim (1 Month ago)

Unsolved Read Solution (1)

Is this Puzzle helpful?   (1)   (0) Submit Your Solution Profit and Loss

(#M40167070) DATA STRUCTURE QUESTION Given a positive integer n and you task is find the minimum number of steps that takes n to one . Keep an EYE

Problem Statement:

Problem statement is very easy . On a positive integer, you can perform any one of the following 3 steps.

1.) Subtract 1 from it. ( n = n - 1 )

2.) If its divisible by 2, divide by 2. ( if n % 2 == 0 , then n = n / 2 )

3.) If its divisible by 3, divide by 3. ( if n % 3 == 0 , then n = n / 3 )

Given a positive integer n and you task is find the minimum number of steps that takes n to one .

Asked In DATA STRUCTURE SUDHEER BABU PALLANTI (2 Months ago)

Unsolved

Is this Puzzle helpful?   (1)   (1) Submit Your Solution

(#M40167069) INTERVIEW QUESTION car Keep an EYE

Every 5th car is red and every 4th car is blue. How may number of cars are in the Parking lot?

Asked In Interview kangana (3 Months ago)

Unsolved

Is this Puzzle helpful?   (0)   (0) Submit Your Solution

(#M40167068) DATA STRUCTURE QUESTION Move all zeros present in an array to the end Keep an EYE

EXAMPLE:
Input=['1','0','1','2','3','0','3','4','0']
Output:
['1', '1', '2', '3', '3', '4', '0', '0', '0']

// Function to move all zeros present in the array to the end
void reorder(int A[], int n)
{
// k stores index of next available position
int k = 0;

// do for each element
for (int i = 0; i < n; i++)
{
// if current element is non-zero, put the element at
// next free position in the array
if (A[i] != 0)
A[k++] = A[i];
}

// move all 0's to the end of the array (remaining indices)
for (int i = k; i < n; i++)
A[i] = 0;
}

// Move all zeros present in the array to the end
int main(void)
{
int A[] = { ..... };
int n = sizeof(A) / sizeof(A[0]);

reorder(A, n);

for (int i = 0; i < n; i++)
printf("%d ", A[i]);

return 0;
}

Asked In DATA STRUCTURE SUDHEER BABU PALLANTI (3 Months ago)

Unsolved

Is this Puzzle helpful?   (2)   (0) Submit Your Solution

(#M40167067) HCL QUESTION Keep an EYE

R 4 T M 7 W % J 9 5 I # 1 P B 2 T A 3 D

Asked In hcl Bussireddy Abhilash Reddy (3 Months ago)

Unsolved

Is this Puzzle helpful?   (2)   (1) Submit Your Solution Coding Decoding