Best writers. Best papers. Let professionals take care of your academic papers

Order a similar paper and get 15% discount on your first order with us
Use the following coupon "FIRST15"
ORDER NOW

graph data structures and algorithms

DEAR WRITERS!
This is not a typical essay task.
Please place your bid if you know ( and willing) how to do this assignment

*************8

The entire homework assignment will be attached as a pdf along with some Java classes and text files necessary to complete the work. Please complete the extra credit part too. The homework is implemented in the BaseMain.java file ONLY. DO NOT ALTER ANY OF THE OTHER FILES.

Need assignment help for this question?

If you need assistance with writing your essay, we are ready to help you!

OUR PROCESS

Order

Payment

Writing

Delivery

Why Choose Us: Cost-efficiency, Plagiarism free, Money Back Guarantee, On-time Delivery, Total Сonfidentiality, 24/7 Support, 100% originality

In this assignment, you will practice applying your knowledge of graph data structures and algorithms to determine an optimal order to learn logographic characters.
Consider the following scenario: as a native speaker of the English language, you wish to learn a language like Chinese (汉语) or Japanese (日本語), which uses a special
character set. Unlike the English language, which uses the Roman alphabet to encode phonetics, many east Asian languages use Hanzi derived characters, which are
symbols with semantics bound to them (to use the technical term: logographic character). Often times, English speakers learning a language using logographic characters
find themselves stumped by the apparently insurmountable problem of memorizing thousands of unique characters. They all look so different and yet so similar – can we
hope to tell them apart or write them? 大変な問題!Wouldn’t it be nice if we could use our knowledge of algorithms and data structures to somehow address this problem
so that English speakers would have a better shot at learning 汉语 or 日本語…?
One interesting dependency graph that can be constructed is a “component” graph for Hanzi characters, or Hanzi derived characters (e.g., Kanji). You see, complex
characters are often built from simpler characters as components. This sub-structure is very useful! Components not only define a common appearance and stroke order but
can indicate phonetics and/or semantics. Furthermore, there are considerably fewer components (hundreds) than actual characters (thousands). (Please note that we use the
term component very generally here – it does not map to the traditional notion of a radical.) This sub-structure is particularly useful for people memorizing characters –
instead of looking at each character as a monolithic block, one can memorize the individual components, and then reuse that knowledge for more complex characters. The
following graph is an example of this for the character 法 (“method”)