given numbers 1 4 2 0 2 0, move all zeros to beginning using minimum sorting technique
Software Developer In Test Interview Questions
711,484 software developer in test interview questions shared by candidates
In most cases you need to have some experience with CUDA. If you want to increase your chances of getting a job offer you need to know very well about linked lists. We used the collabedit.com for the interview. It is like a chat but for coding. I got the following question on the screen of collabedit: // There is a chunk of memory in the kernel address space represented by kernelResource and an API exists to clear it. An IOCTL path exists to take a request from user-mode and using O/S services eventually dispatches to API_ZeroResource. From a security perspective what concerns do you have with this implementation? How would you fix them? // // KERNEL // BYTE kernelResource[10] = {0}; int API_ZeroResource( in_params *pParams ) { if (pParams->offset + pParams->length > sizeof(kernelResource)) return ERR_INVALID_LIMIT; memset(kernelResource + pParams->offset, 0, pParams->length); return 0; } // // USER // void ZeroResource() { in_params params = { ??? }; // an ioctl path exists to call API_ZeroResource ioctl( CMD_ZeroResource, ¶ms ); }
Write function to calculate sum of first N powers of 2 starting from 1. You shouldn't use any built-in function for calculating power. Implement the most efficient solution.
String,String buffer,String builder difference. Can u write your own immutable class n how? hashmap implementation and hashcode(),equals() method he asked me to write 2 logical testing programs with reduced complexity( 0,1,1,2,4,5,3,3,1,0,1 traverse once only n get the duplicate number's along with the count). printing pascal triangle duplicate letter from a string with less complexity reversing words of string individually(this is a tree---o/p: siht si a eert)
Varied behavioral questions. Technical focused on oops concepts(explain 4 pillars of OOP with examples). Was asked to write code to print the largest number in an unsorted integer array of infinite size. Although the position was for C#, they were cool about me coding in java.
if p1 and p2 are two consecutive prime number, in which cases (p1 + p2) / 2 is a prime number.
Define Yourself
What is a class?
Implement the MyStack. (A lot of questions about multi-threading) @protocol Stack -(void)pushObject:(nonnull id)obj; -(nonnull id)popObjext; @property(nonatomic,assign)NSInteger count; @end @interface MyStack : NSObject <Stack> @end @implementation MyStack @end
Given a text file containing the text for Hamlet (/usr/share/file.txt), return the top 5 most frequent words with count.
Viewing 1571 - 1580 interview questions