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 marksLoop unrolling is a code optimization technique that
- A.Avoids tests at every iteration of the loop
- D.Reorders operations to allow multiple computations in parallel
- C.Exchanges inner loops with outer loops
- 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 marksWhich system-provided function is called when no handler deals with a C++ exception?
- D.kill()
- C.abort()
- B.unexpected()
- 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 marksSystem calls are usually invoked by using:
- D.Polling
- C.A software interrupt
- B.An indirect jump
- 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 marksWhich service is NOT provided by a wireless access point in 802.11 WLAN?
- C.Error correction
- D.Integration
- B.Disassociation
- 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 marksComparing recursive and non-recursive implementations of algorithms:
- D.Space complexity is better in recursive but time is better in non-recursive
- C.Time complexity is better in recursive but space is better in non-recursive
- B.Both time and space complexities are better in non-recursive implementation
- 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 marksThe best description of an entity type is:
- D.A template for a group with the same characteristics
- C.A thing we wish to collect data about with zero or more real-world instances
- B.Value assigned to particular attribute
- 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 marksData that improves database performance and accessibility is called:
- D.Data Dictionary
- C.Application Metadata
- B.User Data
- A.Indexes
Correct answer: A
Explanation: Indexes are data structures that improve the speed of data retrieval operations on a database table.