tanszek:oktatas:techcomm
Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
tanszek:oktatas:techcomm [2025/09/15 17:14] – [Examination Questions] knehez | tanszek:oktatas:techcomm [2025/10/13 17:59] (current) – kissa | ||
---|---|---|---|
Line 2: | Line 2: | ||
| **Description | | **Description | ||
- | | **Semester | + | | **Semester |
| **Neptun code** | | **Neptun code** | ||
| **Instructors** | | **Instructors** | ||
Line 26: | Line 26: | ||
- [[tanszek: | - [[tanszek: | ||
- [[tanszek: | - [[tanszek: | ||
- | - [[tanszek: | ||
- | - [[tanszek: | ||
- OnShape Sketching: | - OnShape Sketching: | ||
- | - [[https:// | + | - [[tanszek: |
+ | - **Homework: | ||
- OnShape Part Designing: | - OnShape Part Designing: | ||
- | - [[https:// | + | - [[tanszek:oktatas: |
- {{: | - {{: | ||
- [[https:// | - [[https:// | ||
- | - **Homework: | + | - **Homework: |
- OnShape Assemblies: | - OnShape Assemblies: | ||
- {{tanszek: | - {{tanszek: | ||
Line 41: | Line 40: | ||
- [[https:// | - [[https:// | ||
- **Homework: | - **Homework: | ||
+ | - [[tanszek: | ||
+ | - [[tanszek: | ||
- [[tanszek: | - [[tanszek: | ||
- | /*=== Assignments === | + | === Assignments === |
- | + | - {{tanszek: | |
- | - {{tanszek: | + | /* - {{tanszek: |
- | - {{tanszek: | + | |
=== Additional Notes === | === Additional Notes === | ||
Line 55: | Line 55: | ||
---- | ---- | ||
- | ==== Examination Questions ==== | + | [[tanszek:oktatas:techcomm:Examination Questions]] |
- | + | ||
- | 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), | + | |
- | + | ||
- | 2. The hierarchical levels of information, | + | |
- | + | ||
- | → Know how information can be described on multiple levels (statistical, | + | |
- | + | ||
- | 3. The quantitative properties of information, | + | |
- | + | ||
- | → Be able to calculate probabilities, | + | |
- | + | ||
- | 4. The syntactic properties of information. The concept of a code. Properties of different code types. Encoding messages, the Shannon-Fano procedure. | + | |
- | + | ||
- | → Know what a code is, why coding is needed, and the main properties of different code types. Be able to illustrate the Shannon–Fano coding procedure with a simple example. | + | |
- | + | ||
- | 5. The concept of parity bit, Hamming distance, and correcting a 1-bit error in 16-bit data. | + | |
- | + | ||
- | → Understand how parity bits detect errors, what Hamming distance means, and how a single-bit error can be corrected in a given data word. | + | |
- | + | ||
- | 6. Other error detection and correction methods: the concept of a checksum. Elias block protection. | + | |
- | + | ||
- | → Know the principle of checksums and the role of Elias block protection in improving reliability. | + | |
- | + | ||
- | 7. Checksum. The protection algorithm of bank card numbers and tax numbers. | + | |
- | + | ||
- | → Understand how checksums are applied in practice, e.g., the Luhn algorithm for bank cards and checksum rules in identifiers. | + | |
- | + | ||
- | 8. Simple compression methods: RLE coding, LZW coding. | + | |
- | + | ||
- | → Be able to explain how RLE compresses repeated data and how LZW is used for general-purpose compression. | + | |
- | + | ||
- | 9. Character codes: ASCII codes, Unicode, UTF-8 encoding and decoding. | + | |
- | + | ||
- | → Understand the differences between ASCII and Unicode and why UTF-8 is necessary for representing multilingual texts. | + | |
- | + | ||
- | 10. Demonstration of Base64 encoding and decoding. | + | |
- | + | ||
- | → Explain how Base64 converts binary data into text and give examples of its use (e.g., email attachments, | + | |
- | + | ||
- | 11. Demonstration of JPEG and MPEG compression, | + | |
- | + | ||
- | → Know the basics of lossy compression and why JPEG is used for images and MPEG for video. | + | |
- | + | ||
- | 12. The syntax of languages: demonstration of Backus-Naur (BN) form, syntax graphs, JSON schema. The essence of XML and DTD. | + | |
- | + | ||
- | → Be able to describe formal syntax notations (BNF, syntax graphs), understand JSON schemas, and explain the purpose of XML and DTDs. | + | |
- | + | ||
- | 13. Implementation of key exchange protocol over an insecure (eavesdropped) channel. | + | |
- | + | ||
- | → Understand the principle of the Diffie–Hellman key exchange and why it works securely even if the channel is monitored. | + | |
- | + | ||
- | 14. The essence of RSA encryption. | + | |
- | + | ||
- | → Explain how RSA works using prime numbers, public and private keys, and why it is secure. | + | |
- | + | ||
- | 15. Hash codes and their properties, password storage. | + | |
- | + | ||
- | → Know the main properties of cryptographic hash functions (collision resistance, etc.) and how hashes with salt are used for secure password storage. | + | |
- | + | ||
- | 16. Digital signatures with and without hash codes. | + | |
- | + | ||
- | → Understand how digital signatures work, and why using hash functions makes them more efficient and secure. | + | |
tanszek/oktatas/techcomm.1757956482.txt.gz · Last modified: 2025/09/15 17:14 by knehez