# Algorithms (GATE Computer Science): Questions 31 - 38 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: 31

» Algorithms » Greedy Approach

### Question

A minimal spanning tree can be found by

### Choices

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

a. | Subtracting edges greedily | |

b. | Adding edges greedily | |

c. | Recursive traversal | |

d. | Seeking the shortest path |

## Question number: 32

» Algorithms » Searching

### Question

Fold the key 987654321 into a hash table of ten spaces (0 through 10).

### Choices

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

a. | 3 | |

b. | 4 | |

c. | 8 | |

d. | None of the above |

## Question number: 33

» Algorithms » Asymptotic Notation

### Question

The master method does not apply to the-

### Choices

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

a. | Recurrence | |

b. | Iteration | |

c. | Substitution method | |

d. | All of the above |

## Question number: 34

» Algorithms » Tree and Graph Traversals

### Question

What is the height of a red black tree with n internal nodes?

### Choices

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

a. | 2logn-1 | |

b. | 2log (n + 1) | |

c. | 2logn | |

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

## Question number: 35

» Algorithms » Asymptotic Notation

### Question

What is the value of T (n) =T (2n/3) +1.

### Choices

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

a. | Θ (log1) | |

b. | Θ (logn) | |

c. | Θ (log2n) | |

d. | All of the above |

## Question number: 36

» Algorithms » Tree and Graph Traversals

### Question

How many draw a possible tree with three nodes?

### Choices

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

a. | 7 | |

b. | 3 | |

c. | 5 | |

d. | None of the above |

## Question number: 37

» Algorithms » Tree and Graph Traversals

### Question

If every non-leaf node in a binary tree has non –empty left and right sub trees, the tree is called a

### Choices

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

a. | B-tree | |

b. | binary tree | |

c. | Strictly binary tree | |

d. | All of the above |

## Question number: 38

» Algorithms » Searching

### Question

A hash function f defined as f (key) =key mod 7 with linear probing, insert the key 37, 38, 72, 48, 98, 11, 56 into a table indexed from 11 will be stored in the location-

### Choices

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

a. | 5 | |

b. | 3 | |

c. | 6 | |

d. | 9 |