School of Computer Information Systems

COURSE SYLLABUS
Course Number: Course Name: Date: Quarter: Number of Credits: Prerequisite: Instructor(s): E-mail: Office Hours: Office Location: Office Phone:
REVISED

SOF 510 6DFC Data Structures and Algorithms March 18 - May 26, 2013 Q2 - 2013 4.5 Credits None Dr. Godson Chukwuma gchukwuma@stratford.edu By appointment By appointment 703-969-7126

JUNE 25, 2010

COURSE DESCRIPTION
This course introduces the definitions, implementations, and applications of the most commonly used data structures used in Computer Science, including the concept of abstract data types. The course also introduces the basic formalism and concepts used in the analysis of algorithms and in algorithm design. The relative efficiency of the algorithms studied is estimated by the informal application of these ideas. The algorithms and data structures discussed include those for sorting, searching, graph problems, dynamic programming, combinatorial search and others.

EXPECTED LEARNING OUTCOMES (IN BEHAVIORAL/MEASUREMENT TERMS)

After completing this course, students will be able to:
1. Evaluate fundamental data structures and in regular and object-oriented programming languages 2. Construct and data structures based on customer requirements using various software engineering paradigms. 3. Illustrate Application use cases using object oriented data structures/constructs in an waterfall, spiral, evolutionary, and iterative-incremental models. 4. Design patterns for reusable and reconfigurable software.

TEXTBOOKS & RESOURCES

Required: Sedgewick, R. and Wayne, K. Algorithms (4th ed.) ISBN: 978-0321573513

In addition to your textbook, you are strongly encouraged to take advantage of available resource materials to enrich your knowledge.
INSTRUCTIONAL METHODS
Method of Instruction

Residential Courses:
Residential courses are delivered over a 10-week period. Each course has both in-class and online components. The in-class sessions will be for a period of 4.0 hours each consecutive week. In addition, students will be required to participate in an online session (in the form of threaded discussions embedded with critical thinking) for an asynchronous period of 1 hour each week after the conclusion of the in-class session. Class participation is required from each student in both the in-class and online sessions for 45 contact hours in 9 weeks. Week 10 is review week. Online component: The instructor will use MOODLE for the delivery of the online component. Each week after the in-class lecture, the instructor will post one or more questions related to the material discussed in the class to initiate a threaded discussion. Every student registered for the class is required to actively participate and contribute substantially relevant information directly addressing the Instructors question/s or a subsequent comment/s on the original question from other students.

All responses are due within the week and before the start of the next scheduled inclass session in order to obtain a grade and also to facilitate feedback from the instructor on the responses to the question.
Instructions for accessing MOODLE and the registered courses will be provided to each student by the instructor during the first class of the quarter.

Online Courses:
Online courses are delivered over a 10-week period. Recognizing the diverse learning styles present in any classroom, a variety of instructional techniques will be used to encourage learning. These include, but are not limited to, discussion board responses and dialogue, research papers, asynchronous lectures using electronic modes of communication. Online courses are delivered in an asynchronous mode, students are required to participate in course activities and complete the required assignments or projects of each week before the deadline set by the instructor. The workweek for online courses is from Monday (12:01 AM) to Sunday (11:55 PM). This course is of 4.5 credit hours, each student is expected to spend at least 4 hours 30 minutes each week, working on the course for a total of 45 contact hours in 9 weeks.

LIBRARY USAGE
Students are encouraged to use the library resources throughout the course of their study program. There are multiple research resources available to Stratford University students to supplement classroom instruction and assigned textbooks. Each Stratford University campus has a large library with computer terminals and dedicated library staff. Both shelf racked books and online texts are available for students, staff, and faculty. The resources along with the information about library holdings can also be accessed online through Stratford University website www.stratford.edu Click on: Current Student > Library Online > EBooks Online > Net Library Username: student Password: stratford EBSCOhost is a powerful online reference system accessible via the Internet. It offers a variety of proprietary full text databases and popular databases from leading information providers. EBSCOhost is accessed through the Stratford home page at www.stratford.edu Click on: Current Student > Library Online > Research Database, follow the link

Username: gradmba Password: gradmbasu1

GRADING CRITERIA AND SCALE

Grading Criteria: Proposed Homework assignments (3) Throughout the semester you will write three 5-7-page papers in response to a question as noted in the Weekly Tasks section of course outline below. These papers will involve analysis of readings, comparing and contrasting the views of authors, and critique of arguments presented by the readings or the class. There will be a discussion of the question the week prior to the paper's due date. Papers will be graded for accuracy of interpretation, rigor of argument, and clarity of expression. Students should also integrate answers to the following three questions in their papers: What is the author trying to say? What is the significance of what you read? How does the material influence you? Research Paper Each student will prepare a research paper on Data Structures and Algorithms. The research paper should be 15 25 pages in length and include at least 10 bibliographic references in addition to the course texts. The paper must include position statements of your view about the following: Implementation and Applications of the most commonly used data structures and the relative efficiency of algorithms. References should be listed at the end of the paper and should follow reasonably accurate American Psychological Association (APA) formatting. The APA Website: http://www.apastyle.org can be consulted for assistance. Final Exam There will be a final closed book exam. Discussion Board Participation (9) The Discussion Board will be employed as a forum for discussing issues of interest to the class through the web. Students are required to participate each week in a Discussion Board discussion (weeks 1 9). Also, appropriate NETIQUETTE should be followed for all postings. Grade Instruments Grade Points Three 5-7 page papers at 150 Points 50 points each % of Final Grade 15%

