UGC NET CS Dec 2022

UGC NET JRF Computer Science · 2022 · with answers and explanations

questions
73
Total marks
146
Duration
180 minutes
Negative marking
No

Subjects: Computer Science

Question 1

Computer Science · 2 marks

The negation of "Some students like hockey" is

  1. A.Some students dislike hockey
  2. B.Every student dislike hockey
  3. C.Every student like hockey
  4. D.All students like hockey

Correct answer: B

Explanation: The negation of 'Some X have property P' is 'All X do not have property P', i.e., 'Every student dislikes hockey'.

Question 2

Computer Science · 2 marks

A relation 'R' is defined on ordered pairs of integers as: (x, y) R (u, v) if x < u and y > v. Then R is

  1. A.Neither a partial order nor an equivalence relation
  2. B.A partial order but not a total order
  3. C.A total order
  4. D.An equivalence relation

Correct answer: A

Explanation: R is not reflexive (x < x is false), so it is neither a partial order nor an equivalence relation.

Question 3

Computer Science · 2 marks

Suppose you are married and you and your partner attend a party with three other married couples. Several handshakes took place. No one shook hands with himself or herself or with their partner, and no one shook hands with the same person more than once. After all handshaking was completed, suppose you asked each person, including your partner, how many hands they had shaken. Each person gave a different answer. How many hands did your spouse shake?

  1. A.1
  2. B.2
  3. C.3
  4. D.4

Correct answer: C

Explanation: With 4 couples (8 people), the 7 others gave answers 0 through 6. By the handshake lemma and pairing logic, the spouse shook 3 hands.

Question 4

Computer Science · 2 marks

Consider the following conditional code, which returns a Boolean value: If((x>25) && (y>100)) return 'false'; else if((x <= 25) && (y<=100)) return 'true'; else if((x>25) && (y<=100)) return 'false'; else return 'true'; Simplify it by filling in the following blank with a single Boolean expression without changing the behavior: If (........) return 'true'; else return 'false';

  1. A.X > 25
  2. B.X <= 25
  3. C.Y > 100
  4. D.Y <= 100

Correct answer: B

Explanation: Analyzing all cases: returns true when x<=25 (regardless of y) and false when x>25. So the condition simplifies to x <= 25.

Question 5

Computer Science · 2 marks

Which one of the following type of memory is fastest?

  1. A.Cache memory
  2. B.Register memory
  3. C.Main memory
  4. D.Secondary memory

Correct answer: B

Explanation: In the memory hierarchy, registers are the fastest memory, followed by cache, main memory, and secondary memory.

Question 6

Computer Science · 2 marks

The memory size for n address lines and m data lines is given by

  1. A.2^m x n
  2. B.m x n^2
  3. C.2^n x m
  4. D.n x m^2

Correct answer: C

Explanation: With n address lines, there are 2^n addressable locations. Each location holds m bits (m data lines). Total memory = 2^n x m bits.

Question 7

Computer Science · 2 marks

Simplify the following using K-map: F(A, B, C, D) = Sum(0, 2, 5, 7, 8, 10, 13, 15)

  1. A.BD + B'D'
  2. B.AC + A'C'
  3. C.BC + B'C'
  4. D.AD + A'D'

Correct answer: A

Explanation: Grouping minterms in K-map yields BD + B'D' (XNOR of B and D).

Question 8

Computer Science · 2 marks

Consider an unpipelined machine with 10 nsec clock cycles which uses four cycles for ALU operations and branches whereas five cycles for memory operation. Assume that the relative frequencies of these operations are: 40%, 20% and 40%, respectively. Due to clock skew and setup pipeline let us consider that the machine adds one nsec overhead to the clock. How much speedup is observed in the instruction execution rate when a pipelined machine is considered?

  1. A.2 times
  2. B.4 times
  3. C.6 times
  4. D.8 times

Correct answer: B

Explanation: Average execution time unpipelined = 0.4*40 + 0.2*40 + 0.4*50 = 16+8+20 = 44 nsec. Pipelined = 10+1 = 11 nsec. Speedup = 44/11 = 4.

Question 9

Computer Science · 2 marks

Machine Level Language is a/an

  1. A.Assembly Language
  2. B.Low Level Language
  3. C.High Level Language
  4. D.Translating Language

Correct answer: B

Explanation: Machine level language (binary code directly executed by CPU) is classified as a low-level language.

Question 10

Computer Science · 2 marks

Which of the following is wrong about the data types?

  1. A.The number is always positive when qualifier 'unsigned' is used
  2. B.The number can be positive or negative when the qualifier 'signed' is used
  3. C.The range of value for signed data types is more than that of unsigned data types
  4. D.The left most bit in unsigned data type is used to represent the value

Correct answer: C

