|
|
Data Structures and
Algorithms I
Professor: Dr. Delaram Kahrobaei [dkahrobaei@citytech.cuny.edu] Place: Namm 723 Time: Fall Semester 2008 Tuesdays, Thursdays 2:15-3:55
p.m. Office(N707) Hours: Tuesdays,
Thursday 10:30-11:30 a.m. or by appointment! |
|
||
|
L1: Th 8/28/08 |
P. 16: 2, 3, 5 , 7, 10, 19, 23 - 27, 33,
38 |
|||
|
L2: Tu 9/2/08 |
P. 28: 3, 4, 6, 9 |
|||
|
L3: Th 9/4/08 |
P. 46: 1, 3, 4, 7 – 13 odd, 19, 30, 36 P.
58: 10, 31, 33 |
|||
|
L4: Tu 9/9/08 |
P.
74: 19, 20, 35 |
|||
|
L5: Th 9/11/08 |
Introduction to proof |
P. 85: 1 – 4, 9 – 1217 ,18, 35 |
||
|
L6: Tu 9/16/08 |
Logic with MATLAB Project due |
|||
|
L7: Th 9/18/08 |
Exam
I |
|||
|
L8: Tu 9/23/08 |
P. 119: 9 (not(d)), 17 (a)& (b),23,
25, 27, 29 P.
130: 3, 15 (b), 17 (b), 21 - 23, 26, 44, 45, 47 (written assignment), 50 -
53, 55 |
|||
|
L9: Th 9/25/08 |
P.
146: 3, 8, 10 – 12 all, 15, 17 (written assignment), 19, 20, 26, 29, 35, 38 -
40, 54 – 57 |
|||
|
L10:
Th 10/2/08 |
P. 160: 3, 9, 13*, 14, 15, 17, 19 – 23
all, 27, 31 |
|||
|
L11:
Tu 10/7/08 |
Set theory wit MATLAB Project Due |
|||
|
L12:
Th 10/16/08 |
P. 178: 34, 35, 36, 37*, 38 – 41 all,
42*, 43*, 47, 48, 50, 52, 53, 57 (written assignment) |
|||
|
L13:
Tu 10/21/08 |
P.
208: 1117, 19, 26, 27, 28, 30*, 31, 32 |
|||
|
L14:
Th 10/23/08 |
Review
|
MATLAB Projects due(Programming
and Cryptography) |
||
|
L15:
Tu 10/28/08 |
Mid-semester Examination
|
|||
|
L16:
Th 10/30/08 |
P.
279: 1, 3 – 12, 15, 21, 25 |
|||
|
L17:
Tu 11/4/08 |
P.
308: 1 – 7 odd, 30, 33 - 35 all, 43, 44, 48*, 51*, 60, 61 |
|||
|
L18:
Th 11/6/08 |
P. 321: 1 – 5 odd, 7*, 8*, 9*, 10*, 1629,
30, 36*, 46, 50, 51, 52* |
|||
|
L19:
Tu 11/11/08 |
P.
217: 3, 12, 21, 24 |
|||
|
L20:
Th 11/13/08 |
P.
229: 1 – 12 all, 19, 21, 23, 32, 33, 45, 51*, 52, 53*, 54 |
|||
|
L21:
Tu 11/18/08 |
P.
229: 1 – 12 all, 19, 21, 23, 32, 33, 45, 51*, 52, 53*, 54 |
|||
|
L22:
Th 11/20/08 |
||||
|
L23:
Tu 11/25/08 |
Exam
III |
|||
|
L24:
Tu 12/2/08 |
P. 595: 3
- 9 all, 31 P. 608: 20, 53, 55, 61, 65, 66 |
|||
|
L25:
Th 12/4/08 |
P. 629: 1 – 5 all |
|||
|
L26:
Tu 12/9/08 |
Applications
of Trees |
P. 693: 1 – 10 all , 17 – 20 all, 21
(written Assignment), 27, 28, 33, 34, 38 – 41 all P. 708: 1- 7 odd, 11, 19, 21, 22, 37 |
||
|
L27:
Th 12/11/08 |
Tree
Transversal |
P.
722: 1, 3, 6, 7, 9, 10, 12, 13, 15, 22 - 24, |
||
|
L28:
Tu 12/16/08 |
Spanning
Trees Minimum
Spanning Tree |
P. 734: 2 – 6, 13 – 15, 16, 29, 30, 32 P.
742: 1, 2, 3, 6, 7 |
||
|
L29:
Th 12/18/08 |
||||
|
L30:
Tu 12/23/08 |
Final |
|||
|
|
|
|||
|
Text
Book |
Discrete
Mathematics and its Applications 6th edition,
By Kenneth H. Rosen, McGraw-Hill |
|||
|
|
|
|||
|
Links |
Blackboard
(We will be using Blackboard for mainly Communication, Discussion Board, etc) General Advice on Writing Project |
|||
|
Writing Fellow: [Jeremy Gwiazda] Office hours:
Tuesdays from 11am to 1pm in Midway 307 |
||||
|
|
|
|||
|
Acknowledgement: The Instructor
acknowledges the materials she used from McGraw-Hill and the use of City Tech
Math Department Syllabi materials, particularly it has been designed by Prof.
Taraporevala. |
||||
|
© 2008 |
Address: Mathematics
Department, |
|||
