Lab work/assignments and extra work consisting of: Array's AVL Trees / Binary Search Tree's Hash table (linear / quadratic Code is in C and C# (description of C# code is in the files)

Sorting such as:

-Deals with fibonacci in 3 different ways (Iterative, recursive and dynamically)

-Declaring function prototypes, for summation, factorial and fibo each take on int as input, while gcd and power take two int inputs

-building a 2D array and seraching through it -also allows for left shift of the array

-Deals with seraching a 2-D array and finding the row with the most 1's in it.

-this program takes an int size n for an array then allocates an array of that size and takes in input from user to fill it up then prints out the array from the last spot to the first spot (reverse)

-This program will reverse an number that is given, using iterative func and a recursive fun

-basic premisis is that once a PID is in use its indicated as a 1 in the array and when the release_pid() function free it up and it goes back to 0

So the program will work as a multi-process program with multiple child and parent process creating and freeing up

-Probing hashtable of random integers using linear probing and quadratic probing -With a lower bound factor and Prime numbers as the key