Explanation: Unsigned types have a larger positive range than signed types because all bits are used for the value. Statement C is incorrect.

Question 11

Computer Science · 2 marks

If a constructor 'Date' is declared explicitly and has to be defined outside the class. Which of the following is correct?

  1. A.Date :: Date (int dd) {/*...*/}
  2. B.Explicit Date :: Date (int dd) {/*...*/}
  3. C.Such a constructor cannot be defined
  4. D.Constructor always has to be defined inside the class

Correct answer: A

Explanation: In C++, a constructor declared explicit inside the class is defined outside using the scope resolution operator: ClassName::ClassName(params).

Question 12

Computer Science · 2 marks

Which one of the following allows the session to continue?

  1. A.When a user quits a browser
  2. B.When the user logs out and is invalidated by the servlet
  3. C.When the session is timed out due to inactivity
  4. D.When the user refreshes the browser and there is a persistent cookie

Correct answer: D

Explanation: A persistent cookie survives browser restarts and page refreshes, allowing the session to continue.

Question 13

Computer Science · 2 marks

Overfitting is expected when we observe that

  1. A.With training iterations error on training set as well as test set decreases
  2. B.With training iterations error on training set decreases but test set increases
  3. C.With training iterations error on training set as well as test set increases
  4. D.With training iterations training set as well as test error remains constant

Correct answer: B

Explanation: Overfitting occurs when the model memorizes training data (training error decreases) but fails to generalize (test error increases).

Question 14

Computer Science · 2 marks

Identify the incorrect statement: A candidate key is minimal set of one or more attributes that, taken collectively, allow us to uniquely identify any entity in the entity set.

  1. A.A candidate key is minimal set of one or more attributes that, taken collectively, allow us to uniquely identify any entity in the entity set.
  2. B.A candidate key for which no proper subset is also a candidate key is called a super key.
  3. C.A super key is a set of one or more attributes that, taken collectively, allows us to uniquely identify any entity in the entity set.
  4. D.A super key for which no proper subset is also a super key is called a candidate key.

Correct answer: B

Explanation: Statement B is incorrect. It reverses the definition: a super key for which no proper subset is also a super key is called a candidate key (not the other way around).

Question 15

Computer Science · 2 marks

Consider the two relations below. The primary keys are underlined. Identify all possible foreign key(s). EMP (eid, ename, did) and DEPT (did, dname)

  1. A.eid
  2. B.did
  3. C.eid, did
  4. D.eid, did, ename

Correct answer: B

Explanation: The 'did' in EMP references the primary key 'did' in DEPT, making it the only foreign key.

Question 16

Computer Science · 2 marks

In Linux Operating system, when ______ is invoked, it is passed a set of flags that determine how much sharing is to take place between the parent and child tasks.

  1. A.Fork()
  2. B.Clone()
  3. C.Pthread()
  4. D.Thread()

Correct answer: B

Explanation: In Linux, clone() system call accepts flags determining how much of the parent's context is shared with the child (address space, file descriptors, etc.).

Question 17

Computer Science · 2 marks

The main function of the microkernel is to provide a communication facility between the _______ program and the various _______ that are also running in user space.

  1. A.Virtual, processes
  2. B.System, processes
  3. C.Client, services
  4. D.Virtual, services

Correct answer: C

Explanation: A microkernel provides IPC (inter-process communication) between client programs and various services running in user space.

Question 18

Computer Science · 2 marks

Consider an operating system capable of loading and executing a single sequential user process at a time. The disk head scheduling algorithm used is first come first served (FCFS). If FCFS is replaced by shortest seek time first (SSTF) and the vendor claims 50% better benchmark results. What is the expected improvement in the I/O performance of user programs?

  1. A.50%
  2. B.100%
  3. C.25%
  4. D.0%

Correct answer: D

Explanation: With a single sequential process, requests come one at a time. SSTF and FCFS behave identically since there's only one pending request at any time.

Question 19

Computer Science · 2 marks

Which of the following is not a Non-functional requirement?

  1. A.Portability
  2. B.Security
  3. C.Scalability
  4. D.User interaction

Correct answer: D

Explanation: User interaction describes functional behavior (what the system does), not a quality attribute. Portability, security, and scalability are non-functional requirements.

Question 20

Computer Science · 2 marks

COCOMO stands for

  1. A.Consumed cost model
  2. B.Constructive cost model
  3. C.Common control model
  4. D.Composition cost model

Correct answer: B

Explanation: COCOMO stands for Constructive Cost Model, developed by Barry Boehm for software cost estimation.

Question 21

Computer Science · 2 marks

Modifying the software to match change in the ever changing environment is called as

  1. A.Adaptive maintenance
  2. B.Corrective maintenance
  3. C.Perfective maintenance
  4. D.Preventive maintenance

