Algoma University

Department of Computer Science and Technology

COSC 2007001/002
Data Structure II
Fall 2025
Weekly 3 hrs
Instructor Information
Instructor: Dr. Dipak Pudasaini
Office Phone: 905-451-0100
Office Hours: By appointment
E-mail: [email protected]

Course Information
Course Calendar Description:
Continuation of the study of data structures and the analysis of algorithms, trees, binary search trees,
balanced trees, B-trees. Recursive programming techniques, elimination of recursion. Applications.
Course Prerequisites: COSC 2006: Data Structure I
General Description:
This is an advanced course of data structure. Students will continue from Data Structure I (COSC 2006) to the
advanced concept of Data Structure. It helps to process, manage and store data in efficient ways. It is mainly
focused on non-linear data structure. Students will learn about the more concept of Abstract Data Type (ADT)
and their implementation in terms of non-linear data structure. Students will learn about advanced concept of
data structures and algorithms such as trees, graphs etc. The main topics covered are:
• Efficiency of algorithm and recursion
• searching
• Dictionaries and hashing
• Heap
• Trees
• Graph

Learning Outcomes:
By the end of this course, students will be able to:
• Analyze and evaluate the efficiency of algorithms using Big Oh notation.
• Implement and apply recursive programming techniques to solve complex problems like the Towers of
Hanoi and n-queens problem.
• Implement and evaluate the efficiency of the Abstract Data Type (ADT) Dictionary by using either an
array or a chain of linked nodes.
• Understand and implement hashing and collision resolution techniques to optimize search operations.
 • Design and manipulate various data structures such as binary trees, binary search trees, heaps, and
balanced trees.
• Apply and evaluate graph algorithms for traversals, shortest paths, and topological ordering.

Learning Objectives
This course aims to:

• Develop problem-solving skills through recursive programming and algorithmic analysis.

• Introduce students to advanced data structures such as dictionaries, binary trees, balanced trees, and
graphs.
• Provide hands-on experience in implementing searching, dictionary, tree, and graph based data
structures with real-world applications.
• Equip students to analyze, compare, and improve the efficiency of algorithms and data structure
implementations.

Required Textbook(s):
Frank M. Carrano and Timothy M. Henry, Data Structures and Abstractions with JAVA, 5th Edition, Pearson,
2018, ISBN 10: 0-13-483169-1, ISBN 13: 978-0-13-483169-5.

Reference book(s):
Janet J. Prichard and Frank M. Carrano, Data Abstraction and Problem Solving with Java, 3nd Edition, Addison
Wesley, 2010 (paperback), ISBN-10: 0132122308, ISBN-13: 9780132122306.

Michael T. Goodrich and Richiroberto Tamassia, Algorithm Design: Foundations, Analysis, and Internet
Examples, First Edition, Wiley, 2001 (paperback), ISBN-10: 0471383651, ISBN-13: 978-0471383659 (latest
edition is fine).

These materials are available from the Algoma University Bookstore. Pricing for all materials can be found by
visiting https://www.bkstr.com/algomastore/shop/textbooks-and-course-materials.

Evaluation
Class Participation…………………………………………..….5%

Labs ………………………………………............................20%

Assignments (4 x 3.75%)……….…………………………..15%

Quizzes (2 x5%)………………………………………….. ….…10%

Midterm Exam….......……………………………….………….15%

Final Exam...……………………………………………..……….. 35%

Tentative Schedule and weekly plan:

The following table contains a week-by-week breakdown of what will be covered in the lectures. Note that the
order of topics and some details may be different.
Week Date Contents Chapters from Quizzes Assignment
Textbook Submission
due Date
1 Jan 09 • Introduction 4
• The Efficiency of
Algorithms

2 Jan 14 • Recursion 9, 14
Jan 16 • Problem-solving
with recursion

3 Jan 21 • searching 19
Jan 23

4 Jan 28 • Dictionaries 20, 21 Jan 30: First Assignment1

Jan 30 • Dictionary
implementation

5 Feb 04 • Introduction to 22, 23

Fab 06 hashing
• Hashing
implementation

6 Feb 11 • Trees 24
Fab 13

7 Feb 25 • Trees Fab 25: Mid- Assignment2

Feb 27 Implementation Term
Feb 27: 25

8 March • Binary Search Tree 26

04 implementation
March
06

9 March • Heap 27 Assignment3

11 implementation
 March
13

10 March • Balanced search 28 March 20:

18 trees Second
March
20

11 March • Graphs 29 Assignment4

25
March
27

12 April 01 • Graphs 30
April 03 implementation

13 April 08 Revision

Evaluation Practices:
• All assignments and tests must be completed as individual efforts unless stated otherwise in writing in the
instructions. Please refer to the Algoma University Policy, https://algomau.ca/policies-and-procedures/
• Assignment submissions: Due dates and specific instructions for submission of assignments are found in
Moodle. All online submissions will be done using Moodle, email submissions will not be accepted. Late
assignments will be graded as 0.
• All tests and assignments must be completed at the date & time scheduled by the professor. Makeup
tests/exams will only be provided to students who have an acceptable explanation for their absence and
who provide acceptable documentation, such as a doctor’s note, emergency documents, etc. Valid requests
for makeup evaluations, including documentation, must be submitted to the professor before the date of
the test or assignment submission due date.
The Final Examination Policy can be found at:
http://algomau.ca/media/styleassets/pdf/final_examination_policy.pdf

• Students who enroll late or miss classes for any other reason are responsible for all missed materials.
Students who miss classes with valid reasons can ask the professor to clear the concepts. A professor/TA
will help for those students.
• All students are expected to read evaluation feedback for marked assignments, tests or other items.
Feedback will be posted on Moodle. I highly recommend improving the assessments based on the feedback
of the marked assessments.

Other Policies:
Academic Dishonesty:
The University takes a very serious view of such offences as plagiarism, cheating, and impersonation. Penalties
for dealing with such offences will be strictly enforced.

The following web site contains a complete policy statement on academic dishonesty and attendance. Students
are encouraged to read this policy for further clarification of these issues:
http://algomau.ca/media/styleassets/pdf/disciplinary_regulations_on_academic_dishonesty.pdf

Electronic Device Policy:

Students only allow to use electronic devices for learning purposes related to the course.

Attendance Policy:
The general regulations of the University require punctual and regular attendance at the various academic
exercises. If there are extenuating circumstances related to an absence, the instructor should be notified.
Absences in excess of 20% may jeopardize receipt of credit for the course.

Disability Accommodation:
If you are a student with a physical, learning, and/or psychological disability and plan to request any academic
accommodations for this class, you are required to bring in an authorization letter from Disability Services listing
the permitted accommodations. I will work with you to arrange your accommodations from the point in time
that you deliver and discuss such an authorization letter with me. The Coordinator of Disability Services will
keep your disability documentation confidential. Contact information is as follows: Coordinator of Disability
Services 705-949-2301 ext. 4221; [email protected]

Plagiarism / Cheating:
Any attempt at copying or cheating on an assignment, quiz, or exam will result in a grade of zero for that
particular assessment and will be marked in your student record for the first offense. Repeat offenses will result
in a 0 grade in the course. Please read the material on Academic Integrity from the Algoma University Website.

Communication:
Send all email communication through the Algoma University email. Other email communication will not be
replied.

Extra help:
For extra help, you can email me to arrange a time for the meeting.