Is it OK to quit bank job to prepare for UGC NET assistant professor?

When you like to appear for UGC NET exam and you are working professional then you may come across a question "Should I leave my job for the preparation of UGC NET?"

Since UGC NET exam is conducted every 6 months there is no need to leave your job. You can give 2-3 hours time everyday and 3-5 hours in weekends. Keep weekends to solve previous year question papers.

It's good enough that you can take out this much time everyday for at least 6 months to prepare for UGC NET regressively. Make sure to create a time table and follow it so that you would be able to complete the syllabus and revise it at well.

UGC NET Exam is not very tough that you have to leave your job for preparation. It is good enough to prepare for at least six months consistently. Consistency is the key to success.

You should follow below preparation tips to boost your exam preparation for the NTA UGC NET exam:

• First prepare for subjects which are most interesting and which you find easy to score. So, first give priority to easy subject and then move to harder subjects one by one. 
• You can skip 1 or 2 subject which you find very much hard.  Once you cover all possible subjects and you are confident that you are able to score at least 50 in each prepared subject, you can start with subject wise quizzes and check you preparation.
• Then go for full length mock tests and previous year papers to check your preparation when you face questions mixed from all subjects. Prepare such that you are able to solve such mock test in given time. On an average you will get 12 minutes to solve 10 questions.
• If you are scoring an average about 50 % then you are preparing well.

UGC NET Computer Science December 2019 | Question 145

Question 145

---

A flow graph F with entry node (1) and exit node (11) is shown below:

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

1. 1. Three : (1, (2, 3), 6)
2. 2. Three: (1, 4, 6)
3. 3. Four : ((2, 3), 6, 10, 11)
4. 4. Four: ((2, 3), 6, 9, 10)

Answer : 1. Three : (1, (2, 3), 6)

Explanation Question 145

Predicate is a node that contains condition. It means at least 2 outgoing edges required to qualify as a predicate.
Total number of predicates are THREE.

1. The vertex 1 is contains 2 outgoing edges are (2,3) and 11
2. The vertex (2,3) contains 2 outgoing edges are 6 and (4,5)
3. The vertex 6 contains 2 outgoing edges are 7 and 8.

So, option 1 is correct answer

Previous	Next
UGC NET CS December 2019 - Question 144	UGC NET CS December 2019 - Question 146

UGC NET Computer Science December 2019 | Question 122

Question 122

---

Which of the following are legal statements in C programming language?
(a) int * P= &44 ;
(b) int * P= &r ;
(c) int P= &a ;
(d) int P= a ;
Choose the correct option :

1. 1. (a) and (b)
2. 2. (b) and (c)
3. 3. (b) and (d)
4. 4. (a) and (d)

Answer : 3. (b) and (d)

Explanation Question 122

Legal Statements:

• int *P = &r;     Here, Pointer variable P is storing address of variable r.
• int P = a;          Here, P will hold value assigned by a.

Illegal Statements:

• int *P = &44;     Here, Pointer variable is storing address of number. This is not legal statement. First its needed to assign the value 44 in some variable and then address of that variable can stored by Pointer variable P.   
• int P = &a;    Here, P variable trying to store the address of the variable. It's illegal. It should be pointer in place of the int P variable.

So, option 3 is correct answer

Previous	Next
UGC NET CS December 2019 - Question 121	UGC NET CS December 2019 - Question 123

UGC NET Computer Science December 2019 | Question 142

Question 142

---

A flow graph F with entry node (1) and exit node (11) is shown below:

What is the cyclomatic complexity of flowgraph F?

1. 1. 2
2. 2. 3
3. 3. 4
4. 4. 3

Answer : 3. 4

Explanation Question 142

To find cyclomatic complexity we have 3 formulas

1. The number of regions(R) corresponds to the cyclomatic complexity. Total number of regions(R) are 4.
2. V(G), Flow graph is defined as V(G) = P + 1 where p is the number of predicate nodes contained in the flow graph G. Predicates are 3 + 1 = 4
3. V(G), Flow graph is defined as V(G) = E - N + 2 where E is the number of flow graph edges, and N is the number of flow graph nodes.
   Edges(E) - Nodes(N) + 2
   = 11 - 9 + 2
   = 2 + 2
   = 4

