!@#
BAN USER- 0of 0 votes
Answers3.There is a NXM grid of pixels,and each pixel is represented by 3 bits,1 each for R,G and B color values.You are given the address of beginning of grid in a character pointer,and a position x,y on the grid.You have to change that positions bits to some other given bits.
- !@# in India| Report Duplicate | Flag | PURGE
Adobe Software Engineer / Developer - -1of 3 votes
AnswersThere is a byte array which contains the character of one byte and two bytes. One byte character has range 0 to 127 and first character of 2 byte character is 128 to 255 and second byte character has range 0 to 255. Now, two pointers are given, one points to the start of the and another points to somewhere else.
- !@# in India
Tell which character 2nd pointers points to?| Report Duplicate | Flag | PURGE
Microsoft Software Engineer / Developer Algorithm - 0of 0 votes
AnswersHe asked me to print root to leaf path WITHOUT using recursion . I got stuck at it and used too much space according to him .
- !@# in India
I constructed a visited array , path array and a stack .
Is there any other optimal algorithm ?| Report Duplicate | Flag | PURGE
Amazon Software Engineer / Developer Algorithm Trees and Graphs - 2of 2 votes
Answersimplement division without using division operator in log(n) time.
- !@# in India| Report Duplicate | Flag | PURGE
Amazon Software Engineer / Developer Algorithm
can you explain how to use 1 stack method ?
- !@# September 26, 2014