Java program using data structures (Trees and nodes)
$10-30 USD
ที่ทำเสร็จแล้ว
โพสต์ เกือบ 7 ปีที่ผ่านมา
$10-30 USD
ชำระเงินเมื่อส่งงาน
Solution must be in Java only.
The input will contain a sequence of commands (as described below), each on a separate
line containing no more than eighty characters. Item names are case sensitive, and each is no longer
than ten characters. The command names (DEPEND, INSTALL, REMOVE and LIST) always appear in
uppercase starting in column one, and item names are separated from the command name and each
other by one or more spaces. All appropriate DEPEND commands will appear before the occurrence
of any INSTALL command that uses them; there will be at most one dependency list per item. The
end of the input is marked by a line containing only the word END. There will be at most 1000 lines
in the input.
Command : DEPEND item1 item2 [item3 ...]
Meaning : item1 depends on item2 (and item3 . . . )
Command : INSTALL item1
Meaning : install item1 and those on which it depends
Command : REMOVE item1
Meaning : remove item1, and those on which it depends, if possible
Command : LIST
Meaning : list the names of all currently-installed components in sequence of installation
The output is as in the Credit level, except for the following. As in the Credit level,
immediately after a circular dependency has been created through a DEPEND command, a warning
should be given. In the Distinction level, there should be a second line recommending a dependency
to delete. In the first instance, this should be the most recently encountered dependency statement
from the largest cycle. Subsequent DEPEND commands should also be followed by the warning;
however, the suggested dependency statement might change (because the cycle size has changed).
As before, other remaining non-DEPEND commands after that point, however, should be echoed, but
with no actions taken in response (so the echoed commands should be followed by nothing).
When there are multiple longest cycles, the recommendation for dependency deletion should be
based on the first encountered longest cycle.
This should be repeated, but recommending the most recently encountered dependency statement
from the smallest cycle.
Sample input :
DEPEND TELNET TCPIP NETCARD
DEPEND TCPIP NETCARD
DEPEND DNS TCPIP NETCARD
DEPEND BROWSER TCPIP HTML
INSTALL foo
DEPEND BROWSER2 BROWSER3 TCPIP HTML
DEPEND BROWSER3 BROWSER2
DEPEND NETCARD BROWSER
INSTALL NETCARD
INSTALL TELNET
REMOVE NETCARD
INSTALL BROWSER
INSTALL DNS
LIST
REMOVE TELNET
REMOVE NETCARD
REMOVE DNS
REMOVE NETCARD
INSTALL NETCARD
REMOVE TCPIP
REMOVE BROWSER
REMOVE TCPIP
END
Sample output :
DEPEND TELNET TCPIP NETCARD
DEPEND TCPIP NETCARD
DEPEND DNS TCPIP NETCARD
DEPEND BROWSER TCPIP HTML
INSTALL foo
Installing foo
DEPEND BROWSER2 BROWSER3 TCPIP HTML
DEPEND BROWSER3 BROWSER2
Found cycle in dependencies
Suggest removing DEPEND BROWSER3 BROWSER2
DEPEND NETCARD BROWSER
Found cycle in dependencies
Suggest removing DEPEND NETCARD BROWSER
INSTALL NETCARD
INSTALL TELNET
REMOVE NETCARD
INSTALL BROWSER
INSTALL DNS
LIST
REMOVE TELNET
REMOVE NETCARD
REMOVE DNS
REMOVE NETCARD
INSTALL NETCARD
REMOVE TCPIP
REMOVE BROWSER
REMOVE TCPIP
END
Sample input :
DEPEND TELNET TCPIP NETCARD
DEPEND TCPIP NETCARD
DEPEND DNS TCPIP NETCARD
DEPEND BROWSER TCPIP HTML
INSTALL foo
DEPEND NETCARD BROWSER
DEPEND BROWSER2 BROWSER3 TCPIP HTML
DEPEND BROWSER3 BROWSER2
Sample output :
DEPEND TELNET TCPIP NETCARD
DEPEND TCPIP NETCARD
DEPEND DNS TCPIP NETCARD
DEPEND BROWSER TCPIP HTML
INSTALL foo
Installing foo
DEPEND NETCARD BROWSER
Found cycle in dependencies
Suggest removing DEPEND NETCARD BROWSER
DEPEND BROWSER2 BROWSER3 TCPIP HTML
Found cycle in dependencies
Suggest removing DEPEND NETCARD BROWSER
DEPEND BROWSER3 BROWSER2
Found cycle in dependencies
Suggest removing DEPEND NETCARD BROWSER
Hello
My name is Ahmed, i'm a top rated freelancer.
i worked over 300 projects and over 500 hours doing java projects.
plus i passed freelancer java v3 exam with score 3.75
plus i got 2 java certificate 1Z0-803 and 1Z0-804 with 3+ years experience.
small overview of feedback on my profile
"you want to get your projects completed with quality? Hire Ahmed. Highly recommended."
"Thoroughly satisfied with Ahmed, and would recommend him to anyone looking for an excellent java developer!"
"Highly recommended. Very smart and well experience"
looking forward to work with you
Regards
Hello. How are you today.
I have read and understood the project.
I have strong knowledge in Data structures, Algorithms Design,
And I'm expert in Java ,C/C++,C#, Python ,PHP etc.
I'm interested in this project. Please send me a message so that we can discuss more.
Then I'll be happy.
I wait for your good reply.
Thanks.
I have good knowledge in below mentioned skills by you. I also have some certifications in Java. I can share some of demos with you if you want for better understanding. Currently I'm working on a banking project in an IT company using Java, jsp/jsf, hibernate, spring, software architecture and database programming. And most importantly, you will get your project done before the deadline.
Hello guy.
I've experienced in Java and algorithm. So please contact me directly for more discussion. Thanks
Relevant Skills and Experience
java, algorithm...
Proposed Milestones
$25 USD - Initial milestone
Greetings,
This seems like a fun project to do. I am a software developer from Belgium and I would love to create this project for you.
Relevant Skills and Experience
I have more than 5 years of experience as a java software developer.
Proposed Milestones
$20 USD - Complete project
Can all the standard java collections and utilities be used?
Hi there,
Thanks for sharing details, I read your job post and requirements thoroughly. I'm glad to share with you that I have expertise in developing Java applications and programs.
I can assist you in developing the required program.
Please get in touch over chat so that we can discuss details.
Thank you,
Shekhar Patil
I programed something similar about six months ago, and I am fully confident in delivering a quality lasting java data structure that you can use and update easily if necessary. I'm asking three days to do it for maximum big teating and polishing.