|
|
Last revised December 19, 2018
The
contents of this website, the links contained therein directly and
indirectly, and the contents of the said links, are copyrighted. They are provided exclusively for
non-profit educational use by the students currently enrolled in this
course and for the duration of this semester. No other use or any use by others is allowed
without authorization of the professor in this course and copyright holder or holders.Best Student Awards for past semesters
TestsExtra credit test (click here) due September 17, 2018, in class.
Practice exam: http://csc.csudh.edu/suchenek/CSC401/Practice_exam.pdf
Answers: http://csc.csudh.edu/suchenek/CSC401/Practice_exam_answers.pdf
The Tests page may be subject to change (which is possible but not very likely) as I will cover the course material. You are
welcome to study for your tests and final in advance, but by doing so you accept a (small) risk
that some of the study you have done might not be relevant to the tests and/or final.
Some test and final questions may be similar to some homework problems,
so although homework yields no credit (unless noted otherwise), doing
all homework is likely to help you get a better grade in this course.
For all tests, use scantron form 882-E.
All tests are closed-textbook, no-notes tests.
However, you will be allowed to use Mathematica on all tests.
Test 1 will be given November 5 19.
The test will cover all sections listed in the Course Outline up to but not including Section 4.5 4.8, as well as all the relevant material posted in the Lecture Notes, Programs and Homework.
Specifically, the following sections of the textbook will be covered:
1.3.1, 1.3.2, 1.4.2, 1.4.3, 1.4.6, 1.4.7, 1.5, 1.6, 3.4, 3.6, 3.7, and 4.1 through 4.4 4.7.
A link to a more detailed list of topics that will be covered by Test 1 is here.
Mathematical aspects will be somewhat emphasized on Test 1. You will be
expected, among other things, to actually prove something (e.g., a
theorem proved in class) or to derive a formula. In addition to proofs and derivations, there will be some
multiple-choice questions on the Test 1, too.
Test 2 will be given December 3.
The second test will cover all relevant sections listed in the Course Outline.
The
material is cumulative so virtually all factst covered from the
beginning of the semester may be needed to answer questions on the test. However, the direct coverage begins with Section 4.5 4.8 and goes up to and including Section 5.3 7.4, as well as all the material posted in the Lecture Notes (from here up to, but not including, there), Programs (between here and here) and Homework (from here up to, but not including, there).
A link to a more detailed list of topics that were in the scope of Test 1 is here. These topics will or may be covered by Test 2 and Final Exam, particularly those that were not covered by Test 1.
The final will be given December 17, 7:45 p.m.
The final
examination is a comprehensive closed-textbook multiple-choice exam. There will be 30 or more different multiple-choice questions. For multiple-choice questions, use scantron form 882-E. The time
allowed for
completion of the final
is 2 hours, but you may be allowed to work on it for an additional half hour.
The
final will coverer all the material covered by Tests 1 an 2, as well as
all the material covered in class after Test 2 and assigned as
readings, and only that material. Please, consult the Course Outline as well as all the material posted in the Lecture Notes, Programs and Homework. Material covered in class after Test 2, particularly Chapter 13, NP-complete problems, may be covered somewhat more exhaustively than the rest of the course material.
The Fall 2018 recipients of a signed
copy of my paper on Analysis of
Heapsort were:
In Graduate Students category
- Mr. Harmanjeet Singh Brar
for the
highest overall score and for the highest score on the final
exam in my CSC
501 class.
In Undergraduate Students category
for the highest overall score and for the highest score on the final exam in my CSC 401 class.
The Spring 2016 recipients of a signed
copy of my paper on Analysis of
Heapsort were:
In Graduate Students category
for the
highest overall score and for the highest score on the final
exam in my CSC
501 class.
In Undergraduate Students category
for the highest overall score
and
- Mr. Guillermo Roberto Lara Jr
for the highest score on the final exam in my CSC 401 class.
The Fall 2015 recipients of a signed
copy of my paper on Analysis of
Heapsort were:
In Graduate Students category
for the
highest overall score and for the highest score on the final
exam in my CSC
501 class.
In Undergraduate Students category
for the highest overall score
and
- Mr. Theodor Alexandru Soneriu
for the highest score on the final exam in my CSC 401 class.
The
Spring 2015 recipients of a signed
copy of my paper on Analysis of
Heapsort were:
In Graduate Students category
- Mr. Basil Ahmed I Alhakami
for the
highest overall score
and (ex equo)
and
for the highest score on the final
exam in my CSC
501 class.
In Undergraduate Students category
for the highest overall score
and
for the highest score on the final exam in my CSC 401 class.
Congratulations!
They
can, at their discretion, either pick up their copies personally, in
which case I will also offer them a friendly handshake, or provide me a
postal address at which they wish their copy to be mailed.
The
Spring 2014 recipients of a signed copy of my paper on Analysis of
Heapsort were:
In Graduate Students category
for the highest score on the final exam and for the highest overall score in my CSC 501 class.
In Undergraduate Students category
for the highest overall score
and
for the highest score on the final exam in my CSC 401 class.
The
Spring 2013 recipients of a signed copy of my paper on Analysis of
Heapsort were:
In Graduate Students category
for the highest score on the final exam and for the highest overall score in my CSC 501 class.
In Undergraduate Students category
-
Mr. Jeremiah Noble Hankins IV
for the highest score on the final exam and for the highest overall score in my CSC 401 class.
|
|
|
|
|
|
|