Quiz Fall 3/ Computer Science & Information Technology - Data Structures And Algorithms

Write the code segment that is used to insert a new node, referenced by the reference variable newNode, at the beginning of a linear linked list.

in Computer Science & Information Technology

What will be an ideal response?

data-structures-and-algorithms

newNode.setNext(head);
head = newNode;

If we are given the adjacency matrix of a weighted (undirected) graph, how can we use it to determine the number of edges in the graph?

in Computer Science & Information Technology

What will be an ideal response?

data-structures-and-algorithms

Count the number of entries that are neither zero nor infinity. Then, divide this number by 2.

What does a binary search tree have in common with a linked list?

in Computer Science & Information Technology

a. The node has pointers to other nodes
b. It has a head and a tail
c. It uses two pointers or links to leaf nodes
d. It always inserts at the end

data-structures-and-algorithms

a. The node has pointers to other nodes

A function that calls itself is called a(n) ____.

in Computer Science & Information Technology

A. recursive function
B. iterative function
C. base function
D. successive function

data-structures-and-algorithms

Answer: A

A nonmember function can access private class data members as a(n) ____.

in Computer Science & Information Technology

a. operator
b. friend
c. static function
d. privileged function

data-structures-and-algorithms

b. friend

When an ADT sorted list is implemented using an instance of the ADT list which is link based, which of the following operations has worst case efficiency?

in Computer Science & Information Technology

a. insertSorted (newEntry)
b. getEntry (position)
c. clear()
d. isEmpty()

data-structures-and-algorithms

d. isEmpty()

Answer the following statements true (T) or false (F)

in Computer Science & Information Technology

In both implementations of the class stack, the pop methods returned a value of type bool.

data-structures-and-algorithms

True

The private members of a superclass can be accessed by a subclass.

in Computer Science & Information Technology

Answer the following statement true (T) or false (F)

data-structures-and-algorithms

False

Can a logarithmic algorithm O(log n) outperform a linear algorithm O(n)?

in Computer Science & Information Technology

a. Yes, for a large enough problem size
b. Yes, for a small problem size
c. Yes, for sorted input data
d. Yes, for duplicate input data

data-structures-and-algorithms

a. Yes, for a large enough problem size

To place a node in the left of a BorderPane p, use ___________.

in Computer Science & Information Technology

a.    p.setEast(node);
b.    p.placeLeft(node);
c.    p.setLeft(node);
d.    p.left(node);

data-structures-and-algorithms

Which of the following operators are right-associative.

in Computer Science & Information Technology

a. *
b. + (binary +)
c. %
d. &&
e. =

data-structures-and-algorithms

e Assignment operators including augmented assignment operators are right-associative. The correct answer is E.

When is the bubble sort algorithm possible to use in practice?

in Computer Science & Information Technology

a. When the data is partially sorted
b. When the data is completely sorted
c. When the data list has no duplicate elements
d. When the data list has 0 elements

data-structures-and-algorithms

a. When the data is partially sorted

Suppose you enter 34.3 57.8 789, then press the ENTER key. Analyze the following code. Scanner input = new Scanner(System.in); int v1 = input.nextInt(); int v2 = input.nextInt(); String line = input.nextLine();

in Computer Science & Information Technology

a.    After the last statement is executed, v1 is 34.
b.    The program has a runtime error because 34.3 is not an integer.
c.    After the last statement is executed, line contains characters '7', '8', '9', '\n'.
d.    After the last statement is executed, line contains characters '7', '8', '9'.

data-structures-and-algorithms

b See discussions in Section 12.11.3.

Consider a hash table of size 500, and the hash function is i^3 mod 500. Which location is the key 1234 mapped to?

in Computer Science & Information Technology

a. 404
b. 4
c. 500
d. 904

data-structures-and-algorithms

a. 404

Applets do not have titles.

in Computer Science & Information Technology

Answer the following statement true (T) or false (F)

data-structures-and-algorithms

True

If a linked list is empty, the statement head.getNext() will throw a(n) ______.

in Computer Science & Information Technology

a)    IllegalAccessException
b)    ArithmeticException
c)    IndexOutOfBoundsException
d)    NullPointerException

data-structures-and-algorithms

The traditional C++ approach to error handling uses a function to return a specific value to indicate specific operations.

in Computer Science & Information Technology

Answer the following statement true (T) or false (F)

data-structures-and-algorithms

True

In a sequential search, you search an array starting from the middle component.

in Computer Science & Information Technology

Answer the following statement true (T) or false (F)

data-structures-and-algorithms

False

Objects and class methods may be stored in a list.

in Computer Science & Information Technology

Answer the following statement true (T) or false (F)

data-structures-and-algorithms

