Latest TCS Aptitude Question SOLUTION: Subha patel is an olfactory scientist working for internation flavors and fragrances. She specializes in finding new scents recorded and reconstituted from nature thanks to living

Follow Quotesrain

TCS Question Papers: TCS Interview Experience(90) TCS Company Profile

TCS Select Another Category Decision Making and Problem Solving Select Another Topic

Company

TCS Question Topics

Category (489)

General Ability (141)

General Knowledge(140)

HR Interview (122)

Interview(119)

Logical Reasoning (853)

Numerical Ability (3076)

Programming (166)

Verbal Ability (87)

Advertisements

Previous Question: Alice and bob play the following coins-on-a-track game. 50 coins are stacked one above the other. One of them is a special (gold) coin and the reset are ordinary coins. The goal is to bring the gold coin to the top by repeatedly moving the topmost coin to another position in the stack. Alice starts and the players take turns. A turn consists of moving the coin on the top to a position I below the top coin (for some I between 0 and 50). We will call this an i-move (thus a 0-move implies doing nothing). The proviso is that an i-move cannot be repeated; for example once a player makes a 2-moves on subsequent turns neither player can make a 2-move. If the gold coin happens to be on top when it’s a players turn ther the player wins the game. Initially the gold coin is the third coin from the top then In order to win, Alice’s first move should be a 1-move. In order to win, Alice’s first move can be a 0-move or a 1-move. Alice has no winning strategy. In order to win Alice’s first move should be a 0-move. Next Question: 5 people meet and shake hands. The maximum numbers of handshake possible if there is to be no cycle of handshake is (A cycle of handshake is a sequence of people a1, a2.....,ak, k>2 such that the pairs {a1,a2} {a2,a3} {a(k-1),ak}, {ak,a1} shake hands). 1 4 3 2

(#M40002326) TCS Logical Reasoning question TCS Fresher Job Placement Paper : 14 Aug 2011 Keep an EYE

Subha patel is an olfactory scientist working for internation flavors and fragrances. She specializes in finding new scents recorded and reconstituted from nature thanks to living flower technology she has extracted fragraned ingredients from different flowering plants into bottles labeled citrus lilac, woody, anisic and casis . she has learned that a formula for a perfume is acceptable if and only if it does not violate any of the rules listed: if the perfume contains citrus, it must also contain anisic, and the amount of anisic must equal the amount of lilac. Woody cannot be used in combination with anisic. Anisic cannot be used in combination with casis. If the perfume contains casis, the amount of casis must be greater than the total amount of the other essence or essence used. Which of the following could be added to and unacceptable perfume consisting of two parts woody and one part casis to make it acceptable?
Two parts woody
One part lilac
One part citrus
Two parts casis: Asked In TCS Aashu (12 years ago); Solved soumya goyal Read Solution (1); Is this Puzzle helpful? (4) (1) Submit Your Solution Decision Making and Problem Solving

Advertisements

Read Solution (1) :

Please Login to Read Solution.

Previous Question: Alice and bob play the following coins-on-a-track game. 50 coins are stacked one above the other. One of them is a special (gold) coin and the reset are ordinary coins. The goal is to bring the gold coin to the top by repeatedly moving the topmost coin to another position in the stack. Alice starts and the players take turns. A turn consists of moving the coin on the top to a position I below the top coin (for some I between 0 and 50). We will call this an i-move (thus a 0-move implies doing nothing). The proviso is that an i-move cannot be repeated; for example once a player makes a 2-moves on subsequent turns neither player can make a 2-move. If the gold coin happens to be on top when it’s a players turn ther the player wins the game. Initially the gold coin is the third coin from the top then In order to win, Alice’s first move should be a 1-move. In order to win, Alice’s first move can be a 0-move or a 1-move. Alice has no winning strategy. In order to win Alice’s first move should be a 0-move. Next Question: 5 people meet and shake hands. The maximum numbers of handshake possible if there is to be no cycle of handshake is (A cycle of handshake is a sequence of people a1, a2.....,ak, k>2 such that the pairs {a1,a2} {a2,a3} {a(k-1),ak}, {ak,a1} shake hands). 1 4 3 2

Login
Register

Sponsored Links

Advertisements

Challenger of the Day

no image

Dimple

India

Punjab

Time: 00:01:33

Points

19

Maths Quotes

People do not make any mistake when they say life is a mathematics but they make blunder when they think mathematics is merely a calculation.

Chandan

"5/3rds of all people just don't get fractions"

Unknown

Placed User Comments

M4Math helped me a lot.

Vipul Chavan 3 years ago

Thanks m4 maths for helping to get placed in several companies.
I must recommend this website for placement preparations.

yash mittal 4 years ago

2511K+Registerd user
1758K+Engineers
753K+MBA Asprirant
3K+Enginnering College
250+Company Exam
150K+Interview Questions

All rights are reserved to @m4maths.com