新手老爸報到

2008/04/04
天氣: 晴

這天是個重要的日子! 在經歷過十幾個小時的等待, 漫長的孕期就要接近尾聲了!

下午四點, 老婆開始陣痛。

約五六分鐘後, 產房所有的護士全部圍在待產床, 我只能著急的從護士背後一探究竟, 因為發生胎兒窘迫的緊急狀況, 我只能在旁邊乾著急!

經過一番搶救 (一分鐘之內), 寶寶恢復心跳了。接著, 我被其中一個護士拉去旁邊簽手術同意書, 麻醉同意書, 另一個護士緊急聯絡醫生準備接生, 老婆則是被突如其來的一切嚇到哭了! 當我看到老婆被扶進開刀房, 回頭用哭紅的眼睛無助的望著我時, 我真的是心好痛! orz

從出狀況到到進開刀房整個過程大概在四到五分鐘內發生, 又快又突然! 之後的三十分鐘, 我只能在休息室裡著急的踱步。三十分鐘後, 聽到寶寶洪亮的哭聲, 寶寶從開刀房裡被抱出來, 全身紅通通的, 拼命的大哭, 心裡頓時輕鬆一些!



十分鐘之後, 老婆就被推出來在待產房裡恢復。看到她哭紅的雙眼, 疲累的表情, 加上術後麻醉未退的不自然抽搐, 讓我不禁紅了眼眶。

老婆, 妳辛苦了!

在不到一小時的期間, 我的心情就好像做大怒神一樣, 咻地降到谷底! 真的是太刺激了!!或許這就是當爸爸前的考驗吧! 提醒我肩上要扛的責任加重了!

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