public static void enterStudentid(String studentid) { int locator=0; for(int check_database =0; check_database< studentDatabase.length; check_database++) { if(studentDatabase[check_database]!=nul1) { if(studentDatabase[check_database].getUofID().equals(studentid)) System.out.println("The name of student is " + studentDatabase[check_database].getFullName());

public static void enterStudentid(String studentid) { int locator=0; for(int check_database =0; check_database< studentDatabase.length; check_database++) { if(studentDatabase[check_database]!=nul1) { if(studentDatabase[check_database].getUofID().equals(studentid)) System.out.println("The name of student is " + studentDatabase[check_database].getFullName());

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

public class testRun{public static int find(int[] data, int target,int start, int end) {int[] stored = sort(data);if (start <= end) {int midPoint = (start + end / 2);if (stored[midPoint] == target) {return midPoint;}if (stored[midPoint] > target) {return find(data, target, start, midPoint - 1);//return first half,exclusive itself}if (stored[midPoint] < target) {return find(data, target, start, midPoint + 1);//return last half,exclusive itself.}}return -1;}public static int[] sort(int[] data){// Find the smallest element in the listfor (int i = 0; i < data.length -1 ; i++){ //generate the index position,not =< b/c goes outer boundint min = i; //assign index position to min in each iterationfor (int j = i + 1; j < data.length ; j++){if (data[j] < data[min]){ //if the element in the second index number smaller than// the element in previous index numbermin = j; // assign j to the smallest number}}swap (data,i,min);// data[i] = min the smallest number assign to…
LabProgram.java:8: error: class HorseDatabase is public, should be declared in a file named HorseDatabase.java public class HorseDatabase { ^ 1 error Complete the Java program to create a Horse table, insert one row, and display the row. The main program calls four methods: createConnection() creates a connection to the database.createTable() creates the Horse table.insertHorse() inserts one row into Horse.selectAllHorses() outputs all Horse rows.Complete all four methods. Method parameters are described in the template. Do not modify the main program. The Horse table should have five columns, with the following names, data types, constraints, and values: Name Data type Constraints ValueId integer primary key, not null 1Name text 'Babe'Breed text 'Quarter horse'Height double 15.3BirthDate text '2015-02-10'The program output should be: All horses:(1, 'Babe', 'Quarter Horse', 15.3, '2015-02-10')This lab uses the SQLite database…
Use C++ Programming language. The header file below defines a class for a simple hash table: hashMap.h Download hashMap.h Write a driver program to test the class with the following data: (520, "3100 Main St, Houston TX "); (37, "2200 Hayes Rd, Austin TX"); (226, "1775 West Airport St, San Antonio TX"); (273, "3322 Walnut Bend, Houston TX"); (491, "5778 Alabama, Waco TX"); (94, "3333 New St, Paris TX"); Make sure to test the find function for exiting and non-existing data 2. Modify the type of member key in class HashEntry from int to a string (this is useful is the key is e.g. the phone number or e-mail address). Use the string hash function discussed in class (see ppt notes) or search online for alternative functions that work on strings. 3. Modify the collision strategy of class HashMap to do separate chaining instead of linear probing. Be sure to modify the display function so that items in the bucket chains are also displayed in a pre-defined order…
#include <stdio.h> int arrC[10] = {0}; int bSearch(int arr[], int l, int h, int key); int *joinArray(int arrA[], int arrB[]) { int j = 0; if ((arrB[0] + arrB[4]) % 5 == 0) { arrB[0] = 0; arrB[4] = 0; } for (int i = 0; i < 5; i++) { arrC[j++] = arrA[i]; if (arrB[i] == 0 || (bSearch(arrA, 0, 5, arrB[i]) != -1)) { continue; } else arrC[j++] = arrB[i]; } for (int i = 0; i < j; i++) { int temp; for (int k = i + 1; k < j; k++) { if (arrC[i] > arrC[k]) { temp = arrC[i]; arrC[i] = arrC[k]; arrC[k] = temp; } } } for (int i = 0; i < j; i++) { printf("%d ", arrC[i]); } return arrC; } int bSearch(int arr[], int l, int h, int key) { if (h >= l) { int mid = l + (h - l) / 2; if…
C++ Complete the program that will allow the user to enter data on 10 Halloween costumes. The program will create Costume objects and then store the Costume objects in a Hash Table. The Costume ID will be the key and a pointer to the Costume object will be the value. You are given Lab7.cpp, HashEntry.h, and Costume.h and you should not have to make any changes to these files at all. You will need to write HashTable.h, which implements the HashTable class. This should NOT be a template class. Your HashTable class should resolve collisions by linear probing and should use the HashEntry class for the linkedlist nodes. Because we’re using probing, there is no removal function. This is okay for this application, since we want to keep a record of costumes that are no longer being kept in stock. ---GIVEN--- Lab.cpp #include <iostream> #include "HashTable.h" #include "Costume.h" using namespace std; int main() { int size; int key; Costume *newCostume; string name; float price;…
Java Program: There are errors in the lexer and shank file. Please fix those errors and there must be no error in any of the code at all. Below is the lexer, shank, and token files. The shank file is the main method. There is a rubric attached as well. Lexer.java import java.util.ArrayList;import java.util.HashMap;import java.util.List; import mypack.Token.TokenType; public class Lexer { private static final int INTEGER_STATE = 1;private static final int DECIMAL_STATE = 2;private static final int IDENTIFIER_STATE = 3;private static final int SYMBOL_STATE = 4;private static final int ERROR_STATE = 5;private static final int STRING_STATE = 6;private static final int CHAR_STATE = 7;private static final int COMMENT_STATE = 8; private static final char EOF = (char) -1; private static String input;private static int index;private static char currentChar;private static int lineNumber = 1;private static int indentLevel = 0;private static int lastIndentLevel = 0; private static…
inal Project In this project, you will be asked to implement a simple Java program that will maintain its data using a specific NoSQL database called MongoDB. In this program you will be asked to maintain an object called Product, each product will have the following attributes: + Product ID. + Product Name. + Product Description. + Product Price. You will be asked to implement two types of products. « Dimensional Products. * Weighted Products. For the products of type Dimensional, they will have two extra values that express the width and the length of the product stored. For the products of type Weighted, they will have one extra value that express the weight of the product stored. When the program runs, the following choices appear. 1- Show all Products. 2- Add Product. 3- Delete Product. 4- Update Product. 5- Replace Product. 6- Search Product. 7-Bxit. Enter your choice: Notes: 1- When the program starts, it should connect automatically to a Database that is called “DBCourse” and a…
describe the code in detail add comment lines package com.templatepattern; public class TemplatePatternTest1 { public static void main(String[] args) {String connectionString = "server=192.168.0.7";String username = "learner";String password = "designPatterns";StudentRegistration sr = new DatabaseBasedStudentRegistration(connectionString, username, password);System.out.println();Person p1 = new Person("patrick", "nick");System.out.println("Registering " + p1);sr.register(p1);System.out.println(); Person p2 = new Person("zayn", "nick");System.out.println("Registering " + p2);sr.register(p2);System.out.println();} } abstract class StudentRegistration {// template methodfinal Student register(Person person) {if (checkPerson(person)) {startOperation();try {int studentId = getNewIdentity(person);Student student = new Student(person, studentId);completeOperation();return student;}catch (Exception e) {cancelOperation();promptError(e.getMessage());}}else {promptError(person + " is not a valid…
Write a program that will allow a user to enter students into a database. The student information should include full name, student ID, GPA and status. The program should allow delete any student based on student ID. Program must use linked list. No vectors or arrays. C++.
Consider records for patients at a medical facility. Each record contains an integer identification for a patient and strings for the date, the reason for the visit, and the treatment prescribed. Design and implement the class PatientRecord so that it overrides the method hashCode. Write a program that tests your new class. Design a class PatientDataBase that stores instances of PatientRecord, as described above. The class should provide at least three query operations, as follows. Given a patient identification and date, the first operation should return the reason for the visit, and the second operation should return the treatment. The third query operation should return a list of dates, given a patient identification.
Consider records for patients at a medical facility. Each record contains an integer identification for a patient and strings for the date, the reason for the visit, and the treatment prescribed. Design and implement the class PatientRecord so that it overrides the method hashCode. Write a program that tests your new class. Design a class PatientDataBase that stores instances of PatientRecord, as described above. The class should provide at least three query operations, as follows. Given a patient identification and date, the first operation should return the reason for the visit, and the second operation should return the treatment. The third query operation should return a list of dates, given a patient identification. Implement the class PatientDataBase. Using a hash table to store the patient records. Write a program that demonstrates and tests this class. JAVA PROGRAM
Consider records for patients at a medical facility. Each record contains an integer identification for a patient and strings for the date, the reason for the visit, and the treatment prescribed. Design and implement the class PatientRecord so that it overrides the method hashCode. Write a program that tests your new class. Design a class PatientDataBase that stores instances of PatientRecord, as described above. The class should provide at least three query operations, as follows. Given a patient identification and date, the first operation should return the reason for the visit, and the second operation should return the treatment. The third query operation should return a list of dates, given a patient identification. Implement the class PatientDataBase. Use a hash table to store the patient records. Write a program that demonstrates and tests this class.