Very urgent Task 2Design and implement an ARMV8 program that counts total number of uppercase letters,lowercase letters, digits and special characters in a string. Text is assumed to be in ASCII, using1 byte per character.theFor example, if the input string is "This is the 2nd Task of Assignment 1.",programshouldreport 3 uppercase letters, 24 lowercase letters, 2 digits, and 8 special characters.

Answered: Image /qna-images/answer/fa4a4c93-3936-4a17-bc0c-7aac809c149a.jpg

Task 2 Design and implement an ARMV8 program that counts total number of uppercase letters, lowercase letters, digits and special characters in a string. Text is assumed to be in ASCII, us 1 byte per character. For example, if the input string is “This is the 2nd Task of Assignment 1.", the program shou report 3 uppercase letters, 24 lowercase letters, 2 digits, and 8 special characters.

Task 2 Design and implement an ARMV8 program that counts total number of uppercase letters, lowercase letters, digits and special characters in a string. Text is assumed to be in ASCII, us 1 byte per character. For example, if the input string is “This is the 2nd Task of Assignment 1.", the program shou report 3 uppercase letters, 24 lowercase letters, 2 digits, and 8 special characters.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter5: Control Structures Ii (repetition)

Section: Chapter Questions

Problem 14PE

See similar textbooks

Similar questions

Implement the first round of AES ( Advanced Encryption Standard ) in python. Given a message with 128 bits, two subkeys subkey0 and subkey1, your program should be able to perform one AddKey before Round 1 and the corresponding operations (SubBytes, ShiftRows, Mix-Columns, and AddKey) in Round 1, and output the result of the encryption after Round 1.
Implement the following function in C programming language that get a string, and compute an array of non-empty tokens of the string containing only lower-case letters. For example: ● For a string "abc EFaG hi", the list of tokens with only lower-case letters is ["abc", "hi"]. ● For a string "ab 12 ef hi ", the list of such tokens is ["ab","ef","hi"]. ● For a string "abc 12EFG hi ", the list of such tokens is ["ab","hi"]. ● For a string " abc ", the list of such tokens is ["abc"]. ● For a string "+*abc!! B" the list of such tokens is empty.That is, we break the string using the spaces as delimiters (ascii value 32), and look only at the tokens with lower-case letters only . The function get_tokens gets a string str, and returns the array with the tokens containing only lower-case letters in the correct order. The length of the array should be the number of tokens, computed in count_tokens. char** get_tokens(const char* str); For example:● get_tokens("abcEFaG…
Implement function rotate that takes a string argument s and an integer argument n, and rotates the string s to the left by n times. For example, the code char s[] = "systems"; rotate(s, 3); will change s into "temssys", while the code char t[] = "abcd"; rotate(t, 1); will change t into "bcda". void rotate(char *w, int j)
Implement function rotate that takes a string argument s and an integer argument n, and rotates the string s to the left by n times. For example, the code char s[] = "systems"; rotate(s, 3); will change s into "temssys", while the code char t[] = "abcd"; rotate(t, 1); will change t into "bcda" void rotate(char *t, int f)
Write a program in c language to analyze the letter frequencies in a block of text. Ignore case (upper and lower count the same). It should count the number of times each letter appears in the text, the number of times each pair of letters appears, and the number of times each sequence of 3 letters appears. Your program should sort the counts of single letters, pairs of letters (bigrams), and triples of letters (trigrams), then print the non-zero values in decreasing order. For single letters, print all non-zero values; for bigrams and trigrams, print the first 30 non-zero values.(monoalphabetic substitution ciphers)
Write a program Minesweeper.java that takes three integer command-line arguments m, n, and k and prints an m-by-n grid of cells with k mines, using asterisks for mines and integers for the neighboring mine counts (with two space characters between each cell). To do so, Generate an m-by-n grid of cells, with exactly k of the mn cells containing mines, uniformly at random. For each cell not containing a mine, count the number of neighboring mines (above, below, left, right, or diagonal)
Write a MIPS assembly language program that uses busy-waiting andmemory-mapped I/O to translate a line of text, as it is being typed by the user, into aform of Pig Latin (http://en.wikipedia.org/wiki/Pig_Latin). You can assume that thetyped text includes only words consisting of lower case letters, separated by spaces.Every character typed should be output as the user types it, except that words thatstart with a vowel (“a”, “e”, “i”, “o”, “u”) should have “way” appended to the end ofthe word, and words that start with any other letter should have their first letter as wellas subsequent letters up to but not including the first vowel or “y” (you may assumethere is at most three such letters) moved to the end of the word and “ay” appended.Note that you will only be able to recognize that a word has ended when a followingspace has been typed, or a newline. For example, if the user types “this is verystrange” followed by the newline character, your program should output, as the user…
Write a program that reads two matrices of integers. It then generates the sum, difference and productof the two matrices.The sum of the two matrices of the same size is a matrix with elements that are the sums of thecorresponding elements of the two given matrices. Addition is not defined for matrices of different sizes.If A and B are matrices of the same size, then we define subtraction as follows: A – B = A + (-B). Thus, tosubtract matrix B from matrix A, we simply subtract corresponding elements.To multiply a matrix by another matrix we need to do the "dot product" of rows and columns. The "DotProduct" is where we multiply matching members, then sum up:(1, 2, 3) • (7, 9, 11) = 1×7 + 2×9 + 3×11 = 58We match the 1st members (1 and 7), multiply them, likewise for the 2nd members (2 and 9) and the3rd members (3 and 11), and finally sum them up.
Write a program that reads a list of integers and outputs those integers in reverse. The input begins with an integer indicating the number of integers that follow. For coding simplicity, follow each output integer by a comma, including the last one. Assume that the list will always contain fewer than 20 integers. Ex: If the input is: 5 2 4 6 8 10 the output is: 10,8,6,4,2, To achieve the above, first read the integers into an array. Then output the array in reverse.
We have to create a program in java in which the below mentioned things should be there- You have been given the head to a singly linked list of integers. Write a function check to whetherthe list given is a 'Palindrome' or not.Input Format:Elements of linked listOutput Format:True or FalseSample Input 1:9 3 2 2 3 9Sample Output 1:trueSample Input 2:0 2 3 2 5Sample Output 2:false
Implement the vacuum cleaning agent function in Python/Java for the scenario described below: Consider two-dimensional Boolean array of size m x n (m and n can each be equal to 4) where m is the number of rows, and n is the number of columns. Obtain numerical positive integer values for m and n as inputs from the user. Generate random numbers and scale them down to either a “0” or a “1” according to whether they represent “Clean” or “Dirty”, respectively. After filling the array with 0s or 1s, start at some random array position indicating the initial position of the vacuum cleaner. First check if at that current position, there is the presence of a “Dirt” or not determined by whether 0 or 1 is filled in at that initial position of the vacuum cleaner. If there is a “Dirt”, clean it, and if there is no “Dirt” do a No-operation. After this is done, generate random numbers modulo 4 to obtain random numbers 0, 1, 2, 3 indicating whether to take a left, right, up or down correspondingly. If…
Implement function rotate that takes a string argument s and an integer argument n, and rotates the string s to the left by n times. For example, the code char s[] = "systems"; rotate(s, 3); will change s into "temssys", while the code char t[] = "abcd"; rotate(t, 1); will change t into "bcda". Restrictions: printf and strlen are the ONLY C library functions that you can use in the implementation. void rotate(char *w, int j)