TCS Company Logical Reasoning Decision Making and Problem Solving

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

Read Solution (Total 1)

TCS Other 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.
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