WGU C949 Computational Data Structures and Algorithms I Knowledge test Exam Toolkit Questions and Verified Marking Scheme 2024/2025
2 views 0 purchase
Module
WGU C949 Data Structure and Algorithm
Institution
WGU C949 Data Structure And Algorithm
WGU C949 Computational Data Structures and Algorithms I Knowledge test Exam Toolkit Questions and Verified Marking Scheme 2024/2025
What are LinkedList class' two data members? - correct answer Head and tail
In a circular doubly-linked list with at least 2 nodes, where does the head node's pr...
wgu c949 computational data structures and algorit
Written for
WGU C949 Data Structure and Algorithm
WGU C949 Data Structure and Algorithm
Seller
Follow
KieranKent55
Reviews received
Content preview
WGU C949 Computational Data Structures
and Algorithms I Knowledge test Exam
Toolkit Questions and Verified Marking
Scheme 2024/2025
What are LinkedList class' two data members? - correct
answer Head and tail
In a circular doubly-linked list with at least 2 nodes, where does
the head node's previous pointer point to? - correct answer
Tail
T or F: In a circular linked list with 1 node, the tail node's next
pointer points to the tail. - correct answer True
T or F: The Stack class has both a LinkedList and Node data
member. - correct answer False. Only has a LinkedList data
member.
The Stack class' push() method uses the LinkedList ____ method
to place elements on a stack. - correct answer prepend()
T or F: The Stack class's push() method takes a Node as a
parameter. - correct answer False.
The push() method takes an int, not a Node, as a parameter. The
method creates a new node, whose data is the integer parameter,
and inserts the node into the linked list.
, Sorting algorithms that can be adapted for linked lists? -
correct answer Insertion sort, merge sort
Sorting algorithms that dont work well for linked lists? -
correct answer Shell sort, quicksort, heap sort
What aspect of linked lists makes adapting array-based sorting
algorithms to linked lists difficult? - correct answer Elements
in a linked list cannot be accessed by index.
Which sorting algorithm uses a gap value to jump between
elements, and is difficult to adapt to linked lists for this reason? -
correct answer Shell sort
Why are sorting algorithms for arrays generally more difficult to
adapt to singly-linked lists than to doubly-linked lists? - correct
answer Singly-linked lists do not support backward traversal.
The current node to be sorted is placed _____ the location
returned by find_insertion_position(). - correct answer after
The insertion_sort_singly_linked() method would also sort a
doubly-linked list. - correct answer False.
doubly-linked does not have the remove_after() method.
Singly-linked list insertion sort variant:
The current node to be sorted is placed _____ the location
returned by find_insertion_position(). - correct answer after
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 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 KieranKent55. Stuvia facilitates payment to the seller.
Will I be stuck with a subscription?
No, you only buy these notes for £9.78. You're not tied to anything after your purchase.
