I interviewed at Imagination Technologies (Pune) in Aug 2012
Interview
1. Write a C code to implement a sierpinski traingle?You are given a function that draws an equilateral triangle given centre ka co-ord and side length
2.c code for delete a node in a linked list with all cases
3.c code to implement a finite state machine
4.c function that takes an integer and gives the nearest maximum and nearest minimum number that has the same no of 1s as in binary representation of the given number
Interview questions [1]
Question 1
implement function to get minimum element in stack in o(1) time...
push and pop must still work in o(1) time
you can use extra space if you want to