Research paper Midterm Exam Final exam Nine weekly Discussion Board participation occurrences at 5 points each week Attendance a week TOTAL

100 Points 100 Points 100 Points 45 Points

20% 25% 18%

5 Points

2% 100%

The success of this course depends on our ability to have read the assigned readings closely, to have thought carefully about the points raised or ignored by authors, and to bring to the group your questions and concerns about their theses and positions into the discussions groups. Having prepared the readings prior to class ensures your productive participation. Classes will typically begin with a question I have posed the previous week. We should work to achieve conversational exchanges with each other, constructively challenging each other to think broadly and critically about ideas or assertions posed by the readings. In all participation and assignments I am looking for evidence of: demonstration of substantial knowledge and higher order thinking and analytic skills and application of facts, concepts, terms, and processes learned/read/discussed; evidence of critical contemplation, i.e., "grapple" with issues and topics; appropriate use of knowledge learned; imaginative thinking and responses to challenges/problems/issues; exploring underlying assumptions about education and schooling; clarity of expression and logical connection among ideas expressed; writing that reflects precise and concise thinking; excellent writing mechanics - grammar, syntax, and spelling.

Grading Scale: The following grade scale is used to determine a letter grade: Score Range 93.0 90.0 87.0 83.0 80.0 77.0 73.0 70.0 100 92.9 89.9 86.9 82.9 79.9 76.9 72.9 Grade A AB+ B BC+ C CQuality Points 4.00 3.67 3.33 3.00 2.67 2.33 2.00 1.67 Description Excellent Average Poor

67.0 69.9 60.0 66.9 Below 60.0 Incomplete Withdrawal

D+ D F I W

1.33 1.00 0.00 0.00 0.00

Very Poor Incomplete Withdrawal

ASSIGNMENT AND EXAM SCHEDULE

Residential Courses: Residential courses meet in-class each week; students must complete the required assignments and coursework before the next session of the class. Students must also keep track of the assignment deadlines set by the instructor. Online Courses: The workweek of online classes is from Monday (12:01 AM) to Sunday (11:55 PM). Each week is a module of study. Each weeks coursework will be completed in succession on a weekly basis. Students must complete all assignments, quizzes, by the posted due dates. Each week students are responsible for two items (required tasks): 1. Read the contents under each weeks link (Discussions, Assignments, and Lecture Notes et al) in addition to the assigned chapters for the current week and take notes. 2. Complete the assigned tasks; including the discussions, written assignment or quiz as stated in the course outline. ***Written Assignments must be submitted through Moodle learning management system. The professor will indicate the document particulars such as page length, format and style requirements, the front page to identify the course, course number, instructors name, student or team, due dates, et al. for submissions. Make sure to Spell-check your work before submission***

COURSE OUTLINE
Dates (insert dates for each week) Week One 3/18-3/24
Course overview/Review of the Syllabus The Role of Algorithms in

Topic(s)

Weekly Assignments

Week 1 Threaded Discussion Handout

Computing

Week Two Array-Based Structures and Simple 3/25-3/31 Week Three 4/1-4/7
Sorting

Read chapters 2 & 3 Homework #1 Due next class Week 2 Threaded Discussion
Read chapters 4,&5 Week 3 Threaded Discussion

Stacks and Queues Linked Structures: List nodes Algorithms: Analysis of Algorithms Searching and Sorting/Recursion: Insertion, Binary, Merge Sort

Week Four

Read chapter 6 Week 4 Threaded Discussion

Review for Midterm Exam 4/8-4/14 Week Five Mid Term

Week 5 Discussion
Read chapters 7 & 8 Week 6 Threaded Discussion Read chapters 11 & 12 Homework #2 Due next class Week 7 Threaded Discussion

4/15-4/21 Week Six 4/22-4/28 Week Seven 4/29-5/5 Week Eight 5/6-5/12 Week Nine 5/13-5/19 Week Ten 5/20 5/26

Advanced Sorting: Insertion and Quick Trees and Sets: Tree Traversal; Binary Search Trees Hash Tables & Heap sorts

Graphs and Memory management

Read chapters 13 & 14 Homework #3 Due next class Week 8 Threaded Discussion

Final Exam

Review of Final Exam

UNIVERSITY NOTICES
Academic Misconduct

