Welcome to the Visibility,Accessibility and Information Hiding MCQs Page

Dive deep into the fascinating world of Visibility,Accessibility and Information Hiding with our comprehensive set of Multiple-Choice Questions (MCQs). This page is dedicated to exploring the fundamental concepts and intricacies of Visibility,Accessibility and Information Hiding, a crucial aspect of Software Architecture and Design. In this section, you will encounter a diverse range of MCQs that cover various aspects of Visibility,Accessibility and Information Hiding, 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 Architecture and Design.

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

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

Visibility,Accessibility and Information Hiding MCQs | Page 3 of 13

Explore more Topics under Software Architecture and Design

01

Software Design Patterns

02

Requirement Specification and Planning

03

Unified Modelling Language

04

UML Diagrams

05

Architectural Patterns and Styles

06

Unit Operations

07

Component Based Systems

Q21.

What is precondition?

It is an assertion that must be true at the initiation of an operation

It is an assertion that must be true upon completion of an operation

It is a statement that must be true at a designated point in a program

None of the mentioned

Discuss

Answer: (a).It is an assertion that must be true at the initiation of an operation

Q22.

What is Class Invariant?

A class invariant is an assertion that must be true of any class instance between calls of its exported operations

Class invariants must be established by class constructors

Class invariants must be preserved by every exported operation in the class

All of the mentioned

Discuss

Answer: (d).All of the mentioned

Q23.

Which of the following are post condition heuristics?

Specify restrictions on parameters

Specify conditions that must have been established

Specify empty preconditions as true or none

None of the mentioned

Discuss

Answer: (d).None of the mentioned

Q24.

Which of the following are class invariant heuristics?

Specify restrictions on attributes

Specify restrictions on parameters

Specify relationships between the parameters and the results

All of the mentioned

Discuss

Answer: (a).Specify restrictions on attributes

Q25.

Algorithms may be stated in an operation specification for which of the following reasons?

An algorithm may be stated to provide a procedural specification of the operation’s behavior

An algorithm may be stated to specify that the algorithm is to be used in the implementation

All of the mentioned

None of the mentioned

Discuss

Answer: (c).All of the mentioned

Q26.

What is minispec?

It is a step-by-step description of how an operation transforms its inputs to outputs

Calls to other operations may be included in minispec

They are more often written in a pseudo code language

All of the mentioned

Discuss

Answer: (d).All of the mentioned

Q27.

Figure out the incorrect statements for pseudo code?

Pseudo code is English augmented with programming language constructs

It offers much of the ease and power of expression of English together with the precision of a programming language

There are many versions of pseudo code and no widely accepted standard

None of the mentioned

Discuss

Answer: (d).None of the mentioned

Q28.

What are Abstract Data Type?

They are a set of values and operations for manipulating those values

They are a scheme for storing values in computer memory

Arrays, stacks, queues, lists, and trees are all examples of abstract data types

They are a set of values and operations for manipulating those values, Arrays, stacks, queues, lists, and trees are all examples of abstract data types

Discuss

Answer: (d).They are a set of values and operations for manipulating those values, Arrays, stacks, queues, lists, and trees are all examples of abstract data types

Q29.

Data structures generally employ which of the following implementation strategies?

Contiguous Implementation

Linked Implementation

All of the mentioned

None of the mentioned

Discuss

Answer: (c).All of the mentioned

Q30.

What is Linked Implementation?

Values are stored in adjacent memory cells

Values are not necessarily stored in adjacent memory cells and are accessed using pointers or references

Values are not stored in adjacent memory cells

None of the mentioned

Discuss

Answer: (b).Values are not necessarily stored in adjacent memory cells and are accessed using pointers or references

Page 3 of 13

Welcome to the Visibility,Accessibility and Information Hiding MCQs Page

Visibility,Accessibility and Information Hiding MCQs | Page 3 of 13

Explore more Topics under Software Architecture and Design

Software Design Patterns

Requirement Specification and Planning

Unified Modelling Language

UML Diagrams

Architectural Patterns and Styles

Unit Operations

Component Based Systems

Suggested Topics

Neural Networks

HTML

Systems Analysis and Design Methods

Cyber Security

JavaScript

Python

SQL Server

Digital Logic Design

CSS