2. write routing problem:
ie finding the shortest path for the rat to cheese in a maze
20 aptitude questions. it was simple..
around 4 to 5 general aptitude ques..
4 to5 find the o/p ques..
some on n/wing
C Questions for Outrput:1.
base addr+((size of int)*size of arr)-size of int