WGU C949 Pre-assessment

C949 Pre-assessment 5.0 (2 reviews) Students also studied Terms in this set (70) Western Governors UniversityC 949 Save WGU C949 Data Structures and Alg...102 terms bodiewoodPreview

WGU C949 STUDY GUIDE

Teacher 95 terms badunique321 Preview C949 Data Structures and Algorithm...173 terms AidenOSprague Preview

C949 W

72 terms Ver Practice questions for this set Learn1 / 7Study using Learn Methods defines the behaviors & actions of objects in a class Which term refers to a template for creating an object? Class Choose an answer 1 What are classes composed of that perform the actions of an application?2 Which term refers to a template for creating an object?3 What does a time complexity analysis of an algorithm include?4 What is a component of an algorithm that specifies a stopping point?Don't know?

Which characteristic of an algorithm is independent in nature?Uses an agnostic code repository What is referred to as a data structure that stores subitems?Record Which factor takes the ability to easily update an algorithm into consideration?Maintainability What is a component of an algorithm that specifies a stopping point?Finiteness Which term refers to a type of search algorithm? Linear What is a high-level consideration in an algorithm's design?Simplicity What is the primary method used to search for an item in a sorted array?Binary Search Which review of an algorithm happens after implementation?A posteriori analysis Which factor helps measure the reusability of an algorithm?Extensibility Which search algorithm utilizes the divide-and-conquer strategy?Binary search Which algorithm requires data sorting as its first step? Binary What does a time complexity analysis of an algorithm include?Worst case Which data type do heap sorts work with?Tree-based data structure Which function is used in conjunction with a merge sort algorithm?Recursive Which attribute of a recursive function makes it unique? Calls itself

What is x in the following block of logic?x = 28 if x >= 10 and x < 20 xss=removed xss=removed xss=removed>= 50 x = 100 else x = 500 25 What is an if statement inside of an if statement referred to as?Nested Which search algorithm functions by continually dividing the data set in half until the sought item is found or the data set is exhausted?Binary Search Which search algorithm has the best performance when the data set is sorted?Interval Search

ex: Binary Search

Which term describes a way of organizing, storing, and performing operations on data?Data Structure Which data structure is used to implement a dictionary data type?Hash Table Which element refers to the numeric positions in a list abstract data type (ADT)?Indexes Which characteristic of a class allows it to be used as an abstract data type (ADT)?It consists of variables & methods What is the result when 6 is enqueued to the queue 7,9,8 (with 7 as the front)?

7, 9, 8, 6

enqueued adds to end Which value would be returned from executing the dequeue operation on the queue 7,9,8 (with 7 as the front)?7 dequeued removes the front value Which queue results from executing the following queue operations on the queue 7,9,8 (with 7 as the front)?Dequeue () Enqueue (6) Enqueue (5) Dequeue ()

8, 6, 5

What will be the new state of the queue 7,9,8 (with 7 as the front) after the enqueue (3) operation?

7, 9, 8, 3

Which format is used to store data in a hash table? Array Which term refers to a data structure that groups related items of data together?Record Which data structure is used to store unordered items by mapping each item to a location in an array?Hash Table What is the advantage that a linked list has over an array? Grows and shrinks as needed What would be the best data structure for a hash table with simple chaining?A doubly linked list How many leaf nodes does this tree have?Anne Peter Zara Savannah 2 Savannah & Zara both have no children What is the root node for this tree?Anne Peter Zara Savannah Anne What is the height of this tree?Anne Peter Zara Savannah Two Which data structure is the most dynamic in storing data items of varying lengths?List What is the resulting stack when the push(1) function is implemented on this stack yield?8,9,3,5(top is 8)

1, 8, 9, 3, 5

push() inserts to the front What will the peek() operation from this stack return?8,9,3,5(top is 8) 8 peek() returns front value & doesn't remove