Correct answer: A

Explanation: Adaptive maintenance involves modifying software to keep it usable in a changed or changing environment (OS upgrades, hardware changes, etc.).

Question 22

Computer Science · 2 marks

For a function of two variables, boundary value analysis yields

  1. A.4n+3 test cases
  2. B.4n+1 test cases
  3. C.n+4 test cases
  4. D.2n+4 test cases

Correct answer: B

Explanation: Boundary value analysis for n variables yields 4n+1 test cases (min, min+, nominal, max-, max for each variable plus one nominal).

Question 23

Computer Science · 2 marks

Given the FFT we can have a ______ time procedure for multiplying two polynomials A(X) and B(X) of degree bound n where input and output representations are in coefficient form, assuming n is a power of 2.

  1. A.O(n^2)
  2. B.O(n log n)
  3. C.O(2^n)
  4. D.O(log n)

Correct answer: B

Explanation: Using FFT, polynomial multiplication can be done in O(n log n) time: FFT to point-value form, pointwise multiply, inverse FFT back.

Question 24

Computer Science · 2 marks

The Transition function delta in a multi-tape Turing machine is defined as:

  1. A.delta: 2^Q x Gamma^k -> 2^Q x Gamma^k x {L, R, S}^k
  2. B.delta: Q x Q x Gamma^k -> Q x Q x Gamma^k x {L, R, S}^k
  3. C.delta: Q x Gamma^k -> Q x Gamma^k x {L, R, S}^k
  4. D.delta: Q x Gamma^k x 2^Q -> Q x Gamma^k x 2^Q x {L, R, S}^k

Correct answer: C

Explanation: A multi-tape TM with k tapes: delta maps (state, k tape symbols) to (new state, k write symbols, k head movements {L,R,S}).

Question 25

Computer Science · 2 marks

In pumping lemma for regular languages, to say a language is satisfying pumping lemma, what is the minimum length of 'y' if you consider the string as 'xyz'?

  1. A.n
  2. B.2
  3. C.1
  4. D.0

Correct answer: C

Explanation: In the pumping lemma, y must be non-empty (|y| >= 1). If y were empty, pumping would not change the string.

Question 26

Computer Science · 2 marks

The item generated by the production A -> epsilon is:

  1. A.A -> .
  2. B.A -> epsilon.
  3. C.A -> .epsilon
  4. D.A -> epsilon

Correct answer: A

Explanation: For an epsilon production A -> epsilon, the only LR item is A -> . (the dot with nothing after it), since epsilon produces no symbols.

Question 27

Computer Science · 2 marks

Given Ethernet address 01011010 00010001 01010101 00011000 10101010 00001111 in binary, what is the address in hexadecimal notation?

  1. A.5A:88:AA:18:55:F0
  2. B.5A:81:BA:81:AA:08
  3. C.5A:18:5A:18:55:0F
  4. D.5A:11:55:18:AA:0F

Correct answer: D

Explanation: Converting each byte: 01011010=5A, 00010001=11, 01010101=55, 00011000=18, 10101010=AA, 00001111=0F.

Question 28

Computer Science · 2 marks

A computer on a 10 Mbps network is regulated by a token bucket. The token bucket is filled at a rate of 2 Mbps. It is initially filled to capacity with 16 megabits. What is the maximum duration for which the computer can transmit at the full 10 Mbps?

  1. A.1.6 seconds
  2. B.2 seconds
  3. C.5 seconds
  4. D.8 seconds

Correct answer: B

Explanation: Tokens depleted at rate (10-2) = 8 Mbps net. With 16 Mb initial capacity: 16/8 = 2 seconds at full 10 Mbps.

Question 29

Computer Science · 2 marks

In the standard Ethernet with transmission rate of 10 Mbps, assume that the length of the medium is 2500 m and size of a frame is 512 bytes. The propagation speed of a signal in a cable is normally 2 x 10^8 m/s. Calculate transmission delay and propagation delay.

  1. A.25.25 microseconds and 51.2 microseconds
  2. B.51.2 microseconds and 12.5 microseconds
  3. C.10.2 microseconds and 50.12 microseconds
  4. D.12.5 microseconds and 51.2 microseconds

Correct answer: B

Explanation: Propagation delay = 2500/(2x10^8) = 12.5 microsec. Transmission delay for minimum frame (64 bytes = 512 bits at 10 Mbps) = 51.2 microsec.

Question 30

Computer Science · 2 marks

In CRC coding if the data word is 111111, divisor is 1010 and the remainder is 110. Which of the following code is true?

  1. A.011111101
  2. B.001010110
  3. C.111111110
  4. D.110111111

Correct answer: C

