List of top Computer Networks Questions on Miscellaneous asked in GATE CS

Consider a context-free grammar \(G\) with the following 3 rules: \[ S \to aS, \quad S \to aSbS, \quad S \to c \] Let \(w \in L(G)\). Let \(n_a(w), n_b(w), n_c(w)\) denote the number of times \(a, b, c\) occur in \(w\), respectively. Which of the following statements is/are TRUE?

A functional dependency \(F: X \to Y\) is termed as a useful functional dependency if and only if it satisfies all the following three conditions: \(X\) is not the empty set. \(Y\) is not the empty set. Intersection of \(X\) and \(Y\) is the empty set. For a relation \(R\) with 4 attributes, the total number of possible useful functional dependencies is ............

Let \(S1\) and \(S2\) be two stacks. \(S1\) has a capacity of 4 elements, and \(S2\) has a capacity of 2 elements. \(S1\) already has 4 elements: 100, 200, 300, and 400, whereas \(S2\) is empty, as shown below. \begin{center} \includegraphics[width=8cm]{48.png} \end{center} Only the following three operations are available:
\texttt{PushToS2:} Pop the top element from \(S1\) and push it on \(S2\).
\texttt{PushToS1:} Pop the top element from \(S2\) and push it on \(S1\).
\texttt{GenerateOutput:} Pop the top element from \(S1\) and output it to the user. Note: - The pop operation is not allowed on an empty stack.
- The push operation is not allowed on a full stack. Which of the following output sequences can be generated by using the above operations?

You are given a set \(V\) of distinct integers. A binary search tree \(T\) is created by inserting all elements of \(V\) one by one, starting with an empty tree. The tree \(T\) follows the convention that, at each node, all values stored in the left subtree of the node are smaller than the value stored at the node. You are not aware of the sequence in which these values were inserted into \(T\), and you do not have access to \(T\). Which one of the following statements is TRUE?

Which of the following file organizations is/are I/O efficient for the scan operation in DBMS?}