UGC NET Paper 2 Computer Science – June 2023 – Question Paper with Answer Key

Given below are two statements: one is labeled as Assertion A and the other is labeled as Reason R.

Assertion A: Validity checks the real need of system users

Reason R: Completeness checks system user- defined requirements. In light of the above statements, choose the correct answer from the options given below.

Match List I with List II. List I: A. PERT, B. Optimistic time, C. CPM, D. Pessimistic time. List II: I. Used for non-repetitive jobs, II. Used for repetitive jobs, III. The shortest possible time to complete the activity if all goes well, IV. The longest time that an activity takes.

A TCP server application is programmed to listen on port P on host S . A TCP client is connected to the TCP server over the network, Consider that while TCP connection is active the server is crashed and rebooted. Assume that the client does not use TCP keepalive timer. Which of the following behaviour/s is/are possible?

Statement I: The TCP application server on S can listen on P after reboot.

Statement II: If client sends a packet after the server reboot, it will receive the RST segment. In the light of the above statements, choose the correct answer from the options given below.

Given below are two statements: one is labelled as Assertion A and the other is labelled as

Reason R.

Assertion A: I/O protection is ensured by a hardware trap

Reason R: I/O interrupt caused by the condition like I/O completion and device malfunction occuring within the I/O devices In the light of the above statements, choose the correct answer from the options given below.

Match List I with List II. List I: A. Parallel FFT, B. Iterative FFT, C. Evaluation of a polynomial at n points by Horner's method, D. Product of two polynomials represented in point-value form. List II: I. Θ(n²), II. Θ(n), III. Θ(lg n), IV. Θ(n lg n).

Match List I with List II. List I: A. Bezier curves, B. B-splines, C. Sweep representations, D. Natural objects. List II: I. 3D objects that have translational/rotational symmetry, II. Fractal geometry, III. Bias and tension, IV. Painting, drawing, CAD.

Let f(n) and g(n) be asymptotically positive functions. Statement I: f(n) ≥ 1 and f(n) = O(g(n)) ⇒ g(n) = Ω(f(n)). Statement II: f(n) = O(g(n)) ⇒ lg(f(n)) = O(lg(g(n))), where lg(g(n)) ≥ 1 and f(n) ≥ 1 for all sufficiently large n. Choose the most appropriate answer.

Consider the following statements:

S1: LRU page replacement algorithm suffers from the belady's anomaly

S2: Shortest remaining time first scheduling may cause starvations

S3: Stack is shared by all threads in a process

Match List I with List II. List I: A. Scenario testing, B. Regression testing, C. Component testing, D. Beta testing. List II: I. To verify the I/O behaviour of a text object, II. User acceptance methodology, III. No new bugs after changes in the program, IV. The documentation of a use case.

A. If some NP-complete problem P is in 𝒫, then 𝒫 = 𝒩𝒫. B. TSP is in 𝒩𝒫. C. SAT is in 𝒩𝒫. D. The Hamiltonian circuit problem is not NP-complete. Which are correct?

Suppose a circular queue of capacity n-1 elements is implemented with an array of n elements. Assume that the insertion and deletion operations are carried out using REAR and FRONT as array index variable respectively. Initially, REAR = FRONT =0. The conditions to detect queue empty and queue full are

Given below are two statements: one is labelled as Assertion A and the other is labelled as

Reason R .

Assertion A: A process involves a library function to create a thread.

Reason R: The threads make system calls to convey their resource and I/O requirement to the Kernel. In the light of the above statements, choose the correct answer from the options given below.

Given below are two statements: one is labelled as Assertion A and the other is labelled as

Reason R.

Assertion A: The AVL trees are more balanced as compared to Red Black trees, but they may cause more rotations during insertion and deletion

Reason R: A Red Black tree with n nodes has 2 log (n + 1) height that is greater than 2 and the AVL tree with n nodes has height less than – log (√5(n + 2)) − 2( Φ Φ where is golden ratio) In the light of the above statements, choose the correct answer from the options given below.

Match List I with List II

Let R = {x ∈ N : x is a multiple of 3 and x ≤ 100} and S = {x ∈ N : x is a multiple of 5 and x < 100}. What is the number of elements in (R ∩ S) × (S ∩ R)?

Let R(A, B, C, D) be a relational schema with dependencies A → B, B → C, C → D and D → B. The decomposition of R into (A, B), (B, C), (B, D):

Consider the following finite automata F1 that accepts a language L

