TCS Company Numerical Ability Clocks and Calendars

The last day of a century cannot be?

Read Solution (Total 5)

TCS Other Question

Consider the graph G0 with 3 components which are triangles. G0 has 9 vertices labeled
A to I and 9 edges (A, B), (B, C) … as shown below.
If each vertex of G0 is assigned a red or a green color, then we say that an edge is
colored if its ends have different colors.
Ajai and Rekha color the vertices of G0 in the following manner. Ajai proposes a color
(red or green) and Rekha chooses the vertex to apply this color. After 9 turns, all the
vertices of G0 are colored and the number of colored edges is counted.
Suppose Ajai would like to maximize the number of colored edges while Rekha would
like to minimize the number of colored edges. Assuming optimal play from both players,
how many edges will be colored? Explain ur reasoning.
if 8 tyres were used on a bus (6 tyres ) which has traveled 16000 km , how many km did each tyre sustain .if all the tyres were used equally in sustaining this distance