Provided by www.YuvaJobs.com - Whole Testpaper       Jamia Millia, New delhi - 20  June  2007  


IMPETUS PAPER ON 20th JUNE AT NEW DELHI
&nbsp;
Hi this is Raj from jamia millia New delhi.Impetus paper was very easy.only u hv to be confident.&nbsp;
&nbsp;
Pattern: 
10 questions:: Aptitude(so easy)
30 questions:: technical( basic funda)
Time::40 minutes
1. Banker’s algorithm is used for- 
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; a). Deadlock Avoidance
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; b). Deadlock Prevention
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; c). Deadlock Handling
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; d). None of these
&nbsp; 
2. The software which run on hardware to support other programs to run is called-
a)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; System software
b)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Operating system
c)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Application programs
d)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; None of these
&nbsp; 
3. FSM can recognize-
a)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Any grammar
b)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Only CFG
c)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Any unambiguous grammar
d)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Only regular grammar
&nbsp; 
4. Any string of terminals that can be generated by the following CFG-
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; S&nbsp;&nbsp; à XY 
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; X&nbsp; à aX | bX | a
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp;Y&nbsp; à Ya | Yb | a
&nbsp; 
a)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Has at least one b
b)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Should end in an a
c)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Has no consecutive a’s or b’s
d)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Has at least two a’s
&nbsp; 
5. CSG can be recognized by a-
a)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; FSM
b)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; DPDM
c)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; NDPDM
d)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Linearly bounded memory machine
&nbsp; 
6. The depth of a complete binary tree with n nodes is-
a)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Log(n+1)-1
b)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Log(n)
c)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Log(n-1)+1
d)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Log(n)+1
&nbsp; 
7. Which of the following traversal techniques lists the nodes of a binary search tree in ascending order-
a)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Post-order
b)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; In-order
c)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Pre-order
d)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; None of these
&nbsp; 
8. Odd man out-
a)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Fragrance
b)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Smell
c)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Foul smell
d)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Incense
&nbsp; 
9. What will be the output-
&nbsp;&nbsp;&nbsp;&nbsp; for(i=1;i&lt;=3;i++) 
&nbsp;&nbsp;&nbsp; { 
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; printf("%d",i); 
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; continue; 
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; i++; 
&nbsp;&nbsp; } 
a)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 1,2,3
b)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 1,1,1
c)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 0,0,0
d)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Compilation error
&nbsp; 
10. Which is more important in a sql query IN or EXISTS-
a)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; IN
b)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; EXISTS
c)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Both
d)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Depend on the condition
&nbsp; 
11. In union which type of variables cant be used-
a)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Constants
b)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Static
c)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Extern
d)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; None
&nbsp; 
12. Vendor is related to buyer, similarly consultant is related to-
a)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Firm
b)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Client
c)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Shop
d)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; None
&nbsp; 
13. Compiler convert-
a)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; High level language to machine language
b)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Three other options

14. What in these not in process-
a)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; CPU register
b)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Counter
c)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Memory management info.
d)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; None of above
&nbsp; 
15. FTP works on port no-
a)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 21
b)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 27
c)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 80
d)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 23
&nbsp; 
.16. How many types of JDBC driver-
a)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 4
b)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 5
c)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 2
d)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 3
&nbsp; 
17. What is related to these:Humidity:Temparature:Pressure
a)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Meterology
b)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Weather forcasting
c)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Geology
d)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; None
&nbsp; 
18.what is used in a recursion
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; a)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; stack
c)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; queue
d)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; linked list
e)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; binary tree
&nbsp; 
one question was on constructor and virtual distructor in my opinion the option a) it will compile was right.
One question was like a program code was given and how many vpointers and b pointers it will use
&nbsp; 
Provided by www.YuvaJobs.com - Whole Testpaper       Jamia Millia, New delhi - 20  June  2007