False

The while statement is a general repetition statement.

in Computer Science & Information Technology

Answer the following statement true (T) or false (F)

data-structures-and-algorithms

True

The << and >> operators are called shift operators because:

in Computer Science & Information Technology

A. they shift the bits in a register
B. they can shift around from one operand to another one
C. they shift a data type to a different data type
D. they shift the location from regular RAM memory to heap memory

data-structures-and-algorithms

____ are any set of conditions a function requires to be true if it’s to operate correctly.

in Computer Science & Information Technology

a. Postconditions
b. Preconditions
c. Sentinels
d. Prototypes

data-structures-and-algorithms

b. Preconditions

The sequential search algorithm uses a(n) ____ variable to track whether the item is found.

in Computer Science & Information Technology

A. int
B. bool
C. char
D. double

data-structures-and-algorithms

Answer: B

LIFO means:

in Computer Science & Information Technology

A. the last element that comes out is the first one to go in
B. the last element to go in is the first element to come in
C. the last element to go in is the first element to come out
D. the last element that comes in is the first one to go in

data-structures-and-algorithms

To improve readability and maintainability, you should declare _________ instead of using literal values such as 3.14159.

in Computer Science & Information Technology

a.    variables
b.    methods
c.    constants
d.    classes

data-structures-and-algorithms

c A constant gives a literal a descriptive name and makes the code more readable.

A(n) ____-controlled while loop uses a bool variable to control the loop.

in Computer Science & Information Technology

A. counter
B. sentinel
C. flag
D. EOF

data-structures-and-algorithms

Answer: C

Because an AVL tree is a binary search tree, the search algorithm for an AVL tree is the same as the search algorithm for a binary search tree.

in Computer Science & Information Technology

Answer the following statement true (T) or false (F)

data-structures-and-algorithms

True

Which statement is true about Python syntax?

in Computer Science & Information Technology

A. a code block must begin with a left brace
B. each code statement must end with a semicolon
C. white space is ignored
D. blocks of code are indicated by indentation

data-structures-and-algorithms

Answer: D

What do you do if you remove a node from a tree in an array-based implementation?

in Computer Science & Information Technology

a. assign it to nullPtr
b. nothing, leave it as is, just don’t link anything to it
c. remove it from the array
d. add it to the free list

data-structures-and-algorithms

d. add it to the free list

Answer the following statements true (T) or false (F)

in Computer Science & Information Technology

1. In the class BinaryNodeTree, the public traversal methods each call a protected method that performs the actual recursion.
2. A reference parameter in a protected method does not allow the client code to modify the parameter.
3. In the class BinaryNodeTree, the methods that use the parameter visit can modify the tree’s data, but not its structure.
4 A binary search tree is a binary tree.
5. The postorder traversal of a binary search tree will visit the tree’s data items in sorted order.

data-structures-and-algorithms

1. True
2. False
3. True
4. True
5. False

The ADT binary tree is position-oriented.

in Computer Science & Information Technology

What will be an ideal response?

data-structures-and-algorithms

True.

When one control statement is located within another, it is said to be a controlled statement.

in Computer Science & Information Technology

Answer the following statement true (T) or false (F)

data-structures-and-algorithms

False

A(n) ______ is a balanced binary search tree.

in Computer Science & Information Technology

1) 2-3 tree

2) 2-3-4 tree

3) red-black tree

4) n-ary tree

data-structures-and-algorithms

The answer is:

3) red-black tree

The initializing list of a for statement cannot be used to both declare and initialize the counter variable and other variables used within the for loop.

in Computer Science & Information Technology

Answer the following statement true (T) or false (F)

data-structures-and-algorithms

False

A loop ____________________ is a set of statements that remains true each time the loop body is executed.

in Computer Science & Information Technology

Fill in the blank(s) with the appropriate word(s).

data-structures-and-algorithms

invariant

A destructor’s name is a(n) ? followed by the class name.

in Computer Science & Information Technology

a. ^
b. $
c. @
d. ~

data-structures-and-algorithms

d. ~

For defining palindromes, why is it not enough to use just the empty string as a base case?

in Computer Science & Information Technology

What will be an ideal response?

data-structures-and-algorithms

If a string has an odd length, we will eventually get down to the case of a string of length 1, which should also be a base case because it is a trivial palindrome.

Which of the following is listed in the chapter as a basic operation performed on a queue?

in Computer Science & Information Technology

A. push
B. pop
C. isEmptyQueue
D. top

data-structures-and-algorithms

Answer: C

What are the three methods that a class that implements the Iterator interface must provide?

in Computer Science & Information Technology

What will be an ideal response?

data-structures-and-algorithms

