2) Algorithm A2: concatenate (s1, s2) 1. Initialize i = strlen(s1) 2. Initialize j = strlen(s2) 3. Initialize count =0; / * This segment copies characters of s2 into array s1 * / 4. Repeat steps 5 to 7 while count <= j 5. s1[i] = s2[count] 6. i = i + 1 7. count = count + 1 8. Exit
2)
1. Initialize i = strlen(s1)
2. Initialize j = strlen(s2)
3. Initialize count =0;
/ * This segment copies characters of s2 into array s1 * /
4. Repeat steps 5 to 7 while count <= j
5. s1[i] = s2[count]
6. i = i + 1
7. count = count + 1
8. Exit
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 using functions in C++
2. Run your coding of Algorithm A1 with the following test case
s = “Computer
3. Run your coding of Algorithm A2 with the following test cases
s1 = “But” and s2 = “ter”
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 2 images
