With a long string of bits representing a message encoded as ASCII characters (e.g. 101010101010111101....), how do we k

Business, Finance, Economics, Accounting, Operations Management, Computer Science, Electrical Engineering, Mechanical Engineering, Civil Engineering, Chemical Engineering, Algebra, Precalculus, Statistics and Probabilty, Advanced Math, Physics, Chemistry, Biology, Nursing, Psychology, Certifications, Tests, Prep, and more.
Post Reply
answerhappygod
Site Admin
Posts: 899603
Joined: Mon Aug 02, 2021 8:13 am

With a long string of bits representing a message encoded as ASCII characters (e.g. 101010101010111101....), how do we k

Post by answerhappygod »

With a long string of bits representing a message encoded as
ASCII characters (e.g. 101010101010111101....), how do we know
where one character starts and one ends?
Question 3 options:
The number of bits for each character is fixed. (Usually 8 bits
per character)
Characters begin with a 1
Characters begin with a 0
There is a space between the end of one character and the start
of another.
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!
Post Reply