Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

1. Implement the method insert_times in the ArrayList class which takes parameters idx, n, x, and inserts n copies of x into the list at

1.

Implement the method insert_times in the ArrayList class which takes parameters idx, n, x, and inserts n copies of x into the list at index idx. You may assume that 0 idx the length of the list, and n > 0.

E.g., calling insert_times(3, 5, 'a') on an ArrayList with contents [0,1,2,3,4,5,6,7] should result in the updated ArrayList [0,1,2,a,a,a,a,a,3,4,5,6,7]

Your implementation may only use the following methods on the built-in list:

  • self.data[i] for getting and setting values at an existing, positive index i
  • len(self.data) to obtain the number of slots
  • self.data.append(None) to grow the list by one slot at a time
  • del self.data[len(self.data)-1] to delete the last slot in a list

2.

Implement the method remove_all in the ArrayList class which takes the parameter x and removes all occurences of x from the list.

E.g., calling remove_all('a') on an ArrayList with contents ['a', 'b', 'r', 'a', 'c', 'a', 'd', 'a', 'b', 'r', 'a'] should result in the updated ArrayList ['b','r','c','d','b','r']

Your implementation may only use the following methods on the built-in list:

  • self.data[i] for getting and setting values at an existing, positive index i
  • len(self.data) to obtain the number of slots
  • self.data.append(None) to grow the list by one slot at a time
  • del self.data[len(self.data)-1] to delete the last slot in a list

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Database Processing

Authors: David M. Kroenke, David Auer

11th Edition

B003Y7CIBU, 978-0132302678

More Books

Students also viewed these Databases questions