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)
Make a doubly linked list and apply all the insertion, deletion and search cases. The node willhave an int variable in the data part. Your LinkedList will have a head and a tail pointer.Your LinkedList class must have the following functions: 1) insert a node1. void insertNodeAtBeginning(int data);2. void insertNodeInMiddle(int key, int data); //will search for keyand insert node after the node where a node’s data==key3. void insertNodeAtEnd(int data);2) delete a node1. bool deleteFirstNode(); //will delete the first node of the LL2. bool deleteNode(int key); //search for the node where its data==keyand delete that particular node3. bool deleteLastNode(); //will delete the last node of the LL3) Search a node1. Node* searchNodeRef(int key); //will search for the key in the datapart of the node2. bool searchNode(int key); The program must be completely generic, especially for deleting/inserting the middle nodes. Implement all the functions from the ABOVE STATEMENTS and make a login and…
java
1. Write linked list classes (one class for Node and another class for List), which store the items in the transaction. 2. Test the classes by printing the items in the linked list 3. Show the total price of the transaction. 4. Delete an item from the linked list and show new output (total price of the transaction). The following listing is the shmple output foryour reference: BC Items Price 10 Pagoda Gnut 110g 11 Hup Seng Cream Cracker 4.19 12 Yit Poh 2n1 Kopi-o 13 Zoelife SN & Seed 3.49 7.28 5.24 14 Gatsby S/FO Wet&Hard 15 GB W/G U/Hold 150g 16.99 6.49 Total (GST Incl.) 43,68
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…
Please fill in all the code gaps if possible: (java) public class LinkedList { privateLinkedListNode head; **Creates a new instance of LinkedList** public LinkedList () { } public LinkedListNode getHead() public void setHead (LinkedListNode head) **Add item at the front of the linked list** public void insertFront (Object item) **Remove item at the front of linked list and return the object variable** public Object removeFront() }
Write a Java program
The language is Java
Write the following method in Java: public void reverse() The method will reverse the linked list. Head will point to the last node of the linked list and all the pointers (addresses) will be reversed. The last node (a new head) will point to the second last node and so on. The old head node will become the tail node in the reversed LinkedList. Use the LinkedList class discussed in the video lecture and write the reverse() method in the same class. Test your method in the main method. Following picture depicts the reversal of the LinkedList. NULL Head I V R I ↑ Head > NULL