Explanation: In CRC, the transmitted code = data word + remainder. Data 111111 + remainder 110 = 111111110.

Question 31

Computer Science · 2 marks

The A* algorithm is optimal when

  1. A.It always finds the solution with the lowest total cost if the heuristic h is admissible
  2. B.It always finds the solution with the highest total cost if the heuristic h is admissible
  3. C.It finds the solution with the lowest total cost if the heuristic h is not admissible
  4. D.It always finds the solution with the highest total cost if the heuristic h is not admissible

Correct answer: A

Explanation: A* is guaranteed to find the optimal (lowest cost) solution when the heuristic function h is admissible (never overestimates).

Question 32

Computer Science · 2 marks

Which Artificial Intelligence technique enables the computers to understand the associations and relationships between objects and events?

  1. A.Heuristic processing
  2. B.Cognitive science
  3. C.Relative symbolism
  4. D.Pattern matching

Correct answer: D

Explanation: Pattern matching is the AI technique that enables computers to recognize associations and relationships between objects and events.

Question 33

Computer Science · 2 marks

Where does the value of alpha-beta search get updated?

  1. A.Along the path of search
  2. B.Initial state itself
  3. C.At the end
  4. D.None of these

Correct answer: A

Explanation: In alpha-beta pruning, alpha and beta values are updated along the path of search as nodes are expanded.

Question 34

Computer Science · 2 marks

A 4-input neuron has weights 1, 2, 3, 4. The transfer function is linear with the constant of proportionality being equal to 3. The inputs are 5, 7, 10, and 30 respectively. The output will be:

  1. A.120
  2. B.213
  3. C.410
  4. D.507

Correct answer: D

Explanation: Net input = 1*5 + 2*7 + 3*10 + 4*30 = 5+14+30+120 = 169. Output = 3 * 169 = 507.

Question 35

Computer Science · 2 marks

Consider the following statements: P: There exists no simple, undirected and connected graph with 80 vertices and 77 edges. Q: All vertices of Euler graph are of even degree. R: Every simple, undirected, connected and acyclic graph with 50 vertices has at least two vertices of degree one. S: There exists a bipartite graph with more than ten vertices which is 2-colorable. What is the number of correct statements among the above?

  1. A.1
  2. B.2
  3. C.3
  4. D.4

Correct answer: D

Explanation: P: False claim (a tree with 80 vertices has 79 edges, and 77 < 79 is possible for connected). Q: True (Euler circuit requires all even degrees). R: True (a tree has at least 2 leaves). S: True (all bipartite graphs are 2-colorable). All four statements are correct.

Question 36

Computer Science · 2 marks

Consider the following statements. A: There exists a Boolean algebra with 5 elements. B: Every element of Boolean algebra has unique complement. C: If a Lattice L is a Boolean algebra then L is not relatively complemented. D: The direct product of two Boolean algebra is also a Boolean algebra. Choose the correct answer.

  1. A.Only A and D are correct
  2. B.Only B and D are correct
  3. C.All statements are NOT correct
  4. D.All statements are correct

Correct answer: B

Explanation: A is false (Boolean algebra must have 2^n elements). B is true. C is false (Boolean algebra is relatively complemented). D is true.

Question 37

Computer Science · 2 marks

Which of the following statement is not true in regards to virtual memory?

  1. A.The main objective for using virtual memory is to increase the effective capacity of the memory system
  2. B.Size of the program can be as large as the size of the secondary memory
  3. C.Program and data are stored in the secondary memory
  4. D.None of these

Correct answer: D

Explanation: All three statements A, B, and C are true regarding virtual memory. Hence 'None of these' (meaning none is false) is the answer.

Question 38

Computer Science · 2 marks

Which of the following is/are true for Dynamic RAM (DRAM)? (A) It is slower than Static RAM (SRAM) (B) Packing Density is Higher than Static RAM (SRAM) (C) It is faster than Static RAM (SRAM) (D) It requires data refreshing.

  1. A.A, B and D only
  2. B.A, B and C only
  3. C.C and D only
  4. D.B and D only

Correct answer: A

Explanation: DRAM is slower than SRAM, has higher packing density, and requires periodic refreshing. Statement C (faster) is false.

Question 39

Computer Science · 2 marks

Which of the following statements is/are false? A: The processor has direct access to both primary and secondary memory. B: Primary memory stores the active instructions and data for the program being executed on the processor. C: Secondary memory is used as a backup memory. D: Memory system is implemented on a single level memory.

  1. A.A and B only
  2. B.B and C only
  3. C.A, B and C only
  4. D.A and D only

Correct answer: D

Explanation: A is false (processor cannot directly access secondary memory). D is false (memory is implemented as a hierarchy, not single level). B and C are true.

Question 40

Computer Science · 2 marks

