# GATE (Graduate Aptitude Test in Engineering) Computer Science: Questions 1962 - 1966 of 2080

Access detailed explanations (illustrated with images and videos) to **2080** questions. Access all new questions- tracking exam pattern and syllabus. View the complete topic-wise distribution of questions. *Unlimited Access, Unlimited Time, on Unlimited Devices*!

View Sample Explanation or View Features.

Rs. 550.00 -OR-

How to register? Already Subscribed?

## Question 1962

Appeared in Year: *2015*

### Question

MCQ▾The following two functions P_{1} and P_{2} that share a variable B with an initial value of 2 execute concurrently.

`P1 ( )`

`{`

`C =B – 1;`

`B =2 ⚹C;`

`}`

`P2 ( )`

`{`

`D =2 ⚹B;`

`B =D -1;`

`}`

The number of distinct values that B can possibly take after the execution is

### Choices

Choice (4) | Response | |
---|---|---|

a. | 4 | |

b. | 3 | |

c. | 1 | |

d. | 5 |

## Question 1963

Appeared in Year: *2015*

### Question

MCQ▾Let be a simple undirected graph, and s be a particular vertex in it called the source. For , let denote the shortest distance in G from s to . A breadth first search (BFS) is performed starting at s. Let T be the resultant BFS tree. If is an edge of G that is not in T, then which one of the following CANNOT be the value of ?

### Choices

Choice (4) | Response | |
---|---|---|

a. | ||

b. | 1 | |

c. | ||

d. | 0 |

## Question 1964

Appeared in Year: *2015*

### Question

MCQ▾### Choices

Choice (4) | Response | |
---|---|---|

a. | 0.9 | |

b. | ||

c. | 1 | |

d. | 99 |

## Question 1965

Appeared in Year: *2015*

### Question

MCQ▾What are the worst-case complexities of insertion and deletion of a key in a binary search tree?

### Choices

Choice (4) | Response | |
---|---|---|

a. | for both insertion and deletion | |

b. | for insertion and for deletion | |

c. | for insertion and for deletion | |

d. | for both insertion and deletion |

## Question 1966

Appeared in Year: *2015*

### Question

MCQ▾Suppose that the stop-and-wait protocol is used on a link with a bit rate of kilobits per second and milliseconds propagation delay. Assume that the transmission time for the acknowledgment and the processing time at nodes are negligible. Then the minimum frame size in bytes to achieve a link utilization of at least is ________.

### Choices

Choice (4) | Response | |
---|---|---|

a. | 640 | |

b. | 320 | |

c. | 220 | |

d. | 160 |