# Graph Theory-Connectivity [GATE (Graduate Aptitude Test in Engineering) Computer Science]: Questions 1 - 5 of 12

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: *2013 (UGC-NET)*

### Question

MCQ▾The amortized time complexity to perform ________ operation (s) in Splay trees is (September Paper II)

### Choices

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

a. | Search | |

b. | Search and Insert | |

c. | Search and Delete | |

d. | Search, Insert and Delete |

## Question 2

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

### Question

MCQ▾A certain tree has two vertices of degree , one vertex of degree and one vertex of degree . If the other vertices have degree , how many vertices are there in the graph? (December Paper II)

### Choices

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

a. | 11 | |

b. | ||

c. | 20 | |

d. | 5 |

## Question 3

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

### Question

MCQ▾Consider the following postfix expression with single digit operands: (December)

623 ⚹ /42 ⚹+ 68 ⚹-

The top two elements of the stack after the second is evaluated, are:

### Choices

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

a. | 6,3 | |

b. | 6,2 | |

c. | 8,2 | |

d. | 8,1 |

## Question 4

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

### Question

MCQ▾Consider the following minimax game tree search (Dec)

What will be the value propagated at the root?

### Choices

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

a. | 3 | |

b. | 4 | |

c. | 6 | |

d. | 5 |

## Question 5

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

### Question

MCQ▾In K-coloring of an undirected graph G = (V, E) is a function such that for every edge . Which of the following is not correct? (Dec)

### Choices

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

a. | G is bipartite | |

b. | G has cycles of odd length | |

c. | G is 2-colorable | |

d. | G has no cycles of odd length |