Archives

The inheritance relationship is indicative of one class being from or being a child of the other class. The _____________ relationship represents a class implementing an interface. A. Implementation B. Aggregation C. Inheritance D. Interface One purpose of inheritance is […]

An abstraction hides details. A good abstraction hides the right details at the right time so that we can manage __________. A. Capacity Each _______ clause on a try statement handles a particular kind of exception that may be thrown […]

The degree to which software adheres to its specific requirements is called ___________ refers to the ability to easily move software from one system to another. A. Correctness B. Reliability C. Robustness D. Portability Issues related to the interaction between […]

A binary search tree is a binary tree with the added property that the left child is less than the parent, which is less than or equal to the ___________. A. Left child The definition of a binary search tree […]

A minheap is a complete binary tree in which each node is less than or equal to both the left child and the right child. D. Binary search tree A minheap stores its smallest element at the ________ of the […]

A _________ search tree can have more than two children per node and can store more than one element in each node. D. None of the above A _____ tree contains nodes that contain either one or two elements and […]

An undirected graph is a graph where the pairings representing the edges are _____________. D. None of the above Two vertices in a graph are ___________ if there is an edge connecting them. A. Connected B. Adjacent C. Ordered D. […]

In hashing, elements are stored in a hash table, with their _________ in the table determined by a hashing function. A. Order The situation where two elements or keys map to the same location in the table is called a […]

A _________ is a nonlinear collection in which there is essentially no inherent organization to the elements in the collection. D. Stack The implementation of the collection operations should not affect the way users _____________ the collection. A. implement B. […]

What is the order of the following growth function? t(n)= 5nlogn + 20n – 4 A. The following code segment has ______ time complexity? for(int i = 0; i < n; i++){ for(int j = 0; j < n: j=j*2){ […]

What is the principle difference in behavior between a stack and a queue? D. a stack preserves order whereas a queue reverses order Stacks operate as _______________. A. Last Out, First In B. First In, First Out C. Last In, […]

A data structure that uses object reference variables to create links between D. Array What is the principle difference in behavior between a stack and a queue? A. a stack reverses order whereas a queue preserves order B. a stack […]

Which of the following operations of a queue examines the element at the front of the queue? A) Enqueue What is the principle difference in behavior between a stack and a queue? A. a stack reverses order whereas a queue […]

List collections can be categorized as ______, ________, or __________. D. None of the above The elements of an _____________ have an inherent relationship defining their order. A. Ordered list B. Unordered list C. Indexed list D. None of the […]

Any recursive definition must have a non-recursive part, called the ___________, which permits the recursion to eventually end. D. first case Recursion is a programming technique in which a ________ calls itself. A. program B. method C. variable D. parameter […]

__________ is the process of arranging a list of items into a defined order based on some criteria. A) searching What type does “compareTo” return? A) int B) String C) boolean D) char Which of these have the smallest time […]

1 A collection where each node can have from 0 to 2 children is called a ___________. A. Stack A node that does not have a parent is called the ______ of a tree. A. foot B. root C. leaf […]

Maintainability – Computer systems and software systems must evolve to meet ever- changing requirements. One of the more interesting recent examples is the turn of the century. Many existing systems required maintenance to update the date fields to handle dates […]

While the traversalQueue is not empty { remove the first element from the traversalQueue and add it to the resultList if it has children, add those children to the traversalQueue } return the resultList The answer to this question will […]

Answer on following page. Java Software Solutions, 4th Edition Exercise Solutions, Ch. 11 Chapter 11 Exercise Solutions EX 11.1. Draw the binary search tree that results from adding the following integers (34 45 3 87 65 32 1 12 17). […]

Java Software Structures, 4th Edition Exercise Solutions, Ch. 12 Chapter 12 Exercise Solutions EX 12.1 Draw the heap that results from adding the following integers (34 45 3 87 65 32 1 12 17). 17 87 3265 34 45 1 […]

©2014 Pearson Education, Inc. Upper Saddle River, NJ. All Rights Reserved. efficient, strategy for a set. The add method would check for duplicates and only add unique items. Otherwise, most operations could come directly from the list implementation. However, the […]

This exercise solution is not provided at this time. Java Software Structures, 4th Edition Exercise Solutions, Ch. 14 Chapter 14 Exercise Solutions EX 14.1. Draw the 2-3 tree that results from adding the following elements into an initially empty tree: […]

1, 4, 6, 7, 3, 2, 1 1, 4, 6, 5, 7, 3, 2, 1 2, 4, 7, 3, 2 2, 4, 6, 7, 3, 2 2, 4, 6, 5, 7, 3, 2 4, 6, 7, 4 4, 6, 5, […]

b. 10n3 – 7 O(n3) c. 2n + 100n3 O(2n) d. n2 log n O(n2 log n) 10n2 + 100n + 1000 Most efficient: n2 log n For n = 1,000,000: Least efficient: 2n + 100n3 10n3 – 7 n2 […]

There are more than 25 classes that implement the Collection interface in the Java Collections API. This text covers stacks, queues, binary search trees, heaps, priority queues, graphs, and hash tables. Most of these collections are also represented in the […]

newly added node, we will lose the entire list. The newly added node’s next reference will simply point to itself. newly added node, we will lose everything after the newly added node. The newly added node’s next reference will simply […]

8 1 2 8 1 5 2 8 1 3 5 2 8 1 3 5 2 8 4 3 5 2 8 9 4 3 5 2 8 8. Additionally, we need to store the returned value if we […]

Java Software Structures, 4th Edition Exercise Solutions, Ch. 6 Chapter 6 Exercise Solutions EX 6.1. Hand trace an ordered list X through the following operations. An ordered list keeps the items in order no matter when they are added. So […]

System.out.println(pupil); For this code to work, the class that defines the object referenced by role must implement the Iterable interface. while (itr.hasNext()) System.out.println(itr.next()); accnt.addInterest(); For this code to work, the class that defines the object referenced by accounts must implement […]

or a: Letter followed by a Java-Identifier-Substring A Java-Identifier-Substring is a: Letter or a: Digit or a: Letter followed by a Java-Identifier-Substring xy = x + xy-1 for y > 1 i * j = j + (i-1) * j […]

exhaust all possibilities, whereas a binary search will determine that the target is not in the list after three comparisons. A linear search will find the value 54 in the list in five comparisons, and a binary search finds it […]