# Algorithms (GATE Computer Science): Questions 80 - 86 of 98

Get 1 year subscription: Access detailed explanations (illustrated with images and videos) to **913** questions. Access all new questions we will add tracking exam-pattern and syllabus changes. View Sample Explanation or View Features.

Rs. 450.00 or

## Question number: 80

» Algorithms » Sorting

### Question

Shell sort was developed by

### Choices

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

a. | Donald L | |

b. | Ruskin Bond | |

c. | Bill Gates | |

d. | All of the above |

## Question number: 81

» Algorithms » Searching

### Question

When deleting an element is possible only at one end but operation of insertion is possible at both end of queues is a called-

### Choices

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

a. | Input restricted dequeues | |

b. | dequeues | |

c. | Output restricted dequeues | |

d. | Question does not provide sufficient data or is vague |

## Question number: 82

» Algorithms » Searching

### Question

Finding the locating of the record with a given key value is called-

### Choices

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

a. | Traversal | |

b. | Sort | |

c. | Search | |

d. | All of the above |

## Question number: 83

» Algorithms » Tree and Graph Traversals

### Question

A simple graph in which there exists an edge between every pair of vertices is called

### Choices

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

a. | planer graph | |

b. | Euler graph | |

c. | Complete graph | |

d. | All of the above |

## Question number: 84

» Algorithms » Worst and Average Case Analysis

### Question

When consider n elements are to be sorted then the worst case time complexity of merge sort is

### Choices

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

a. | 0 (logn) | |

b. | 0 (nlogn) | |

c. | 0 (2nlogn) | |

d. | All of the above |

## Question number: 85

» Algorithms » Tree and Graph Traversals

### Question

Two isomorphic graphs must have

### Choices

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

a. | Equal number of vertices | |

b. | sum of degree both graph is same | |

c. | Same number of edges | |

d. | All a. , b. and c. are correct |

## Question number: 86

» Algorithms » Sorting

### Question

Hashing is

### Choices

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

a. | A statement as header files inclusion | |

b. | Address finding in sequential files origination | |

c. | Address finding in random files origination | |

d. | None of the above |