Recent questions tagged gatecse2025-set2

Consider two grammars $G_{1}$ and $G_{2}$ with the production rules given below: $G_{1} : S \rightarrow$ $if$ $E$ $then$ $S$ $|$ $if$ $E$ $then$ $S$ $else$ $S$ $|$ $a$ ...

Let $\Sigma=\{a, b, c\}$. For $x \in \Sigma^{*}$, and $\alpha \in \Sigma$, let $\#_{\alpha}(x)$ denote the number of occurrences of $\alpha$ in $x$. Which one or more of...

Consider the database transactions T1 and T2 , and data items X and Y . Which of the schedule(s) is/are conflict serializable?$$\begin{array}{|ll|} \hline \textbf{Transa...

Consider the following relational schema: Students ($\underline{\text{rollno: integer}},$ name: string, age: integer, cgpa: real) Courses ($\underline{\text{courseno: int...

Given a computing system with two levels of cache (L1 and L2) and a main memory. The first level (L1) cache access time is $1$ nanosecond (ns) and the "hit rate" for L1 c...

A $5$-stage instruction pipeline has stage delays of $180,250,150,170$, and $250$, respectively, in nanoseconds. The delay of an inter-stage latch is $10$ nanoseconds. As...

In a $\mathrm{B}^{+}$- tree where each node can hold at most four key values, a root to leaf path consists of the following nodes:\[\mathrm{A}=(49,77,83,-), \mathrm{B}=(7...

A computer system supports a logical address space of $2^{32}$ bytes. It uses two-level hierarchical paging with a page size of $4096$ bytes. A logical address is divided...

Consider the following algorithm someAlgo that takes an undirected graph $G$ as input. ...

Let $\Sigma=\{1,2,3,4\}$. For $x \in \Sigma^{*}$, let $\operatorname{prod}(x)$ be the product of symbols in $x$ modulo 7. We take $\operatorname{prod}(\epsilon)=1$, where...

An application executes $6.4 \times 10^{8}$ number of instructions in $6.3$ seconds. There are four types of instructions, the details of which are given in the table. Th...

Consider the following C program:#include<stdio.h int main(){ int a; int arr[5] = {30,50,10}; int *ptr; ptr = &arr[0] + 1; a = *ptr; (*ptr)++; ptr++; printf("%d", a + (*p...

Consider the following C program:#include <stdio.h int g(int n) { return (n+10); } int f(int n) { return g(n*2); } int main() { int sum, n; sum=0; for (n=1; n<3; n++) sum...

A quadratic polynomial $(x-\alpha)(x-\beta)$ over complex numbers is said to be square invariant if $(x-\alpha)(x-\beta)=\left(x-\alpha^{2}\right)\left(x-\beta^{2}\right)...

The unit interval $(0,1)$ is divided at a point chosen uniformly distributed over $(0,1)$ in $\mathbb{R}$ into two disjoint subintervals.The expected length of the subint...

​​​​​The value of $x$ such that $x>1$, satisfying the equation $\int_1^x t \ln t \: dt = \frac{1}{4}$ is$\sqrt{e}$$e$$e^2$$e-1$

​​​​Consider a binary tree $T$ in which every node has either zero or two children. Let $n>0$ be the number of nodes in $T$.Which ONE of the following is the number of no...

​​​Let $P(x)$ be an arbitrary predicate over the domain of natural numbers. Which ONE of the following statements is TRUE?$\big (P(0) \wedge \big( \forall x [P(x) \Righta...

​​​​​Consider the following statements:Address Resolution Protocol (ARP) provides a mapping from an IP address to the corresponding hardware (link-layer) address.A single...

Consider the routing protocols given in List I and the names given in List II:$$\begin{array}{|ll|ll|}\hline & \textbf{List I} & & \textbf{List II} \\\hline \text{(i)} ...

​​​A machine receives an $IPv4$ datagram. The protocol field of the $IPv4$ header has the protocol number of a protocol $X$.Which ONE of the following is NOT a possible c...

​​​​​Consider the following C program:#include <stdio.h void stringcopy (char *, char *); int main() { char a[30] = "@#Hello World!"; stringcopy(a, a+2); printf("%s\n",a)...

​​​​Consider an unordered list of $N$ distinct integers.What is the minimum number of element comparisons required to find an integer in the list that is NOT the largest ...

​​​​Consider the following statements about the use of backpatching in a compiler for intermediate code generation:Backpatching can be used to generate code for Boolean e...

​​Given the following syntax directed translation rules:Rule 1: $R \rightarrow A B\{B . i=R . i-1 ; A . i=B . i ; R . i=A . i+1 ;\}$Rule 2: $P \rightarrow C D\{P . i=C . ...

​​​​​Consider a network that uses Ethernet and $IPv4$. Assume that $IPv4$ headers do not use any options field. Each Ethernet frame can carry a maximum of $1500$ bytes in...

​​​​Which ONE of the following languages is accepted by a deteministic pushdown automaton?Any regular languageAny context-free languageAny language accepted by a non-dete...

​​​​Let $G_{1}, G_{2}$ be Context Free Grammars (CFGs) and $R$ be a regular expression. For a grammar $G$, let $L(G)$ denote the language generated by $G$.Which ONE among...