Most Expected UGC Net Paper 1 Questions & Answer

Most Expected UGC Net Paper 1 Questions & Answer

image
JRFAdda
image

1. Given below are two statements: one is labelled as Assertion A and the other is labelled as Reason R.

A virtual memory system uses first-in first-out page replacement policy and allocates a fixed number of frames to a process

Assertion A: Increasing number of page frames allocated to a process sometimes increases the page fault rate.

Reason R: Some programs do not exhibit locality of reference.

In the light of the above statements, choose the correct answer from the options given below.

1. Both A and R are true and R is the correct explanation of A

2. Both A and R are true but R is NOT the correct explanation of A

3. A is true but R is false

4. A is false but R is true

Solution : (2) Both A and R are true but R is NOT the correct explanation of A

2. Match List I with List II

Choose the correct answer from the options given below:
1. A-IV B-I C-III D-II
2. A-II B-IIII C-IV D-I 
3. A-IV B-Ill C-I D-II 
4. A-II B-IV C-I D-III

Solution : (3) A-IV B-Ill C-I D-II 

3. In a multi-user operating system. 20 requests are made to use a particular resource per hour, on an average. The probability that no request is made in 45 minutes is

1. e-15
2. e-5
3. 1-e-5
4. 1-e-10

Solution : (1) e-15

4. Consider the following table of arrival time and burst time for three Process P0, P1, P2:

The pre-emptive shortest job first scheduling algorithm is used. Scheduling is carried out only at arrival or completion of a process. What is the average waiting time for the three processes?
1. 3 ms
2. 3.67 ms
3. 4.47 ms
4. 4 ms

Solution : (2) 3.67 ms

5. The clipping process in computer graphics is used for

1. Adding graphics
2. Copying
3. Zooming
4. Removing objects and lines

Solution : (4) Removing objects and lines

6. Given below are two statements: one is labelled as Assertion A and the other is labelled as Reason R.

Assertion A: It is possible to create doubly linked list using only one pointer with every node.

Reason R: By storing the XOR of the addresses of the previous and next nodes.

In the light of the above statements, choose the most appropriate answer from the options given below.

1. Both A and R are true and R is the correct explanation of A 
2. Both A and R are true but R is NOT the correct explanation of A
3. A is true but R is false
4. A is false but R is true
Solution : (1) Both A and R are true and R is the correct explanation of A 

7. Consider the following statements:

A. Dynamic metrics are collected by measurements made of a program in execution 
B. Static metrics are collected by measurements made of representations of the system
C. The assessment of software quality is an objective process
D. An important part of quality assurance in the selection of standards that should apply to the software development process.

Choose the correct answer from the options given below:
1. A. B C only
2. B, C and D only
3. A. C and D only
4. A. B and D only

Solution : (4) A. B and D only

8. Given below are two statements: one is labelled as Assertion A and the other is labelled as Reason R.

Assertion A: The AVL trees are more balanced as compared to Red Black trees, but they may cause more rotations during insertion and
deletion

Reason R: A Red Black tree with n nodes has height that is greater than 2 log2 (n+1) and the AVL tree with n nodes has height less than
logo (√5 (n+2))-2 (where is golden ratio)

In the light of the above statements, choose the correct answer from the options given below.
1. Both A and R are correct and R is the correct explanation of A
2. Both A and R are correct and R is NOT the correct explanation of A
3. A is true but R is false
4. A is false but R is true

Solution : (3) A is true but R is false

9. Consider the following statements about heap sort algorithm:

A. The MAX-HEAPIFY procedure which runs in O lg (n) time. is the key to maintaining the max heap property 
B. The BUILD-MAX-HEAP procedure, which runs in O lg (n) time. produces max-heap from an unordered input array
C. The MAX-HEAP-INSERT, which runs in O (lg n) time, implements the insertion operation
D. The HEAP-INCREASE-KEY procedure runs in O(n lg n) time, to set the key of new node of its correct value

Choose the correct answer from the options given below:
1. A. B only
2. A, C only
3. B. D only
4. A. B. C, D

Solution : (2) A, C only

10. Which is not the component of the natural language understanding process?

1. Morphological analysis
2. Semantic analysis
3. Pragmatic analysis
4. Meaning analysis

Solution : (4) Meaning Analysis

 

Related Articles

image

UGC NET 2024 Paper 1 Revision Strategies | Ace the UGC NET Paper 1 Exam with These Effective Revision Strategies

Are you gearing up to take the UGC National Eligibility Test (NET) Paper 1 exam? This challenging test evaluates your teaching and research apti...

image
JRFAdda
image

CUET 2024: Intimation Slip ( Released ), Syllabus, Exam Dates and More

The Common University Entrance Test (CUET) 2024, conducted by the National Testing Agency (NTA), is a gateway for aspirants seeking admission to...

image
JRFAdda
image

UGC NET June 2024 Notification Released - Check Exam Dates, Application Details

The National Testing Agency (NTA) has officially released the notification for the UGC NET June 2024 cycle. The much-awaited notification provid...

image
JRFAdda