Lecture-1-6pp - Contact Information COEN 352 Data...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
1 COEN 352 Data Structures and Algorithms Introduction Contact Information Lecturer: Bo Zhu, Ph.D. Office : S-EV 7.639 Telephone : 514-848-2424 Ext.2418 2 Email : zhubo@ciise.concordia.ca ± Please include “COEN 352" in your subject line Office hours : Tuesdays, 13:00-15:00 or appointments by email COEN 352 -- Introduction Timetable Lec H -T-J— 08:45-10:00 SGW FG- B070 BO ZHU 3 Tut HA -T—– 10:15-11:05 SGW MB- S2.455 Elias Bou Harb Tut HB -T—– 10:15-11:05 SGW MB- 3.445 Peipei Shi COEN 352 -- Introduction Objectives Mathematical introduction: ± Mathematical induction ± Program analysis ± Algorithm complexity. 4 Fundamental data structures ± Lists ± Stacks ± Queues ± Trees ± Graphs COEN 352 -- Introduction Objectives (cont.) Fundamental algorithms: ± Hashing ± Sorting ± Graph algorithms 5 Overview of algorithm design techniques including ± Greedy algorithms ± Divide and conquer strategies ± Recursive and backtracking algorithms ± Heuristics COEN 352 -- Introduction
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 10/29/2009 for the course ENCS coen352 taught by Professor Zhubo during the Spring '09 term at Concordia Canada.

Page1 / 2

Lecture-1-6pp - Contact Information COEN 352 Data...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online