So, option 3 is correct answer

Previous	Next
UGC NET CS December 2019 - Question 141	UGC NET CS December 2019 - Question 143

UGC NET Computer Science December 2019 | Question 141

Question 141

---

A flow graph F with entry node (1) and exit node (11) is shown below:

Add caption

How many nodes are there in flowgraph F?

1. 1. 9
2. 2. 10
3. 3. 11
4. 4. 12

Answer : 1. 9

Explanation Question 141

Above graph contains 9 nodes and 11 edges.
The nodes are nothing but vertices.
Here, In above given diagram the number of rounds are the nodes
The nodes are 1, (2,3), (4,5), 6, 7, 8, 9, 10, 11.
Count of total nodes in flowgraph F are 9.

So, option 1 is correct answer

Previous	Next
UGC NET CS December 2019 - Question 140	UGC NET CS December 2019 - Question 142

UGC NET Computer Science December 2019 | Question 133

Question 133

---

According to the ISO-9126 Standard Quality Model. match the attributes given in List-I with their definitions in List-II :

List I	List II
a. Functionality	i. Relationship between level of performance and amount of resources
b. Reliability	ii. Characteristics related with achievement of purpose
c. Efficiency	iii. Effort needed to make for improvement
d. Maintainability	iv. Capability of software to maintain

Choose the correct option from the ones given below :

1. 1. (a)-(i), (b)-(ii), (c)-(iii), (d)-(iv)
2. 2. (a)-(ii), (b)-(i), (c)-(iv), (d)-(iii)
3. 3. (a)-(ii), (b)-(iv), (c)-(i), (d)-(iii)
4. 4. (a)-(i), (b)-(ii), (c)-(iv), (d)-(iii)

Answer : 3. (a)-(ii), (b)-(iv), (c)-(i), (d)-(iii)

Explanation Question 133

6 main quality characteristics for ISO-9126 Standard Quality Model:

1. Functionality→ Characteristics related with achievement of purpose
2. Reliability → Capability of software to maintain performance of software
3. Efficiency → Relationship between level of performance and amount of resources
4. Maintainability → Effort needed to make for improvement
5. Usability → Usability only exists with regard to functionality and refers to the ease of use for a given function.
6. Portability → This characteristic refers to how well the software can adapt to changes in its environment or with its requirements.

Reference : ISO/IEC 9126

So, option 3 is correct answer

Previous	Next
UGC NET CS December 2019 - Question 132	UGC NET CS December 2019 - Question 134

UGC NET Computer Science December 2019 | Question 143

Question 143

---

A flow graph F with entry node (1) and exit node (11) is shown below:

How many regions are there in flowgraph F?

1. 1. 2
2. 2. 3
3. 3. 4
4. 4. 8

Answer :

Explanation Question 143

The region is nothing but a combination of closed region and outer region. Any graph must have one outer region.
Here, 3 closed regions are available and one outer region is available.

• Closed 3 regions are:

1. Closed region by nodes → 1, (2, 3), (4, 5) and 10
2. Closed region by nodes → 6, 7, 8, 9
3. Closed region by nodes → (2, 3), 6, 7, 8, 9, 10 and (4, 5)

• One outer region.

So, the total number of regions are 4.

So, option 3 is correct answer

Previous	Next
UGC NET CS December 2019 - Question 142	UGC NET CS December 2019 - Question 144

UGC NET Computer Science December 2019 | Question 123

Question 123

---

Two concurrent executing transactions T1 and T2 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?

1. 1. (a), (b) and (c) only
2. 2. (c) and (d) only
3. 3. (a) and (b) only
4. 4. (a), (b) and (d) only

Answer : 4. (a), (b) and (d) only

Explanation Question 123

Following problems can occur when concurrent transactions execute in an uncontrolled manner:

