The characters 0, 1,..., 9 are called digits. Note that you can get a list of all string methods with dir (str), and help with a specific method with help (). E.g. for information about the split method, help(str.split). Implement a function get_digits (cs: str) -> str that returns cs with all of its non-digits removed. >>>get_digits ("a1b2c3") 123 Task Examples

The characters 0, 1,..., 9 are called digits. Note that you can get a list of all string methods with dir (str), and help with a specific method with help (). E.g. for information about the split method, help(str.split). Implement a function get_digits (cs: str) -> str that returns cs with all of its non-digits removed. >>>get_digits ("a1b2c3") 123 Task Examples

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 16PE: The implementation of a queue in an array, as given in this chapter, uses the variable count to...

See similar textbooks

Similar questions

do the changes in this program according to the given instruction like coaches instead of teachers,sports name instead of courses etc, import java.util.*;class CourseManager{//toatl students each section can holdstatic int max_Students;//mapping of each sections w.r.t to courseHashMap<String,ArrayList<Section> > courses ; //constructor for CourseManagerpublic CourseManager(int max){max_Students = max;courses = new HashMap<>();}//class Person which will be used by teacher and students to inherit its propertiesstatic class Person{String name;int age;public Person(String name , int age ){this.name = name;this.age = age;}}//teacher classstatic class Teacher extends Person{int id;public Teacher(int id , String name , int age ){super(name , age );this.id = id;}}//student classstatic class Student extends Person{int id;public Student(int id , String name , int age ){super(name , age );this.id = id;}}//section classstatic class Section{int section;String course ;Teacher…
I have to implement a SubstringGenerator (class) that generates all substrings of a string recursively. For example, the substrings of the string “rum” are the seven strings “rum”, “ru”, “r”, “um”, “u”, “m”, “” Hint: First enumerate all substrings that start with the first character. There are n of them if the string has length n. Then enumerate the substrings of the string that you obtain by removing the first character. Here is what your output should look like after your project is completed. (The order of your substrings is not important, if your generator produces all substrings correctly). Substrings of "ab" Actual: '' 'b' 'a' 'ab' Expected: '' 'b' 'a' 'ab' Substrings of "abc" Actual: '' 'c' 'b' 'bc' 'a' 'ab' 'abc' Expected: '' 'c' 'b' 'bc' 'a' 'ab' 'abc' Substrings of "abc123" Actual: '' '3' '2' '23' '1' '12' '123' 'c' 'c1' 'c12' 'c123' 'b' 'bc' 'bc1' 'bc12' 'bc123' 'a' 'ab' 'abc' 'abc1' 'abc12' 'abc123' Expected: '' '3' '2' '23' '1' '12' '123' 'c' 'c1'…
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;…
The split method in the String class returns an array of strings consisting of the substrings split by the delimiters. However, the delimiters are not returned. Implement the following new method that returns an array of strings consisting of the substrings split by the matching delimiters, including the matching delimiters. public static String[] split(String s, String regex) For example, split("ab#12#453", "#") returns ab, #, 12, #, and 453 in an array of String and split("a?b?gf#e", "[?#]") returns a, ?, b, ?, gf, #, and e in an array of String.
Please implement in Java implement a keyed bag in which the items to be stored are strings (perhaps people’s names) and the keys are numbers (perhaps Social Security or other identification numbers). So, the in- sertion method has this specification: public void insert(String entry, int key);// Precondition: size( ) < CAPACITY, and the // bag does not yet contain any item// with the given key.// Postcondition: A new copy of entry has// been added to the bag, with the given key. When the programmer wants to remove or retrieve an item from a keyed bag, the key of the item must be specified rather than the item itself. The keyed bag should also have a boolean method that can be used to determine whether the bag has an item with a specified key. In a keyed bag, the pro- grammer using the class specifies a particular key when an item is inserted. Here’s an implementation idea: A keyed bag can have two private arrays, one that holds the string data and one that holds the corresponding…
Improve the given code below, make sure that the code will require input from the user. Problem: Write a JavaScript function that would accept a string and return the reverse of that string. const reverse = (str) => {const arr = []; //stores character in rev orderconst len = str.length; //finds the length of the stringlet i;for(i = len; i >= 0; i--)arr.push(str[i]); //adds the chars of str to arrreturn arr.join('');} let stringTest, reverseString; //for dummy stringstringTest = "john gabriel";reverseString = reverse(stringTest); console.log("Num3");console.log(`Reverse of the string "${stringTest}" is: "${reverseString}"`);console.log("\n");
In java, Implement a method that removes all duplicates. Keep the first instance of the element but remove all subsequent duplicate elements.public void removeDuplicates() see the picture for the right output. Given files: Demo6.java public class Demo6 { public static void main(String[] args) { MyLinkedList<String> list = new MyLinkedList<>(); TestBench.addToList(list); TestBench.addToList(list); TestBench.addToList(list); TestBench.addToList(list); for (int x = 0; x < list.size(); x += 1 + x/3) { System.out.println("Removing element at index: " + x); list.remove(x); } System.out.println("Result"); System.out.println(list); System.out.println("Shuffling"); list.shuffle(7777); System.out.println(list); System.out.println("Removing duplicates (keeping first instance)"); list.removeDuplicates(); System.out.println(list); }} TestBench.java import java.util.AbstractList; public class TestBench { public static…
Improve the given code below, make sure that the code will require input from the user. Problem: Write a JavaScript function that would accept a string and returns its letters in alphabetical order. function alpha(str){let res;var arr = str.split(""); //splits the strres = arr.sort().join(""); //sorts arr && forms to a strreturn res;}console.log("Num5");console.log(alpha("CSIT201"));
Complete the method below that prints all elements that are in both Set<String> s and Set<String> t. Each matching element should be followed by a space. What can I change to make it work? import java.util.Set;import java.util.Iterator; public class Sets{ public static void printMatches(Set<String> s, Set<String> t) { System.out.print("{ "); while(in.hasNext()){ String next = in.next(); { if((s.contains(next))&& (t.contains(next))){ System.out.print(next+" "); } } System.out.println("}"); }} import java.util.Set;import java.util.TreeSet;import java.util.Arrays; public class SetsTester{ public static void main(String[] args) { Set<String> set1 = new TreeSet<>(Arrays.asList("Bob", "Bill", "Sally")); Set<String> set2 = new TreeSet<>(Arrays.asList("Sam", "Bob", "Frank")); Sets.printMatches(set1, set2);…
Your tasks Implement the methods marked with ??? package percentiles: /** * Given a non-empty sequence of elements of type T, returns the smallest element e * in the sequence for which it holds that at least p percent of the elements in the sequence * are smaller or equal to e. * Note the special cases: * - when p == 0, the result should be the smallest element in the sequence * - when p == 100, the result should be the largest element in the sequence * If the sequence is empty, java.lang.IllegalArgumentException is thrown. * * For a sequence of length n, the method should make at most n*log(n) * [again, here log means base-2 logarithm] comparison operations between * the elements in the sequence. * Furthermore, assuming that comparison is a constant-time operation, * the whole method should run in O(n*log(n)) time. * Hint: you can assume that the "sorted" method of Seq performs at most n*log(n) comparisons for * sequences of…
in python """Write a function get_new_grades, such that given a string of grades as an input parameter,returns two objects:the initial grades as a list of numerical valuesas well asa new list with the numerical values, where the scores that are less than 50 are replaced by 50. """
The String class implements Comparable, which means that two strings can be compared to each other. However, the default implementation orders strings based on the ASCII values of their characters, which means that strings that begin with an uppercase letter are always ordered before strings that begin with a lowercase letter. This means that the string “Zoo” would be ordered before the string “aardvark”. Write a Comparator that compares two strings alphabetically so that “aardvark” is ordered before “Zoo”. Hint: convert both strings to upper or lowercase before comparing them.