What are the drawbacks of using file system to store data? (A) Data inconsistency (B) Difficulty in accessing data (C) Data isolation (D) Atomicity of updates.

  1. A.A, B only
  2. B.B, C, D only
  3. C.A, B, C only
  4. D.A, B, C, D

Correct answer: D

Explanation: All four are drawbacks of file-based systems: data inconsistency, difficulty in accessing data, data isolation, and problems with atomicity of updates.

Question 41

Computer Science · 2 marks

In which of the following database models do we have a parent-child relationship? (A) Hierarchical database (B) Network database (C) Relational database.

  1. A.A, B
  2. B.A, C
  3. C.B, C
  4. D.A, B, C

Correct answer: A

Explanation: Hierarchical and Network database models use parent-child relationships. Relational databases use tables with rows and columns, not explicit parent-child links.

Question 42

Computer Science · 2 marks

Which of the following statements are true? (A) Shortest remaining time first scheduling may cause starvation (B) Preemptive scheduling may cause starvation (C) Round robin is better than FCFS in terms of response time.

  1. A.A only
  2. B.B, C only
  3. C.A, B only
  4. D.A, B, C

Correct answer: D

Explanation: All three are true: SRTF can starve long processes, preemptive scheduling in general can cause starvation, and RR gives better response time than FCFS.

Question 43

Computer Science · 2 marks

In the design protocol of critical section problem, each process must ask permission to enter critical section in _______ code, it then executes in the critical section; once it finishes it enters the _______ code. The process then enters the _______ code.

  1. A.entry section, remainder section, exit section
  2. B.entry section, exit section, remainder section
  3. C.remainder section, entry section, exit section
  4. D.remainder section, exit section, entry section

Correct answer: B

Explanation: The sequence is: entry section (request), critical section, exit section (release), then remainder section.

Question 44

Computer Science · 2 marks

How do you create agile processes to manage unpredictability? (A) Requirements gathering must be conducted very carefully (B) Risk analysis must be conducted before planning takes place (C) Software increments must be delivered in short time periods (D) Software processes must not adapt to changes incrementally.

  1. A.A only
  2. B.B only
  3. C.C only
  4. D.D only

Correct answer: C

Explanation: Agile manages unpredictability through short iterations delivering working software increments.

Question 45

Computer Science · 2 marks

Software project manager is responsible for: (A) Project planning (B) Project status tracking (C) Resources management (D) Risk management (E) Project delivery within time and budget.

  1. A.All the statements are correct
  2. B.Only B and C are correct
  3. C.Only A and D are correct
  4. D.All the statements are not correct

Correct answer: A

Explanation: A software project manager is responsible for all listed tasks: planning, tracking, resource management, risk management, and timely delivery.

Question 46

Computer Science · 2 marks

Circuit satisfiability problem: Given a Boolean combinatorial circuit composed of AND, OR and NOT gates, is it satisfiable? (A) The circuit satisfiability problem belongs to class NP (B) The circuit satisfiability problem is at least as hard as any language in NP (C) The circuit satisfiability is NP-Complete.

  1. A.A, C, D only
  2. B.B, D, E only
  3. C.A, B, C only
  4. D.B, C, D only

Correct answer: C

Explanation: Circuit-SAT is in NP (can verify a solution in polynomial time), is NP-hard (at least as hard as any NP problem), and is therefore NP-Complete.

Question 47

Computer Science · 2 marks

Which of the following are correct about regular expressions? (A) phi + L = L + phi = L (B) epsilon * L = L * epsilon = L (C) phi * L = L * phi = phi (D) phi * L = L * phi = L.

  1. A.A, B and D only
  2. B.A, B and C only
  3. C.B and D only
  4. D.A and D only

Correct answer: B

Explanation: A is true (empty set is identity for union). B is true (epsilon is identity for concatenation). C is true (empty set annihilates concatenation). D is false.

Question 48

Computer Science · 2 marks

The solution of silly window syndrome problem is/are: (A) Nagle's algorithm (B) Clark's algorithm (C) Jacobson's algorithm (D) Piggy backing algorithm.

  1. A.A and B only
  2. B.A and C only
  3. C.C and D only
  4. D.B and D only

Correct answer: A

Explanation: Silly window syndrome is solved by Nagle's algorithm (sender side) and Clark's solution (receiver side).

Question 49

Computer Science · 2 marks

Which AI system mimics the evolutionary process to generate increasingly better solutions to a problem? (A) Self-organizing neural network (B) Back propagation neural network (C) Genetic algorithm (D) Forward propagation neural network.

  1. A.A only
  2. B.B only
  3. C.C only
  4. D.D only

Correct answer: C

Explanation: Genetic algorithms mimic biological evolution (selection, crossover, mutation) to find optimal solutions.

