Exam (elaborations)
WGU C949 Exam Test Questions and Answers
- Course
- Institution
WGU C949 Exam Test Questions and Answers
[Show more]
Content preview
WGU C949 Exam Test Questions and AnswersWhat 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
The benefits of buying summaries with Stuvia:
Guaranteed quality through customer reviews
Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.
Quick and easy check-out
You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.
Focus on what matters
Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!
Frequently asked questions
What do I get when I buy this document?
You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.
Satisfaction guarantee: how does it work?
Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.
Who am I buying these notes from?
Stuvia is a marketplace, so you are not buying this document from us, but from seller TheeGrades. Stuvia facilitates payment to the seller.
Will I be stuck with a subscription?
No, you only buy these notes for $8.99. You're not tied to anything after your purchase.
Can Stuvia be trusted?
4.6 stars on Google & Trustpilot (+1000 reviews)
80796 documents were sold in the last 30 days
Founded in 2010, the go-to place to buy study notes for 14 years now