Anyone please, help to complete the Java code based this proposal please????????

DATA STRUCTURE IMPLEMENTATION IN MUSIC APPLICATION

Introduction

In today's world music is an important source of entertainment. We are trying different kinds of data structures make our music application more effective. As performance really matters in music player, this show how effectively a music player is designed as there are too many operations that are taking place at a time when we play any music, such as Sorting, Searching, Hashing, Linked List, Stack, Queue etc. So Our project will focus on performance of music player and complexity of algorithms that we use. We are able to implement the modified doubled-linked list as data structure to playlist.

We can implement the application in three different parts :

1. Linked list
2. Searching
3. Sorting

LINKED LIST

A linked list is the sequence of data structure, which join the elements called nodes. Nodes in linked list are connected by pointers. Linked list will be null terminating, which means that the pointer to the next node is null, and List has reached to end.

What is double linked list?

In double linked list each node have the reference of previous node and next node. Each node has a property value. We are using Doubly linked list as it can easily be implemented on music playlist.

skip forward/backward

As each node can be moved next and previous node so we can easily implement as forward and backward skipping.

Play next music

The pointer to the next node make it quit easy to play the next track.

Append

when we add a new track to the playlist then we can tack it on to the end.

Beginning/End

Linked List had a property of head and tail. This will help to delineate the beginning and end of playlist.

SEARCHING

Binary Search is one of those algorithm which comes first in mind when we apply searching algorithm. It is one of the most efficient algorithm if it is in ordered list.

The goals of binary search is:

1. To discard half of the array of music list at every iteration.
2. Minimize the number of music we are going through.
3. Leave us with one final music.

SORTING

We can implement quick sort algorithm to sort our playlist in many formats like albums, artists, alphabetical order etc. It is uses the divide and conquer algorithm to gain the same advantages as merge sort without using extra space. As Quick sort stores data to main memory from the storage to quickly sort the data.

Our deliverables will be divided in four sprints and they are as follows:

Deliverables	Timeline
1. Initial Documentation, SRS, Database Design, System Design, Workflow	2 weeks
2. Implementation of Music Player with basic functionality of music system i.e. use of Doubly Linked List	3 weeks
3. Implementation of Sorting in playlist and Searching of music files.	4 weeks
4. Testing whole system and improving the performance of music player	2 weeks