GATE CSE 1998
Q21.
Suppose A is a finite set with n elements. The number of elements in the largest equivalence relation of A isQ22.
The binary relation R = \{(1, 1), (2, 1), (2, 2), (2, 3), (2, 4), (3, 1), (3, 2), (3, 3), (3, 4)\} on the set A=\{1, 2, 3, 4\} isQ24.
Let R_1 and R_1 be two equivalence relations on a set. Consider the following assertions: I. R_1 \cup R_2 is an equivalence relation II. R_1 \cap R_2 is an equivalence relation Which of the following is correct?Q26.
If the regular set A is represented by A = (01 + 1)^* and the regular set B is represented by B = \left(\left(01\right)^*1^*\right)^*, which of the following is true?Q27.
Give the correct matching for the following pairs: \begin{array}{ll|ll}\hline \text{(A)} & \text{$O (\log n)$} & \text{(P)} & \text{Selection sort} \\\hline \text{(B)} & \text{$O (n)$} & \text{(Q)}& \text{Insertion sort} \\\hline \text{(C)}& \text{$O (n \log n)$} & \text{(R)} & \text{Binary search} \\\hline \text{(D)} & \text{$O (n^2)$} &\text{(S)} & \text{Merge sort} \\\hline \end{array}Q28.
Faster access to non-local variables is achieved using an array of pointers to activation records called aQ29.
The overlay tree for a program is as shown below:What will be the size of the partition (in physical memory) required to load (and run) this program?Q30.
A linker reads four modules whose lengths are 200, 800, 600 and 500 words, respectively. If they are loaded in that order, what are the relocation constants?