## SWE2015S19-41.Overview History

Hide minor edits - Show changes to output

Changed line 55 from:

* 18. Final ~~Exam~~

to:

* 18. Final Exam - [[(Attach:)course review for the final E.ppt|ppt]]

Changed lines 53-55 from:

* 16. ~~Final Exam~~

* R1. Red-~~Black Tree - ~~[[(Attach:)Lecture_Note14.ppt|ppt]]

*~~R2~~. AVL Tree - [[(Attach:)Lecture_Note15.ppt|ppt]]

* R1. Red

*

to:

* 16. Red-Black Tree - [[(Attach:)Lecture_Note14.ppt|ppt]]

* 17. AVL Tree - [[(Attach:)Lecture_Note15.ppt|ppt]]

* 18. Final Exam

* 17. AVL Tree - [[(Attach:)Lecture_Note15.ppt|ppt]]

* 18. Final Exam

Changed line 44 from:

* 8. Midterm Score [[(Attach:)~~midtermscore~~.pdf|pdf]]

to:

* 8. Midterm Score [[(Attach:)midtermscore2.pdf|pdf]]

Changed line 44 from:

* 8.~~ Midterm Exam [[(Attach:)midterm2.pdf|pdf]] ~~ Midterm Score [[(Attach:)midtermscore.pdf|pdf]]

to:

* 8. Midterm Score [[(Attach:)midtermscore.pdf|pdf]]

Changed line 45 from:

to:

Midterm Score is indexed by (last 2 digits of student id + last 2 digits of mobile phone number)

Changed lines 44-45 from:

* 8. Midterm Exam [[(Attach:)midterm2.pdf|pdf]]

to:

* 8. Midterm Exam [[(Attach:)midterm2.pdf|pdf]] Midterm Score [[(Attach:)midtermscore.pdf|pdf]]

Midterm Score is indexed as (last 2 digits of student id + last 2 digits of mobile phone number)

Midterm Score is indexed as (last 2 digits of student id + last 2 digits of mobile phone number)

Changed line 44 from:

* 8. Midterm Exam [[(Attach:)~~midterm~~.pdf|pdf]]

to:

* 8. Midterm Exam [[(Attach:)midterm2.pdf|pdf]]

Changed line 44 from:

* 8. Midterm ~~Exam~~

to:

* 8. Midterm Exam [[(Attach:)midterm.pdf|pdf]]

Changed line 43 from:

* 7. Tree - [[(Attach:)Lecture_Note07.ppt|ppt]]

to:

* 7. Tree - [[(Attach:)Lecture_Note07.ppt|ppt]] Binary Tree - [[(Attach:)Lecture_Note08.ppt|ppt]]

Changed line 42 from:

* List ~~2~~ - [[(Attach:)Lecture_Note06.ppt|ppt]] Homework 2 Out

to:

* 6.5 Linked List - [[(Attach:)Lecture_Note06.ppt|ppt]] Homework 2 Out

Changed lines 41-42 from:

* 6. List - [[(Attach:)Lecture_Note05.ppt|ppt]] Homework 2 Out

to:

* 6. List - [[(Attach:)Lecture_Note05.ppt|ppt]]

* List 2 - [[(Attach:)Lecture_Note06.ppt|ppt]] Homework 2 Out

* List 2 - [[(Attach:)Lecture_Note06.ppt|ppt]] Homework 2 Out

Changed line 45 from:

* 10. Graph - [[(Attach:)Lecture_Note10.ppt|ppt]]~~ Homework 3 Out~~

to:

* 10. Graph - [[(Attach:)Lecture_Note10.ppt|ppt]]

Changed line 50 from:

* 15. Binary Search Tree - [[(Attach:)Lecture_Note13.ppt|ppt]]~~ Homework 4 Out~~

to:

* 15. Binary Search Tree - [[(Attach:)Lecture_Note13.ppt|ppt]]

Changed lines 29-32 from:

* ~~이도현~~ (mailto:~~daumgen~~@gmail.com)

to:

* 김민우 (mailto:kimmw95@skku.edu)

* 원민섭 (mailto:jbk4860@skku.edu)

* 장종권 (mailto:rhantls2279@naver.com)

* 정민섭 (mailto:hpmltsws@gmail.com)

* 원민섭 (mailto:jbk4860@skku.edu)

* 장종권 (mailto:rhantls2279@naver.com)

* 정민섭 (mailto:hpmltsws@gmail.com)

Changed lines 36-38 from:

* 4. ~~Queue~~ - [[(Attach:)Lecture_Note04.ppt|ppt]] ~~Homework 1 Out~~

* 5. List -[[(Attach:)Lecture_Note05~~.ppt|ppt]] ~~

* 6. Linked List - [[(Attach:)Lecture_Note06.ppt|ppt]] Homework 2 Out

* 5. List -

