Search Topics....

Wednesday, May 30, 2012

Hot Swapping / Hot Plugging

What is hot Swapping ?
The below youtube clip demonstrates hot swapping  on a rack server.

Friday, May 18, 2012

Google comes with Knowledge Graph


Introducing the Knowledge Graph

When you search, you’re not just looking for a webpage. You’re looking to get answers, understand concepts and explore.
The next frontier in search is to understand real-world things and the relationships among them. So we're building a Knowledge Graph: a huge collection of the people, places and things in the world and how they're connected to one another.
This is how we’ll be able to tell if your search for “mercury” refers to the planet or the chemical element--and also how we can get you smarter answers to jump start your discovery.
courtesy : google.com

Lecturer in Computer Science in Kerala Collegiate Education


Gazette Date: 16/04/2012
Last Date: 16/05/2012
Category No: 02/2012
General Recruitment  (Statewide)
                 Applications must be submitted online through  the official website of the Commission after
'ONE TIME REGISTRATION'  .Candidates who have already registered can apply through their
profile. 
1 Department : Kerala Collegiate Education
2 Name of Post : Lecturer in Computer Science
3 Scale of Pay : U.G.C
4 No. of vacancies : 7 (Seven)
The above vacancies are now in existence. The list of selected candidates published by the
Commission in response to this notification shall remain in force for a minimum period of one year
provided that the said list will continue to be in force till the publication of a new list after the expiry of
the  minimum period of one year or till the expiry of three years whichever is earlier. Candidates will
be advised from the said list against the vacancies noted above and that may be reported to the
Commission in writing during the period of currency of the list.
5 Method of appointment : Direct Recruitment
6 Age : Age 22-40 Only candidates born between 02/01/1972 and01/01/1990 (both dates included) are eligible to apply for this post with usual relaxation to Scheduled Castes,Scheduled Tribes and other Backward Communities. (For other conditions regarding the age relaxation please see para 2 of the General Conditions)
7. Qualifications:
1 Master's Degree in the subject concerned with not less than 55% marks or its equivalent and
good academic record
2 Must have passed a comprehensive test in the subject concerned specifically conducted for
the purpose by U.G.C Or any agency duly constitutated by the state government in this
behalf. When qualification are being equal preference shall be given to those candidates who
possess adequate knowledge in malayalam.
Note(i) For SC/ST candidates minimum 50% marks for Master's Degree shall be sufficient(Go
(Ms)No2/07/HEdn dated 04/01/2007)
(ii) For PHD holders who have passed Master's Degree Prior to 19/09/1991 50% marks for
Master's Degree shall be sufficient(GO(MS)No.2/07/H/Edn Dated 04/01/2007)iii) Candidates who have obtained PhD Degree in the subject concerned or have passed Mphil
Degree in the  subject concerned by 31/12/1993 are exempted from passing the NET
examination GO(MS)No 86/07/HEdn dated 19/06/07, GO(P) No 123/02/H Edn dated
17/09/2002
(iv) For recruitment to various posts under these rule

Saturday, May 12, 2012

OSI Reference Model in Abstract Form

Courtesy : www.chrisgountanis.com for more info visithttp://www.chrisgountanis.com/written-works/76-osi-model.html

Monday, May 7, 2012

Banker's algorithm : Operating System

Banker's algorithm
The Banker's algorithm is a resource allocation and deadlock avoidance algorithm developed by Edsger Dijkstra that tests for safety by simulating the allocation of predetermined maximum possible amounts of all resources, and then makes a "safe-state" check to test for possible deadlock conditions for all other pending activities, before deciding whether allocation should be allowed to continue.

Why this name ?
The Banker's Algorithm derives its name from the fact that this algorithm could be used in a banking system to ensure that the bank does not run out of resources, because the bank would never allocate its money in such a way that it can no longer satisfy the needs of all its customers. By using the Banker's algorithm, the bank ensures that when customers request money the bank never leaves a safe state. If the customer's request does not cause the bank to leave a safe state, the cash will be allocated, otherwise the customer must wait until some other customer deposits enough.

How this works?
The Banker's algorithm is run by the operating system whenever a process requests resources. The algorithm avoids deadlock by denying or postponing the request if it determines that accepting the request could put the system in an unsafe state (one where deadlock could occur). When a new process enters a system, it must declare the maximum number of instances of each resource type that may not exceed the total number of resources in the system. Also, when a process gets all its requested resources it must return them in a finite amount of time.



Source Courtesy : Wikipedia

Wednesday, May 2, 2012

Software Engineering Notes

What is Brooks Law?
Adding more programmers to a late project may make it later.

Brooks has observed that the number of communication paths among programmers grows as n(n-1)/2 , where 'n' is the number of programmers on a project team. Thus increasing the number of team members from three to four to five increases the number of communication paths from three to six to ten.