PREVIOUS YEAR SOLVED PAPERS MCQ - GATE 2017 Shift 1

36 Consider the following C program.
#include
#include
void printlength (char *s, char *t)
{
unsigned int c = 0;
int len = ((strlen (s) - strlen (t)) > c) ? strlen (s) : strlen (t);
printf("%d\n", len);
}
void main()
{
char *x = "abc";
char *y = "defgh";
printlength(x, y);
}
Recall that strlen is defined in string.h as returning a value of type size_t, which is an unsigned int .The output of the program is

((strlen(s) – strlen(t)) > c) ? strlen (s) : strlen (t)
= (3 – 5 > 0)
= (-2 > 0)
Important point here is while comparing -2 with c, result will be a positive number as c is unsigned. So, out of these two, strlen (s) will be printed. Therefore, option c is correct

37 Consider the following languages over the alphabet ∑= {a,b,c}. Let L₁ = {aⁿ bⁿc^m | m, n >= 0 } and L₂ = {a^mbⁿcⁿ| m, n >= 0}.
Which of the following are context-free languages ?
I. L₁ ∪ L₂
II. L₁ ∩ L₂

Union of context free language is also context free language.
L₁ = { aⁿ bⁿ c^m| m >= 0 and n >= 0 } and
L₂ = { a^m bⁿcⁿ| n >= 0 and m >= 0 }
L₃ = L₁ ∪ L₂ = { aⁿbⁿc^m∪ a^mbⁿcⁿ| n >= 0, m >= 0 } is also context free.
L₁ says number of a’s should be equal to number of b’s and L₂ says number of b’s should be equal to number of c’s. Their union says either of two conditions to be true. So it is also context free language.
Intersection of CFG may or may not be CFG.
L₃ = L₁ ∩ L₂ = { aⁿbⁿcⁿ| n >= 0 } need not be context free

38 Let u and v be two vectors in whose Euclidean norms satisfy What is the value of such that bisects the angle between u and v?

39 Consider the following grammar:
stmt → if exp r then else exp r ;stmt 0
exp r → termrelop term term
term → id | number
if → a | b | c
number → [0...9]
where relop is a relational operate (e.g <, >,...) ---O refers to the empty statement, and if, then, else are terminals.
Consider a program P following the above grammar containing ten if terminals. The number of control flows paths in P is _____. For example the program
if e₁ then e₂ else e₃
has 2 controls flow paths e₁→ e₂ and e₁ → e₃

For 2 “if statements”, 22 = 4 control flow paths are possible:

So for 10 “If statements”, control flow paths will be there.

40 In a database system, unique time stamps are assigned to each transaction using Lamport’s logical clock. Let TS(T₁) and TS(T₂) be the timestamps of transactions T₁ and T₂ respectively. Besides, T₁ holds a lock on the resource R, and T₂ has requested a conflicting lock on the same resource R. The following algorithm is used to prevent deadlocks in the database system assuming that a killed transaction is restarted with the same timestamp.
if TS(T₂) < TS(T₁) then
T₁ is killed
else T₂ waits.
Assume any transactions that is not killed terminates eventually. Which of the following is TRUE about the database system that uses the above algorithm to prevent deadlocks?

Given,
if TS(T₂) <TS(T₁) then
T₁ is killed
else T₂ waits.
- T₁ holds a lock on the resource R
- T₂ has requested a conflicting lock on the same resource R
According to algo, TS(T₂) <TS(T₁) then T1 is killed else T2 will wait. So in both cases neither deadlock will happen nor starvation.
Therefore, option A is correct

PREVIOUS YEAR SOLVED PAPERS MCQ - GATE 2017 Shift 1

Follow Us :