* 6. Linked List - [[(Attach:)Lecture_Note06

to:

* 4. Stacks - Homework 1 Out

* 5. Queue - [[(Attach:)Lecture_Note04.ppt|ppt]]

* 6. List - [[(Attach:)Lecture_Note05.ppt|ppt]] Homework 2 Out

* 5. Queue - [[(Attach:)Lecture_Note04.ppt|ppt]]

* 6. List - [[(Attach:)Lecture_Note05.ppt|ppt]] Homework 2 Out

Changed line 40 from:

* 8.~~ Binary Tree - [[(Attach:)Lecture_Note08.ppt|ppt]]~~ Midterm Exam

to:

* 8. Midterm Exam

Changed lines 43-47 from:

* 11. ~~Sorting~~ - [[(Attach:)Lecture_Note11.ppt|ppt]]

*~~12~~. ~~Hashing~~ - [[(Attach:)Lecture_Note12.ppt|ppt]]

* 13. Binary Search Tree - [[(Attach:)Lecture_Note13.ppt|ppt]] Homework 4 ~~Out~~

* 14. Red-Black Tree - [[(Attach:)Lecture_Note14.ppt|ppt]]

* 15. AVL Tree - [[(Attach:)Lecture_Note15.ppt|ppt]]

*

* 13

* 14. Red-Black Tree - [[(Attach:)Lecture_Note14.ppt|ppt]]

* 15. AVL Tree - [[(Attach:)Lecture_Note15.ppt|ppt]]

to:

* 11. Graph - Homework 3 Out

* 12. Sorting - [[(Attach:)Lecture_Note11.ppt|ppt]]

* 13. Sorting - Homework 4 Out

* 14. Hashing - [[(Attach:)Lecture_Note12.ppt|ppt]]

* 15. Binary Search Tree - [[(Attach:)Lecture_Note13.ppt|ppt]] Homework 4 Out

* 12. Sorting - [[(Attach:)Lecture_Note11.ppt|ppt]]

* 13. Sorting - Homework 4 Out

* 14. Hashing - [[(Attach:)Lecture_Note12.ppt|ppt]]

* 15. Binary Search Tree - [[(Attach:)Lecture_Note13.ppt|ppt]] Homework 4 Out

Added lines 49-50:

* R1. Red-Black Tree - [[(Attach:)Lecture_Note14.ppt|ppt]]

* R2. AVL Tree - [[(Attach:)Lecture_Note15.ppt|ppt]]

* R2. AVL Tree - [[(Attach:)Lecture_Note15.ppt|ppt]]

Changed lines 35-36 from:

* 3. Stacks - [[(Attach:)Lecture_Note03.ppt|ppt]] ~~Homework 1 Out~~

* 4. Queue -[[(Attach:)Lecture_Note04.ppt|ppt]]

* 4. Queue -

to:

* 3. Stacks - [[(Attach:)Lecture_Note03.ppt|ppt]]

* 4. Queue - [[(Attach:)Lecture_Note04.ppt|ppt]] Homework 1 Out

* 4. Queue - [[(Attach:)Lecture_Note04.ppt|ppt]] Homework 1 Out

Changed lines 35-38 from:

* 3. Stacks - [[(Attach:)Lecture_Note03.ppt|ppt]]

~~* 4. Queue - ~~[[(Attach:)Lecture_Note04.ppt|ppt]]

~~* 5. List - ~~[[(Attach:)Lecture_Note05.ppt|ppt]]

~~* 6. Linked List - ~~[[(Attach:)Lecture_Note06.ppt|ppt]]

to:

* 3. Stacks - [[(Attach:)Lecture_Note03.ppt|ppt]] Homework 1 Out

* 4. Queue - [[(Attach:)Lecture_Note04.ppt|ppt]]

* 5. List - [[(Attach:)Lecture_Note05.ppt|ppt]]

* 6. Linked List - [[(Attach:)Lecture_Note06.ppt|ppt]] Homework 2 Out

* 4. Queue - [[(Attach:)Lecture_Note04.ppt|ppt]]

* 5. List - [[(Attach:)Lecture_Note05.ppt|ppt]]

* 6. Linked List - [[(Attach:)Lecture_Note06.ppt|ppt]] Homework 2 Out

Changed lines 40-42 from:

* 8. Binary Tree - [[(Attach:)Lecture_Note08.ppt|ppt]]

~~* 9. Heap - ~~[[(Attach:)Lecture_Note09.ppt|ppt]]

~~* 10. Graph - ~~[[(Attach:)Lecture_Note10.ppt|ppt]]

to:

* 8. Binary Tree - [[(Attach:)Lecture_Note08.ppt|ppt]] Midterm Exam

* 9. Heap - [[(Attach:)Lecture_Note09.ppt|ppt]]

* 10. Graph - [[(Attach:)Lecture_Note10.ppt|ppt]] Homework 3 Out

* 9. Heap - [[(Attach:)Lecture_Note09.ppt|ppt]]

* 10. Graph - [[(Attach:)Lecture_Note10.ppt|ppt]] Homework 3 Out

Changed lines 44-45 from:

* 12. Hashing - [[(Attach:)Lecture_Note12.ppt|ppt]]

~~*~~ 13. Binary Search Tree - [[(Attach:)Lecture_Note13.ppt|ppt]]

to:

* 12. Hashing - [[(Attach:)Lecture_Note12.ppt|ppt]]

* 13. Binary Search Tree - [[(Attach:)Lecture_Note13.ppt|ppt]] Homework 4 Out

* 13. Binary Search Tree - [[(Attach:)Lecture_Note13.ppt|ppt]] Homework 4 Out

Added line 48:

* 16. Final Exam

Changed line 33 from:

* 1. Introduction - [[(Attach:)Lecture_~~Note1~~.ppt|ppt]]

to:

* 1. Introduction - [[(Attach:)Lecture_Note1b.ppt|ppt]]

Changed line 33 from:

* 1. Introduction - [[(Attach:)Lecture_~~Note01~~.ppt|ppt]]

to:

* 1. Introduction - [[(Attach:)Lecture_Note1.ppt|ppt]]

Changed lines 33-48 from:

* 1. Introduction - [[(Attach:)Lecture_Note01.~~pptx|~~ppt]]

* 2. Performance - [[(Attach:)Lecture_Note02.~~pptx|~~ppt]]

* 3. Stacks - [[(Attach:)Lecture_Note03.~~pptx|~~ppt]]

* 4. Queue - [[(Attach:)Lecture_Note04.~~pptx|~~ppt]]

* 5. List - [[(Attach:)Lecture_Note05.~~pptx|~~ppt]]

* 6. Linked List - [[(Attach:)Lecture_Note06.~~pptx|~~ppt]]

* 7. Tree - [[(Attach:)Lecture_Note07.~~pptx~~|~~pptx~~]]

* 8. Binary Tree - [[(Attach:)Lecture_Note08.~~pptx|~~ppt]]

* 9. Heap - [[(Attach:)Lecture_Note09.~~pptx|~~ppt]]

* 10. Graph - [[(Attach:)Lecture_Note10.~~pptx|~~ppt]]

* 11. Sorting - [[(Attach:)Lecture_Note11.~~pptx|~~ppt]]

* 12. Hashing - [[(Attach:)Lecture_Note12.~~pptx|~~ppt]]

* 13. Binary Search Tree - [[(Attach:)Lecture_Note13.~~pptx|~~ppt]]

* 14. Red-Black Tree - [[(Attach:)Lecture_Note14.~~pptx|~~ppt]]

* 15. AVL Tree - [[(Attach:)Lecture_Note15.~~pptx|~~ppt]]

* 2. Performance - [[(Attach:)Lecture_Note02.

* 3. Stacks - [[(Attach:)Lecture_Note03.

* 4. Queue - [[(Attach:)Lecture_Note04.

* 5. List - [[(Attach:)Lecture_Note05.

* 6. Linked List - [[(Attach:)Lecture_Note06.

* 7. Tree - [[(Attach:)Lecture_Note07.

* 8. Binary Tree - [[(Attach:)Lecture_Note08.

* 9. Heap - [[(Attach:)Lecture_Note09.

* 10. Graph - [[(Attach:)Lecture_Note10.

* 11. Sorting - [[(Attach:)Lecture_Note11.

* 12. Hashing - [[(Attach:)Lecture_Note12.

* 13. Binary Search Tree - [[(Attach:)Lecture_Note13.

* 14. Red-Black Tree - [[(Attach:)Lecture_Note14.

* 15. AVL Tree - [[(Attach:)Lecture_Note15.

to:

* 1. Introduction - [[(Attach:)Lecture_Note01.ppt|ppt]]

* 2. Performance - [[(Attach:)Lecture_Note02.ppt|ppt]]

* 3. Stacks - [[(Attach:)Lecture_Note03.ppt|ppt]]

* 4. Queue - [[(Attach:)Lecture_Note04.ppt|ppt]]

* 5. List - [[(Attach:)Lecture_Note05.ppt|ppt]]

* 6. Linked List - [[(Attach:)Lecture_Note06.ppt|ppt]]

* 7. Tree - [[(Attach:)Lecture_Note07.ppt|ppt]]

* 8. Binary Tree - [[(Attach:)Lecture_Note08.ppt|ppt]]

* 9. Heap - [[(Attach:)Lecture_Note09.ppt|ppt]]

* 10. Graph - [[(Attach:)Lecture_Note10.ppt|ppt]]

* 11. Sorting - [[(Attach:)Lecture_Note11.ppt|ppt]]

* 12. Hashing - [[(Attach:)Lecture_Note12.ppt|ppt]]

* 13. Binary Search Tree - [[(Attach:)Lecture_Note13.ppt|ppt]]

* 14. Red-Black Tree - [[(Attach:)Lecture_Note14.ppt|ppt]]

* 15. AVL Tree - [[(Attach:)Lecture_Note15.ppt|ppt]]

* 2. Performance - [[(Attach:)Lecture_Note02.ppt|ppt]]

* 3. Stacks - [[(Attach:)Lecture_Note03.ppt|ppt]]

* 4. Queue - [[(Attach:)Lecture_Note04.ppt|ppt]]

* 5. List - [[(Attach:)Lecture_Note05.ppt|ppt]]

* 6. Linked List - [[(Attach:)Lecture_Note06.ppt|ppt]]

* 7. Tree - [[(Attach:)Lecture_Note07.ppt|ppt]]

* 8. Binary Tree - [[(Attach:)Lecture_Note08.ppt|ppt]]

* 9. Heap - [[(Attach:)Lecture_Note09.ppt|ppt]]

* 10. Graph - [[(Attach:)Lecture_Note10.ppt|ppt]]

* 11. Sorting - [[(Attach:)Lecture_Note11.ppt|ppt]]

* 12. Hashing - [[(Attach:)Lecture_Note12.ppt|ppt]]

* 13. Binary Search Tree - [[(Attach:)Lecture_Note13.ppt|ppt]]

* 14. Red-Black Tree - [[(Attach:)Lecture_Note14.ppt|ppt]]

* 15. AVL Tree - [[(Attach:)Lecture_Note15.ppt|ppt]]

Changed lines 33-38 from:

* 1. Introduction - [[(Attach:)Lecture_Note01.pptx|~~pptx~~]]

* 2. Performance - [[(Attach:)Lecture_Note02.pptx|~~pptx~~]]

* 3. Stacks - [[(Attach:)Lecture_Note03.pptx|~~pptx~~]]

* 4. Queue - [[(Attach:)Lecture_Note04.pptx|~~pptx~~]]

* 5. List - [[(Attach:)Lecture_Note05.pptx|~~pptx~~]]

* 6. Linked List - [[(Attach:)Lecture_Note06.pptx|~~pptx~~]]

* 2. Performance - [[(Attach:)Lecture_Note02.pptx|

* 3. Stacks - [[(Attach:)Lecture_Note03.pptx|

* 4. Queue - [[(Attach:)Lecture_Note04.pptx|

* 5. List - [[(Attach:)Lecture_Note05.pptx|

* 6. Linked List - [[(Attach:)Lecture_Note06.pptx|

to:

* 1. Introduction - [[(Attach:)Lecture_Note01.pptx|ppt]]

* 2. Performance - [[(Attach:)Lecture_Note02.pptx|ppt]]

* 3. Stacks - [[(Attach:)Lecture_Note03.pptx|ppt]]

* 4. Queue - [[(Attach:)Lecture_Note04.pptx|ppt]]

* 5. List - [[(Attach:)Lecture_Note05.pptx|ppt]]

* 6. Linked List - [[(Attach:)Lecture_Note06.pptx|ppt]]

* 2. Performance - [[(Attach:)Lecture_Note02.pptx|ppt]]

* 3. Stacks - [[(Attach:)Lecture_Note03.pptx|ppt]]

* 4. Queue - [[(Attach:)Lecture_Note04.pptx|ppt]]

* 5. List - [[(Attach:)Lecture_Note05.pptx|ppt]]

* 6. Linked List - [[(Attach:)Lecture_Note06.pptx|ppt]]

Changed lines 40-47 from:

* 8. Binary Tree - [[(Attach:)Lecture_Note08.pptx|~~pptx~~]]

* 9. Heap - [[(Attach:)Lecture_Note09.pptx|~~pptx~~]]

* 10. Graph - [[(Attach:)Lecture_Note10.pptx|~~pptx~~]]

* 11. Sorting - [[(Attach:)Lecture_Note11.pptx|~~pptx~~]]

* 12. Hashing - [[(Attach:)Lecture_Note12.pptx|~~pptx~~]]

* 13. Binary Search Tree - [[(Attach:)Lecture_Note13.pptx|~~pptx~~]]

* 14. Red-Black Tree - [[(Attach:)Lecture_Note14.pptx|~~pptx~~]]

* 15. AVL Tree - [[(Attach:)Lecture_Note15.pptx|~~pptx~~]]

* 9. Heap - [[(Attach:)Lecture_Note09.pptx|

* 10. Graph - [[(Attach:)Lecture_Note10.pptx|

* 11. Sorting - [[(Attach:)Lecture_Note11.pptx|

* 12. Hashing - [[(Attach:)Lecture_Note12.pptx|

* 13. Binary Search Tree - [[(Attach:)Lecture_Note13.pptx|

* 14. Red-Black Tree - [[(Attach:)Lecture_Note14.pptx|

* 15. AVL Tree - [[(Attach:)Lecture_Note15.pptx|

to:

* 8. Binary Tree - [[(Attach:)Lecture_Note08.pptx|ppt]]

* 9. Heap - [[(Attach:)Lecture_Note09.pptx|ppt]]

* 10. Graph - [[(Attach:)Lecture_Note10.pptx|ppt]]

* 11. Sorting - [[(Attach:)Lecture_Note11.pptx|ppt]]

* 12. Hashing - [[(Attach:)Lecture_Note12.pptx|ppt]]

* 13. Binary Search Tree - [[(Attach:)Lecture_Note13.pptx|ppt]]

* 14. Red-Black Tree - [[(Attach:)Lecture_Note14.pptx|ppt]]

* 15. AVL Tree - [[(Attach:)Lecture_Note15.pptx|ppt]]

* 9. Heap - [[(Attach:)Lecture_Note09.pptx|ppt]]

* 10. Graph - [[(Attach:)Lecture_Note10.pptx|ppt]]

* 11. Sorting - [[(Attach:)Lecture_Note11.pptx|ppt]]

* 12. Hashing - [[(Attach:)Lecture_Note12.pptx|ppt]]

* 13. Binary Search Tree - [[(Attach:)Lecture_Note13.pptx|ppt]]

* 14. Red-Black Tree - [[(Attach:)Lecture_Note14.pptx|ppt]]

* 15. AVL Tree - [[(Attach:)Lecture_Note15.pptx|ppt]]

Changed lines 33-47 from:

* 1. Introduction - [[(Attach:)Lecture_Note01.~~ppt~~|~~ppt~~]]

* 2. Performance - [[(Attach:)Lecture_Note02.~~ppt~~|~~ppt~~]]

* 3. Stacks - [[(Attach:)Lecture_Note03.~~ppt~~|~~ppt~~]]

* 4. Queue - [[(Attach:)Lecture_Note04.~~ppt~~|~~ppt~~]]

* 5. List - [[(Attach:)Lecture_Note05.~~ppt~~|~~ppt~~]]

* 6. Linked List - [[(Attach:)Lecture_Note06.~~ppt~~|~~ppt~~]]

* 7. Tree - [[(Attach:)Lecture_Note07.~~ppt~~|~~ppt~~]]

* 8. Binary Tree - [[(Attach:)Lecture_Note08.~~ppt~~|~~ppt~~]]

* 9. Heap - [[(Attach:)Lecture_Note09.~~ppt~~|~~ppt~~]]

* 10. Graph - [[(Attach:)Lecture_Note10.~~ppt~~|~~ppt~~]]

* 11. Sorting - [[(Attach:)Lecture_Note11.~~ppt~~|~~ppt~~]]

* 12. Hashing - [[(Attach:)Lecture_Note12.~~ppt~~|~~ppt~~]]

* 13. Binary Search Tree - [[(Attach:)Lecture_Note13.~~ppt~~|~~ppt~~]]

* 14. Red-Black Tree - [[(Attach:)Lecture_Note14.~~ppt~~|~~ppt~~]]

* 15. AVL Tree - [[(Attach:)Lecture_Note15.~~ppt~~|~~ppt~~]]

* 2. Performance - [[(Attach:)Lecture_Note02.

* 3. Stacks - [[(Attach:)Lecture_Note03.

* 4. Queue - [[(Attach:)Lecture_Note04.

* 5. List - [[(Attach:)Lecture_Note05.

* 6. Linked List - [[(Attach:)Lecture_Note06.

* 7. Tree - [[(Attach:)Lecture_Note07.

* 8. Binary Tree - [[(Attach:)Lecture_Note08.

* 9. Heap - [[(Attach:)Lecture_Note09.

* 10. Graph - [[(Attach:)Lecture_Note10.

* 11. Sorting - [[(Attach:)Lecture_Note11.

* 12. Hashing - [[(Attach:)Lecture_Note12.

* 13. Binary Search Tree - [[(Attach:)Lecture_Note13.

* 14. Red-Black Tree - [[(Attach:)Lecture_Note14.

* 15. AVL Tree - [[(Attach:)Lecture_Note15.

to:

* 1. Introduction - [[(Attach:)Lecture_Note01.pptx|pptx]]

* 2. Performance - [[(Attach:)Lecture_Note02.pptx|pptx]]

* 3. Stacks - [[(Attach:)Lecture_Note03.pptx|pptx]]

* 4. Queue - [[(Attach:)Lecture_Note04.pptx|pptx]]

* 5. List - [[(Attach:)Lecture_Note05.pptx|pptx]]

* 6. Linked List - [[(Attach:)Lecture_Note06.pptx|pptx]]

* 7. Tree - [[(Attach:)Lecture_Note07.pptx|pptx]]

* 8. Binary Tree - [[(Attach:)Lecture_Note08.pptx|pptx]]

* 9. Heap - [[(Attach:)Lecture_Note09.pptx|pptx]]

* 10. Graph - [[(Attach:)Lecture_Note10.pptx|pptx]]

* 11. Sorting - [[(Attach:)Lecture_Note11.pptx|pptx]]

* 12. Hashing - [[(Attach:)Lecture_Note12.pptx|pptx]]

* 13. Binary Search Tree - [[(Attach:)Lecture_Note13.pptx|pptx]]

* 14. Red-Black Tree - [[(Attach:)Lecture_Note14.pptx|pptx]]

* 15. AVL Tree - [[(Attach:)Lecture_Note15.pptx|pptx]]

* 2. Performance - [[(Attach:)Lecture_Note02.pptx|pptx]]

* 3. Stacks - [[(Attach:)Lecture_Note03.pptx|pptx]]

* 4. Queue - [[(Attach:)Lecture_Note04.pptx|pptx]]

* 5. List - [[(Attach:)Lecture_Note05.pptx|pptx]]

* 6. Linked List - [[(Attach:)Lecture_Note06.pptx|pptx]]

* 7. Tree - [[(Attach:)Lecture_Note07.pptx|pptx]]

* 8. Binary Tree - [[(Attach:)Lecture_Note08.pptx|pptx]]

* 9. Heap - [[(Attach:)Lecture_Note09.pptx|pptx]]

* 10. Graph - [[(Attach:)Lecture_Note10.pptx|pptx]]

* 11. Sorting - [[(Attach:)Lecture_Note11.pptx|pptx]]

* 12. Hashing - [[(Attach:)Lecture_Note12.pptx|pptx]]

* 13. Binary Search Tree - [[(Attach:)Lecture_Note13.pptx|pptx]]

* 14. Red-Black Tree - [[(Attach:)Lecture_Note14.pptx|pptx]]

* 15. AVL Tree - [[(Attach:)Lecture_Note15.pptx|pptx]]

Changed lines 33-47 from:

* 1. Introduction - [[(Attach:)Lecture_Note01.~~pdf~~|~~pdf~~]]

* 2. Performance - [[(Attach:)Lecture_Note02.~~pdf~~|~~pdf~~]]

* 3. Stacks - [[(Attach:)Lecture_Note03.~~pdf~~|~~pdf~~]]

* 4. Queue - [[(Attach:)Lecture_Note04.~~pdf~~|~~pdf~~]]

* 5. List - [[(Attach:)Lecture_Note05.~~pdf~~|~~pdf~~]]

* 6. Linked List - [[(Attach:)Lecture_Note06.~~pdf~~|~~pdf~~]]

* 7. Tree - [[(Attach:)Lecture_Note07.~~pdf~~|~~pdf~~]]

* 8. Binary Tree - [[(Attach:)Lecture_Note08.~~pdf~~|~~pdf~~]]

* 9. Heap - [[(Attach:)Lecture_Note09.~~pdf~~|~~pdf~~]]

* 10. Graph - [[(Attach:)Lecture_Note10.~~pdf~~|~~pdf~~]]

* 11. Sorting - [[(Attach:)Lecture_Note11.~~pdf~~|~~pdf~~]]

* 12. Hashing - [[(Attach:)Lecture_Note12.~~pdf~~|~~pdf~~]]

* 13. Binary Search Tree - [[(Attach:)Lecture_Note13.~~pdf~~|~~pdf~~]]

* 14. Red-Black Tree - [[(Attach:)Lecture_Note14.~~pdf~~|~~pdf~~]]

* 15. AVL Tree - [[(Attach:)Lecture_Note15.~~pdf~~|~~pdf~~]]

* 2. Performance - [[(Attach:)Lecture_Note02.

* 3. Stacks - [[(Attach:)Lecture_Note03.

* 4. Queue - [[(Attach:)Lecture_Note04.

* 5. List - [[(Attach:)Lecture_Note05.

* 6. Linked List - [[(Attach:)Lecture_Note06.

* 7. Tree - [[(Attach:)Lecture_Note07.

* 8. Binary Tree - [[(Attach:)Lecture_Note08.

* 9. Heap - [[(Attach:)Lecture_Note09.

* 10. Graph - [[(Attach:)Lecture_Note10.

* 11. Sorting - [[(Attach:)Lecture_Note11.

* 12. Hashing - [[(Attach:)Lecture_Note12.

* 13. Binary Search Tree - [[(Attach:)Lecture_Note13.

* 14. Red-Black Tree - [[(Attach:)Lecture_Note14.

* 15. AVL Tree - [[(Attach:)Lecture_Note15.

to:

* 1. Introduction - [[(Attach:)Lecture_Note01.ppt|ppt]]

* 2. Performance - [[(Attach:)Lecture_Note02.ppt|ppt]]

* 3. Stacks - [[(Attach:)Lecture_Note03.ppt|ppt]]

* 4. Queue - [[(Attach:)Lecture_Note04.ppt|ppt]]

* 5. List - [[(Attach:)Lecture_Note05.ppt|ppt]]

* 6. Linked List - [[(Attach:)Lecture_Note06.ppt|ppt]]

* 7. Tree - [[(Attach:)Lecture_Note07.ppt|ppt]]

* 8. Binary Tree - [[(Attach:)Lecture_Note08.ppt|ppt]]

* 9. Heap - [[(Attach:)Lecture_Note09.ppt|ppt]]

* 10. Graph - [[(Attach:)Lecture_Note10.ppt|ppt]]

* 11. Sorting - [[(Attach:)Lecture_Note11.ppt|ppt]]

* 12. Hashing - [[(Attach:)Lecture_Note12.ppt|ppt]]

* 13. Binary Search Tree - [[(Attach:)Lecture_Note13.ppt|ppt]]

* 14. Red-Black Tree - [[(Attach:)Lecture_Note14.ppt|ppt]]

* 15. AVL Tree - [[(Attach:)Lecture_Note15.ppt|ppt]]

* 2. Performance - [[(Attach:)Lecture_Note02.ppt|ppt]]

* 3. Stacks - [[(Attach:)Lecture_Note03.ppt|ppt]]

* 4. Queue - [[(Attach:)Lecture_Note04.ppt|ppt]]

* 5. List - [[(Attach:)Lecture_Note05.ppt|ppt]]

* 6. Linked List - [[(Attach:)Lecture_Note06.ppt|ppt]]

* 7. Tree - [[(Attach:)Lecture_Note07.ppt|ppt]]

* 8. Binary Tree - [[(Attach:)Lecture_Note08.ppt|ppt]]

* 9. Heap - [[(Attach:)Lecture_Note09.ppt|ppt]]

* 10. Graph - [[(Attach:)Lecture_Note10.ppt|ppt]]

* 11. Sorting - [[(Attach:)Lecture_Note11.ppt|ppt]]

* 12. Hashing - [[(Attach:)Lecture_Note12.ppt|ppt]]

* 13. Binary Search Tree - [[(Attach:)Lecture_Note13.ppt|ppt]]

* 14. Red-Black Tree - [[(Attach:)Lecture_Note14.ppt|ppt]]

* 15. AVL Tree - [[(Attach:)Lecture_Note15.ppt|ppt]]

Deleted line 33:

Deleted line 34:

Deleted line 35:

Deleted line 36:

Deleted line 37:

Deleted line 38:

Deleted line 39:

Deleted line 40:

Deleted line 41:

Deleted line 42:

Deleted line 43:

Deleted line 44:

Deleted line 45:

Deleted line 46:

Added lines 34-61:

* 2. Performance - [[(Attach:)Lecture_Note02.pdf|pdf]]

* 3. Stacks - [[(Attach:)Lecture_Note03.pdf|pdf]]

* 4. Queue - [[(Attach:)Lecture_Note04.pdf|pdf]]

* 5. List - [[(Attach:)Lecture_Note05.pdf|pdf]]

* 6. Linked List - [[(Attach:)Lecture_Note06.pdf|pdf]]

* 7. Tree - [[(Attach:)Lecture_Note07.pdf|pdf]]

* 8. Binary Tree - [[(Attach:)Lecture_Note08.pdf|pdf]]

* 9. Heap - [[(Attach:)Lecture_Note09.pdf|pdf]]

* 10. Graph - [[(Attach:)Lecture_Note10.pdf|pdf]]

* 11. Sorting - [[(Attach:)Lecture_Note11.pdf|pdf]]

* 12. Hashing - [[(Attach:)Lecture_Note12.pdf|pdf]]

* 13. Binary Search Tree - [[(Attach:)Lecture_Note13.pdf|pdf]]

* 14. Red-Black Tree - [[(Attach:)Lecture_Note14.pdf|pdf]]

* 15. AVL Tree - [[(Attach:)Lecture_Note15.pdf|pdf]]

Changed lines 16-17 from:

(:cell valign=top :) ~~Lorem Ipsum~~

to:

(:cell valign=top :) Learn data structure, which is a way of collecting and organizing data in a computer to perform operations on the data efficiently

Changed line 32 from:

* 1. Introduction - [[(Attach:)Lecture_Note01.~~pptx~~|~~ppt~~]]

to:

* 1. Introduction - [[(Attach:)Lecture_Note01.pdf|pdf]]

Changed line 10 from:

(:cell valign=top :)~~ Rm~~ #23217 1st Engineering Bldg

to:

(:cell valign=top :) #23217 1st Engineering Bldg

Changed line 32 from:

* 1. Introduction - [[(Attach:)Lecture_Note01.~~ppt~~|ppt]]

to:

* 1. Introduction - [[(Attach:)Lecture_Note01.pptx|ppt]]

Changed lines 1-2 from:

!! ~~GEDB029~~: ~~Basis and Practice in Programming ~~(~~Fall 2018~~)

to:

!! SWE2015: Introduction to Data Structures (Spring 2019)

Changed line 8 from:

(:cell valign=top :) ~~13~~:~~30~~ - ~~14~~:~~45~~ (~~Monday~~), ~~12~~:~~00~~ - ~~13~~:~~15~~ (~~Wednesday~~)

to:

(:cell valign=top :) 12:00 - 13:15 (Tuesday), 13:30 - 14:45 (Thursday)

Changed line 10 from:

(:cell valign=top :) Rm #~~400112 (Monday), #400202 (Wednesday) Semiconductor~~ Bldg

to:

(:cell valign=top :) Rm #23217 1st Engineering Bldg

Changed line 16 from:

(:cell valign=top :) ~~Let's learn how to write software using C~~

to:

(:cell valign=top :) Lorem Ipsum

Changed line 19 from:

to:

Fundamentals of data structures in C (2nd Edition) by E. Horowitz

Changed lines 22-26 from:

* Attendance : ~~5~~%

*~~Lab Exercises ~~: ~~10~~%

*~~Individual Programming Assignments~~: 30%

*~~Team Programming Assignments~~: ~~15%~~

* Final Exam: 40%

*

*

*

* Final Exam: 40

to:

* Attendance : 10%

* Assignments : 30%

* Mid-term Exam: 30%

* Final Exam: 30%

* Assignments : 30%

* Mid-term Exam: 30%

* Final Exam: 30%

Changed lines 28-30 from:

* ~~이준호~~ (mailto:~~crow6316~~@gmail.com)

(:cellnr valign=top :) '''~~Programming Lab~~'''

(:cellnr valign=top :) '''

to:

* 이도현 (mailto:daumgen@gmail.com)

(:cellnr valign=top :) '''Lectures'''

(:cellnr valign=top :) '''Lectures'''

Changed lines 32-55 from:

* ~~PC LAB Rm #400202, Semiconductor Bldg 2nd Floor~~

(:~~cellnr valign=top :~~)~~ '''Homework'''~~

(:cell valign=top :)

* [[https://docs.~~google.com/presentation/d/1oP6MVCpbJmVf4vD4Nd6rWCTMWEuRN4jxHdP9bVDXurg/edit?usp=sharing~~|~~우분투 환경 구축 방법~~]]

(:cellnr valign=top :) '''Lectures'''

(:cell valign=top :)

* 1. Introduction - [[(Attach:)intro.ppt|ppt]]

* 2. C Overview - [[(Attach:)overview.ppt|ppt]]

* 3. Lexical Elements, Operators [[(Attach:)chap2_lexical.ppt|ppt]]

* 4. Data Types [[(Attach:)chap3_data_type.ppt|ppt]]

* 5. Flow of Control [[(Attach:)chap4_flow_control.ppt|ppt]]

* 6. reserved

* 7. Functions [[(Attach:)chap5_functions.ppt|ppt]]

* 8. Arrays and Strings [[(Attach:)chap5-2_functions.ppt|ppt]]

* 9. Pointers [[(Attach:)chap6_pointer.ppt|ppt]]

* 10. Bitwise Operations, Enumerations, Preprocessor [[(Attach:)chap7.ppt|ppt]]

* 11. Structures and Unions [[(Attach:)chap8_Structures.ppt|ppt]]

* 12. Input and Output [[(Attach:)chap9_IO.ppt|ppt]]

* 13. Object Orientation with Java

* 14. Final Exam

(:cell valign=top :)

* [[https://docs

(:cellnr valign=top :) '''Lectures'''

(:cell valign=top :)

* 1. Introduction - [[(Attach:)intro.ppt|ppt]]

* 2. C Overview - [[(Attach:)overview.ppt|ppt]]

* 3. Lexical Elements, Operators [[(Attach:)chap2_lexical.ppt|ppt]]

* 4. Data Types [[(Attach:)chap3_data_type.ppt|ppt]]

* 5. Flow of Control [[(Attach:)chap4_flow_control.ppt|ppt]]

* 6. reserved

* 7. Functions [[(Attach:)chap5_functions.ppt|ppt]]

* 8. Arrays and Strings [[(Attach:)chap5-2_functions.ppt|ppt]]

* 9. Pointers [[(Attach:)chap6_pointer.ppt|ppt]]

* 10. Bitwise Operations, Enumerations, Preprocessor [[(Attach:)chap7.ppt|ppt]]

* 11. Structures and Unions [[(Attach:)chap8_Structures.ppt|ppt]]

* 12. Input and Output [[(Attach:)chap9_IO.ppt|ppt]]

* 13. Object Orientation with Java

* 14. Final Exam

to:

* 1. Introduction - [[(Attach:)Lecture_Note01.ppt|ppt]]

Added lines 1-60:

!! GEDB029: Basis and Practice in Programming (Fall 2018)

!!! [General information]

(:table border=0 width=90% align=left :)

(:cellnr width=15% valign=top :) '''When:'''

(:cell valign=top :) 13:30 - 14:45 (Monday), 12:00 - 13:15 (Wednesday)

(:cellnr valign=top :) '''Where:'''

(:cell valign=top :) Rm #400112 (Monday), #400202 (Wednesday) Semiconductor Bldg

(:cellnr valign=top :) '''Instructor:'''

(:cell valign=bottom :) [[http://csl.skku.edu/People/joon|Joonwon Lee]]

[[http://csl.skku.edu|Computer Systems Laboratory]]

(:cellnr valign=top :) '''Course'''\\

'''Description:'''

(:cell valign=top :) Let's learn how to write software using C

(:cellnr valign=top :) '''Textbook:'''

(:cell valign=top :)

A Book on C: Programming in C (4th Edition) by Al Kelley and Ira Pohl

(:cellnr valign=top :) '''Grading:'''

(:cell valign=top :) (Subject to change)

* Attendance : 5%

* Lab Exercises : 10%

* Individual Programming Assignments: 30%

* Team Programming Assignments: 15%

* Final Exam: 40%

(:cellnr valign=top :) '''Teaching Assistants:'''

(:cell valign=top :)

* 이준호 (mailto:crow6316@gmail.com)

(:cellnr valign=top :) '''Programming Lab'''

(:cell valign=top :)

* PC LAB Rm #400202, Semiconductor Bldg 2nd Floor

(:cellnr valign=top :) '''Homework'''

(:cell valign=top :)

* [[https://docs.google.com/presentation/d/1oP6MVCpbJmVf4vD4Nd6rWCTMWEuRN4jxHdP9bVDXurg/edit?usp=sharing|우분투 환경 구축 방법]]

(:cellnr valign=top :) '''Lectures'''

(:cell valign=top :)

* 1. Introduction - [[(Attach:)intro.ppt|ppt]]

* 2. C Overview - [[(Attach:)overview.ppt|ppt]]

* 3. Lexical Elements, Operators [[(Attach:)chap2_lexical.ppt|ppt]]

* 4. Data Types [[(Attach:)chap3_data_type.ppt|ppt]]

* 5. Flow of Control [[(Attach:)chap4_flow_control.ppt|ppt]]

* 6. reserved

* 7. Functions [[(Attach:)chap5_functions.ppt|ppt]]

* 8. Arrays and Strings [[(Attach:)chap5-2_functions.ppt|ppt]]

* 9. Pointers [[(Attach:)chap6_pointer.ppt|ppt]]

* 10. Bitwise Operations, Enumerations, Preprocessor [[(Attach:)chap7.ppt|ppt]]

* 11. Structures and Unions [[(Attach:)chap8_Structures.ppt|ppt]]

* 12. Input and Output [[(Attach:)chap9_IO.ppt|ppt]]

* 13. Object Orientation with Java

* 14. Final Exam

(:tableend:)

(:tableend:)

!!! [General information]

(:table border=0 width=90% align=left :)

(:cellnr width=15% valign=top :) '''When:'''

(:cell valign=top :) 13:30 - 14:45 (Monday), 12:00 - 13:15 (Wednesday)

(:cellnr valign=top :) '''Where:'''

(:cell valign=top :) Rm #400112 (Monday), #400202 (Wednesday) Semiconductor Bldg

(:cellnr valign=top :) '''Instructor:'''

(:cell valign=bottom :) [[http://csl.skku.edu/People/joon|Joonwon Lee]]

[[http://csl.skku.edu|Computer Systems Laboratory]]

(:cellnr valign=top :) '''Course'''\\

'''Description:'''

(:cell valign=top :) Let's learn how to write software using C

(:cellnr valign=top :) '''Textbook:'''

(:cell valign=top :)

A Book on C: Programming in C (4th Edition) by Al Kelley and Ira Pohl

(:cellnr valign=top :) '''Grading:'''

(:cell valign=top :) (Subject to change)

* Attendance : 5%

* Lab Exercises : 10%

* Individual Programming Assignments: 30%

* Team Programming Assignments: 15%

* Final Exam: 40%

(:cellnr valign=top :) '''Teaching Assistants:'''

(:cell valign=top :)

* 이준호 (mailto:crow6316@gmail.com)

(:cellnr valign=top :) '''Programming Lab'''

(:cell valign=top :)

* PC LAB Rm #400202, Semiconductor Bldg 2nd Floor

(:cellnr valign=top :) '''Homework'''

(:cell valign=top :)

* [[https://docs.google.com/presentation/d/1oP6MVCpbJmVf4vD4Nd6rWCTMWEuRN4jxHdP9bVDXurg/edit?usp=sharing|우분투 환경 구축 방법]]

(:cellnr valign=top :) '''Lectures'''

(:cell valign=top :)

* 1. Introduction - [[(Attach:)intro.ppt|ppt]]

* 2. C Overview - [[(Attach:)overview.ppt|ppt]]

* 3. Lexical Elements, Operators [[(Attach:)chap2_lexical.ppt|ppt]]

* 4. Data Types [[(Attach:)chap3_data_type.ppt|ppt]]

* 5. Flow of Control [[(Attach:)chap4_flow_control.ppt|ppt]]

* 6. reserved

* 7. Functions [[(Attach:)chap5_functions.ppt|ppt]]

* 8. Arrays and Strings [[(Attach:)chap5-2_functions.ppt|ppt]]

* 9. Pointers [[(Attach:)chap6_pointer.ppt|ppt]]

* 10. Bitwise Operations, Enumerations, Preprocessor [[(Attach:)chap7.ppt|ppt]]

* 11. Structures and Unions [[(Attach:)chap8_Structures.ppt|ppt]]

* 12. Input and Output [[(Attach:)chap9_IO.ppt|ppt]]

* 13. Object Orientation with Java

* 14. Final Exam

(:tableend:)

(:tableend:)