adplus-dvertising

Welcome to the Software Design Concepts MCQs Page

Dive deep into the fascinating world of Software Design Concepts with our comprehensive set of Multiple-Choice Questions (MCQs). This page is dedicated to exploring the fundamental concepts and intricacies of Software Design Concepts, a crucial aspect of Software Engineering. In this section, you will encounter a diverse range of MCQs that cover various aspects of Software Design Concepts, from the basic principles to advanced topics. Each question is thoughtfully crafted to challenge your knowledge and deepen your understanding of this critical subcategory within Software Engineering.

frame-decoration

Check out the MCQs below to embark on an enriching journey through Software Design Concepts. Test your knowledge, expand your horizons, and solidify your grasp on this vital area of Software Engineering.

Note: Each MCQ comes with multiple answer choices. Select the most appropriate option and test your understanding of Software Design Concepts. You can click on an option to test your knowledge before viewing the solution for a MCQ. Happy learning!

Software Design Concepts MCQs | Page 54 of 79

Explore more Topics under Software Engineering

Q531.
What is tree impurity in the context of a call graph?

a.

The extent to which the graph is similar to a pure tree

b.

The extent to which the graph deviates from a pure tree

c.

The extent to which the graph is a pure tree

d.

The extent to which the graph is connected

Discuss
Answer: (b).The extent to which the graph deviates from a pure tree Explanation:The tree impurity in the context of a call graph refers to the extent to which the graph deviates from a pure tree. The concept of tree impurity is defined as the number of edges removed from a connected (undirected) graph in the process of converting it into a tree. The tree impurity is an indication of how different the graph is from a pure tree structure.
Q532.
What is the formula for calculating the tree impurity of a connected graph?

a.

m(G) = 2(e-n+1) / (n-1)(n-2)

b.

m(G) = (n-1) / (e-n+1)(n-2)

c.

m(G) = 2(n-1) / (e-n+1)(n-2)

d.

m(G) = (e-n+1) / (n-1)(n-2)

Discuss
Answer: (a).m(G) = 2(e-n+1) / (n-1)(n-2) Explanation:The tree impurity of a connected graph with n nodes and e edges is calculated as m(G) = 2(e-n+1) / (n-1)(n-2).
Q533.
What is the range of the value of tree impurity of a connected graph?

a.

Between 0 and 1

b.

Between -1 and 1

c.

Between 1 and n-1

d.

Between n-1 and n

Discuss
Answer: (a).Between 0 and 1 Explanation:The value of tree impurity lies between 0 and 1. It is 0 if the graph is a tree and 1 if it is a complete graph.
Q534.
What happens to the value of tree impurity if an edge is added to a connected graph?

a.

Decreases

b.

Stays the same

c.

Increases

d.

Becomes 0

Discuss
Answer: (c).Increases Explanation:If an edge is added to a connected graph, the value of tree impurity increases.
Q535.
What is the purpose of the tree impurity measure?

a.

To assess the structure of a design

b.

To allow for reuse in a design

c.

To decompose a system into clusters

d.

To consider the amount of information that flows through the edges

Discuss
Answer: (a).To assess the structure of a design Explanation:The tree impurity measure allows us to assess the structure of a design.
Q536.
Is it always easy to strive for a neat hierarchical decomposition?

a.

Yes

b.

No

c.

May be Yes or No

d.

Can't say

Discuss
Answer: (b).No Explanation:It is not always easy or even meaningful to strive for a neat hierarchical decomposition. A compromise may often have to be settled for.
Q537.
What is the purpose of organizing clusters hierarchically in a design?

a.

To allow for reuse in the design

b.

To make the intermodule connections thin

c.

To show a more complicated interaction pattern within a given cluster

d.

To make it easier to derive measures

Discuss
Answer: (c).To show a more complicated interaction pattern within a given cluster Explanation:The clusters may be organized hierarchically to show a more complicated interaction pattern within a given cluster.
Q538.
Does tree-like call graph allow for reuse in the same program?

a.

Yes

b.

No

c.

May be Yes or No

d.

Can't say

Discuss
Answer: (b).No Explanation:Tree-like call graphs do not allow for reuse as if a module is reused within the same program, its node in the call graph has at least two ancestors.
Q539.
What does the call graph allow us to assess in a design?

a.

The amount of information that flows through the edges

b.

The structure of a design

c.

The decomposition of a system into clusters

d.

The ease of deriving measures

Discuss
Answer: (b).The structure of a design Explanation:The call graph allows us to assess the structure of a design.
Q540.
What is the definition of local flow in the context of information flow between modules in a system?

a.

A local flow from module A to module B exists if A updates some global data structure and B retrieves from that structure.

b.

A local flow from module A to module B exists if A invokes B and passes it a parameter.

c.

A local flow from module A to module B exists if B invokes A and A returns a value.

d.

None of the above

Discuss
Answer: (b).A local flow from module A to module B exists if A invokes B and passes it a parameter. Explanation:A local flow from module A to module B exists if A invokes B and passes it a parameter.
Page 54 of 79

Suggested Topics

Are you eager to expand your knowledge beyond Software Engineering? We've curated a selection of related categories that you might find intriguing.

Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!

Computer Architecture

Unveil the science behind computer design with our Computer Architecture MCQs. Topics...

CompTIA PenTest+ Certification Exam PT0 002

Prepare for the CompTIA PenTest+ PT0-002 exam with our targeted MCQs. Covering...

Systems Programming

Decode low-level programming with our Systems Programming MCQs. These questions delve...

Neural Networks

Dive into the world of Artificial Intelligence with our Neural Networks MCQs. Uncover...

Embedded Systems

Dive into the world of specialized computing systems with our Embedded Systems MCQs....

Data Structures and Algorithms

Journey through the fundamentals of Data Structures and Algorithms with our extensive...

Web Technologies

Master the building blocks of the web with our Web Technologies MCQs. From HTML and...

JavaScript

Strengthen your web development skills with our JavaScript MCQs. Understand core...

Discrete Mathematics

Refine your mathematical skills essential for computer science with our Discrete...