New York University Tandon School of Engineering

Department of Computer Science and Engineering

Course Outline CS-UY 1134
Data Structures and Algorithms
Spring 2023
Professors Itay Tal and Peter DePasquale

Section Class # / Days Times Location

ALEC 16118 - Mon. / Wed. 9:30 AM - 10:50 PM Dibner Hall, Room LC400

BLEC 16119 - Mon. / Wed. 11:00 AM - 12:20 PM Jacobs Hall, Room 475

CLEC 16120 - Mon. / Wed. 3:30 PM - 4:50 PM Jacobs Hall, Room 474

DLEC 16246 - Mon. / Wed. 5:00 PM - 6:20 PM Rogers Hall, Room 315

LB1 16123 - Fridays 8:00 AM - 10:50 AM Rogers Hall, Room 201

LB2 16271 - Fridays 8:00 AM - 10:50 AM Rogers Hall, Room 205

LB3 16124 - Fridays 11:00 AM - 1:50 PM Rogers Hall, Room 325

LB4 16125 - Fridays 11:00 AM - 1:50 PM Rogers Hall, Room 204

LB5 16128 - Fridays 11:00 AM - 1:50 PM Rogers Hall, Room 205

LB6 16126 - Fridays 11:00 AM - 1:50 PM Rogers Hall, Room 201

LB7 16127 - Fridays 2:00 PM - 4:50 PM Rogers Hall, Room 211

LB8 16764 - Fridays 2:00 PM - 4:50 PM Rogers Hall, Room 203

LB9 21861 - Fridays 2:00 PM - 4:50 PM Rogers Hall, Room 205

To contact the professor:

Email address Office

Tal itay.tal@nyu.edu 370 Jay Street, Room 865

DePasquale peter.depasquale@nyu.edu 370 Jay Street, Room 841

Office hours:
Office Hours

Tal By appointment

DePasquale Mondays: 1pm - 3:30pm (in-person and via Zoom)

Tuesdays: 10am - 12:30pm (via Zoom, except exam days: 3/7 & 4/18)

1
 Wednesdays: 1pm - 1:45pm (in-person and via Zoom)
To participate in my office hours (in-person or via Zoom), please book a 30 minute
appointment via my scheduling system. A 24-hour advance notice is kindly
requested to ensure I'm in my office or in front of my computer for Zoom meetings.

If these times do not work with your schedule, please email me and suggest times
you are available to meet and I will check my schedule and get back to you on an
agreeable time.

Course Prerequisites CS-UY 1114 or CS-UY 1123 with a C- grade or better

Course Co-requisites EX-UY 1 (Common Examination Hour)

Course Anti-requisites None

Course Description This course covers abstract data types and the implementation and
use of standard data structures along with fundamental algorithms and the basics of
algorithm analysis.

In addition to the lectures, you must be registered for one of the mandatory lab sections
that correspond to your lecture.

Course Objectives - At the completion of this course a student will:

● Be familiar with basic techniques of algorithm analysis
● Be able to design and analyze recursive algorithms
● Be familiar with fundamental data structures, their implementation and
performance: dynamic arrays, stacks and queues
● Master the implementation of linked data structures such as linked lists and
binary trees
● Be familiar with advanced data structures such as search trees, hash tables,
priority queues and graphs
● Have a practical understanding of the concepts of data abstraction
● Be familiar with several searching and sorting algorithms including insertion-sort,
merge-sort and heap-sort

Course Structure
Most of the material will be presented in lectures. Reading assignments from the
textbook, programming and other exercises in the lab, and weekly homework
assignments will reinforce this material. You should expect to spend a substantial time
outside the class working on the homework assignments.

Assignments and other important announcements will be posted on NYU Brightspace.

You should check the course page every day and sign up for email notification of
announcements.

2
Readings
The textbook for the course is: Data Structures and Algorithms in Python ,1st Edition,
Michael T. Goodrich, Roberto Tamassia, Michael H. Goldwasser. ISBN-13:
978-1118290279. ISBN-10: 1118290275.

There is also an electronic version of the textbook, which is less expensive. Copies are
available in the NYU bookstore, as well as other book vendors. Several copies are on
reserve in the Dibner Library.

Course requirements
Tests: There will be a midterm exam and a final exam. These exams will include some
short answer and/or multiple choice questions, as well as programming problems.

Homework assignments: Will reinforce the material covered in the lectures and in the
textbook. Although these count for a relatively small percentage of your grade, it is
essential that you do them and understand the solutions. It is unlikely that you will do
well on the exams if you do not understand how to solve problems like the homework
exercises.

