Data Structures: Abstraction and Design Using Java, 2nd Edition (required) ISBN: Wiley (online version also available)

Size: px

Start display at page:

Download "Data Structures: Abstraction and Design Using Java, 2nd Edition (required) ISBN: Wiley (online version also available)"

Jocelyn Ferguson
5 years ago
Views:

1 CSCI 223 Course Syllabus (Spring 2012) 1 CSCI 223: Data Structures and Algorithms Michael Verdicchio (Instructor) Instructor Information Name and Contact: Assistant Professor Michael Verdicchio Department of Mathematics and Computer Science The Citadel, The Military College of South Carolina 171 Moultrie Street; Charleston, SC Office Location: Thompson Hall 226 Office Phone: mv@citadel.edu -- The subject of all must contain this text (no spaces): CSCI223 s without this text may not be read and may not receive a response. Office Hours: MWF 11-12, Other times by appointment just ask Course Information Title: CSCI 223: Data Structures and Algorithms Class Meets: MWF 10:00AM to 10:50AM in Thompson Hall 216 Credits: 3 credit hours Prerequisites: CSCI 202 and MATH 206 Website: Textbook 1: Data Structures: Abstraction and Design Using Java, 2nd Edition (required) ISBN: Wiley (online version also available) Textbook 2: Introduction to Algorithms, 3rd Edition (optional) ISBN: The MIT Press (This book is one you d keep even after graduation.) Google Apps will be used throughout the class, so each student needs to have a Google Account. If you don t want to use your personal one that s fine, but you will need to have one set up for the class. Dropbox: Cloud storage will be used to submit assignments. If you do not have an account on Dropbox, use the following link and sign up (free). Important Dates: Please check the course calendar regularly. It will be kept current with important course dates, though it may not be exhaustive. Course Description Catalog Description: Required for B.S. degree in computer science; formal specification and implementation of abstract data types, and analysis of algorithms; topics include list and set representation methods, sorting, trees, and graphs. Data structures used include stacks, queues, binary trees, hash tables, priority queues, and search trees.

2 CSCI 223 Course Syllabus (Spring 2012) 2 Course Outcomes: Upon successful completion of this course, a student will be able to: Explain the theory and implementation issues related to trees, heaps, hash tables, and graphs Analyze problems to identify an appropriate ADT and implementation to be used in the problem solution Use a modern IDE to create, compile, debug, test and execute Java programs where an ADT implementation is of primary importance in the solution Explain and apply the basic concepts of algorithm analysis. Tips for Success: One does not learn by reading a book alone; practice is essential. Students who are most successful read the upcoming sections in the text book ahead of time to first introduce terms and concepts, attend every class and participate actively (taking notes and asking questions), review the material in the text again to make sure it is clear, read and begin assignments shortly after they are posted so they may ask questions well ahead of the deadline, go to office hours or use online discussion when help is needed, study past homework, quizzes, handouts and lecture notes to practice writing code in preparation for exams. In contrast, many of the students who find themselves unsuccessful read their books only the night before an exam (which is seldom useful), do not attend class regularly (when they do they are distant, distracted, or sleeping), never ask questions when they don t understand something, never write a line of code they are not forced to write, and begin homework assignments one or two days before they are due. These habits often result in poor performance and many late nights. Making small, seemingly insignificant choices to take the right actions towards your goals, over time, will turn in to massive success and set you apart from the common lot. Classroom Policies Attendance is mandatory and will be taken daily Show up on time, alert, and with a good attitude Nothing can be made up without a documented medical excuse Late assignments are never accepted. Start early and seek help often. Take notes and ask questions; notes are not posted Create the right environment where everyone can learn Communicate like an adult/professional Turn your phone off (vibrate is not off) or don t bring it You can use computers or tablets in class for academic purposes only Recording Lectures: No part of any lecture may be recorded, transmitted, or stored in any retrieval device without the prior consent of the instructor. Notes may be taken strictly for personal use; however these notes may not be given to anyone who is not enrolled in the current section of the course. Notes, or any record of the class proceedings are also not permitted to be sold, used, or licensed to any company or organization, especially those designed for the redistribution of said materials. Student Collaboration: Students are encouraged to discuss the course and assignments with one another on an appropriate level. Discussion of problems and approaches is

