Complete GATE CSE 2024 Paper 1 overview, original pages and practice · Timed previous-paper practice

Questions 55–57 of 65. Imported answers require review unless explicitly marked reviewed.

Paper practice 65 questionsPage 19 of 22

Question 55

Open question
CS1NAT2 marksNeeds review
The baseline execution time of a program on a 2 GHz single core machine is 100 nanoseconds (ns). The code corresponding to 90% of the execution time can be fully parallelized. The overhead for using an additional core is 10 ns when running on a multicore system. Assume that all cores in the multicore system run their share of the parallelized code for an equal amount of time.
The number of cores that minimize the execution time of the program is ________

Log in to check the answer

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Question 56

Open question
CS1NAT2 marksNeeds review
A given program has 25% load/store instructions. Suppose the ideal CPI (cycles per instruction) without any memory stalls is 2. The program exhibits 2% miss rate on instruction cache and 8% miss rate on data cache. The miss penalty is 100 cycles. The speedup (rounded off to two decimal places) achieved with a perfect cache (i.e., with NO data or instruction cache misses) is ________

Log in to check the answer

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Question 57

Open question
CS1NAT2 marksNeeds review
Consider the following code snippet using the

and

system calls. Assume that the code compiles and runs correctly, and that the system calls run successfully without any errors.
int x = 3;
while(x > 0) {
fork();
printf("helo");
wait(NULL);
x--;
}
The total number of times the

statement is executed is ________

Log in to check the answer

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer