# GATE (Graduate Aptitude Test in Engineering) Computer Science: Questions 1157 - 1161 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 1157

Appeared in Year: *2014 (UGC-NET)*

### Question

MCQ▾If h is chosen from a universal collection of hash functions and is used to hash n keys into a table of size , where , the expected number of collisions involving a particular key K is (June paper III)

### Choices

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

a. | ||

b. | ||

c. | ||

d. |

## Question 1158

Appeared in Year: *2017 (UGC-NET)*

### Question

MCQ▾The Octal equivalent of the binary number is: (November Paper II)

### Choices

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

a. | 5651 | |

b. | 1353 | |

c. | 7353 | |

d. | 5657 |

## Question 1159

Appeared in Year: *2014 (UGC-NET)*

### Question

MCQ▾Given the following equalities:

for all fixed and , and .

Which of the following is true? (June paper III)

### Choices

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

a. | . | |

b. | . | |

c. | ||

d. | . |

## Question 1160

Appeared in Year: *2014 (UGC-NET)*

### Question

MCQ▾Consider the Graph shown below

This graph is a ________.

(December Paper II)

### Choices

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

a. | Complete Graph | |

b. | Bipartite Graph | |

c. | Hamiltonian Graph | |

d. | All of the above |

## Question 1161

Appeared in Year: *2014 (UGC-NET)*

### Question

MCQ▾How many characters per second (7 bits + 1 parity) can be transmitted over a 3200 bps line if the transfer is asynchronous? (Assuming 1 start bit and 1 stop bit) (December Paper III)

### Choices

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

a. | 360 | |

b. | 300 | |

c. | 320 | |

d. | 400 |