Labs: You are expected to come on time to all labs, complete the required work, and
help others if you finish early. Your lab grade will mostly reflect the effort you made to
solve the problems during the lab time.

Grading
Grades will be computed roughly as follows (we may tweak the formula a little):

Final Grade = 30% Exam with highest grade +

20% Exam with second highest grade +
20% Exam with lowest grade +
20% Homework +
10% Lab grade

Course Topics
● Python review and additional topics (Chapters 1-2)
● Asymptotic analysis (Chapter 3)
● Recursion (Chapter 4)
● Dynamic Arrays and Amortization (Chapter 5)
● Stacks and Queues (Chapter 6)
● Linked lists (Chapter 7)
● Binary Trees (Chapter 8)
● Search trees (Chapter 11)
● Hash tables (Chapter 10)
● Priority queues (Chapter 9)
● Sorting and selection (Chapter 12)

3
 ● Graph algorithms (Chapter 14)

Important Dates
● Mon. 1/23: Spring 2023 Classes Begin
● Sun. 2/5: Add/Drop Deadline
● Mon 2/20: President's Day, No Class
● Tue 3/7: Midterm 1
● Mon 3/13 - Fri 3/17: Spring Break, No Class
● Tue 4/18: Midterm 2
● Mon 5/8: Last Day of Spring 2023 Classes
● Tue 5/9: Reading Day
● Wed 5/10 - Tue 5/16: Final Exams

The final exam could be any time during the specified period. Do not buy plane tickets
or make any other travel arrangements that involve leaving before 5/16!!!

Moses Center Statement of Disability

If you are a student with a disability who is requesting accommodations, please contact
New York University’s Moses Center for Students with Disabilities (CSD) at
212-998-4980 or mosescsd@nyu.edu. You must be registered with CSD to receive
accommodations. Information about the Moses Center can be found at
www.nyu.edu/csd. The Moses Center is located at 726 Broadway on the 3rd floor.

NYU School of Engineering Policies and Procedures on Academic Misconduct –

complete Student Code of Conduct here.
A. Introduction: The School of Engineering encourages academic excellence in
an environment that promotes honesty, integrity, and fairness, and students at
the School of Engineering are expected to exhibit those qualities in their
academic work. It is through the process of submitting their own work and
receiving honest feedback on that work that students may progress
academically. Any act of academic dishonesty is seen as an attack upon the
School and will not be tolerated. Furthermore, those who breach the School’s
rules on academic integrity will be sanctioned under this Policy. Students are
responsible for familiarizing themselves with the School’s Policy on Academic
Misconduct.

B. Definition: Academic dishonesty may include misrepresentation, deception,

dishonesty, or any act of falsification committed by a student to influence a
grade or other academic evaluation. Academic dishonesty also includes
intentionally damaging the academic work of others or assisting other
students in acts of dishonesty. Common examples of academically dishonest
behavior include, but are not limited to, the following:

1. Cheating: intentionally using or attempting to use unauthorized notes,

books, electronic media, or electronic communications in an exam;

4
 talking with fellow students or looking at another person’s work during
an exam; submitting work prepared in advance for an in-class
examination; having someone take an exam for you or taking an exam
for someone else; violating other rules governing the administration of
examinations.
2. Fabrication: including but not limited to, falsifying experimental data
and/or citations.
3. Plagiarism: intentionally or knowingly representing the words or ideas
of another as one’s own in any academic exercise; failure to attribute
direct quotations, paraphrases, or borrowed facts or information.
4. Unauthorized collaboration: working together on work meant to be
done individually.
5. Duplicating work: presenting for grading the same work for more than
one project or in more than one class, unless express and prior
permission has been received from the course instructor(s) or research
adviser involved.
6. Forgery: altering any academic document, including, but not limited to,
academic records, admissions materials, or medical excuses.
NYU School of Engineering Policies and Procedures on Excused Absences –
complete policy here.
A. Introduction: An absence can be excused if you have missed no more than 10
days of school. If an illness or special circumstances cause you to miss
more than two weeks of school, please refer to the section labeled Medical
Leave of Absence.
B. Students may request special accommodations for an absence to be excused
in the following cases:
1. Medical reasons
2. Death in immediate family
3. Personal qualified emergencies (documentation must be provided)
4. Religious expression or practice
The office of the Coordinator of Student Advocacy, Compliance and Student Affairs
handles excused absences. Should it become necessary to obtain an excused
absence, please email eng.studentadvocate@nyu.edu.

NYU School of Engineering Academic Calendar – complete list here.

The last day of our semester will be Monday, May 8th, 2023. Please pay attention to
notable dates such as Add/Drop, Withdrawal, etc. For confirmation of dates or further
information, please contact Susana: sgarcia@nyu.edu