UGC NET Paper 2 Computer Science – December 2019 – Question Paper with Answer Key

A basic feasible solution of an transportation problem is said to be non- degenerate, if basic feasible solution contains exactly------------- number of individual allocation in-------------- positions.

Maximize z = x₁ + x₂ subject to x₁ + 2x₂ ≤ 2000, x₁ + x₂ ≤ 1500, x₂ ≤ 600, x₁, x₂ ≥ 0. The solution is

The Boolean expression AB′ + AB + A′C + AC is unaffected by the value of the Boolean variable

What are the GLB and LUB of the sets A = {3, 9, 12} and B = {1, 2, 4, 5, 10}, if they exist, in the poset (Z⁺, /)?

Let (P) be the set of all people. Let (R) be a binary relation on (P) such that (a, b) is in R if a is a brother of b. Is (R) symmetric transitive, an equivalence relation, a partial order relation?

The weight of minimum spanning tree in graph G, calculated using Kruskal's algorithm is :

A tree has 2 n vertices of degree 1,3 n vertices of degree 2, n vertices of degree 3 . Determine the number of vertices and edges in tree.

How many reflexive relations are there on a set with 4 elements?

A non-pipelined system takes 30 ns to process a task. The same task can be processed in a four- segment pipeline with a clock cycle of 10 ns . Determine the speed up of the pipeline for 100 tasks.

A computer uses a memory unit of 512 K words of 32 bits each. A binary instruction code is stored in one word of the memory. The instruction has four parts: an addressing mode field to specify one of the two-addresssing mode (direct and indirect), an operation code, a register code part to specify one of the 256 registers and an address part. How many bits are there in addressing mode part, opcode part, register code part and the address part?

A micro instruction format has microoperation field which is divided into 2 subfields F1 and F2, each having 15 distinct microoperations, condition field CD for four status bits, branch field B R having four options used in conjunction AD with address field . The address space is of 128 memory words. The size of micro instruction is :

If (142)_b + (112)_(b−2) = (75)_8, find the base b.

The following program is stored in the basic computer: 010 CLA; 011 ADD 016; 012 BUN 014; 013 HLT; 014 AND 017; 015 BUN 013; 016 C1A5; 017 93C6. Give the accumulator contents (hex) after execution.

What is the output? int i, j, x = 0; for (i = 0; i < 5; ++i) for (j = 0; j < i; ++j) { x += (i + j − 1); break; } printf("%d", x);

Let A be the base class in C ++ and B be the derived class from A with protected inheritance. Which of the following statement is false for class B?

Which tag is used to enclose any number of javascript statements in HTML document?

A rectangle is bounded by x = 0, y = 0, x = 5 and y = 3. The segment joining (−1, 0) and (4, 5), clipped against this window, connects the points

Which of the following algorithms is not used for line clipping?

1024 × 768 If we want to resize a pixels image to one that is 640 pixels wide with the same aspect ratio, what would be the height of the resized image?

Which of the component module of DBMS does rearrangement and possible ordering of operations, eliminate redundancy in query and use efficient algorithms and indexes during the exceution of a query?

Given two tables R1(x,y) and R2(y,z) with 50 and 30 numbers of tuples respectively. Find the maximum number of tuples in the output of natural join between tables R1 and R2 i.e. R1 * R2. (* - Natural Join)

Given two tables EMPLOYEE (EID, ENAME, DEPTNO) DEPARTMENT (DEPTNO, DEPTNAME) Find the most appropriate statement of the given query : Select count (*) 'total' from EMPLOYEE where DEPTNO IN (D1, D2) group by DEPTNO having count (*) > 5.

Find the minimum number of tables required for converting the following entity relationship diagram into a relational database.

A counting semaphore is initialized to 8. 3 wait ( ) operations and 4 signal () operations are applied. Find the current value of the semaphore variable.

Which of the following is not needed by an encryption algorithm used in Cryptography?

Which of the following CPU scheduling algorithms is/are supported by LINUX operating system?

Consider a paging system where translation looks aside buffer (TLB) a special type of associative memory is used with a hit ratio of 80%.. Assume that memory reference takes 80 nanoseconds and reference time to TLB is 20 nanoseconds. What will be the effective memory access time given an 80 % hit ratio?

A system has 12 tape drives. At time t0, p0 has maximum need 10 and holds 5, p1 needs 4 and holds 2, p2 needs 9 and holds 2. The system is in a safe state. Which is a safe sequence?

Which of the following interprocess communication model is used to exchange messages among co-operative processes?

With a 2 ms time slice and processes P1 (burst 3, arrival 0), P2 (4, 2), P3 (5, 5), find the average turnaround and waiting times under round robin.

