Latest Answer: Optimize the below for time:int i;if i=0 then i:=1;if i=1 then i:it is the question i want to know the answer. ...
Optimize the below for time:
int i;
if i=0 then i:=1;
if i=1 then i:=0;
(given that i can take only two values (1,0))
Optimize the below for time:
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))
Latest Answer: jagdish can u explain me how can we get that expression??? ...
Latest Answer: ISDN-Integrated Services Digital Network CASE-Computer-aided software engineering CSMA/CD-Carrier Sense Multiple Access with Collision DetectionOOPS-Object Oriented programming system.MIMD-Multiple Instruction Multiple Data ...
In the following question answer A, B, C, D depending on when the errors are detected?
Array overbound
A. if no error is detected
B. if semantic and syntactic checking
C. if during Code generation & Symbol allocation
D. run time
In the following question answer A, B, C, D depending on when the errors are detected?
Undeclared identifier
A. if no error is detected
B. if semantic and syntactic checking
C. if during Code generation & Symbol allocation
D. run time
In the following question answer A, B, C, D depending on when the errors are detected?
Stack underflow
A. if no error is detected
B. if semantic and syntactic checking
C. if during Code generation & Symbol allocation
D. run time
In the following question answer A, B, C, D depending on when the errors are detected?
Accessing an illegal memory location
A. if no error is detected
B. if semantic and syntactic checking
C. if during Code generation & Symbol allocation
D. run time
How many page faults will occur for below sequence of pages when LRU page replacement algorithm is used (The memory can only have 3pages): 1,2,3,4,2,1,5,2,4 (something like that)
View page [1] 2 3 Next >>
Go Top
