Answered: i need run this code class temp {…

i need run this code class temp { public static void function(int [] arr) { int n = arr.length; Hashtable hash = new Hashtable<>(); for(int i=0; i

EBK JAVA PROGRAMMING

8th Edition

ISBN:9781305480537

Author:FARRELL

Publisher:FARRELL

Chapter16: Graphics

Section: Chapter Questions

Problem 1DE

See similar textbooks

Similar questions

Array Elements = 50, 60, 70, 80, 90, 100Search each elementSearch for index 7: Output should be out of bound exceptionUSE JAVA PROGRAMMING
#include <iostream>using namespace std; class TurtleNode { public: TurtleNode(int babiesInit = 0, TurtleNode* nextLoc = nullptr); void InsertAfter(TurtleNode* nodeLoc); TurtleNode* GetNext(); void PrintNodeData(); private: int babiesVal; TurtleNode* nextNodePtr;}; TurtleNode::TurtleNode(int babiesInit, TurtleNode* nextLoc) { this->babiesVal = babiesInit; this->nextNodePtr = nextLoc;} void TurtleNode::InsertAfter(TurtleNode* nodeLoc) { TurtleNode* tmpNext = nullptr; tmpNext = this->nextNodePtr; this->nextNodePtr = nodeLoc; nodeLoc->nextNodePtr = tmpNext;} TurtleNode* TurtleNode::GetNext() { return this->nextNodePtr;} void TurtleNode::PrintNodeData() { cout << this->babiesVal << endl;} int main() { TurtleNode* headObj = nullptr; TurtleNode* firstTurtle = nullptr; TurtleNode* secondTurtle = nullptr; TurtleNode* currTurtle = nullptr; int babies1; int babies2; cin >> babies1; cin…
please help debuging... // Fix the bugs so that the report of 5 students grades// is correct. There should be no memory leaks.#include <stdio.h>#include <string.h>#include <stdlib.h>#include <assert.h> typedef struct student{ int grade; char* nameID;}student_t; void CreateStudent(student_t* s, int grade, char* nameID){ s->grade = grade; s->nameID = strdup(nameID); } //float ComputeAverageGrade(student_t* class, int sizeOfClass){ assert(sizeOfClass > 0 && "Must have at least 1 student"); float total=0.0f; for(int i=0; i <= 5; i++){ total+= class[i].grade; } return total / sizeOfClass;} int main(){ // Create our classroom of 5 students student_t* class = (student_t*)malloc(sizeof(student_t)*5); for(int i=0; i <5 ; i++){ // Assume all nameID's are "temporary" CreateStudent(&class[i],90,"temporary"); } // Storage for students grades float averageGrade =…
JAVA PROGRAM PLEASE MODIFY THIS PROGRAM SO WHEN I UPLOAD IT TO HYPERGRADE IT PASSES THE TEST CASE and take out the following from the program please: Boynames.txt is missing.\n Girlnames.txt is missing.\n Both data files are missing.\n THE TEST CASE DOES NOT ASK FOR IT. PLEASE REMOVE IT. I HAVE PROVIDED THE TEST CASE THAT FAILED AND THE INPUTS AS A SCREENSHOT. import java.io.*;import java.util.*;public class NameSearcher { private static List<String> loadFileToList(String filename) throws FileNotFoundException { List<String> namesList = new ArrayList<>(); File file = new File(filename); if (!file.exists()) { throw new FileNotFoundException(filename); } try (Scanner scanner = new Scanner(file)) { while (scanner.hasNextLine()) { String line = scanner.nextLine().trim(); String[] names = line.split("\s+"); for (String name : names) {…
Take a close look at the C++ code in IntCollection.zip (Copy and Paste link to the external site http://fog.ccsf.edu/~mluttrel/cs110b/IntCollection.zip ) on my web site. The IntCollection class is a dynamic storage mechanism for storing integers. It could be used in place of an integer array. The following code creates an IntCollection object named ‘c’. It adds seven integers to ‘c’, then uses a for loop to display the seven integers: int main(){IntCollection c;c.add(45);c.add(-210);c.add(77);c.add(2);c.add(-21);c.add(42);c.add(7);for (int i = 0; i < c.getSize(); i++){ cout << c.get(i) << endl;}} For this assignment you will add a copy constructor, a destructor, and three overloaded operators to the IntCollection class. In the design diagram below, the black member functions represent code that has already been implemented. You will be implementing the green items. Each item that you will be adding to the class is described below the diagram. private:…
JAVA PROGRAM PLEASE MODIFY THIS PROGRAM SO WHEN I UPLOAD IT TO HYPERGRADE IT PASSES THE TEST CASE and take out the following from the program please: Boynames.txt is missing.\n Girlnames.txt is missing.\n Both data files are missing.\n THE TEST CASE DOES NOT ASK FOR IT. PLEASE REMOVE IT. I HAVE PROVIDED THE TEST CASE THAT FAILED AND THE INPUTS AS A SCREENSHOT. import java.io.*;import java.util.*;public class NameSearcher { private static Map<String, Integer> loadFileToMap(String filename) throws FileNotFoundException { Map<String, Integer> namesMap = new HashMap<>(); File file = new File(filename); if (!file.exists()) { throw new FileNotFoundException(filename); } try (Scanner scanner = new Scanner(file)) { int lineNumber = 1; while (scanner.hasNext()) { String line = scanner.next().trim().toLowerCase(); namesMap.put(line, lineNumber); lineNumber++;…
#include <iostream> #include <string> #include <cstdlib> using namespace std; template<class T, class U = char> class A { T a; U b; public: A(T a_val, char b_val = '$'){ this->a = a_val; this->b = b_val; } void print(){ cout<<a<<' '<<b<<endl; } }; int main(int argc, char const *argv[]) { A <int, int> a1(5,10); A <int> a2(5); A <float> a3(10.0); a1.print(); a2.print(); a3.print(); return 0; } Give output for this code.
6.20 LAB: Fibonacci sequence Java? The Fibonacci sequence begins with 0 and then 1 follows. All subsequent values are the sum of the previous two, for example: 0, 1, 1, 2, 3, 5, 8, 13. Complete the fibonacci() method, which has an index, n, as parameter and returns the nth value in the sequence. Any negative index values should return -1.
Implement the LPU Latch my code is written below having a lot of bugs in it please give you code with proper comments and remove the bugs having proper reason with correct code: #include <bits/stdc++.h> using namespace std; class LRUCache { list dq; unordered_map<int, list<int>::iterator> ma; int csize; public: LRUCache(int); void refer(int); void display(); }; LRUCache::LRUCache(int n) { csize; } void LRUCache::refer(int x) { if (ma.find(x) == ma.end()) { if (dq.size() = csize) { dq.pop_back(); ma.erase(last); } } else dq.erase(ma[x]); dq.push_front(x); ma[x] = dq.begin(); } void LRUCache::display() { for (auto it = dq.begin(); it = dq.end(); it+) cout << (it); cout << endl; } int main() { LRUCache ca(4); ca.refer(1); ca.refer(2); ca.refer(3); ca.refer(1); ca.refer(4); ca.refer(5); return 0; }
package com.olympic.cis143.hw1.fizzbuzz; public class FizzBuzzConverter { public int[] data; public FizzBuzzConverter(int[] values) {if (values == null) {throw new RuntimeException("Values passed cannot be null");}this.data = values;} /**For this method, you will need to iterate through a list of ints and populate a return array with the correct values according to the rules of FizzBuzz. FizzBuzz is a common practice algorithm used when screening candidates. The rules are as follows:If the int is a multiples of three print â€œFizzâ€�If the int is a multiples of five print â€œBuzzâ€�If the int is a multiple of three and five print "FizzBuzz" For example, if the array sent into the method contains the following ints [ 0, 1, 2, 3, 5, 10, 15, 7, 16], the returned Object array will be [0, 1, 2, "Fizz", "Buzz", "Buzz", "FizzBuzz", 7, 16] Note that the method should accept an int array int[] data, and return an object array Object[].*/public Object[] convertToFizzBuzz() {}}
THE QUESTION IS ATTACHED: PLEASE AVOID USING import java.util.ArrayList; import java.util.HashMap; import java.util.Map; BECAUSE I HAVEN'T STUDIED THEM YET, YOU CAN USE 1D AND 2D ARRAYS. YOU ARE FREE TO USE import java.io.File; import java.io.FileNotFoundException; import java.io.FileWriter; import java.io.IOException; EFFECTIVELY USE LOOPS AND CONTROL STATEMENTS. ALSO TRY AND CATCH. TXT. FILE IS INCLUDED BELOW: MOVIE NAME, MOVIE YEAR, RATING AND GENRE. The Martian2015Adventure8.0Murder on the Orient Express2017Crime6.5X-Men: First Class2011Action7.7X-Men: Days of Future Past2014Action7.9This Means War2012Action6.3Godzilla vs. Kong2021Adventure6.5Black Widow2021Action7.5Zack Snyder's Justice League2021Action8.1The Ten Commandments1956Drama7.9The Father2020Drama8.3Nobody2021Crime7.5Promising Young Woman2020Crime7.5What Lies Below2020Horror4.4Shrine2021Horror5.1Bram Stoker's Dracula1992Horror7.4
how can i remove the spaces at the end of each line in my code ? code: def load_course(course_name):try:file = open(course_name+'.txt')return file.readlines()except FileNotFoundError as e:return None def word_wrap_text(text,lineWidth):words = list(text.split())linelen = 0lines = []line = ''for word in words:if linelen + len(word) > lineWidth:lines.append(line)line = ''line += word + ' 'linelen = len(line)if line !='':lines.append(line)return '\n'.join(lines) def enhanced_word_wrap_text(text,lineWidth):words = list(text.split())linelen = 0lines = []line = ''for word in words:if linelen + len(word) + 1 > lineWidth:lines.append(line + word[:lineWidth-linelen])line = word[lineWidth-linelen:] + ' 'else:line += word + ' 'linelen = len(line)if line != '':lines.append(line)return '\n'.join(lines) lineWidth = int(input("")) while True:course = input("")if course == 'q':breaklines = load_course(course)if lines == None:print('Unable to load course information for course',course)else:for…