Please use python • create_equation(n, pct_per_digit): Takes one positive odd integer and one float in [0, 1[ as input.Returns a randomly-created mathematical equation as a list of tokens. The list should be of lengthn. The second input determines the chance that a number in the equation will have more than onedigit. The equation does not have to be correct (i.e., the equality does not have to hold), but itmust be syntactically valid (e.g., there cannot be two numbers or operators next to each other).An equation is formed by placing together numbers and mathematical operators, and an equals signsomewhere in the middle. Note that a mathematical operator can only be in between two numbers;it can never be at the start or end of the equation. Note: You do not have to include parenthesesin your equation.One way to approach this function is to generate a random number, followed by a random operator,and then repeat until the desired length is obtained. Then you could randomly replace one of theoperators with the equals sign.Note: the following examples are dependent on a particular way of randomly generating an equation.Your approach to generating an equation (e.g., your particular ordering of the calls to randomfunctions) will result in different equations, and that is fine. We will be checking to see that theequations returned by your function are random, of correct length, syntactically valid, and cancontain all the possible digits and operations.>>> random.seed(42)>>> create_equat ion(9, 0.0)[1, '/', 3, '=', 9, '^', 1,IAI", 4]>>> random.seed(1337)>>> create_equat ion(7, 0.5)[9, '/', 3, '=', 56, 'x', 6]>>> random.seed(9001)>>> create_equation(11, 0.75)[95498187,'=',', 4724, 'x', 179840685193, '/', 1469713, '+',, 65638, '/', 3]

from blackout_utils import * import random random.seed(9001) OPERATIONS = ['^', 'x', '/', '+', '-']…

Answered: create_equation(n, pct_per_digit):…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Make an array called array with three elements in it, a hashmap /dict / associative array called hash with three elements in it, and a string variable called str with at least 15 characters where one of those characters is duplicated twice (i.e., in the string at least 3 times). hint: declare -a array #creates an index array & declare -A hash #creates an associative array Use echo to print both your arrays (both ‘array’ and ‘hash’) as strings on a single line. (Use loops) Save just a portion of your indexed array to a new array variable. Write a loop to print out each item of the new array on a line by itself. Remove the last element from your indexed array. Remove the first element from your index array. Use echo to print out your indexed array on a single line. Use an if statement to do this: If your array contains 2, print “true” otherwise print “false” Create a read-only string variable and demonstrate that it cannot be changed. Echo a substring of str which…
You will also have to write Student Tests that test the following in the provided file.i. Adding element(s).ii. Get elements at index – (1) with a valid index and (2) with an invalid indexiii. Test equality of two StringArrayLists (of size 0, 2)iv. Test if a StringArrayList contains a String (test both true and false cases)v.Test removing a String from a StringArrayList.
JAVA Create a new class HashSetManipulation with a main method. Create a new HashSet set and populate it with initial values "A", "B", and "C" using the add method. Print the size of the set using set.size(). Use a for loop to print the values in the set. Use the add method to add a new value "D" to the set and print the result of the set to show that the value has been added. Use the remove method to remove value "A" from the set and print the result of the set to show that the value has been removed. Use the contains method to check if the value "C" exists in the set and print the result.
Java question Use the Iterator Pattern: Create a class called Exercise, and then, in its main method, create an ArrayList called stringArrayList. Add the following five strings to stringArrayList: “one”, “two”, ”three”, ”four”, ”five”. Then, use a for loop and the index of stringArrayList to print all these five strings out to the console. 2. For stringArrayList above, can you use an iterator to traverse the five strings inside, without using the index? 3. If change stringArrayList into a TreeSet, how do you traverse the five strings use an iterator? Implement an Iterator: 4. Create a class called StringArray that is able to store a number of String objects. Create an instance variable, String[] values, (internal data storage) of StringArray to store all the strings. 5. Create a constructor for StringArray, which is able to build an object of StringArray using the parameter. public StringArray(String[] values) 6. Make the class StringArray implements…
1. Write the statement that will add an association of a person named “John” and the college called “Middlesex” in the Map called friends. 2. Given the following code fragments, identify if an exception is thrown and what is that exception.a.) Map<String, String> m = new HashMap<String, String>( );String obj = m.get(“hello”); b.) String str = " ";Set<String> s = new HashSet<String>( );s.add(“The”);s.add(“rain”);s.add(“in”);s.add(“New Jersey”);for (Iterator<String> i = s.iterator( ); i.hasNext( );)str = str + (Integer) i.next( );
Implement the Plates class buildMap function so that it populates the HashMap with the state abbreviations as keys and the counts of how many each appear in the file as values. Sometimes, the parking attendant will add special notation to help her remember something about a specific entry. There are just non alphabetic characters that she adds to the state - your program should ignore these characters so that an entry like NY* still counts toward the NY plate count. She is also very inconsistent with how she enters the plates. Sometimes she uses upper case, sometimes lowercase, and sometimes she even uses a mix. Be sure to account for this in your program. Only add information for plates in New England (Maine, New Hampshire, Vermont, Massachusetts, Rhode Island, and Connecticut). Plates.java import java.util.Arrays; import java.util.HashMap; import java.util.HashSet; import java.util.Map; import java.util.Set; public class Plates { private Map<String, Integer> plateMap;…
Try to do it asap give output screenshots Complete the code, where it says "TO DO" code: #ifndef __SLLIST_H__ #define __SLLIST_H__ #include "Node.h" #include <cassert> // size should not be negative typedef unsigned long size_t; namespace ds { template <typename ItemType> class TestDriver; // for autograding; please ignore /** Singly linked list. */ template <typename ItemType> class SLList { friend class TestDriver<ItemType>; // for autograding; please ignore private: /** Pointer pointing to the sentinel node. */ Node<ItemType> *sentinel; /** Stores the current size of the list. */ size_t count; public: /** Construct a new SLList object. */ SLList() { sentinel = new Node<ItemType>(ItemType(), nullptr); count = 0; } /** Add x at the beginning of the list. */ void addFirst(ItemType x) { count += 1;…
(IN JAVA) Implement a mergeUniqueValues(arr1, arr2) method. When passed two arrays of strings, it will return an array containing the strings that appear in either or both arrays in sorted order. And the returned array should have no duplicates. For example, if you have two string arrays: arr1: {“Bear”, “Elephant”,”Fox”}arr2: {“Panda”, “Elephant”,”Eagle”} Calling mergeUniqueValues(arr1, arr2) should return a merged and sorted array like: Bear, Eagle, Elephant, Fox, Panda
Perform the following. 1) Conver the infix expression a/b-c+d*e-a*c into postfix expression and trace that postfix expression for given data a=6, b=3, c=1, d=2 , e=4 .2) A student is asked to develop an application as part of mini project which reverses the order of numbers, such that the number that is placed last in the list will be removed first. The list can hold any number of elements. Implement the following menu based C++program for the same.
import java.util.ArrayList; class Rack { privateArrayList<Tile>tiles; publicRack() { tiles=newArrayList<Tile>(); } publicvoidaddTile(Tilet) { tiles.add(t); } /* DO NOT CHANGE THE ABOVE CODE. YOUR JOB IS TO ADD THE FOLLOWING METHODS: .toString() .sortHighToLow() You may also add any helper methods you want, such as swapValues. Note that we want to sort Tiles from highest value to lowest */
2. Using the Hashtable class, write a spelling checker program that readsthrough a text file and checks for spelling errors. You will, of course, haveto limit your dictionary to several common words.3. Create a new Hash class that uses an arraylist instead of an array for thehash table. Test your implementation by rewriting (yet again) the computerterms glossary application.
Write a Java application CountryList. In the main method, do the following:1. Create an array list of Strings called countries.2. Add "Canada", "India", "Mexico", "Peru" in that order.3. Use the enhanced for loop to print all countries in the array list, one per line.4. Add "Spain" at index 15. Replace the element at index 2 with "Vietnam". You must use the set method.6. Replace the next to the last element with "Brazil". You must use the set method. You willlose one point if you use 3 in the set method. Do this in a manner that would replace thenext to the last element, no matter the size of the array list.7. Remove the object "Canada" Do not remove at an index. Your code should work if"Canada" was at a different location. There is a version of remove method that willremove a specific object.8. Get and print the first element followed by "***"9. Call method toString() on countries to print all elements on one line.10. Use the enhanced for loop to print all countries in the array list,…

SEE MORE QUESTIONS

Recommended textbooks for you

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

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

SEE MORE TEXTBOOKS