Let F2 be a finite automata which is obtained by reversal of F1. Then which of the following is correct?

Given below are two statements: Which of the following statement/s is/are correct with respect to virtual memory

Statement I: Address translation is performed for every logical address used during the execution of a program

Statement II: A program can execute only when all of its components are loaded in the memory In the light of the above statements, choose the most appropriate answer from the options given below.

Given below are two statements:

Statement I: Fuzzifier is a part of a fuzzy system

Statement II: Inference engine is a part of fuzzy system In the light of the above statements, choose the most appropriate answer from the options given below.

#include <stdio.h>
int main() {
  int a, b, c;
  a = 0x10; b = 010;
  c = a + b;
  printf("%d", c);
  return 0;
}

What is the 4+4 bit binary fixed-point equivalent of −(3.72)₁₀?

Let ⊕ denote XOR, and 1 and 0 the binary constants. F(P, Q) = ((1 ⊕ P) ⊕ (P ⊕ Q)) ⊕ ((P ⊕ Q) ⊕ (Q ⊕ 0)). Which of the following is equivalent to F?

Which of the following scenario may lead to an irrecoverable error in a database system?

Given below are two statements: one is labelled as Assertion A and the other is labelled as

Reason R . A virtual memory system uses first-in first-out page replacement policy and allocates a fixed number of frames to a process

Assertion A: Increasing number of page frames allocated to a process sometimes increases the page fault rate.

Reason R: Some programs do not exhibit locality of reference. In the light of the above statements, choose the correct answer from the options given below.

Match List I with List II

Consider three processes: P0 (arrival 0 ms, burst 7 ms), P1 (arrival 1 ms, burst 3 ms), P2 (arrival 2 ms, burst 7 ms). Pre-emptive shortest job first scheduling is used, and scheduling happens only at arrival or completion of a process. What is the average waiting time?

Consider a hash table of size seven with starting (6x + 3) mod 4 index zero and a hash function . Assuming the hash table is initially empty. Which of the following is the content of the table when 1, 3, 8, 10, 5 the sequence , is inserted into the table using closed hashing? Here "__ " denotes an empty location in the table.

Match List I with List II. List I: A. RAID level 2, B. RAID level 4, C. RAID level 5, D. RAID level 3. List II: I. Bit-interleaved parity, II. Block-interleaved distributed parity, III. Error-correcting parity, IV. Block-interleaved parity.

Match List I with List II. List I: A. Expert system, B. Fuzzy system, C. Operator in genetic algorithm, D. Supervised technique. List II: I. Decision tree, II. Scramble, III. Inference engine, IV. Mycin.

How many integral solutions are there to x + y + z + w = 29, where x ≥ 1, y ≥ 2, z ≥ 3 and w ≥ 0?

main() {
  struct s1 { char *z; int i; struct s1 *p; };
  static struct s1 a[] = {
    {"Nagpur", 1, a+1},
    {"Raipur", 2, a+2},
    {"Kanpur", 3, a}
  };
  struct s1 *ptr = a;
  printf("%s %s %s\n", a[0].z, ptr->z, a[2].p->z);
}

Match List I with List II. List I: A. Critical region, B. Wait/signal, C. Working set, D. Deadlock. List II: I. Hoare's monitor, II. Mutual exclusion, III. Principle of locality, IV. Circular wait.

Consider two hosts P and Q that are connected through a router R. The maximum transfer unit (MTU) value of the link between P and R is 1500 bytes and between R and Q is 820 bytes. A TCP segment of size 1400 bytes is transferred from P to Q through R with IP identification value of 0 × 1234 . Assume that IP header size is 20 bytes. Further the pcaket is allowed to be fragmented that is Don't fragment (DF) flag in the IP Header is not set by P. Which of the following statement/s is/are true?

A. Two fragments are created at R and IP datagram size carrying the second fragment is 620 bytes

B. If the second fragment is lost, then R resends the fragment with IP identification value of 0 × 1234

C. If the second fragment lost, then P requires to resend the entire TCP segment.

D. TCP destination port can be determined by analyzing the second fragment only.

Given below are two statements: one is labelled as Assertion A and the other is labelled as

Reason R.

Assertion A: Dendral is an expert system

Reason R: The rationality of an agent is not related to its reaction to the environment. In the light of the above statements, choose the correct answer from the options given below.

Which phase of compiler checks the grammar of programming?

Given the basic E R diagram and relational model, which of the the following is incorrect?