1. The Lost Update Problem. When two transactions access the same database items and also perform their own operations in a way that makes the value of some database item wrong, a lost update problem takes place.
2. Uncommitted Dependency - Dirty Read Problem(or Temporary Update Problem). A dirty read problem occurs when a transaction updates an item in the database and then there is a failure in the transaction for some reason. As the transaction fails, the updated item in the database is accessed by another transaction before it can go back to the original value.
3. The Incorrect Summary Problem. If one transaction is calculating an aggregate summary function on a number of database items while other transactions are updating some of these items, the aggregate function may calculate some values before they are updated and others after they are updated.
4. The Unrepeatable Read Problem. Another problem that may occur is called unrepeatable read, where a transaction T reads the same item twice and the item is changed by another transaction T between the two reads. Hence, T receives different values for its two reads of the same item.
5. Phantom Read Problem

The Unrepeatable Read Problem Example
Suppose two users X and Y access a department’s database concurrently. User X is updates the database to provide all employees with a salary raise of 5%. At the same time, user Y wants to know the total salary that has been paid to the department.
As the two transactions are being executed simultaneously on the same database, there is always a high probability to interfere with each other. As a result, the sum includes certain salaries before the raise and certain salaries subsequent to the raise. Such a sum cannot be considered as an acceptable value of the total salary (the value before the raise or after the raise would be different)

Reference 1 : Concurrency problems in DBMS Transactions

Reference 1 : Concurrency Anomalies - Incorrect Summary Problem

From above we can conclude that only options (a), (b) and (d) can be included in problems whoch can occur when concurrent transactions execute in an uncontrolled manner.

So, option 4 is correct answer

Previous	Next
UGC NET CS December 2019 - Question 122	UGC NET CS December 2019 - Question 124

UGC NET Computer Science December 2019 | Question 124

Question 124

---

Identify the circumstances under which preemptive 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 :

1. 1. (a) and (b) only
2. 2. (a) and (d) only
3. 3. (c) and (d) only
4. 4. (a), (b), (c) only

Answer : 1. (a) and (b) only

Explanation Question 124

Preemptive Scheduling According to Standard book of Galvin,
CPU scheduling decisions take place under one of four conditions:

1. When a process switches from the running state to the waiting state, such as for an I/O request or invocation of the wait( ) system call.
2. When a process switches from the running state to the ready state, for example in response to an interrupt.
3. When a process switches from the waiting state to the ready state, say at completion of I/O or a return from wait( ).
4. When a process terminates.

• For conditions 1 and 4 there is no choice - A new process must be selected.
• For conditions 2 and 3 there is a choice - To either continue running the current process, or select a different one.
• If scheduling takes place only under conditions 1 and 4, the system is said to be non-preemptive, or cooperative. Under these conditions, once a process starts running it keeps running, until it either voluntarily blocks or until it finishes. Otherwise the system is said to be preemptive.

In above discussion. it's given that If scheduling takes place only under conditions 1 and 4, the system is said to be non-preemptive. Otherwise the system is said to be preemptive. Therefore point 2 & 3 are condition for preemptive system.

Here point 2 and 3 are as listed below

• When a process switches from the running state to the ready state.
• When a process switches from the waiting state to the ready state.

These above point matches with circumstances (a) & (b) given in question.

So, option 1 is correct answer

Reference 1 : CPU Scheduling - Preemptive Scheduling

Previous	Next
UGC NET CS December 2019 - Question 123	UGC NET CS December 2019 - Question 125

UGC NET Computer Science December 2019 | Question 125

Question 125

---

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) submatrices X11,X12,X21,X22
partition Y into four (N/2)x(N/2) submatrices Y11,Y12,Y21,Y22.
spawn p Trans (X11,Y11,N/2)
spawn p Trans (X12,Y12,N/2)
spawn p Trans (X21,Y21,N/2)
spawn p Trans (X22,Y22,N/2)
What is the asymptotic parallelism of the algorithm?

1. 1. T₁/T_∞ or θ(N² / lg N)
2. 2. T₁/T_∞ or θ(N / lg N)
3. 3. T₁/T_∞ or θ(lg N / N²)
4. 4. T₁/T_∞ orθ(lg N/ N)

Answer : 1. T₁/T_∞ or θ(N² / lg N)

Explanation Question 125

Option 1 is correct answer

Previous	Next
UGC NET CS December 2019 - Question 124	UGC NET CS December 2019 - Question 126

