CSC3971 Advanced Programming I -- Computer Science Diagnostic Quiz

Spring 2007
Herbert J. Bernstein ( )

CSC3971 Advanced Programming I -- Computer Science Diagnostic Quiz
Spring 2007

 


This web page is http://www.bernstein-plus-sons.com/.dowling/CSC3971F11/CS_Diagnostic_Quiz.html
Copyright © 2007 Herbert J. Bernstein and other parties. All rights reserved.


This is a computer science diagnistic quiz to be taken on the first day of class. This exam is to help you and your instructor see if you are adequately prepared (or perhaps more than adequately prepared) to take the course for which you have registered. Please do the best that you can on this quiz, but the results will not have any impact on your grade for the course. If you find yourself unable to do most or all of these questions, you should discuss this with the instructor immediately. Unless your problems are likely to respond to intensive tutoring, you may wish to consider taking some other course this semester and taking this course when you have a more solid background. However, do not be concerned if you can do most of the problems but cannot do all of the problems.

This exam must be the results of your own efforts.

The ONLY use you may make of a computer in doing this quiz is to open one browser window to bring you to the online version of the quiz. You may not use a calculator and you may not search for the answers on the web

To avoid disturbing other students, you must remain seated until the end of the examination period.

  <==== 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 as many of the following questions as possible on this form (or on a paper copy of this form).

  1. Define a stack as a data structure.

  2. Define a queue as a data structure.

  3. Define a heap as a data structure.

  4. Define a linked list as a data structure.

  5. Define the meaning of big "oh" notation.

  6. Define the meaning of little "oh" notation.

  7. Using java, write a "Hello World" program

  8. Explain a reasonably efficient algorithm to find shortest paths in a directed graph.

  9. Explain a reasonably efficient algorithm to sort an array of numbers.

  10. Explain the ethics and legalities of copying an image you find in the web.

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

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

Revised 15 Aug 2011