Provided by www.YuvaJobs.com - Integra   Paper    Technical - C & C++


Optimize the below 1,2,3,4 questions for time:
1)int i;if i=0 then i:=1;if i=1 then i:=0;
2)int i;if i=0 then i:=1;if i=1 then i:=0;(given that i can take only two values (1,0))
3)int i;if i=0 then i:=1;else if i=1 then i:=0;(given that i can take only two values (1,0))
4)int m,j,i,n;for i:=1 to n dom:=m+j*n
5) Expand the followinga) ISDNb) CASEc) CSMA/CDd) OOPSe) MIMD
6) In the following questions, answer A,B,C,D depending on when the errors are detected?A if no error is detectedB if semantic and syntactic checkingC if during Code genration & Symbol allocationD run time
a) Array overboundb) Undeclared identifierc) stack underflowd) Accessing an illegal memory location
7) How many page faults will occur for below sequence of pages when LRUpage replacement algorithm is used ( The memory can only have 3pages):
1,2,3,4,2,1,5,2,4 (something like that) 
 
Provided by www.YuvaJobs.com - Integra   Paper    Technical - C & C++