UGC NET Computer Science December 2019 | Question 126

Question 126

---

Consider the following statements :
(a) The running time of dynamic programming algorithm is always θ(ρ) 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.
(d) If a problem X can be reduced to a known NP-hard problem. then X must be NP-hard
Which of the statement(s) is (are) true?

1. 1. Only (b) and (a)
2. 2. Only (b)
3. 3. Only (b) and (c)
4. 4. Only (b) and (d)

Answer : 2. Only (b)

Explanation Question 126

1. The running time of a dynamic program is the number of subproblems times the time per subproblem. This would only be true if the time per subproblem is O(1). False
2. Cyclic dependency is a relation between two or more modules which either directly or indirectly depend on each other to function properly. Such modules are also known as mutually recursive. So, we can’t get correct solution when we are using dynamic programming. True
3. A bottom up implementation must go through all of the sub-problems and spend the time per subproblem for each. Using recursion and memoization only spends time on the subproblems that it needs. In fact, the reverse may be true: using recursion and memoization may be asymptotically faster then a bottom-up implementation. False
4. If a problem X can be reduced to a known NP-hard problem, then X must be NP-Complete. False

Hence, statement b is the only true.

So, option 2 is correct answer

Previous	Next
UGC NET CS December 2019 - Question 125	UGC NET CS December 2019 - Question 127

UGC NET Computer Science December 2019 | Question 127

Question 127

---

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?

1. 1. Only (a) and (b)
2. 2. Only (a) and (c)
3. 3. Only (b) and (c)
4. 4. (a), (b) and (c)

Answer : 1. Only (a) and (b)

Explanation Question 127

1. Fiber optic cable is much lighter than copper cable. True
2. Fiber optic cable is not affected by power surges or electromagnetic interference. True
3. Optical transmission is inherently bidirectional. False

Given statement (c) is false because bidirectional Fiber Optics can be implemented with by WDM (Wavelength-division multiplexing) or by rearranging two unidirectional Fibers, its not inherently bidirectional.

Only given options (a) and (b) are correct statements on Fibre optics.

So, option 1 is correct answer

Previous	Next
UGC NET CS December 2019 - Question 126	UGC NET CS December 2019 - Question 128

UGC NET Computer Science December 2019 | Question 128

Question 128

---

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?

1. 1. Only (a) and (b)
2. 2. Only (a) and (c)
3. 3. Only (b) and (c)
4. 4. (a), (b) and (c)

Answer : 2. Only (a) and (c)

Explanation Question 128

1. Windows Azure is a cloud-based operating system. True
2. Google App Engine is an integrated set of online services for consumers to communicate and share with others. False
3. Amazon Cloud Front is a web service for content delivery. True

Microsoft Azure, commonly referred to as Azure, is a cloud computing service created by Microsoft for building, testing, deploying, and managing applications and services through Microsoft-managed data centers.

Google App Engine (often referred to as GAE or simply App Engine) is a Platform as a Service and cloud computing platform for developing and hosting web applications in Google-managed data centers.

Amazon CloudFront is a content delivery network (CDN) offered by Amazon Web Services. Content delivery networks provide a globally-distributed network of proxy servers which cache content, such as web videos or other bulky media, more locally to consumers, thus improving access speed for downloading the content.

Statement (b) is wrong because Google App Engine is a cloud computing platform for developing and hosting web applications in Google-managed data centers. It's not an online services for consumers to communicate and share with others.

Hence, Correct statements are only (a) and (c)

So, option 2 is correct answer

Previous	Next
UGC NET CS December 2019 - Question 127	UGC NET CS December 2019 - Question 129

UGC NET Computer Science December 2019 | Question 129

Question 129

---

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?

1. 1. Only (a) and (b)
2. 2. Only (a) and (c)
3. 3. Only (b) and (c)
4. 4. (a), (b) and (c)

Answer : 4. (a), (b) and (c)

Explanation Question 129

Message Confidentiality
In information security, confidentiality "is the property, that information is not made available or disclosed to unauthorized individuals, entities, or processes." Confidentiality is a component of privacy that implements to protect our data from unauthorized viewers. Examples of confidentiality of electronic data being compromised include laptop theft, password theft, or sensitive emails being sent to the incorrect individuals.

