2014年7月9日 星期三

Training Materials

The slides and other training materials can be downloaded here.

2014/7/10:

A. Paper presentation: "A Fifty-percent Rule to Minimize the Energy Consumption of PCM-based Storage Systems" Slides
B. Introduction to the Linux operating system Slides

2014/7/12:

Randy Pausch's talks:
  • A great talk on your life plan is HERE.
  • Another great talk on your time scheduling strategies and techniques is HERE

2014/7/14:

Programming HW1: 萬年曆
  • Write a Linux program that displays the days in a specified month.
  • Design your own beautiful console (text-mode) or GUI (graphic-mode, using Qt or gtk+) outputs to display the days!
  • Can you show important days with special color?
  • Can you keep notes in each day?
  • Can you brainstorm other interesting functions and implement them?
  • Example: You need to do similar things to Linux tool cal, just like this:
    (Reference: http://www.runeman.org/tips/linux/calcommand/terminal-calyr.png)
    http://www.runeman.org/tips/linux/calcommand/terminal-calyr.png
  • Programming language: C or C++ (use gcc or g++ compiler and GNU Make tool.)
  • Source code editor: Vim/Emacs. (Please do not use other tools.)
  • Contact any lecturers on questions or problems met: (replace AT with @ and DOT with . to find the real email addresses)
    • Po-Chun Huang: pchuang AT saturn DOT yzu DOT edu DOT tw
    • Ming-Chang Yang: riddle216 AT gmail DOT com
    • Che-Wei Tsao: bearman DOT sky AT gmail DOT com
  • Deadline: Each B.S. student will be required to demo at 2014/7/23, 3PM.

2014/7/23

  • Linux shell scripting basics: Slides
  • HW2 will be announced soon.   

2014/8/6

  • Linux development toolchain: Slides 
  • Homework Assignment 2: Binary Search Tree. Reference File
    • This assignment asks you to use C/C++ to implement the binary search tree structure, which supports insert, key query, delete, and inorder tree traversal operations. 
    • Your program should have three files, where "main.cpp" is provided by us and other two files "bst.cpp" and "bst.h" are written by yourself. The declaration of the binary search tree should be in "bst.h" and the implementation should be in "bst.cpp". Referring to the file "main.cpp" is a sample test program that will initialize and call your implementation of binary search tree.
    • After completing the implementation, please also write the corresponding "Makefile" that will automatically build your program.
    • Bonus: If you have already implemented binary search tree, try to realize red--black tree instead!
    • The deadline for this homework assignment is 2014/8/20. 

2014/8/27

  • Introduction to Version Control System: Slide