Performance Evaluation of Data Structures and Algorithms Assignment

This assignment focuses on the performance evaluation of different Abstract Data Types (ADTs), specifically arrays and linked lists. The objective is to compare their efficiency in handling large datasets of sizes 1,000, 10,000, 50,000, 100,000, and 1,000,000. The evaluation involves measuring the time complexity of creating/building and destroying ADTs, as well as the time taken to perform insertion, deletion, and search operations. Furthermore, the assignment requires the implementation of traversal operations and a comprehensive analysis of the experimental results. The submission includes a detailed methodology, algorithm descriptions, code snippets (optional), and a thorough analysis of the performance differences between the ADTs. The assignment aims to provide a practical understanding of data structure performance in various scenarios.

SSK5117: Advanced Data Structures Semester I 2016/2017
SSK5117 (1) SEMESTER I 2016/2017
ASSIGNMENT 1
Credit: As part of the 45% of total course mark
Deadline: 7 Oct 2016 11:59PM
Introduction: The objective of this assignment is to compare the performance of
different data structures and algorithm.
This is an individual assignment. You are encouraged to use relevant
references and resources to complete the task. HOWEVER, you should
cite the references or resources.
Submission: All submissions will be through the PutraBlast portal.
No submission will be accepted after the deadline.
Marking
Criteria:
To be provided
Tasks
Description:
In order to evaluate different ADTs, an evaluation with large data must
be conducted. Each ADT should be implemented by using a
programming language of your choice. Then, choose a dataset consists
of 1,000, 10,000, 50,000, 100,000 and 1,000,000 data for evaluation,
either from the given dataset. Observation includes the complexity:
a. in creating/building and destroying ADTs for the data
b. to perform insertion, deletion and search kth item.
c. to perform traversal of all data in the list.
Eventually, you need to conduct simple experiments to compare the
performance of the different ADTs based on the different operations
described above.
ADTs to be evaluated are:
1. Array
2. Linked List
Submission
Details:
The submission should include:
1. Brief introduction of the task
2. Methodology
a. Describe the algorithms of list of operations on the
ADTs for this experiment. You must clearly state the
steps taken. You can also include the codes as
attachment. Also the step to measure the time taken.
3. List of the results (Example)

SSK5117: Advanced Data Structures Semester I 2016/2017
4. Analysis (please emphasize on this)
5. Conclusion