Chronus Written Paper 2013

Type : Pen- Paper

Duration : 75 min

IITD :

4 sections of mcq questions with 6/7 questions in each section (-ve marking is there)
sections were : Algo (from gate), Aptitude (one about 5 couple handshake problem), SQL (one about cascading delete),SQL injection and a few web technology related question

Two coding questions :

1. one was about pruning the largest BST segment expanding from the root of given binary
tree.
for example :

     1
    / \
   2 3
output :
1
  \
   3
ITS NOT FINDING LARGEST BST SUBTREE IN A BINARY TREE


2. Two times were given
int noOfClicks(char* clockTime,char* currentTime) in HH:MM format.
There are two buttons to match the clock time with current time. One to increase hours and another to increase minutes.
HH count is from 00 to 23 and again goes to 00 if it is increased from 23. same is for minutes 00 to 59.
minute button is working fine but hour button is faulty. When you press hour button, it increases both hour and minute by 1.
You need to count and return the minimum no of button press to match the clock time with
current time.
Ex:
clock time 03:12
current time 04:15
no of clicks: 3
when hr button is pressed, 04:13
minute button pressed twice, 04:15


IIT B and IIT KGP:

1. Given a square matrix with black and white cells find the size of the largest square, the border of
which has only black cells.

2. Given a million word dictionary, what is the size of the largest rectangle that can be formed such
that each row and each column of the rectangle is a word from the dictionary.

Both the questions are present in the ‘Hard’ section of Gayle’s book.

IIT M:

Given two words, say source, target. Also given a dictionary of words. Find minimum possible
transformations (insert/delete/replace) of source to target such that each transformation forms a
valid word in dictionary. Print all the words during transformation from source to target.
for eg. cat to bed.
cat ->bat ->bet ->bed.