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
Computer Engineering Articles
Page 29 of 36
Metropolitan Area Networks (MAN)
A Metropolitan Area Network (MAN) is a network with a size greater than a LAN but smaller than a WAN. It normally comprises networked interconnections within a city that also offers a connection to the Internet. A MAN typically covers a geographical area ranging from 5 to 50 kilometers, making it ideal for connecting multiple offices, campuses, or buildings across a city. Distinguishing Features of MAN Network size − Generally ranges from 5 to 50 km. It may be as small as a group of buildings in a campus to as large as covering an entire ...
Read MoreLocal Area Networks
A Local Area Network (LAN) is a private network that connects computers and devices within a limited area like a residence, an office, a building, or a campus. On a small scale, LANs are used to connect personal computers to printers. However, LANs can also extend to a few kilometers when used by companies, where a large number of computers share a variety of resources like hardware (e.g., printers, scanners, audiovisual devices), software (e.g., application programs), and data. Distinguishing Features of LAN Limited geographic scope − Network size is limited to a small geographical area, presently ...
Read MoreBasic Network Hardware
The basic computer hardware components that are needed to set up a network are as follows. Each device plays a specific role in enabling communication between computers and other devices on the network. Network Cable NIC Switch Router Gateway Internet ...
Read MoreMathematical Logical Terms and Definitions
Tautologies A Tautology is a formula which is always true for every value of its propositional variables. Example − Prove [ (A → B) ∧ A ] → B is a tautology The truth table is as follows − A B A → B (A → B) ∧ A [ (A → B) ∧ A ] → B True True True True True True False False False True False True True False True False False True False True As we can see every value ...
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 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 More