Which of the following methods are used to pass any number of parameters to the operating system through system calls?

Java Virtual Machine (JVM) is used to execute architectural neutral byte code. Which of the following is needed by the JVM for execution of Java Code?

In a system for a restaurant, the main scenario for placing an order is given below :

(a) Customer reads menu

(b) Customer places order

(c) Order is sent to the kitchen for preparation

(d) Ordered items are served

(e) Customer requests for a bill for the order (f) Bill is prepared for this order (g) Customer is given the bill (h) Customer pays the bill A sequence diagram for the scenario will have at least how many objects among whom the messages will be exchanged.

An --------------- chart is a project schedule representation that presents project plan as a directed graph. The critical path is--------------- the sequence of ---------------tasks and it defines project---------------

Using a^(2c) mod n = (a^c)² mod n and a^(2c+1) mod n = a·(a^c)² mod n, for a = 7, b = 17 and n = 561, what is a^b mod n?

A clique in an undirected graph is a V ′ ⊆ V subset of vertices, such that u, v) ∈ E u ∈ V ′ v ∈ V ′

What is the worst case running time of Insert and Extract-min, in an implementation of a priority queue using an unsorted array? Assume that all insertions can be accomodated.

In a B-Tree, each node represents a disk block. Suppose one block holds 8192 bytes. Each key uses 32 bytes. In a B-tree of order M there are M - 1 keys. Since each branch is on another disk block, we assume a branch is of 4 bytes. The total memory requirement for a non-leaf node is

Give tight bounds for T(n) = 4T(√n) + lg²n, with T(n) constant for n ≤ 2.

Consider a weighted directed graph. The current shortest distance from source S to node x is represented by d[x]. Let d[v]= 29, d[u]= 15, w[u,v]=12. What is the updated value of d[v] based on current information?

When using Dijkstra's algorithm to find shortest path in a graph, which of the following statement is not true?

The time complexity to multiply two polynomials of degree n using Fast Fourier transform method is :

Consider the following grammars : G : S → aSb|bSa|aa 1 G : S → aSb|bSa|SS ∣ λ 2 G : S → aSb|bSa|SS ∣ a 3 G : S → aSb|bSa|SS|SSS|λ 4 Which of the following is correct w.r.t. the above grammars? G G

Which grammar generates L = {aⁿbⁿ⁻³ | n > 2} over Σ = {a, b}?

Consider the following grammar :

S → 0A ∣ 0BB

A → 00A ∣ λ

B → 1B ∣ 11C

C → B Which language does this grammar generate?

Let Σ = {w, x} and T = {x, y, z}, with homomorphism h(x) = xzy and h(w) = zxyy. If L is denoted by r = (w + x*)(ww)*, then h(L) is denoted by

Consider the following statements with respect L = {anbn ∣ n ≥ 0} to the language

S : L2 1 is context free language

S : Lk 2 is conext-free language for any given k ≥ 1 ¯¯¯

S : L L∗ 3 and are context free languages Which one of the following is correct? S S

Consider the following languages : L = {anbncm} ∪ {anbmcm}, n, m ≥ 0 1 L = {wwR ∣ w ∈ {a, b}*} 2 Where R represents reversible operation. Which one of the following is (are) inherently ambiguous language(s)? L

Let G=(V, T, S, P) be any context-free grammar λ without any -productions or unit productions. Let K be the maximum number of symbols on the right of any production in P. The maximum number of production rules for any equivalent grammar in Chomsky normal form is given by: 1 − I Where denotes the cardinality of the set.

Consider the following language families : L ≡ The context - free languages 1 L ≡ The context - sensitive languages 2 L 3 ≡ The recursively enumerable languages L ≡ The recursive languages 4 Which one of the following options is correct? L ⊆ L ⊆ L ⊆ L

Consider the following statements : S

1 : These exists no algorithm for deciding if any M M two Turing machines 1 and 2 accept the same language. S M M

2 : Let 1 and 2 be arbitrary Turing ⊆ L (M ) machines. The problem to determine 2 is undecidable. Which of the statements is (are) correct? S

Let A = {001, 0011, 11, 101} and B = {01, 111, 111, 010}; C = {00, 001, 1000} and D = {0, 11, 011}. Which pairs have a Post correspondence solution?

Which of the following class of IP address has the last address as 223.255 .255 .255 ?

Consider a subnet with 720 routers. If a three- level hierarchy is chosen, with eight clusters, each containing 9 regions of 10 routers, then total number of entries in hierarchical table of each router is

Piconet is a basic unit of a bluetooth system consisting of------------ master node and up to ---- ---------- active slave nodes.

