What beeps show between different BIOS

AMI

1短音　　　　　　　 DRAM復新失敗
1長音3短音音　　　　DRAM錯誤
1長音8短音　　　　　顯示測試失敗
2短音　　　　　　　 DRAM同位檢測失敗
3短音　　　　　　　 基本64K RAM測試失敗
4短音　　　　　　　 系統時鐘錯誤
5短音　　　　　　　 CPU處理器錯誤
6短音　　　　　　　 主機板鍵盤控制器錯誤
7短音　　　　　　　 CPU中斷錯誤
8短音　　　　　　　 顯示卡記憶體寫入/讀取錯誤
9短音　　　　　　　 ROM BIOS檢查碼錯誤
10短音　　　　　　　CMOS 關機暫存器寫入/讀取錯誤
11短音　　　　　　　快取記憶體故障

Award

1短音　　　　　　　 系統啟動正常
2短音　　　　　　　 CMOS設定錯誤
1長音1短音　　　 　DRAM或主機板錯誤
1長音2短音　　　 　顯示錯誤(顯示器或顯示卡)
1長音3短音　　　 　鍵盤控制器錯誤
1長音9短音　　　 　主機板Flash RAM或EPROM錯誤(BIOS損壞)
不斷地響(長音)　　 DRAM沒插好或損壞
不斷地響　　　　 　電源,顯示器未和顯示卡連接好
重覆短響　　　　　 電源有問題

Phoenix

1短　　　　　　　系統啟動正常
1短1短1短 　　 　系統開機初始化失敗
1短1短2短　　　 主機板錯誤
1短1短3短　　　 CMOS或電池失效
1短1短4短 　　　 ROM BIOS校驗錯誤
1短4短3短　　 　 EISA時序器錯誤
1短3短1短　　 　 RAM復新錯誤
3短1短2短 　　 　主DMA暫存器錯誤
3短1短3短　　　 主中斷處理暫存器錯誤
3短2短4短　 　　 主機板鍵盤控制器錯誤
3短4短2短 　 　　顯示錯誤(顯示器或顯示卡)
4短2短2短　　 　 關機錯誤
4短4短1短 　　 　串列埠錯誤
4短4短2短 　　 　並列埠錯誤

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