GATE CSE 2014 Set 1 | GATE CSE Year Wise Previous Years Questions

GATE CSE 2014 Set 1

MCQ (Single Correct Answer)

-0.3

Consider the following program in C language:

#include < stdio.h >
main()
{
int i;
int *pi = &i;
scanf("%d", pi);
printf("%d\n", i + 5);
}

Which one of the following statements is TRUE?

Compilation fails.

Execution results in a run-time error.

On execution, the value printed is 5 more than the address of variable i.

On execution, the value printed is 5 more than the integer value entered.

GATE CSE 2014 Set 1

MCQ (Single Correct Answer)

-0.3

Match the following:
$$1)$$ Waterfall model
$$2)$$ Evolutionary model
$$3)$$ Component-based software engineering
$$4)$$ Spiral development

$$a)$$ Specifications can be developed incrementally
$$b)$$ Requirements compromises are inevitable
$$c)$$ Explicit recognition of risk
$$d)$$ Inflexible partitioning of the project into

$$1 - a,\,\,2 - b,\,\,3 - c,\,\,4 - d$$

$$1 - d,\,\,2 - a,\,\,3 - b,\,\,4 - c$$

$$1 - d,\,\,2 - b,\,\,3 - a,\,\,4 - c$$

$$1 - c,\,\,2 - a,\,\,3 - b,\,\,4 - d$$

GATE CSE 2014 Set 1

MCQ (Single Correct Answer)

-0.3

Which one of the following is TRUE?

The language $$L = \left\{ {{a^n}\,{b^n}\left| {n \ge 0} \right.} \right\}$$ is regular.

The language $$L = \,\,\left\{ {{a^n}\,\left| n \right.\,} \right.$$ is prime$$\left. \, \right\}$$ is regular.

The language $$L = \left\{ {w\left| {w\,\,} \right.} \right.$$ has $$3k+1$$ $$b'$$ $$s$$ for some $$k \in N$$ with $$\sum { = \left\{ {a,\,\,b} \right\}\left. \, \right\}} $$ is regular.

The language $$L = \left\{ {ww\,\left| {w \in \sum {{}^ * } } \right.} \right.$$ with $$\sum { = \left. {\left\{ {0,\,\,1} \right\}} \right\}} $$ is regular.

GATE CSE 2014 Set 1

MCQ (Single Correct Answer)

-0.3

Consider the finite automation in the following figure. GATE CSE 2014 Set 1 Theory of Computation - Finite Automata and Regular Language Question 68 English

GATE CSE 2014 Set 1 Theory of Computation - Finite Automata and Regular Language Question 68 English

What is the set of reachable states for the input string $$0011?$$

$$\left\{ {{q_0},\,{q_1},\,{q_2}} \right\}$$

$$\left\{ {{q_0},\,{q_1}} \right\}$$

$$\left\{ {{q_0},\,{q_1},\,{q_2},\,{q_3}} \right\}$$

$$\left\{ {{q_3}} \right\}$$

PREVIOUS NEXT

GATE CSE Papers

2023