3. Give the following FAs over the alphabet Σ = {0,1,2} a-) A DFA for { strings in which the number of even digits is odd} c-) A DFA for { strings, when interpreted as a base-3 number, are even numbers having odd number of even digits } e-) An-NFA for {@lo, when interpreted as a base-3 number, is an even number} (@: reverse of @ )

3. Give the following FAs over the alphabet Σ = {0,1,2} a-) A DFA for { strings in which the number of even digits is odd} c-) A DFA for { strings, when interpreted as a base-3 number, are even numbers having odd number of even digits } e-) An-NFA for {@lo, when interpreted as a base-3 number, is an even number} (@: reverse of @ )

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter8: Arrays And Strings

Section: Chapter Questions

Problem 21PE

See similar textbooks

Similar questions

use c++ program A positive integer n is called prime if n > 1 and the only factors of n are 1 and n. It is known that a positive integer n > 1 is prime if n is not divisible by any prime integer m≤√n . The 1230th prime number is 10,007. Let t be an integer such that 2 ≤ t ≤ 100,000,000. Then t is prime if either t is equal to one of the first 1,230 prime numbers or t is not divisible by any of the first 1,230 prime numbers. Write a program that declares an array of size 1,230 and stores the first 1,230 prime numbers in this array. The program then uses the first 1,230 prime numbers to determine if a number between 2 and 100,000,000 is prime. If a number is not prime, then output at least one of its prime factors.
Solve the problem in C++ (Anagrams) Write a function that checks whether two words are anagrams. Two words are anagrams if they contain the same letters in any order. For example, “silent” and “listen” are anagrams. The header of the function is as follows: bool isAnagram(const string& s1, const string& s2) Write a test program that prompts the user to enter two strings and checks whether they are anagrams. Sample Run 1 Enter a string s1: silent Enter a string s2: listen silent and listen are anagrams Sample Run 2 Enter a string s1: split Enter a string s2: lisp split and lisp are not anagrams
You must answer the Problem in C++. (Anagrams) Write a function that checks whether two words are anagrams. Two words are anagrams if they contain the same letters in any order. For example, “silent” and “listen” are anagrams. The header of the function is as follows: bool isAnagram(const string& s1, const string& s2) Write a test program that prompts the user to enter two strings and checks whether they are anagrams. Sample Run 1 Enter a string s1: silent Enter a string s2: listen silent and listen are anagrams Sample Run 2 Enter a string s1: split Enter a string s2: lisp split and lisp are not anagrams
Please code in C++. Write a program that simulates a coin-tossing game. At the beginning of the game, each of N players has a single fair coin and M points. The game performs a sequence of passes until only a minimum number of players remain. In a pass the players toss their coins into the air and when the coins fall to earth, the players count the number of coins that show heads and the number of coins that show tails. If the number of heads exceed the number of tails, then the players who tossed heads increase their points by an integer P and the players who tossed tails decrease their points by the same integer P. The players perform the opposite actions when the number of tails is greater than the number of heads. If the number of heads equals the number of tails, then no player’s points change. If any player’s points fall below one, then the player leaves the game, never to return. The game employs a second integer K to compute P’s value. K’s and P’s initial values are one.…
• R7.17Consider the following code that repeats a C++ string three times. string a = "Hello"; string b = a + a + a; Suppose s is a C string, and t is declared as char t[100]; Write the equivalent code for C strings that stores the threefold repetition of s (or as much of it as will fit) into t.
This is in C++ Let's assume that we start with the following variable declarations and initializations: std::string s = "perfect"; std::list<std::string> a1{"Boo", "is", s, "today"}; const std::list<std::string> a2{"Boo", "will", "always", "be", s}; std::map<int, double> m1{{3, 4.5}, {0, -7.25}, {1, 9.75}}; Now assume that you wrote the following variable declarations and initializations using the auto specifier in place of a type. Assume that each is separate from the others (i.e., it's not an error that they all have the same variable name) and that any necessary C++ Standard Library headers have been included already. auto x = 2005; auto x = a1.begin(); auto x = a2.end(); auto x = a1.size(); auto x = m1[3]; auto& x = m1[3]; auto x = *(m1.begin()); auto x = std::accumulate( a1.begin(), a1.end(), std::string{}.size(), [](auto a, auto b) { return a + b.size(); }); For each of these, what type would be inferred by auto for the variable x that has been declared…
// Task 2 NEED HELP WITH C programming // For this function, you must build a string that when printed,// will output the entire binary representation of the integer x,// no matter how many bits an integer is. You may NOT use// division (/) or mod (%) anywhere in your code, and should// instead rely on bitwise operations to read the underlying binary// representation of x.stringbuilder get_bin_1(int x) {stringbuilder sb = new_sb();sb_append(sb, '$');return sb;}
Write a C function delWordN() that takes a string and an integer (n) as parameter, removes from the string the words that are n character long. A word is a group of consecutive alphanumeric characters; words are separated by non-alphanumeric characters. ps: do not take aswers from chegg or from other websites. I can already see them. Write the code yourself. I need different code.
The topic is Booth's algorithm - Explain this C programming code - i have a seminar. //header files #include #include #include int a=0,b=0,c=0,a1=0,b1=0,com[5]={1,0,0,0,0}; int anum[5]={0},anumcp[5] ={0},bnum[5]={0}; int acomp[5]={0},bcomp[5]={0},pro[5]={0},res[5]={0}; // binary function void binary(){ a1 = fabs(a); b1 = fabs(b); int r, r2, i, temp; //for loop for binary for(i = 0; i < 5; i++){ r = a1 % 2; a1 = a1 / 2; r2 = b1 % 2; b1 = b1 / 2; anum[i] = r; anumcp[i] = r; bnum[i] = r2; if(r2 == 0){ bcomp[i] = 1; } if(r == 0){ acomp[i] =1; } } //2's complimanting part for the program c = 0; for( i = 0; i < 5; i++){ res[i] = com[i]+ bcomp[i] + c; if(res[i]>=2){ c = 1; } else c = 0; res[i] =…
short answers : c)Give an example of a common floating point arithmetic error due to the particular way in which floating point numbers are stored? d)Give an example of how when using C-strings and the functionstrcpy, things can go wrong.
Fibonacci’s sequence starts with values 1 and 1. The next value in the sequence is formed by summing the previous two values. Thus the third value is 1+1=2, the fourth is 1+2=3, the fifth is 2+3=5, etc. Thus, the sequence is 1, 1, 2, 3, 5, 8, 13, 21, …. Write a code fragment using c++ that obtains a positive integer n from the user and displays the sum of the first n numbers in the Fibonacci sequence. If n is not positive, use cout to print out an error message. Put this code fragment in your main() of your project.
Given the following declaration : char msg[100] = "Department of Computer Science"; What is printed by: strcpy_s(msg, "University"); int len = strlen(msg); for (int i = len-3; i >0; i--) { msg[i] = 'x'; } cout << msg;