Compiler Design GATE CS PYQ 2024 SET 2

Compiler Design GATE CS PYQ 2024 SET 2

GATE CS 2024 | Set 1 | Question : 42 Consider the operators ⋄ and ◻ defined by a⋄b=a+2b,a◻b=ab,Подробнее

GATE CS 2024 | Set 1 | Question : 42 Consider the operators ⋄ and ◻ defined by a⋄b=a+2b,a◻b=ab,

GATE CS 2024 | Set 2 | Question: 24 Let P be the partial order defined on the set {1,2,3,4} as folloПодробнее

GATE CS 2024 | Set 2 | Question: 24 Let P be the partial order defined on the set {1,2,3,4} as follo

GATE CS 2024 | Set 1 | Question: 22 Let A and B be non-empty finite sets such that there exist one-tПодробнее

GATE CS 2024 | Set 1 | Question: 22 Let A and B be non-empty finite sets such that there exist one-t

GATE CS 2024 | Set 2 | Question: 53 Let Zn be the group of integers {0,1,2,…,n−1} with additionПодробнее

GATE CS 2024 | Set 2 | Question: 53 Let Zn be the group of integers {0,1,2,…,n−1} with addition

GATE CS 2024 | Set 2 | Question: 2 Let p and q be the following propositions p : Fail grade can beПодробнее

GATE CS 2024 | Set 2 | Question: 2 Let p and q be the following propositions p : Fail grade can be

GATE CS 2017 Set 2 | Question: 47 If the ordinary generating function of a sequence {𝑎_𝑛 }_(𝑛=0)^∞Подробнее

GATE CS 2017 Set 2 | Question: 47 If the ordinary generating function of a sequence {𝑎_𝑛 }_(𝑛=0)^∞

GATE CS 2014 Set 2 | Question: 49 The number of distinct positive integral factors of 2014 is _____Подробнее

GATE CS 2014 Set 2 | Question: 49 The number of distinct positive integral factors of 2014 is _____

GATE CS 2015 Set 2 | Question: 9 The number of divisors of 2100 is ____.Подробнее

GATE CS 2015 Set 2 | Question: 9 The number of divisors of 2100 is ____.

GATE CS 2014 Set 2 | Question: 3 The maximum number of edges in a bipartite graph on 12 vertices isПодробнее

GATE CS 2014 Set 2 | Question: 3 The maximum number of edges in a bipartite graph on 12 vertices is

GATE CS 2014 Set 2 | Question: 51 A cycle on n vertices is isomorphic to its complement. The valueПодробнее

GATE CS 2014 Set 2 | Question: 51 A cycle on n vertices is isomorphic to its complement. The value

GATE CS 2015 Set 2 | Question: 28 A graph is self-complementary if it is isomorphic to its complemenПодробнее

GATE CS 2015 Set 2 | Question: 28 A graph is self-complementary if it is isomorphic to its complemen

GATE CS 2015 Set 2 | Question: 50 In a connected graph, a bridge is an edge whose removal disconnectПодробнее

GATE CS 2015 Set 2 | Question: 50 In a connected graph, a bridge is an edge whose removal disconnect

GATE CS 2016 Set 2 | Question: 03 The minimum number of colours that is sufficient to vertex-colourПодробнее

GATE CS 2016 Set 2 | Question: 03 The minimum number of colours that is sufficient to vertex-colour

GATE CS 2017 Set 2 | Question: 23 G is an undirected graph with n vertices and 25 edges such thatПодробнее

GATE CS 2017 Set 2 | Question: 23 G is an undirected graph with n vertices and 25 edges such that

GATE CS 2021 Set 2 | Question: 46 Consider the following directed graph:Which of the following isПодробнее

GATE CS 2021 Set 2 | Question: 46 Consider the following directed graph:Which of the following is

GATE CS 2021 Set 2 | Question: 55 In a directed acyclic graph with a source vertex s, the qualityПодробнее

GATE CS 2021 Set 2 | Question: 55 In a directed acyclic graph with a source vertex s, the quality

GATE CS 2024 | Set 2 | Question: 7 ​​​​Let A be the adjacency matrix of a simple undirected graph G.Подробнее

GATE CS 2024 | Set 2 | Question: 7 ​​​​Let A be the adjacency matrix of a simple undirected graph G.

GATE CS 2024 | Set 2 | Question: 50 The chromatic number of a graph is the minimum number of coloursПодробнее

GATE CS 2024 | Set 2 | Question: 50 The chromatic number of a graph is the minimum number of colours

GATE CS 2024 | Set 2 | Question: 33 ​Consider the following expression: 𝑥[𝑖]=(𝑝+𝑟)∗−𝑠[𝑖]+𝑢/𝑤.Подробнее

GATE CS 2024 | Set 2 | Question: 33 ​Consider the following expression: 𝑥[𝑖]=(𝑝+𝑟)∗−𝑠[𝑖]+𝑢/𝑤.

Актуальное