11. #include
void main
{
int x,j,k;
j=k=6;x=2;
x=j*k;
printf("%d", x);
}
Answer: 36
Explanation:Here is no explanation for this answer
Workspace
Cisco
12. main()
{
int i=1;
fork();
fork();
fork();
printf("%d",i);
}
How many times i will be printed
Answer: 8
Explanation:Here is no explanation for this answer
Workspace
Cisco
13. There are processors which take 4,1,8,1 machine cycles respectively. If these are executed in round robin fashion with a time quantum of 4, what is the time it take for process 4 to complete.
Answer: 9
Explanation:Here is no explanation for this answer
Workspace
Cisco Societe Generale
14. semaphore has disadvantage of busy waiting which waste cpu cycles this type of semaphore is called
Answer: Spin Lock
Explanation:Here is no explanation for this answer
Workspace
Cisco
15. The number of swappings needed to short the numbers 8, 22, 7, 9, 31, 19, 5, 13 in ascending order using bubble sort is
Answer: 14
Explanation:Here is no explanation for this answer
Workspace
Cisco
16. which of the following is used for avoiding network congestion
Answer: all of de above
Explanation:Here is no explanation for this answer
Workspace
Cisco Societe Generale
17. Piggy backing is a technique for
Answer: Acknowledgement
Explanation:Here is no explanation for this answer
Workspace
Cisco
18. In OSI, terminal emulation is done in
Answer: application layer
Explanation:Here is no explanation for this answer
Workspace
Cisco Societe Generale
19. A hardware device which is capable of executing a sequence of instructions, is known as
Answer: Processor
Explanation:Here is no explanation for this answer
Workspace
Cisco Global Edge Societe Generale
20. Which of following is not a condition of Dead Lock ?
Answer: Data Transfer
Explanation:Here is no explanation for this answer
Workspace
Cisco
Login/Register
