Question 1Which of the following are regular files and directory files contained in the JAR filethat is provided with the HWO5 starter code? When listing the contents of the JARfile, you can ignore any differences in capitalization of the filenames if you noticeany.C cs1302/adt/StringList.classC cs1302/adt/Node.classMETA-INF/MANIFEST.MECcs1302/adt/Stringlist.javaC cs1302/C META-INF/C cs1302/adt/LinkedListDriverpackage cs1302.listadt;public class Driver {public static void main (String[] args) {Node node = new Node ("Tom");node.setItem ("Susan") ;node.setNext (new Node ("Sally"));node.getNext (). setNext (new Node ("Barry"));Node end = new Node ("Supa Mike", node);Node n = node.getNext () ;n.setNext (new Node ("Simon"));System.out.println (end.getNext ());// Output1System.out.println (node.getNext ().getitem ()); //Output 2System.out.println (n.getNext ().getNext ());// output3System.out.println (n.getNext ().getItem ());//Output 4} // main} // DriverQuestion 2Which of the following statements about the code above are true? Select all thatapply. You can assume that the Node class is the same one used in the HW05 JARfile. In fact, you can compile and run this code to check your answers as long as youadd the JAR file to the classpath.| The line marked Output 3 will print null when the code is executed.|The line marked Output 4 will print simon when the code is executed.| The line marked output 1 will print null when the code is executed.| The line marked Output 2 will print Sally when the code is executed.

A linked list is a linear data structure, in which the elements are not stored at contiguous memory…

Answered: Question 2 Which of the following…

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

The PostfixEvaluator class uses the java.util.Stack class to create thestack attribute. The java.util.Stack class is one of two stack implementationsprovided by the Java Collections API. We revisit the other implementation, theDeque interface, in Chapter 13.The evaluate method performs the evaluation algorithm described earlier, supported by the isOperator and evalSingleOp methods. Note that in the evaluatemethod, only operands are pushed onto the stack. Operators are used as they areencountered and are never put on the stack. This is consistent with the evaluation algorithm we discussed. An operand is put on the stack as an Integer object, insteadof as an int primitive value, because the stack collection is designed to store objects.When an operator is encountered, the two most recent operands are poppedoff the stack. As mentioned above, the first operand popped is actually the secondoperand in the expression and that the second operand popped is the first operandin the expression.…
What are the fundamental operations of a linked list and the main advantage of a linked list over an array? Test program LinkedList.java, and make sure that you understand each operation in the program. (refer to linkedListApplication.java). In this code which part I will keep main.java file and which part I will keep LinkedList.java.java file. Because I will use main.java IDE. Otherwise my program doesn't run. import java.util.*; public class LinkedList{ public Node header; public LinkedList() { header = null; } public final Node Search(int key) { Node current = header; while (current != null && current.item != key) { current = current.link; } return current; } public final void Append(int newItem) { Node newNode = new Node(newItem); newNode.link = header; header = newNode; } public final Node Remove() { Node x = header; if (header != null) {…
I have been posting the same questions but they always come with the same answer that does not use the starting code given below. Please make sure to use the following code as a starting point. Also, please make sure to use the same class name so that I don't get confused. Please use the information in the screenshot to create a class called BST. The base of the code is given below. Base of class Node public class Node {int key;Node left, right, parent; public Node() {} public Node(int num) {key = num;left = null;right = null;parent = null;}} Base of class BST import java.util.*; class BST {// do not change thisprivate Node root;private ArrayList<Integer> data; // DO NOT MODIFY THIS METHODpublic BST() {root = null;data = new ArrayList<Integer>(0);} // DO NOT MODIFY THIS METHODpublic ArrayList<Integer> getData() {return data;} // DO NOT MODIFY THIS METHODpublic void inOrderTraversal() {inOrderTraversal(root);} // DO NOT MODIFY THIS METHODprivate void…
This is Java project!
Hello, I request for help with the attached problems. Thanks a lot !
Hello I need help creating " A TO DO LIST" code in java for an interactive test driver . Your interactive test driver loop will allow users to: Add a task. This will require you to capture the subject, priority, and dueDate. Here are some tips on using Java LocalDates. Use now() for the startDate. TaskId should start at 1 and increment each time a task is added. View the next task in the queue using the peek() method and then optionally complete the current task using the poll() method. View a list of all tasks. This will require the use of an iterator and the peek() method on each element. Use isEmpty() to check if there are items in your queue and if not, display "No tasks in queue." View a single task by id. This will require iterating the task list until the id is found and then displaying it. Remove a task by id. This will require you to iterate through the Task queue until you find the task with the matching id. Use remove(task) and confirm to the user that the…
Can someone help me with this question?? It will be highly appreciatedted
For this assignment, your program will read characters from a string for the purpose of assigning data from that string to the private data members of a class. This simulates a program that would read a record in from a stored file into memory for the purpose of making changes to that record. Below is a template of your program. For this assignment, you MUST use loops (100 pts off if not using loops) and you cannot use the following methods: indexOf() substring() subsequence().
One common use of a hash table is to build a glossary, or dictionary, of terms.In this section, we demonstrate one way to use a hash table for just such ause—a computer terms glossary.The program works by first reading in a set of terms and definitions from atext file. This process is coded in the BuildGlossary subroutine. The structureof the text file is: word,definition, with the comma being the delimiter betweena word and the definition. Each word in this glossary is a single word, but theglossary could easily work with phrases instead. That’s why a comma is usedas the delimiter, rather than a space. Also, this structure allows us to use theword as the key, which is the proper way to build this hash table.Another subroutine, DisplayWords, displays the words in a list box so theuser can pick one to get a definition. Since the words are the keys, we can usethe Keys method to return just the words from the hash table. The user canthen see which words have definitions.To retrieve a…
You should create a method and call it findTotalleaves (); this method will find all of the nodes that are considered to be leaves, which are nodes that do not have any BNode dependents. The public function must not take any arguments, but the private method must accept as a parameter a BNode that represents the current root.
Use for loops to print a diamond like the one below. Allow the user to specify how high the diamond should be. *** ***** Your answer should be a Colab shared file. You only need to turn in the LINK and change the sharing option so that I can access and run the code. Any solution that can not be accessed will be ignored.
NOTE: Do Not Copy From Another Cheggers Need Correct output and source code Direction: 1. Show the ListStackADT<T> interface 2. Create a ListStackDataStrucClass<T> with thefollowing methods: default constructor, 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 the following methods: default constructor, overloaded constructor, copy constructor, getValue, getNext, setValue, setNext 4. Create a BaseConverter class (non-generic) with the following methods: default constructor, inputPrompt, convert [converts a BaseNumber to a converted String], 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…

SEE MORE QUESTIONS

Recommended textbooks for you

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

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

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

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

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

C How to Program (8th Edition)

Computer Science

ISBN:

9780133976892

Author:

Paul J. Deitel, Harvey Deitel

Publisher:

PEARSON

Database Systems: Design, Implementation, & Manag…

Computer Science

ISBN:

9781337627900

Author:

Carlos Coronel, Steven Morris

Publisher:

Cengage Learning

Programmable Logic Controllers

Computer Science

ISBN:

9780073373843

Author:

Frank D. Petruzella

Publisher:

McGraw-Hill Education

SEE MORE TEXTBOOKS