Message Integrity
This means that data cannot be modified in an unauthorized or undetected manner.

Message Authentication
Authentication is the act of verifying a claim of identity.

References:

• Information Security - Confidentiality
• Information Security - Integrity
• Information Security - Authentication

All three statements are correct.

So, option 4 is correct answer

Previous	Next
UGC NET CS December 2019 - Question 128	UGC NET CS December 2019 - Question 130

UGC NET Computer Science December 2019 | Question 130

Question 130

---

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?

1. 1. (a) and (b) only
2. 2. (a) and (c) only
3. 3. (b) and (c) only
4. 4. (a), (b) and (c)

Answer : 4. (a), (b) and (c)

Explanation Question 108

Problems in Hill Climbing Algorithm:

1. Local Maximum: A local maximum is a peak state in the landscape which is better than each of its neighboring states, but there is another state also present which is higher than the local maximum.
   Solution: Backtracking technique can be a solution of the local maximum in state space landscape. Create a list of the promising path so that the algorithm can backtrack the search space and explore other paths as well.
2. Plateau: A plateau is the flat area of the search space in which all the neighbor states of the current state contains the same value, because of this algorithm does not find any best direction to move. A hill-climbing search might be lost in the plateau area.
   Solution: The solution for the plateau is to take big steps or very little steps while searching, to solve the problem. Make a big jump. Randomly select a state far away from the current state. Chances are that we will land at a non-plateau region
3. Ridges: A ridge is a special form of the local maximum. It has an area which is higher than its surrounding areas, but itself has a slope, and cannot be reached in a single move.
   Solution: With the use of bidirectional search, or by moving in different directions, we can improve this problem.

Reference 1 : Problems in Hill Climbing Algorithm in AI

(a), (b), (c) all are shortcomings of the hill climbing algorithm.

So, option 4 is correct answer

Previous	Next
UGC NET CS December 2019 - Question 129	UGC NET CS December 2019 - Question 131

UGC NET Computer Science December 2019 | Question 132

Question 132

---

Match List-I and List-II:

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

Choose the correct option from those given below :

1. 1. (a)-(ii), (b)-(iv), (c)-(iii), (d)-(i)
2. 2. (a)-(iv), (b)-(iii), (c)-(ii), (d)-(i)
3. 3. (a)-(ii), (b)-(iv), (c)-(i), (d)-(iii)
4. 4. (a)-(iv), (b)-(ii), (c)-(i), (d)-(iii)

Answer : 3. (a)-(ii), (b)-(iv), (c)-(i), (d)-(iii)

Explanation Question 132

• Physical layer → Concerned with transmitting raw bits over a communication channel
• Transport layer → True end-to-end layer from source to destination
• Session layer → Provide token management service
• Presentation layer → Concerned with the syntax and semantics of the information transmitted

So, option 3 is correct answer

Previous	Next
UGC NET CS December 2019 - Question 131	UGC NET CS December 2019 - Question 133

UGC NET Computer Science December 2019 | Question 134

Question 134

---

Match the Agile Process models with the task performed during the model :

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

Choose the correct option from those given below :

1. 1. (a)-(ii), (b)-(iv), (c)-(i), (d)-(iii)
2. 2. (a)-(i), (b)-(iii), (c)-(ii), (d)-(iv)
3. 3. (a)-(ii), (b)-(i), (c)-(iv), (d)-(iii)
4. 4. (a)-(i), (b)-(iv), (c)-(ii), (d)-(iii)

Answer : 1. (a)-(ii), (b)-(iv), (c)-(i), (d)-(iii)

Explanation Question 134

• Scrum → Sprint backlog
• Adaptive software development → Time box release plan
• Extreme programming → CRC cards
• Feature-driven development → <action> the <result> <by/for/of/to> a(n) <object>

So, option 1 is correct answer

Previous	Next
UGC NET CS December 2019 - Question 133	UGC NET CS December 2019 - Question 135

UGC NET Computer Science December 2019 | Question 135

Question 135

---

Match List-I with List-II :

