. Given an alphabet with opening and closing parentheses {), (} only, create a regex that validates all strings containing the sub-string (((). Make sure to support your answer with the proper reasoning. 2. Build a regular expression that captures the 10-digit US phone numbers (10 digits excluding the coun- try code, country code is optional), where # means any number from 0 to 9. Make sure to support your answer with the proper reasoning. It is recommended to use # instead of [0-9] for simplicity and you can follow the rules mentioned below as your test cases (this list is not exhaustive). • ########## • ###-###-#### • (###) ###-#### • ###.###-#### • ### ### #### • ###.###.#### • +1 ### ### ####

. Given an alphabet with opening and closing parentheses {), (} only, create a regex that validates all strings containing the sub-string (((). Make sure to support your answer with the proper reasoning. 2. Build a regular expression that captures the 10-digit US phone numbers (10 digits excluding the coun- try code, country code is optional), where # means any number from 0 to 9. Make sure to support your answer with the proper reasoning. It is recommended to use # instead of [0-9] for simplicity and you can follow the rules mentioned below as your test cases (this list is not exhaustive). • ########## • ###-###-#### • (###) ###-#### • ###.###-#### • ### ### #### • ###.###.#### • +1 ### ### ####

EBK JAVA PROGRAMMING

8th Edition

ISBN:9781305480537

Author:FARRELL

Publisher:FARRELL

Chapter16: Graphics

Section: Chapter Questions

Problem 14RQ

See similar textbooks

Similar questions

1. Given an alphabet with opening and closing parentheses {), (} only, create a regex that validates allstrings containing the sub-string (((). Make sure to support your answer with the proper reasoning.2. Build a regular expression that captures the 10-digit US phone numbers (10 digits excluding the coun-try code, country code is optional), where # means any number from 0 to 9. Make sure to supportyour answer with the proper reasoning.It is recommended to use # instead of [0-9] for simplicity and you can follow the rules mentionedbelow as your test cases.• ##########• ###-###-####• (###) ###-####• ###.###-####• ### ### ####• ###.###.####• +1 ### ### ####
Trace the evaluation of the expressions and give the resulting values. (Make sure to give a value of the appropriate type, such as including a .0 at the end of a double result. If the result is a String, enclose the String in double quotes.) 8 / 5 + 13 % 2 / 3.0 0 / 4 / 2 (12 + (8 * -1) - 3) / 4 * 2 5 * 7 % 4 + “Hi” + 4 - 3
given the strings s1 and s2, not necessarily of the same lenght, create a new string consisting of alternating characters of s1 and s2 (that is, the first character of s1 followed by the first character of s2, followed by the second characters of s1, followed by the second character of s2, and so on. Once the end of either string is reached, the reminder of the longer string is added to the end of the new string. For example, if s1 contained "abc" and s2 contained"uvqxyz", then the new string should contain "aubvcwxyz". Assign the new string to the variable s3. using python and loops
Write a program that will analyze a string by counting the number of each alphabetic letter in the stringand then printing a vertical histogram showing the frequency of the letters in the string.For example, if text = "I love problem-solving.", your program should plot when thehistogram is printed: * * * * * * * * * * * * * * * * * * *---------------------------------------------------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 zNote that all special characters including blanks are ignored and alphabet letters are caseinsensitive.Create your source code file named Lab10FirstnameLastname.java in NetBeans and add thefollowing menu to the main method in the Lab10FirstnameLastname class.T: Enter a text stringP: Plot alphabetic frequencies in the stringQ: QuitSelect an option:Add the following Histogram class to your source code file and complete the setText(Stringt) and drawHistogram() methods to do the work for options T and P in your main menu.The setText(String t)method changes…
can you solve this please? Adopt appropriate Java animation code to implement the video in the file “test4.wmv” and given that the parametric equation for a circle. x=r*cos(t) y=r*sin(t) with t in range [0, 2p] and r is the radius of the circle. (the circle goes in a loop like in the images, i did my best to try to explain it , please try to do it ) and here is a sample of what they want me to use : package javaapplication1;import java.awt.*;import java.awt.event.*;import javax.swing.*;import java.awt.geom.*;import java.util.Random;import javax.imageio.*;import java.io.File;import java.io.IOException;import java.awt.image.BufferedImage;import java.awt.event.*;import java.util.Calendar; public class JavaApplication1 extends JApplet { public static void main(String[] args) { JFrame frame=new JFrame(); frame.setTitle("hello"); frame.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE); JApplet applete =new JavaApplication1(); applete.init();…
Given a text string, create and return a new string of same length where all vowels have been reversed, and all other characters are kept as they were. For simplicity, in this problem only the characters aeiouAEIOU are considered vowels, and y is never a vowel. For example, given the text string "Uncle Sente lives in Russia", this method should create and return the string "Ancli Sunti levis en Resseu".Furthermore, to make this problem more interesting and the result look more palatable, this method must maintain the capitalization of vowels based on the vowel character that was originally in the position that each new vowel character is moved into. For example, "Ilkka Markus" should become "Ulkka Markis" instead of "ulkka MarkIs". Use the handy character classification methods in the Character utility class to determine whether some particular character is in upper or lower case, and convert some character to its upper or lower case version as needed. Here's the tester it must…
Write a Python program to find the first appearance of the substring 'too' and'good' from a given string. If 'good' follows the 'too', replace the whole 'too'' good'substring with 'excellent' and print the resulting string. If the above does notappear, print the string as it is.
Consider the DFA M = (Q,Σ,δ,q1,F) where Q = {q1,q2,q3,q4},Σ = {a,b},F = {q4} andδ(q1,a) = q2,δ(q2,b) = q3,δ(q3,a) = q4,δ(q3,b) = q1.Convert this DFA to a regular expression using the method discussed in class (as this automaticallyproves that the answer is correct, as the algorithm is proven correct). You only need to calculate sub-expressions if it is necessary towards the final answer. Also, simplify each subexpression using any lawdiscussed in class (including those derived on the board). To summarize, those were 1) (ε+ R)∗= R∗,2) S ·R∗= R∗if L(S) ⊆L(R∗) and ε ∈S, and 3) S + R = R if L(S) ⊆L(R).
Write a program that compares twostrings, and display "same text" if they arethe same, "different texts" if they aredifferent.
A robot is placed at the origin of a 2D coordinate plane (i.e. position (0, 0)). The robot is given a string Scontaining N characters in {N, E, S, W} as its instructions. For each character from the beginning of the string,the robot has to move 1 unit to the following direction:• If the character is N, the robot has to move 1 unit to the positive y-axis direction.• If the character is E, the robot has to move 1 unit to the positive x-axis direction.• If the character is S, the robot has to move 1 unit to the negative y-axis direction.• If the character is W, the robot has to move 1 unit to the negative x-axis direction.You do not know the string S. However, you know another string P that is an anagram of S (i.e. P has thesame number of N, E, S, W characters as S). You also have M data points: T1...M, X1...M, and Y1...M. For alli, you know that the robot is at position (Xi, Yi) after moving exactly Ti units.You want to know the number of possible string S that satisfies all the…
Another question, I suppose to draw a snowflake using this function, but everytime I get to the "whole" part when I put part 1,2,3 together, python tells me that I'm getting Syntax errors. def snowflake(): part1 = kochize(5) part2 = rotate(2*(pi/3))(kochize(5)) part3 = rotate((-2*(pi/3))(kochize(5)) whole = connect_ends((part1, part2), part3) return whole I don't understand why am I getting syntax errors with line5 of this function.
A very known application in natural language processing is to extract information from a given text. In this lab, you will be able to extract some emotions (Sad and Happy) from a given string and calculate the score of each emotion. You will be given below the words that express sadness, anger, and happiness. For each word, you will be given weight as well, so that when you are calculating for example the score for sadness in the text (string), you can use this formula: