Introduction to Japanese for Beginners......

As a beginner to japanese language you may know that there are three type of letter in japanese language.

1. Hiragana
2. Katakana
3. Kanji

To learn the language easily and quickly you should follow the above order of three type of letters.

Hiragana

Hiragana  letters usually have  phonetic sounds.These are basically used for particles, words and part of words. This express 46 different sounds used in the japanese language.when practising hiragana letters you will be able to pronouns japanese letters properly,read and write.If you learn hiragana first it will be easier to learn katakana next.

Katakana

These letters are basically used for foreign words.Katakana is a phonetic alphabet.Katakana was developed in the 8th century by simplifying the form of kanji symbols. Katakana and Hiragana represent exactly the same set of sounds.

Kanji

These are chinese characters and used for the stem of words and convey the japanese language.

********

As a beginner you should learn how to write and pronounce vowel letters in hiragana alphabet.

 Above letters are in the order of English Vowels A, I , U , E, O.

After practising vowel sounds in hiragana alphabet you should try following letters.

• Try the following exercise after practising above letters.

1. aka (red)
2. ao (blue)
3. aki (autumn)
4. ie (house)
5. koe (voice)
6. kao (face)
7. ue (on top)
8. kaki (permission)
9. eki (station)
10. okii (big)

By : Pramodi Samaratunga  - University Of Moratuwa 

        Madhusanka Edirimanna - University Of Moratuwa 

       

 

B+ Tree...

Examples for Insertion of data in to a B+ Tree

B+ tree is a rooted tree that consist of a root,internal nodes and leaves.In a B+ tree of order ( or branching factor) n should satisfy the following properties.

• From root to leaf all the path's length should be same.

• Each node that is not a root or a leaf has between (n/2) and n children. 

• A leaf node has between ((n-1)/2) and n-1 values. 

• If the root is not a leaf it has at least 2 children .

• If the root is a leaf (there are no other nodes in the tree) it can have and 0 and (n-1) values.

Example 01-Enter numbers in to a B+ Tree

Branching factor-5
Number Sequence-5,10,15,20,25,30,35,40,50,55,65,70,75,80,90,95

Not a root or leaf has children between = (n/2) , n

                                                                  

                                                                   =(5/2), 5

             

                                                                   = 3,5

Leaf node has values between                =((n-1)/2) , (n-1)

                                                                  =(4/2), 4

                                                                  =2,4 

Example 02-Enter Strings to a B+ Tree

When you entering strings to a B+ tree you should consider the alphabetical order.

Branching factor=3

Colombo,Kandy,Galle,Badulla,Gampaha,Kottawa,Kalutara

Not a root or leaf has children between = (n/2) , n

                                                                   = 2, 3

Leaf node has values between                =((n-1)/2) , (n-1)

                                                                   = 1 , 2

Advantages of B+ Tree

• Insertion, Deletion, Update does not affect to the performance since it is a balance tree structure.

• Searching data is becomes more easy since all records are stored only in the leaf node.

• Minimizing disk accesses by lowering the tree height due to large node fanout.

• Keys are used for Indexing.

Disadvantages of B+ Tree

• This method is less efficient for static tables.

By : Pramodi Samaratunga      -  University Of Moratuwa 

       Madhusanka Edirimanna  -  University Of Moratuwa