List I	List II
a. Frame attribute	i. to create ink in HTML
b. <tr> tag	ii. for vertical alignment of content in cell
c. Valign attribute	iii. to enclose each row in table
d. <a> tag	iv. to specify the side of the table frame that display border

Choose the correct option from those given below :

1. 1. (a)-(i), (b)-(ii), (c)-(iii), (d)-(iv)
2. 2. (a)-(ii), (b)-(i), (c)-(iii), (d)-(iv)
3. 3. (a)-(iv), (b)-(iii), (c)-(ii), (d)-(i)
4. 4. (a)-(iii), (b)-(iv), (c)-(ii), (d)-(i)

Answer : 3. (a)-(iv), (b)-(iii), (c)-(ii), (d)-(i)

Explanation Question 135

• Frame attribute → To specify the side of the table frame that display border. The < frame > tag defines one particular window (frame) within a <frameset>. Each < frame > in a < frameset > can have different attributes, such as border, scrolling, the ability to resize, etc.
• < tr > tag → To enclose each row in a table.The < tr > tag defines a row in an HTML table.A < tr > element contains one or more or elements
• Valign attribute → for vertical alignment of content in cell
• < a > tag → To create link in HTML

So, option 3 is correct answer

Previous	Next
UGC NET CS December 2019 - Question 134	UGC NET CS December 2019 - Question 136

UGC NET Computer Science December 2019 | Question 136

Question 136

---

An instruction is stored at location 500 with its address field at location 501. The address field has the value 400. A processor register R₁ contains the number 200. Match the addressing mode (List-I) given below with effective address (List-II) for the given instruction:

Match List-I with List-II :

List I	List II
a. Direct	i. 200
b. Register indirect	ii. 902
c. Index with R1 as the index register	iii. 400
d. Relative	iv. 600

1. 1. (a)-(iii), (b)-(i), (c)-(iv), (d)-(ii)
2. 2. (a)-(i), (b)-(ii)), (c)-(iii), (d)-(iv)
3. 3. (a)-(iv), (b)-(ii), (c)-(iii), (d)-(i)
4. 4. (a)-(iv), (b)-(iii), (c)-(ii), (d)-(i)

Answer : 1. (a)-(iii), (b)-(i), (c)-(iv), (d)-(ii)

Explanation Question 136

				Main Memory
Instruction			500	Opcode	Mode
Opcode	500	→	501
			502	Next Instruction
			⋮
	R1	200	⋮
			⋮ ⋮

Direct Address = 400
Relative Address = Next Instruction memory location + Direct Address value
= 502 + 400
= 902

Register indirect Address= 200
Indexed Address = Register Indirect Address + Direct Address
= 200 + 400
= 600

So, option 1 is correct answer

Previous	Next
UGC NET CS December 2019 - Question 135	UGC NET CS December 2019 - Question 137

UGC NET Computer Science December 2019 | Question 137

Question 137

---

Match List-I and List-II :

List I	List II
a. Isolated I/O	i. same set of control signal for I/O and memory communication
b. Memory mapped I/O	ii. separate instructions for I/O and memory communication
c. I/O interface	iii. requires control signals to be transmitted between the communicating units
d. Asynchronous data transfer	iv. resolve the differences in central computer and peripherals

Choose the correct option from those given below :

1. 1. (a)-(ii), (b)-(iii), (c)- (iv), (d)-(i)
2. 2. (a)-(i), (b)-(ii), (c)-(iii), (d)-(iv)
3. 3. (a)-(iii), (b)-(i), (c)-(iv), (d)-(iii)
4. 4. (a)-(i), (b)-(ii), (c)-(iv), (d)-(iii)

Answer : 3. (a)-(iii), (b)-(i), (c)-(iv), (d)-(iii)

Explanation Question 137

• Isolated I/O → Separate instructions for I/O and memory communication
• Memory mapped I/O → Same set of control signal for I/O and memory communication
• I/O interface → Resolve the differences in central computer and peripherals
• Asynchronous data transfer → Requires control signals to be transmitted between the communicating units

So, option 3 is correct answer

Previous	Next
UGC NET CS December 2019 - Question 136	UGC NET CS December 2019 - Question 138