GATE CSE 2003 | GATE CSE Year Wise Previous Years Questions

GATE CSE 2003

MCQ (Single Correct Answer)

-0.6

What is the weight of a minimum spanning tree of the following graph? GATE CSE 2003 Algorithms - Greedy Method Question 12 English

GATE CSE 2003

MCQ (Single Correct Answer)

-0.3

Which of the following suffices to convert an arbitrary CFG to an LL(1) grammar?

Removing left recursion alone

Factoring the grammar alone

Removing left recursion and factoring the grammar

None of the above

GATE CSE 2003

MCQ (Single Correct Answer)

-0.3

In a bottom-up evaluation of a syntax directed definition, inherited attributes can

always be evaluated

be evaluated only if the definition is L- attributed

be evaluated only if the definition has synthesized attributes

never be evaluated

GATE CSE 2003

MCQ (Single Correct Answer)

-0.3

Assume that the SLR parser for a grammar G has n₁ states and the LALR parser for G has n₂ states. The relationship between n₁ and n₂ is

n₁ is necessarily less than n₂

n₁ is necessarily equal to n₂

n₁ is necessarily greater than n₂

None of the above

PREVIOUS NEXT

GATE CSE Papers

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

2003

2002

2001

2000

1999

1998

1997

1996

1995

1994

1993

1992

1991

1990

1989

1988

1987