Scribd
Upload
13 views2 pages

Data Structure Lab: Array List Implementation

The document outlines Lab 1 for the Data Structure and Algorithm course, focusing on implementing an Array List. It details tasks for creating a list data structure with operations such as insertion, deletion, access, search, size, and print, as well as calculating time complexity for each method. The lab is prepared by Hikmat Shehadeh and is scheduled for Spring 2025.

Uploaded by

Not.DXcr GaMeR
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
13 views2 pages

Data Structure Lab: Array List Implementation

The document outlines Lab 1 for the Data Structure and Algorithm course, focusing on implementing an Array List. It details tasks for creating a list data structure with operations such as insertion, deletion, access, search, size, and print, as well as calculating time complexity for each method. The lab is prepared by Hikmat Shehadeh and is scheduled for Spring 2025.

Uploaded by

Not.DXcr GaMeR
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Spring 2025

Course Name: Data Structure and Algorithm


Lab 1: List
Prepared By: Hikmat Shehadeh

Objective:

• Implement Array List

Task 1: List Implementation

Implement a list data structure from scratch. Your list should support the following operations:

• Insertion: Add an element to the list at a specified index.


• Deletion: Remove an element from the list at a specified index.
• Access: Get the element at a specified index.
• Search: Check if an element exists in the list.
• Size: Get the number of elements in the list.
• Print: Print all the elements in the list.
Task 2: Time Complexity

• Calculate the time complexity for each method in Array List ADT.

End of Lab

You might also like