A. Using the algorithm in deleting an element at the beginning of the array and the traversing algorithm, simulate the given array below: TRAVERSE OPERATION DELETION AT THE BEGINNING OF THE ARRAY Algorithm: Algorithm: Step 1: Set index =0 Step 2: Repeat step 3 while (index < max) Step 3: Step 1: Set index = 0 Step 2: Repeat step 3 while (i < max) Step 3: Set array (index) = array [index + 1] index = index + 1 Print array[index] index = index + 1 Step 4: Set max = max - 1 Step 5: End Step 4: End 1. array 8 5 B. Using the algorithm in updating the elements of the array and the traversing algorithm, simulate the updating of all elements whose value is equal to 1 in the array and traverse the updated array list: UPDATING ELEMENTS OF THE ARRAY Algorithm: TRAVERSE OPERATION Step 1: Input element Step 2: Input value Step 3: Set index = 0, ctr = 0 Step 4: Repeat step 5 while (index < max) Step 5: Algorithm: if (array (index) == element) Set array [index) = value Set ctr = ctr +1 Step 1: Set index = 0 Step 2: Repeat step 3 while (index < max) Step 3: index = index + 1 Print arraylindex] Step 6: if (ctr == 0) index = index + 1 Print "Elements is not found in the list Step 4: End Step 7: End 2. array 4. 1 3 1 C. Using the algorithm in merging two arrays and the traversing algorithm, simulate the given arrays below: MERGING TWO ARRAYS Algorithm: Step 1: Set index = 0 Step 2: Repeat step 3 while (i < size1) Step 3: TRAVERSE OPERATION Set arrayMerge [index] = array1 [index] index = index +1 Algorithm: Step 4: Set index = 0 Step 5: Repeat step 6 while (size1 < size1 + size2) Step 1: Set index =0 Set arraymerge (size1) = array2 [(index) Step 2: Repeat step 3 while (index < max) size1 = size1 +1 Step 6: Print array[index] index = index + 1 Step 3: index = index + 1 Step 7: End Step 4: End 3. array1 array2 5 9 1
A. Using the algorithm in deleting an element at the beginning of the array and the traversing algorithm, simulate the given array below: TRAVERSE OPERATION DELETION AT THE BEGINNING OF THE ARRAY Algorithm: Algorithm: Step 1: Set index =0 Step 2: Repeat step 3 while (index < max) Step 3: Step 1: Set index = 0 Step 2: Repeat step 3 while (i < max) Step 3: Set array (index) = array [index + 1] index = index + 1 Print array[index] index = index + 1 Step 4: Set max = max - 1 Step 5: End Step 4: End 1. array 8 5 B. Using the algorithm in updating the elements of the array and the traversing algorithm, simulate the updating of all elements whose value is equal to 1 in the array and traverse the updated array list: UPDATING ELEMENTS OF THE ARRAY Algorithm: TRAVERSE OPERATION Step 1: Input element Step 2: Input value Step 3: Set index = 0, ctr = 0 Step 4: Repeat step 5 while (index < max) Step 5: Algorithm: if (array (index) == element) Set array [index) = value Set ctr = ctr +1 Step 1: Set index = 0 Step 2: Repeat step 3 while (index < max) Step 3: index = index + 1 Print arraylindex] Step 6: if (ctr == 0) index = index + 1 Print "Elements is not found in the list Step 4: End Step 7: End 2. array 4. 1 3 1 C. Using the algorithm in merging two arrays and the traversing algorithm, simulate the given arrays below: MERGING TWO ARRAYS Algorithm: Step 1: Set index = 0 Step 2: Repeat step 3 while (i < size1) Step 3: TRAVERSE OPERATION Set arrayMerge [index] = array1 [index] index = index +1 Algorithm: Step 4: Set index = 0 Step 5: Repeat step 6 while (size1 < size1 + size2) Step 1: Set index =0 Set arraymerge (size1) = array2 [(index) Step 2: Repeat step 3 while (index < max) size1 = size1 +1 Step 6: Print array[index] index = index + 1 Step 3: index = index + 1 Step 7: End Step 4: End 3. array1 array2 5 9 1
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
100%
Can anyone help me with this? I need it asap. Thank you.
![A. Using the algorithm in deleting an element at the beginning of the array and the traversing
algorithm, simulate the given array below:
TRAVERSE OPERATION
DELETION AT THE BEGINNING OF THE ARRAY
Algorithm:
Algorithm:
Step 1: Set index =0
Step 2: Repeat step 3 while (index< max)
Step 3:
Step 1: Set index = 0
Step 2: Repeat step 3 while (i< max)
Step 3:
Set array [index] = array [index + 1]
Print arrayſindex]
index = index + 1
index = index + 1
Step 4: Set max = max - 1
Step 5: End
Step 4: End
1. array
8 5
2
B. Using the algorithm in updating the elements of the array and the traversing algorithm, simulate
the updating of all elements whose value is equal to 1 in the array and traverse the updated
array list:
UPDATING ELEMENTS OF THE ARRAY
Algorithm:
Step 1: Input element
Step 2: Input value
Step
TRAVERSE OPERATION
:Set index = 0, ctr = 0
Algorithm:
Step 4: Repeat step 5 while (index < max)
Step 5:
if (array (index) == element)
Step 1: Set index = 0
Step 2: Repeat step 3 while (index< max)
Step 3:
Set array (index] = value
Set ctr = ctr + 1
index = index + 1
Print array[index]
Step 6: if (ctr == 0)
index = index+ 1
Print "Elements is not found in the list"
Step 7: End
Step 4: End
2. array
4
1
3
1
C. Using the algorithm in merging two arrays and the traversing algorithm, simulate the given
arrays below:
MERGING TWwO ARRAYS
Algorithm:
Step 1: Set index = 0
Step 2: Repeat step 3 while (i < size1)
Step 3:
TRAVERSE OPERATION
Set arrayMerge [index] = array1 [index]
index = index + 1
Algorithm:
Step 4: Set index = 0
Step 5: Repeat step 6 while (size1 < size1 + size2)
Step 6:
Step 1: Set index = 0
Set arraymerge [size1] = array2 [index] Step 2: Repeat step 3 while (index < max)
size1 = size1 +1
Print array[index]
index = index + 1
Step 3:
index = index + 1
Step 7: End
Step 4: End
array1
array2 59 |1
3.
5
1](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fc585ba21-ffe4-41f2-9232-7865ff10d95e%2F202f2fbe-482a-4e91-a34b-97095bef6327%2Fz7g8jp8_processed.jpeg&w=3840&q=75)
Transcribed Image Text:A. Using the algorithm in deleting an element at the beginning of the array and the traversing
algorithm, simulate the given array below:
TRAVERSE OPERATION
DELETION AT THE BEGINNING OF THE ARRAY
Algorithm:
Algorithm:
Step 1: Set index =0
Step 2: Repeat step 3 while (index< max)
Step 3:
Step 1: Set index = 0
Step 2: Repeat step 3 while (i< max)
Step 3:
Set array [index] = array [index + 1]
Print arrayſindex]
index = index + 1
index = index + 1
Step 4: Set max = max - 1
Step 5: End
Step 4: End
1. array
8 5
2
B. Using the algorithm in updating the elements of the array and the traversing algorithm, simulate
the updating of all elements whose value is equal to 1 in the array and traverse the updated
array list:
UPDATING ELEMENTS OF THE ARRAY
Algorithm:
Step 1: Input element
Step 2: Input value
Step
TRAVERSE OPERATION
:Set index = 0, ctr = 0
Algorithm:
Step 4: Repeat step 5 while (index < max)
Step 5:
if (array (index) == element)
Step 1: Set index = 0
Step 2: Repeat step 3 while (index< max)
Step 3:
Set array (index] = value
Set ctr = ctr + 1
index = index + 1
Print array[index]
Step 6: if (ctr == 0)
index = index+ 1
Print "Elements is not found in the list"
Step 7: End
Step 4: End
2. array
4
1
3
1
C. Using the algorithm in merging two arrays and the traversing algorithm, simulate the given
arrays below:
MERGING TWwO ARRAYS
Algorithm:
Step 1: Set index = 0
Step 2: Repeat step 3 while (i < size1)
Step 3:
TRAVERSE OPERATION
Set arrayMerge [index] = array1 [index]
index = index + 1
Algorithm:
Step 4: Set index = 0
Step 5: Repeat step 6 while (size1 < size1 + size2)
Step 6:
Step 1: Set index = 0
Set arraymerge [size1] = array2 [index] Step 2: Repeat step 3 while (index < max)
size1 = size1 +1
Print array[index]
index = index + 1
Step 3:
index = index + 1
Step 7: End
Step 4: End
array1
array2 59 |1
3.
5
1
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 4 steps
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education