ISRO Scientist/Engineer CS Solved Papers

One SAN switch has 24 ports. All 24 port supports 8 Gbps Fiber Channel technology. What is the aggregate bandwidth of that SAN switch?

Find the output of the following Java code line

System.out.println(Math.floor(-7.4))

Belady's anomaly means

In an RS flip-flop, if the S line (Set line) is set high (1) and the R line (Reset line) is set low (0), then the state of the flip flop is

In HTML, which of the following can be considered a container?

What is the matrix that represents rotation of an object by θ° about the origin in 2D?

In a system having a single processor, a new process arrives at the rate of six processes per minute and each such process requires seven seconds of service time. What is the CPU utilization?

A symbol table of length 152 is possessing 25 entries at any instant. What is occupation density?

A problem whose language is recursion is called ?

Logic family popular for low power dissipation

The probability density function of a random variable $X$ is
$$f(x)=ke^{-|x|},\quad -\infty < x < \infty$$
The value of $k$ and the mean of the $X$ are:

Given the matrix, $A=\begin{bmatrix}1 & 1\\ 1 & -1\end{bmatrix}$. The trace of $A$, $Tr(A)=0$. The value of $Tr(A^{8})+Tr(A^{9})$ is:

What is the largest possible value for the rank of $A$ and the smallest possible value for the nullity of $A$, if $A$ is a $5\times3$ matrix?

Consider a FIFO page replacement policy based memory unit. Which of the following statements are TRUE?

Consider a system where each process has a virtual address space of $2^v$ bytes. The physical address space of the system is $2^p$ bytes, and the page size is $2^k$ bytes. What is the number of logical pages of a process and number of physical frames in the system?

Consider the following line of code in a function of a process.

int *y = (int*)malloc(50 * sizeof(int));

Which of the following conditions best describes for Bounded Waiting in process synchronization?

Which of the following statements is/are True?
I. Given a CFG $G=(N,\Sigma,P,S)$ and a string $x \in \Sigma^*$, $x \in L(G)$ is decidable.
II. Given CFG's $G_1$ and $G_2$, is $L(G_1)=L(G_2)$ is undecidable.
III. Given CFG's $G_1$ and $G_2$, is $L(G_1)=L(G_2)$ is decidable.
IV. Given a CFG $G=(N,\Sigma,P,S)$ and a string $x \in \Sigma^*$, $x \in L(G)$ is undecidable.

Consider the grammar defined by the following production rules, with two operators $*$ and $+$$$\begin{aligned} S &\rightarrow T * P \\ T &\rightarrow U \mid U * T \\ P &\rightarrow Q + P \mid Q \\ Q &\rightarrow Id \\ U &\rightarrow Id \end{aligned}$$

For any given transition in a finite automaton with $Q$ states, the number of possible states for DFA and NFA are (respectively):

Consider the following Syntax Directed Translation Scheme(SDTS), with non-terminals $\{S, A\}$ and terminals $\{a, b\}$.
$$S \rightarrow A a \;\{ \text{print } 1 \}$$
$$S \rightarrow a \;\{ \text{print } 2 \}$$
$$A \rightarrow S b \;\{ \text{print } 3 \}$$
Using the above SDTS, the output printed by a bottom-up parser, for the input $aba$ is

Among simple LR (SLR), canonical LR, and look-ahead LR (LALR), which of the following pairs identify the order of the method that is very easy to implement and the method that is most powerful?

What happens when a bit-string is XORed with itself $n$-times as shown?
$$[B \oplus (B \oplus (B \oplus (B \dots \dots \dots n \text{ times})]$$

Consider the minterm list form of a Boolean Function $F$ given below.
$$F(P, Q, R, S) = \sum m(0, 2, 8, 9, 10, 11, 12, 13, 14, 15)$$
What is the equivalent Boolean expression in sum-of-products form?

Consider the Boolean operator $\#$ with the following properties:
$$x \# 0 = x,\quad x \# 1 = \overline{x},\quad x \# x = 0,\quad \text{and}\quad x \# \overline{x} = 1$$
Then $x \# y$ is equivalent to