Linear Algebra (About 4 days)

System of Equations:

- X= 4 or any number --- one solution

- 4=6 or any other number equals each other no solution
- X=x or 13=13 that mean  infinite number of solutions

Eigen values & Eigen vectors:

Data structures and algorithms

Big O:

1- Complexity in term of input size N

2- Machine independent

3- Basic step

4- Time and space

5-
 ‫اذا كانت الزيادة داخل اللوب فيها جمع او طرح يكون الكومبليكستي ‪n‬‬ ‫‪-1‬‬
‫اذا كانت الزيادة ضرب او قسمة يكون الكوبليكستي" ‪log n‬‬ ‫‪-2‬‬

‫‪Data structures and algorithms‬‬

Algorithms and time complexity:

Bubble Sort:

Quick Sort:
Insertion sort:

Selection sort:

Merge sort:

Breadth and Depth first search:

Binary Search Tree is a node-based binary tree data structure which has the following
properties:
 The left subtree of a node contains only nodes with keys lesser than the
node’s key.
 The right subtree of a node contains only nodes with keys greater than the
node’s key.
 The left and right subtree each must also be a binary search tree.