Most international students need to write essays and reports for exams and
coursework. Yet writing good academic English is one of the most
demanding tasks students face. This new edition of Academic Writing has
been fully revised to help students reach this goal. Clearly organised, the
course explains the writing process from start to finish .

Hashing is a technique used for storing and retrieving information as quickly as possible.
It is used to perform optimal searches and is useful in implementing symbol tables.

GRAPH is a non linear data structure in which the elements are arranged randomly inside the memory and are interconnected with each other.
A graph G is an ordered pair of sets (V E ) where:
•V is the set of vertices.
•E is the edges which connect the vertices.

Continuation of lecture 8.

-A TREE is a dynamic data structure that represents the
hierarchical relationships between individual data items.
-It’s a data structure in which the elements are arranged in the
parent and child relationship manner.
-In a tree, nodes are organized in a hierarchical way in such a
way that:
•Root is the beginning of the tree.
•Branches are Lines that connecting the nodes
•Leaf nodes are nodes that have no children.