Specialty Digest

Global English editionLearners’ Study Dashboard — in development
The Knowledge Library for All

Online Courses / University Track / Computing Foundations

Module 8 · Wrap-up

Discussion prompt, recap and references

Reflect on one question, review the module and find the named sources.

  • 25 minutes
  • Recap
  • References

Discussion prompt

20 minutes. Look back over the course. In 200 to 250 words, describe one thing you can now do that you could not before, one claim about technology that you would now question, and the next topic you would study.

Private: nothing you type here is sent or stored.

This course has no discussion board yet, so the prompt is a private reflection.

Recap

  • Data travels in numbered packets; round up when counting them.
  • Security aims at confidentiality, integrity and availability; password counts multiply per place; a Caesar cipher is only a classroom example.
  • Problems may be easy, hard in practice or impossible in general; Turing showed the halting problem has no general method.
  • A design is complete when it is stated, traced, tested at its boundaries and costed.

Module notes

Key terms. Network: computers joined to exchange data. Packet: a numbered piece of a message. Protocol: an agreed rule for communication. Encryption: scrambling data so only a key holder can read it. Halting problem: deciding whether a program will stop.

Rules and formulas. Packets needed = message size ÷ packet size, rounded up. Possible passwords = choices per place multiplied together for every place. Caesar shift k moves each letter k places.

Limits of this module. This module gives an introduction only. Real networks and security systems are more complex, and the theory of computation is a large subject of its own.

Next

You have reached the end of the course. Return to the course overview or the University Track.

References and further reading

  • Specialty Digest encyclopedia: Computer, Alan Turing, Algorithm and Programming Language.
  • Alan Turing, 1936, on computable numbers; the halting problem is a standard result in the theory of computation.
  • Packet sizes, scores, lap times and the club scenario in this module are invented for teaching and labelled as such.