GATE (Graduate Aptitude Test in Engineering) Computer Science: Questions 2035 - 2038 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 2035

Appeared in Year: 2020

Question

MCQ▾

Which one of the following regular expressions represents the set of all binary strings with an odd number of 1՚s?

Choices

Choice (4)Response

a.

b.

c.

d.

Question 2036

Appeared in Year: 2020

Question

MCQ▾

Let G = (V, G) be a weighted undirected graph and let T be a Minimum Spanning Tree (MST) of G maintained using adjacency lists. Suppose a new weighed edge is added to G. The worst-case time complexity of determining if T is still an MST of the resultant graph is

Choices

Choice (4)Response

a.

b.

c.

d.

Question 2037

Edit

Appeared in Year: 2020

Question

Numeric Answer▾

Graph G is obtained by adding vertex s to K3,4 and making s adjacent to every vertex of K3,4. The minimum number of colors required to edge-color G is ________.

Question 2038

Appeared in Year: 2020

Question

MCQ▾

Consider the following languages.

L1 = {wxyx/w, x, y ∈ (0 + 1) + }

L2 = {xy/x, y ∈ (a + b) x = y, x ≠ y}

Which one of the following is TRUE?

Choices

Choice (4)Response

a.

L1 is regular and L2 is context- free

b.

L1 context- free but L2 is not context-free

c.

Neither L1 nor L2 is context- free

d.

L1 context- free but not regular and L2 is context-free

Developed by: