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
-
Economics & Finance
MCA Articles
Page 86 of 95
Various Types of Keys in DBMS
The different types of keys in DBMS are − Candidate Key − The candidate keys in a table are defined as the set of keys that is minimal and can uniquely identify any data row in the table. Primary Key − The primary key is selected from one of the candidate keys and becomes the identifying key of a table. It can uniquely identify any data row of the table. ...
Read MoreBinary Relationship in Database
A Binary Relationship is a relationship between two different entities in a database. It maps the role group of one entity with the role group of another entity, establishing how data in one table relates to data in another table. There are three types of cardinalities for binary relationships − One-to-One (1:1), One-to-Many (1:N), and Many-to-Many (M:N). One-to-One (1:1) In a one-to-one relationship, one instance of the first entity is mapped with only one instance of the second entity. The primary key of one entity is available as a foreign key in the other entity. This type of relationship is ...
Read MoreTernary Relationship in Database
In a Ternary Relationship, three different entities participate in a single relationship simultaneously. The relationship degree is 3. When determining cardinality, we consider it in the context of two entities relative to the third. Example: Mobile Manufacturing Company Consider a mobile manufacturing company with three entities − Mobile − The mobile models manufactured by the company. Part − Mobile parts which the company gets from suppliers. Supplier − Suppliers who supply mobile parts to the company. All three entities participate simultaneously in a SUPPLIES relationship ...
Read MoreOne-to-One Unary Relationship in DBMS
A One-to-One Unary Relationship (also called a recursive relationship) is an association within the same entity where one instance is related to exactly one other instance of the same entity type. This type of relationship creates a loop back to the same entity, allowing instances to be connected to other instances of their own type. Understanding One-to-One Unary Relationships In a one-to-one unary relationship, we have a single entity that participates in a relationship with itself. The key characteristic is that each instance can be related to at most one other instance of the same entity, and vice ...
Read MoreMatrix Representation of Graphs
A graph can be represented using an Adjacency Matrix, which is a 2D array that stores the connection information between vertices. Adjacency Matrix An Adjacency Matrix A[V][V] is a 2D array of size V × V where V is the number of vertices in the graph. For an undirected graph, if there is an edge between Vx and Vy, then A[Vx][Vy] = 1 and A[Vy][Vx] = 1 (symmetric matrix). For a directed graph, if there is an edge from Vx to Vy, then only A[Vx][Vy] = 1. Otherwise the value is 0. Adjacency Matrix of an Undirected ...
Read MoreTheory of Inference for the Statement Calculus
To deduce new statements from the statements whose truth we already know, Rules of Inference are used. What are Rules of Inference for? Mathematical logic is often used for logical proofs. Proofs are valid arguments that determine the truth values of mathematical statements. An argument is a sequence of statements. The last statement is the conclusion and all its preceding statements are called premises (or hypotheses). The symbol "∴" (read "therefore") is placed before the conclusion. A valid argument is one where the conclusion follows from the truth values of the premises. Rules of Inference provide ...
Read MoreLine/Edge Covering
A covering graph is a subgraph which contains either all the vertices or all the edges corresponding to some other graph. A subgraph which contains all the vertices is called a line/edge covering. A subgraph which contains all the edges is called a vertex covering. Line Covering Let G = (V, E) be a graph. A subset C(E) is called a line covering of G if every vertex of G is incident with at least one edge in C, i.e., deg(V) ≥ 1 ∀ V ∈ G Because each vertex is connected with another vertex by ...
Read MoreTree or Connected acyclic graph
Trees are graphs that do not contain even a single cycle. They represent hierarchical structure in a graphical form. Trees belong to the simplest class of graphs. Despite their simplicity, they have a rich structure. Trees provide a range of useful applications as simple as a family tree to as complex as trees in data structures of computer science. Tree A connected acyclic graph is called a tree. In other words, a connected graph with no cycles is called a tree. The edges of a tree are known as branches. Elements of trees are called their ...
Read MoreDifference between ISO9000 and SEI-CMM.
ISO 9000 and SEI-CMM are both quality standards used to assess and improve organizational processes. ISO 9000 is a general-purpose quality management standard applicable across industries, while SEI-CMM is specifically designed for software organizations to measure process maturity. ISO 9000 ISO 9000 is an international standard for quality management and quality assurance, published by the International Organization for Standardization. It certifies that companies are documenting and following the quality system elements needed to run an efficient and quality-driven system. ISO 9000 is universally accepted across many countries and industries. The ISO 9000 family consists of several related ...
Read MoreDifference between Centralized Version Control and Distributed Version Control
Version control systems track changes to source code over time and allow multiple developers to collaborate. The two main models are Centralized Version Control (CVCS) and Distributed Version Control (DVCS), which differ in how they store history and handle collaboration. Centralized Version Control (CVCS) Centralized Version Control uses a client/server model where a single central server contains the complete history of the source code. Developers get a working copy from the server, make changes locally, and commit those changes back to the central server. Examples include SVN (Subversion) and CVS. Distributed Version Control (DVCS) Distributed Version ...
Read More