Question 50

Computer Science · 2 marks

Consider the following learning algorithms: (A) Logistic regression (B) Back propagation (C) Linear regression (D) Forward propagation. Which represents classification algorithms?

  1. A.A and C only
  2. B.B and D only
  3. C.A and B only
  4. D.C and D only

Correct answer: C

Explanation: Logistic regression is a classification algorithm. Back propagation is a training algorithm used for classification neural networks. Linear regression is for regression. Forward propagation is computation, not a learning algorithm.

Question 51

Computer Science · 2 marks

Which Boolean operation on two variables can be represented by a single perceptron layer? (A) X1 AND X2 (B) X1 OR X2 (C) X1 NOR X2 (D) X1 XOR X2.

  1. A.A and B only
  2. B.B and C only
  3. C.A, B and C only
  4. D.A, B, C and D

Correct answer: C

Explanation: AND, OR, and NOR are linearly separable and can be computed by a single perceptron. XOR is not linearly separable and requires multiple layers.

Question 52

Computer Science · 2 marks

Match List I with List II: A. Planar graph - I. Probabilistic Model; B. Bipartite graph - II. Deterministic Model; C. PERT - III. 4-Colorable; D. CPM - IV. 2-colorable.

  1. A.A-IV, B-III, C-I, D-II
  2. B.A-III, B-IV, C-II, D-I
  3. C.A-II, B-IV, C-I, D-III
  4. D.A-III, B-IV, C-I, D-II

Correct answer: D

Explanation: Planar graphs are 4-colorable (Four Color Theorem). Bipartite graphs are 2-colorable. PERT uses probabilistic time estimates. CPM is deterministic.

Question 53

Computer Science · 2 marks

Match List I with List II: A. IPC - I. Resource Allocation; B. Demand Paging - II. Computational speedup; C. Banker's Algorithm - III. Task Control Block; D. PCB - IV. Virtual Memory.

  1. A.A-II, B-I, C-IV, D-III
  2. B.A-II, B-IV, C-I, D-III
  3. C.A-I, B-II, C-III, D-IV
  4. D.A-II, B-III, C-I, D-IV

Correct answer: B

Explanation: IPC relates to computational speedup (parallel processes). Demand Paging is a virtual memory technique. Banker's Algorithm handles resource allocation. PCB is the Task Control Block.

Question 54

Computer Science · 2 marks

Match List I with List II: A. Product Complexity - I. System Requirements Design; B. Structured System Analysis - II. Software design; C. Coupling and cohesion - III. Validation techniques; D. Symbolic Execution - IV. Software cost estimation.

  1. A.A-II, B-III, C-IV, D-I
  2. B.A-III, B-I, C-IV, D-II
  3. C.A-IV, B-I, C-II, D-III
  4. D.A-III, B-IV, C-I, D-II

Correct answer: C

Explanation: Product complexity is a factor in COCOMO (cost estimation). Structured analysis relates to requirements. Coupling/cohesion are software design concepts. Symbolic execution is a validation technique.

Question 55

Computer Science · 2 marks

Match List I with List II: A. Dijkstra's Algorithm - I. Calculates path matrix; B. Prim's Algorithm - II. Stores minimum cost edge; C. Warshall's Algorithm - III. Stores total cost from source to current node; D. Kruskal's Algorithm - IV. Finds Minimum Spanning Tree.

  1. A.A-I, B-II, C-III, D-IV
  2. B.A-III, B-II, C-I, D-IV
  3. C.A-II, B-I, C-IV, D-III
  4. D.A-III, B-IV, C-II, D-I

Correct answer: B

Explanation: Dijkstra stores total cost from source to current node (III). Prim selects minimum cost edges (II). Warshall calculates path matrix (I). Kruskal finds MST (IV).

Question 56

Computer Science · 2 marks

Match List I with List II: A. CDMA - I. Provides mobile internet connection with faster data transfer rate; B. GSM - II. Allows users to connect to a network over wireless channel; C. UMTS - III. Accessing mechanism for multiple transmitters over a single channel; D. Wi-Fi - IV. Cellular technology employing hybrid of FDMA and TDMA.

  1. A.A-III, B-IV, C-II, D-I
  2. B.A-III, B-IV, C-I, D-II
  3. C.A-II, B-III, C-IV, D-I
  4. D.A-II, B-I, C-IV, D-III

Correct answer: B

Explanation: CDMA is a multiple access mechanism (III). GSM uses FDMA+TDMA hybrid (IV). UMTS provides fast mobile internet (I). Wi-Fi is wireless network connection (II).

Question 57

Computer Science · 2 marks

