JCU Logo
JOHN CABOT UNIVERSITY

COURSE CODE: "CS 330"
COURSE NAME: "Algorithms and Data Structures"
SEMESTER & YEAR: Spring 2026
SYLLABUS

INSTRUCTOR: Henry Foerster
EMAIL: [email protected]
 HOURS: MW 4:30 PM 5:45 PM
TOTAL NO. OF CONTACT HOURS: 45
CREDITS: 3
PREREQUISITES: Prerequisites: One previous course in Computer Science
OFFICE HOURS: by appointment
COURSE DESCRIPTION:
This course covers the main principles of algorithm design, introducing fundamental data structures and basic algorithmic techniques. It also discusses how to perform an analysis of algorithms, to establish their correctness and evaluate their efficiency. The emphasis is on choosing appropriate data structures and designing correct and efficient algorithms to operate on them, following standard algorithmic techniques. Principles of complexity theory and challenges arising in modern application domains are also investigated.
SUMMARY OF COURSE CONTENT:

This course will introduce the basic principles and techniques for the design, analysis, and implementation of efficient algorithms and data representations.

It will first define the concept of algorithm and discuss the differences between decision and optimization algorithms. It will then introduce the asymptotic notation for analyzing the efficiency of algorithms and formal methods for establishing their correctness.

The core of the course will then be a discussion of several algorithmic techniques, including greedy algorithms, dynamic programming, recursion, and divide-and-conquer methods, with examples of applications to combinatorial structures, such as numbers, sets, and graphs. Data structures supporting these techniques will be considered, including arrays, stacks, queues, search data structures and hash tables. The course will be concluded with an introduction to complexity theory and the notion of the hardness of problems, and with a brief analysis of the additional challenges posed by Big Data from the algorithmic perspective.
LEARNING OUTCOMES:

Upon successful completion of this course, the student will have:

  • understood the main principles of algorithm design
  • be able to design effective and efficient problem-solving algorithms using various algorithm design paradigms
  • be able to analyze algorithms in terms of efficiency and correctness
  • become familiar with fundamental data structures and their implementation
  • understood the classification of problems based on their complexity and be able to identify computationally difficult problems.
TEXTBOOK:
NONE
REQUIRED RESERVED READING:
NONE

RECOMMENDED RESERVED READING:
Book TitleAuthorPublisherISBN numberLibrary Call NumberComments
Introduction to AlgorithmsThomas H. Cormen, Charles Leiserson, Ronald Rivest, and Clifford SteinMIT Press 978-0-262-04630-5   
GRADING POLICY
-ASSESSMENT METHODS:
AssignmentGuidelinesWeight
Home AssignmentsTwo home assignments on the development and analysis of algorithms.20
In-Class AssignmentsOne in-class assessment at the end of the first half of the course.20
Paper DiscussionAn algorithm from a research paper will be assigned to each student, to be presented and discussed in class in a small group.20
Final ExamVerification of the knowledge acquired by the student in the course.30
Participation and AttendanceAttendance and participation are fundamental, due to the creative and theoretical nature of the topics.10

-ASSESSMENT CRITERIA:
AWork of this quality directly addresses the questions or problems raised. Answers to questions are provided using coherent argumentation displaying an extensive knowledge of relevant information or content and practice in applying formal techniques covered in the class. This type of work demonstrates the ability to critically evaluate concepts and theory and solutions to questions and problems involve novel and original ideas. There is clear evidence of a significant study of the material beyond that required for the course.
BThis is highly competent level of performance and directly addresses the question or problem raised. There is a demonstration of some ability to critically evaluate theory and concepts and relate them to practice. Solutions for questions and problems reflect the student’s own arguments and are not simply a repetition of standard lecture and reference material. The work does not suffer from any major errors or omissions and provides evidence of study beyond the required assignments.
CThis is an acceptable level of performance and provides answers that are clear but limited, reflecting the information offered in the lectures and standard reference material.
DThis level of performances demonstrates that the student lacks a coherent grasp of the material. Important information is omitted and irrelevant points included. In effect, the student has barely done enough to persuade the instructor that s/he should not fail.
FThis work fails to show any knowledge or understanding of the issues raised in the question or problem. Most of the material in the answer is irrelevant.
-ATTENDANCE REQUIREMENTS:

ATTENDANCE REQUIREMENTS AND EXAMINATION POLICY

Attendance is to be considered mandatory and will be part of the final grade. Students will be granted 3 absences without penalty. Any other absences will only be excused with permission from the Dean's Office. Otherwise, they will affect the portion of the grade determined by attendance and participation.

You cannot make-up a major assessment without the permission of the Dean’s Office. Students who will be absent from a major assessment must notify the Dean’s Office prior to that assessment. Absences from class due to the observance of a religious holiday will normally be excused. Individual students who will have to miss class to observe a religious holiday should notify the instructor by the end of the Add/Drop period to make prior arrangements for making up any work that will be missed.
ACADEMIC HONESTY
As stated in the university catalog, any student who commits an act of academic dishonesty will receive a failing grade on the work in which the dishonesty occurred. In addition, acts of academic dishonesty, irrespective of the weight of the assignment, may result in the student receiving a failing grade in the course. Instances of academic dishonesty will be reported to the Dean of Academic Affairs. A student who is reported twice for academic dishonesty is subject to summary dismissal from the University. In such a case, the Academic Council will then make a recommendation to the President, who will make the final decision.
STUDENTS WITH LEARNING OR OTHER DISABILITIES
John Cabot University does not discriminate on the basis of disability or handicap. Students with approved accommodations must inform their professors at the beginning of the term. Please see the website for the complete policy.
SCHEDULE