A network with bandwidth of 10 Mbps can pass only an average of 12.000 frames per minute with each frame carrying an average of 10,000 bits. What is the throughput of this network?

The full form of ICANN is

According to Dempster-Shafer theory for uncertainty management, Bel(A) Where denotes Belief of event A.

Consider the following statements:

S : ∀xP(x) ∨ ∀xQ(x) 1 and ∀x(P(x) ∨ Q(x)) are not logically equivalent.

S : ∃xP(x) ∧ ∃xQ(x) 2 and ∃x(P(x) ∧ Q(x)) are not logically equivalent Which of the following statements is/are correct?

Consider the game tree given below

□ Here ○ and represent MIN and MAX nodes respectively. The value of the root node of the game tree is:

Consider the following models: M1: Mamdani model M

2 : Takagi - Sugeno-Kang model M3: Kosko's additive model (SAM) Which of the following option contains examples of additive rule model? M M

A fuzzy conjunction t(x, y) and disjunction s(x, y) form a pair if t(x, y) = 1 − s(1 − x, 1 − y). If t(x, y) = xy/(x + y − xy), then s(x, y) is

Let W_ij represent the weight between node i at layer k and node j at layer (k − 1) of a given multilayer perceptron. The weight updation using the gradient descent method is given by

The order of schema ?10?101? and ???0??1 are---- ----------- and --------------respectively.

