• 沒有找到結果。

CSIE1212: Data Structures and Algorithms

N/A
N/A
Protected

Academic year: 2022

Share "CSIE1212: Data Structures and Algorithms"

Copied!
87
0
0

加載中.... (立即查看全文)

全文

(1)

CSIE1212: Data Structures and Algorithms

Hsuan-Tien Lin

Dept. of CSIE, NTU

Course Introduction, March 3, 2020

(2)

今天(3/3)不會現場發授權碼

(3)

Three Warnings Before (Signing for) the Course (1/3)

警告: High Expectations

• goal of NTU DSA class:

as good as the best ones in the world

• tentatively, 6 homework sets and final project

(http://www.csie.ntu.edu.tw/~htlin/course/dsa20spring)

• will haveHW1 next week

• writing assignments andtime-consumingprogramming assignments

be prepared towork hard!

(4)

Three Warnings Before (Signing for) the Course (1/3)

警告: High Expectations

• goal of NTU DSA class:

as good as the best ones in the world

• tentatively, 6 homework sets and final project

(http://www.csie.ntu.edu.tw/~htlin/course/dsa20spring)

• will haveHW1 next week

• writing assignments andtime-consumingprogramming assignments

be prepared towork hard!

(5)

Three Warnings Before (Signing for) the Course (1/3)

警告: High Expectations

• goal of NTU DSA class:

as good as the best ones in the world

• tentatively, 6 homework sets and final project

(http://www.csie.ntu.edu.tw/~htlin/course/dsa20spring)

• will haveHW1 next week

• writing assignments andtime-consumingprogramming assignments

be prepared towork hard!

(6)

Three Warnings Before (Signing for) the Course (1/3)

警告: High Expectations

• goal of NTU DSA class:

as good as the best ones in the world

• tentatively, 6 homework sets and final project

(http://www.csie.ntu.edu.tw/~htlin/course/dsa20spring)

• will haveHW1 next week

• writing assignments andtime-consumingprogramming assignments

be prepared towork hard!

(7)

Three Warnings Before (Signing for) the Course (1/3)

警告: High Expectations

• goal of NTU DSA class:

as good as the best ones in the world

• tentatively, 6 homework sets and final project

(http://www.csie.ntu.edu.tw/~htlin/course/dsa20spring)

• will haveHW1 next week

• writing assignments andtime-consumingprogramming assignments

be prepared towork hard!

(8)

Three Warnings Before (Signing for) the Course (2/3)

警告: Strict Instructor

• Will you give me a second chance if I copy homework from other people? No.

• Could you let me pass because I will be kicked out by the 1/2 rule?No.

• Will you change my score from F to C? No. be prepared tofollow the rules!

(9)

Three Warnings Before (Signing for) the Course (2/3)

警告: Strict Instructor

• Will you give me a second chance if I copy homework from other people? No.

• Could you let me pass because I will be kicked out by the 1/2 rule?No.

• Will you change my score from F to C? No. be prepared tofollow the rules!

(10)

Three Warnings Before (Signing for) the Course (2/3)

警告: Strict Instructor

• Will you give me a second chance if I copy homework from other people? No.

• Could you let me pass because I will be kicked out by the 1/2 rule?No.

• Will you change my score from F to C? No.

be prepared tofollow the rules!

(11)

Three Warnings Before (Signing for) the Course (2/3)

警告: Strict Instructor

• Will you give me a second chance if I copy homework from other people? No.

• Could you let me pass because I will be kicked out by the 1/2 rule?No.

• Will you change my score from F to C? No.

be prepared tofollow the rules!

(12)

Three Warnings Before (Signing for) the Course (3/3)

警告: Uncertain Outcome

• sixth-time teaching this course, but first timeafter five years

• ambitious and willing toexperiment

—live screencast teaching, for instance

• How many people will not pass? I don’t know yet.

• Will your investment (time) get good return (knowledge)? No guarantees, but I’ll try my best.

be prepared totake some risks!

(13)

Three Warnings Before (Signing for) the Course (3/3)

警告: Uncertain Outcome

• sixth-time teaching this course, but first timeafter five years

• ambitious and willing toexperiment

—live screencast teaching, for instance

• How many people will not pass? I don’t know yet.

• Will your investment (time) get good return (knowledge)? No guarantees, but I’ll try my best.

be prepared totake some risks!

(14)

Three Warnings Before (Signing for) the Course (3/3)

警告: Uncertain Outcome

• sixth-time teaching this course, but first timeafter five years

• ambitious and willing toexperiment

—live screencast teaching, for instance

• How many people will not pass?

I don’t know yet.

• Will your investment (time) get good return (knowledge)? No guarantees, but I’ll try my best.

be prepared totake some risks!

(15)

Three Warnings Before (Signing for) the Course (3/3)

警告: Uncertain Outcome

• sixth-time teaching this course, but first timeafter five years

• ambitious and willing toexperiment

—live screencast teaching, for instance

• How many people will not pass?

I don’t know yet.

• Will your investment (time) get good return (knowledge)?

No guarantees, but I’ll try my best.

be prepared totake some risks!

(16)

Three Warnings Before (Signing for) the Course (3/3)

警告: Uncertain Outcome

• sixth-time teaching this course, but first timeafter five years

• ambitious and willing toexperiment

—live screencast teaching, for instance

• How many people will not pass?

I don’t know yet.

• Will your investment (time) get good return (knowledge)?

No guarantees, but I’ll try my best.

be prepared totake some risks!

(17)

Wise Words

給資訊系的同學們:努力加油

給想加選的同學們:審慎考慮

(18)

Some Historical Notes

Once upon a time, when I was a freshman in NTU CSIE (1997)...

• 「計程」有兩學期,上學期教C,下學期教C++

• 大二上學期教「資料結構」

• 大二下學期教「演算法」

Then, in my senior year (2001)...

• 「計程」變成一學期,大一下學期教「物件導向程式設計」(Java)

• 大二上學期教「資料結構與演算法上」

• 大二下學期教「資料結構與演算法下」

Then, starting 2010...

• 物件導向程式設計變為選修

• 大一下學期教「資料結構與演算法」

• 大二上學期教「演算法設計與分析」

(19)

Some Historical Notes

Once upon a time, when I was a freshman in NTU CSIE (1997)...

• 「計程」有兩學期,上學期教C,下學期教C++

• 大二上學期教「資料結構」

• 大二下學期教「演算法」

Then, in my senior year (2001)...

• 「計程」變成一學期,大一下學期教「物件導向程式設計」(Java)

• 大二上學期教「資料結構與演算法上」

• 大二下學期教「資料結構與演算法下」

Then, starting 2010...

• 物件導向程式設計變為選修

• 大一下學期教「資料結構與演算法」

• 大二上學期教「演算法設計與分析」

(20)

Some Historical Notes

Once upon a time, when I was a freshman in NTU CSIE (1997)...

• 「計程」有兩學期,上學期教C,下學期教C++

• 大二上學期教「資料結構」

• 大二下學期教「演算法」

Then, in my senior year (2001)...

• 「計程」變成一學期,大一下學期教「物件導向程式設計」(Java)

• 大二上學期教「資料結構與演算法上」

• 大二下學期教「資料結構與演算法下」

Then, starting 2010...

• 物件導向程式設計變為選修

• 大一下學期教「資料結構與演算法」

• 大二上學期教「演算法設計與分析」

(21)

Some Historical Notes

Once upon a time, when I was a freshman in NTU CSIE (1997)...

• 「計程」有兩學期,上學期教C,下學期教C++

• 大二上學期教「資料結構」

• 大二下學期教「演算法」

Then, in my senior year (2001)...

• 「計程」變成一學期,大一下學期教「物件導向程式設計」(Java)

• 大二上學期教「資料結構與演算法上」

• 大二下學期教「資料結構與演算法下」

Then, starting 2010...

• 物件導向程式設計變為選修

• 大一下學期教「資料結構與演算法」

• 大二上學期教「演算法設計與分析」

(22)

Some Historical Notes

Once upon a time, when I was a freshman in NTU CSIE (1997)...

• 「計程」有兩學期,上學期教C,下學期教C++

• 大二上學期教「資料結構」

• 大二下學期教「演算法」

Then, in my senior year (2001)...

• 「計程」變成一學期,大一下學期教「物件導向程式設計」(Java)

• 大二上學期教「資料結構與演算法上」

• 大二下學期教「資料結構與演算法下」

Then, starting 2010...

• 物件導向程式設計變為選修

• 大一下學期教「資料結構與演算法」

• 大二上學期教「演算法設計與分析」

(23)

Some Historical Notes

Once upon a time, when I was a freshman in NTU CSIE (1997)...

• 「計程」有兩學期,上學期教C,下學期教C++

• 大二上學期教「資料結構」

• 大二下學期教「演算法」

Then, in my senior year (2001)...

• 「計程」變成一學期,大一下學期教「物件導向程式設計」(Java)

• 大二上學期教「資料結構與演算法上」

• 大二下學期教「資料結構與演算法下」

Then, starting 2010...

• 物件導向程式設計變為選修

• 大一下學期教「資料結構與演算法」

• 大二上學期教「演算法設計與分析」

(24)

Some Historical Notes

Once upon a time, when I was a freshman in NTU CSIE (1997)...

• 「計程」有兩學期,上學期教C,下學期教C++

• 大二上學期教「資料結構」

• 大二下學期教「演算法」

Then, in my senior year (2001)...

• 「計程」變成一學期,大一下學期教「物件導向程式設計」(Java)

• 大二上學期教「資料結構與演算法上」

• 大二下學期教「資料結構與演算法下」

Then, starting 2010...

• 物件導向程式設計變為選修

• 大一下學期教「資料結構與演算法」

• 大二上學期教「演算法設計與分析」

(25)

Some Historical Notes

Once upon a time, when I was a freshman in NTU CSIE (1997)...

• 「計程」有兩學期,上學期教C,下學期教C++

• 大二上學期教「資料結構」

• 大二下學期教「演算法」

Then, in my senior year (2001)...

• 「計程」變成一學期,大一下學期教「物件導向程式設計」(Java)

• 大二上學期教「資料結構與演算法上」

• 大二下學期教「資料結構與演算法下」

Then, starting 2010...

• 物件導向程式設計變為選修

• 大一下學期教「資料結構與演算法」

• 大二上學期教「演算法設計與分析」

(26)

Some Historical Notes

Once upon a time, when I was a freshman in NTU CSIE (1997)...

• 「計程」有兩學期,上學期教C,下學期教C++

• 大二上學期教「資料結構」

• 大二下學期教「演算法」

Then, in my senior year (2001)...

• 「計程」變成一學期,大一下學期教「物件導向程式設計」(Java)

• 大二上學期教「資料結構與演算法上」

• 大二下學期教「資料結構與演算法下」

Then, starting 2010...

• 物件導向程式設計變為選修

• 大一下學期教「資料結構與演算法」

• 大二上學期教「演算法設計與分析」

(27)

Reasons

• 兩學期的「計程」變成一學期、「物件導向程式設計」變成選修 :

相信同學們可以有自己學習不同語言的能力。

• 把「資料結構」及「演算法」合成一門課 :

兩者互相依賴,其實不容易分散來教。

• 把「資料結構與演算法上/下」區分成「資料結構與演算法」和

「演算法設計與分析」 :

前者以實作為主,銜接計程做更深入的程式練習

後者以分析為主,建立在前者的基礎上探討更多不同的演算法

(28)

Reasons

• 兩學期的「計程」變成一學期、「物件導向程式設計」變成選修 :

相信同學們可以有自己學習不同語言的能力。

• 把「資料結構」及「演算法」合成一門課 :

兩者互相依賴,其實不容易分散來教。

• 把「資料結構與演算法上/下」區分成「資料結構與演算法」和

「演算法設計與分析」 :

前者以實作為主,銜接計程做更深入的程式練習

後者以分析為主,建立在前者的基礎上探討更多不同的演算法

(29)

Reasons

• 兩學期的「計程」變成一學期、「物件導向程式設計」變成選修 :

相信同學們可以有自己學習不同語言的能力。

• 把「資料結構」及「演算法」合成一門課 :

兩者互相依賴,其實不容易分散來教。

• 把「資料結構與演算法上/下」區分成「資料結構與演算法」和

「演算法設計與分析」 :

前者以實作為主,銜接計程做更深入的程式練習

後者以分析為主,建立在前者的基礎上探討更多不同的演算法

(30)

Basic Information

• instructor:

林軒田Hsuan-Tien Lin (htlin@csie.ntu.edu.tw)

• office hour: after class or by appointment

• course webpage, mailing list:

http://ceiba.ntu.edu.tw/1082dsa01(CEIBA)

• course contents actually in

www.csie.ntu.edu.tw/~htlin/course/dsa20spring

• course time: Tuesdays 13:20–16:20

10-min break liberally in the middle

10-min more teaching to fit 16 weeks

10-min earlier ending (i.e. usually ends 16:10) to be fair

Update your secondary email address on CEIBA!

(31)

Basic Information

• instructor:

林軒田Hsuan-Tien Lin (htlin@csie.ntu.edu.tw)

• office hour: after class or by appointment

• course webpage, mailing list:

http://ceiba.ntu.edu.tw/1082dsa01(CEIBA)

• course contents actually in

www.csie.ntu.edu.tw/~htlin/course/dsa20spring

• course time: Tuesdays 13:20–16:20

10-min break liberally in the middle

10-min more teaching to fit 16 weeks

10-min earlier ending (i.e. usually ends 16:10) to be fair Update your secondary email address on CEIBA!

(32)

Instructor: Strict but Friendly

• Will you repeat the previous code/slide again? Yes.

• Will you discuss with me after class if I don’t understand? Yes.

• Will you pardon my silly questions? There arenosilly questions. Feel free to ask me questions and give me feedback!

(33)

Instructor: Strict but Friendly

• Will you repeat the previous code/slide again? Yes.

• Will you discuss with me after class if I don’t understand? Yes.

• Will you pardon my silly questions? There arenosilly questions. Feel free to ask me questions and give me feedback!

(34)

Instructor: Strict but Friendly

• Will you repeat the previous code/slide again? Yes.

• Will you discuss with me after class if I don’t understand? Yes.

• Will you pardon my silly questions?

There arenosilly questions. Feel free to ask me questions and give me feedback!

(35)

Instructor: Strict but Friendly

• Will you repeat the previous code/slide again? Yes.

• Will you discuss with me after class if I don’t understand? Yes.

• Will you pardon my silly questions? There arenosilly questions.

Feel free to ask me questions and give me feedback!

(36)

Instructor: Strict but Friendly

• Will you repeat the previous code/slide again? Yes.

• Will you discuss with me after class if I don’t understand? Yes.

• Will you pardon my silly questions? There arenosilly questions.

Feel free to ask me questions and give me feedback!

(37)

Enrollment

• 98 seats in room 102, limit = 98 ∗ 125% ≈ 123

• priority-based:

zeroth: NTU CSIE

first: NTU EECS

other: NTU

• signup form: https://forms.gle/ETFC3AsQXW2GYYFU7

—will start processing on 03/04/2020

• auditing: welcomed (to sit) only if there is an empty chair please think before you choose to enroll

(38)

Enrollment

• 98 seats in room 102, limit = 98 ∗ 125% ≈ 123

• priority-based:

zeroth: NTU CSIE

first: NTU EECS

other: NTU

• signup form: https://forms.gle/ETFC3AsQXW2GYYFU7

—will start processing on 03/04/2020

• auditing: welcomed (to sit) only if there is an empty chair please think before you choose to enroll

(39)

Enrollment

• 98 seats in room 102, limit = 98 ∗ 125% ≈ 123

• priority-based:

zeroth: NTU CSIE

first: NTU EECS

other: NTU

• signup form: https://forms.gle/ETFC3AsQXW2GYYFU7

—will start processing on 03/04/2020

• auditing: welcomed (to sit) only if there is an empty chair please think before you choose to enroll

(40)

Enrollment

• 98 seats in room 102, limit = 98 ∗ 125% ≈ 123

• priority-based:

zeroth: NTU CSIE

first: NTU EECS

other: NTU

• signup form: https://forms.gle/ETFC3AsQXW2GYYFU7

—will start processing on 03/04/2020

• auditing: welcomed (to sit) only if there is an empty chair

please think before you choose to enroll

(41)

Enrollment

• 98 seats in room 102, limit = 98 ∗ 125% ≈ 123

• priority-based:

zeroth: NTU CSIE

first: NTU EECS

other: NTU

• signup form: https://forms.gle/ETFC3AsQXW2GYYFU7

—will start processing on 03/04/2020

• auditing: welcomed (to sit) only if there is an empty chair please think before you choose to enroll

(42)

Teaching Assistants

• TAs (tentatively): 陳佳佑、周侑廷、李鈺昇、楊皓丞、吳崇維

• TA email: dsa_ta@csie.ntu.edu.tw

—5 TAs and 1 instructor around, usually faster than sending to individual

• office hours: to be announced

very friendly TAs; ask them more questions!

(43)

Teaching Assistants

• TAs (tentatively): 陳佳佑、周侑廷、李鈺昇、楊皓丞、吳崇維

• TA email: dsa_ta@csie.ntu.edu.tw

—5 TAs and 1 instructor around, usually faster than sending to individual

• office hours: to be announced

very friendly TAs; ask them more questions!

(44)

Teaching Assistants

• TAs (tentatively): 陳佳佑、周侑廷、李鈺昇、楊皓丞、吳崇維

• TA email: dsa_ta@csie.ntu.edu.tw

—5 TAs and 1 instructor around, usually faster than sending to individual

• office hours: to be announced

very friendly TAs; ask them more questions!

(45)

Teaching Assistants

• TAs (tentatively): 陳佳佑、周侑廷、李鈺昇、楊皓丞、吳崇維

• TA email: dsa_ta@csie.ntu.edu.tw

—5 TAs and 1 instructor around, usually faster than sending to individual

• office hours: to be announced

very friendly TAs; ask them more questions!

(46)

THE Principle

Taking any unfair advantages over other class members is not allowed.

It is everyone’s responsibility to maximize the level of fairness.

• eating? fine, but no smells and no noise

• sleeping? fine, but no snoring

• cellphone? fine, but silent mode, and speak outside

• ...

applies to instructor, TAs, students

(47)

THE Principle

Taking any unfair advantages over other class members is not allowed.

It is everyone’s responsibility to maximize the level of fairness.

• eating? fine, but no smells and no noise

• sleeping? fine, but no snoring

• cellphone? fine, but silent mode, and speak outside

• ...

applies to instructor, TAs, students

(48)

THE Principle

Taking any unfair advantages over other class members is not allowed.

It is everyone’s responsibility to maximize the level of fairness.

• eating? fine, but no smells and no noise

• sleeping? fine, but no snoring

• cellphone? fine, but silent mode, and speak outside

• ...

applies to instructor, TAs, students

(49)

THE Principle

Taking any unfair advantages over other class members is not allowed.

It is everyone’s responsibility to maximize the level of fairness.

• eating? fine, but no smells and no noise

• sleeping? fine, but no snoring

• cellphone? fine, but silent mode, and speak outside

• ...

applies to instructor, TAs, students

(50)

THE Principle

Taking any unfair advantages over other class members is not allowed.

It is everyone’s responsibility to maximize the level of fairness.

• eating? fine, but no smells and no noise

• sleeping? fine, but no snoring

• cellphone? fine, but silent mode, and speak outside

• ...

applies to instructor, TAs, students

(51)

Honesty

NO CHEATING NO LYING NO PLAGIARISM

very very very very serious consequences

(52)

Honesty

NO CHEATING NO LYING NO PLAGIARISM

very very very very serious consequences

(53)

Grade

• homework (best * 1.5 + worst * 0.5 + others), midterm, final project

• supplementary reference: participation in discussions

• raw score goes through some order-preserving normalization steps,not just using default thresholds of university

raw score 80 with term rank A: possible

raw score 80 with term rank B: possible

raw score 60 with term rank F: possible

raw scores 80, 60 with term scores B, B: possible, but unlikely

raw scores 80, 60 with term scores F, B:impossible from the principle: no individual score change

(54)

Grade

• homework (best * 1.5 + worst * 0.5 + others), midterm, final project

• supplementary reference: participation in discussions

• raw score goes through some order-preserving normalization steps,not just using default thresholds of university

raw score 80 with term rank A: possible

raw score 80 with term rank B: possible

raw score 60 with term rank F: possible

raw scores 80, 60 with term scores B, B: possible, but unlikely

raw scores 80, 60 with term scores F, B:impossible from the principle: no individual score change

(55)

Grade

• homework (best * 1.5 + worst * 0.5 + others), midterm, final project

• supplementary reference: participation in discussions

• raw score goes through some order-preserving normalization steps,not just using default thresholds of university

raw score 80 with term rank A: possible

raw score 80 with term rank B: possible

raw score 60 with term rank F: possible

raw scores 80, 60 with term scores B, B: possible, but unlikely

raw scores 80, 60 with term scores F, B:impossible from the principle: no individual score change

(56)

Grade

• homework (best * 1.5 + worst * 0.5 + others), midterm, final project

• supplementary reference: participation in discussions

• raw score goes through some order-preserving normalization steps,not just using default thresholds of university

raw score 80 with term rank A: possible

raw score 80 with term rank B: possible

raw score 60 with term rank F: possible

raw scores 80, 60 with term scores B, B: possible, but unlikely

raw scores 80, 60 with term scores F, B:impossible from the principle: no individual score change

(57)

Grade

• homework (best * 1.5 + worst * 0.5 + others), midterm, final project

• supplementary reference: participation in discussions

• raw score goes through some order-preserving normalization steps,not just using default thresholds of university

raw score 80 with term rank A: possible

raw score 80 with term rank B: possible

raw score 60 with term rank F: possible

raw scores 80, 60 with term scores B, B: possible, but unlikely

raw scores 80, 60 with term scores F, B:impossible from the principle: no individual score change

(58)

Grade

• homework (best * 1.5 + worst * 0.5 + others), midterm, final project

• supplementary reference: participation in discussions

• raw score goes through some order-preserving normalization steps,not just using default thresholds of university

raw score 80 with term rank A: possible

raw score 80 with term rank B: possible

raw score 60 with term rank F: possible

raw scores 80, 60 with term scores B, B: possible, but unlikely

raw scores 80, 60 with term scores F, B:impossible from the principle: no individual score change

(59)

Grade

• homework (best * 1.5 + worst * 0.5 + others), midterm, final project

• supplementary reference: participation in discussions

• raw score goes through some order-preserving normalization steps,not just using default thresholds of university

raw score 80 with term rank A: possible

raw score 80 with term rank B: possible

raw score 60 with term rank F: possible

raw scores 80, 60 with term scores B, B: possible, but unlikely

raw scores 80, 60 with term scores F, B:impossible

from the principle: no individual score change

(60)

Grade

• homework (best * 1.5 + worst * 0.5 + others), midterm, final project

• supplementary reference: participation in discussions

• raw score goes through some order-preserving normalization steps,not just using default thresholds of university

raw score 80 with term rank A: possible

raw score 80 with term rank B: possible

raw score 60 with term rank F: possible

raw scores 80, 60 with term scores B, B: possible, but unlikely

raw scores 80, 60 with term scores F, B:impossible from the principle: no individual score change

(61)

Collaboration and Open-Book

• homework discussions: encouraged

• but fairness?

write the final solutions alone and understand them fully

• references (books, notes, Internet): consulted, butnot copied from

• no need to lend/borrow solutions

to maximize fairness (everyone’s responsibility), lending/borrowing/buying/selling not allowed

(62)

Collaboration and Open-Book

• homework discussions: encouraged

• but fairness?

write the final solutions alone and understand them fully

• references (books, notes, Internet): consulted, butnot copied from

• no need to lend/borrow solutions

to maximize fairness (everyone’s responsibility), lending/borrowing/buying/selling not allowed

(63)

Collaboration and Open-Book

• homework discussions: encouraged

• but fairness?

write the final solutions alone and understand them fully

• references (books, notes, Internet):

consulted, butnot copied from

• no need to lend/borrow solutions

to maximize fairness (everyone’s responsibility), lending/borrowing/buying/selling not allowed

(64)

Collaboration and Open-Book

• homework discussions: encouraged

• but fairness?

write the final solutions alone and understand them fully

• references (books, notes, Internet):

consulted, butnot copied from

• no need to lend/borrow solutions

to maximize fairness (everyone’s responsibility), lending/borrowing/buying/selling not allowed

(65)

Collaboration and Open-Book

to maximize fairness (everyone’s responsibility), lending/borrowing/buying/selling not allowed

to maximize fairness (everyone’s responsibility), lending/borrowing/buying/selling not allowed to maximize fairness (everyone’s responsibility), lending/borrowing/buying/selling not allowed Deal? If your classmate wants to borrow homework from you,

what do you say?

(66)

Collaboration and Open-Book

to maximize fairness (everyone’s responsibility), lending/borrowing/buying/selling not allowed to maximize fairness (everyone’s responsibility), lending/borrowing/buying/selling not allowed

to maximize fairness (everyone’s responsibility), lending/borrowing/buying/selling not allowed Deal? If your classmate wants to borrow homework from you,

what do you say?

(67)

Collaboration and Open-Book

to maximize fairness (everyone’s responsibility), lending/borrowing/buying/selling not allowed to maximize fairness (everyone’s responsibility), lending/borrowing/buying/selling not allowed to maximize fairness (everyone’s responsibility), lending/borrowing/buying/selling not allowed

Deal? If your classmate wants to borrow homework from you, what do you say?

(68)

Collaboration and Open-Book

to maximize fairness (everyone’s responsibility), lending/borrowing/buying/selling not allowed to maximize fairness (everyone’s responsibility), lending/borrowing/buying/selling not allowed to maximize fairness (everyone’s responsibility), lending/borrowing/buying/selling not allowed Deal? If your classmate wants to borrow homework from you,

what do you say?

(69)

Homework

• students: justify solutions clearly

• TAs: evaluate solutions fairly

• no individual extension unless not violating the principle (e.g. institute-established cases of illness or emergency)

• late penalty:

90% of the value for 12-hour late, 80% of value for 24-hour late, ... four penalty-free late half-days (金金金牌牌牌) per person

(70)

Homework

• students: justify solutions clearly

• TAs: evaluate solutions fairly

• no individual extension unless not violating the principle (e.g.

institute-established cases of illness or emergency)

• late penalty:

90% of the value for 12-hour late, 80% of value for 24-hour late, ... four penalty-free late half-days (金金金牌牌牌) per person

(71)

Homework

• students: justify solutions clearly

• TAs: evaluate solutions fairly

• no individual extension unless not violating the principle (e.g.

institute-established cases of illness or emergency)

• late penalty:

90% of the value for 12-hour late, 80% of value for 24-hour late, ...

four penalty-free late half-days (金金金牌牌牌) per person

(72)

Homework

• students: justify solutions clearly

• TAs: evaluate solutions fairly

• no individual extension unless not violating the principle (e.g.

institute-established cases of illness or emergency)

• late penalty:

90% of the value for 12-hour late, 80% of value for 24-hour late, ...

four penalty-free late half-days (金金金牌牌牌) per person

(73)

Textbook

Data Structures and Algorithms in C++, 2nd Edition by Goodrich, Tamassia and Mount.

• please get it as early as possible

• will teach selected parts from it, andask you to read others learning to read a textbook is part of the course

(74)

Textbook

Data Structures and Algorithms in C++, 2nd Edition by Goodrich, Tamassia and Mount.

• please get it as early as possible

• will teach selected parts from it, andask you to read others learning to read a textbook is part of the course

(75)

Getting the Book to Read

• NTU Library: reserved copy in the shared course material area

• R536: will put some shared copies to be read in the room

• If the book is not affordable to you: email me

(htlin@csie.ntu.edu.tw) and I’ll see how I can help.

(76)

Getting the Book to Read

• NTU Library: reserved copy in the shared course material area

• R536: will put some shared copies to be read in the room

• If the book is not affordable to you: email me

(htlin@csie.ntu.edu.tw) and I’ll see how I can help.

(77)

Getting the Book to Read

• NTU Library: reserved copy in the shared course material area

• R536: will put some shared copies to be read in the room

• If the book is not affordable to you: email me

(htlin@csie.ntu.edu.tw) and I’ll see how I can help.

(78)

Reading Assignments

• weekly

• sections related to what we teach, or sections that are worth reading by yourself

—we cannot teach all, but with reading you can learn all

• 3-6: 3 hour teaching, 6 hour reading/writing after class

some problems related to reading assignments may show up in your writing assignments as well

(79)

Reading Assignments

• weekly

• sections related to what we teach, or sections that are worth reading by yourself

—we cannot teach all, but with reading you can learn all

• 3-6: 3 hour teaching, 6 hour reading/writing after class

some problems related to reading assignments may show up in your writing assignments as well

(80)

Reading Assignments

• weekly

• sections related to what we teach, or sections that are worth reading by yourself

—we cannot teach all, but with reading you can learn all

• 3-6: 3 hour teaching, 6 hour reading/writing after class

some problems related to reading assignments may show up in your writing assignments as well

(81)

Reading Assignments

• weekly

• sections related to what we teach, or sections that are worth reading by yourself

—we cannot teach all, but with reading you can learn all

• 3-6: 3 hour teaching, 6 hour reading/writing after class

some problems related to reading assignments may show up in your writing assignments as well

(82)

Mandarin and English

• Mandarin: main language

• English: often encountered

—coding, website, assignments, some teaching . . .

—important for your future and you are recommended to practice don’t be afraid of English

(83)

Mandarin and English

• Mandarin: main language

• English: often encountered

—coding, website, assignments, some teaching . . .

—important for your future and you are recommended to practice don’t be afraid of English

(84)

Mandarin and English

• Mandarin: main language

• English: often encountered

—coding, website, assignments, some teaching . . .

—important for your future and you are recommended to practice

don’t be afraid of English

(85)

Mandarin and English

• Mandarin: main language

• English: often encountered

—coding, website, assignments, some teaching . . .

—important for your future and you are recommended to practice don’t be afraid of English

(86)

How to Pass the Class?

• catch up from day 1

• ask questions!

• have fun writing programs

• understand writing proof

(87)

Important TODOs

• Update your secondary email address on CEIBA

• Read the policy on the website thoroughly Enjoy the Class! Questions?

參考文獻

相關文件

In developing LIBSVM and LIBLINEAR, we design suitable optimization methods for these special optimization problems. Some methods are completely new, but some are modification

The left panel shows boxplots showing the 100 posterior predictive p values (PPP-values) for each observed raw score across the 100 simulated data sets generated from

– Change of ownership principle in recording trade in goods sent abroad for processing – The term Gross National Product (GNP) is... Capitalisation of research and development

important to not just have intuition (building), but know definition (building block).. More on

For the data sets used in this thesis we find that F-score performs well when the number of features is large, and for small data the two methods using the gradient of the

Know how to implement the data structure using computer programs... What are we

• Recorded video will be available on NTU COOL after the class..

—we cannot teach all, but with reading you can learn all 3-6: 3 hour teaching, 6 hour reading/writing after class as important as writing assignments:. some may show up