Dixie State College -- Computer and Information Technology

SYLLABUS

Instructor Barton Stander

Lab hours: Click here

Description: Course for students in Computer Science and Computer and Information Technologies programs, or having interest in computer programming. This course will instruct students in the design and use of common data structures, lists, stacks, queues, trees, tables, hash tables, and graphs. Students will be required to complete several challenging programming projects.

If you are a student with a physical or mental impairment and would like to request accommodations, please contact the Disability Resource Center (652-7516) in Room 201 of the Student Services Center. The Disability Resource Center will determine your eligibility for services based upon complete professional documentation. If you are deemed eligible, the Disability Resource Center will further evaluate the effectiveness of your accommodation requests and will authorize reasonable accommodations that are appropriate for your disability.

Objectives:

The student will be able to discuss the basic principles of many software data structures, including effeciencies and tradeoffs.
The student will implement and use several data structures.
exponents/logs
Making a class robust
const, in all its flavors
Template classes
Big-O complexity
Algorithm Analysis
Computational Complexity
assert
Stacks, Queues, Unsorted List, Sorted List
Standard template library (STL)
parsing mathematical expressions
Binary Search Tree (BST)
balanced trees
Hashing
priority queues and heaps
Advanced Recursion
Types of variable allocation: stack, heap, and global.
Searching and sorting algorithms
try/catch
Graphs
external methods

Prerequisites: CS 1410

Attendance: Students are responsible for material covered and announcements made in class. School related absences may be made up only if prior arrangements are made. The class schedule presented is approximate. The instructor reserves the right to modify the schedule according to class needs. Changes will be announced in class.

Labs: You may use the computers in Udvar-Hazy 151 and Udvar-Hazy 200. There will also be TAs in this lab.

Resources: The recommended text for this course is ''Data Structures and Algorithm Analysis in C++ Third Ed.'' by Mark Allen Weiss. (ISBN 0-321-37531-9)

Reading: The student is responsible for reading the material in the textbook. A reading schedule is provided with the class schedule. The student is expected to read the material before the class in which it is discussed.

Tests: There will be midterms and a final. Tests will likely be extensions of homework assignments, so be sure to keep backups of all of your work.

Homework: Homework will be graded on accuracy of function and style of design. Homework is due at 11:59p.m. on the date listed in the schedule. I cannot over emphasize the importance of starting early and getting all your assignments done before their due date. Programs that do not compile will receive no credit.

Multiple Ways to Turn In Homework:

Show it to the TA in the lab, if there is one. The hours will be announced and posted. This method is preferred because you get direct feedback.
Show it to the instructor during his office hours, or by appointment. This method is also preferred.
Email the source file as an attachment directly to the instructor. This method is strongly discouraged because you will not have a chance to fix any problems, and thus might lose points. It is also far more work for the instructor.

Late Policy: Assignments are due at 11:59p.m. on the date specified in the schedule. Handing them in after 11:59p.m. is considered 1 day late. You may turn them in up to 3 school days late but you lose 10 percent per day. After 3 days late, you receive ZERO points.

For example: an assignment due Tuesday at 11:59 p.m. and turned in on time can receive 100 percent.

Between Tuesday 11:59p.m. and Wednesday 11:59p.m. the assignment can receive at most 90 percent.
Between Wednesday 11:59p.m. and Thursday 11:59p.m. the assignment can receive at most 80 percent.
Between Thursday 11:59p.m. and Friday 11:59p.m. the assignment can receive at most 70 percent.
After Friday 11:59p.m. the assignment will not be accepted.

Saturdays, Sundays, and school holidays do not count as late days. Late days do NOT extend beyond the last day of class.

Time Commitment: Courses should require about 45 hours of work per credit hour of class. This class will require about 135 hours of work on the part of the student to achieve a passing grade. If you don’t have the time to spend on this course, you should probably rethink your schedule.

Cheating: Cheating will not be tolerated, and will result in a failing grade for the students involved. Cheating includes, but is not limited to, turning in homework assignments that are not the student’s work.

You are encouraged to work in groups while studying for tests, discussing class lectures, discussing algorithms for homework solutions, and helping each other identify errors in your homework solutions.

However, each student must create and type in their own solution. Any kind of copying and pasting is NOT okay. If you need help understanding concepts, get it from the instructor or fellow classmates. But never copy another’s code, either electronically or visually.

Grading: Programming assignments and tests each contribute to your total points. Your final grade is based on the percentage of points that you earn.

Percent	Grade	Percent	Grade	Percent	Grade	Percent	Grade
94-100	A	84-86.9	B	74-76.9	C	64-66.9	D
90-93.9	A-	80-83.9	B-	70-73.9	C-	60-63.9	D-
87-89.9	B+	77-79.9	C+	67-69.9	D+	< 60	F