QUESTION 9 A given file can only be opened once per program -- you cannot close it and open again until after your program terminates. True False QUESTION 10 You need to store a list of players on a team so that you can look them up by number. The numbers are small and unique to each player, and neither the players nor their numbers change often. Should you use an ArrayList or a LinkedList? Linked List O ArrayList It doesn't matter in this case.

QUESTION 9 A given file can only be opened once per program -- you cannot close it and open again until after your program terminates. True False QUESTION 10 You need to store a list of players on a team so that you can look them up by number. The numbers are small and unique to each player, and neither the players nor their numbers change often. Should you use an ArrayList or a LinkedList? Linked List O ArrayList It doesn't matter in this case.

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

Linked lists may be stored in memory using either static arrays or dynamically allotted memory sections. What is unique about each tactic?
The below code declares a new Vector named 'vec'. What is the size of the vector at the end of the execution? Vector vec = new Vector(); for(int i=1;i<=10; i++) { vec.addElement(i); } vec.removeElement(9); vec.removeElement(10); vec.removeElement(11);
QUESTION 11 You need to store a list of messages so that the most recently-added message is always first. Should you use an ArrayList or a LinkedList? It doesn't matter in this case. Linked List ArrayList QUESTION 12 You need to store a collection of employees in a big company so that you can look them up by name. Should you use an List, a Map, or or a Set? O It doesn't matter in this case. List Set Map
Scanner sc = new Scanner(System.in);ArrayList <Student> students = new ArrayList<Student>();ArrayList <Student> courses = new ArrayList<Student>();// Method to read the file contents and stores it in// instance arraysvoid readStudents(){// Scanner class object declaredScanner readStuF = null;// try block beginstry{// Opens the file for readingreadStuF = new Scanner(new File("student.txt"));// Loops till end of the file to read recordswhile(readStuF.hasNextLine()){ String stu = readStuF.nextLine();String []eachStu = stu.split(" ");students.add(new Student(eachStu[0], eachStu[1],eachStu[2], Long.parseLong(eachStu[3]),Integer.parseInt(eachStu[4]), Integer.parseInt(eachStu[5]),Integer.parseInt(eachStu[6])));}// End of while loop }// End of try block// Catch block to handle file not found exceptioncatch(FileNotFoundException fe){System.out.println("\n ERROR: Unable to open the file for reading.");}// End of catch block // Close the filereadStuF.close();}// End of…
Vectors are synchronized while ArrayLists are not. Group of answer choices True False
A business that sells dog food keeps information about its dog food products in a linked list. The list is named dogFoodList. (This means dogFoodList points to the first node in the list.) A node in the list contains the name of the dog food (a String), a dog food ID (also a String) and the price (a double.) a.) Create a class for a node in the list. b.) Use this class to write pseudocode or Java for a public method that prints the name of all dog foods in the list where the price is more than $20.00.
You are going to implement a program that creates an unsorted list by using a linked list implemented by yourself. NOT allowed to use LinkedList class or any other classes that offers list functions. It is REQUIRED to use an ItemType class and a NodeType struct to solve this homework. The “data.txt” file has three lines of data 100, 110, 120, 130, 140, 150, 160 100, 130, 160 1@0, 2@3, 3@END You need to 1. create an empty unsorted list 2. add the numbers from the first line to list using putItem() function. Then print all the current keys to command line in one line using printAll(). 3. delete the numbers given by the second line in the list by using deleteItem() function. Then print all the current keys to command line in one line using printAll().. 4. putItem () the numbers in the third line of the data file to the corresponding location in the list. For example, 1@0 means adding number 1 at position 0 of the list. Then print all the current keys to command line in one…
Linked List, create your own code. (Do not use the build in function or classes of Java or from the textbook). Create a LinkedList class: Call the class MyLinkedList, (hint) Create a second class called Node.java and use it, remember in the class I put the Node class inside the LinkedList Class, but you should do it outside. This class should haveo Variables you may need for a Node,o (optional) Constructor Your linked list is of an int type. (you may do it as General type as <E>) For this Linked List you need to have the following methods: add, addAfter, remove, size, contain, toString, compare, addInOrder. This is just a suggestion, if you use Generic type, you must modify this Write a main function or Main class to test all the methods,o Create a 2 linked list and test all your methods. (Including the compare)
Given the IntNode class, define the getCount() method in the CustomLinkedList class that returns the number of items in the list not including the head node. Ex: If the list contains: head -> 14 -> 19 -> 4 getCount(headObj) returns 3. Ex: If the list contains: head -> getCount(headObj) returns 0. public class IntNode { private int dataVal; // Node data private IntNode nextNodePtr; // Reference to the next node // Default constructor public IntNode() { dataVal = 0; nextNodePtr = null; } // Constructor public IntNode(int dataInit) { this.dataVal = dataInit; this.nextNodePtr = null; } // Constructor public IntNode(int dataInit, IntNode nextLoc) { this.dataVal = dataInit; this.nextNodePtr = nextLoc; } /* Insert node after this node. Before: this -- next After: this -- node -- next */ public void insertAfter(IntNode nodeLoc) { IntNode tmpNext; tmpNext = this.nextNodePtr;…
in Jave create a method work() with the follow instructions: If the work() method is passed a non-null then it must return a new List that contains some or all of the elements in data. The elements of the new List must be aliases for (not copies of) the objects in the List it is passed. If there are no sign attributes (i.e., the array is null or has 0 elements) then the work() method must return an empty List. If any of the conditions represented by the sign attribute holds for a particular element that that element must be included in the result (i.e., the conditions must be combined using a logical OR). The elements in the returned List must be in the same order they appeared in the original List (though not all elements must be in the result). public List<T> work(List<T> g){
Select all answers that apply. In which of the following scenarios is using a vector less efficient than using a list? O A program that frequently needs to access elements throughout the the container O A program that needs to add a large number of elements to the beginning of the container A program that adds a fixed number of elements and then repeatedly removes the first element O A program that frequently adds elements, but only to the end of the container
write a program for a library automation which gets the isbn number, name, author and publication year of the books in the library. the status will be filled by the program as follows: if publication year before 1985 the status is reference else status is available, the information about the books should be stored inside a linked list. the program should have a menu and the user inserts, displays, and deletes the elements from the menu by write a selecting options. the following data structure should be used. struct list char isbn[ 20 ]: char namei 20 ]. char authori 20 ]: int year; char status[200j: struct list "next, jinfo, wedoad n un posn ag pinogs nuu sulnogoj l press 1. to insert a book press 2. to display the book list press 3. to delete a book from list