The correct sequence in fetch-execute cycle is: (A) Decode (B) Fetch (C) Execute.

  1. A.A-B-C
  2. B.B-C-A
  3. C.C-B-A
  4. D.B-A-C

Correct answer: D

Explanation: The fetch-execute cycle order is: Fetch instruction (B), Decode instruction (A), Execute instruction (C).

Question 58

Computer Science · 2 marks

In what sequence is the initialization, testing and execution of body done while using do-while loop? (A) Commenting (B) Execution of the body (C) Initialization (D) Testing the condition.

  1. A.D, B, C
  2. B.D, C, B
  3. C.C, A, B
  4. D.C, B, D

Correct answer: D

Explanation: In a do-while loop: first Initialization (C), then Execution of body (B), then Testing condition (D). Body executes at least once before the condition is checked.

Question 59

Computer Science · 2 marks

Select the correct order of events after power is initialized on a system: (A) Bootstrap loader is loaded from the disk (B) Kernel is loaded onto the memory (C) Firmware ROM loads boot block.

  1. A.B, C, A
  2. B.C, A, B
  3. C.A, B, C
  4. D.A, C, B

Correct answer: B

Explanation: Boot sequence: Firmware/ROM loads the boot block (C), bootstrap loader is loaded from disk (A), then the kernel is loaded into memory (B).

Question 60

Computer Science · 2 marks

Given below are two statements. Assertion A: Cohesion is a qualitative indication of the degree to which a module can be written more compactly and is able to complete its function in a timely manner. Reason R: Cohesion is a qualitative indication of the degree to which a module is connected to other modules and the outside world.

  1. A.Both A and R are correct and R is the correct explanation of A
  2. B.Both A and R are correct but R is NOT the correct explanation of A
  3. C.A is correct but R is not correct
  4. D.A is not correct but R is correct

Correct answer: C

Explanation: Cohesion measures how strongly related the elements within a module are (A is approximately correct). R describes coupling (connection to other modules), not cohesion.

Question 61

Computer Science · 2 marks

What is the safest order while simplifying Context Free Grammar?

  1. A.Elimination of epsilon-productions, Unit productions and then useless symbols and productions
  2. B.Elimination of useless symbols and productions, epsilon-productions and then Unit productions
  3. C.Elimination of Unit productions, epsilon-productions and then useless symbols and productions
  4. D.Elimination of epsilon-productions, useless symbols and productions and then Unit productions

Correct answer: A

Explanation: The safest order for CFG simplification: first remove epsilon productions, then unit productions, then useless symbols.

Question 62

Computer Science · 2 marks

Choose the correct option describing the features of artificial neural network: (A) It is essentially a machine learning algorithm. (B) It is useful when solving problems for which the data set is very large. (C) They are able to extract features without input from the programmer. (D) These are systems modeled on the human brain and nervous system.

  1. A.All the statements are correct
  2. B.Only B and C are correct
  3. C.Only A and D are correct
  4. D.All the statements are not correct

Correct answer: A

Explanation: All four statements correctly describe properties of artificial neural networks.

Question 63

Computer Science · 2 marks

Four persons P, Q, R and S are in police custody and one of them has committed a crime. They confess as follows: Person P says Q did it. Person Q says S did it. Person R says I did not do it. Person S says Q lied. If exactly one of the statements is false, which is the guilty person?

  1. A.P
  2. B.Q
  3. C.R
  4. D.S

Correct answer: B

Explanation: If Q is guilty: P's statement (Q did it) is true, Q's statement (S did it) is false, R's statement (I didn't do it) is true, S's statement (Q lied) is true. Exactly one false statement, so Q is guilty.

Question 64

Computer Science · 2 marks

Assertion A: A Raster scan device is a CRT graphic device and can use a television monitor for display. Reason R: In Raster scan display the picture is composed of a series of dots. These dots are traced out as a series of horizontal lines. Television works in a similar fashion.

  1. A.Both A and R are true and R is the correct explanation of A
  2. B.Both A and R are true but R is not the correct explanation of A
  3. C.A is true but R is false
  4. D.A is false but R is true

Correct answer: A

Explanation: Both statements are true. Raster scan works by tracing horizontal lines of dots, the same principle as television, which is why a TV monitor can be used for display.

Question 65

Computer Science · 2 marks

An OS follows round robin scheduling with time quantum of 4 ms. Assuming that the CPU is free now and there are 20 processes waiting in the ready queue, the maximum amount of time that a process waits before getting into the CPU is

  1. A.80 ms
  2. B.76 ms
  3. C.84 ms
  4. D.None of the above

Correct answer: B

Explanation: The last process in the queue waits for 19 other processes to complete their time quantum: 19 x 4 = 76 ms.

Question 66

Computer Science · 2 marks

