SophiaPretty

(5)

$14/per page/Negotiable

About SophiaPretty

Levels Tought:
Elementary,Middle School,High School,College,University,PHD

Expertise:
Accounting,Algebra See all
Accounting,Algebra,Applied Sciences,Architecture and Design,Art & Design,Biology,Business & Finance,Calculus,Chemistry,Communications,Computer Science,Economics,Engineering,English,Environmental science,Essay writing Hide all
Teaching Since: Jul 2017
Last Sign in: 313 Weeks Ago, 6 Days Ago
Questions Answered: 15833
Tutorials Posted: 15827

Education

  • MBA,PHD, Juris Doctor
    Strayer,Devery,Harvard University
    Mar-1995 - Mar-2002

Experience

  • Manager Planning
    WalMart
    Mar-2001 - Feb-2009

Category > Computer Science Posted 20 Dec 2017 My Price 10.00

interface NumberedListNoDup boolean add(T item);

it is a java program, everything is on files, please help me complete it.

  • /**
     * Completed by: Put your name here
     * @author of skeleton tsanyal1
     */
    interface NumberedListNoDup <T> {
        boolean add(T item);
        boolean add(int position, T item);
        boolean remove(T item);
        boolean remove(int position);
        T get(int position); // return null if invalid position
        boolean set(int position, T item);
        int size();
        void clear(); // empties out the list
        int find(T item);   // return 0 if item not in list
        String toString();
    } // end interface

    class Node<T> {
        // instance variables
        public T data;
        public Node<T> next;
        // constructor 1
        public Node(T data) {
            this(data, null);
        }
        // constructor 2
        public Node(T data, Node<T> next) {
            this.data = data; this.next = next;
        }
    } // end class Node


    class LinkedNumberedListNoDup<T> implements NumberedListNoDup<T> {
        private int nodeCount;
        private Node<T> head;    // add a tail reference if you want to

        public LinkedNumberedListNoDup() {}

        public boolean add(T item) {return false;}
        public boolean add(int position, T item) {return false;}
        public boolean remove(T item) {return false;}
        public boolean remove(int position) {return false;}
        public T get(int position) {return null;} // return null if invalid position
        public boolean set(int position, T item) {return false;}
        public int size() {return 0;}
        public void clear() {} // empties out the list
        public int find(T item) {return 0;}   // return 0 if item not in list
        public String toString() {return "";}
       
        // add any private methods you may want/need

    } // end class

Attachments:

Answers

SophiaPretty
(5)
Status NEW Posted 20 Dec 2017 12:12 PM My Price 10.00

-----------  ----------- H-----------ell-----------o S-----------ir/-----------Mad-----------am ----------- Th-----------ank----------- yo-----------u f-----------or -----------you-----------r i-----------nte-----------res-----------t a-----------nd -----------buy-----------ing----------- my----------- po-----------ste-----------d s-----------olu-----------tio-----------n. -----------Ple-----------ase----------- pi-----------ng -----------me -----------on -----------cha-----------t I----------- am----------- on-----------lin-----------e o-----------r i-----------nbo-----------x m-----------e a----------- me-----------ssa-----------ge -----------I w-----------ill----------- be----------- qu-----------ick-----------ly

Not Rated(0)