1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
goldfiish [28.3K]
3 years ago
7

Which is true of ASCII and Unicode?

Computers and Technology
1 answer:
allochka39001 [22]3 years ago
4 0

Answer:

The correct options is;

Every character written in A S C I I can be represented using Unicode

Explanation:

All characters found in A S C I I can be found in Unicode such that A S C I I is a subset of Unicode whereby the meaning of the numbers from 0 to 127 are the same in both A S C I I and Unicode

The size of the A S C I I character in 8-bit A S C I I encoding is 8 bits while a Unicode U T F - 8 encoding has between 8 bits (1 byte) and 32 bits (4-bytes)

A S C I I assigns only 127 of the 255 possible numbers that can be stored in an 8-bits character, where the spare characters are then used by P C s for accented characters, therefore, it A S C I I does not define accented characters

You might be interested in
How do you screen shot and copy paste the screenshot from chrome book
Black_prince [1.1K]
Hit the window key + ctrl. You than find the screenshot in your downloads. You click on it and it will say copy. Press it and paste your image where you need to post it on. That’s how you do it!
5 0
4 years ago
Read 2 more answers
Will give brainliest!!!!!!!!!!!!
stira [4]
A trademark is a sign, symbol, name, or short phrase that indicates the source of a product or service.
3 0
3 years ago
Read 2 more answers
What type of hard drive is in original xbox?
castortr0y [4]
The original Xbox had an 8GB hard disk drive, or HDD.

You basically gave yourself the answer! A hard drive.
4 0
3 years ago
PLEASE HELP!!!!!! ASAP
NNADVOKAT [17]

Answer:

use a wizard or use a design view

Explanation:

i took the test

4 0
3 years ago
Read 2 more answers
2.Consider the following algorithm and A is a 2-D array of size ???? × ????: int any_equal(int n, int A[][]) { int i, j, k, m; f
Elis [28]

Answer:

(a) What is the best case time complexity of the algorithm (assuming n > 1)?

Answer: O(1)

(b) What is the worst case time complexity of the algorithm?

Answer: O(n^4)

Explanation:

(a) In the best case, the if condition will be true, the program will only run once and return so complexity of the algorithm is O(1) .

(b) In the worst case, the program will run n^4 times so complexity of the algorithm is O(n^4).

5 0
3 years ago
Other questions:
  • Wich of these is an example of magnetic storage
    11·1 answer
  • A potential threat to administrators’ ability to manage the correctional system is
    12·1 answer
  • Graphs and charts are two different elements. True or False
    15·1 answer
  • Human factors is the study of:
    5·1 answer
  • What is not an option when a user is exporting contacts to share with others?
    10·1 answer
  • Which of the following statements is true about a file stream?
    5·1 answer
  • PLEASE HELP!!!!
    6·2 answers
  • Have y’all beat shinobi 3 return of The ninja Master for The sega genesis
    5·1 answer
  • Write a Java program that launches 1000 threads. Each thread adds 1 to a variable sum that initially is 0. You need to pass sum
    11·1 answer
  • PLS HELP MEE it's due in 2 minutes​
    7·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!