UGC NET Paper 2 Computer Science – September 2022 – Question Paper with Answer Key

Consider a memory system with addresses spaced at a distance m, bank cycle time T and n banks. The average data access time per word in synchronous organization is

For a multiprocessor system, an interconnection network such as a crossbar switch is an example of

Consider the primal problem: maximize z = 5x1 + 12x2 + 4x3 subject to x1 + 2x2 + x3 = 10, 2x1 − x2 + 3x3 = 8, x1, x2, x3 ≥ 0. Its dual is: minimize w = 10y1 + 8y2 subject to y1 + 2y2 ≥ 5, 2y1 − y2 ≥ 12, y1 + 3y2 ≥ 4. Which of the following is correct?

The reduced grammar equivalent to S → AB | CA, B → BC | AB, A → a, C → aB | b is

Consider the grammar G: S → AbB, A → aAb | λ, B → bB | λ. Which language does G generate?

Consider L = {ab, aa, baa}. Which string is NOT in L*?

Consider the NPDA ({q0, q1, qf}, {a, b}, {1, z}, δ, q0, z, {qf}) with δ(q0, λ, z) = {(qf, z)}, δ(q0, a, z) = {(q1, 11z)}, δ(q1, a, 1) = {(q1, 111)}, δ(q1, b, 1) = {(q1, λ)}, δ(q1, λ, z) = {(qf, z)}. Which language does it accept?

The hidden surface removal problem with a minimal 3D pipeline can be solved with

Using RSA with p = 13, q = 5 and e = 7, the value of d and the cipher value of '6' with key (e, n) are

What is called journalling in the Linux operating system?

The transformation [x̄ ȳ z̄ w̄]ᵀ = [a1 b1 c1 d1; a2 b2 c2 d2; a3 b3 c3 d3; e f g h] · [x y z 1]ᵀ is called

Which relational algebra query computes the names of sailors who have reserved all boats?

Which relational algebra query computes the names of sailors who have reserved a red and a green boat?

The maximum achievable throughput is

Which metrics are derived by normalizing quality and/or productivity measures by the size of the software produced?

The model in which the requirements are implemented by category is

Modules X and Y operate on the same input and output data. The cohesion is

A classless address is given as 167.199.170.82/27. The number of addresses in the network is

A 4-stage pipeline has stage delays of 150, 120, 160 and 140 ns. The registers between stages have a delay of 5 ns. Assuming a constant clocking rate, the total time required to process 1000 data items on this pipeline is

The solution of the recurrence T(n) = 3T(n/4) + n log n is

Consider a B-tree of height h and minimum degree t ≥ 2 containing n keys, n ≥ 1. Which is correct?

How many rotations are required during the construction of an AVL tree if the elements 35, 50, 40, 25, 30, 60, 78, 20, 28 are added in this sequence?

Match List I with List II. List I: (A) Stack overflow, (B) Timer, (C) Invalid opcode, (D) Supervisor call. List II: (I) Software interrupt, (II) Internal interrupt, (III) External interrupt, (IV) Machine check interrupt.

Let R(ABCDEFGH) be a relation schema and F = {A → B, ABCD → E, EF → G, EF → H, ACDF → EG}. The minimal cover of this set of dependencies is

A trigger is

Consider two PCP instances over {0, 1}, each with lists A and B of three strings. X: A = (1, 10111, 10), B = (111, 10, 0). Y: A = (10, 011, 101), B = (101, 11, 011). Which is true?

Match List I with List II. List I: (A) Activation record, (B) Location counter, (C) Reference count, (D) Address relocation. List II: (I) Linker/loader, (II) Garbage collection, (III) Subroutine call, (IV) Assembler.

Consider the following related to Fourth Generation Techniques (4GT): (A) It controls efforts. (B) It controls resources. (C) It controls cost of development. Choose the correct answer:

Consider the grammar S → SbS | a. The string abababa has (A) two parse trees (B) two leftmost derivations (C) two rightmost derivations. Which is correct?

Considering α, β, γ as logical variables, which represent correct equivalences? (A) (α ∧ (β ∨ γ)) ≡ ((α ∧ β) ∨ (α ∧ γ)) (B) (α ∨ β) ≡ ¬α ∨ β (C) (α ⇒ β) ≡ (¬β ⇒ ¬α) (D) ¬(α ∨ β) ≡ (¬α ⇒ ¬β)

Let ({a, b}, *) be a semigroup where a * a = b. Which hold? (A) a * b = b * a (B) b * b = b

For the graph shown, the following depth-first search sequences are given: (A) abcghf (B) abfchg (C) abfhgc (D) afghbc. Which of the following is correct?

Let ε = 0.0005 and R_ε be the relation {(x, y) ∈ ℝ² : |x − y| < ε}, interpreted as 'approximately equal'. R_ε is (A) reflexive (B) symmetric (C) transitive.

In reference to big data, consider the following databases: (A) Memcached (B) CouchDB (C) InfiniteGraph.

