DAT 305 Wk 5 - Apply - Cumulative Exam | eBooks | Education

DAT 305 Wk 5 - Apply - Cumulative Exam

DAT 305 Wk 5 - Apply - Cumulative Exam PLDZ-15708 Free
In Stock
$ 0.00 USD
Free Download! Description

Click Here To Download Your Files :

https://hwsell.com/category/dat-305/

~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

You can buy more tutorials from the below link

https://www.hwsell.com/

DAT 305 Wk 5 - Apply - Cumulative Exam

Question 1

A linked list stores items in an unspecified order.

 

Question 2

 

A node in binary tree can have zero, one, or two children.

Question 3

 

A list node's data can store a record with multiple subitems.

 

  1. Question 4

 

Items stored in an array can be accessed using a positional index.

 

  1. Question 5

 

The statement below that assigns x with y is a constant time operation.

y = 10

x = y

 

  1. Question 6

 

A loop is never a constant time operation.

 

  1. Question 7

 

Integers will be placed into buckets based on the 1's digit. More buckets are needed for an array with one thousand integers than for an array with one hundred integers.

 

  1. Question 8

 

Consider integers X and Y, such that X < Y. X will always be in a lower bucket than Y.

 

  1. Question 9

 

All integers from an array could be placed into the same bucket, even if the array has no duplicates.

 

  1. Question 10

 

When sorting an array of n 3-digit integers, RadixSort's worst-case time complexity is O(n).

 

  1. Question 11

 

When sorting an array with n elements, the maximum number of elements that RadixSort may put in a bucket is n.

In

  1. Question 12

 

RadixSort has a space complexity of O(1).

 

  1. Question 13

 

Given a list with items 40, 888, -3, 2, what does GetLength(list) return?

 

 

4

Fails

  1. Question 14

 

Given a list with items 'Z', 'A', 'B', Sort(list) yields 'A', 'B', 'Z'.

 

  1. Question 15

 

If a list ADT has operations like Sort or PrintReverse, the list is clearly implemented using an array.

 

  1. Question 16

 

Each node in a doubly-linked list contains data and _____ pointer(s).

 

 

two

one

  1. Question 17

 

Given a doubly-linked list with nodes 20, 67, 11, node 20 is the _____.

 

 

head

tail

  1. Question 18

 

Given a doubly-linked list with nodes 4, 7, 5, 1, node 7's previous pointer points to node _____.

 

 

4

5

  1. Question 19

 

Given a doubly-linked list with nodes 8, 12, 7, 3, node 7's next pointer points to node _____.

 

 

12

3

  1. Question 20

 

ListTraverse begins with _____.

 

 

a specified list node

the list's head node

the list's tail node

  1. Question 21

 

Given numList is: 5, 8, 2, 1.

ListTraverse(numsList) visits _____ node(s).

 

 

one

two

four

  1. Question 22

 

ListTraverse can be used to traverse a doubly-linked list.

 

  1. Question 23

 

The length of an array-based list equals the list's array allocation size.

 

  1. Question 24

 

An item can be appended to an array-based list, provided the length is less than the array's allocated size.

 

  1. Question 25

 

Given rosterQueue: 400, 313, 270, 514, 119, what does GetLength(rosterQueue) return?

 

 

400

5

  1. Question 26

 

Which operation determines if the queue contains no items?

 

 

IsEmpty

Peek

  1. Question 27

 

Given parkingQueue: 1, 8, 3, what are the queue contents after Peek(parkingQueue)?

 

 

1, 8, 3

8, 3

  1. Question 28

 

Given parkingQueue: 2, 9, 4, what are the contents of the queue after Pop(parkingQueue)?

 

 

9, 4

2, 9, 4

  1. Question 29

 

Given that parkingQueue has no items (i.e., is empty), what does GetLength(parkingQueue) return?

 

 

-1

0

Undefined

  1. Question 30

 

A 100 element hash table has 100 _____.

 

 

items

buckets

  1. Question 31

 

A hash function computes a bucket index from an item's _____.

 

 

integer value

key

  1. Question 32

 

For a well-designed hash table, searching requires _____ on average.

 

 

O(1)

O(N)

O(log N)

Click Here To Download Your Files : https://hwsell.com/category/dat-305/ ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ You can buy more tutorials from the below link https://www.hwsell.com/ DAT 305 Wk 5 - Apply - Cumulative Exam Question 1 A linked list stor
Recent Reviews Write a Review
0 0 0 0 reviews