Institute of Information Science - University of Miskolc - tanszek:oktatas:techcomm

base64_coding

Anonymous (anonymous@undisclosed.example.com) — 2024-10-07T11:29:01+00:00

Base-64 Encoding Multipurpose Internet Mail Extensions (MIME) is the official format for internet emails. Emails are transmitted to recipients via the SMTP (Simple Mail Transfer Protocol), which only supports the transfer of 7-bit ASCII characters. To handle binary data in email attachments, the MIME standard provides several encoding methods, one of the most common being

basics_of_the_hypertext_markup_language

Anonymous (anonymous@undisclosed.example.com) — 2025-09-15T15:52:55+00:00

HTML (HyperText Markup Language) XML, a structured data description language XML (eXtensible Markup Language) is a universal data description language readable by both humans and machines, used for structured data storage and transfer. Example: Alice Bob Reminder Meeting at 2 PM in office II.

bcd_encoding

Anonymous (anonymous@undisclosed.example.com) — 2025-10-27T18:53:01+00:00

BCD (Binary-Coded Decimal) Encoding Binary-Coded Decimal (BCD) is a class of binary encodings in which each decimal digit is represented by its own binary sequence. In BCD, the binary form of a decimal number is encoded such that a 4-bit binary number represents each digit$ R = \frac{H_{\text{max}} - H}{H_{\text{max}}} $$H_{\text{max}}$$H$$$ H_{\text{max}} = \log_2(16) = 4\ \text{bits per symbol} $$$$ H = \log_2(10) \approx 3.3219\ \text{bits per symbol} $$$$ R = \frac{4 - 3.3219}{4} = 0…

bn_formulas

Anonymous (anonymous@undisclosed.example.com) — 2025-11-25T07:50:56+00:00

How Can We Define Languages in Computer Science? Several scientific methods have been developed to precisely define the syntactic rules of languages. Backus-Naur Form (BNF): A meta-language used to describe the syntax of languages. meta-symbol ${expression}_{min}^{max}$$$ ::= | \\ ::=\{\}_3^3 − \{\}_3^3 \\ ::=\{\}_2^2 − \{\}_2^2 − \{\}_3^3 \\ ::=A|B|C...|Z \\ ::=0|1|2|3|4|5…

breaking_rsa

Anonymous (anonymous@undisclosed.example.com) — 2024-11-26T08:23:51+00:00

Breaking RSA The weak point of the RSA algorithm lies in the key generation: specifically, the difficulty of factoring $ N $ into its prime components. This factorisation is only possible through trial and error, and the algorithm remains secure until someone discovers a heuristic method to do it efficiently.$ p $$ q $$ N = 77 $$ p $$ q $$ N $$ N $$ (e, N) $$ e = 17 $$ N = 55 $$ d $$ N $$ p $$ q $$ N = 55 $$ p = 5 $$ q = 11 $$ N $$ p $$ q $$ \phi(N) $…

cascading_style_sheets

Anonymous (anonymous@undisclosed.example.com) — 2024-10-01T10:32:12+00:00

CSS (Cascading Style Sheets) 1. What is CSS? Cascading Style Sheets (CSS) is a fundamental technology used in web development to control the formatting and layout of HTML documents. While HTML provides the structure and content of a web page, CSS allows developers to apply styles, such as colors, fonts, spacing, and positioning, to create visually appealing and user-friendly interfaces.

character_encoding

Anonymous (anonymous@undisclosed.example.com) — 2024-11-18T20:15:10+00:00

Character Encoding Creating a unified code for characters is a significant achievement in technical communication. The American Standards Institute initially standardized a 7-bit code, known as ASCII (American Standard Code for Information Interchange). This code includes the 26 uppercase and lowercase letters of the English alphabet, digits, punctuation marks, and so-called

code

Anonymous (anonymous@undisclosed.example.com) — 2025-10-06T20:50:51+00:00

