Complete problem 7.25 from the Deitel textbook. Use the "Time.Now()" function to record the start and end time of your application in its various forms (solve the problem in more than one way) and compare the efficiency of your various implementations.
Use the StackInheritance class from section 25.5 from the Deitel textbook and insert 100, 1000, 10000, and 100000 random integers into this data structure. Record how long it takes to insert/push these number of items (emptying the stack after each run).
Now use the System.Collections.Stack class (as discussed in section 27.4.2 from the Deitel textbook) and insert 100, 1000, 10000, and 100000 random integers into this data structure. Record how long it takes to insert/push these number of items (emptying the stack after each run) and compare the results with the StackInteritance performance.
Complete problem 18.4 from the Deitel textbook. Your program should allow the user to enter in the information about each student/grades and add them to a collection; then provide a means to serialize/deserialize to/from a file and display the collection (via text box or list box is fine)
Write a program that creates 200 threads, each of which runs a for loop to calculate the sum of the numbers 1 to 100000. Run your application on a single core machine and a dual core machine (and if possible a quad core machine - use the one in my office if needed) and denote the time to complete each. Be sure to record the processing speed (clock cycle) of the processors you use in your experiment.
Complete problem 23.4 from the Deitel textbook.