Question 3 Students are required to create 5-character long passwords to access the library. The letters must be from lowercase letters or digits. Each password must start with a lowercase letter and end with a digit and contain at most 2 digits. How many valid passwords are there? Question 4 0 6-sto 1 a) Give an example of a string that is accepted by this automaton. b) Give an example of a string that is rejected by this automaton. c) Describe the language of this automaton.

Question 3 Students are required to create 5-character long passwords to access the library. The letters must be from lowercase letters or digits. Each password must start with a lowercase letter and end with a digit and contain at most 2 digits. How many valid passwords are there? Question 4 0 6-sto 1 a) Give an example of a string that is accepted by this automaton. b) Give an example of a string that is rejected by this automaton. c) Describe the language of this automaton.

EBK JAVA PROGRAMMING

8th Edition

ISBN:9781305480537

Author:FARRELL

Publisher:FARRELL

Chapter16: Graphics

Section: Chapter Questions

Problem 14RQ

See similar textbooks

Similar questions

Question 2 (a). Using the string T = “EVERY GOOD BOY DESERVES FAVOUR", find the following: (i). SUBSTRING(T,24,6)//" “I/ SUBSTRING(T,7,8)//SUBSTRING(T,18,1) (ii). LENGTH(T).
IN JAVA Create a function that takes a string and returns the number of alphanumeric characters that occur more than once. Examples duplicateCount ("abcde") → 0 duplicateCount ("aabbcde") → 2 duplicateCount ("Indivisibilities") → 2 duplicateCount ("Aa") → 0 // Case sensitive
Introductory: The Caesar Cipher technique is one of the earliest and simplest methods of encryption techniques. It is simply a type of substitution cipher, i.e., each letter of a given text is replaced by a letter some fixed number of positions down the alphabet. For example, with a shift of 1, A would be replaced by B, B would become C, and so on. The method is apparently named after Julius Caesar, who apparently used it to communicate with his officials. Thus, to cipher a given text we need an integer value, known as a shift which indicates the number of positions each letter of the text has been moved down. The encryption can be represented using modular arithmetic by first transforming the letters into numbers, according to the scheme, A = 0, B = 1 ,…, Z = 25. Encryption of a letter by a shift n can be described mathematically as. En(x) = (x+n) mod 26 (Encryption Phase with shift n) Write an algorithm and implement a program in C to read the data from a file (called…
Q2: Secret Courses Dan’s recently announced that he’s teaching n top-secretcourses nextsemester. Instead of enrolling in them through ACORN, students need to email Dan to express theirinterests. These courses are numbered from 1 to n in some arbitrary order. In particular, if a student named s is interested in taking a course c, they need to send an email to Dan containing the message c s. Note that if a student is interested in taking multiple courses, they need to send multiple emails, one per course. Upon receiving a message c s, Dan looks at the list of students already enrolled in course c. If there’s already a student on the list whose name is too similar to s, Dan assumes s is the same student and ignores the message. Otherwise, he enrolls s in the course. Dan considers two names too similar if and only if they have the same length and differin at most one letter(note that“a” and “A” are considered the same letter). For example, “Josh” and “Josh” are too similar. “Sam” and “CaM”…
public static String pancakeScramble(String text) This nifty little problem is taken from the excellent Wolfram Challenges problem site where you can also see examples of what the result should be for various arguments. Given a text string, construct a new string by reversing its first two characters, then reversing the first three characters of that, and so on, until the last round where you reverse your entire current string
Submission Instructions Follow the instructions for How to Submit Programming Assignments. Assignment First, launch NetBeans and close any previous projects that may be open (at the top menu go to File ==> Close All Projects). Then create a new Java application called "Parser" (without the quotation marks) that uses methods to: Get a comma-delimited String of integers (e.g. "4, 8, 16, 32") from the user at the command line and then convert the String to an ArrayList of integers (using the wrapper class) with each element containing one of the input integers in sequence Print the integers to the command line, using a for loop, so that each integer is on a separate line BE SURE TO INCLUDE THE REQUIRED COMMENTS AND DOCUMENTATION AS WELL AS THE OUTPUT FROM MULTIPLE PROGRAM RUNS AS A COMMENT BLOCK AT THE BOTTOM OF YOUR SOURCE CODE FILE. See Grading Rubric.
public static String pancakeScramble(String text) This nifty little problem is taken from the excellent Wolfram Challenges problem site where you can also see examples of what the result should be for various arguments. Given a text string, construct a new string by reversing its first two characters, then reversing the first three characters of that, and so on, until the last round where you reverse your entire current string.This problem is an exercise in Java string manipulation. For some mysterious reason, the Java String type does not come with a reverse method. The canonical way to reverse a Java string str is to first convert it to mutable StringBuilder, reverse its contents, and convert the result back to an immutable string, that is,str = new StringBuilder(str).reverse().toString(); Here's the tester it must pass: @Test public void testPancakeScramble() throws IOException {// Explicit test casesassertEquals("", P2J3.pancakeScramble(""));assertEquals("alu",…
"000" is a string commonly found in weak passwords. Count the number of occurrences of "000" in keyWord and remove all instances of "000" from keyword. Ex: If the input is 000kgnklv$L#x000, then the output is: Number of violations: 2 Remaining string: kgnklv$L#X Note: string.find(item) returns the index of the first occurrence of item in string. If no occurrence is found, then the function returns string:npos. • string.replace(indx, num, subStr) replaces characters at indices indx to indx+num-1 with a copy of subStr. 3 using namespace std; 4 5 int main() { 6 7 8 9 10 11 count = 0; 218H15 16 18 19 string keyword; int count; int index; 12 index = 0; 13 cin >> keyword; 17 14 /* Your code goes here */ cout << "Number of violations: " << count << endl; cout << "Remaining string: " << keyword << endl; return 0; D
"qwerty" is a string commonly found in weak passwords. Replace the occurrences of "qwerty" in passwdStr with "mvhnkl". Ex: If the input is qwerty4<9k@VHP75J8&qwerty, then the output is: Adjusted password: mvhnkl4<9k@VHP75J8&mvhnkl Note: string.find(item) returns the index of the first occurrence of item in string. If no occurrence is found, then the function returns string::npos. string.replace(indx, num, subStr) replaces characters at indices indx to indx+num-1 with a copy of subStr. #include <iostream>#include <string>using namespace std; int main() { string passwdStr; int i; cin >> passwdStr; i = 0; cout << "Adjusted password: " << passwdStr << endl; return 0;}
"qwerty" is a string commonly found in weak passwords. Replace the occurrences of "qwerty" in passwdStr with "mvhnkl". Ex: If the input is qwerty4<9k@VHP75J8&qwerty, then the output is: Adjusted password: mvhnkl4<9k@VHP75J8&mvhnkl Note: string.find(item) returns the index of the first occurrence of item in string. If no occurrence is found, then the function returns string::npos. string.replace(indx, num, subStr) replaces characters at indices indx to indx+num-1 with a copy of subStr.
public static String pancakeScramble(String text) This nifty little problem is taken from the excellent Wolfram Challenges problem site where you can also see examples of what the result should be for various arguments. Given a text string, construct a new string by reversing its first two characters, then reversing the first three characters of that, and so on, until the last round where you reverse your entire current string. This problem is an exercise in Java string manipulation. For some mysterious reason, the Java String type does not come with a reverse method. The canonical way to reverse a Java string str is to first convert it to mutable StringBuilder, reverse its contents, and convert the result back to an immutable string, that is, str = new StringBuilder(str).reverse().tostring(); A bit convoluted, but does what is needed without fuss or muss. Maybe one day the Java strings will come with the reverse method built in, just like the string data types of all sensible…
Create a function that tracks how many times a phrase appears in a string. An number must be returned by the function. Never presume that a string of words can contain punctuation and only one space between words. Create the method with either a String argument or a StringBuilder object so that it can be used.