Lottery number generator in Python code please thanks so much ! VideoNoteThe Total SalesProblem// returned.unctionthe name is found, theis returned; otherwise a messageng that the name was not found in the array isFunction String searchName (String name, String names []Integer size)Declare Boolean foundDeclare Integer indexDeclare String result// specified name.// Step through the array searching for theWhile found == False AND index <= size - 1If contains (names[index], name) ThenSet found = TrueElseEnd IfSet index = index + 1End While// Determine the result.If found == True ThenSet result = names [index]ElseEnd IfSet result = "That name was not found in the array."Return resultEnd FunctionProgramming Exercises1. Total SalesDesign a program that asks the user to enter a store's sales for each day of the week.the week and display the result.The amounts should be stored in an array. Use a loop to calculate the total sales for2. Lottery Number GeneratorDesign a program that generates a 7-digit lottery number. The program should havean Integer array with 7 elements. Write a loop that steps through the array, ran-domly generating a number in the range of 0 through 9 for each element. (Use therandom function that was discussed in Chapter 6.) Then write another loop thatdisplays the contents of the array.3. Rainfall StatisticsDesign a program that lets the user enter the total rainfall for each of 12 monthsinto an array. The program should calculate and display the total rainfall for the

1) Below is python program that generates a 7-digit lottery number, using 7 element integer array…

2. Lottery Number Generator Design a program that generates a 7-digit lottery number. The program should have an Integer array with 7 elements. Write a loop that steps through the array, ran- domly generating a number in the range of 0 through 9 for each element. (Use the random function that was discussed in Chapter 6.) Then write another loop that displays the contents of the array.

2. Lottery Number Generator Design a program that generates a 7-digit lottery number. The program should have an Integer array with 7 elements. Write a loop that steps through the array, ran- domly generating a number in the range of 0 through 9 for each element. (Use the random function that was discussed in Chapter 6.) Then write another loop that displays the contents of the array.

EBK JAVA PROGRAMMING

9th Edition

ISBN:9781337671385

Author:FARRELL

Publisher:FARRELL

Chapter8: Arrays

Section: Chapter Questions

Problem 9PE

See similar textbooks

Similar questions

