question archive Assume you are asked to design for a new database that contains entries for student IDs and their dorm names
Assume you are asked to design for a new database that contains entries for student IDs and their dorm names
Subject:Computer SciencePrice: Bought3
Assume you are asked to design for a new database that contains entries for student IDs and their dorm names. The operations you need to provide for this database are
Public Interface StudentDorms { public void addDorm(String dorm); // add the new dorm into the database. public void addId(Integer id, String dorm); // add the new student into the database. public void removeId(Integer id); // remove the target student from the database. public String getDorm(Integer id); // return the dorm of target student public Integer[] listDorm(String dorm); // return all the IDs in that dorm }
-Describe which abstract data type (ADT you would use for this database and why? The choices are HashMap/HashTable, Stack, Queue, List ADT
-How could you implement your ADT, using arrays and/or linked lists, and why?
-What's the time complexity of each operation in your implementation?
-Does your implementation have a fixed size? Explain why or why not. If it's fixed, what's the time complexity if your database needs to be expanded?This is an abstract practice question I need some help thinking about
