WGU C949 Exam Test Questions and Answers
What Is An Algorithm CORRECT ANS-An algorithm is a set of commands that must be
followed for a computer to perform calculations or other problem-solving operations.
Computational problem CORRECT ANS-Specifies an input, a question about the input that
can be answered using a computer, and the desired output.
Does an algorithim need to be in programming language? CORRECT ANS-An algorithm can
be described in English, pseudocode, a programming language, hardware, etc., as long as the
algorithm precisely describes the steps of a computational procedure.
NP-complete CORRECT ANS-A set of problems for which no known efficient algorithm
exists
Abstract Data Type (ADT) CORRECT ANS-Data type described by predefined user
operations, without indicating how each operation is implemented.
List CORRECT ANS-A list is an ADT for holding ordered data.
Common underlying data structures:
Array, linked list
Dynamic array CORRECT ANS-A dynamic array is an ADT for holding ordered data and
allowing indexed access.
Common underlying data structures:
Array
, WGU C949 Exam Test Questions and Answers
Stack CORRECT ANS-A stack is an ADT in which items are only inserted on or removed from
the top of a stack.
Common underlying data structures:
Linked list
Queue CORRECT ANS-A queue is an ADT in which items are inserted at the end of the
queue and removed from the front of the queue.
Common underlying data structures:
Linked list
Deque CORRECT ANS-A deque (pronounced "deck" and short for double-ended queue) is
an ADT in which items can be inserted and removed at both the front and back.
Common underlying data structures:
Linked list
Bag CORRECT ANS-A bag is an ADT for storing items in which the order does not matter
and duplicate items are allowed.
Common underlying data structures:
Array, linked list
Set CORRECT ANS-A set is an ADT for a collection of distinct items.
Common underlying data structures:
Binary search tree, hash table
What Is An Algorithm CORRECT ANS-An algorithm is a set of commands that must be
followed for a computer to perform calculations or other problem-solving operations.
Computational problem CORRECT ANS-Specifies an input, a question about the input that
can be answered using a computer, and the desired output.
Does an algorithim need to be in programming language? CORRECT ANS-An algorithm can
be described in English, pseudocode, a programming language, hardware, etc., as long as the
algorithm precisely describes the steps of a computational procedure.
NP-complete CORRECT ANS-A set of problems for which no known efficient algorithm
exists
Abstract Data Type (ADT) CORRECT ANS-Data type described by predefined user
operations, without indicating how each operation is implemented.
List CORRECT ANS-A list is an ADT for holding ordered data.
Common underlying data structures:
Array, linked list
Dynamic array CORRECT ANS-A dynamic array is an ADT for holding ordered data and
allowing indexed access.
Common underlying data structures:
Array
, WGU C949 Exam Test Questions and Answers
Stack CORRECT ANS-A stack is an ADT in which items are only inserted on or removed from
the top of a stack.
Common underlying data structures:
Linked list
Queue CORRECT ANS-A queue is an ADT in which items are inserted at the end of the
queue and removed from the front of the queue.
Common underlying data structures:
Linked list
Deque CORRECT ANS-A deque (pronounced "deck" and short for double-ended queue) is
an ADT in which items can be inserted and removed at both the front and back.
Common underlying data structures:
Linked list
Bag CORRECT ANS-A bag is an ADT for storing items in which the order does not matter
and duplicate items are allowed.
Common underlying data structures:
Array, linked list
Set CORRECT ANS-A set is an ADT for a collection of distinct items.
Common underlying data structures:
Binary search tree, hash table
