Free Online Practice mock Test 1 for GATE Computer Science engineering. GATE syllabus and Previous Year Question Papers with Answers Free Download.

16. Let G be a simple undirected planar graph on 10 vertices with 15 edges. If G is a connected graph, then the number of bounded faces in any embedding of G on the plane is equal to
### Workspace

### Report Error

17. Let W(n) and A(n) denote respectively, the worst case and average case running time of an algorithm executed on an input of size n. Which of the following is ALWAYS TRUE?
### Workspace

### Report Error

18. The amount of ROM needed to implement a 4 bit multiplier is
### Workspace

### Report Error

19. Register renaming is done in pipelined processors
### Workspace

### Report Error

20. Consider a random variable X that takes values +1 and −1 with probability 0.5 each. The values of the cumulative distribution function F(x) at x = −1 and +1 are
### Workspace

### Report Error