User Tools

Site Tools


tanszek:oktatas:techcomm

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revisionPrevious revision
Next revision
Previous revision
tanszek:oktatas:techcomm [2025/09/15 17:14] – [Examination Questions] kneheztanszek:oktatas:techcomm [2025/10/13 17:59] (current) kissa
Line 2: Line 2:
  
 | **Description                               ** | The main purpose of the course is to introduce students to the fundamental theories and methods of information systems. Topics include basic logic, number systems, systems theory, information representation, coding and encryption, semantics, modelling principles, and the fundamentals of computer-aided modelling.  | | **Description                               ** | The main purpose of the course is to introduce students to the fundamental theories and methods of information systems. Topics include basic logic, number systems, systems theory, information representation, coding and encryption, semantics, modelling principles, and the fundamentals of computer-aided modelling.  |
-| **Semester                                  ** | Autumn, 2025                                                                                                                                                                                                                                                                                                                                          |+| **Semester                                  ** | Autumn                                                                                                                                                                                                                                                                                                                                          |
 | **Neptun code**                                | GEIAK100-B2A                                                                                                                                                                                                                                                                                                                                          | | **Neptun code**                                | GEIAK100-B2A                                                                                                                                                                                                                                                                                                                                          |
 | **Instructors**                                | Dr. Károly Nehéz, Associate Professor \\ Áron Kiss, Teaching Assistant.                                                                                                                                                                                                                                                                                            | | **Instructors**                                | Dr. Károly Nehéz, Associate Professor \\ Áron Kiss, Teaching Assistant.                                                                                                                                                                                                                                                                                            |
Line 26: Line 26:
   - [[tanszek:oktatas:techcomm:Cascading Style Sheets]]   - [[tanszek:oktatas:techcomm:Cascading Style Sheets]]
   - [[tanszek:oktatas:techcomm:Interactive Practice of CSS]]   - [[tanszek:oktatas:techcomm:Interactive Practice of CSS]]
-  - [[tanszek:oktatas:techcomm:Conditional Probability and Information Theory|Conditional Probability and Information Theory Exercises]] 
-  - [[tanszek:oktatas:techcomm:Combinatorics Exercises]] 
   - OnShape Sketching:   - OnShape Sketching:
-    - [[https://learn.onshape.com/courses/fundamentals-sketching|OnShape - Introduction to Sketching]]+    - [[tanszek:oktatas:techcomm:Sketching - Simple wrench example]] 
 +    - **Homework:**[[https://learn.onshape.com/courses/fundamentals-sketching|OnShape - Introduction to Sketching]]
   - OnShape Part Designing:   - OnShape Part Designing:
-    - [[https://cad.onshape.com/documents/b81e235caae5b03c40a86977/w/3938f7684e900b61d53f0ffb/e/a449c8d237d554e677cca062|Model train (document)]]+    - [[tanszek:oktatas:techcomm:Part Designing - Model Train Drawing]]
     - {{:tanszek:oktatas:pasted:20241110-135319.pdf|Designing a Model Train (booklet)}}     - {{:tanszek:oktatas:pasted:20241110-135319.pdf|Designing a Model Train (booklet)}}
     - [[https://www.youtube.com/watch?v=uy-IvQ1vvNw&list=PLz8Z-TlRSTmXTtyAErOtUWHhMZHe0V1ID&index=1|Designing a Model Train (video tutorial)]]     - [[https://www.youtube.com/watch?v=uy-IvQ1vvNw&list=PLz8Z-TlRSTmXTtyAErOtUWHhMZHe0V1ID&index=1|Designing a Model Train (video tutorial)]]
-    - **Homework:** [[https://learn.onshape.com/courses/fundamentals-part-design-using-part-studios|OnShape - Part Design Using Part Studios]]+    - **Homework:** [[https://learn.onshape.com/courses/introduction-to-part-studios|OnShape - Introduction to Part Studios]]
   - OnShape Assemblies:   - OnShape Assemblies:
     - {{tanszek:oktatas:techcomm_nutcracker_assembly.pdf|Nutcracker assembly drawings}}     - {{tanszek:oktatas:techcomm_nutcracker_assembly.pdf|Nutcracker assembly drawings}}
Line 41: Line 40:
     - [[https://cad.onshape.com/documents/728cdf6c5283376eab0f5bcf/w/30c99a9d4b4db1a843d7828f/e/d9e3909c2cc01a878d23abd8|FINISHED document]]     - [[https://cad.onshape.com/documents/728cdf6c5283376eab0f5bcf/w/30c99a9d4b4db1a843d7828f/e/d9e3909c2cc01a878d23abd8|FINISHED document]]
     - **Homework:** [[https://learn.onshape.com/courses/fundamentals-onshape-assemblies|Onshape - Assemblies]]     - **Homework:** [[https://learn.onshape.com/courses/fundamentals-onshape-assemblies|Onshape - Assemblies]]
 +  - [[tanszek:oktatas:techcomm:Conditional Probability and Information Theory|Conditional Probability and Information Theory Exercises]]
 +  - [[tanszek:oktatas:techcomm:Combinatorics Exercises]]
   - [[tanszek:oktatas:techcomm:Encoding Techniques|Encoding and Encryption Exercises]]   - [[tanszek:oktatas:techcomm:Encoding Techniques|Encoding and Encryption Exercises]]
  
-/*=== Assignments === +=== Assignments === 
- +  - {{tanszek:oktatas:techcomm-html_assignment-2025.pdf|HTML Assignment}} (**submission deadline:** 2025. 11. 04.) 
-  - {{tanszek:oktatas:techcomm-html_assignment-2024.pdf|HTML Assignment}} (**submission deadline:** 2025. 11. 06.) + /* - {{tanszek:oktatas:techcomm-cad_assignment-2024.pdf|CAD Assignment}} (**task selection deadline:** 2025. 11. 27.; **submission deadline:** 2025. 12. 11.)*/
-  - {{tanszek:oktatas:techcomm-cad_assignment-2024.pdf|CAD Assignment}} (**task selection deadline:** 2025. 11. 27.; **submission deadline:** 2025. 12. 11.)*/+
  
 === Additional Notes === === Additional Notes ===
Line 55: Line 55:
 ---- ----
  
-==== Examination Questions ==== +[[tanszek:oktatas:techcomm:Examination Questions]]
- +
-1. The three types of sciencesinductive, 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. +
- +
-2. The hierarchical levels of information, the concepts of sets and systems, the multi-level model of informational properties, and the concept of a signal and its basic types. +
- +
-→ Know how information can be described on multiple levels (statistical, syntactic, semantic, etc.). Be able to define sets, systems, and basic signal types with examples. +
- +
-3. The quantitative properties of information, the concept of relative frequency, probabilities in finite event systems, Shannon's information-measuring function, the statistical properties of message sets, and the entropy and redundancy of a message set. +
- +
-→ Be able to calculate probabilities, apply Shannon’s formula, and explain what entropy and redundancy mean in the context of messages. +
- +
-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 methodsthe 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 methodsRLE 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, data in JSON). +
- +
-11. Demonstration of JPEG and MPEG compression, including their key properties. +
- +
-→ 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