品諺週歲記事

2009/4/6
天氣: 陰

果真是光陰似箭、歲月如梭啊! 小鬼頭呱呱墜地的哭聲，聲猶在耳，現在已經一歲了! 從只會躺著等人餵奶，到現在只要一看到剛泡好的奶就會飛也似的衝到床上，躺著準備喝奶! 做爸爸的我真是欣慰啊!



4/4

四月四日是全國小朋友最高興的日子，我想也是我兒子最開心的日子，因為這是他的生日! 超級特別的日子! 在家過完農曆生日後，便移師到外公、外婆家過國曆生日。舅舅們和阿姨們也送了小鬼頭喜歡的禮物：電動哈雷機車和帥氣 PUMA 球鞋!

4/5

小鬼頭昨天很 high，很晚睡。但今天的他顯得很開心，很有精神! 好像聽得懂大人們在說什麼似的，也會指揮抱著他的大人們去他想去的方向，雖然他現在還在牙牙學語的初期。更令人驚喜的是，小鬼頭自己會站起來，而且走了三步才坐下去! 他開心的向我們展示，可愛的樣子，讓爸爸、媽媽好不開心啊! 感覺他又瞬間長大了不少!

後記

這一年來，心情上上下下的，也體會到為人父母的心情，啊! 真是百感交集啊!

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