Introduction to Java Programming and Data Structures, Comprehensive Version (11th Edition)
11th Edition
ISBN: 9780134670942
Author: Y. Daniel Liang
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Videos
Textbook Question
Chapter 21.2, Problem 21.2.9CP
What will the output be if lines 6–7 in Listing 21.5 are replaced by the following code:
Set<GeometricObject> set = new HashSet<>();
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Q1. Given the following set: pets = {"cat", "dog", "horse"}, replace the word "dog"
with "cow". You cannot assume that you know the index of "dog" - you must
find it using code.
typedef struct node_t node_t;
struct node_t {
};
int32_t value;
node_t* next;
node_t* insert (node_t* list, int32_t v, int32_t* flag);
3) As you may have noticed from MT1, Howie is lazy. He wants you to write the interface
for the following implementation of function copy_to_linked_list. He really appreciates your help!
/* copy_to_linked_list
int32_t copy_to_linked_list (int32_t a[], int32_t size, node_t** list_p) {
int32_t flag, i;
for (i = 0; i < size; ++i) {
*list_p = insert (*list_p, a[i], &flag);
if (-1== flag)
return -1;
}
return 0;
Q-No.4: Add the following functions and write a program to test these functions in the class linkedListType: a. Write the definition of a function that returns the data of the kth element of the linked list. If such element is not exist in the list, exit the program. b. Write the definition of a function that deletes the kth element of the linked list. If such element is not exist in the list, exit the program and display message as output.
Chapter 21 Solutions
Introduction to Java Programming and Data Structures, Comprehensive Version (11th Edition)
Ch. 21.2 - Prob. 21.2.1CPCh. 21.2 - Prob. 21.2.2CPCh. 21.2 - Prob. 21.2.3CPCh. 21.2 - Prob. 21.2.4CPCh. 21.2 - Prob. 21.2.5CPCh. 21.2 - Suppose set1 is a set that contains the strings...Ch. 21.2 - Prob. 21.2.7CPCh. 21.2 - Prob. 21.2.8CPCh. 21.2 - What will the output be if lines 67 in Listing...Ch. 21.2 - Prob. 21.2.10CP
Ch. 21.3 - Prob. 21.3.1CPCh. 21.3 - Suppose you need to write a program that stores...Ch. 21.3 - Suppose you need to write a program that stores...Ch. 21.3 - Suppose you need to write a program that stores a...Ch. 21.3 - Prob. 21.3.5CPCh. 21.3 - Prob. 21.3.6CPCh. 21.4 - Prob. 21.4.1CPCh. 21.4 - Prob. 21.4.2CPCh. 21.5 - Prob. 21.5.1CPCh. 21.5 - Prob. 21.5.2CPCh. 21.5 - Prob. 21.5.3CPCh. 21.6 - Prob. 21.6.1CPCh. 21.6 - Prob. 21.6.2CPCh. 21.6 - Prob. 21.6.3CPCh. 21.6 - Prob. 21.6.4CPCh. 21.7 - Prob. 21.7.1CPCh. 21.7 - Prob. 21.7.2CPCh. 21 - Prob. 21.1PECh. 21 - (Display nonduplicate words in ascending order)...Ch. 21 - Prob. 21.3PECh. 21 - (Count consonants and vowels) Write a program that...Ch. 21 - Prob. 21.6PECh. 21 - (Revise Listing 21.9, CountOccurrenceOfWords.java)...Ch. 21 - Prob. 21.8PECh. 21 - Prob. 21.9PE
Additional Engineering Textbook Solutions
Find more solutions based on key concepts
T F Public members of a protected base class become private members of the derived class.
Starting Out with C++ from Control Structures to Objects (8th Edition)
Holy digits Batman! The Riddler is planning his next caper somewhere on Pennsylvania Avenue. In his usual sport...
Problem Solving with C++ (9th Edition)
What is the purpose of the let constructs in functional languages?
Concepts Of Programming Languages
Look at the following class definition: public class ClassD extends ClassB { (Member Declarations ) } Because C...
Starting Out with Java: From Control Structures through Data Structures (3rd Edition)
The _______ member function returns a files current read position.
Starting Out with C++: Early Objects
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- in C++ kth ElementExtend the class linkedListType by adding the following operations:a. Write a function that returns the info of the kth element of the linked list. If no such element exists, terminate the program.b. Write a function that deletes the kth element of the linked list. If no such element exists, terminate the program. Provide the definitions of these functions in the class linkedListType. please, do not copy from any other sources, give me a fresh new code. Thank youarrow_forwardCode NOT working. What to do? Here is code: appleList = [["Apple",52,14,0,0],["McIntosh red",80,18,0,0.5],["Gala (Apple)",52,11.4,0.2,0.3],["Fuji Apple",52,11.4,0.2,0.3],["Honey Crisp Apples",90,21,0,0],["Granny Smith Apples",52,11.4,0.2,0.3],["Red Delicious Apples",80,17,0,0],["Braeburn Apples",71.7,16,0.5,0.1],["Golden Delicious Apples",130,29,1,0],["Jonagold",130.7,34,1,0],["Cripps Pink Apple",80,18,0,0],["Empire Apples",80,17,0,0],["Produce Cortland Apples",70,6,1,5],["Jazz Apples",53.8,12,0.6,0.5],["Cameo Apples", 80,22,0,0]["Winesap Apples",80,22,0,0],["Rome Apples",80,22,0,0],["Ambrosia Apples",90,17,0.4,0],] print(":Type of Apple : Calories : Carbs (in GRAMS) : Protein (in GRAMS) : Fat (in GRAMS) :") for item in appleList:print(":",item[0]," "*(9-len(item[0])),":",item[1]," "*(13-len(item[1])),":",item[2]," "*(4-len(str(item[2]))),":")arrow_forwardSalesforce Assignment: You are working in company as a junior developer and the manger assign you a task to create the test class of trigger code of the following code will cover all the use case like insert, update, delete. The code is as follows: public class TriggerBasicAssignmentTriggerHelper ( // This method is used to update the vlaue of field C public static void getFiledvalue(List listofValues, Map mapofCoustomobject ){ for (Trigger_Basic_Assignments_ct :listofvalues){ if(mapofCoustomobject == null || t.Field_A_c != mapofCoustomobject.get(t.Id). Field_A_C || t.Field_8_c != mapofCoustomobject.get(t.I if(t.Operator_ '+') t.Field C_c = t.Field_A_c + t.Field_B_c; else if(t.Operator_c *') t. Field C_c = t.Field A_* t.Field_8_c; else if(t.Operator_c == /' && t.Field B_c != 0) t.Field C_c = t.Field A_c / t.Field_B_c; else t.Field C_c = t.Field_A_c - t.Field B_c; I need the test class only.arrow_forward
- C++ PROGRAMMINGTopic: HashTable - PolyHash Quadratic Explain the c++ code below.: SEE ATTACHED PHOTO FOR THE PROBLEM INSTRUCTIONS It doesn't have to be long, as long as you explain what the important parts of the code do. (The code is already implemented and correct, only the explanation needed). You can also explain line by line for an upvote, thanks. EXPLAIN THE CODE BELOW: #include <cstdlib> #include <math.h> #include <cstring> #include <iostream> using namespace std; class HashTable { string* table; int N; int count; // TODO: Polynomial Hash Code using a=7 int hash_code(string key) { int code; int hash = 0; for (int i = 0; i < key.size(); i++) { char ch = key[i]; code += ((ch - 96) * pow(7, key.size() - (i + 1))); } return code; } // TODO: This hash table uses a MAD compression function // where a = 11, b = 461, p = 919 int compress(int code) { return (((11*code)+461) % 919) % N; }…arrow_forwardWhat is the set builder form for {7,8,9,10...}arrow_forwardthis is my code and the question need to be continued. #include <iostream>using namespace std; class Course{private: string name; string *studentList; int size, capacity=10;public: Course(){ name = "TBD"; size = 0; studentList = new string[capacity]; }Course(string s){ name = s; size = 0; studentList = new string[capacity]; }void setName(string s){ name = s; }getter/accessor for variable name string getName(){ return name; }}; int main(){ Course a, b("Yankee"); cout << a.getName() << endl; a.setName("Mets"); cout << a.getName() << endl; cout << b.getName() << endl; return 0;} this is the Question:: Continue with Team class: a) Copy the previous program to a new file.b) Implement the addMember, removeMember and…arrow_forward
- Each true or false is a subpart to the same question. Thanks. True or False 1. [ {int id1; id2 = id1 + 5; } ] < [ {int x; x = y+ 5; } ] 2. [ {type, id1; id, = id1 + 5; } ] <[ {int x; y= x+5; } ] True or False 1. [ stmt1; {stmt list1}; id2 = id1 + 5; ] « [ int x; {x = 2; }; x = x + 5; ] 2. [ int id1; {stmt_list}; stmt1; ]«[ int x; {x = 2; }; x = x + 5; ] True or False 1. [ stmt1; stmt2; ] < [ int x; y = 5; ] 2. [ {stmt.list,}]<[ {int x; y = 5; } ] True or False 1. [ {int id1; id2 = E1 + E2; } ] <[ {int x; x= 4+ 5; } ] 2. [ {int id1; id2 = y * T1; } ] < [ {int x; x = y+ 5; } ]arrow_forward# viewGame(G, i) takes a game description G (a dictionary of the type# produced by newGame()) and an integer player index i and returns a# string that, when printed, describes the state of the game from# player i's perspective.## Example:# >>> viewGame(G, 1)# '\nPlayer2 to play (score=0):\n 1[ ] 2[ ] 3[ ]'## Note the spacing and explicit newlines, and the fact that the player# numbers use 1-based indexing even though internally the game data# structures use Pythonic 0-based indexing.arrow_forwardcan you fix this code #include <iostream>#include <list>using namespace std; class Hash{ int BIB; list<int>* tableSize;public: Hash(int V); // Constructor // inserts a key into hash table void insertItem(int x); // deletes a key from hash table void deleteItem(int key); // hash function to map values to key int hashFunction(int x) { return (x % BIB); } void displayHash();}; Hash::Hash(int b){ this->BIB = b; tableSize = new list<int>[BIB];} void Hash::insertItem(int key){ int index = hashFunction(key); tableSize[index].push_back(key);} void Hash::deleteItem(int key){ // get the hash index of key int index = hashFunction(key); // find the key in (index)th list list <int> ::iterator i; for (i = tableSize[index].begin(); i != tableSize[index].end(); i++) { if (*i == key) break; } // remove key if it is found in hash table, if (i != tableSize[index].end())…arrow_forward
- def trip_planning(city_list): """ Question 2 You are planning the perfect trip in Europe! To do so ... - First, remove the duplicate cities in the list provided - Then, remove the countries that are not in Europe - Finally, order the cities alphabetically - Don't forget to return the resulting list of cities! Args: city_list (list) Returns: list >>> trip_planning(["Amsterdam, Europe", "Beijing, Asia", "Madrid, Europe", "Bucharest, Europe", "Lima, America"]) ["Amsterdam, Europe", "Bucharest, Europe", "Madrid, Europe"] >>> trip_planning(["London, Europe", "London, Europe", "Cairo, Africa", "Rome, Europe", "Sacramento, America"]) ["London, Europe", "Rome, Europe"] # print(trip_planning(["Amsterdam, Europe", "Beijing, Asia", "Madrid, Europe", "Bucharest, Europe", "Lima, America"])) # print(trip_planning(["London, Europe", "London, Europe", "Cairo, Africa", "Rome, Europe", "Sacramento, America"]))arrow_forwardWrite only the function definition: Implement the following function definition: int CrazyWord(char word [ ]); //input: a character array with a null character (string) //sets all of the characters in the word to lowercase letters //changes any lowercase ‘o’ letters to hashtags ‘#’ //returns the number of hashtags that are now in the wordarrow_forwardDefine setprecision.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
C++ Programming: From Problem Analysis to Program...Computer ScienceISBN:9781337102087Author:D. S. MalikPublisher:Cengage Learning
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning
Introduction to Linked List; Author: Neso Academy;https://www.youtube.com/watch?v=R9PTBwOzceo;License: Standard YouTube License, CC-BY
Linked list | Single, Double & Circular | Data Structures | Lec-23 | Bhanu Priya; Author: Education 4u;https://www.youtube.com/watch?v=IiL_wwFIuaA;License: Standard Youtube License