Article Categories
- All Categories
-
Data Structure
-
Networking
-
RDBMS
-
Operating System
-
Java
-
MS Excel
-
iOS
-
HTML
-
CSS
-
Android
-
Python
-
C Programming
-
C++
-
C#
-
MongoDB
-
MySQL
-
Javascript
-
PHP
Articles by Mahesh Parahar
Page 10 of 14
Difference between UMA and NUMA
UMA and NUMA are shared memory models. Multiprocessors are divided among these type of categories. In UMA, Uniform Memory Access, a single memory controller is used and it is applicable for general purpose applications and time sharing applications. In NUMA, Non-Uniform Memory Access, multi memory controllers are used. NUMA is suitable for real-time applications and time critical applications.Following are the important differences between UMA and NUMA.Sr. No.KeyUMANUMA1DefinitionUMA stands for Uniform Memory Access.NUMA stands for Non Uniform Memory Access.2Memory ControllerUMA has single memory controller.NUMA has multiple memory controllers.3Memory AccessUMA memory access is slow.NUMA memory accsss is faster than UMA memory.4BandwidthUMA has ...
Read MoreDifferences between Difference between getc(), getchar(), getch() and getche() functions
All of these functions are used to get character from input and each function returns an integer signifying the status code as well.Following are the important differences between getc(), getchar(), getch() and getche() functions.getc()getc() can read characters from any stream. Returns EOF on failure.Syntaxint getc(FILE *stream);getchar()getchar() can read characters from standard input only.Syntaxint getchar();getch()getch() can read characters from standard input but it does not use any buffer and returns immidately without waiting for enter key pressed.Syntaxint getch();getche()getche() behaves similar to getch() as it can read characters from standard input and it does not use any buffer and returns immidately without ...
Read MoreDifference between Application context and Beanfactory in Spring framework
Spring framework provides two IOC container for managing, configuring and manipulating beans. One is BeanFactory and the other is Application Context. The application context interface extends BeanFactory to enhance the functionality of BeanFactory. In new Spring versions, BeanFactory is replaced with ApplicationContext. But still, BeanFactory exists for backward compatibility. Spring version 2.0 and above, is used BeanPostProcessor extension point(Interface which provides some callback methods that we can implement to customize the instantiation logic, dependency-resolution logic and etc ). So, if you are using BeanFactory then some of the functionality such as AOP and transaction will not work without doing some extra configuration.Sr. No.KeyBeanfactoryApplication ...
Read MoreDifference between lazy and eager loading in Hibernate
Lazy and Eager are two types of data loading strategies in ORMs such as hibernate and eclipse Link. These data loading strategies we used when one entity class is having references to other Entities like Employee and Phone (phone in the employee). Lazy Loading − Associated data loads only when we explicitly call getter or size method.Use Lazy Loading when you are using one-to-many collections.Use Lazy Loading when you are sure that you are not using related entities. Egare Loading − Data loading happens at the time of their parent is fetched. Use Eager Loading when the relations are not too much. Thus, ...
Read MoreTypes of Relations
The Empty Relation between sets X and Y, or on E, is the empty set ∅The Full Relation between sets X and Y is the set X × YThe Identity Relation on set X is the set { (x, x) | x ∈ X }The Inverse Relation R' of a relation R is defined as − R' = { (b, a) | (a, b) ∈ R }Example − If R = { (1, 2), (2, 3) } then R' will be { (2, 1), (3, 2) }A relation R on set A is called Reflexive if ∀ a ∈ A ...
Read MoreSum of Degrees of Vertices Theorem
If G = (V, E) be a non-directed graph with vertices V = {V1, V2, …Vn} thenn ∑ i=1 deg(Vi) = 2|E|Corollary 1If G = (V, E) be a directed graph with vertices V = {V1, V2, …Vn}, thenn ∑ i=1 deg+(Vi) = |E| = n ∑ i=1 deg−(Vi)Corollary 2In any non-directed graph, the number of vertices with Odd degree is Even.Corollary 3In a non-directed graph, if the degree of each vertex is k, thenk|V| = 2|E|Corollary 4In a non-directed graph, if the degree of each vertex is at least k, thenk|V| = 2|E|Corollary 5In a non-directed graph, if the ...
Read MoreRooted and Binary Tree
Rooted TreeA rooted tree G is a connected acyclic graph with a special node that is called the root of the tree and every edge directly or indirectly originates from the root. An ordered rooted tree is a rooted tree where the children of each internal vertex are ordered. If every internal vertex of a rooted tree has not more than m children, it is called an m-ary tree. If every internal vertex of a rooted tree has exactly m children, it is called a full m-ary tree. If m = 2, the rooted tree is called a binary tree.Binary ...
Read MoreRepresentation of Relations using Graph
A relation can be represented using a directed graph.The number of vertices in the graph is equal to the number of elements in the set from which the relation has been defined. For each ordered pair (x, y) in the relation R, there will be a directed edge from the vertex ‘x’ to vertex ‘y’. If there is an ordered pair (x, x), there will be a self- loop on vertex ‘x’.Suppose, there is a relation R = { (1, 1), (1,2), (3, 2) } on set S = { 1, 2, 3 }, it can be represented by the following graph −
Read MoreRepresentation of Graphs
There are mainly two ways to represent a graph −Adjacency MatrixAdjacency ListAdjacency MatrixAn Adjacency Matrix A[V][V] is a 2D array of size V × V where $V$ is the number of vertices in a undirected graph. If there is an edge between Vx to Vy then the value of A[Vx][Vy]=1 and A[Vy][Vx]=1, otherwise the value will be zero. And for a directed graph, if there is an edge between Vx to Vy, then the value of A[Vx][Vy]=1, otherwise the value will be zero.Adjacency Matrix of an Undirected GraphLet us consider the following undirected graph and construct the adjacency matrix −The ...
Read MoreRelations of a Set
Relations may exist between objects of the same set or between objects of two or more sets.Definition and PropertiesA binary relation R from set x to y (written as xRy or R(x, y)) is a subset of the Cartesian product x × y. If the ordered pair of G is reversed, the relation also changes.Generally an n-ary relation R between sets A1, ... ,\ and\ An is a subset of the n-ary product A1 × ... × An. The minimum cardinality of a relation R is Zero and the maximum is n2 in this case.A binary relation R on a ...
Read More