國小母校

我的國小母校，桃園縣立成功國小，一所建立幾十年的老學校，據說在日據時代就已存在了。我媽、我老姐、我老婆和我都是校友!

雖然離家裡很近，但畢業後 2x 年都沒回去過幾次! 但，在小朋友二歲多的今天 (2010/8/28)，跟老婆心血來潮，一起帶著小孩再度重回母校，看看 2x 年後的校園有了哪些改變!

進了校門後，我不自覺的將牽著的老婆的手握得更緊。一家人緩緩的進行校園巡禮後，我發現除了活動中心和行政大樓還在之外，其它的教舍都不復當年了! (OS: 2x 年不變的學校，很難吧!)

我還依稀記得當年的動物園座落在校園的哪個角落! 我還得當時蒸便當的位置在哪裡! 我還記得大象溜滑梯在哪棟大樓的後面! 我還記得賣著好吃的千力麵和涼麵的福利社，擠得水洩不通的樣子!
伴著垃圾場惡臭的側門外，有一個小雜貨店已不復存在! 揚著黃沙的操場已被 PU 跑道和場地取代! 第二排及第三排教舍已變成一片小朋友的樂園，滿是遊樂設施!

啊! 那個水泥做的斑馬還在! 只是少了支耳朵。水泥做的獅子也還在，只是不復當年的威風! 花豹和小鹿斑駁不堪! 大概只有駱駝才可以和斑馬一樣，清晰可辨!

我想，當年的班導師應該都退休了吧? 幾個曾經帶個的班導師，都讓我留下深刻的印象! 我老婆訝異著她早已忘懷多時的事物，我竟一路一一描述著當年的狀況! 或許，這是我少少的長處之一吧!

短短的 1.5 個小時，卻像是走回時光隧道那般的回味無窮! 我想我以後會常帶小朋友回來這裡走走，到操場跑跑，在他的童年裡回味著自己的童年!

Comments

Post a Comment

Popular posts from this blog

How to show only month and year fields in android Date-picker?

Image
Android default DatePicker show day/month/year fields but you have to customize this DatePicker as your requirements. Suppose that you want to show only month and year fields in android datepicker . To do this, you have to customize the Dialog DatePicker source code but it is not an easy task. In this tutorial I will show you a tricky way to solve this problem. Lets see how to show only month and year field in android DatePicker as a dialog.   Step to show only month and year fields in android date-picker: Some days ago I got this same problem and here I am trying to explain this in a sequential manner. I want to show a dialog datepicker when user click on an EditText. So if user click on EditText, A dialog datepicker will be invocked and it will show only month and year fields. To do this, at first we have to create a xml layout to hold the EditText fields. So create an android project and name it DatePickerExample. In the main.xml file just try to write this simple code....
Read more

How to construct a B+ tree with example

Image
A B+ tree contains n-1 search key values K1K2…….Kn-1 and have n pointers.   In a B+ tree the data are ordered  sequentially.  The leaf node may hold up to n pointers and must hold at least N/2 pointers. The root node must hold at least two pointers, unless the tree consists of only one node.  Now we construct a B+ tree. Construct a B+ tree for the following set of key values: (2,3,5,7,11,17,19,23,29,31) Assume that the tree is initially empty and values are added in ascending order. Construct a B+ tree where the pointer number is Four. Solution: When a node exceeds n-1 search key value then we split it into two nodes. First node contains (ceiling(n-1)/2) values.  2 nd node contains remaining node. Copy the smallest search key value of the second node to the parent node. Let's start, we know each node has N pointer and has N-1 search key values. In our example pointer number is 4, so the search key value is 4-1=3. So each node has 4 pointers and 3 search key val...
Read more

Conflict Serializability in database

Image
To maintains database state consistency we introduce serializability. Using serializability we can understand which schedule will ensure consistency, and which schedule will not. When we are capable of converting a concurrent schedule into a serial schedule then we cal it serializable schedule. A schedule is serializable if it is equivalent to a serial schedule. We divided this concepts into two parts 1. Conflict serializability  & 2. View serializability In this discussion I just clarify you the conflict serializability. Consider two instruction read, write and the data item A and B. When two instruction execute different data item such as read(A) and read(B), then we can swap the instruction without affecting the result of the schedule. But when the data item is equivalent to one another we need to consider following four condition.    a.   read (A ),    read ( A ).   they   don’t conflict.    b.   read ( Q),  ...
Read more