Download intro (2)

COMP171
Data Structures and Algorithms
Spring 2009
Slide 2
Lectures


Instructor: Long QUAN
Lectures:




L2: Wed & Friday 3h-4h20pm
L3: Mon & Wed 9h-10h20
Web site: http://www.cse.ust.hk/comp171/Spring09/index.html
or
www.cs.ust.hk/~quan
 Lecture notes and tutorial material
 Assignments, test cases and solutions
 Download course material before class
Tutorials:
 2A (Tues, 1430-1620)
 2B (Thur, 1000-1150
 2C (Thur, 1800 1950)
 3A (Fri, 1800-1950)
 3B (Wed 1800-1950)
 3C (Thur 1300-1450)
Slide 3
Textbook
 Data
Structures and Algorithm Analysis in
C++, Mark Allen Weiss
- Latest version = 3rd Edition
- Source codes are available online
- Available at library for 2-hour loan
Slide 4
Grading Scheme
 Grading




is based on
Written Assignments (2*5%=10%)
Programming Assignments (3*10%=30%)
Midterm Examination (25%)
Final Examination (35%)
Slide 5
Plagiarism Policy
 1st
Time: both get 0
 2nd Time: need to terminate
 Midterm or Final: an automatic FAIL
You are encouraged to collaborate in study groups.
But, you cannot copy or slightly change other students’
solutions or codes.
The detection of plagiarism is computerized!
Slide 6
Course Overview
 A fundamental
computer science course
- Essential for programming
- Essential for advanced courses, e.g. 271
 A challenging course, which needs
- Mathematical and logic thinking
- Programming
 104,151,171 will be revamped, so it’s last 171!
Slide 7
Course Prerequisite

COMP103 or COMP104






COMP151



Not essential
Highly recommended to be taken concurrently
Basic mathematical skills


Need to know C and C++
Visual Studio or other PC programming environment
Good programming skills
Translate pseudo-codes into codes
Speedy review in the 1st week
Solving recursive equations, manipulation of symbols, etc.
Computer architecture

Pointers, storage, memory access, etc.
Slide 8
Course Outline



C++ review
Lists, stacks, and queues
Algorithmic asymptotic analysis


Sorting



Big-Oh, big-Theta, and big-Gamma
Insertion, radix, mergesort, quicksort, heapsort, etc.
Lowest bound on sorting
Search trees


Binary search tree
AVL tree
 B+ tree

Graphs



Breadth-first search
Depth-first search
Hashing
8
Slide 9
Overall Goal of the Course
 From
programmer to architect
 Learn to solve problems
 Algorithms and Programming go hand in hand
 Learn to analyze your solutions
Slide 10
Lecture Format

Lectures:

Slides are available before class
Print in ‘graylevel’ as ‘handouts’!!!
Constantly updated, only minorly!!!



Tutorials




It is important to attend the lectures (because not all material
and concepts are covered in slides)
If you miss any lectures, learn from your friends
Supplement the lectures
Some important exercises
Welcome to attend other tutorials if you miss the your signed
session
Programming and homework assignments

More rigorous problems to consolidate your knowledge
Slide 11
Assignments

Written assignments





Due by time specified
Contact TAs directly for re-grades
Re-grade requests will only be entertained within 1 week after
the homework are handed back
Late policy: 20% reduction, allows only one day late.
Programming assignments





Due by time specified
Run on PC
Submit it using CASS
Re-grade policy will be announced
Late policy : 20% reduction, allows only one day late.
Slide 12
Midterm and Final Examinations
 Midterm:
TBA
 Final: TBA
 Closed-book, closed-notes
 No make-ups will be given


Unless under very unusual circumstances, with
letters of proof
Instructor informed beforehand