UGC NET CS Dec 2015

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

questions
7
Total marks
14
Duration
180 minutes
Negative marking
No

Subjects: Computer Science

Question 1

Computer Science · 2 marks

Loop unrolling is a code optimization technique that

  1. A.Avoids tests at every iteration of the loop
  2. D.Reorders operations to allow multiple computations in parallel
  3. C.Exchanges inner loops with outer loops
  4. B.Improves performance by decreasing instructions in a basic block

Correct answer: A

Explanation: Loop unrolling reduces loop overhead by replicating the loop body multiple times, thereby avoiding the test/branch at every iteration.

Question 2

Computer Science · 2 marks

Which system-provided function is called when no handler deals with a C++ exception?

  1. D.kill()
  2. C.abort()
  3. B.unexpected()
  4. A.terminate()

Correct answer: A

Explanation: In C++, if an exception is thrown and no matching catch handler is found, std::terminate() is called.

Question 3

Computer Science · 2 marks

System calls are usually invoked by using:

  1. D.Polling
  2. C.A software interrupt
  3. B.An indirect jump
  4. A.A privileged instruction

Correct answer: C

Explanation: System calls are invoked using a software interrupt (trap) that transfers control from user mode to kernel mode.

Question 4

Computer Science · 2 marks

Which service is NOT provided by a wireless access point in 802.11 WLAN?

  1. C.Error correction
  2. D.Integration
  3. B.Disassociation
  4. A.Association

Correct answer: C

Explanation: 802.11 access points provide association, disassociation, reassociation, authentication, and integration services. Error correction is not an AP service.

Question 5

Computer Science · 2 marks

Comparing recursive and non-recursive implementations of algorithms:

  1. D.Space complexity is better in recursive but time is better in non-recursive
  2. C.Time complexity is better in recursive but space is better in non-recursive
  3. B.Both time and space complexities are better in non-recursive implementation
  4. A.Both time and space complexities are better in recursive implementation

Correct answer: B

Explanation: Non-recursive (iterative) implementations generally have better time complexity (no function call overhead) and better space complexity (no call stack overhead).

Question 6

Computer Science · 2 marks

The best description of an entity type is:

  1. D.A template for a group with the same characteristics
  2. C.A thing we wish to collect data about with zero or more real-world instances
  3. B.Value assigned to particular attribute
  4. A.Specific concrete object with processes

Correct answer: D

Explanation: An entity type is a template or blueprint that defines a group of entities sharing the same attributes (characteristics).

Question 7

Computer Science · 2 marks

Data that improves database performance and accessibility is called:

  1. D.Data Dictionary
  2. C.Application Metadata
  3. B.User Data
  4. A.Indexes

Correct answer: A

Explanation: Indexes are data structures that improve the speed of data retrieval operations on a database table.

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