Scribd
Upload
132 views

ABES Geek-50 Question Paper

sample paper

Uploaded by

amar7chauhan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
132 views

ABES Geek-50 Question Paper

sample paper

Uploaded by

amar7chauhan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

Geek-50

Name:
Email:
Semester:

Branch:
Mobile:
Signature:

Tear from here->------------------------------------------------------------------------------------------------------------------------------------------------------------

Instructions:
minutes

Total questions: 8

Time: 90

For only Question no-8 you need to write a program or function and for other questions, just write
down the solution.
Problem solving approach is exactly what makes the difference.
If not able to solve a question completely; No Problem; Write down all the steps what you have
thought of.
Please attach your rough work with the answer sheet it is helpful for us to understand your thought
process.

Questions:

1- There is 4*4 matrix. How many rectangles are possible inside it. Please explain your
answer.(Note: A square is also a rectangle)
2- Three men A, B, C can finish a work in 45, 60 and 120 days. They begin work together,
but A leaves after some days. B & C finished the remaining work in 23 days. After how
many days did A left?
3- There are N tennis players. All have different rankings from 1 to N (Rank no-1 is
highest and rank-N is lowest). In a match between two players, high rank player always
wins over lower rank player. How many minimum matches are needed to find out the
2nd best player? ( Player, who have rank-2)
4- A box has 16 black balls and 12 white balls and we have infinite supply of red and
black balls with us outside the box.
Rule for picking and replacing balls are as following:
Always 2 balls are picked from the box in one move.
if both balls are of same color then we put a black boll in the box.
if both balls are of different color then we put a white boll in the box.
By doing this continuously, is it possible that box has only one ball left? If yes, what will
be the color of the last ball? Please explain the logic of your answer.
5- Five people entered into a lift at ground floor. There are five floors in that building.
What is the probability that all five people get down on different floors?
6- A man standing on the upper leftmost cell ([0, 0]) of a 5*4 matrix. In a step he can
either go one cell right or one cell down. So how many different ways he can reach lowerrightmost cell ([4, 3])?
7- You have to weight all possible values from 1kg to 40kg (integer values only). You
have a balance having two sides to place weights. Find out minimum number of weights
you need to successfully weight all integer values starting from 1 to 40. Please tell the

For any query contact: 9818663083

Copyright www.ITbodhi.com

values of weights you need. Like 1, 2, 5, 10, 15, 25, 35 etc (This is not an optimal
solution)
8- Price of a stock is given in an array. Value at ith index in array represents stock value at
ith day. You have to find out which day to buy and which day to sell so that the benefit
would be maximum. You can buy and sell only once. Write a function (in any language or
just pseudo code to explain algorithms) which take an integer array of size N and return
the maximum possible benefit we can have, by buying and selling the stock once. Try to
write an optimized solution in terms of time complexity. Also write the time complexity of
your answer.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy