Basic Linked List and Sorted Linked List in Java with Unit Testing

By Hassnain Jamil -

Code Distribution

The project's code distribution is available by checking out the project named LinkedListsProject. The code distribution provides you with the following:

  • listClasses package → Where classes implementing linked lists will appear.
  • tests package → Where you should place your student tests.


Specifications


  • You are expected to implement two classes: BasicLinkedList and SortedLinkedList.The javadoc describing what you need to implement can be found at Project Javadoc.
  • The linked list in our project has a head and tail reference. The next link of the last node points to null.
  • Methods addToEnd(), getLast(), retrieveLastElement() rely (and must use) the tail reference.
  • The head and tail must be set correctly when list operations update the list.
  • You can use recursion for the implementation of methods.
  • Two methods must be implemented using recursion: getReverseArrayList() and getReverseList(). You are allowed to add an auxiliary function (only one) during the implementation of a recursive method. You MAY NOT add any instance variables nor static variables to support the implementation of a recursive method. If you do you will lose significant credit.
  • Your code must be efficient. For example, you will lose credit if you perform an unnecessary list traversal(s) during the implementation of a method.
  • If you see in the submit server the error "missing_component", the problem is that you are missing a required class. You can also get this error if you are not defining a generic class correctly. For example, your SortedLinkedList class is not being defined as expected. It is recommended that you try submiting your project immediately (if you have not done so yet) so you can identify this problem (your code may work in Eclipse but not in the submit server).


Requirements


  • Your student tests must include at least a test for each method of each class. Write tests as you develop your code and not at the end; this is the correct approach to develop student tests. Also, think how you can test your code so it will work with any data set. Hint: For a list, you can try inserting and deleting all the permutations for a set of numbers. This kind of hint is what you need to discover for future projects (and for your future job) by yourself.
  • If you have a problem with your code and need assistance during office hours, you need to have a student test(s) that illustrates the problem you are experiencing. See Student Tests for information regarding the implementation of student tests.
  • You may not shared your student tests with other students.
  • The iterator you define may NOT be used to implement other list operations (e.g., add). The iterator is for users that want to iterate over the list.
  • You need to implement a singly-linked list that relies on a head and tail reference.
  • See Style Guidelines for information regarding style.


Honor's Section Requirement

The following requirement is for students enrolled in the honor's section.

  • Implement the iterator's remove method for the BasicLinkedList class.
  • Add a clone method to the BasicLinkedList class.

Get Now


Buy now

CONTACT DETAILS

For any other questions or other tasks please feel free to contact me
via email: mhassnainjamil@gmail.com
via WhatsApp: +92-324-7042178
via skype: hassnainjamil1

Comments

Post a Comment

Popular posts from this blog

[SOLVED] Tape for a Turing Machine using Doubly-linked List in Java with full source code

By Anonymous -
Tape for a Turing Machine (Doubly-linked List) Short exercise in which you will code part of an existing project. In this case, you will be working with a doubly-linked list. To make this topic more interesting, the list that you work on will be part of a Turing Machine. A Turing Machine is a kind of very simple, abstract computing device that was introduced in the 1930's by Alan Turing as a way of studying computation and its limitations. The classes that you need for the lab are in a package named turing. You will define a new class named Tape in this package. You can find the Java source in the code directory. You should copy this directory into an Eclipse project. There will be errors, since the existing classes depend on the Tape class, which you have not yet written. Don't forget the Javadoc comments. A Class for Turing Machine Tapes A Turing machine works on a "tape" that is used for both input and output. The tape is made up of little squares called cell...
Read more

[SOLVED] ICT285 Databases TMA 2017 Assignment 1 | Relational Algebra, Database Design & Implementation

By Anonymous -
Relational Algebra A database records information about athletes competing at the Olympics. An athlete competes for a particular country in one or more events. Events take place at a scheduled day and time in a particular venue. The result (rank) is recorded for all athletes in the final of the event. The medal (gold, silver or bronze) is also recorded for the medal winners in the event. Note that we are not considering team sports or heats in this example – only individuals competing in the finals. The schema for this database is as follows: (Note that primary keys are shown underlined, foreign keys in bold). ATHLETE ( AthleteNo , AthleteName, CountryName) COUNTRY ( CountryName , NumberOfCompetitors) EVENT (EventName, ScheduledStart, VenueName ) VENUE (VenueName, City, Capacity) FINAL ( AthleteNo , EventName , Rank, Medal) Provide relational algebra (NOT SQL) queries to find the following informaList the name and country of all athletes. List the event name and scheduled...
Read more