CSC3971 Final

Spring 2013
Herbert J. Bernstein ( )

CSC3971 Final
Spring 2013


This web page is
Copyright © 2011, 2012, 2013 Herbert J. Bernstein and other parties. All rights reserved.

This is the Final to be taken by 9 am on Monday, 18 March 2013. It should take you between 1 and 3 hours to answer the following questions, if you have kept up with the work for the course to this point, much longer, if not. It is an open book, open notes, open computer exam.

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

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

Please fill in the following information:



Skype ID:

Grades must be submitted shortly after this final is given. If you have not finished enough of the work for this course to earn at least a C-, you will be given an incomplete. Some people may prefer an incomplete to having a C- recorded. If you are unconditionally requesting an incomplete, say so here:

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

  1. Give the URL in your blog where you have detailed notes on everything you have done for all the assgnments. Be sure to include a link for each and every assignment so that all materials that are being offered for grading for this course are accessible from your blog. This question is worth 1/6th of your grade on this final. The grade depends on how clearly and thoroughly you have taken those notes and how timely those notes were.

  2. Give the URL of your each of five members of the thread of programming tasks., Be certain that the postings include a clear statements of what parts are your own original creative effort and clearly identifies the sources for the parts that are not. This question is worth 1/6th of your grade on this final.

  3. Give the URLs for everything you have accomplished the exercise in programming to design and implement a program to take an arbitrary set of three-dimensional coordinates and find which one of those points is close to a given probe point. In addition, in your answer here quantitatively summarize you comparison of the performance of brute-force techniques versus tree-based techniques and qualitively explain why tree-based techniques perform differently.

  4. Give the URL(s) for as much as you have on the BOSPRE programming problems. You should have completed at least 12 of these problems. However, be very careful that you only list solutions that you personally understand and can explain in detailed when asked to do so during the Skype session.

  5. Carefully and in detail, compare the similarities and differences among Java, C and C++.

  6. The dot product, dot(a,b), of two vectors a=[a1,a2,...,an] and b=[b1,b2,] is a1*b1+a2*b2+...+an*bn. The dot product is also equal to the product of the lengths of the two vectors times the cosine of the angle between them, i.e. dot(a,b) = ||a||*||b||*cos(theta). The length of a vector a, ||a|| is sqrt(dot(a,a)). Design and implement a program in any language of your choosing that will accept two vectors a and b, of an arbitrary dimension, n, compute the length of each vector,||a|| and ||b||, dot product, dot(a,b), and the angle theta for which dot(a,b) = ||a||*||b||*cos(theta). Post the program on your Google sites web site and submit the URL.

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

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

Revised 5 May 2013