# CSC2025 Quiz 3Fall 2013

This web page is http://www.bernstein-plus-sons.com/.dowling/CSC2025S11/CSC2025_Quiz_3.html

This is the third daily quiz to be taken on or before Tuesday, 8 October 2013. It should take you between 1 and 5 hours to answer the following questions. You should do this quiz after doing the rest of assignment 3.

You may not use your text book. You may use your notebook. You may not help one another.

<==== Do this AFTER you've answered all the questions

You probably DON'T want to do this ===>

Please fill in the following information:

Name:

Email:

Please answer the following questions on this form (or on a paper copy of this form).

1. Summarize your proposed portfolio project

2. Explain in detail the ways in which your proposed portfolio project will demonstrate your skills and content knowledge related to this course.

3. Explain in detail what aspects of this portfolio project will be your own original creative effort.

4. Explain in detail what aspects of this portfolio project will not be your own original creative effort and where those aspects will come from and what permissions you need in order to use them.

5. Explain in detail what support services you will use for this project.

6. What open source license will you use for your porfolio project?

7. Briefly summarize your think-piece essay on the question of optimizing performance code on computers.

8. Using any suitable programming language, write the a method or function (not a program) to merge two sorted of integers lists into one sorted list of integers. Be careful to explicitly define the data structure you are using for the lists.

9. Using any suitable programming languages, write methods or functions that implement stack push and pop. Be careful to explicitly define the data structure you are using for the stack.

10. Using any suitable programming languages, write methods or functions that implement enqueue and dequeue for a queue of integers. Be careful to explicitly define the data structure you are using for the queue

11. Using any suitable programming languages, write a method or function to insert an integer into a linked list of integers, where the insertion will always place the integer into the linked list in numerical order of the the values of the integers in the list, so the list is always sorted.

12. Explain the three most important things you learned from Dr. Garg's lecture 10.

13. Explain the three most important things you learned from Dr. Garg's lecture 11.

14. Explain the three most important things you learned from Dr. Garg's lecture 12.

15. Explain the three most important things you learned from Dr. Garg's lecture 13.

16. Explain the three most important things you learned from Dr. Garg's lecture 14.

17. Explain the three most important things you learned from Dr. Garg's lecture 15.

<==== Do this AFTER you've answered all the questions

You probably DON'T want to do this ===>

Revised 28 September 2013