# Programming and Data Structures (GATE Computer Science): Questions 140 - 148 of 151

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: 140

» Programming and Data Structures » Stacks

### Question

What is the data structures used to perform recursion?

### Choices

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

a. | Tree | |

b. | Queue | |

c. | Stack | |

d. | All of the above |

## Question number: 141

» Programming and Data Structures » Binary Heaps

### Question

Heap allocation is required for languages

### Choices

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

a. | That use dynamic scope rules | |

b. | That support recursion | |

c. | That support dynamic data structures | |

d. | None of the above |

## Question number: 142

» Programming and Data Structures » Arrays

### Question

A list of a finite number of homogeneous data elements is called

### Choices

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

a. | Array | |

b. | Queue | |

c. | stack | |

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

## Question number: 143

» Programming and Data Structures » Queues

### Question

What is a queue?

### Choices

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

a. | Sequential organization of data | |

b. | Only data | |

c. | Random organization of data | |

d. | All of the above |

## Question number: 144

» Programming and Data Structures » Stacks

### Question

If stack is empty, then after pop

### Choices

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

a. | Over flow | |

b. | flow diagram | |

c. | Under flow | |

d. | All of the above |

## Question number: 145

» Programming and Data Structures » Linked Lists

### Question

How can I search for data in a linked list?

### Choices

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

a. | Linear search | |

b. | Binary search | |

c. | Heap | |

d. | All of the above |

## Question number: 146

» Programming and Data Structures » Binary Heaps

### Question

min heap

### Choices

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

a. | Priority heap | |

b. | Max heap | |

c. | heap | |

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

## Question number: 147

» Programming and Data Structures » Binary Search Trees

### Question

How many distinct binary search trees can be created out of 4 distinct keys?

### Choices

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

a. | 5 | |

b. | 42 | |

c. | 14 | |

d. | 24 |

## Question number: 148

» Programming and Data Structures » Programming in C

### Question

Which language are used for real time system

### Choices

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

a. | HTML | |

b. | C++ | |

c. | C | |

d. | JAVA |