Scribd
Upload
13 views

00 Intro

This document provides information about the COMP 2119A Introduction to Data Structures and Algorithms course. It lists the instructor and TAs, zoom meeting times, reading materials, grading policy, a warning about plagiarism, tentative schedule, and course learning outcomes. The course covers topics like algorithm analysis, abstract data types, hashing, searching trees, sorting, and outcome-based learning.

Uploaded by

runny
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
13 views

00 Intro

This document provides information about the COMP 2119A Introduction to Data Structures and Algorithms course. It lists the instructor and TAs, zoom meeting times, reading materials, grading policy, a warning about plagiarism, tentative schedule, and course learning outcomes. The course covers topics like algorithm analysis, abstract data types, hashing, searching trees, sorting, and outcome-based learning.

Uploaded by

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

COMP 2119A

Introduction to Data Structures and


Algorithms

1
Course Information
w Instructor:
n Dr. Hubert Chan ([email protected])
w TAs:
n Ting Wen ([email protected])
n Yajing Zhi ([email protected])

n Hao Xie ([email protected])

w Zoom Meetings (online consultation/group exercises):


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

w Extra TA Consultation hours:


n Arrange by email

2
Reading Materials (Optional)

w Main Textbook: “Introduction to Algorithms”


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

3
Grading

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


w 3 written assignments (15%)
(25%)
w 2 programming assignment (10%)
w 2 Quizzes (15%)
n All tentative dates are on the class homepage
w Final examination (60%)
w (Strict) late policy: ´ 50% (1 day); 0% after 24 hours.

4
A warning!

w 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.
w 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
Tentative Schedule
Week # Subject(s) Chapter(s)
1 Course information, introduction, 1,4
overview, recursion
2-3 Simple algorithm analysis, running 1,2,3
time calculation, big O notation
4 Simple abstract data types: lists, 10, 22
stacks, queues, matrices, graphs
5 Hashing 11
6 Tree ADT, Simple searching B
techniques
8 Quiz 1
9 Binary Search Tree 12
10 Balanced Tree
11-12 Sorting 6,7,8
Quiz 2
Outcome-based Learning (OBL)

w A process to improve the teaching and


learning experience.
w A set of well-defined course outcomes –
what we expect you to achieve.
w A feedback mechanism – through
assignments/tests we evaluate how well we
achieve the outcomes.
w It helps us to refine the course.
8
Outcome-based Learning (OBL)

w [O1] Mathematics foundation


n able to understand the concepts of time/space
complexity and to analyze the time/space
complexities of algorithms and data structures.
w [O2] Basic data structures
n able to understand basic data structures such as
stack, queue, tree and graph and to apply related
algorithms to solve problems.

9
Outcome-based Learning (OBL)

w [O3] Problem solving


n able to design new data structures and algorithms
to solve problems.
w [O4] Implementation
n able to implement selected data structures and
algorithms.

10

You might also like