COURSE SYLLABUS

WOODBURY UNIVERSITY
COLLEGE OF LIBERAL ARTS
COMPUTER SCIENCE DATA ANALYTICS
CORE 201 DATA STRUCTURES AND ALGORITHMS
FALL 2024, 3 UNITS LAB
Note: This is a tentative syllabus. The schedule of activities may change depending upon how the
class progresses.

Course Information

CORE 201, Data Structures and Algorithms, 3 units Lab

Fall 2024, August 26 through December 06, 2024
Online class
Moodle-Companion Website: https://moodle.woodbury.edu/

Faculty Information
Instructor's Name:
Dr. Samuel Sambasivam
Title: Professor and Coordinator
Department: Computer Science in Data Analytics
Office: Isaacs Faculty Center F106

Tuesdays 11:15 am-1:15 pm

Office Hours:
Thursdays 11:15 am-1:15 pm

E-mail: [email protected]
Phone: (818) 394-3336 (ext.3336)
Expected Response time for:
24-48 hours
Emails:
24-48 hours
Online posts:
One week
Assignment Submissions:
One week
Grading:

In Emergency
Contact 818.252.5251, CLAS Office

Technical Support

Call 818-252-5295 or email [email protected]

CORE 201 DATA STRUCTURES AND ALGORITHMS Page 2
Dr. Samuel Sambasivam Fall 2024

University Information
Woodbury University Mission Statement
Woodbury University transforms students into innovative professionals who will contribute responsibly to
the global community. We achieve academic excellence by focusing on purposeful student engagement,
establishing external partnerships, and ensuring that all our processes, services, and environment enrich
the student experience.

Computer Science Data Analytics Mission Statement

The mission of the Computer Science Data Analytics (CSDA) department is to transform our students into
effective, ethical, and collaborative data analytics/science professionals.

Course Information
Catalog Description
This course provides a study of algorithms and their related data structures, including linear lists, linked
lists, trees, graphs, sorting techniques, and dynamic storage allocation. The algorithms are used to
manipulate these structures and their applications. Applications are implemented using an appropriate
computer language. Prerequisite: CORE 102 (Computer Science II)

Computer Science Data Analytics Learning Outcomes

(CSDA-LO)
After successfully completing this program, students will be able to:

1. Apply computer science and statistical modeling for data-intensive problem solving and scientific
discovery as individuals and in collaboration with others
2. Use software engineering and machine learning to design and implement data-driven solutions to
real-world problems
3. Explore careers and advanced studies in a wide range of computer science and data analytics
4. Develop, articulate and present concepts of computer science and data analytics visually,
symbolically, and narratively
5. Apply citation and data ownership
6. Preserve security and sensitivity of data
7. Apply professional ethics related to transparency and reproducibility.
8. Identify and describe the ethical issues in a problematic situation.
9. Review the literature related to data analytics theories and history
10. Cultivate a commitment to life-long learning

Course Learning Outcomes (CLO)

After completing this course satisfactorily, a student will be able to:

