Register

UGC NET CSE | June 2013 | Part 2 | Question: 4

3,116 views
1 votes
1 votes

A good software design must have

  1. High module coupling, High module cohesion
  2. High module coupling, Low module cohesion
  3. Low module coupling, High module cohesion
  4. Low module coupling, Low module cohesion
User Avatar

2 Answers

Best answer
2 votes
2 votes

Answer : Low module coupling, High module cohesion

Cohesion
Cohesion is a measure that defines the degree of intra-dependability within elements of a module. The greater the cohesion, the better is the program design.

Coupling
Coupling is a measure that defines the level of inter-dependability among modules of a program. It tells at what level the modules interfere and interact with each other. The lower the coupling, the better the program.

Reference 1: Detailed information About Cohesion and Coupling is Here and Here See this to know where and why do we use them

Reference 2 :Characteristics of a good software design is Here

• selected by
User Avatar
2 votes
2 votes
High cohesion(compactness of code withinn a module) and low coupling(interconnection between different modules)are required  in good software design hence ans is C
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

3 votes
3 votes
1 answer
2
go_editor asked Jul 14, 2016
4,100 views
UGC NET CSE | June 2013 | Part 2 | Question: 46
A virtual memory based memory management algorithm partially swaps out a process. This is an example of short term scheduling long term scheduling medium term scheduling mutual exclusion
A virtual memory based memory management algorithm partially swaps out a process. This is an example ofshort term schedulinglong term schedulingmedium term schedulingmutu...
User Avatar
2 votes
2 votes
1 answer
3
go_editor asked Jul 14, 2016
1,139 views
UGC NET CSE | June 2013 | Part 2 | Question: 44
A set of processors $P1, P2, \dots Pk$ can execute in parallel if Bernstein’s conditions are satisfied on a pairwise basis; that is $ P1 \parallel P2 \parallel P3 \parallel \dots \parallel Pk$ ... $Pi \parallel Pj \text{ for all } i \leq j$ $Pi \parallel Pj \text{ for all } i \geq j$
A set of processors $P1, P2, \dots Pk$ can execute in parallel if Bernstein’s conditions are satisfied on a pairwise basis; that is $ P1 \parallel P2 \parallel P3 \...
User Avatar
2 votes
2 votes
3 answers
4
go_editor asked Jul 14, 2016
2,474 views
UGC NET CSE | June 2013 | Part 2 | Question: 42
A Boolean operator $\ominus$ is defined as follows: 1 $\ominus$ 1 =1, 1 $\ominus$ 0 = 0, 0 $\ominus$ 1 = 0 and 0 $\ominus$ 0 =1 What will be the truth value of the expression (x $\ominus$ y ) $\ominus$ z = x $\ominus$ (y $\ominus$ z)? Always true Always false Sometimes true True when x,y, z are all true
A Boolean operator $\ominus$ is defined as follows:1 $\ominus$ 1 =1, 1 $\ominus$ 0 = 0, 0 $\ominus$ 1 = 0 and 0 $\ominus$ 0 =1What will be the truth value of the expressi...
User Avatar
Link Copied!