Coddicted - Page 34 of 35 - Codes.Notes.Tutorials.

Floyd’s Algorithm for shortest path

Floyd's Algorithm for shortest path
Based on Dynamic Programming   It is a graph analysis algorithm for finding shortest paths in a weighted graph with positive or negative edge(but without negative cycle)(shortest path between all pairs) The single execution of the algorithm will find the lengths(summed weights) of the shortest paths between all pairs of vertices. though it does not ...

C Calling convention and stack

The formal arguments and local variables are defined inside a function are created at a place in memory called ‘stack’.When the control returns from the function the stack is cleaned up either by the ‘Calling function’ or by the ‘Called function’, which would do this is decided by the calling convention. Standard calling convention in ...

Timestamp Based Protocol

Timestamps With each transaction Ti in the system, we associate a unique fixed timestamp, denoted by TS (Ti ). This timestamp is assigned by the database system before the Transaction Ti starts execution. If a transaction Ti has been assigned timestamp TS(Ti) and a new transaction Tj enters the system, then TS(Ti )

Tree Based Protocol 2

Tree Based Protocol
Only exclusive locks are allowed The first lock by Ti may be on any data item. Subsequently a data item Q can be locked by Ti only if the parent of Q is currently locked by Ti Data items may be unlocked at any time. A data item that has been locked and unlocked by ...

Graph Based Protocol

It impose partial ordering on the set D ={d1, d2, d3, …, dn} of all data items. If di -> dj , then any transaction accessing both di and dj must access di before accessing dj it implies that the set D may now be viewed as directed acyclic graph. Back To Top

Lock Based Protocol 2

Lock Based Protocol
A lock is a mechanism to control concurrent access to a data item. Data items can be locked in two modes 1. Exclusive(X) mode: Data item can be both read as well as written. X-lock is requested using lock-x instruction. 2. Shared(S)-mode: Data item can only be read. S-lock is requested using lock-s instruction Lock ...

Concurrency Control

Concurrency control in Database management systems ensures that database transactions are performed concurrently without violating the data integrity of the respective databases. Thus concurrency control is an essential element for correctness in any system where two database transactions or more, executed with time overlap, can access the same data, e.g., virtually in any general-purpose database ...

Cache Memory

A cache is a component that transparently stores data so the future requests for the data can be served faster.The data that is stored within a cache, might be values that have been computed earlier or duplicates of the original values that are stored elsewhere. Cache Hit, Cache Miss If requested data is contained in ...

Addressing Modes 1

Various Addressing modes as used in Computer Architecture: Register ADD R1,R2 ,R3 means : R1 comments : used when a value is in register Immediate ADD R1, R2 , 1 means : R1 comment : used when a constant is needed Direct ADD R1 , R2 , (100) means : R1 comment : used to ...

Change Boot Order – Ubuntu and Windows 7

Description : So you have a dual booting (Ubuntu and Windows) system?? Here is how to change the default OS when dual booting Ubuntu (10.10) and Windows 7 Note: applicable when GRUB is default boot loader Solution: 1. Open terminal. 2. cd /boot/grub 3. sudo gedit grub.cfg(menu.lst for previous versions) 4. provide password. 5. You’ll ...