WGU C949 Pre-assessment FREQUENTLY TESTED QUESTIONS WITH CORRECT ANSWERS | BRAND NEW!

Which term refers to a template for creating an object?

Class

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

x = 20

elif x <= 30

x = 25

elif x >= 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

What is the set that results from set1 intersection set2, given these sets?

set1 = {69,82,47}

set2 = {11,82}

82

intersection -- compares the sets and returns the common number(s) in both sets

union -- puts both sets together but doesn't duplicate numbers

difference -- setX\setY returns every element in set X that is not in set Y

How many vertices does this graph have?

0 ---- 1 ----- 2

-

-

4 ---- 3 ----

Five

What is the adjacency list for node 8 in this graph?

7, 9, 3

What is the order of these functions by growth rate?

2/N, 37, 2^N, N log(N^2), N^2

2/N < 37< N log(N^2) < N^2 < 2^N

How many elements will be compared to linear search for 27 in this list?

[9,3,7,2,8,15,13,35,95,7,4]

11

whole list

What is the first element visited in this list when binary searching for the number 7?

[6,7,8,9,11,15,20]

9

middle value

(low/2) + (high/2)

How many elements in a list of size 64 would be visited when using a binary search for a number that is larger than all the values in the list?

6

How many elements in a list of size 64 would be visited when using a binary search for a number that is smaller than all the values in the list?

6

What is the runtime complexity of the algorithm O(N^N + 1)?

Exponential

What is the runtime complexity for the expression 305 + O(325*N)?

O(N)

What is the runtime complexity for this code?

for x in range(N):

for y in range(N):

for z in range(N):

tot = tot + zprint tot

O(N)

Which term describes an abstract data type (ADT) that Python uses?

Array

Which abstract data type (ADT) is characterized by the LIFO (last in, first out) principle?

Stack

stack has one end, points to the topmost elements

Which queue operation removes an item from the front of the queue?

dequeued removes the front value

enqueued adds to end

Which function in Python returns the number of times the desired value is found in a tuple?

count()

Which function in Python is used to find a specific value in a tuple?

index()

Which Python list function will remove all items from a list?

clear()

Which abstract data type (ADT) allows operations at one end only?

Stack

Which Python list function removes the first instance of the specified element?

remove()

How does the insertion sort algorithm sort through a list?

By iterating through the sorted list while placing each value into its correct sorted position within the list

What is the average runtime complexity of the merge sort algorithm?

O(N * log(N))

What is the midpoint given the quicksort on this list? Consider the lowindex = 5 and highindex = 9.

(43,3,72,18,2,28,51,111,66,71)

7

(5/2) + (9/2) = 7

What is the pivot point given the quicksort on this list? Consider the lowindex = 5 and highindex = 9.

(43,3,72,18,2,28,51,111,66,71)

111

index 7

Which tool in Python is used to implement a deque ADT?

Collections

containers used for storing data

Which function in Python is used to delete one item on the right side of the deque?

pop()

Which function determines that a linked list contains no data?

isEmpty()

returns true or false

What are classes composed of that perform the actions of an application?

Methods

defines the behaviors & actions of objects in a class

Which loop type will always be done at least once?

Do While

a while loop may never execute

How would a strongly typed language create an integer variable?

int myVar

Which component of a case statement would be considered a fall back in case no other parameters are met?

default

Which operator is a type of assignment operator?

+=

== compares values

+ adds values