This project (PROG1) is geared to giving students PRACTICE in implementing operations of the Array-based List. In this project, students will implement the basic data structure using Array. Students can assume the elements are of type int. An Abstract List (or List ADT) is linearly ordered data where the programmer explicitly defines the ordering. Arrays and Linked Lists are the most obvious data structures for implementing List ADT. An Array is a collection of fixed number of components (elements), wherein all of components have same data type. The collection of data is indexed, or numbered, and starts at 0. The position number is formally called the subscript or index. Advantages and disadvantages: Arrays allow us to randomly access any item in list by providing constant time access to any value in array. However, arrays are not very dynamic Operations of Array Below are some of the operations of array: Create list Delete list Display list Add item to list Remove item from list Swap items in the list Find item in list Copy list Update item in the list Check size of list Get element from the list Check if list is full Check if list is empty DIRECTIONS: You have been provided: (1) Function stubs for the operations of array-based list: Utility functions for array-based list: create_list, delete_list, add_item, remove item, etc. (2) Main program provides a driver for testing your functions. It calls the menu function (operation menu). It includes the testing the operations of add, remove, find, etc. You are expected to: Complete the function stubs needed to implement the operations of array-based list you can implement. File name: class_ArrayList.cpp (from starter-class_ArrayList.cpp) Purpose: Complete implementation of class_ArrayLis.cpp, compile and run with the given main, MyArrayList.cpp. Submissions: class_ArrayLis.cpp (from starter-class_ArrayList.cpp) Givens: MyArrayList.cpp //Main program for array-based list. Please DO NOT MODIFY! starter-class_ArrayList.cpp //Duplicate and name it as l/class ArrayList.cpp. Please DO NOT menu //function. This project (PROG1) is geared to giving students PRACTICE in implementing operations of the Array-based List. In this project, students will implement the basic data structure using Array. Students can assume the elements are of type int. An Abstract List (or List ADT) is linearly ordered data where the programmer explicitly defines the ordering. Arrays and Linked Lists are the most obvious data structures for implementing List ADT. An Array is a collection of fixed number of components (elements), wherein all of components have same data type. The collection of data is indexed, or numbered, and starts at 0. The position number is formally called the subscript or index. Advantages and disadvantages: Arrays allow us to randomly access any item in list by providing constant time access to any value in array. However, arrays are not very dynamic Operations of Array Below are some of the operations of array: Create list Delete list Display list Add item to list Remove item from list Swap items in the list Find item in list Copy list Update item in the list Check size of list Get element from the list Check if list is full Check if list is empty DIRECTIONS: You have been provided: (1) Function stubs for the operations of array-based list: Utility functions for array-based list: create_list, delete_list, add_item, remove item, etc. (2) Main program provides a driver for testing your functions. It calls the menu function (operation menu). It includes the testing the operations of add, remove, find, etc. You are expected to: Complete the function stubs needed to implement the operations of array-based list you can implement. File name: class_ArrayList.cpp (from starter-class_ArrayList.cpp) Purpose: Complete implementation of class_ArrayLis.cpp, compile and run with the given main, MyArrayList.cpp. Submissions: class_ArrayLis.cpp (from starter-class_ArrayList.cpp) Givens: MyArrayList.cpp //Main program for array-based list. Please DO NOT MODIFY! starter-class_ArrayList.cpp //Duplicate and name it as l/class ArrayList.cpp. Please DO NOT menu //function
