Hi, could help find the error in my code please. here what the exercise ask: Name the script for.sh. This script will create a shopping list. Ask the user to enter items separated by a space. Read the list. Use a for loop to write (use echo) the items to a file called shopping_list. You should use >> to append the output to the file, so each time the script is run the list should get longer. After the for loop finishes, display (use cat) the contents of the shopping list with 1 item per line. This is what i have put so far: what should i add or change

Hi, could help find the error in my code please. here what the exercise ask: Name the script for.sh. This script will create a shopping list. Ask the user to enter items separated by a space. Read the list. Use a for loop to write (use echo) the items to a file called shopping_list. You should use >> to append the output to the file, so each time the script is run the list should get longer. After the for loop finishes, display (use cat) the contents of the shopping list with 1 item per line. This is what i have put so far: what should i add or change

Programming with Microsoft Visual Basic 2017

8th Edition

ISBN:9781337102124

Author:Diane Zak

Publisher:Diane Zak

Chapter8: Arrays

Section: Chapter Questions

Problem 3MQ5

See similar textbooks

Similar questions

Turn this into a flowchart/pseudo code. //This is where the functions go void insertfront(int data);void insert(int data);void display();void deletedata(int data);void reverselist();void searchdata(int data);void swap();void datasort();void deleteList(); #include <iostream>#include <stdlib.h>using namespace std; struct Node {int data;struct Node *next;}; struct Node* head = NULL;struct Node* rhead = NULL;int count1; //insert in front for reversedlistvoid insertfront(int data){Node* new_node = (Node*) malloc(sizeof(Node)); new_node->data = data; new_node->next = rhead; rhead=new_node;}//insert at endvoid insert(int new_data){Node* ptr;ptr = head;Node* new_node = (Node*) malloc(sizeof(Node)); new_node->data = new_data; new_node->next = NULL;if (head == NULL) { head = new_node; } else{while (ptr->next!= NULL) { ptr = ptr->next;}ptr->next=new_node;}count1++;}//display listvoid display() {struct Node* ptr;ptr = head;if(head==NULL){cout<<"Sorry the list…
6. sum_highest_five This function takes a list of numbers, finds the five largest numbers in the list, and returns their sum. If the list of numbers contains fewer than five elements, raise a ValueError with whatever error message you like. Sample calls should look like: >>> sum_highest_five([10, 10, 10, 10, 10, 5, -17, 2, 3.1])50>>> sum_highest_five([5])Traceback (most recent call last): File "/usr/lib/python3.8/idlelib/run.py", line 559, in runcode exec(code, self.locals) File "<pyshell#44>", line 1, in <module> File "/homework/final.py", line 102, in sum_highest_five raise ValueError("need at least 5 numbers")ValueError: need at least 5 numbers
Given helper function: (Hint: This function is to be used to complete the docstring of the function below)def is_number(value: str) -> bool: """Return True if and only if value represents a decimal number. >>> is_number('csc108') False >>> is_number(' 108 ') True >>> is_number('+3.14159') True """ return value.strip().lstrip('-+').replace('.', '', 1).isnumeric()QUESTION: Complete the docstring using the information provided. def convert_data(data: List[list]) -> None: """Convert each string in data to an int if and only if it represents a whole number, and a float if and only if it represents a number that is not a whole number. >>> d = [['abc', '123', '45.6', 'car', 'Bike']] >>> convert_data(d) >>> d [['abc', 123, 45.6, 'car', 'Bike']] >>> d = [['ab2'], ['-123'], ['BIKES', '3.2'], ['3.0', '+4', '-5.0']] >>> convert_data(d) >>> d…
•is Valid Phone Number(): ReturnsTrue if the provided phone number (represented as a string) is cor-rectly formatted, otherwiseFalse. To be considered correctly formatted, phone numbers must bewritten as###-###-####, where#is a digit between 0 and 9 .•validatePhoneBook(): A phone book is a list where each entry is a phone book record (represented asa dictionary; see below for more details). This function checks each phone book record in the phonebook for correctly formatted phone numbers.A phone book record is a dictionary which initially has two keys: the key"name"mapped to thecontact’s name (string) and the key"phone number"mapped to that contact’s phone number (alsoa string).validatePhoneBook()adds a new key"valid"to the record with the valueTrueif the phonenumber is formatted correctly, otherwiseFalse. 1. Write white-box and black-box tests for the function is ValidPhoneNumber(). You should do this with-out Python, either on paper, or in a simple document. Don’t worry about…
Modify the sample code to prompt the user for a name. Have theprogram search the existing list for the entered name. If thename is in the list, display the corresponding phone number;otherwise display this message,The name is not in the current phone directory. #include<iostream>#include<iomanip> using namespace std;const int MAXNAME = 30;const int MAXTEL = 15;struct Tele_typ{char name[MAXNAME];char phone_no[MAXTEL];Tele_typ* nextaddr;};void display(Tele_typ*);int main(){Tele_typ t1 = { " Cage, Mark", "(555) 898-2392" };Tele_typ t2 = { " Dolan, Nick", "(555) 682-3104" };Tele_typ t3 = { " Lennon, John", "(555) 718-4581" };Tele_typ* first; first = &t1;t1.nextaddr = &t2;t2.nextaddr = &t3;t3.nextaddr = NULL;display(first);return 0;}void display(Tele_typ * contents) // of type Tele_typ {while (contents != NULL){cout.setf(ios::left);cout.width(25); cout << '\n' << contents->name;cout.width(20); cout << contents->phone_no;contents =…
Modify the sample code to prompt the user for a name. Have theprogram search the existing list for the entered name. If thename is in the list, display the corresponding phone number;otherwise display this message,The name is not in the current phone directory. #include<iostream>#include<iomanip> using namespace std;const int MAXNAME = 30;const int MAXTEL = 15;struct Tele_typ{char name[MAXNAME];char phone_no[MAXTEL];Tele_typ* nextaddr;};void display(Tele_typ*);int main(){Tele_typ t1 = { " Cage, Mark", "(555) 898-2392" };Tele_typ t2 = { " Dolan, Nick", "(555) 682-3104" };Tele_typ t3 = { " Lennon, John", "(555) 718-4581" };Tele_typ* first; first = &t1; t1.nextaddr = &t2; t2.nextaddr = &t3; t3.nextaddr = NULL; display(first); return 0;}void display(Tele_typ * contents) // of type Tele_typ {while (contents != NULL){cout.setf(ios::left);cout.width(25); cout << '\n' << contents->name;cout.width(20); cout << contents->phone_no;contents =…
Write a loop that finds the smallest value. Print it and the index code format: #include <iostream>using namespace std; #include <cstdlib> // required for rand() int main(){// Put Part2 code here // Declare smallestFoundSoFar// Q: what should be its initial value?int indexOfSmallest = -1;// sign that it is not initialized Part 2 code #include <iostream> using namespace std; // part 1 code#include <cstdlib> int main() { srand(17); const int ARRAYSIZE = 20; // size for the array int RandArray[ARRAYSIZE]; // array declared int i; // to iterate the loop // this loop will store thei random number in the array for (i = 0; i < ARRAYSIZE; i++) RandArray[i] = rand() % 100; // this loop will print the array for (i = 0; i < ARRAYSIZE; i++) cout <<"randArray["<< i <<"]=" << RandArray[i] << endl; int largestFoundSoFar=-1; // anything is larger than this! int indexOfLargest = -1; // sign that it is not initialized for (i = 0; i…
The foreach loop is intended to function with the __________, a temporary, read-only variable. a. variable element b. variable loop c. variable index d. variable iteration
Create a Flowchart for this code. #Declaring and initializing the listcars = ["Buick","Ford","Honda"]colors = ["Red","Blue","Black","White","Green"]aType = ["Sedan","SUV","Sports","Coupe","Truck"]#Using list comprehension to generate a listarr = [[0 for i in range(len(cars))] for j in range(len(cars)*len(colors))]#Outer for loopfor i in range(0, len(colors)*len(cars)): #Inner for loop for j in range(0, len(cars)): #Check if j =0 if j == 0: #Initializing the list with cars(i%5) arr[i][j] = cars[int(i/5)] #chck if j = 1 if j == 1: #Initializing the list with colors(i%5) arr[i][j] = colors[int(i % 5)] #check if j = 2 if j == 2: #Initializing the list with aType(i%5) arr[i][j] = aType[int(i % 5)]#Iterating through the 2D listfor i in range(0, len(arr)): #Print each list one by one print(arr[i])
ava problem: Write an application that allows a user to enter the names and birth dates of up to 10 friends. Continue to prompt the user for names and birth-dates until the user enters the sentinel value “ZZZ” for a name or has entered 10 names, whichever comes first. When the user is finished entering names, produce a count of how many names were entered, and then display the names. In a loop, continuously ask the user to type one of the names and display the corresponding birth-date or an error message if the name has not been previously entered. The loop continues until the user enters “ZZZ” for a name.
this is code #include <iostream> using namespace std; struct Node { int data; struct Node *next; }; struct Node* head = NULL; void insert(int new_data) { struct Node* new_node = (struct Node*) malloc(sizeof(struct Node)); new_node->data = new_data; new_node->next = head; head = new_node; } void display() { struct Node* ptr; ptr = head; while (ptr != NULL) { cout<< ptr->data <<" "; ptr = ptr->next; } } int main() { insert(3); insert(1); insert(7); insert(2); insert(9); cout<<"The linked list is: "; display(); return 0; } i want Re-implement it on doubly linked list take in account the set-position method and the operator overload and coy constructor and destructor ? in c++
The code below prompts the user to enter their full name, and then converts the name to a list. Complete the code to output the person's initials. For example, if the user enters 'Adam Jones', then your code will output 'AJ'. If the user enters 'Adam Daniel Jones', then your code will output 'ADJ'. name = input('Enter your full name: ')nameList = name.split()nameList