CSC3971 Midterm

Spring 2013
Herbert J. Bernstein ( )

CSC3971 Midterm
Spring 2013


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

This is the Midterm 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:

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 the first 5 assgnments. This question is worth 1/6th of your grade on this midterm. The grade depends on how clearly and thoroughly you have taken those notes. For this question, you may improve your notes now before answering the question. When the same question is asked on the final, you will lose credit on this question by updating at the last minute..

  2. Give the URLs of your thread of programming tasks, which should have 3 completed tasks and at least a draft of the fourth. 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 midterm.

  3. By now you should have completed 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. Give the URL of your final report on that project. If it is not complete, post as much as you have for partial credit and give the URL.

  4. Give the URL(s) for as much as you have on the BOSPRE programming problems.

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

  6. Design and implement a program in any language of your choosing that accepts an arbtrary block of text, extracts all the words in that text, where a word is defined as a blank or punctuation-delimited string, and reports the number of words in the text and the number of distinct words in the text. Blanks, tabs and punctuation never count as words or as parts of words. The program must be case-insentitive. For example, "How now brown cow." contains 4 words and 4 distinct words; "Do do that voodoo that you do so well" contains 9 words and 7 distinct words; and "Harried Hairy Harry, harried, hairy and hurried, halted.%quot; contains 8 words and 6 distinct words. 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 11 March 2013