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
Computer Engineering Articles
Found 352 articles
Matrix 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 Tester and SDET
In software quality assurance, Tester and SDET are two distinct roles with different skill sets and responsibilities. A Tester focuses on manual and functional testing, while an SDET combines development and testing skills to build automation frameworks and test software at a deeper level. Tester A software tester performs testing on the software to ensure it meets the required quality standards. A tester is responsible for checking if the software has bugs or defects and verifying that it performs as expected. A software tester is typically unaware of the application's internal code and development process, focusing on black-box ...
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 MoreDifference between RDBMS and HBase
RDBMS and HBase are both database management systems but designed for very different use cases. RDBMS uses tables with fixed schemas to represent data and their relationships. HBase is a column-oriented NoSQL database that runs on top of the Hadoop Distributed File System (HDFS), designed for handling massive amounts of data across distributed clusters. RDBMS (Relational Database Management System) RDBMS stores data in structured tables with rows and columns. It uses SQL for querying, enforces a fixed schema, and follows ACID properties (Atomicity, Consistency, Isolation, Durability) to ensure reliable transactions. RDBMS is best suited for structured data with ...
Read MoreDifference between RDBMS and OODBMS
RDBMS and OODBMS are two types of database management systems. RDBMS uses tables (rows and columns) to represent data and their relationships, whereas OODBMS represents data as objects, similar to Object Oriented Programming. Each approach has different strengths depending on the complexity of the data being managed. RDBMS (Relational Database Management System) An RDBMS stores data in structured tables (also called relations). Each table has rows (records) and columns (attributes). Tables are linked using primary keys and foreign keys. SQL is the standard language for querying and managing data in an RDBMS. OODBMS (Object Oriented Database Management ...
Read MoreDifference between OOP and POP
OOP (Object Oriented Programming) and POP (Procedural Oriented Programming) are two fundamental programming paradigms. OOP organizes code around objects and their interactions, while POP organizes code around functions and procedures. OOP (Object Oriented Programming) OOP deals with objects and their properties. A program is structured around objects that contain both data (attributes) and behavior (methods). The major concepts of OOP are − Class/Objects − Blueprints and instances Abstraction − Hiding implementation details Encapsulation − Bundling data with methods that operate on it Polymorphism − Same interface, different behavior Inheritance − Reusing code from parent classes ...
Read More