• Describe how arrays, records, linked structures, stacks, queues, trees, and graphs are
represented in memory and used by algorithms. (relevant to CC:WC,CT & QR; CSDA-LO
#’s 1 & 2)
• Describe typical applications for arrays, records, linked structures, stacks, queues, trees,
and graphs. (relevant to CC:WC,CT & QR; CSDA-LO #’s 3 & 4)
• Write programs that use arrays, records, linked structures, stacks, queues, trees, and
graphs. (relevant to CC:WC,CT & QR; CSDA-LO #’s 3 & 4)
CORE 201 DATA STRUCTURES AND ALGORITHMS Page 3
Dr. Samuel Sambasivam Fall 2024

• Demonstrate different methods for traversing trees. (relevant to CC:WC,CT & QR;
CSDA-LO #’s 1 & 2)
• Compare alternative implementations of data structures concerning performance.
(relevant to CC:WC,CT & QR; CSDA-LO #’s 3 & 4)
• Compare and contrast the benefits of dynamic and static data structures
implementations. (relevant to CC:WC,CT & QR; CSDA-LO #’s 1 & 2)
• Describe the concept of recursion, give examples of its use, describe how it can be
implemented using a stack. (relevant to CC:WC,CT & QR; CSDA-LO #’s 3 & 4)
• Design and implement an appropriate hashing function for an application. (relevant to
CC:WC,CT & QR; CSDA-LO #’s 1 & 2)
• Discuss the computational efficiency of the principal algorithms for sorting, searching,
and hashing. (relevant to CC:WC,CT & QR; CSDA-LO #’s 3 & 4)

Student Outcomes and Expected Competencies

By the end of this course, students should be able to demonstrate mastery of the following learning
outcomes. The classroom assignments that the instructor will use to assess mastery are identified in the
table.

Student Learning Outcome IDEA Objective Assignments Used to Assess

“By the end of this course,
students should be able to……”
Describe and apply the basic Gaining factual knowledge o Quizzes
principles of data abstraction. o Programming Assignments
o Lab Projects

Implement major data structures in Gaining factual knowledge o Quizzes

a computer language. o Programming Assignments

Analyze the algorithms in terms of Developing specific skills, o Quizzes

their efficiencies. competencies, and points of view o Programming Assignments
needed by professionals in the o Midterm Exam
field
Choose appropriate data structure Learning to analyze and critically o Quizzes
algorithms in solving various real-evaluate ideas, arguments, and o Programming Assignments
problems points of view o Final Exam

Prerequisites
CORE 102 Computer Science II

Required Texts and Study Resources

Goodrich, Michael T., Tamassia, Roberto, and Goldwasser, Michael H. Data Structures and Algorithms in
Python, 1st edition, 2013, Wiley, 768 pages, visit https://www.wiley.com/en-
us/Data+Structures+and+Algorithms+in+Python%2C+1st+Edition-p-9781118476734 for more
information, ISBN-10: 1118290275; ISBN-13: 978-1118290279
CORE 201 DATA STRUCTURES AND ALGORITHMS Page 4
Dr. Samuel Sambasivam Fall 2024

Copyright Responsibilities:

Students and faculty are both authors and users of copyrighted materials. As a student, you must know
the rights of both authors and users concerning copyrighted works to ensure compliance. It is equally
important to be knowledgeable about legally permitted uses of copyrighted materials. Information about
copyright compliance, fair use, and websites for downloading information legally can be found at
https://library.woodbury.edu/about-copyright.

Recommended Reading and Other Course Resources

In this course, there will be Programming Assignments (PA) using Python.

• Problem-Solving with Algorithms and Data Structures Using Python, 2nd Ed., Bradley N. Miller &
David L. Ranum, Franklin, Beedle & Associates; 2nd edition (August 22, 2011), ISBN-13: 978-
1590282571
• Structure and Interpretation of Computer Programs - 2nd Edition, H. Abelson and J. Sussman with
J. Sussman, ISBN-13: 978-0262510875
• [SOFTWARE]: https://www.python.org/downloads/

Moodle Companion Address

https://moodle.woodbury.edu/

Course Schedule
Week 1 – August 26-30, 2024

Reading: Chapters 1 & 2

Topics: Course introduction and Moodle website

Data Abstraction, Structures, Classes

Discussion Board(DQ): Week 1 DQ

Programming Assignment(PA): No PA this week

Labs: WK1Day1-Lab-Install Python and

PyCharm IDE

WK1-Day2-Lab-PyCharm Project
Demo
CORE 201 DATA STRUCTURES AND ALGORITHMS Page 5
Dr. Samuel Sambasivam Fall 2024

Week 2 – September 2-6, 2024

Reading: Chapter 5 - Arrays

Topics: Abstract Data Abstraction (ADT),

Structures, Classes

Discussion Board(DQ): Week 2 DQ

Programming Assignment: PA #1 Assigned

Labs: WK2-Day1-Lab

WK2-Day2-Lab

Labor Day: Monday, September 2, 2024 - Holiday

Last Day to Drop classes: Friday, September 6, 2024

Week 3 – September 9-13, 2024

Reading: Chapter 7: Linked Lists

Topics: Preliminaries
Programming with Linked Lists
Variations of the Linked List
Discussion Board(DQ): Week 3 DQ

Programming Assignment: No PA this week

Due Date: None

Labs: WK3-Day1-Lab

WK3-Day2-Lab

Quiz: Quiz #1

Week 4 – September 16-20, 2024

Reading: Chapter 6 – Stacks.

Topics: The Abstract Data Type Stack

Simple Applications of the ADT Stack
CORE 201 DATA STRUCTURES AND ALGORITHMS Page 6
Dr. Samuel Sambasivam Fall 2024

Discussion Board(DQ): Week 4 DQ

Programming Assignment: PA #2 Assigned

Due Date: PA #1 – September 19, 2024

Labs: WK4Day1-Lab

WK4-Day2-Lab

Quiz: Quiz #2

Week 5 – September 23-27, 2024

Reading: Chapter 6 – Stacks II

Topics: Implementations of the ADT Stack

Application: Algebraic Expressions

Discussion Board(DQ): Week 5 DQ

Programming Assignment: No PA this week

Due Date: None

Labs: None

Quiz: Quiz #3

Week 6 – September 30-October 4, 2024

Reading: Chapter 6 – Queues.

Topics: The Abstract Data Type Queue

Simple Applications of the ADT Queue
Implementations of the ADT Queue
A Summary of Position-Oriented ADTs
Discussion Board(DQ): Week 6 DQ

Programming Assignment: PA #3 is assigned.

Due Date: PA #2 – October 3, 2024

CORE 201 DATA STRUCTURES AND ALGORITHMS Page 7
Dr. Samuel Sambasivam Fall 2024

Labs: WK6-Lab

Quiz: Quiz #4

Week 7 – October 7-11, 2024

Reading: Chapter 4 – Recursion: The Mirrors.

Topics: Recursive Solutions

Counting Things

Searching an Array

Organizing Data

Recursion and Efficiency

Discussion Board(DQ): Week 7 DQ

Programming Assignment: No PA this week

Labs: WK7-Lab

Due Date: None

Quiz: Quiz #5

University Enrichment Days: October 8 - 9, 2024

Week 8 – October 14-18, 2024

Reading: Read Chapters 1, 2, 4, 5, 6, 7

Topics: Review Topics of Weeks 1 – 7

Programming Assignment: PA # 4 is assigned

Due Date: PA #3 – October 17, 2024

Midterm Exam: October 17, 2024

Last Day to Withdraw: October 18, 2024

CORE 201 DATA STRUCTURES AND ALGORITHMS Page 8
Dr. Samuel Sambasivam Fall 2024

Week 9 – October 21-25, 2024

Reading: Chapters 3 & 12 - Algorithm Efficiency and

Sorting
Topics: Measuring the Efficiency of Algorithms
Sorting Algorithms and Their Efficiency
Discussion Board(DQ): Week 9 DQ

Programming Assignment: No PA this week

Labs: WK9-Lab

Due Date: None

Quiz: None

Week 10 – October 28-November 1, 2024

Reading: Chapters 9 & 11 – Trees.

Topics: Terminology
The ADT Binary Tree
The ADT Binary Search Tree
Discussion Board(DQ): Week 10 DQ

Programming Assignment: PA #5 is assigned

Due Date: PA #4 – October 31, 2024

Labs: WK10-Lab

Quiz: Quiz #6

Advising: October 28, 2024-November 25, 2024

Week 11 – November 4-8, 2024

Reading:
Chapters 9 & 11 – Trees II

Topics: Trees

Discussion Board(DQ): Week 11 DQ

CORE 201 DATA STRUCTURES AND ALGORITHMS Page 9
Dr. Samuel Sambasivam Fall 2024

Programming Assignment: None

Labs: WK11-Lab

Due Date: None

Quiz: None

Week 12 - November 11-15, 2024

Reading: Chapters 9 & 11 - Advanced

Implementations of Trees.
Topics: Balanced Search Trees
Hashing
Discussion Board(DQ): Week 12 DQ

Programming Assignment: PA #6 is assigned

Due Date: PA #5 – November 14, 2024

Labs: WK12-Lab

Quiz: Quiz #7

Week 13 - November 18-22, 2024

Reading: Chapter 14 - Graphs.

Topics: Terminology
Graphs as ADTs
Discussion Board(DQ): Week 13 DQ

Programming Assignment: None

Due Date: None

Labs: WK13-Day-Lab

Quiz: Quiz #8

Thanksgiving Holidays Thursday, Friday-November 28–29,2024

CORE 201 DATA STRUCTURES AND ALGORITHMS Page 10
Dr. Samuel Sambasivam Fall 2024

Week 14 - November 25-29, 2024

Reading: Chapter 14 – Graphs II

Topics: Graph Traversals

Applications of Graphs

Discussion Board(DQ): Week 14 DQ

Programming Assignment: PA # 6 – November 26, 2024

Due Date: None

Labs: WK14-Lab

Quiz: Quiz #9

Thanksgiving Holidays Thursday, Friday-November 28–29,2024

Week 15 - December 2-6, 2024

Reading: Review Chapters 1 – 8, 11, 12, 14

Topics: Review for Final Exam

Programming Assignment: None

Due Date: None

Final Exam: Week of December 2-6, 2024

Campus Holiday Closure: Friday, December 25-January 1, 2025

Winter Break: December 16, 2024 – January 10, 2025

Midterm and Final Exam: Midterm will be given during week eight on October 17, 2024. The Final will be
given during week 15, December 2-6, 2024.

Note: Course schedule, topics, evaluation, and assignments may be changed at the instructor’s
discretion.

Due Dates
CORE 201 DATA STRUCTURES AND ALGORITHMS Page 11
Dr. Samuel Sambasivam Fall 2024

Homework/Project Date Assigned Due date

Programming Assignment #1 September 3, 2024 September 19, 2024

Programming Assignment #2 September 19, 2024 October 3, 2024

Programming Assignment #3 October 3, 2024 October 17, 2024

Programming Assignment #4 October 17, 2024 October 30, 2024

Programming Assignment #5 October 30, 2024 November 14, 2024

Programming Assignment #6 November 14, 2024 November 26, 2024

Midterm Exam October 17, 2024

Final Exam December 2-6, 2024

Assignments

Six (PA) Programming Assignments using Python will be given during the semester. These PAs are to be
completed individually by each student. Guidelines for submitting your programs will follow. Instructions
for submitting your assignments and labs are given on the course website in Moodle.

Resource Availability
All the availability of library and online resources, such as journals that students may be required or
recommended to use, are given in Moodle under the ‘Assignment folder.’

Delivery of Assignment
The discussion questions will be in the Forum tool in Moodle. The PAs will be in the ‘Assignments’ folder.
The weekly quizzes, midterm exam, and final exam are available in ‘Tests and Quizzes’ in Moodle/class.

Readings

Assigned reading assignments are to be completed before class attendance. See the course schedule
above for reading assignments.

Programming Assignments (PA)

There are NINE submissions of PAs in this course. These assignments are to be completed individually by
each student. Guidelines for submitting your programs will follow. Your program will be graded based on
the following criteria:

Compiles and runs 40%

Correctness of the code 40%
Style and Documentation 20%
CORE 201 DATA STRUCTURES AND ALGORITHMS Page 12
Dr. Samuel Sambasivam Fall 2024

Information Literacy and Use of the Library

Information literacy is defined as “a set of abilities requiring individuals to recognize when information is
needed and can locate, evaluate, and use effectively the needed information” (American Library
Association, 1989). In this course, teaching and learning processes will employ the following information
literacy standards, as endorsed by the American Association for Higher Education (1999), the Association
of College and Research Libraries (2000), and the Council of Independent Colleges (2004). The students
in this course will:

• Determine the nature and extent of the information needed.

• Access needed information effectively and efficiently.
• Evaluate the information and its sources critically and incorporates selected information into his or her
knowledge base and value system.
• Individually or as a member of a group, use information effectively to accomplish a specific purpose.
• Understand many of the economic, legal, and social issues surrounding the use of information and
access and uses information ethically and legally.

This course requires students to complete course assignments using resources available from the
University Libraries. Research assistance and subject guides for this course are available at
https://library.woodbury.edu/

Evaluation/Assessment Rationale for Grade

Determination
Course Grade Factors

The breakdown of the grades percentages is:

Attendance & Discussion 5%

Quizzes 5%
Lab Projects 10%
Programming Assignments 30%
Midterm Exam 25%
Comprehensive Final Exam 25%

Letter grades will be assigned using the following scale:

93% to 100%, A 77% to 79%, C+

90% to 92%, A- 73% to 76%, C

87% to 89%, B+ 70% to 72%, C-

83% to 86%, B 60% to 69%, D

80% to 82%, B- <60%, F

At the discretion of the instructor, grades will be "curved." Note: Course evaluation and weights may be
changed at the instructor’s discretion.
CORE 201 DATA STRUCTURES AND ALGORITHMS Page 13
Dr. Samuel Sambasivam Fall 2024

Course Letter Grades

For all assignments, their numerical grading equivalent, and course grade, the grading criteria is
described as follows:

A: In addition to the criteria for a “B”, superior knowledge regarding details, assumptions, implications,
history; superior thinking with information relevant to the application, critique, and relationship to other
information. An outstanding mastery of the subject with excellence evident in preparation for and
attendance in-class sessions, curious and retentive mind, unusual ability to analyze and synthesize
material, with a positive attitude making productive contributions to the learning community in the
classroom.

B: In addition to the criteria for a “C”, more than adequate knowledge regarding technical terms,
distinctions, and possesses an ability to use information. Above-average student in terms of attendance,
preparation, time management, mostly consistent in test-taking, and attitude.

C: Basic knowledge needed to function and carry on learning regarding major principles, central terms,
major figures, also possesses an awareness of field or discipline. An average or typical student in terms
of attendance, preparation, time management, inconsistent test-taking, and attitude.

D: Serious gaps in knowledge, confusion of concepts and categories, inability to recall basic information.
Below average or a typical student in terms of attendance, preparation, time management, inconsistent
test-taking, and attitude—minimally passing in performance.

F: Absence of knowledge, incapable of carrying on a conversation about the subject, misunderstands

most concepts, confuses all categories... Inadequate/insufficient performance. Repeat course.

Incompletes will not be given for this course without extenuating circumstances and convincing
reasons demonstrated by the student to the instructor’s satisfaction.

Course Policies

Lecture Attendance and Participation

To benefit the most from classroom discussions, each student is required to read each section in the
textbook before class. Each student should come to class with prepared questions, as well as participate
in other activities or discussions, as needed.

PHILOSOPHY: Projects and labs present some of the best opportunities for Programming, but it is still
important to receive a “first exposure” to course materials during lectures. It is imperative for learning that
students not only show up to lecture but engage with the content and fellow students.

GENERAL: The instructor will keep the class roster containing each student’s name. From time to time
(about 5-6 times per lecture), the instructor will call on a name randomly to answer a question. If the
student is not there or does not know the answer because they were not paying attention, the student will
lose 1% of their total grade, up to 9% during the entire semester. Please note that if a student is watching
videos or playing games, the instructor may automatically dock the student 1% without asking them a
question.
CORE 201 DATA STRUCTURES AND ALGORITHMS Page 14
Dr. Samuel Sambasivam Fall 2024

If a student did not know the answer and was paying attention, it is okay to take a guess or briefly say, “I
don’t know.” The intent is not to always be correct, but to encourage students to do their best to pay
attention and retain the information being taught.

All students will be called on uniformly (i.e., a student will NOT be called on a 2nd time before all other
students are called on at least once). However, the instructor may go through the entire deck of names in
one lecture at his/her discretion.

Computer Usage Policy

For best learning, it is expected that students be engaged with the lecture by interacting with the
instructor, other students (when applicable), and the material. It is understandable and often expected
that students have laptops open to take notes and/or write code along with the instructor. However,
students may not play games or watch videos during the lecture and will be prompted by the instructor to
stop and/or will be docked points on his/her overall course grade.

Not only do these behaviors (games/video) disengage the student from the material, but they prove highly
distracting to surrounding students and the instructor. Please know that the instructor does not get
offended by these actions, but has noticed a strong correlation between students who consistently play
games and/or watch videos during lectures and poor grades.

Assignment Completion
To receive credit, all course assignments are to be completed and submitted on time, as recorded in the
Assignments tool within the Moodle companion course website.

Deadlines All assignments for the course are to be completed and submitted on time, as recorded in the
Assignments tool in the Moodle course site, in order to receive full credit. Late assignments will be
penalized 10% per assignment for each day late. Late assignments will be accepted until 10 days after the
due date. Permission for late work is granted only by special request to your faculty. Incompletes are rare
and are available only in “special or unusual circumstances” as negotiated with the instructor before the
end of the term. See Student Handbook for policies regarding Withdrawals and grade record permanence.

Late Work
All PAs and quizzes are due on the date noted in the Class Schedule. PAs turned in late will lose 10%
for each weekday they are late. No late PAs will be accepted two weeks after the deadline.

Advance Assistance Students wishing feedback (comments, no grade) from the instructor regarding initial
drafts of papers/presentations are invited to schedule such with the instructor sufficiently in advance of due
dates to enable review, discussion, and subsequent refinement (as necessary).

Assignment Options Students interested in proposing other means (different from those outlined above)
of demonstrating their comprehension, inquiry, and skill relative to the purpose(s) of this course may do so
upon the instructor’s discretionary consent. Such students are to submit thorough and well-reasoned
proposals (appropriate to undergraduate-caliber study) insufficient time for both the instructor to review and
accept or modify the proposal and the student to complete it before the end of the term.

Makeup Work
Late work is not permitted for any PAs in this course. No make-ups are available for the midterm or final
examination in this course. No late or make-up work will be accepted for this course without extenuating
circumstances, and convincing reasons demonstrated by the student to the instructor’s satisfaction and
negotiated with the instructor for approval. Late penalties will apply to any such work accepted by the
instructor and are subject to the instructor’s discretion.

Extra Credit Work

No extra credit will be accepted for this course.
CORE 201 DATA STRUCTURES AND ALGORITHMS Page 15
Dr. Samuel Sambasivam Fall 2024

Emergency Procedures
It is highly recommended that you leave the class title and the Woodbury University campus main phone
number (818) 767-0888 with family and/or other contacts you wish to be notified of in case of an emergency.
For online Technical Support: Call 818.252.5295 or email [email protected]

MISCELLANEOUS POLICIES
Withdrawal Policy and Others For policies on Withdrawal and Grade Permanence, Academic Integrity,
and Appeals and Grievance procedures refer to the Undergraduate Catalog and Departmental Student
Handbooks as applicable.

Special Course Policies The instructor may designate certain assignments/projects as teamwork
assignments. If every member of the team does a similar amount of work, every member of the team will
receive the same grade. However, if the instructor perceives that there is an inequality of workload, then
individual team members may receive more points, or fewer points, than other members. The decision to
adjust the point distribution within a team is reserved for the instructor's discretion.

University Policies
All university and departmental policies affecting student work, appeals, and grievances, as outlined in
the Undergraduate Catalog and/or Department Handbook will apply, unless otherwise indicated in this
syllabus.

Academic Honesty
Because the integrity of the academic enterprise of any institution of higher education requires honesty in
scholarship and research, academic honesty is required at Woodbury University. Academic integrity is
important for two reasons: first, independent and original scholarship ensures that students and scholars
derive the most from their educational experience and the pursuit of knowledge. Second, academic
dishonesty violates the most fundamental values of a community of scholars and depreciates the
achievements of the entire University community. Accordingly, Woodbury University views academic
dishonesty as one of the most serious offenses that a member of our community can commit. Adherence
to the Academic Honesty Policy reflects the commitment of our community to the ideals of learning,
research, and scholarship. See Catalog for the entire Academic Honesty Policy.

Accommodations for students with identified

disabilities
Woodbury University is committed to making reasonable accommodations to assist students with disabilities in
reaching their full academic potential. To that end, your instructor will comply with official requests for
accommodations. Please follow the instructions found on this Accommodations and Documentation page so
that your instructor will be provided the appropriate instructions for your accommodations.

Communication between university faculty or staff and

student
CORE 201 DATA STRUCTURES AND ALGORITHMS Page 16
Dr. Samuel Sambasivam Fall 2024

Students should use their official woodbury.edu email account. Due to confidentiality and FERPA
requirements, all faculty, staff, and students, when corresponding through email, must use their university-
provided Woodbury.edu email accounts. Students are encouraged to check this email address regularly as it
is the only email address in which they will receive official course or university information.

Recording Lectures
Students who have a documented accommodation may use their cell phones to record lectures. Students
who have been approved by ODAS to record lectures must have their instructor sign off on this request and
must turn off their recording device when directed by the class instructor.

Strongly recommended: Instructors should record their synchronous lessons, post the link to the recording in
Moodle in the corresponding block (Week or Topic), and let students know you will be doing this and where
they will find the link. This will help all students review the material covered in class, and can serve our
Students with Disabilities (The university is considering the purchase of closed-captioning software at this
time). This not only helps all students review and retain the material covered in class in a more meaningful
way, but it is particularly beneficial for students with diagnosed disabilities who benefit from encoding
information in multiple modalities, especially during remote learning.

Protecting Privacy and Data During Remote Instruction

This class is being conducted over Ring Central and Moodle. As the host, the instructor may be recording the
sessions. The recording feature for others is disabled so that no one else will be able to record the sessions.
No recording by other means is permitted. The sessions will be posted on the Moodle class website unless
otherwise notified. In case of privacy concerns and individual students wanting not to appear in the recording,
the student must contact the Office of Student Affairs and apply for an exemption. Students must complete an
Accommodations Request Form, which can be downloaded from http://go.woodbury.edu, and found under
“Academic Resources.” Accommodations cannot be granted before the instructor’s receipt of a Notification of
Academic Accommodation Plan (NAAP) from the Disabilities Coordinator. Accommodations are never provided
retroactively. If the student prefers to use a pseudonym instead of the real name, please let the instructor know
what name will be used so that the instructor knows who the student is during the session.

Webcam Usage
The policy on webcam usage is that instructors may ask students to use devices that have video cameras and
microphones and to have their video cameras on during class meetings. Instructors will need to be sensitive to
students’ needs.

Some AI
In this course, I encourage you to use artificial intelligence (AI)-powered programs such as ChatGPT or DALL-
E to help you with some assignments. When you use these tools, it is your responsibility to make sure you are
clearly communicating AI involvement in your work. Please use the appropriate APA format for citing AI in
your assignments.
CORE 201 DATA STRUCTURES AND ALGORITHMS Page 17
Dr. Samuel Sambasivam Fall 2024

Downloads
https://www.python.org/downloads/

Bibliography
These are additional resources and NOT required reading for this course. Some of
these books may have been superseded by later editions.

• Thomas Cormen, Charles Leiserson, Ronald Rivest, Clifford Stein,

Introduction to Algorithms (includes CD), Hardcover.
• Knuth, Donald E., The Art of Computer Programming, Volumes 1-3 Boxed Set,
3rd Edition, Hardcover.
• Okasaki, Chris, Purely Functional Data Structures, Paperback.
• Weiss, M. A. (2006). Data Structures and Algorithm Analysis in C++. 3rd
edition. Boston: Addison Wesley. 586. ISBN: 032144146X.
• Drozdek, A. (2004). Data Structures and Algorithms in C++. 3rd ed. Boston:
Course Technology. 776. ISBN-10: 0534491820.
• Nyhoff, L. R. (2004). ADTs, Data Structures, and Problem Solving with C+. 2nd
edition. New Jersey: Prentice-Hall. 1072.
ISBN: 0131409093.
• Main, M. & Savitch, W. (2004). Data Structures and Other Objects Using C++.
3rd edition. Boston: Addison Wesley. 900.
ISBN-10: 032119716X.
• Keogh, J. & Davidson, K. (2004). Data Structures Demystified. New York:
McGraw Hill. 300. ISBN-10: 0072253592.
• Kingston, J. (1998) Algorithms and Data Structures: Design, Correctness,
Analysis. 2nd edition. Addison-Wesley. 390. ISBN 0201403749.
• Shaffer, C. (1997). Practical Introduction to Data Structures and Algorithm
Analysis. Prentice-Hall. 494. ISBN 0131907522.
• Ammeraal, L. (1996). Algorithms and Data Structures in C++. John Wiley. 350.
ISBN 0471963550.
• Brassard, G. & Paul, B. (1996). Fundamentals of Algorithmics. Prentice-Hall.
525. ISBN 0133350681.
• Ford, W. & William, T. (1996). Data Structures with C++. Prentice-Hall. 950.
ISBN 0024209716.
• Yedidyah, L., Augenstein, M., & Tenenbaum, A. (1996). Data Structures Using
C and C++. 2nd edition. Prentice Hall. 670. ISBN 0130369977.
• Rowe, G. (1996). Introduction to Data Structures and Algorithms with C++.
Prentice-Hall. 384. ISBN 0135791782.
• Flamig, B. (1995). Practical Algorithms in C++ (w/disk), John Wiley. 448. ISBN
0471009555.
• Wilt, N. (1995). Classical Algorithms in C++ (w/disk). John Wiley. 352. ISBN
0471109851.

Reservation of Rights
I reserve the right to change this syllabus, at my sole discretion, at any time, and without prior notice. The
contents of the current Undergraduate Catalog are incorporated herein by reference. In the event of a
CORE 201 DATA STRUCTURES AND ALGORITHMS Page 18
Dr. Samuel Sambasivam Fall 2024

conflict between this syllabus and the Undergraduate Catalog, the Undergraduate Catalog shall have
precedence.