MY CRIB: 2008

Non-Linear Data Structures

= do not form a sequence, for example Tree, Hash tree, Binary tree,etc. There are two ways of represneting linear data strucutresin memory.One way is to have the linear relationship betweent he elements by means of sequential memory locations. Such linear strucutres are called arrays. The other way is to have the linear relationship betweent he elements represnted by means of links.Such linear data strucutres are callled linked list.

TREES: A tree is a non-empty collection of vertices & edges that satisfies certain requirements. A vertex is a simple object (node) that can have a name and carry other associated information. An edge is a connection between two vertices.
A Tree is a finite set of a zero or more vertices such that there is one specially designated vertex called Root and the remaining vertices are partitioned into a collection of sub-trees, each of which is also a tree. A node may not have children, such node is known as Leaf (terminal node). The line from parent to a child is called a branch or an edge. Children to same parent are called siblings.

A path in a tree a list of distinct vertices in which successive vertices are connected by edges in the tree. There is exactly one path between the root and the other nodes in tree.
A Length is a path is a number of ranches on the path, in path from m to n, m is a ancestor of n & n is descendent of m.
A Depth of any node m is the length of the path from root to m. Thus root is always at 0 depth. The Height of a node m is the longest path from m to leaf. Thus all leaves ate at heght zero. Sometime Depth is referred as level of the tree from root.
A set of tree is called forest.
A Binary Tree is tree which either empty or consists of a root node & two disjoint trees called left & right sub-tree. 2-tree or strict binary tree, is a binary tree, which either contains no children or two disjoint children.
A binary tree can be implemented by a simple linked list. The number of nodes at level I is 2^I. Therefore for a complete binary tree with K levels contains k
E 2^I
I=0.

A binary tree can be traversed using four different algorithms

1. Inorder: Left-Root-Right.
2. Post-order: Left-Right-Root
3. Pre-order: Root-Left-Right, It employs Depth First Search.
4. Level-by-level.

COMPUTER SYSTEM= includes not only the computer, but also any software and peripheral devices that are necessary to make the computer function. Every computer system, for example, requires an operating system.

COMPUTER HARDWARES

1.Motherboard
2.Power supply
3.Storage controllers
4.Video display controller
5. Removable media devices
6. Internal storage
7. Sound card
8. Networking
9.Input
10.Output

THE STRUCTURE OF AN EGG

Covered by hard shell.The shell protects the inner structure and prevents desiccation.Its yolk is the main and the base.The white is the bed of the yolk.To protect the white it has a shell membrane that coats and protect everything before the shell.Spherical in shape that makes it unique.The yolk is where a chick developes.