Let the population of chromosomes in genetic algorithm is represented in terms of binary number. The strength of fitness of a chromosome x in decimal form, , is given by f(x) Sf(x) = where f(x) = x2 Σf(x) P The population is given by where: P = {(01101, (11000), (01000), (10011)} The strength of fitness of chromosome (11000) is -------------

Consider the following statements : S (G, *) a ∈ G

1 : If a group is of order n, and is am = e m ≤ n such that for some integer , then m must divide n. S (G, *)

2 : If a group is of even order, then there a ∈ G a ≠ e must be an element such that and a * a = e . Which of the statements is (are) correct? S

Consider the following statements with respect to duality in LPP :

(a) The final simplex table giving optimal solution of the primal also contains optimal solution of its dual in itself.

(b) If either the primal or the dual problem has a finite optimal solution, then the other problem also has a finite optimal solution.

(c) If either problem has an unbounded optimum solution, then the other problem has no feasible solution at all. Which of the statements is (are) correct?

The Reduced Instruction Set Computer (RISC) characteristics are :

(a) Single cycle instruction execution

(b) Variable length instruction formats

(c) Instructions that manipulates operands in memory

(d) Efficient instruction pipeline

Choose the correct characteristics from the options given below :

Which of the following binary codes for decimal digits are self complementing?

(a) 8421 code

(b) 2421 code

(c) excess-3 code

(d) excess-3 gray code

Choose the correct option :

Consider the following statements with respect to approaches to fill areas on raster systems : P: To determine the overlap intervals for scan lines that cross the area. Q： To start from a given interior position and paint outward from this point until we encounter the specified boundary conditions. Select the correct answer from the options given below :

Which of the following statements are true regarding C ++ ?

(a) Overloading gives the capability to an existing operator to operate on other data types.

(b) Inheritance in object oriented programming provides support to reusability.

(c) When object of a derived class is defined, first the constructor of derived class is executed then constructor of a base class is executed.

(d) Overloading is a type of polymorphism.

Which of the following are legal C statements? (a) int *P = &44; (b) int *P = &r; (c) int P = &a; (d) int P = a;

Two concurrent executing transactions 1 and T 2 are allowed to update same stock item say ' A ' in an uncontrolled manner. In such scenario, following problems may occur :

(a) Dirty read problem

(b) Lost update problem

(c) Transaction failure

(d) Inconsistent database state Which of the following option is correct if database system has no concurrency module and allows concurrent execution of above two transactions?

Identify the circumstances under which pre- emptive CPU scheduling is used :

(a) A process switches from Running state to Ready state

(b) A process switches from Waiting state to Ready state

(c) A process completes its execution

(d) A process switches from Ready to Waiting state

Choose the correct option :

The following multithreaded algorithm computes transpose of a matrix in parallel : p Trans (X, Y, N) if N = 1 ← then Y[1,1] X[1,1] else partition X into four (N/2) x (N/2) X X X X submatrices 11, 12, 21, 22 partition Y into four (N/2) x (N/2) submatrices Y Y Y Y 11, 12, 21, 22 X Y spawn p Trans ( 11. 11.N/2) X Y spawn p Trans ( 12. 12.N/2) X Y spawn p Trans ( 21. 21.N/2) X Y spawn p Trans ( 22. 22.N/2) What is the asymptotic parallelism of the algorithm?

Consider the following statements :

(a) The running time of dynamic programming θ(ρ) ρ algorithm is alway where is number of subproblems.

(b) When a recurrence relation has cyclic dependency, it is impossible to use that recurrence relation (unmodified) in a correct dynamic program.

(c) For a dynamic programming algorithm, computing all values in a bottom-up fashion is asymptotically faster than using recursion and memorization. X

(d) If a problem can be reduced to a known X NP-hard problem, then must be NP-hard. Which of the statement(s) is (are) true?

Consider the following statements :

(a) Fiber optic cable is much lighter than copper cable.

(b) Fiber optic cable is not affected by power surges or electromagnetic interference.

(c) Optical transmission is inherently bidirectional. Which of the statements is (are) correct?

Consider the following statements :

(a) Windows Azure is a cloud-based operating system.

(b) Google App Engine is an integrated set of online services for consumers to communicate and share with others.

(c) Amazon Cloud Front is a web service for content delivery. Which of the statements is (are) correct?

Consider the following statements with respect to network security :

(a) Message confidentiality means that the sender and the receiver expect privacy.

(b) Message integrity means that the data must arrive at the receiver exactly as they were sent.

(c) Message authentication means the receiver is ensured that the message is coming from the intended sender. Which of the statements is (are) correct?

Consider the following:

(a) Trapping at local maxima

(b) Reaching a plateau

(c) Traversal along the ridge. Which of the following option represents shortcomings of the hill climbing algorithm?

Consider the following learning algorithms :

(a) Logistic repression

(b) Back propogation

(c) Linear repression Which of the following option represents classification algorithms?

Match List I with List II. List I: (a) Physical layer, (b) Transport layer, (c) Session layer, (d) Presentation layer. List II: (i) Provides token management service, (ii) Concerned with transmitting raw bits over a communication channel, (iii) Concerned with the syntax and semantics of the information transmitted, (iv) True end-to-end layer from source to destination.

According to ISO 9126, match List I with List II. List I: (a) Functionality, (b) Reliability, (c) Efficiency, (d) Maintainability. List II: (i) Relationship between level of performance and amount of resources, (ii) Characteristics related to achievement of purpose, (iii) Effort needed to make improvements, (iv) Capability of software to maintain its performance.

Match the agile process models with their tasks. List I: (a) Scrum, (b) Adaptive software development, (c) Extreme programming, (d) Feature-driven development. List II: (i) CRC cards, (ii) Sprint backlog, (iii) the <action> the <result> <by/for/of/to> a(n) <object>, (iv) Time-box release plan.

Match List I with List II. List I: (a) Frame attribute, (b) <tr> tag, (c) Valign attribute, (d) <a> tag. List II: (i) To create a link in HTML, (ii) For vertical alignment of content in a cell, (iii) To enclose each row in a table, (iv) To specify the side of the table frame that displays a border.

An instruction at location 500 has its address field at 501, holding the value 400. Register R1 contains 200. Match each addressing mode with its effective address: (a) Direct, (b) Register indirect, (c) Indexed with R1 as index register, (d) Relative. Values: (i) 200, (ii) 902, (iii) 400, (iv) 600.

Match List I with List II. List I: (a) Isolated I/O, (b) Memory-mapped I/O, (c) I/O interface, (d) Asynchronous data transfer. List II: (i) Same set of control signals for I/O and memory communication, (ii) Separate instructions for I/O and memory communication, (iii) Requires control signals between the communicating units, (iv) Resolves the differences between the central computer and peripherals.

Match List I with List II. List I: (a) Micro-operation, (b) Microprogrammed control unit, (c) Interrupts, (d) Microinstruction. List II: (i) Specify micro-operations, (ii) Improve CPU utilization, (iii) Control memory, (iv) Elementary operation performed on data stored in registers.

The sequence diagram given in Figure 1 for the Weather Information System takes place when an external system requests the summarized data from the weather station. The increasing order of lifeline for the objects in the system are:

The Data Encryption Standard (DES) has a function consists of four steps. Which of the following is correct order of these four steps?

How many nodes are there in flowgraph F?

What is the cyclomatic complexity of flowgraph F?

How many regions are there in flowgraph F ?

How many nodes are there in the longest independent path?

How many predicate nodes are there and what are their names?

Minimal cover of functional F dependency set is

Identify primary key of table with F functional dependency set

Identify the normal form in which relation R belong to

Identify the redundant functional dependency in F

Assume that given table R is decomposed in two tables R (A, B, C) 1 with functional dependency set f = {A → B, A → C} 1 and R (A, D, E) FD 2 with set F = {A → D, D → E} 2 . Which of the following option is true w.r.t. given decomposition?