Time Left - 15:00 mins
GATE Prev Year : Theory of Computation Test-3
Attempt now to get your rank among 763 students!
Question 1
Aliasing in the context of programming languages refers to
Question 2
Let S and T be language over Σ={a,b} represented by the regular expressions(a+b*)* and (a+b)*, respectively. Which of the following is true?
Question 3
A piecewise linear function f(x) is plotted using thick solid lines in the figure below (the plot is drawn to scale).
If we use the Newton-Raphson method to find the roots of f(x) =0 using x0, x1, and x2 respectively
as initial guesses, the roots obtained would be
If we use the Newton-Raphson method to find the roots of f(x) =0 using x0, x1, and x2 respectively
as initial guesses, the roots obtained would be
Question 4
Consider the following deterministic finite state automaton M.
Let S denote the set of seven bit binary strings in which the first, the fourth, and the last bits are 1. The number of strings in S that are accepted by M is
Let S denote the set of seven bit binary strings in which the first, the fourth, and the last bits are 1. The number of strings in S that are accepted by M is
Question 5
The following diagram represents a finite state machine which takes as input a binary number from the least significant bit.
Which one of the following is TRUE?
Which one of the following is TRUE?
Question 6
Consider three decision problems P1, P2 and P3. It is known that P1 is decidable and P2 is undecidable. Which one of the following is TRUE?
- 763 attempts
- 6 upvotes
- 43 comments
Jul 5GATE & PSU CS
