Develop an algorithm and implement First-In-First-Out (FIFO) page replacement algorithm using C/C++. Determine the number of page faults and page hits by considering the Frame size=3, Reference String =11 13 10 14 15 12 11 19 18 16 15 17 14 16 19 21.

Write a c++ code that implement a loop that accesses a number of different locations in an array over-and-over again, and see how the average access time changes as the array size increases, from a size small enough to fit in L1 cache to a size too large to fit in L2 (or L3) cache.  Try to estimate the sizes of your caches.

Write a C program to find words in a word search. User types the word and the program confirms which row and column it is in from the word search that is 4 by 4.   Word Search: W B N Z E T A G A F B C T A I L Implement the function: void search2D(char wrd[], int wordSize, const int size, char grid[size][size]);

Write a C  program that initializes an array with ten random integers and then prints four lines of output, containing Every element at an even index. Every even element. All elements in reverse order. Only the first and last element.