Scribd
Upload
20 views

00 Intro

This document provides information about the COMP 2119A Introduction to Data Structures and Algorithms course. It outlines the instructor and TAs, meeting times, reading materials, grading policy, topics to be covered, and learning outcomes. The course focuses on basic techniques like recursion and algorithm analysis, basic data structures like lists and trees, and advanced data structures and algorithms like sorting and binary search trees. Students will be evaluated based on assignments, a quiz, and a final exam.

Uploaded by

chegg chegg
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
20 views

00 Intro

This document provides information about the COMP 2119A Introduction to Data Structures and Algorithms course. It outlines the instructor and TAs, meeting times, reading materials, grading policy, topics to be covered, and learning outcomes. The course focuses on basic techniques like recursion and algorithm analysis, basic data structures like lists and trees, and advanced data structures and algorithms like sorting and binary search trees. Students will be evaluated based on assignments, a quiz, and a final exam.

Uploaded by

chegg chegg
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 9

COMP 2119A

Introduction to Data Structures and


Algorithms

1
Course Information
 Instructor:
 Dr. Hubert Chan ([email protected])

 TAs:
 Quan Xue ([email protected])
 Dongchen Li
 Shuxiang Zhang

 Meeting Times (physical lectures, emergency announced on moodle):


 Tuesday (12:30pm – 01:20pm)
 Friday (12:30pm – 02:20pm)

 Instructor Consultation Hours:


Tue (1:30pm – 2:30pm: immediately after class or Zoom)
 Extra Instructor/TA Consultation hours:
 Arrange by email

2
Reading Materials (Optional)

 Main Textbook: “Introduction to Algorithms”


by Leiserson, Cormen, Rivest and Stein, MIT
press.
 Reference: “Data Structures and Algorithm
Analysis”, Mark Allen Weiss, Addison
Wesley.

3
Grading

 Policy is subject to change (but you will be informed)


 3 written, 2 program assignments
 1 in-class quiz (40%)

 Final examination (60%)

 (Strict) late policy:  50% (1 day); 0% after 24 hours.

4
A warning!

 Collaboration in study groups discussing


course materials is encouraged. However,
you should write your own solutions for the
homework assignments. Plagiarism is a
severe misconduct.
 Plagiarism is the action of using or copying
someone else's idea or work and pretending
that you thought of it or created it.

5
ChatGPT Policy

You may treat ChatGPT as discussion with other students.

Warning: ChatGPT may give you wrong answers!


Tentative Topics
Subject(s)
Basic Recursion, simple algorithm analysis,
Techniques running time calculation, big O notation
Basic Data Simple abstract data types: lists, stacks,
Structures queues, hashing
Advanced Tree ADT, searching techniques, binary
Data search tree, balanced search tree
Structures
Algorithm Sorting, lower bounds
Analysis
Outcome-based Learning
(OBL)
 [O1] Mathematics foundation
 able to understand the concepts of time/space
complexity and to analyze the time/space
complexities of algorithms and data structures.
 [O2] Basic data structures
 able to understand basic data structures such as
stack, queue, tree and graph and to apply related
algorithms to solve problems.

8
Outcome-based Learning
(OBL)
 [O3] Problem solving
 able to design new data structures and algorithms
to solve problems.
 [O4] Implementation
 able to implement selected data structures and
algorithms.

You might also like