Uinni
type: Item
participates in: EIMI 25/26WS
interested in: IP
interested in: TCP
interested in: Structure of a TCP/IP packet
interested in: Principle of DHCP
interested in: Principle of DNS
interested in: Structure of an IP header (IPv4)
interested in: Developing secure and safe software
interested in: UDP
interested in: Examples of special IP addresses
interested in: Attack chain
interested in: Basic principle of sending data
interested in: Dangers of AI
interested in: Best Practices in IT Security
interested in: CVE
interested in: Copyright and AI
interested in: Hallucinations (LLM)
interested in: Countermeasures
interested in: CVSS
interested in: Stochastic Parrots
interested in: Trivial Security Issues
interested in: Artificial intelligence
interested in: Training AI models
interested in: Opportunities of AI
interested in: Generative AI
interested in: How is data stored digitally?
interested in: Zuse Z3
interested in: Using bitwise operators
interested in: Chomsky hierarchy of formal languages
interested in: Translation of a programming language into a machine command
interested in: Key (Cryptography)
has completed: Arithmetic rules in the binary system
has completed: Division
has completed: Boolean operators
has completed: Addition
has completed: Converting between binary and decimal
has completed: Multiplication
has completed: Structure of a ZIP file
has completed: Hexadecimal numbers
has completed: Arithmetic logic unit
has completed: Binary numbers
has completed: Unicode
has completed: UTF-32
has completed: ZIP file
has completed: Errors in binary encoding
has completed: Converting from binary to hexadecimal
has completed: Hamming code
has completed: Reasons for efficient encoding
has completed: Use of hexadecimal numbers in informatics
has completed: Compression of a ZIP file
has completed: Using the Luhn algorithm for error prevention
has completed: Representation of negative binary numbers
has completed: Huffman encoding
has completed: Hamming distance
has completed: Big-endian notation
has completed: Little-endian notation
has completed: Examples of encoding
has completed: Relevance of endianness
has completed: Determining the redundancy of a code
has completed: How arithmetic coding works
has completed: Example of entropy coding
has completed: Difference between big-endian and little-endian
has completed: Endianness
has completed: Kolmogorov complexity
has completed: Use of a hex editor for binary data
has completed: Morse code
has completed: Representing boolean logic as Venn diagrams
has completed: Bit
has completed: Conjunctions (propositional logic)
has completed: Zuse Z3
has completed: Historical development of the Internet
has completed: Historical development of computer-mediated communication