CareerCup

The ratio of the salary of A and B, one year ago is 3: 2. The ratio of original salary to the increased salary of A is 2: 3 and that of B is 3: 4. The total present salary of A and B together is Rs. 21500. Find the salary of B.
A. 6000
B. 7000
C. 8000
D. 9000

In a group of students, there are 15 boys and 10 girls. If three students are selected at random, what is the probability that 1 girl and 2 boys are selected?
A. 21/46
B. 21/36
C. 21/26
D. 21/56

The length of the longest rod that can be placed in a room 30 m long, 24 m broad and 18 m high, is
A. 30 m
B. 15 m
C. 30 m
D. 60 m

What is the value of (25.732)2 - (15.732)2?
A. 414.64
B. 414.256
C. 414.128
D. 414.52

The average weight of 10 men is decreased by 2 kg when one of them whose weight is 60 kg is replaced by a new man. What is the weight of the new man?
A. 35 kg
B. 40 kg
C. 45 kg
D. 50 kg

This question has two words with a certain relationship to each other, and it is followed by four pairs of words. You are required to choose one pair in which the words have the same relationship.
Sculptor: Statue then Poet: ?
A. Pen
B. Verse
C. Chisel
D. Imagine

In this question, an idiom or proverb is given with different meanings of it. You are required to choose the correct meaning of the proverb/idiom out of the given options.
To cry wolf
A. to speak loudly
B. to eat like a wolf
C. to get afraid
D. to give a false alarm

. In this question, there will be a sentence followed by four words. You are required to choose one word that can be substituted for the given sentence.
The study of ancient sciences
A. Archaeology
B. Anthropology
C. Histology
D. Ethnology

This question has five sentences which are randomly arranged. You are required to rearrange them to make a logical paragraph and then answer the given question.

1. Take a paper now and draw this herb, write some of its features.
2. What does it look like? What are its medicinal properties?
3. Imaging that an herb is discovered deep in the forests of South Korea.
4. It will replace most of the herbs that we use for joint pain in Ayurveda.
5. and suggest a name for this herb.
Which of the following should be the first sentence in the paragraph?
A. 1
B. 2
C. 3
D. 4
E. 5

In this question, there will be a sentence with jumbled up parts labeled A, B, C, and D. You are required to arrange these parts to form a meaningful sentence.
An advertisement in the newspaper said that
A. fully furnished apartments
B. air-conditioned
C. are available for
D. the gentlemen of taste
A. ABCD
B. DCBA
C. BCDA
D. BACD

In this type of verbal ability questions, a sentence is broken into four, five or more parts. You are required to arrange these parts in a proper sequence to form a meaningful sentence.
1.that movie 2.five times 3.have 4.I 5.watched
A. 14351
B. 43251
C. 43512
D. 43521

. Inthis question, there will be a sentence with missing words, and you are required to complete the sentence with the most appropriate word or phrase out of the given options.
The boy was frightened by the ____ of elephants that came running towards him.
A. herd
B. group
C. number
D. bunch

Find the synonym of the word: HEED
A. Observe
B. Decide
C. Acclaim
D. Humble

. Find the synonym of the word: POMPOUS
A. Crowded
B. Supportive
C. Busy
D. Arrogant

Find the antonym of the word: LUCID
A.
Glory
B.
Noisy
C.
Obscure
D.
Distinct

Find the antonym of the word:DEFIANCE
A.
Anxiety
B.
Obedience
C.
Suspicion
D.
Dismay

Find the correctly spelled word.
A. Veternary
B. Vetinary
C. Veterinary
D. Vetarinary

. The percentage profit earned by selling an article for Rs. 1920 is equal to the percentage loss incurred by selling the same article for Rs. 1280. At what price should the article be sold to make a 25% profit?

An automobile financier claims to be lending money at simple interest, but he includes the interest every six months for calculating the principal. If he is charging an interest of 10%, the effective rate of interest becomes

Two trains, each 100 m long, moving in opposite directions, cross each other in 8 seconds. If one is moving twice as fast other, then the speed of the faster train is:

#include <stdio.h>
#include <stdlib.h>
#include <assert.h>

void my_free(char *p) {
free(p);
p = NULL;
}

int main() {
char *p = (char*) malloc(100);
my_free(p);
assert(p == NULL);
}

Will this code work? or crash

insert node to Binary search tree(BST) both recursively and iteratively.

