15 Questions and, nand...circuit related stuff, .......... 

ii. Data Structures, Algo., & Complexity theory : 5 questions

a. if W is a sequence of strings without a and W' is its reversal 
then WaW' is generated by: 

ans. i think Context Free Grammars 

b. Whether all recursive program can be written iteratively? 

c. What data struts you will use if you want to go to first record from 
the last and vice versa? 
ans.: doubly linked circular list 

d. Given 10000 nos. and 48MB Memory. What is the complexity of the 
efficient sorting algo.? (the algo. is not mentioned) 

e. Given a C code and ask what it does? 
I think the code was something similar to Bubble sort and that 
particular code does the sorting in Descending order and the complexity 
is O(n^2)(which is the next question). 

iii. OS : 5 questions

a. If there are too many page faults what is the problem? 

b. To ensure one pgm. doesnt corrupt other pgm. in a Multi-pgm. environment 
what you should do? 

c. Which one you will use to implement critical section? 
Binary Semaphore 

d. Which one is not needed for Multi-pgm. environment? 
options are: virtual memory, security, time sharing , none of the 
above. 


iv. Networks and Hardware: 5 questions

a. Which one is not done by Data link layer ? 
bit stuffing, LRC, CRC, parity check 

b. Which one is not related to Data link layer? 

c. Which one is not suitable for client-server application? 
tcp/ip,message passing, rpc, none of the above. 

v. Databases and Misc.: 5 questions

a. What SQL .................. (not the expansion) 

b. Indexing in databases give you ............ 

vi. C Pgm. : 5 questions

1. int a=1,b=2,c=3; 
printf("%d,%d",a,b,c); 
What is the output? 

2. for(i=0; i<=10;i++,printf("%d",i); +- (+- is there in the questions) 

3. Scope of Static Variable ............ 

4. Given a C code and what is the output?

NEXT