Listed below are examples of unacceptable behaviors and practices that will result in penalties enforced against the offending student. Do not engage in any of these practices personally, and please notify your instructor or the program Dean if you are aware of any other students who have committed any of these offenses. Sanctions for violations of this policy include oral and/or written admonition, assignment or course failure, disciplinary probation, or suspension or dismissal from the University. Please refer to the Stratford University Catalog for complete information on grounds for punishment. Grounds for Academic Dishonesty/Misconduct Plagiarism presenting the work of another as ones own in a paper, exam, or other assignment. Acknowledgment must be given for the use of anothers ideas or language. Cheating on Examinations copying anothers work or allowing your work to be copied; using unauthorized notes; taking anothers exam or having another take yours. Computer Use software is protected by copyright. Students may not copy the institutions software without permission of the copyright holder. Additionally, students may not place personal software on the institutions computers or damage or destroy either software or computers. Other Forms other forms of academic dishonesty include: selling or purchasing examinations, papers or other assignments and submitting or resubmitting the same paper for two different classes without explicit authorization.

Grounds for Non-Academic Dishonesty/Misconduct Physical and/or psychological abuse, threat, or harassment. Initiation of, or causing to be initiated, any false report, warning or threat of fire, explosion, or other emergency. Unauthorized use, possession, or storage of any weapon, dangerous chemical or explosive element. Disrupting, obstructing or interfering with University-sponsored events. Theft of school equipment, products and supply materials. Unauthorized possession, use, sale, or distribution of alcoholic beverages or any illegal or controlled substance. Gambling or holding raffle or lottery at the University without proper approval. Disorderly, lewd, or obscene conduct. A breach of established or reasonable classroom safety procedures.

Attendance Policy Students are expected to attend all regularly scheduled classes. Should absences be necessary, students are responsible for the material covered during the absences. Faculty cannot grant requests for excessive amounts of make-up material, and they may request written documentation detailing the reason for the absences. Excessive absences make it almost impossible for a student to meet the academic objectives of a course; they frequently cause a student to receive a lower grade, even though, the absences were unavoidable. Attendance is recorded each class period. This data is available for verification of attendance by the appropriate governmental agencies and educational accrediting organizations.

Drops and Withdrawals Should a student wish to drop the course they may do so during the add/drop period of the quarter only. The student must see the academic advisor and the Registrar to initiate and complete the process. If a student fails to do so, the student may be charged for the classes. Such cases will be dealt with according to the guidelines and policies in the University catalog. Grade Dispute Policy Students with questions with regard to the grading policies in this course, please contact the instructor for clarification. Disputes with regard to final grades received in this course are handled in accordance with the Universitys grade dispute policy. Inclement Weather Policy In the event of inclement weather, consult the Stratford University website at www.stratford.edu for information on University closings and delays. Security on Campus Any person in immediate danger due to crime or emergency while on University property should contact local police immediately by dialing 911. When the emergency has subsided, the victim should also report the incident as soon as possible to any Stratford University official.

REFERENCES
Alfred V. Aho, John E. Hopcropft, and Jeffrey D. Ullman. Data Structures and Algorithms. AddisonWesley, 1983. Alfred V. Aho and Jeffrey D. Ullman. Foundations of Computer Science. Computer Science Press, 1992. ANSI Accredited Standards Committee X3, Information Processing Systems. Working Paper for Draft Proposed International Standard for Information Systems--Programming Language C++, December 1996. Document Number X3J16/96-0225 WG21/N1043. E. Horowitz, S. Sahni, and D. Mehta, Fundamentals of Data Structures in C++, W H. Freeman Press, 1995. E. Horowitz, S. Sahni, and S. Rajasekaran, Computer Algorithms/C++, W. H. Freeman Press, 1997. E. Horowitz, S. Sahni, and S. Rajasekaran, Computer Algorithms,W. H. Freeman Press, 1998. J.H. Kingston, Algorithms and Data Structures, Addison-Wesley Publishing Company, 1990,

D.E. Knuth, The Art of Computer Programming, Vol.3, Sorting and Searching, Addison-Wesley, Massachusetts, 1973. Ken Arnold and James Gosling. The Java Programming Language. The Java Series. Addison-Wesley, 1996. Borland International, 1800 Green Hills Road, P.O. Box 660001, Scotts Valley, CA 95067-0001. Borland C++ Version 3.0 Programmer's Guide, 1991. Timothy A. Budd. Classic Data Structures in C++. Addison-Wesley, 1994. Computational Science Education Project. Mathematical optimization. Virtual book, 1995. http://csep1.phy.ornl.gov/CSEP/MO/MO.html. Computational Science Education Project. Random number generators. Virtual book, 1995. http://csep1.phy.ornl.gov/CSEP/RN/RN.html. Gaelan Dodds de Wolf, Robert J. Gregg, Barbara P. Harris, and Matthew H. Scargill, editors. Gage Canadian Dictionary. Gage Educational Publishing Company, 1997. Rick Decker and Stuart Hirshfeld. Working Classes: Data Structures and Algorithms Using C++. PWS Publishing Company, 1996.

10