Given n number of persons in a park. One of them is having a virus. But we don't know whom. Also, the position of all persons is given. A contaminated person can spread it up to d distance. When the best case (Spread is minimum) and the worst case(Spread is maximum) would occur?e.g.
N=5
Position=[1, 3, 5, 9, 14]
d=5

Implement an algorithm that takes in a string containing a parenthesized expression and prints it out with all sibling expressions at the same indent level, each on its own line.

Definitions:
A parenthesized expression consist of an opening parenthesis, one or more expressions separated by one or more spaces, and a closing parenthesis.
An expression is either a word or a parenthesized expression.

Find min number of jumps it will take to reach to the top in snake and ladder game using recursive function

I was asked the following question in an interview recently, which was a lot more vague and after asking clarification questions came down to this:
```
We have to perform N tests [1, 2, ... N] but in randomized order.
We have access to two functions test(x) and rand(x) which both take an integer.
test(x) returns if the current test was succesful or not and rand(x) returns a random integer
from 1<= rand(x) <= x.
The tests fail because of the sequeunce of tests carried out and we want to figure out which
sequences are bad and which sequences are good.
Basically our task is to generate a sequence of test while carrying them out and return the
sequence either when the test failed or when all tests are done.
```
I understand that the problem could be simplified by calling rand(N) just once, say x = rand(N) then we get the xth permuation of the seuence (1...N) and then call the test() function on this sequence reutrning only the part of sequence that finished successfully, this is deterministic and can be done in O(N) time.
Is there a better approach / solution in Python?

I was asked to sort extra large file 10GB which contains single word in each line, within 4GB RAM. I told External sort and optimised it with min-heap but interviewer was asking to optimise disk I/O. As last he told that use CS fundamentals. Don't know what was he expecting. Please help.

Write a binary calculator for summing two strings. Could not use standard {{ bin }} method.

Was asked at GHCI Bangalore at their booth for a prize and perhaps hiring interns or experienced software developers.

Find the return value for N=100

int returnAns(int N){
int ans=0;
for(int i=0; i<N; i++){
for(int j=i+1; j<N; j++){
ans +=((i & -i) == (j & -j)?1:0); //the question missed the condition and was returning a boolean, so I added it myself
}
}
return ans;
}

My answer: 0 ; their answer: 1610, hence got it wrong.
My explanation: I assumed negative of i in binary to be
simply represented by setting the MSB to 1 e.g. for 8 bit representation of 3: +3 is 0000 0011 and -3 is 1000 0011. In the inner loop the value of ans will always evaluate to 0 since Bitwise & of these i and -i or j and -j will always result into i and j respectively. (undergrad computer organization concept.)
Negative numbers can also be represented as 1s and 2's complement and in all modern machines by architecture its 2s complement.
Now if we assume 1's complement, +3: 0000 0011 and -3: 1111 1100. so bitwise & of these two is 0 and so the value of ans will always be incremented by 1. By two loops 100+99+98+97+...+1 = 100*101/2 (i.e. n*(n+1)/2)
Then 2's complement, which is the most relevant representation of signed binary numbers.
Odd numbers:
+3: 0000 0011 -3: 1111 1101 Binary & is 0000 0001.
For all even numbers:
+4: 0000 0100 and -4: 1111 1011+0000 0001 = 1111 1100 and Bitwise & of 4 and -4 is 0000 0100 which is 4.
So, in the innermost loop ans is incremented by 1 when i is odd and j is also odd. ie. when i is 1, 3, 5, 7... 97 and j is 3, 5, 7, 9,...,99 ans is added 1(return value of true ==) when calculated it comes to 1610.

Amazon has N buildings on the site, building ID ranged from 0 to N-1
Every employee has an office space in one of the buildings.

Now employee may make a request to move from current building X to
another building Y. A moving request is noted by

Class Request{
String employee names;
int from building;
int to building;
}

Initially all buildings are full. A request from building X to building Y is
achievable only if someone in building Y made an achievable requests to
move away and therefore creates a vacancy

Given a wishlist of requests, help us plan for the best way of building
swaps. A plan that fulfill the maximum number requests is considered
the best
Output is a list of employee names on cyclic swaps.

For Ex:
Input :

List<Request requests{
<"Alex" 1, 2>,
<"Ben", 2, 1>,
<"Chris", 1, 2>,
<"David", 2, 3>,
<"Ellen", 3, 1>,
<"Frank", 4, 5>
}

Expected Output:

List<List>
[ ["Alex","Ben"],["Chris","David","Ellen"] ]

Can someone please help me how to solve this one?