Question 1 |

f(n^2)=\theta (f(n)^2), where f(n) is a polynomial | |

f(n^2)=o (f(n)^2) | |

f(n^2)=O (f(n)^2), where f(n) is an exponential function | |

f(n^2)=\Omega (f(n)^2) |

Question 2 |

ab*bab* + ba*aba* | |

(ab*b)*ab* + (ba*a)*ba* | |

(ab*b + ba*a)*(a* + b*) | |

(ba*a + ab*b)*(ab* + ba*) |

Question 3 |

The LALR(1) parser for a grammar G cannot have reduce-reduce conflict if the
LR(1) parser for G does not have reduce-reduce conflict.
| |

Symbol table is accessed only during the lexical analysis phase. | |

Data flow analysis is necessary for run-time memory management. | |

LR(1) parsing is sufficient for deterministic context-free languages. |

Question 4 |

A relation with only two attributes is always in BCNF. | |

If all attributes of a relation are prime attributes, then the relation is in BCNF. | |

Every relation has at least one non-prime attribute. | |

BCNF decompositions preserve functional dependencies. |

Question 5 |

the reversed linked list should look like

Which one of the following statements is TRUE about the time complexity of algorithms that solve the above problem in O(1) space?

The best algorithm for the problem takes \theta(n) time in the worst case. | |

The best algorithm for the problem takes \theta(n \log n) time in the worst case. | |

The best algorithm for the problem takes \theta(n^2) time in the worst case. | |

It is not possible to reverse a singly linked list in O(1) space. |

Question 6 |

\frac{m}{n} | |

\frac{n}{m} | |

\frac{2n}{m} | |

\frac{n}{2m} |

Question 7 |

DMA based I/O transfer | |

Interrupt driven I/O transfer | |

Polling based I/O transfer | |

Programmed I/O transfer |

Question 8 |

R1 = 1011 and R2 = 1110 | |

R1 = 1100 and R2 = 1010 | |

R1 = 0011 and R2 = 0100 | |

R1 = 1001 and R2 = 1111 |

Question 9 |

Which initialization of the semaphores would print the sequence BCABCABCA ...?

S_1 = 1; S_2 = 1; S_3 = 1 | |

S_1 = 1; S_2 = 1; S_3 = 0 | |

S_1 = 1; S_2 = 0; S_3 = 0 | |

S_1 = 0; S_2 = 1; S_3 = 1 |

Question 10 |

Statement 1: tr(AB) = tr(BA)

Statement 2: tr(CD) = tr(DC)

wheretr() represents the trace of a matrix. Which one of the following holds?

Statement 1 is correct and Statement 2 is wrong. | |

Statement 1 is wrong and Statement 2 is correct. | |

Both Statement 1 and Statement 2 are correct. | |

Both Statement 1 and Statement 2 are wrong. |

Gate 2022 CSE question paper and solution.

Practice Previous year GATE CSE Topicwise questions with detail Solution.