• Like
  • Save
Syllabus
Upcoming SlideShare
Loading in...5
×
 

Syllabus

on

  • 381 views

 

Statistics

Views

Total Views
381
Views on SlideShare
381
Embed Views
0

Actions

Likes
0
Downloads
1
Comments
0

0 Embeds 0

No embeds

Accessibility

Categories

Upload Details

Uploaded via as Microsoft Word

Usage Rights

© All Rights Reserved

Report content

Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
  • Full Name Full Name Comment goes here.
    Are you sure you want to
    Your message goes here
    Processing…
Post Comment
Edit your comment

    Syllabus Syllabus Document Transcript

    • Course Policy CSCI2320 Data Structure Fall 2009 Catalog description This class is a required course for majors and minors. The fundamental data structures including sets, lists, trees, and graphs are studied. Various methods of implementing these structures are investigated and analyzed Prerequisite: CSCI 1480 COMPUTER SCIENCE II Course goals Upon completion of this course, the students should be able to demonstrate an: 1. Understand of the basic of data structure in the form of a C++ class and the ability to develop data structure for applications. Supports Program Outcome b via questions on quiz and exams 2. Understanding of the different types of data structures and the ability to select an efficient data structure for implementing the solution needed. Supports Outcome b via programming homework and project. 3. Ability to work with others as a team. Supports Program Outcome d via a team project. 4. Understanding of Data Mining techniques based on specific data structure. Supports Program Outcome i via quiz and exams. Computer Science Program Outcomes • Outcome b. An ability to analyze a problem, and identify and define the computing requirements appropriate to its solution; • Outcome d. An ability to function effectively on teams to accomplish a common goal • Outcome i. An ability to use current techniques, skills, and tools necessary for computing practices; Textbook Data Structures and Problem Solving Using C++ (Second Edition) by Alan Weiss, published by Addison-Wesley, 2000 Reference ADTs, Data Structure, and Problem Solving 2nd edition, Larry Nyhoff, Pearson Prentice Hall, 2005. Course Description This course includes the following major topics: • Array, Pointers and Structures • Object and Classes • Inheritance • Algorithm Analysis • Lists • Stacks • Queues • Link lists • Binary Trees • Hash Tables • Recursions • Sorting • Data Mining - Clustering 1
    • Course Grade Your course grade shall be based on the weights specified in the following table. Component Type Effort Percentage Quizzes 10% Homework Individual 10% Exam1 Individual 20% Exam2 Individual 20% Final Exam Individual 25% Course Project Team 10% Attendance 5% Your numeric score will be translated to a letter grade at the end of the semester according to the table below. Numeric Score Letter Grade 90 – 100 A 80 – 89 B 70 – 79 C 60 – 69 D 0 - 59 F Statement on Academic dishonesty/plagiarism: Academic misconduct is defined in the section of Academic Policies in your Student Handbook. Students who engage in such misconduct will be penalized. You are encouraged to familiarize with all policies listed in the Student Handbook The University of Central Arkansas adheres to the requirements of the Americans with Disabilities Act. If you need an accommodation under this Act due to a disability, please contact the UCA Office of Disability Services, 450-3135 Dr. Bernard Chen, Ph.D. Assistant Professor Computer Science Department University of Central Arkansas 2
    • CSCI 2320: Data Structure (Fall 2009) Class Policy Instructor: Dr. Bernard Chen Office: MCS 304, Email: bchen@uca.edu Class Schedule: M.W.F.10:00 – 10:50 a.m. at MCST 328 Office Hours: 9:00 am- 10:00 am and 11:00 am-1:00 pm, Monday, Wednesday, Friday; 2:00 pm-4:00 pm Monday, Wednesday or by appointment Extra instruction is available and encouraged when your own attempts to understand the subject matter are unsuccessful. Come prepared with specific questions or areas to be discussed. Attendance and Drop Policy 1. Attendance is mandatory. Attendance will be taken in the form of a short answer related to the class. If you are absent on a day when homework, lab assignments or programming projects are due, you will automatically forfeit any points assigned; the course assignment late-policy shall not apply. In addition, missed in-class daily work, quizzes and exams cannot be made-up. If you do not attend class, you automatically forfeit any points given that day. Only Exceptions: a. School related functions such as band, orchestra, sports events, etc. A note from the coach, instructor, supervisor, etc. must be provided. Any homework, lab assignments, or programming projects due during the planned absence must be turned in to the instructor prior to the missed class, unless prior approval is obtained from your instructor (via written request) to submit the work after you return. Any missed exams must be made-up by the first class-day following the return from such an excused event. b. Medically related absence. For all medically related absences proper documentation from a physician including the physician’s name and phone number included on the document must be provided. c. Family related emergency. Such emergencies must involve an immediate family member (father, mother, brother, sister) or other member identified in advance to the professor. 2. It is the student’s responsibility to find out any information they missed due to an absence. 3. The students are allowed to miss three classes during one semester. However, if the students miss more than 3 classes, for each class the students missed, it will result in one point reduction from the final score of the class. 4. If the students absent from the class for consecutive two weeks (4 classes for T,TH class; 6 classes for M,W,F classes), the students will receive a “W” without notice. 5. All computers and cell phones need to be shut down during the class. If the computer or cell phone is turned on when it is not necessary, students will be considered absent for the class. Homework Policy 1. Homework shall be submitted on the date due. NO LATE ASSIGNMENTS SHALL BE ACCEPTED. 2. Unless specifically stated otherwise, you may collaborate on homework; however, the work submitted must reflect the individual effort of the person presenting the work. 3. If it is necessary for a student to be absent, it is still their responsibility to determine if there are any changes in assignment due dates, schedule changes, etc. and to submit all assignments when due. 4. Save all work on a floppy diskette or USB flash memory device for back-up purposes. (The computers on campus are reloaded periodically and anything you leave on them will be erased.) 5. In case of a discrepancy in recorded grades, it is suggested that each student keep a portfolio of his/her graded work. 3
    • Exam Policy 1. Missing an exam is a very serious matter. There are only 3 valid reasons for missing an exam (see Attendance and Drop Policy above): a. School related functions such as band, orchestra, sports events, etc. A note from the coach, instructor, supervisor, etc. must be provided. b. An illness which requires a doctor's care (you must provide documentation from your physician for the absence, which includes the physician’s name and phone number.) c. A documented family emergency such as a death or surgery. 2. Make-up tests will be conducted at the instructor’s discretion. Classroom / Lab Conduct 1. No food/drink in the classroom or lab. 2. No cell phone use in the classroom or lab (talking, texting, calculating, etc.). 3. No music/pornography in the classroom or lab. 4. Students must be provided with an environment conducive to learning. Disturbance of class by inappropriate talking, laughing, being loud, inappropriate images on your computer screen, etc. shall result in the student’s dismissal from the class. 5. Class and lab time are to be devoted to learning the material outlined in the course policy and syllabus. This time shall not be utilized for checking email, visiting FaceBook or MySpace sites, or engaging in chat or any other non-course related activities. Violation of this policy shall result in the student’s dismissal from the class. Academic Misconduct 1. The conduct of students in this course is expected to be in compliance with the ethical standards detailed on pages 40-41 of the UCA 2006-2007 Student Handbook in the section entitled “Definition of Academic Misconduct”. 2. Dishonesty in any form – including plagiarism, turning in assignments prepared by others, unauthorized possession of exams, copying assignments from other student’s work/storage media, allowing other students to copy or view your work – shall result in the student being penalized for the violation; such penalty may result in that student being dismissed from the course and assigned an “F” at the end of the semester. If assignments are copied, both students involved will be penalized equally. University Policies It is important that you familiarize yourself with the university policies described in the UCA 2006-2007 Student Handbook. a. Computer Use Policy: Refer to the section starting on page 31 of the UCA 2006-2007 Student Handbook. b. Sexual Harassment Policy: Refer to the section starting on page 117 of the UCA 2006-2007 Student Handbook. c. Academic Policies: Refer to the section starting on page 38 of the UCA 2006-2007 Student Handbook. Disabilities The University of Central Arkansas adheres to the requirements of the Americans with Disabilities Act. If you need an accommodation under this Act due to a disability, please contact the UCA Office of Disability Services at 450-3135. Dr. Bernard Chen, Ph.D. Assistant Professor Computer Science Department University of Central Arkansas 4
    • CSCI 2320 Data Structure Fall ‘09 Wk Hours Topics/Events Reading 2 2 Arrays, Pointers, and Structures Ch1 2 2 Objects and Classes Ch2 3 2 Templates Ch3 3 2 Inheritance Ch4 4 2 Algorithm Analysis Ch6 4 4 Stack and Queues Ch16 6 2 Review + Exam 1 7 2 Linked List Ch13 8 4 Trees Ch18 9 4 Binary Search Trees Ch19 10 4 Hash Tables Ch12 12 3 Binary Heap Ch21 13 2 Review + Exam 1 14 3 Recursion Ch8 15 3 Sorting Ch9 16 2 Data Mining Ch 10 16 2 Project Presentation and Report Ch 10 NOTE: This syllabus represents a general plan for the course and deviations from this plan may be necessary during the duration of the course. 5