PROGRAMMING

RULES AND REGULATIONS

1. Time duration – 120 min.

2. As a time bonus, the amount of time left will be added to your score. So
make sure you speed up. Slow and steady doesn’t always win the race.

3. Each misattempt will lead to deduction of ¼th of the maximum marks of

the particular question.

4. Each time you complete a question, please shout “CORE”. Any form of
deviations like “Attempt”, “Completed”, “Question 2” etc etc won’t be
tolerated. It will lead to deduction of 1/8th of the maximum marks of the
particular question. Yes, we truly ARE obsessed.

5. We appreciate talent. So the 1st 3 teams to complete Problem 4 will be

awarded with a chocolate. Seriously.

6. Execution time for each question should not exceed 10 seconds. Yet again
slow and steady doesn’t win the race.

7. The decision of the event incharges is final and binding. We expect loads of
flattery (and the chocolate back too, in case you win it).

8. We like to keep it simple. The questions are straight forward and have not
been forcibly turned into weird stories. Please apply your brains wisely.
 PROBLEM 1

Construct the graph of y=x, y= x. |x|, y= 0 and x = 0 for -1<=x<=1 and -1<=y<=1.

Maximum Points: 100

PROBLEM 2

You will be given the size of a 2-D matrix, which will be followed by the whole
matrix of alphabets, which will further be followed by a word.

Find if the word lies in the grid. The word may be there horizontally, vertically or
diagonally, and it may be in reverse directions as well.

Sample Input:

4
ESDFG
SRERT
QWOAS
POUCI

CORE

Sample Output:

Yes

Maximum points - 200

 PROBLEM 3

We’ll give you 2 Roman Numerals. Multiply them and display the output.

A) 200 points for displaying the output in decimal system.

B) 400 points for displaying the output in Roman Numerals again.

I <= Input <= MMMMMMMMMCMLXXXXIX

Sample Input:

CMLXXXXIX

II

Sample Output:

MCMLXXXXVIII

Maximum Points: 400

PROBLEM 4

C:\TC\decryptme.exe

Maximum Points: 400