package student; import java.util.Map; public class MapDS { /** * Removes all of the mappings from this map. */ public void clear(){ } /** * Returns true if this map contains a mapping for the specified key. * @param key * @return */ public boolean containsKey(K key){ return false; } /** * Returns true if this map maps one or more keys to the specified value. * @param value * @return */ public boolean containsValue(V value){ return false; } /** * Returns the value to which the specified key is mapped, or null if this * map contains no mapping for the key. * @param key * @return */ public V get(Object key){ return null; } /** * Returns true if this map contains no key-value mappings. * @return */ public boolean isEmpty(){ return false; } /** * Associates the specified value with the specified key in this map. * @param key * @param value */ public void put(K key, V value){ } /** * Copies all of the mappings from the specified map to this map. * @param m */ public void putAll(Map m){ } /** * Removes the mapping for a key from this map if it is present. * @param key * @return */ public void remove(Object key){ } /** * Removes the entry for the specified key only if it is currently mapped to the * specified value. * @param key * @param value * @return */ public void remove(Object key, Object value){ } /** * Replaces the entry for the specified key only if it is currently mapped to some value. * @param key * @param value * @return */ public void replace(K key, V value){ } /** * Replaces the entry for the specified key only if currently mapped to the * @param key * @param oldValue * @param newValue * @return */ public void replace(K key, V oldValue, V newValue){ } /** * Returns the number of key-value mappings in this map. * @return */ public int size(){ return 0; } } 

==================================

Java

Please solve the problems described below, by writing your code in (LinkedlistDS.java, StackDs.java, and MapDS.java) these classes are proved to you on the Moodle assignment page. You may not use any of the following dependencies in your Data Structure Implementation homework: 3rd party libraries and java.util (anything contained in this package except for the java.util.Collection, java.util.Arrays, and java.util.Map and java.util.Set dependencies.) All of the documentation for the function guidelines may be found in the accompanying classes. This assignment can be a lot of programming if you do not follow the DRY (Don't Repeat Yourself) programming principle. Though it may look like a lot of work, in reality, it is much less because many methods depend on each other. If you make sure you call other smaller methods in the larger methods you will save your self a lot of time. You are tasked to implement two linear data Structures, a Linked list, and a Stack. Please write your code in the LinkedListDS.java and StackDS.java classes respectively. You also must implement one non-linear data structure a HashMap. Please write your code in the MapDS.java class. Please solve the problems described below, by writing your code in (LinkedlistDS.java, StackDs.java, and MapDS.java) these classes are proved to you on the Moodle assignment page. You may not use any of the following dependencies in your Data Structure Implementation homework: 3rd party libraries and java.util (anything contained in this package except for the java.util.Collection, java.util.Arrays, and java.util.Map and java.util.Set dependencies.) All of the documentation for the function guidelines may be found in the accompanying classes. This assignment can be a lot of programming if you do not follow the DRY (Don't Repeat Yourself) programming principle. Though it may look like a lot of work, in reality, it is much less because many methods depend on each other. If you make sure you call other smaller methods in the larger methods you will save your self a lot of time. You are tasked to implement two linear data Structures, a Linked list, and a Stack. Please write your code in the LinkedListDS.java and StackDS.java classes respectively. You also must implement one non-linear data structure a HashMap. Please write your code in the MapDS.java class