GATE (Graduate Aptitude Test in Engineering) Computer Science & IT (CS): Questions 1928 - 1933 of 3196

Choose Programs:

🎓 Study Material (1190 Notes): 2024-2025 Syllabus

Rs. 1000.00 -OR-

3 Year Validity (Multiple Devices)

Topic-wise Notes & SampleDetails

🎯 302 Numeric, 2894 MCQs (& PYQs) with Full Explanations (2024-2025 Exam)

Rs. 650.00 -OR-

3 Year Validity (Multiple Devices)

CoverageDetailsSample Explanation

Help me Choose & Register (Watch Video) Already Subscribed?

Question 1928

Question MCQ▾

A flow graph F with entry node (1) and exit node (11) is shown below:

Flow Graph F

Flow graph F

What is the Cyclomatic complexity of flow graph F

Choices

Choice (4)Response

a.

4

b.

2

c.

5

d.

3

Edit

Question 1929

Question MCQ▾

Which of the following express the negation of the given statement so that the negation symbol is only applied to predicates?

Choices

Choice (4)Response

a.

b.

c.

d.

All of the above

Edit

Question 1930

Question MCQ▾

The weight of the spanning tree in graph G, calculated using Kruskal՚s algorithms is:

The Weight of the Spanning Tree in Graph G

Choices

Choice (4)Response

a.

17

b.

15

c.

14

d.

18

Edit

Question 1931

Question MCQ▾

A flow graph F with entry node (1) and exit node (11) is shown below:

Flow Graph F

Flow graph F

How many regions are there in flow graph F

Choices

Choice (4)Response

a.

2

b.

5

c.

3

d.

4

Edit

Question 1932

Question MCQ▾

The size of data that the application layer can pass to the TCP layer?

Choices

Choice (4)Response

a.

Any Size.

b.

Byte

c.

byte-size of TCP header

d.

Edit

Question 1933

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

Edit