Define simplex, half-duplex, and full-duplex modes of communication with one example each. - Students Free Notes

Define simplex, half-duplex, and full-duplex modes of communication with one example each.

  • Simplex: Data flows in one direction only (e.g., keyboard to computer).
  • Half-duplex: Data flows in both directions, but not simultaneously (e.g., walkie-talkies).
  • Full-duplex: Data flows in both directions simultaneously (e.g., telephone conversation).

Related Questions:

  1. What is the function and significance of Napier’s Bone in early computing?
  2. How did Charles Babbage’s Difference Engine differ from the Analytical Engine?
  3. What is the primary goal of fifth-generation computers?
  4. Name the three types of memory mentioned on the motherboard in the Von Neumann architecture.
  5. Differentiate between volatile and non-volatile memory.
  6. Why is the word size of a processor important, and how does it affect the computer’s performance?
  7. What is pipelining, and how does it improve the efficiency of a CPU?
  8. Imagine you are building a custom computer for a friend. Give three considerations you would take into account when choosing the type and size of memory for this computer.
  9. You are a computer technician tasked with upgrading an older computer with a slow CPU. How might you improve its performance without replacing the entire CPU?
  10. Your school is planning to purchase new printers for the computer lab. Give three advantages and disadvantages of impact and non-impact printers to help them make a decision.
  11. Define “protocol” in the context of data communication.
  12. What are start and stop bits, and where are they used in data transmission?
  13. How does a switch differ from a hub in a network?
  14. How does asynchronous transmission differ from synchronous transmission, and in what situations are they typically used?
  15. Explain the concept of a peer-to-peer network and its limitations compared to a client/server network.
  16. Compare and contrast the star and ring network topologies.
  17. COMPUTATIONAL THINKING & ALGORITHMS
  18. Show memory hierarchy with the help of a diagram.
  19. Computational Thinking And Algorithms
  20. Computational Thinking And Algorithms