A processor chip is used for application in which 30 % of execution time is spent on floating point addition. For the new model of the processor, the design team has come up with redesign the floating point adder to make it twice as fast. What will be possible maximum speed up by this redesign?

Given below are two statements: Which of the following concurrency control protocol ensures both conflict serializability and freedom from deadlock?

Statement I: Two phase locking

Statement II: Timestamp ordering In the light of the above statements, choose the most appropriate answer from the options given below:

Sutherland Hodgeman method is used on

A. The set of turning machine codes for TM's that accept all inputs that are palindromes (possible along with some other inputs) is decidable

B. The language of codes for TM's M that when started with blank tape, eventually write a 1 somewhere on the tape is undecidable

C. The language accepted by a TMM is LM is always recursive

D. Post's correspondence problem is undecidable

Let G = ℝ − {0} and H = {−1, 1} be groups under multiplication. Then the map φ : G → H defined by φ(x) = x/|x| is

Which of the following parser is most powerful parser?

What is x in the following program? # include < stdioh>

int main ()
{typedef (* (* arrfptr [3])()) [10];
arrfptr x ;
return 0;
}

Find the sum of all four digit numbers formed using the digits 1,2,4 and 6 .

The time between failures for a software system is: failure 1 – 6 hours, failure 2 – 4 hours, failure 3 – 8 hours, failure 4 – 5 hours, failure 5 – 6 hours. The reliability of the system for one hour of operation, assuming an exponential model, is

Which of the following statement is correct?

#include <stdio.h>
#include <stdlib.h>
#define MAXROW 3
#define MAXCOL 4
int main() {
  int **p, i, j;
  p = (int **) malloc(MAXROW * sizeof(int*));
  return 0;
}

Which is not a basic approach to the problem of conflict resolution in a production system?

Match List I with List II. List I: A. A △ B, B. A − (B ∪ C), C. A − (B ∩ C), D. A ∩ (B − C). List II: I. (A − B) ∪ (A − C), II. (A − B) ∩ (A − C), III. (A − B) ∪ (B − A), IV. (A ∩ B) − (A ∩ C).

The clipping process in computer graphics is used for

Consider a disk system with cylinders. The request to access the cylinders occurs in the following sequence: 4, 34, 10, 7, 19, 73, 2, 15, 6, 20 Assuming that the head is currently at cylinder 50 , what is the time taken to satisfy all requests if it takes 1 ms to move from one cylinder to adjacent one and shortest seek time first policy is used?

Consider the rectangle with vertices (0, 0), (0, 2), (3, 0), (3, 2) . There is scaling of 2 towards x -axis and 3 towards y -axis. The new cordinates of the rectangle are

Which of the following transforms in 2 dimension is used to resize a 2-dimensional object?

Consider the following statements.

A. The identity is unique in any monoid.

B. A monoid is a group if there exists inverse of each element of monoid.

C. Semi group has closure, associative and identity properties.

D. Quasi group has closure property.

main() {
  static float a[] = {13.24, 1.5, 4.5, 5.4, 3.5};
  float *j, *k;
  j = a;
  k = a + 4;
  j = j * 2;
  k = k / 2;
  printf("%f %f", *j, *k);
}

Match List I with List II

Given below are two statements:

Statement I: If f and g are two functions and f = O(g) g ≠ o(f) but , we say that the growth rate of g is smaller than that of f

Statement II: The class of all decision problems decided by a TM in exponential time, that is O(2k) k , being a constant. In the light of the above statements, choose the most appropriate answer from the options given below.

256 Mb DRAM is organized as a 16 K × 16 K memory externally and as a square array internally. Each row must be refreshed at least once every 50 mili second to forestall loss of data; refreshing one row takes 100 nanoseconds. What fraction of the total memory bandwidth is lost to refresh cycles?

Given below are two statements:

Statement I: subsystem models show logical grouping of objects into coherent subsystem

Statement II: State machine models show how objects change their states in response to events. In the light of the above statements, choose the most appropriate answer from the options given below.

Given below are two statements: one is labelled as Assertion A and the other is labelled as

Reason R.

Assertion A: It is possible to create doubly linked list using only one pointer with every node.

Reason R: By storing the XOR of the addresses of the previous and next nodes. In the light of the above statements, choose the most appropriate answer from the options given below.

The compiler for high level language that runs on one machine and produces code for other machine is called-

How many page faults will be encountered?

What is fault ratio of row major to column major arrangements ?

What is the main memory hit ratio?

What is the protocol of the payload being carried by the packet?

What is the size of datagram?