Questions

 It is a strange sequence. Each number describes the resemblance of the previous one, except the first one.

11 describes the previous '1' which contains one '1'

21 describes the previous '11' which contains two '1'

1211 describes the previous '21' which contains one '2' and one '1'

111221 describes the previous '1211' which contains one '1', one '2' and two '1'.

So the next sequence will be 312211, that is the previous '111221' contains three '1', two '2' and one '1'.

All the above listed are the System calls for process management

You will get the answer in the riddle itself, if you read the riddle carefully.

The riddle says "A cowboy arrives in town on Friday." So Friday is the name of the horse on which he comes. Hence, the only possibility is he arrives on the horse friday on Tuesday, stays for 3 days and leaves on the same horse on Friday. 

NUMERICAL has 9 positions in which 2, 4, 6, 8 are even positions.

And it contains 5 consonents i.e, N, M, R, C & L. Hence this cannot be done as 5 letters cannot be placed in 4 positions.

Therefore, Can't be determined.

rand()  returns a random number

random()  returns a random number in a specified range

srand()  initialise a random number generator with a given seed value

randomize()   initializes a random number generator with a random value based o time.

Our solution:

Toss the coin twice.
Let TH, HT and TT correspond to the three choices.
And if you get HH, just repeat (so it takes 8/3 tosses on average).


BIASED COIN

If the coin was biased, TH and HT would occur with equal probability.
So you could assign THHT, HTTH and THTH to the three choices, with other 4-toss outcomes rejected.
Or you could assign HTT, THT and TTH to the three choices, with other 3-toss outcomes rejected.