PYTHON import randomrandom.seed = 1 class array: def __init__(self, valuelist): self.__atos = valuelist.copy() # this variable is the array that holds the data def additem(self, value): # adds a item to the array def printarray(self): # prints the self.atos def __contains__(self, key): # To test the binary search change the "__linearsearch" to "__binsearch" return self.__linearsearch(key) def __linearsearch(self, key): # Implements the linear search to find an item in the array ####################################################################### # Remove the pass and write code ####################################################################### pass ####################################################################### # End code ####################################################################### def __binsearch(self, key): temp = sorted(self.atos)…
/*** creates an array of 1000 integers where each element matches its index* * @return the array that is created*/public static int[] makeNumberArray() {
For an array stored in the variablecustomerswhose highest index value is 34, thecustomers.lengthproperty will return the value _____. a. 35 b. 34 c. 33 d. null
Create an indexception value of unique consonants and unique vowels.This is the Input: String of the name that was given below. It must be case sensitive.Steps:Step A: In every unique vowel of a name, you need to get the first index of that vowel from the original string.Step B: In each vowel index you get from step A, you will get the unique consonant from that position. if the index is out of scope of the consonant array, ignore that vowel index.Step C: In each unique consonant that you get from step B, you need to get the first index of that consonant from the original string.Step D: You will the value of indexception by adding all index you get from step C.output must be like this: > 2 lists that consist of unique vowels and unique consonants> vowel, the vowel index, the consonant, the consonant indexfinal ouput> total indexception value of the name that was given. ------Input "Tricia O. Reyes"Output:Name: Tricia O. ReyesVowels: ['a', 'e', 'i', 'o']Consonants: ['T', 'r',…
Question 4: (30 marks) A Math teacher is teaching Math course to a set of classes (each class may have different number of students) and want to check the behavior of his students in a homework report. The teacher gave the classes the same exam and marked their answer and wants to know the class whose students got the highest average. Help the teacher in the required analysis of student’s marks by implementing a Java program ClassAverageMArks2DimmArray using 2-dimensional array to store the students marks and then compute the average of each class student’s marks. The program has the following specification: • A Method titled averageClassMarks for computing the average (as double) of a class students marks (given to the method as a single-dimensional array) • Another Method titled averageAllClassesMarks for computing the average (as single array of double) of all the classes class student’s marks (given to the method as a 2dimensional array). This method has to repeatedly call the…
Q: Convert this to sorted array #include<iostream> #include"Student.cpp" class StudentList { private: struct ListNode { Student astudent; ListNode *next; }; ListNode *head; public: StudentList(); ~StudentList(); int IsEmpty(); void Add(Student newstudent); void Remove(); void DisplayList(); }; StudentList::StudentList() { head=NULL; }; StudentList::~StudentList() { cout <<"\nDestructing the objects..\n"; while(IsEmpty()!=0) Remove(); if(IsEmpty()==0) cout <<"All students have been deleted from a list\n"; }; int StudentList::IsEmpty() { if(head==NULL) return 0; else return 1; }; void StudentList::Add(Student newstudent) { ListNode *newPtr=new ListNode; if(newPtr==NULL) cout <<"Cannot allocate memory"; else { newPtr->astudent=newstudent; newPtr->next=head; head=newPtr; } }; void StudentList::Remove() { if(IsEmpty()==0) cout <<"List empty on remove"; else { ListNode *temp=head;…
classHighArrayApp { public static void main(String[] args) { intmaxSize=100;// array size HighArrayarr;// reference to array arr=newHighArray(maxSize);// create the array arr.insert(77);// insert 10 items arr.insert(99); arr.insert(44); arr.insert(55); arr.insert(22); arr.insert(88); arr.insert(11); arr.insert(00); arr.insert(66); arr.insert(33); arr.display();// display items intsearchKey=35;// search for item if(arr.find(searchKey)) System.out.println("Found " + searchKey); else System.out.println("Can’t find " + searchKey); arr.delete(00);// delete 3 items arr.delete(55); arr.delete(99); arr.display();// display items again }// end main() }// end class HighArrayApp // highArray.java // demonstrates array class with high-level interface // to run this program: C>java HighArrayApp //////////////////////////////////////////////////////////////// class HighArray { private long[] a; // ref to array a private int nElems; // number of data items…
Create a program that will encrypt letters and create a secret code. You will create an array of numbers from 0 - 25. use [i for i in range (26)] to create an array of numbers from 0 - 25. use random.shuffle to to shuffle the above array. This will be used for a new letter index order. For example: The first created array [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25] gets shuffled to become[2, 14, 12, 20, 16, 5, 11, 1, 13, 17, 15, 21, 19, 10, 23, 22, 25, 3, 6, 7, 18, 4, 9, 24, 0, 8] This will be used as the new index for the encrypted alphabet. create an array of letters using list(string.ascii_lowercase), this requires importing the string module. This will create: ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z'] Accept an input of a word. Using the above tables take each letter of the word and convert it to the encrypted letter. Print each…
Create a program that will encrypt letters and create a secret code. You will create an array of numbers from 0 - 25. use [i for i in range (26)] to create an array of numbers from 0 - 25. use random.shuffle to to shuffle the above array. This will be used for a new letter index order. For example: The first created array [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25] gets shuffled to become[2, 14, 12, 20, 16, 5, 11, 1, 13, 17, 15, 21, 19, 10, 23, 22, 25, 3, 6, 7, 18, 4, 9, 24, 0, 8] This will be used as the new index for the encrypted alphabet. create an array of letters using list(string.ascii_lowercase), this requires importing the string module. This will create: ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z'] Accept an input of a word. Using the above tables take each letter of the word and convert it to the encrypted letter. Print each…
Below you will find code blocks necessary to insert a value into an ordered array given a position (index) to insert. Be careful! Some lines are not needed. first line COMPLETED: bool insertElement(char array[ ], int& numElems, int &capacity, in position, char value) { last line COMPLETE: bool insertElement(char array[ ], int numElems, int capacity, in position, char value) {
Select true or false for the statements below. Explain your answers if you like to receive partial credit Select true or false for the statements below. Explain your answers if you like to receive partial credit Which of the following is true about searching elements in an unordered array? With the data is unsorted, search is O(n) because if the element you are looking for is not there, you have to check every element in the array If you start at the end of the array and traverse to index 0, search improves to O(log n) because you only have to look at half of the array If you get lucky with checking the first element and find it immediately, then the worst case performance of search improves to O(n^2) Which of the following is true about searching elements in an ordered array? You cannot use binary search on an ordered array so the performance is O(n) If there are no holes in the array and the elements are all next to each other, then the performance for search improves to…
There is an array with the original content as follows61,12,95,89,65,23,45,78,57,33Now execute Bubble sort, from small to large, please write the contents of the array after Pass 3