Computer engineering Archives - Page 2 of 3

The Havel Hakimi Algorithm 3

Apr

4

2013

The Havel Hakimi algorithm gives a systematic approach to answer the question of determining whether it is possible to construct a simple graph from a given degree sequence. Take as input a degree sequence S and determine if that sequence is graphical That is, can we produce a graph with that degree sequence? ...

Tech Jargon

Apr

4

2013

Words Explanation Context A context is the contents of a CPU’s registers and program counter at any point in time. Process A process (also sometimes referred to as a task) is an executing/ running instance of a program. Threads Threads are lightweight processes that can run in parallel and share an address space (i.e., a ...

TCP Congestion control algorithm 1

Apr

4

2013

Re-transmissions, Timeouts and Duplicate Acknowledgements TCP is relegated to rely mostly upon implicit signals it learns from the network and remote host. TCP must make an educated guess as to the state of network and trust the information from the remote host in order to control the rate of data flow. A sender’s implicit ...

Spanning Trees

Apr

4

2013

Let G = (V, E) be a connected graph in which each edge (u, v) E has an associated cost C(u, v). A Spanning Tree for G is a subgraph of G that it is a free tree connecting all vertices in V. The cost of a spanning tree is the sum of costs on its edges. Minimum Spanning Tree An MST of G is a spanning tree of G having a minimum cost. ...

Serializability

Apr

4

2013

Basic Assumption – Each transaction preserves database consistency Thus, serial execution of set of transactions preserves database consistency. A (possibly concurrent) schedule is serializable if it os equivalent to serial schedule (say, Transaction T1 follows Transaction T2 or T2 follows T1) Different form of schedule equivalence gives rise to the notions of 1. ...

Recoverable and Cascadeless Schedules 36

Apr

4

2013

Recoverability A recoverable schedule is one where, for each pair of Transaction Ti and Tj such that Tj reads data item previously written by Ti the commit operation of Ti appears before the commit operation Tj . Suppose that the system allows T9 to commit immediately after execution of read(A) instruction.Thus T9 commit before T8 does. Now suppose that T8 fails ...

Normal Forms in Database

Apr

4

2013

INF A relation is in first normal form if the domain of each attributes contains only atomic values and value of each attribute contains only a single value from that hand. #Eliminate duplicative columns from the same table #Create separate table for each group of related data and identify each row with unique column(primary ...

Kernel mode and User mode

Apr

4

2013

Kernel mode In the kernel mode, the executing code has complete and unrestricted access to the underlying hardware. It can execute any CPU instruction and reference any memory address.Kernel mode is generally reserved for the lowest level, most trusted function of operating system. User mode In user mode, the executing code has no ability ...

Interrupts

Apr

4

2013

An interrupt is a signal to the processor emitted by hardware or software indicating an occurrence of an event that needs immediate attention.The processor responds by suspending its current activities, saving its state, and executing a small program called an interrupt handler (or interrupt service routine, ISR) to deal with the event. This interruption is temporary, and after ...

Floyd’s Algorithm for shortest path

Apr

4

2013

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 ...