3 CSCI 223 Course Syllabus (Spring 2012) 3 perfectly acceptable, but discussion of solutions is not. section to help determine the particulars. Please see the next Academic Integrity: Cheating is contemptible and those who cheat are reprehensible. The Citadel Honor Code requires each student to act with honesty and integrity and to respect the rights of others in carrying out all academic assignments. This official policy can be found here: There are a number of actions that constitute a violation of this policy. These actions include, but are not limited to: practicing any form of academic deceit; referring to materials or sources or employing devices (e.g., audio recorders, crib sheets, calculators, solution manuals, or commercial research services) not specifically authorized by the instructor for use during tests, quizzes, homework, and/or class activities; acting as a substitute for another person in any academic evaluation or using a substitute in any academic evaluation; possessing, buying, selling, or otherwise obtaining or using, without appropriate authorization, a copy of any materials intended to be used for academic evaluation in advance of its administration; depending on the aid of others to the extent that the work is not representative of the student s abilities, knowing or having good reason to believe that this aid is not authorized by the instructor; providing inappropriate aid to another person, knowing or having good reason to believe the aid is not authorized by the instructor; submitting the ideas or work of another person or persons without customary and proper acknowledgment of sources (i.e., engaging in plagiarism); permitting one's own ideas or work to be submitted by another person without the instructor s authorization; attempting to influence or change any academic evaluation or record for reasons having no relevance to class achievement School policy allows for cheating sanctions ranging from zero credit for an assignment to expulsion (without expectation of readmission) from the University. Any student who is found to have violated the Honor Code in this course, no matter how minor the violation, will at a minimum receive a failing grade by reason of academic dishonesty in the course (permanent record). Rather than existing for the sake of strictness, this policy is intended to create a fair evaluation system for students who choose to abide by the standards for academic integrity by eliminating from consideration the grades of those who choose not to. Assignments and Assessment (subject to change) Grade Distribution: Your course grade in CSCI 223 will be based on the distribution below. Each item is elaborated upon in the following sections. Shotguns (unannounced quizzes) 5% Homework 15% Labs 25% Midterm Exams (2, 15% each) 30% Final Exam (New Material + Comprehensive Material) 25%

4 CSCI 223 Course Syllabus (Spring 2012) 4 Exam Dates: Midterm 1 Friday 17 February :00-10:50 Midterm 2 Friday 23 March :00-10:50 Final Exam Friday 27 April :00-4:00 Letter Grades: Letter grades will be assigned according to the table below. The percentages represent the lowest grade guaranteed for that percentage. If necessary, final grades may be scaled or adjusted, potentially allowing a higher grade than dictated by the table, but one cannot earn a lower grade than dictated. For example, if you earn 80%, you will get at least a B for your final grade. Grades are never rounded. A B C D F 90% 80% 70% 60% <60% Shotguns: Homework: Labs: Exams: Final Exam: Grading Appeals: Submission: Reading: Shotguns are pop-quizzes and may come at any time. They may range from being a glorified attendance credit, to a quick concept review, to a short exercise. They may be easy, or they may be tricky. There are an unspecified number of shotguns during the semester. Homework assignments are assigned frequently and don t involve writing code. They will be graded pass/fail, but the content will not be graded. Since the content will likely appear on exams, make sure you take the time to find the correct answers. Solutions will not be posted, but you can come in for help. Labs are programming assignments and projects that will span up to two weeks in duration. They must adhere to all guidelines for content, behavior and submission in order to be considered for credit. There will be two midterm exams (not counting the final exam) given during the term and the dates are given in this syllabus. The exams will be comprehensive in the sense that they build upon concepts covered in previous exams, but not in the sense that there will be repeat questions. Exams may consist of multiple choice, fill-in-the-blank, short answer, written programming, computer programming problems, etc. The final exam is comprehensive in the sense that there may be repeated questions and concepts from past exams, quizzes and shotguns in addition to any new material covered after the most recent midterm exam. Any discrepancy or disagreement in grading must be presented to the instructor in writing within one week of your receipt of your graded materials; otherwise no grade change will be made. Detailed instructions for submission will be given with each assignment. is never an acceptable form of submission unless explicitly requested. A lecture schedule will be posted. Students are encouraged to read ahead of time and after lectures to familiarize themselves with and then review the concepts to be covered in lecture. After this, the text makes a great reference book to use while you practice programming by physically typing your own programs on the computer. In other words, you cannot learn to program just by reading the book.

5 CSCI 223 Course Syllabus (Spring 2012) 5 Handwritten Work: Please make certain that any work submitted for grading written by hand (such as shotguns, quizzes and exams) looks like a college student wrote it and not a fifth grade student. If I can t read it, I can t properly grade it. Resources Honors: Disability: Students wishing to take CSCI 223 under the Honors Program need to approach the instructor during the first week of class. If you anticipate issues related to the format or requirements of this course, please meet with me. I would like us to discuss ways to ensure your full participation in the course. If you determine that formal, disability related accommodations are necessary, it is very important that you register with the Academic Support Center (117 Thompson Hall, ) and notify me of your eligibility for reasonable accommodations. We can then plan how best to coordinate your accommodations.

Data Structures and Algorithms

CS 3114 Data Structures and Algorithms 1 Trinity College Library Univ. of Dublin Instructor and Course Information 2 William D McQuain Email: Office: Office Hours: wmcquain@cs.vt.edu 634 McBryde Hall see