GATE (Graduate Aptitude Test in Engineering) Computer Science: Questions 1935 - 1939 of 2080

Access detailed explanations (illustrated with images and videos) to 2080 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 1935

Question

MCQ▾

When using Dijkstra՚s algorithms to find shortest path in a graph, which of the following statement is not true?

Choices

Choice (4)Response

a.

The graph needs to have a non-negative weight on every edge

b.

Shortest path always passes through least number of vertices

c.

Every time a new node is visited, we choose the node with smallest known distance/cost (weight) to visit first

d.

It can find shortest path within the same graph data structure

Question 1936

Question

MCQ▾

Let G be a simple undirected planar graph on 15 vertices with 20 edges. If G is a connected graph, then the number of bounded faces in any embedding of G on the plane is equal to

Choices

Choice (4)Response

a.

6

b.

9

c.

4

d.

5

Question 1937

Question

MCQ▾

If there are n device (nodes) in a network, what is number of cable links required for fully connected mesh and star topology respectively?

Choices

Choice (4)Response

a.

,

b.

c.

,

d.

Question 1938

Question

MCQ▾

Substitution of values for names whose values are constant, is done in

Choices

Choice (4)Response

a.

Induction variable

b.

Constant folding

c.

Strength reduction

d.

Code reduction

Question 1939

Question

MCQ▾

Perform window to viewport transformation for the point . Assume that is ; is ; is ; ) is . The value of x and y in the viewport is

Choices

Choice (4)Response

a.

b.

c.

d.

Developed by: