3) Algorithm A3: substring (s, ip, len) 1. Initialize i = ip and count = 0 2. Use an array „dest‟ to hold the required substring 3. Repeat steps 4 ,5 and 6 while count < len 4. dest[count] = s[i] 5. count = count +1 6. i = i + 1 7. Insert string terminator at end of dest 8. Exit 4) Algorithm A4: index(T, P) 1. Initialize i = 0 and max = t – p + 1 / * t and p are respectively lengths of strings T and P * / 2. Repeat steps 3 to 6 while i < max 3. Repeat for j = 0 to p – 1 5. Return index i and exit 6. i = i + 1 7. Return –1 for no match 8. Exit LAB TASKS 1. Implement the above algorithms in C/C++ 2. Implement the above algorithms using functions. 3. Run your coding of Algorithm A1 with the following test case  s = “Computer Programming is a prerequisite for Data Structures” 4. Run your coding of Algorithm A2 with the following test cases  s1 = “But” and s2 = “ter”

3) Algorithm A3: substring (s, ip, len) 1. Initialize i = ip and count = 0 2. Use an array „dest‟ to hold the required substring 3. Repeat steps 4 ,5 and 6 while count < len 4. dest[count] = s[i] 5. count = count +1 6. i = i + 1 7. Insert string terminator at end of dest 8. Exit 4) Algorithm A4: index(T, P) 1. Initialize i = 0 and max = t – p + 1 / * t and p are respectively lengths of strings T and P * / 2. Repeat steps 3 to 6 while i < max 3. Repeat for j = 0 to p – 1 5. Return index i and exit 6. i = i + 1 7. Return –1 for no match 8. Exit LAB TASKS 1. Implement the above algorithms in C/C++ 2. Implement the above algorithms using functions. 3. Run your coding of Algorithm A1 with the following test case  s = “Computer Programming is a prerequisite for Data Structures” 4. Run your coding of Algorithm A2 with the following test cases  s1 = “But” and s2 = “ter”

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 16PE

See similar textbooks

Similar questions

ARRAY RANDOMIZER Create a program that shuffels all the elements present in an array. To shuffle an array, you need to do at least 500 random swaps of any elements in the array given below. Print the shuffled array in the output. {12, 54, 22, 100, -3, 5, 10, -33, 78, 90, 29, -45, 77, -9, 19, 21} Language: CPP
Programming Language :- C
Individual Exercise: Sieve of Eratosthenes O The Sieve of Eratosthenes is a technique for finding all the prime numbers up to a given last number. o It can be implemented as a program by using the algorithm (steps) given below. " Create a variable for the last number initialized as 100 etc. (e.g., int lastNumber = 100;) • Create a boolean array isPrime[] to keep track of which numbers up to lastNumber are prime. O The length of the array must be equal to lastNumber + 1 as the array indexes start from zero. o Note: The default value is false for all the array elements when a boolean array is created by using new. ' Set all the array elements beginning from index = 2 (the first prime number) to true. ' Outer loop: Repeat the following steps for each number num within 2 <= num <= lastNumber / num. o if isPrime[num] is true (meaning that num is prime as no factors exist for num): " Inner loop: Set the isPrime[] elements for all the multiples of num to false. O When the nested loop ends,…
1) Given row array vals of unknown size of 2 or greater, write an expression that yields a new array containing all elements except the first. For example, if vals = [10, 20, 30, 40], the expression would yield [20, 30, 40]. vals Check Show answer 2) Write an expression that results in a row array vals shifted to the right. For example, if vals = [1, 2, 3, ....., n-1, n], then a right shift will result in [n,1,2,3,.....n-1]. Check Show answer Incorrect vals(???)
Using C language
Sorting is a basic issue with arrays in which the goal is to find the target element in the array. Choose from the following options: False
Sorted Names Problem:Assume that you already have the bubbleSort () ans swapS() modules. Design the main() program that allows the user to enter 20 names into a String array. Sort the array in ascending (alphabetical) order and display its contents. // The bubbleSort module accepts an array of Strings and array size// and sorts array in ascending orderModule bubbleSort(String Ref array[], integer arraySize) Declare Integer index1, index2 // bubblesort scores For index1 = arraySize – 1 to 0 Step -1 For index2 = 0 to index1 – 1 If array[index2] > array[index2 + 1] Then Call swapS(array[index2], array[index2 + 1) End If End For End ForEnd Module// The swapS module accepts two String elements and swaps their contentsModule swapS(String ref a, String ref b) Declare String temp // Swap a and b Set temp = a Set a = b Set b = tempEnd Module
Topic: Data Structures: Arrays, Strings and Structs. Write a program that will read in N integers from keyboard input into an array. The size of the array N will be entered on the keyboard. The program will tabulate the output as shown below: the first column should show the list of distinct array elements sorted in ascending order, while the second column should show the number of occurrences of each element.Sample input: 9 , 15, 7, 9, 3, 7, 3, 3, 7, 6, 3, 20 Expected Output: N count3 46 17 39 215 120 1 (w/pseudocodes)
Two dimension array in C:Create a two dimension array of integers that is 5 rows x 10 columns.Populate each element in the first 2 rows (using for loops) with the value 5.Populate each element of the last three rows (using for loops) with the value 7.Write code (using for loops) to sum all the elements of the first three columns and output thesum to the screen. without using #define
Find primes This program creates and displays a 5x10 matrix(5 rows and 10 columns) of random integers between 1 and a maximum value(user input). Hint: Use the random library to generate each number and place it into your 2D list. The program then counts the number of prime numbers in each row of the array and displays this number, along with the found primes. The program finally displays the total number of prime numbers in the matrix.
Array TypesObjective: Based on the given values and initializations, give what is being required of each statement.1. Given A[10], α=2000, esize=4 bytes:a) Find the number of elements.b) Find the address of the 6th element.c) Find the index no. of the 8th element.2. Given E[3][4], α=2020, esize=4 bytes:a) Find the total no. of elements.b) Find the address of the last element.c) Find the address of the 10th element.
Lottery number generator in Python code please thanks so much !