Match List I with List II. List I: A. BCNF, B. 3NF, C. 2NF, D. 4NF. List II: I. Removes multivalued dependency, II. Not always dependency preserving, III. Removes transitive dependency, IV. Removes partial functional dependency.

Match List I with List II. List I: A. Localization, B. Packaging or binding of a collection of items, C. Mechanism that lets a designer focus on the essential details of a component, D. Information hiding. List II: I. Encapsulation, II. Abstraction, III. Characteristic of software indicating how concentrated information is in the program, IV. Suppressing the operational details of a component.

Match List I with List II. List I: (A) Type 0, (B) Type 1, (C) Type 2, (D) Type 3. List II: (I) Finite automata, (II) Turing machine, (III) Linear bounded automata, (IV) Pushdown automata.

Match List I with List II. List I: (A) Ontological engineering, (B) Taxonomy hierarchy, (C) Inheritance, (D) Probability models. List II: (I) Organizing subclass relations, (II) Organizing knowledge into categories and sub-categories, (III) Attaches a number to each possibility, (IV) Representing concepts, events, time and physical concepts of different domains.

Match List I with List II. List I: (A) Least frequently used, (B) Critical section, (C) Loosely coupled multiprocessor system, (D) Distributed operating system. List II: (I) Memory is distributed among processors, (II) Page-replacement policy in cache memory, (III) Program section that, once begun, must complete before another processor accesses the same shared resource, (IV) OS routines are distributed among available processors.

Match List I with List II. List I: (A) Firmware, (B) Batch file, (C) Packing, (D) Banker's algorithm. List II: (I) Number of logical records into physical blocks, (II) ASCII format, (III) Resource allocation, (IV) ROM.

Match List I with List II. List I: (A) DES, (B) AES, (C) 3DES, (D) RSA. List II: (I) Key size 256, (II) Key size 1024, (III) Key size 56, (IV) Key size 168.

Match List I with List II. List I: (A) BIND, (B) LISTEN, (C) ACCEPT, (D) SOCKET. List II: (I) Block the caller until a connection attempt arrives, (II) Give a local address to a socket, (III) Show willingness to accept connections, (IV) Create a new end point.

Match List I with List II. List I: (A) Physical layer, (B) Data link layer, (C) Network layer, (D) Presentation layer. List II: (I) Routing of signals, dividing outgoing messages into packets, acting as network controller, (II) Making and breaking connections, defining voltages and data rates, converting bits into electrical signals, (III) Synchronization, error detection and correction, assembling outgoing messages into frames, (IV) Works as a translating layer.

Match each algorithm with its running time. (A) Breadth-first search, (B) Rabin–Karp algorithm, (C) Depth-first search, (D) Heap sort (worst case), (E) Quick sort (worst case). Times: (I) Θ(V + E), (II) O(V + E), (III) Θ((n − m + 1)m), (IV) O(n²), (V) O(n log n).

Match List I with List II. List I: (A) Stack algorithm, (B) Elevator algorithm, (C) Priority scheduling algorithm, (D) Havender's algorithm. List II: (I) Deadlock, (II) Disk scheduling, (III) Page replacement, (IV) CPU scheduling.

Statement I: Vertex cover has a polynomial-time 2-approximation algorithm. Statement II: TSP-tour is a polynomial-time 3-approximation algorithm for the travelling salesman problem with the triangle inequality. Which is correct?

Statement I: Conservative 2PL is a deadlock-free protocol. Statement II: Thomas's write rule enforces conflict serializability. Statement III: Timestamp ordering ensures serializability based on the order of transaction timestamps. Which is correct?

Statement I: Composite attributes cannot be divided into smaller subparts. Statement II: Complex attributes are formed by nesting composite and multivalued attributes in an arbitrary way. Statement III: A derived attribute is one whose values are computed from other attributes. Which is correct?

Statement I: The LALR parser is more powerful than the canonical LR parser. Statement II: The SLR parser is more powerful than LALR. Which is correct?

Statement I: CFLs are closed under homomorphism. Statement II: CFLs are closed under complement. Which is correct?

Assertion (A): p̄. Reason (R): (r → q̄, r ∨ s, s → q̄, p → q). Choose the correct answer.

Of the following, which is NOT a logical error?

Assertion (A): A load-and-go assembler avoids the overhead of writing the object program out and reading it back in. Reason (R): This can be done with either a one-pass or a two-pass assembler.

Which statement is false?

Statement I: "Grandparent is a parent of one's parent". Statement II: Its first-order predicate logic representation is ∀g, c grandparent(g, c) ⇔ ∃p parent(g, p) ∧ parent(p, c).

Statement I: Consider the 20-bit 'Branch' microinstruction format: F1 (3 bits), F2 (3), F3 (3), CD (2), BR (2), AD (7), where F1–F3 are micro-operation fields, CD is the branch condition, BR the branch field and AD the address field. Statement II: An instruction in this format can perform a branch in 4 conditions.