MyLab Programming with Pearson eText -- Access Code Card -- for Starting Out with Java: From Control Structures through Objects
7th Edition
ISBN: 9780134793672
Author: GADDIS
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Expert Solution & Answer
Chapter 13, Problem 4FTE
Explanation of Solution
Given program:
ListView<String> myListView = new ListView<>(); //Line 1
myListView.getItems().addAll(10,20,30,40); //Line 2
ListView:
- “ListView” is used to show a list of items.
- It is also used to permit the user to select one or more items from the list.
- A “ListView” control is created with a help of “ListView” class.
- The data type of the “ListView” control are string, integer, double, float and so on.
- String data type:
- Declaration of string data type in “ListView” is
- String data type:
ListView<String> stringList = new ListView<>();
- Integer data type:
- Declaration of integer data type in “ListView” is
ListView<Integer> numberList = new ListView<>();
- Declaration of integer data type in “ListView” is
Example:
The example for “ListView” control is shown below:
//create a ListView named fruitListView.
ListView<string> fruitListView = new ListView<>();
//add the fruit items to ListView control
fruitListView.getItems()...
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
main.cc file
#include <iostream>#include <memory>
#include "train.h"
int main() { // Creates a train, with the locomotive at the front of the train. // LinkedList diagram: // Locomotive -> First Class -> Business Class -> Cafe Car -> Carriage 1 -> // Carriage 2 std::shared_ptr<Train> carriage2 = std::make_shared<Train>(100, 100, nullptr); std::shared_ptr<Train> carriage1 = std::make_shared<Train>(220, 220, carriage2); std::shared_ptr<Train> cafe_car = std::make_shared<Train>(250, 250, carriage1); std::shared_ptr<Train> business_class = std::make_shared<Train>(50, 50, cafe_car); std::shared_ptr<Train> first_class = std::make_shared<Train>(20, 20, business_class); std::shared_ptr<Train> locomotive = std::make_shared<Train>(1, 1, first_class);
std::cout << "Total passengers in the train: "; // =================== YOUR CODE HERE…
ion C Lons
Employee
-id: int
-name String
- dob : Date
-staff : ArrayList
+setid(int): void
+getld() : int
+setName(String): void
+setDob(Date) : void
+getDob(): Date
+addStaff(Employee) : void
+getStaff() : ArrayList
main.cc file
#include <iostream>#include <memory>
#include "customer.h"
int main() { // Creates a line of customers with Adele at the front. // LinkedList diagram: // Adele -> Kehlani -> Giveon -> Drake -> Ruel std::shared_ptr<Customer> ruel = std::make_shared<Customer>("Ruel", 5, nullptr); std::shared_ptr<Customer> drake = std::make_shared<Customer>("Drake", 8, ruel); std::shared_ptr<Customer> giveon = std::make_shared<Customer>("Giveon", 2, drake); std::shared_ptr<Customer> kehlani = std::make_shared<Customer>("Kehlani", 15, giveon); std::shared_ptr<Customer> adele = std::make_shared<Customer>("Adele", 4, kehlani);
std::cout << "Total customers waiting: "; // =================== YOUR CODE HERE =================== // 1. Print out the total number of customers waiting // in line by invoking TotalCustomersInLine. //…
Chapter 13 Solutions
MyLab Programming with Pearson eText -- Access Code Card -- for Starting Out with Java: From Control Structures through Objects
Ch. 13.1 - What is the type selector name that corresponds to...Ch. 13.1 - Prob. 13.2CPCh. 13.1 - Prob. 13.3CPCh. 13.1 - Prob. 13.4CPCh. 13.1 - Prob. 13.5CPCh. 13.1 - Prob. 13.6CPCh. 13.1 - Prob. 13.7CPCh. 13.1 - Prob. 13.8CPCh. 13.1 - Prob. 13.9CPCh. 13.1 - Prob. 13.10CP
Ch. 13.1 - Prob. 13.11CPCh. 13.2 - Prob. 13.12CPCh. 13.2 - Prob. 13.13CPCh. 13.2 - Prob. 13.14CPCh. 13.2 - Prob. 13.15CPCh. 13.3 - How do you determine in code whether a CheckBox is...Ch. 13.3 - In code, how do you make a CheckBox appear...Ch. 13.3 - What type of event do CheckBox controls generate...Ch. 13.4 - How do you set the size of a ListView?Ch. 13.4 - Prob. 13.20CPCh. 13.4 - Prob. 13.21CPCh. 13.4 - Prob. 13.22CPCh. 13.4 - How do you set the orientation of a ListView...Ch. 13.5 - Prob. 13.24CPCh. 13.5 - Prob. 13.25CPCh. 13.5 - Prob. 13.26CPCh. 13.5 - Prob. 13.27CPCh. 13.6 - Prob. 13.28CPCh. 13.6 - Prob. 13.29CPCh. 13.6 - Prob. 13.30CPCh. 13.7 - What is the difference between a TextArea and a...Ch. 13.7 - Prob. 13.32CPCh. 13.7 - Prob. 13.33CPCh. 13.7 - Prob. 13.34CPCh. 13.7 - Prob. 13.35CPCh. 13.8 - Briefly describe each of the following menu system...Ch. 13.8 - What class do you use to create a menu bar?Ch. 13.8 - What class do you use to create a menu?Ch. 13.8 - What class do you use to create a menu item?Ch. 13.8 - What class do you use to create a radio menu item?...Ch. 13.8 - How do you create a relationship between radio...Ch. 13.8 - What class do you use to create a check menu item?...Ch. 13.8 - What type of event do menu items generate when...Ch. 13.9 - In what package is the FileChooser class?Ch. 13.9 - Prob. 13.45CPCh. 13.9 - Prob. 13.46CPCh. 13.9 - How do you determine the file that the user...Ch. 13 - When a selector name starts with a period in a...Ch. 13 - Prob. 2MCCh. 13 - Prob. 3MCCh. 13 - Prob. 4MCCh. 13 - Prob. 5MCCh. 13 - In the hexadecimal color value #05AAFF, the AA...Ch. 13 - Prob. 7MCCh. 13 - Prob. 8MCCh. 13 - Prob. 9MCCh. 13 - Prob. 10MCCh. 13 - The __________control presents its items in a...Ch. 13 - Prob. 12MCCh. 13 - A __________ is like a TextField that can accept...Ch. 13 - You use this class to create a menu bar. a....Ch. 13 - Prob. 15MCCh. 13 - True or False: If you make any changes to an...Ch. 13 - Prob. 17TFCh. 13 - Prob. 18TFCh. 13 - Prob. 19TFCh. 13 - Prob. 20TFCh. 13 - Prob. 21TFCh. 13 - Prob. 22TFCh. 13 - True or False: A MenuBar object acts as a...Ch. 13 - True or False: A Menu object cannot contain other...Ch. 13 - Prob. 1FTECh. 13 - Prob. 2FTECh. 13 - Prob. 3FTECh. 13 - Prob. 4FTECh. 13 - Prob. 1AWCh. 13 - Suppose we have a stylesheet named styles.css, and...Ch. 13 - Prob. 3AWCh. 13 - Prob. 4AWCh. 13 - Prob. 5AWCh. 13 - Prob. 6AWCh. 13 - Prob. 7AWCh. 13 - Prob. 8AWCh. 13 - Prob. 9AWCh. 13 - Prob. 10AWCh. 13 - Prob. 11AWCh. 13 - Prob. 12AWCh. 13 - Prob. 13AWCh. 13 - Write the code that creates a menu bar with one...Ch. 13 - Prob. 1SACh. 13 - Prob. 2SACh. 13 - Prob. 3SACh. 13 - Prob. 4SACh. 13 - Prob. 5SACh. 13 - Prob. 6SACh. 13 - Prob. 7SACh. 13 - Prob. 8SACh. 13 - Prob. 9SACh. 13 - Dorm and Meal Plan Calculator A university has the...Ch. 13 - Skateboard Designer The Skate Shop sells the...Ch. 13 - Prob. 3PCCh. 13 - Smartphone Packages Cell Solutions, a cell phone...Ch. 13 - Shopping Cart System Create an application that...
Knowledge Booster
Similar questions
- main.cc file #include <iostream>#include <memory> #include "customer.h" int main() { // Creates a line of customers with Adele at the front. // LinkedList diagram: // Adele -> Kehlani -> Giveon -> Drake -> Ruel std::shared_ptr<Customer> ruel = std::make_shared<Customer>("Ruel", 5, nullptr); std::shared_ptr<Customer> drake = std::make_shared<Customer>("Drake", 8, ruel); std::shared_ptr<Customer> giveon = std::make_shared<Customer>("Giveon", 2, drake); std::shared_ptr<Customer> kehlani = std::make_shared<Customer>("Kehlani", 15, giveon); std::shared_ptr<Customer> adele = std::make_shared<Customer>("Adele", 4, kehlani); std::cout << "Total customers waiting: "; // =================== YOUR CODE HERE =================== // 1. Print out the total number of customers waiting // in line by invoking TotalCustomersInLine. //…arrow_forward#ifndef LLCP_INT_H#define LLCP_INT_H #include <iostream> struct Node{ int data; Node *link;};void DelOddCopEven(Node*& headPtr);int FindListLength(Node* headPtr);bool IsSortedUp(Node* headPtr);void InsertAsHead(Node*& headPtr, int value);void InsertAsTail(Node*& headPtr, int value);void InsertSortedUp(Node*& headPtr, int value);bool DelFirstTargetNode(Node*& headPtr, int target);bool DelNodeBefore1stMatch(Node*& headPtr, int target);void ShowAll(std::ostream& outs, Node* headPtr);void FindMinMax(Node* headPtr, int& minValue, int& maxValue);double FindAverage(Node* headPtr);void ListClear(Node*& headPtr, int noMsg = 0); // prototype of DelOddCopEven of Assignment 5 Part 1 #endifarrow_forward#ifndef LLCP_INT_H#define LLCP_INT_H #include <iostream> struct Node{ int data; Node *link;}; bool DelOddCopEven(Node* headPtr);int FindListLength(Node* headPtr);bool IsSortedUp(Node* headPtr);void InsertAsHead(Node*& headPtr, int value);void InsertAsTail(Node*& headPtr, int value);void InsertSortedUp(Node*& headPtr, int value);bool DelFirstTargetNode(Node*& headPtr, int target);bool DelNodeBefore1stMatch(Node*& headPtr, int target);void ShowAll(std::ostream& outs, Node* headPtr);void FindMinMax(Node* headPtr, int& minValue, int& maxValue);double FindAverage(Node* headPtr);void ListClear(Node*& headPtr, int noMsg = 0); // prototype of DelOddCopEven of Assignment 5 Part 1 #endif // definition of DelOddCopEven of Assignment 5 Part 1//Algorithm should: /*NOT destroy any of the originally even-valued node. This means that the originally even-valued nodes should be retained as part of the resulting list. Destroy…arrow_forward
- #include <stdio.h>#include <stdlib.h>#include <time.h> struct treeNode { struct treeNode* leftPtr; int data; struct treeNode* rightPtr;}; typedef struct treeNode TreeNode;typedef TreeNode* TreeNodePtr; void insertNode(TreeNodePtr* treePtr, int value);void inOrder(TreeNodePtr treePtr);void preOrder(TreeNodePtr treePtr);void postOrder(TreeNodePtr treePtr); int main(void) { TreeNodePtr rootPtr = NULL; srand(time(NULL)); puts("The numbers being placed in the tree are:"); for (unsigned int i = 1; i <= 10; ++i) { int item = rand() % 15; printf("%3d", item); insertNode(&rootPtr, item); } puts("\n\nThe preOrder traversal is: "); preOrder(rootPtr); puts("\n\nThe inOrder traversal is: "); inOrder(rootPtr); puts("\n\nThe postOrder traversal is: "); postOrder(rootPtr);} void insertNode(TreeNodePtr* treePtr, int value) { if (*treePtr == NULL) { *treePtr = malloc(sizeof(TreeNode)); if…arrow_forward#include <stdio.h>#include <stdlib.h>#include <time.h> struct treeNode { struct treeNode *leftPtr; int data; struct treeNode *rightPtr;}; typedef struct treeNode TreeNode;typedef TreeNode *TreeNodePtr; void insertNode(TreeNodePtr *treePtr, int value);void inOrder(TreeNodePtr treePtr);void preOrder(TreeNodePtr treePtr);void postOrder(TreeNodePtr treePtr); int main(void) { TreeNodePtr rootPtr = NULL; srand(time(NULL)); puts("The numbers being placed in the tree are:"); for (unsigned int i = 1; i <= 10; ++i) { int item = rand() % 15; printf("%3d", item); insertNode(&rootPtr, item); } puts("\n\nThe preOrder traversal is: "); preOrder(rootPtr); puts("\n\nThe inOrder traversal is: "); inOrder(rootPtr); puts("\n\nThe postOrder traversal is: "); postOrder(rootPtr);} void insertNode(TreeNodePtr *treePtr, int value) { if (*treePtr == NULL) { *treePtr = malloc(sizeof(TreeNode)); if (*treePtr != NULL) { (*treePtr)->data = value;…arrow_forwardA c++ code that performs a search for a specific employee and returns the employee ID if found and 0 if not: int findEmployeeById(Employee list[], int size, int myId)arrow_forward
- Double any element's value that is less than controlValue. Ex: If controlValue = 10, then dataPoints = {2, 12, 9, 20} becomes {4, 12, 18, 20}. #include <iostream>using namespace std; int main() { const int NUM_POINTS = 4; int dataPoints[NUM_POINTS]; int controlValue; int i; cin >> controlValue; for (i = 0; i < NUM_POINTS; ++i) { cin >> dataPoints[i]; } /* Your solution goes here */ for (i = 0; i < NUM_POINTS; ++i) { cout << dataPoints[i] << " " ; } cout << endl; return 0;}arrow_forwardDouble any element's value that is less than minValue. Ex: If minValue = 10, then dataPoints = {2, 12, 9, 20} becomes {4, 12, 18, 20}. #include <iostream>using namespace std; int main() {const int NUM_POINTS = 4;int dataPoints[NUM_POINTS];int minValue;int i; cin >> minValue; for (i = 0; i < NUM_POINTS; ++i) {cin >> dataPoints[i];} /* Your solution goes here */ for (i = 0; i < NUM_POINTS; ++i) {cout << dataPoints[i] << " " ;}cout << endl; return 0;} Please help me with this problem using c++.arrow_forward#include <iostream> #include "ContactNode.h" int main() { ContactNode* contactList = new ContactNode(); ContactNode* currNode; std::string name, phoneNum; int i = 1; while (i <= 3) { std::cout << "Person " << i++ << std::endl; std::cout << "Enter name:" << std::endl; getline(std::cin, name); std::cout << "Enter phone number:" << std::endl; std::cin >> phoneNum; std::cin.ignore(); contactList->InsertAfter(new ContactNode(name, phoneNum)); std::cout << "You entered: " << name << ", " << phoneNum << std::endl << std::endl; } currNode = contactList; std::cout << "CONTACT LIST" << std::endl; while (contactList != nullptr) { currNode->PrintContactNode(); currNode = currNode->GetNext(); } delete contactList, currNode; } // ContactNode.h #ifndef CONTACTNODE_H #define CONTACTNODE_H #include <string> class ContactNode { public: ContactNode(std::string…arrow_forward
- void getVectorSize(int& size); void readData(vector<Highscore>& scores); void sortData(vector<Highscore>& scores); vector<Highscore>::iterator findLocationOfLargest( const vector<Highscore>::iterator startingLocation, const vector<Highscore>::iterator endingLocation); void displayData(const vector<Highscore>& scores); The size parameter from the given code won't be needed now, since a vector knows its own size. Notice that the findLocationOfLargest() function does not need the vector itself as a parameter, since you can access the vector using the provided iterator parameters. The name field in the struct must still be a c-string The focus of this assignment is to use iterators. You must use iterators wherever possible to access the vector. As a result, you must not use square brackets, the push_back() function, the at() function, etc. Also, the word "index" shouldn't appear in your code anywhere. You won't get full credit if…arrow_forwardUnique Values This function will receive a single map parameter known as a_map. a_map will contain a single letter as a string and numbers as values. This function is supposed to search a_map to find all values that appear only once in a_map. The function will create another map named to_ret. For all values that appear once in a_map the function will add the value as a key in to_ret and set the value of the key to the key of the value in a_map (swap the key-value pairs, since a_map contains letters to numbers, to_ret will contain Numbers to Letters). Finally, the function should return to_ret. Signature: public static HashMap<String, Integer> uniqueValues(HashMap<Integer, String> a_map) Example: INPUT: {0=M, 2=M, 3=M, 5=M, 6=n, 7=M, 9=M}OUTPUT: {n=6} INPUT: {0=A, 1=c, 2=c, 4=c, 5=a, 8=Q, 9=c}OUTPUT: {A=0, a=5, Q=8}arrow_forward#include<stdio.h> #include<stdlib.h> #include<conio.h> struct nodetype { struct nodetype *left ; int info ; struct nodetype *right; }; typedef struct nodetype *NODEPTR; NODEPTR maketree(int); NODEPTR getnode(void); void inordtrav(NODEPTR); int main(void) { NODEPTR root , p , q; printf("%s\n","Enter First number"); scanf("%d",&number); root=maketree(number); /* insert first root item */ while(scanf("%d",&number) !=EOF) { p=q=root; /* find insertion point */ while((number !=p->info) && q!=NULL) {p=q; if (number <p->info) q = p->left; else q = p->right; } q=maketree(number); /* insertion */ if (number==p->info) printf("%d is a duplicate \n",number); else if (number<p->info)…arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
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