1
GATE CSE 2012
MCQ (Single Correct Answer)
+2
-0.6
Consider the directed graph shown in the figure below. There are multiple shortest paths between vertices S and T. Which one will be reported by Dijkstra’s shortest path algorithm? Assume that, in any iteration, the shortest path to a vertex v is updated only when a strictly shorter path to v is discovered. GATE CSE 2012 Algorithms - Greedy Method Question 14 English
A
SDT
B
SBDT
C
SACDT
D
SACET
2
GATE CSE 2012
MCQ (Single Correct Answer)
+1
-0.3
Given the language L= { ab, aa, baa }, which of the following strings are in L* ?

1) abaabaaabaa
2) aaaabaaaa
3) baaaaabaaaab
4) baaaaabaa

A
1,2 and 3
B
2,3 and 4
C
1,2 and 4
D
1,3 and 4
3
GATE CSE 2012
MCQ (Single Correct Answer)
+1
-0.3
The protocol data unit (PDU) for the application layer in the Internet stack is
A
Segment
B
Datagram
C
Message
D
Frame
4
GATE CSE 2012
MCQ (Single Correct Answer)
+1
-0.3
In the IPv4 addressing format, the number of networks allowed under Class C addresses is
A
214
B
27
C
221
D
224
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12