# Impetus Placement Papers

Impetus placement papers in pdf , doc and text format to prepare for impetus company. Check following old impetus placement papers with solutions and test interview questions from year 2010 to 2015-16. Impetus is one of reputed company in india for your career. We can provide impetus aptitude syllabus for your help too. Know about impetus placement procedure and questions with aptitude test papers on this page. Best of luck for your interview in impetus company.
Share Us With Others
IMPETUS PAPER ON 20th JUNE AT NEW DELHI   Hi this is Raj from jamia millia New delhi.Impetus paper was very easy.only u hv to be confident.    Pattern: 10 questions:: Aptitude(so easy) 30 questions:: technical( basic funda) Time::40 minutes 1. Bankers algorithm is used for-                         a). Deadlock Avoidance                         b). Deadlock Prevention                        ...
IMPETUS PAPER - APR 2006 Hello Friends, the format of the paper is they ask 10 simple qs of logical reasoning and 30 technical qs with 2-3 qs on all the topics ranging from DBMS,S/w engg.,networking,c,c++ etc. for the preperation u can refer multiple chice questions in computer science book by Timothy  J Williams.the cut off is 50% and time given is 40mins.here r a few qs. 1) for(i=1;i<=3;i++) { printf("%d",i); continue; i++; } ans: 1,2,3 2)if(a=0) printf(" a is 0 "); else printf(" a is not 0 "); 3)which are distructive testing 4)wat is the size of new generation ip x addreass(IP x 6) 5) wat is the initial IP address(IP x 4) 6)Que is implemented by array and linked...
1) for(i=1;i<=3;i++) { printf("%d",i); continue; i++; } ans: 1,2,3   2)if(a=0) printf(" a is 0 "); else printf(" a is not 0 ");   3)which are distructive testing   4)wat is the size of new generation ip x addreass(IP x 6)   5) wat is the initial IP address(IP x 4)   6)Que is implemented by array and linked list   7)more imp.in SQL IN or EXISTS both depended on the requirement.   8)In sql wat is not true ans : c(index are not unique)   9)banker algorithm is used for deadlock avoidance   10)which is not s/w testing technique ans:syntax testing   11) 7 virtual table ,7 virtual pointers   12)size of *p,p,char*p   13)quicksort ans: divide...