An organization is granted the block 130.56.0.0/16. The administration wants to create 1024 subnets. Find the number of addresses in each subnet.

  1. A.32
  2. B.64
  3. C.128
  4. D.16

Correct answer: B

Explanation: /16 block has 2^16 = 65536 addresses. 1024 subnets = 65536/1024 = 64 addresses per subnet.

Question 67

Computer Science · 2 marks

An organization is granted the block 130.56.0.0/16. The administration wants to create 1024 subnets. Find the first and last addresses of the first subnet.

  1. A.130.56.0.0 - 130.56.254.254
  2. B.130.56.0.0 - 130.56.0.63
  3. C.130.0.0.0 - 130.255.255.255
  4. D.130.56.0.0 - 130.56.255.63

Correct answer: B

Explanation: Each subnet has 64 addresses. First subnet: 130.56.0.0 to 130.56.0.63.

Question 68

Computer Science · 2 marks

An organization is granted the block 130.56.0.0/16. The administration wants to create 1024 subnets. Find the first and last addresses of the last subnet.

  1. A.130.56.0.0 - 130.56.254.255
  2. B.130.56.255.0 - 130.56.255.255
  3. C.130.56.0.192 - 130.255.255.255
  4. D.130.56.255.192 - 130.56.255.255

Correct answer: D

Explanation: Last subnet starts at 130.56.255.192 (1024th subnet of 64 addresses) and ends at 130.56.255.255.

Question 69

Computer Science · 2 marks

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. While the TCP Connection is active, the server crashes and reboots. Assume the client does not use TCP keep alive timer. Statement I: If client is waiting to receive a packet, it may wait indefinitely. Statement II: If the client sends a packet after the server reboot, it will receive the FIN segment.

  1. A.Both Statement I and Statement II are true
  2. B.Both Statement I and Statement II are false
  3. C.Statement I is true but Statement II is false
  4. D.Statement I is false but Statement II is true

Correct answer: C

Explanation: Without keepalive, a waiting client will block indefinitely (I true). After reboot, the server sends RST (not FIN) in response to an unexpected packet (II false).

Question 70

Computer Science · 2 marks

Consider two hosts P and Q connected through a router R. The MTU 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 0x1234. Assume IP header is 20 bytes and the packet is allowed to be fragmented. (A) Two fragments are created at R and IP datagram carrying the second fragment is 620 bytes (B) If the second fragment is lost then R resends the fragment (C) If the second fragment is lost then P is required to resend the entire TCP segment (D) TCP destination port can be determined by analyzing the second fragment only.

  1. A.A, B and C only
  2. B.A and C only
  3. C.C and D only
  4. D.B and D only

Correct answer: B

Explanation: A is true (second fragment = 1420-800+20 = 620 bytes). B is false (routers don't retransmit). C is true (TCP retransmits end-to-end). D is false (port info only in first fragment).

Question 71

Computer Science · 2 marks

Rearrange the following sequence in the context of OSI layers: (A) Transforming the raw bits in the form of frame for transmission (B) Transmission of raw bits over communication channel (C) Handling user interfaces (D) Control and monitoring of subnet (E) Transmission data through connection oriented or connectionless using datagram.

  1. A.A-B-C-D-E
  2. B.B-C-D-E-A
  3. C.B-A-D-E-C
  4. D.A-B-D-E-C

Correct answer: C

Explanation: Bottom to top: B=Physical layer, A=Data Link layer, D=Network layer, E=Transport layer, C=Application layer (representing upper layers).

Question 72

Computer Science · 2 marks

Statements about linear programming: A: There does not exist a polynomial time algorithm to solve integer Linear programming problem. B: Main focus of PERT is 'minimizing time'.

  1. A.A is True; B is True
  2. B.A is True; B is False
  3. C.A is False; B is True
  4. D.A is False; B is False

Correct answer: A

Explanation: Integer LP is NP-hard (no known polynomial algorithm). PERT focuses on minimizing project completion time. Both are true.

Question 73

Computer Science · 2 marks

Select the correct order of DBSCAN Algorithm: (A) Find recursively all density-connected points and assign them to the same cluster as the core point. (B) Find all neighbor points within eps and identify core points with more than MinPts neighbors. (C) Iterate through the remaining unvisited points in the dataset. (D) For each core point, if it is not already assigned to a cluster, create a new cluster.

  1. A.B, D, C, A
  2. B.D, B, C, A
  3. C.B, D, A, C
  4. D.D, B, A, C

Correct answer: C

Explanation: DBSCAN order: Find neighbors/cores (B), create new cluster for unassigned core (D), expand cluster with density-connected points (A), iterate remaining points (C).

View all papers — UGC NET JRF Computer Science

Practice this paper with a timer

Attempt it online, get scored instantly, and see which subjects are costing you marks.

Start practising free