Code The mapping of events to messages is called encoding. Messages are recorded in information storage units. The recorded message itself is an event system. Encoding is a transformation, based on the mutual and unambiguous correspondence between two event systems.$$ N = 2^n $$$$ N = m^n $$

coding

Anonymous (anonymous@undisclosed.example.com) — 2024-10-08T06:01:24+00:00

Huffman codes A lossless compression algorithm that assigns shorter binary codes to more frequent symbols and longer codes to less frequent ones, optimizing the average code length. Reed-Solomon codes These error-correcting codes are used to detect and fix burst errors in data transmission or storage by working on symbols, not just bits.

combinatorics_exercises

Anonymous (anonymous@undisclosed.example.com) — 2024-10-29T10:29:37+00:00

Combinatorics Exercises * An assembly plant wants to hire 5 male and 6 female workers. 6 men and 8 women apply for the job. How many ways can the desired workers be selected? (168) * A box contains 30 parts numbered from 1 to 30. How many ways can we select 6 parts such that among them there are 3 parts with specific numbers? $A$$B$$B$$1, 3, 5, 7, 9$$MATHEMATICS$$0, 1, 2$$\{0, 1, 2, 3, 4, 5, 6, 7, 8, 9\}$$red$$white$$green$$blue$$red$$white$$black$

conditional_probability_and_information_theory

Anonymous (anonymous@undisclosed.example.com) — 2025-11-10T18:56:28+00:00

Conditional Probability and Information Theory Exercises Related theory: Lecture 2: Information Processing * What is the probability of rolling an odd number with a fair dice? How many bits of information does the statement $\text{"we roll an odd number with a fair dice"}$ contain? (p=0.5; I=1 bit) * We roll two identical dice twice. What is the probability that we first roll at least one 3, and then immediately roll a 2 and a 3 at the same time (one die shows 2 and the other 3)? $\tex…

conditional_probability

Anonymous (anonymous@undisclosed.example.com) — 2024-10-13T17:27:52+00:00

