# Algorithms-Analysis [GATE (Graduate Aptitude Test in Engineering) Computer Science]: Questions 1 - 4 of 50

Access detailed explanations (illustrated with images and videos) to **2122** 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 1

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

### Question

MCQ▾An ideal sort is an in-place-sort whose additional space requirement is … (December)

### Choices

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

a. | O (log2n) | |

b. | O (1) | |

c. | O (n) | |

d. | O (nlog2n) |

## Question 2

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

### Question

MCQ▾Floyd-Warshall algorithm utilizes … to solve the all-pairs shortest paths problem on a directed graph in … time. (December)

### Choices

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

a. | Greedy algorithm, θ (V | |

b. | Dynamic programming, θ (V | |

c. | Greedy algorithm, θ (V | |

d. | Dynamic programming, θ (V |

## Question 3

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

### Question

MCQ▾Given two sequences X and Y:

X =< a, b, c, b, d, a, b >

Y =< b, d, c, a, b, a >

The longest common subsequence of X and Y is: (December)

### Choices

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

a. | < b, c, a > | |

b. | < b, c, a, a > | |

c. | < b, c, b, a > | |

d. | < c, a, b > |

## Question 4

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

### Question

MCQ▾Consider the Breshenham՚s circle generation algorithm for plotting a circle with centre (0,0) and radius ‘r’ units in first quadrant. If the current point is and decision parameter is p_{i} then what will be the next point and updated decision parameter for

### Choices

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

a. | ||

b. | ||

c. | ||

d. |