QUESTION 19 Consider the following interface: public interface SalesTax { public double rate = 6.5; Which of the following statements in true? O The declaration of the getRate () method is missing O rate should be declared as private rate is a constant and cannot be modified It cannot be extended by other interfaces QUESTION 20 Assume the following values are inserted into a binary search tree (from left to right): 40, 62, 15, 5, 66, 17, 9, 53 What is the result of a Post-Order traversal of the resulting tree? O 9, 5, 17, 53, 66, 62, 15, 40 9, 5, 17, 53, 66, 15, 62, 40 O 9, 5, 17, 15, 53, 66, 62, 40 O 9, 5, 17, 15, 40, 62, 53, 66 QUESTION 21 A queue contains the following integer values: front -> [4]. [7] What would the queue look like after the following operations? enqueue (3), enqueue (10), dequeue (), peek (), enqueue (6), dequeue () O 13]. [10], [6] [3]. [6]. [10] O [3]. [4]. [7] O [10]. [6]

QUESTION 19 Consider the following interface: public interface SalesTax { public double rate = 6.5; Which of the following statements in true? O The declaration of the getRate () method is missing O rate should be declared as private rate is a constant and cannot be modified It cannot be extended by other interfaces QUESTION 20 Assume the following values are inserted into a binary search tree (from left to right): 40, 62, 15, 5, 66, 17, 9, 53 What is the result of a Post-Order traversal of the resulting tree? O 9, 5, 17, 53, 66, 62, 15, 40 9, 5, 17, 53, 66, 15, 62, 40 O 9, 5, 17, 15, 53, 66, 62, 40 O 9, 5, 17, 15, 40, 62, 53, 66 QUESTION 21 A queue contains the following integer values: front -> [4]. [7] What would the queue look like after the following operations? enqueue (3), enqueue (10), dequeue (), peek (), enqueue (6), dequeue () O 13]. [10], [6] [3]. [6]. [10] O [3]. [4]. [7] O [10]. [6]

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Each of the iterators must implement the java.util.Iterator interface by providing the two public methods hasNext () and next(). The Iterator interface also lists two additional methods, remove () and forEachRemaining (). These are marked as default, so the interface itself does not require implementation. Of these methods, this assignment only requires you to implement the remove () method of the linked list iterator. 1 ArrayList iterator This is an external iterator, meaning it is a public class named ICS211ArrayListIterator, and and the code is not part of the ArrayList class. Your ICS211ArrayListIterator class should have a constructor ICS211ArrayListIterator(java.util.ArrayList gives access to all the elements of the array list. This array must be saved as the value of a class variable of the iterator. data). The constructor must call one of the two toArray methods of ArrayList to obtain an array that Other than this single call to java.util.ArrayList.toArray in the constructor,…
7. Given a Queue Q, write a non-generic method that finds the maximum element in the Queue. You may use only queue operations. No other data structure can be used other than queues. The Queue must remain intact after finding the maximum value. Assume the class that has the findMax method implements Comparable. The header of the findMax method: public Comparable findMax(Queue q)
Assume class MyStack implements the following StackGen interface. For this question, make no assumptions about the implementation of MyStack except that the following interface methods are implemented and work as documented. Write a public instance method for MyStack, called interchange(T element) to replace the bottom "two" items in the stack with element. If there are fewer than two items on the stack, upon return the stack should contain exactly two items that are element.
Why shouldn't assembly language be used for creating general-purpose programs? Do you believe there are any circumstances in which assembly language should be used?
In Java. The following is a class definition of a linked list Node:class Node{int info;Node next;}Show the instructions required to create a linked list that is referenced by head and stores in order, the int values 13, 6 and 2. Assume that Node's constructor receives no parameters.
1. Show the ListStackADT<T> interface 2. Create a ListStackDataStrucClass<T> with the following methods: defaultconstructor, overloaded constructor, copy constructor, getTop, setTop,isEmpty, ifEmpty (if empty throw the exception), push, peek, pop, toString. 3. Create a private inner class of ListStack<T> called StackNode<T> with thefollowing methods: default constructor, overloaded constructor, copyconstructor, getValue, getNext, setValue, setNext 4. Create a BaseConverter class (non-generic) with the following methods: defaultconstructor, inputPrompt, convert [converts a BaseNumber to a convertedString], convertAll [instantiate a String object] , toString, processAndPrint 5. Create a private inner class BaseNumber. The inner class has the following methods: default constructor, overloaded constructor, getNumber, getBase,setNumber, setBase. [Make your private instance variables in the inner classLong type]. 6. Create a BaseConverterDemo class that only…
Explain why the code below does not run when using the test driver shown in screen shot. i also included the LLNode class and collectioninterface interface public class LinkedCollection<T> implements CollectionInterface<T> { protected LLNode<T> head; // head of the linked list protected int numElements = 0; // number of elements in this collection // set by find method protected boolean found; // true if target found, else false protected LLNode<T> location; // node containing target, if found protected LLNode<T> previous; // node preceding location public LinkedCollection() { numElements = 0; head = null; } public boolean add(T element) // Adds element to this collection. { LLNode<T> newNode = new LLNode<>(element); newNode.setLink(head); head = newNode; numElements++; return true; } protected void find(T target) // Searches the collection for an…
1. Goals and Overview The goal of this assignment is to practice creating a hash table. This assignment also has an alternative, described in Section 5. A hash table stores values into a table (meaning an array) at a position determined by a hash function. 2. Hash Function and Values Every Java object has a method int hashCode() which returns an int suitable for use in a hash table. Most classes use the hashCode method they inherit from object, but classes such as string define their own hashCode method, overriding the one in object. For this assignments, your hash table stores values of type public class HashKeyValue { K key; V value; } 3. Hash Table using Chained Hashing Create a hash table class (called HashTable211.java) satisfying the following interface: public interface HashInterface { void add(K key, V value); // always succeeds as long as there is enough memory V find (K key); // returns null if there is no such key } Internally, your hash table is defined as a private…