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

DAT 305 Wk 5 - Apply - Cumulative Exam

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

***************************************************************

Click Here To Download Your Files :   

 https://uopcourse.com/category/dat-305/ ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

You can buy more tutorials from the below link

https://uopcourse.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
*************************************************************** Click Here To Download Your Files : https://uopcourse.com/category/dat-305/ ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ You can buy more tutorials from the below link https
Recent Reviews Write a Review
0 0 0 0 reviews