The three methods are next(), hasNext(), and remove().

Which of the following statements regarding abstract methods is false?

in Computer Science & Information Technology

a. An abstract class can have instances created using the constructor of the abstract class.
b. An abstract class can be extended.
c. A subclass of a non-abstract superclass can be abstract.
d. A subclass can override a concrete method in a superclass to declare it abstract.
e. An abstract class can be used as a data type.

data-structures-and-algorithms

a A is wrong because you cannot create an instance using the contructor from an abstract class.

The definition PayRecord employee[10]; constructs an array of ten elements, each of which is a structure of the data type ____.

in Computer Science & Information Technology

A. PayRecord
B. integer
C. employee
D. void

data-structures-and-algorithms

Answer: A

When designing an array based implementation of an ADT List, which of the following are not specified as private?

in Computer Science & Information Technology

a. items
b. itemCount
c. clear()
d. maxItems

data-structures-and-algorithms

c. clear()

What is an axiom?

in Computer Science & Information Technology

What will be an ideal response?

data-structures-and-algorithms

An axiom is a mathematical rule.

What is a border with respect to prefix and suffix?

in Computer Science & Information Technology

a. A border is both a proper prefix and a proper suffix
b. The border prefix and suffix identify the start and end of the string text T
c. The border prefix and suffix are used for rehashing in the hash table
d. The border prefix and suffix uniquely determine each state

data-structures-and-algorithms

a. A border is both a proper prefix and a proper suffix

A one-dimensional array is a list of related values with the same ____ that is stored using a single group name.

in Computer Science & Information Technology

A. size
B. data type
C. value
D. offset

data-structures-and-algorithms

Answer: B

A class is an example of a structured data type.

in Computer Science & Information Technology

Answer the following statement true (T) or false (F)

data-structures-and-algorithms

True

In a selection sort, a list is sorted by selecting elements in the list, one at a time, and moving them to their proper positions.

in Computer Science & Information Technology

Answer the following statement true (T) or false (F)

data-structures-and-algorithms

True

A(n) ____________________ data type allows negative values to be stored as well as zero and positive values.

in Computer Science & Information Technology

Fill in the blank(s) with the appropriate word(s).

data-structures-and-algorithms

signed

The postfix expression 3 5 + 2 ; 6 - = will generate an error, because it ____.

in Computer Science & Information Technology

A. contains an illegal operator
B. does not have enough operands
C. has too many operands
D. has too many operators

data-structures-and-algorithms

Answer: A

What is the box trace?

in Computer Science & Information Technology

What will be an ideal response?

data-structures-and-algorithms

The box trace is a systematic way to trace the actions of a recursive method.

To reduce the probability of collisions with hashes, you can decrease the array length.

in Computer Science & Information Technology

Answer the following statement true (T) or false (F)

data-structures-and-algorithms

False

What is the stopping condition of the quick sort algorithm?

in Computer Science & Information Technology

a. When no elements can be moved
b. When the data input list is sorted
c. When the end of the array is reached
d. When the array is of zero length

data-structures-and-algorithms

a. When no elements can be moved

If vertices u and v are in different trees of the depth-first forest, then u and v must not be connected.

in Computer Science & Information Technology

a. True
b. False

data-structures-and-algorithms

b. False

If the integer’s address is stored in a pointer, typically only ____ bytes of storage are retrieved when the address is used.

in Computer Science & Information Technology

a. two
b. three
c. four
d. eight

data-structures-and-algorithms

c. four

The time it takes to serve a customer is the ____.

in Computer Science & Information Technology

A. transaction time
B. flight time
C. request time
D. service time

data-structures-and-algorithms

Answer: A

How is a hash collision resolved?

in Computer Science & Information Technology

a. It depends upon the hash function used
b. The hash function recursively rehashes the key
c. A hash function traverses the array
d. A hash function deletes the existing key and value

data-structures-and-algorithms

a. It depends upon the hash function used

One reason to pass a parameter by const reference is:

in Computer Science & Information Technology

A. we do not want the function to change the values of any data members
B. we want changes in the parameter to be reflected back to the calling function
C. we want to constantly use pass by reference
D. the compiler will catch an attempt to change the value of the parameter

data-structures-and-algorithms

The ______ method of the ADT stack retrieves and then removes the top of the stack.

in Computer Science & Information Technology

a)    createStack
b)    push
c)    pop
d)    peek

data-structures-and-algorithms

Find your answers, solutions and more...

We made it much easier for you to find exactly what you're looking for on Sciemce. Enjoy our search engine "Clutch."

Save a GPA. Donate your notes with us.

Quiz Fall 3/ Computer Science & Information Technology - Data Structures And Algorithms

Recent Packs