TEMENOS Placement Paper There was 2+1 rounds, 2 rounds in the college and the last 1 at their place and i’m waiting for it. First:- First round was a programming round, it consists of 2 ques and 20 mins……… 1. write dbms query 2.write a function for accepting a string and changing the vowels to [...]
PERSISTENCE PLACEMENT PAPER (TECHNICAL & DATABASE) 1. If there r n processes and each process waits p time in waiting state then cpu utilization is-: a) n(1-p) b) n*p 2. A string of pages were given and no of page faults have to be found in LRU algorithm 3. here is a file server which [...]
Microsoft Interview Pattern (Page – 7) 56. Write a program to remove duplicates from a sorted array. ANS. int remove_duplicates(int * p, int size) { int current, insert = 1; for (current=1; current < size; current++) if (p[current] != p[insert-1]) { p[insert] = p[current]; current++; insert++; } else current++; return insert; } 57. C++ ( [...]
