Accounting
Anthropology
Archaeology
Art History
Banking
Biology & Life Science
Business
Business Communication
Business Development
Business Ethics
Business Law
Chemistry
Communication
Computer Science
Counseling
Criminal Law
Curriculum & Instruction
Design
Earth Science
Economic
Education
Engineering
Finance
History & Theory
Humanities
Human Resource
International Business
Investments & Securities
Journalism
Law
Management
Marketing
Medicine
Medicine & Health Science
Nursing
Philosophy
Physic
Psychology
Real Estate
Science
Social Science
Sociology
Special Education
Speech
Visual Arts
Question
A(n) ____ is a step-by-step problem-solving process in which a solution is arrived at in a finite amount of time.a. design plan
b. algorithm
c. process plan
d. structured program
Answer
This answer is hidden. It contains 1 characters.
Related questions
Q:
A(n) ____ is a data type that separates the logical properties from the implementation details.a. public b. protected c. privated. abstract data type
Q:
The constructor without parameters is called the ____.a. helper function b. default constructor c. destructord. default destructor
Q:
The components of a class are called the ____ of the class.a. operators b. friends c. objectsd. members
Q:
____ is the ability to use the same expression to denote different operations.a. Overloading operators b. Polymorphism c. Inheritanced. Encapsulation
Q:
____ is the first and most important step of the software development process.a. Analyzing the problem b. Designing the software c. Implementing the softwared. Test marketing
Q:
The three fundamental stages a program goes through are: development, use, and ____.a. implementation b. maintenance c. analysisd. requirements gathering
Q:
Class objects cannot be passed as parameters to functions or returned as function values.
Q:
A class and its members can be described graphically using a notation known as Unified Modeling Language (UML) notation.
Q:
The term asymptotic means the study of the function f as n becomes larger and larger without bound.
Q:
Encapsulation is the ability to create new data types from existing data types.
Q:
Encapsulation is the ability to handle data and operations as separate units.
Q:
Software engineers typically break the software development process into the following four phases: analysis, design, implementation, and testing and debugging.
Q:
The algorithm ____ is used to find the elements in one range of elements that do not appear in another range of elements.a. set_union b. set_difference c. set_joind. set_innerjoin
Q:
A convenient and fast way to implement an associative container data structure is to use a ____.a. linked list b. binary search tree c. priority queued. hash table
Q:
The definition of the class pair is contained in the header file utility, thus, to use the class pair in a program, the program must include the following statement ____.a. #include <util/utility> b. #include <utility.h> c. #include <compat/utility>d. #include <utility>
Q:
The STL provides four insert iterators to insert elements at a destination.
Q:
Elements in an associative container are not sorted automatically.
Q:
With the help of the function make_pair, we can create pairs without explicitly specifying the type pair.
Q:
A tree in which a particular vertex is designated as a root is called a ____ tree.a. anchored b. leaved c. spannedd. rooted
Q:
Let G be an undirected graph. G is called ____ if any two vertices in G are connected.a. weakly connected b. completely connected c. strongly connectedd. inversely connected
Q:
Let G be an undirected graph. A maximal subset of connected vertices is called a ____ of G.a. component b. property c. solutiond. technique
Q:
Let G be an undirected graph. G is called ____ if there is a path from any vertex to any other vertex.a. attached b. converted c. completedd. connected
Q:
The symbol ""____"" means ""Cartesian product.""a. * b. xc. +d. %
Q:
The topological sort algorithm can be implemented either using the depth first traversal or the breadth first traversal.
Q:
The breadth first traversal traverses the graph from each vertex that is not visited.
Q:
In the breadth first traversal of a graph, all the nodes at any level, i, are visited after visiting the nodes at level i + 1.
Q:
The depth first traversal is similar to the preorder traversal of a binary tree.
Q:
The labeling of the vertices of a graph depends on a specific application.
Q:
A graph can be shown pictorially.
Q:
In 1736, Euler represented the Knigsberg bridge problem as a graph, marking (as recorded) the birth of graph theory.