Conditional probability Non-independent events How can we calculate the result when two events are not independent? If one event occurs, it will directly affect the probability of the other event. If events A and B are complex events that will not exclude each other, we have a so-called conditional probability (event A affects event B).$p(A | B) $$$ p(A|B) = \frac{k_{AB}}{k_b} = \frac{\frac{k_{AB}}{k}}{\frac{k_{B}}{k}} = \frac{p(A \cap B)}{p(B)} $$$$ p(A \cap B) = p(A|B) p(B) $$\( p(A \cap …

crypography

Anonymous (anonymous@undisclosed.example.com) — 2024-10-07T18:24:00+00:00

Cryptography A field focusing on secure communication, ensuring confidentiality, authenticity, and data integrity. Methods like AES, RSA, and digital signatures are used to encrypt data, authenticate users, and detect tampering Diffie-Hellman Key Exchange A cryptographic protocol that allows two parties to securely create a shared secret key over a public channel, relying on the difficulty of solving discrete logarithms.

cryptography

Anonymous (anonymous@undisclosed.example.com) — 2024-10-07T11:46:13+00:00

Cryptography The word cryptography comes from the Greek words κρυπτός (kryptós), meaning “hidden,” and γράφειν (gráphein), meaning “writing.” Its original meaning is “secret writing.” Cryptography has evolved into a distinct field, primarily within computer science, that deals with creating encryption (secret codes) and their decryption (breaking these codes).$E()$$D()$$D()$$E()$

data

Anonymous (anonymous@undisclosed.example.com) — 2025-11-24T18:32:01+00:00

Data Data is a subset of encoded information that holds independent meaning. - Data has meaning and is created through abstraction. - Data represents a system model’s state variable in the model. - The original sources of data are observations and measurements of state indicators in physical systems.

diffie-hellman_key_exchange

Anonymous (anonymous@undisclosed.example.com) — 2024-10-07T13:07:14+00:00

Diffie-Hellman Key Exchange Algorithm The Diffie-Hellman key exchange is a cryptographic protocol that allows two parties, traditionally referred to as Alice and Bob, to securely exchange a shared secret key over a public communication channel. This key can then be used to encrypt further communications between them. The security of this method is based on the difficulty of solving discrete logarithms in modular arithmetic.$ A = g^a \mod N $$ B = g^b \mod N $$ A $$ B $$$ M = B^a \m…

digital_signature_with_hash_code

Anonymous (anonymous@undisclosed.example.com) — 2024-10-07T15:50:15+00:00

Digital Signature Using Hash Functions A hash function acts like a digital fingerprint for a document. The function ensures that the hash code is varied enough for any given document. But how does digital signing work with this process? Steps: 1. $ y = H(x) $$ x $$ y $

digital_signature

Anonymous (anonymous@undisclosed.example.com) — 2024-10-07T15:19:20+00:00

Digital Signature To laypeople, a digital signature might suggest that an assistant scans their boss's signature into an image file, which can then be easily inserted into documents when needed. Unfortunately, this method could lead to serious legal consequences if used in such a way. In reality, a

dtd

Anonymous (anonymous@undisclosed.example.com) — 2025-12-02T08:01:22+00:00

DTD (Document Type Definition) In simple cases, DTD is used to describe the syntax of a data structure stored in XML. This DTD can be saved in a file with a .dtd extension, but it can also be part of the XML document itself. Basic Properties of DTD

encoding_integers

Anonymous (anonymous@undisclosed.example.com) — 2024-09-30T18:54:28+00:00

Integer representations We have a byte, which consists of 8 bits. What integers can be represented using a byte? The answer depends on how we interpret the bits. With 8 bits, we have $ 2^8 = 256 $ different possible combinations, so 256 different values can be stored.

encoding_techniques

Anonymous (anonymous@undisclosed.example.com) — 2025-11-23T18:43:41+00:00

Encoding Techniques Encoding techniques are methods used to convert data into a specific format for efficient storage, transmission, or processing. These techniques are widely applied in fields such as telecommunications, data storage, and information security to optimize performance and ensure data integrity. $\leq$$\leq$$\leq$$\leq$

error_detection_and_correction

Anonymous (anonymous@undisclosed.example.com) — 2025-10-28T08:30:16+00:00

Elias-style block protection Elias-style block protection uses horizontal and vertical control bits. It should be used if the protected data can be written in matrix form. During the decoding process, the logical values of the equations are examined both individually and combined.$m$$r$$$ n = m + r $$$r$$$ 2^r \ge m + r + 1 $$$m$$r$$n = m + r$

examination_questions

Anonymous (anonymous@undisclosed.example.com) — 2025-12-12T10:01:03+00:00

1. The three types of sciences: inductive, deductive, and reductive. An overview of the scientific method. Understand the differences between inductive (from observation to generalization), deductive (from axioms to conclusions), and reductive (breaking down complex phenomena). Be able to outline the general steps of the scientific method.

fixed-point_number_representation

Anonymous (anonymous@undisclosed.example.com) — 2024-09-30T18:41:34+00:00

Fixed-Point Number Representation Definition: Fixed-point number representation represents real numbers, where the integer and fractional parts are represented with a fixed number of digits. The term fixed point suggests a specific and unchanging position for the decimal point (or $\frac{1}{100}$$\frac{1}{100}$

floating-point_representation

Anonymous (anonymous@undisclosed.example.com) — 2025-10-14T16:43:37+00:00

Floating-Point Representation Floating-point representation is used to store real numbers, especially when dealing with very large or very small values. It approximates real numbers in a way that balances precision and range. The IEEE 754 Standard $$ \text{value} = (-1)^S \times 1.M \times 2^{(E - \text{Bias})} $$$$ 1010.01 = 1.01001 \times 2^3 $$$$ 0 | 10000010 | 01001000000000000000000 $$

formulas_for_mathematical_exercises

Anonymous (anonymous@undisclosed.example.com) — 2024-10-15T18:47:03+00:00

Cheatsheet for Math Exercises Probability and Conditional Probability Notation Value Formula $$P(A)$$ Probability of event A occuring. $$P(A) = \frac{\text{Number of favorable outcomes for } A}{\text{Total number of possible outcomes}}$$ $$P(A \mid B)$$ Conditional probability of event A occurring, given that event B has occurred. $$P(A \mid B) = \frac{P(A \cap B)}{P(B)}$$ $$P(A \cap B)$$ Probability of both events A and B occurring. $$P(A \cap B) = P(A) \cdot P(B \mid A)$$$$P(A \…

hash_functions

Anonymous (anonymous@undisclosed.example.com) — 2024-10-07T15:31:03+00:00

Hash Functions One major drawback of plain RSA is that the document itself is the signature. How can we separate the signature from the document? For this purpose, hash functions are introduced. Characteristics of Hash Functions (requirements) - Fixed-length output$ x $$ y $$ y = H(x) $$ x $$ x' $$ H(x) = H(x') $$ H(x) $\[ 4531^2 = 20529961 \]\[ 2061^2 = 4247721 \]\[ \text{md5}(1234) = 81dc9bdb52d04dc20036dbd8313ed055 \]\[ \text{md5}(1234 + \text{salt}) = 0e0db19d64ce23edc…

huffman_codes

Anonymous (anonymous@undisclosed.example.com) — 2024-10-07T07:53:02+00:00

Huffman codes Huffman encoding is a lossless data compression algorithm that compresses data by assigning shorter codes to more frequent symbols and longer codes to less frequent ones. It is based on the frequency of a symbol's occurrence in the input data. This method is optimal because it produces the smallest possible average code length.

information_-_basics

Anonymous (anonymous@undisclosed.example.com) — 2025-09-08T18:58:34+00:00

Sciences Explains different types of sciences—inductive, deductive, and reductive—and their respective logical methods. It highlights how these approaches are applied in fields like physics, mathematics, and technical sciences. ---------- Scientific method Outlines the steps of the scientific method: observation, defining the problem, formulating a hypothesis, making predictions, conducting experiments, and verifying results. It emphasizes the importance of falsifiability, reproducibility, a…

information_-_processing

Anonymous (anonymous@undisclosed.example.com) — 2025-09-30T04:41:22+00:00

Statistical properties of Information This section explains statistical properties in terms of event spaces and event frequencies. It covers how events in probability theory are analyzed, how their frequencies help determine probabilities, and how different event combinations (e.g., independent and mutually exclusive events) affect total probability.

information

Anonymous (anonymous@undisclosed.example.com) — 2025-10-14T06:25:49+00:00

Information Experience shows that the information value of certain news depends on their probability. $$ I_{E_i} = f(P_i) $$ in which $ I_{E_i} $ means the information value. In this aspect the more unexpected or unlikely (rumour) a news is the bigger it's news value. So the $f$ function was selected according to Shannon's suggestion:$$ I_E = \log_2 \frac{1}{p_E} = -\log_2( p_E ) [bit] $$$ p(A,B) = p(A) \cdot p(B) $$$ I(A,B) = I(A) + I(B) $$$$ I(p) = -\log p \quad \Rightarrow \quad I(A…

interactive_practice_of_css

Anonymous (anonymous@undisclosed.example.com) — 2025-09-29T08:40:39+00:00

Interactive Practice of CSS * CSS Diner is an interactive learning game designed to teach CSS selectors. Through a series of fun, progressively challenging levels, players use CSS selectors to style and target elements on a virtual table of dishes. * Flexbox Froggy is a game where you help Froggy and friends by writing

jpeg_compression

Anonymous (anonymous@undisclosed.example.com) — 2024-11-18T20:12:48+00:00

Overview of JPEG Encoding JPEG (Joint Photographic Experts Group) encoding is used to compress photographic images and is particularly effective for images with smooth variations in tone and color. The key idea is to reduce redundancy and irrelevancy based on human visual perception.

json_schema

Anonymous (anonymous@undisclosed.example.com) — 2024-12-17T13:52:15+00:00

JSON Schema Overview and Examples JSON Schema is a tool to define and validate the structure of JSON data. It ensures that the data adheres to specific types, structures, and constraints, making it useful for APIs and data validation. Basic JSON Schema Example

luhn_algortithm_to_protect_credit_card_numbers

Anonymous (anonymous@undisclosed.example.com) — 2025-10-27T20:20:11+00:00

To check if a credit card number is valid, you can use the Luhn algorithm. This is a simple checksum formula used to identify mistyped or incorrect numbers. Here’s how it works: Steps of the Luhn Algorithm 1. Reverse the order of the card number's digits.

lzw_coding

Anonymous (anonymous@undisclosed.example.com) — 2024-11-19T07:54:17+00:00

LZW coding (compression) LZW (Lempel-Ziv-Welch) is a lossless data compression algorithm that builds a dictionary of substrings during encoding. It compresses data by replacing repeated occurrences of data (patterns) with shorter codes that represent those patterns. The basic idea is to replace substrings with shorter codes as the compression progresses, so the output size becomes smaller.

mathematical_expressions_in_tex_language

Anonymous (anonymous@undisclosed.example.com) — 2025-09-04T12:45:56+00:00

Introduction to LaTeX for Mathematical Expressions The goal of the lesson is to become familiar with LaTeX, specifically for the purpose of writing mathematical expressions. 1. Introduction to LaTeX What is LaTeX? LaTeX is a high-quality typesetting system, primarily used for technical and scientific documents. It is particularly powerful for formatting complex mathematical equations and formulas, making it a preferred choice in academia and research.$E = mc^2$$$E = mc^2$$$x^2$$a_1$$\frac{a}…

meaning_of_news

Anonymous (anonymous@undisclosed.example.com) — 2024-10-07T17:06:53+00:00

Meaning of News The information conveyed in announcements holds meaning for the receiver. Meaning is a semiotic concept, and the meaning of informational primitives is connected to relations. - What does the received information represent or signify?

mpeg_compression

Anonymous (anonymous@undisclosed.example.com) — 2024-11-19T11:06:02+00:00

Principles of MPEG Compression MPEG compression offers various methods for both video and audio. In MPEG, it is crucial to keep audio and video synchronized over time, so audio and video data include timestamps. MPEG (Moving Picture Experts Group) compression is a widely used standard for reducing the file size of video and audio content while maintaining an acceptable level of quality. It achieves high compression ratios by eliminating redundant information spatially within a frame and tempor…

multimedia_compression

Anonymous (anonymous@undisclosed.example.com) — 2024-11-19T11:10:20+00:00

Multimedia Compression Methods Multimedia files like audio, video, and images are often very large in their uncompressed form. Compression is used to reduce the amount of data required to store or transmit this information, making storage more efficient and reducing bandwidth requirements for transmission. There are two main types of compression methods:\[ 44100 \text{ samples/second} \times 16 \text{ bits/sample} \times 2 \approx 1.4 \text{ Megabits} \]\[ 1920 \times 1080 \t…

parity_check

Anonymous (anonymous@undisclosed.example.com) — 2025-10-27T18:59:04+00:00

Parity Check A parity check is a simple error detection mechanism used in digital communication and data storage to detect errors in transmitted or stored data. It ensures that the number of bits with a value of 1 in a binary sequence is either even or odd, depending on the type of parity used.

part_designing_-_model_train_drawing

Anonymous (anonymous@undisclosed.example.com) — 2025-10-13T10:44:07+00:00

OnShape - Part Designing Technical Drawing of Train Body Technical Drawing of Train Wheel Target Model

public_key_authentication

Anonymous (anonymous@undisclosed.example.com) — 2024-10-07T15:54:06+00:00

Public Key Authentication One of the most dangerous situations in communication is when a malicious attacker intercepts the communication channel and alters the keys without being noticed. This can be prevented by involving a trusted third party that provides additional authentication.

reed-solomon_codes

Anonymous (anonymous@undisclosed.example.com) — 2024-10-06T19:43:01+00:00

Reed-Solomon codes Reed-Solomon (RS) codes are a type of error-correcting code used to detect and correct data transmission or storage errors. They are particularly effective at correcting burst errors, where multiple consecutive bits are corrupted. Reed-Solomon codes are widely used in applications like \[ x^3 + x + 1 \]\[ \{ 0, 1, \alpha, \alpha^2, \alpha^3, \alpha^4, \alpha^5, \alpha^6 \} \]$\alpha$\[ \text{data} = \{ 6, 4, 3 \} \]$ g(x) $\[ g(x) = (x - \alpha^0)(x - \alpha^1)(x - \alpha…

relations

Anonymous (anonymous@undisclosed.example.com) — 2024-10-07T17:10:04+00:00

Relation A relation can be narrowly defined as a tool for establishing a connection between two sets. Let $ A $ and $ B $ be two sets. The relation $ R $ creates a connection between these two sets. Let: \[ C = A \times B = \{(a, b) \mid a \in A, b \in B\} \] Here, $ C $ is the Cartesian product of sets $ A $ and $ B $. The elements of set $ C $$ A $$ B $$ R $$ C $$ A $$ B $$ A, B, C \to 1, 2, 3, 4 $$ A, B, C $$ 1, 2, 3, 4 $

rle_coding

Anonymous (anonymous@undisclosed.example.com) — 2025-11-10T14:51:48+00:00

Run-Length Encoding (RLE) Run-Length Encoding (RLE) is one of the simplest lossless data compression techniques. It works by replacing sequences of repeated elements (called “runs”) with a single value and a repetition count. Run-Length Encoding cannot be attributed to a single inventor; rather, it is based on one of the earliest and simplest general principles of data compression, developed and first used in the 1950s for computer image processing.

rsa_encryption

Anonymous (anonymous@undisclosed.example.com) — 2024-11-26T08:25:45+00:00

The Basic Model of Public Key Systems 1. Alice generates a pair of keys: e (public key) and d (private key). In this context e means (encryption key) and d (decryption key). 2. She keeps d secret, but makes e public. 3. If Bob wants to send a message to Alice, he uses Alice's public key $ c = E(e, m) $$ c $$ m = D(d, c) $$ m $\[ T^d \mod N = T \]$ C = T^e \mod N $$ T = C^d \mod N $$ e $$ d $$ N $$ p $$ q $$ N = p \times q $$ \phi(N) = (p-1) \times (q-1) $$ e $\( …

semantics

Anonymous (anonymous@undisclosed.example.com) — 2024-10-07T18:19:31+00:00

Meaning of news Explores the concept of how information conveys meaning to the receiver, emphasizing the role of prior knowledge and experiences in semantic decoding. Relations Defines relations as connections between sets, describing them using Cartesian products, matrices, and graphs. Relations can be binary, homogeneous, or inversed, and are used to express logical relationships between elements.

shanon-fano_method

Anonymous (anonymous@undisclosed.example.com) — 2024-10-08T08:45:37+00:00

Shannon-Fano method A simple data compression procedure, which involves the following steps: * Arrange the symbols to be transmitted according to their probabilities. * Divide the set of symbols into two subsets with equal or nearly equal probabilities. Assign the symbol set with $$ H = -\left(\frac{2}{4} \log \frac{1}{4} + \frac{2}{8} \log \frac{1}{8} + \frac{4}{16} \log \frac{1}{16}\right) = 2.75 \, \text{[bit].} $$$ L = \sum_{i=1}^n x_i \mu_i $$$ L = \frac{2}{4} \cdot 2 + \frac{2}{8}…

sketching_-_simple_wrench_example

Anonymous (anonymous@undisclosed.example.com) — 2025-09-29T11:15:07+00:00

OnShape - Basics of Sketching Technical drawing Target 3D model

statistical_properties

Anonymous (anonymous@undisclosed.example.com) — 2025-09-30T05:33:57+00:00

Statistical properties of Information Event Space The outcome of experiments, the results of observations, and the status of systems form a so-called 'event space', where finite or infinite cardinality elementary events may occur. In probability theory, an $ E_i $$k_i$$$ freq_i=\frac{k_i}{k} = \frac{\text{number of favorable outcomes}}{\text{number of all possible outcomes}}$$$$ \lim_{k \to \infty} freq_i = \frac{k_i}{k} = P(E_i) $$$k_i = k $$P(E) = 1 $$k_i = 0 $$P(E) = 0 $$𝐸$\(…

syntax_graphs

Anonymous (anonymous@undisclosed.example.com) — 2025-11-25T08:07:21+00:00

Syntax Graphs Syntactic rules can also be modeled using graphs, for example, in the following way: The idea is to represent all possibilities of the BNF formula in some graphical way. 1. Example: Syntax Graph for Variable Declarations in the PASCAL Language $$ \begin{aligned} \langle json \rangle &::= \langle value \rangle \\[6pt] % \langle value \rangle &::= \langle object \rangle \mid \langle array \rangle \mid \langle string \rangle \mid \langle number \rangle \mid…

syntax_of_languages

Anonymous (anonymous@undisclosed.example.com) — 2025-11-25T07:20:14+00:00

Syntax of Languages Text-based messages and languages have higher-level syntactic properties. These syntactic rules are known as grammatical rules. The grammar of natural languages has evolved historically, and the grammatical correctness of a given text is not always clear-cut. In contrast, the syntax of artificial languages is much more precise. Among the languages constructed to replace natural languages, the most famous and significant is

syntax

Anonymous (anonymous@undisclosed.example.com) — 2025-01-31T06:14:40+00:00

Code Overview of various encoding techniques, focusing on transforming information into symbolic representations like Morse code, fixed-length, and variable-length codes. It also discusses the principles of encoding systems used in technology and communication.

syntax2

Anonymous (anonymous@undisclosed.example.com) — 2025-11-03T20:33:38+00:00

Syntax of Languages Explains grammatical rules in both natural and artificial languages, highlighting the precision required in technical and programming languages. BN formulas A meta-language used for defining the syntax of programming languages through rules and symbols, useful for creating structured grammars.

utf-8_encoding

Anonymous (anonymous@undisclosed.example.com) — 2024-11-19T10:59:39+00:00

UTF-8 Encoding The essence of UTF (Unicode Transformation Format) encoding lies in how we can shorten the 32-bit encoding of Unicode characters. UTF-8 is the most widely used encoding method today, especially in web applications and information systems. It efficiently compresses the encoding of Unicode characters to reduce storage space while ensuring compatibility with older standards like

xml_2

Anonymous (anonymous@undisclosed.example.com) — 2024-10-07T17:30:07+00:00

XML Example - version: The version number of the XML document. - encoding: Character encoding - 'ISO-8859-2' refers to Latin-2 encoding. - comments: Comments can be placed between , and they can span multiple lines. - tagging data: Data is labeled using

xml

Anonymous (anonymous@undisclosed.example.com) — 2025-12-02T07:35:04+00:00

XML The well-known HTML was the foundational language for web development. HTML is primarily used for data presentation but unsuitable for describing data structures. The basic function of HTML is to define how information is displayed on the web (e.g., font size, type, tables, paragraphs).

yaml

Anonymous (anonymous@undisclosed.example.com) — 2025-11-17T20:35:03+00:00

YAML YAML (YAML Ain’t Markup Language) is a human-readable data serialization language designed for simplicity and clarity. It is often used for configuration files, data exchange between programming languages, and declarative system descriptions (e.g., Docker Compose, GitHub Actions, Kubernetes).