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
Otrada [13]
3 years ago
7

What is the advantage of taking notes in a digital format? The technology protects digital notes from being copied. Digital note

s make it hard to mark large sections of text. Technology allows digital notes to be shared on the Internet. Digital notes are impossible to remove from text.
Computers and Technology
2 answers:
VMariaS [17]3 years ago
6 0

Answer:

Technology allows digital notes to be shared on the Internet.

Explanation:

Ray Of Light [21]3 years ago
3 0

C. Technology allows digital notes to be shared on the Internet.

You might be interested in
1.) what is the minimum number of bits required to represent -3,997 using 2's complement form?
lisabon 2012 [21]

The binary representation of +3997 is 1111 1001 1101.

In one's complement this is simply adding a sign bit and inverting all the bits:

1 0000 0110 0010

The two's complement is the one's complement plus 1:

1 0000 0110 0011

That's 13 bits. Normally the sign bit would be at an 8, 16 or 32,... bit boundary.

For -436 it's 10 0100 1100 and 10 bits


8 0
3 years ago
A(n) ____ is a collection of one or more program statements combined to perform some action
finlep [7]

The answer is Method

A method is a code block of statements that perform a task. By calling a method, a program causes statements to be executed. In C# programming, every instruction that is executed is performed in the context of a method. Technically, it is how behaviors are implemented in C# and are enclosed in parentheses separated by commas






3 0
3 years ago
or each array created, the name of the array becomes the name of the pointer constant created by the compiler for the array, and
JulijaS [17]

Answer:

The answer is "Starting address"

Explanation:

Arrays are a type of data structure that can store a fixed size successive assortment of components of a similar kind. An Array is used to store an assortment of data, yet it is regularly more valuable to consider a cluster an assortment of factors of a similar sort.

Rather than proclaiming singular factors, for example, number0, number1, ..., and number99, you declare one Array variable, for example, numbers and use numbers[0], numbers[1], and ..., numbers[99] to speak to singular factors. A particular component in a cluster is gotten to by a list.

All Arrays comprise of bordering memory areas. The most minimal address compares to the first element and the most highest address to the last element.

4 0
3 years ago
True or False? A website for a certain political party or candidate is likely to have unbiased information.
kipiarov [429]

<u>False:</u>

A website about anything political from one end such as the political party or candidate is most likely to give biased information such as

  • I will be the best mayor you ever had (Opinion)
  • I will never let you down (Opinion)
  • I have the best house (Opinion)

This is because those are Opinions not facts which is bias-based information.

<em>Hope this helps!</em>

8 0
2 years ago
Read 2 more answers
Show the array that results from the following sequence of key insertions using a hashing system under the given conditions: 5,
sergejj [24]

Answer:

a) Linear probing is one of the hashing technique in which we insert values into the hash table indexes based on hash value.

Hash value of key can be calculated as :

H(key) = key % size ;

Here H(key) is the index where the value of key is stored in hash table.

----------

Given,

Keys to be inserted are : 5 , 205, 406,5205, 8205 ,307

and size of the array : 100.

First key to be inserted is : 5

So, H(5) = 5%100 = 5,

So, key 5 is inserted at 5th index of hash table.

-----

Next key to inserted is : 205

So, H(205) = 205%100 = 5 (here collision happens)

Recompute hash value as follows:

H(key) =(key+i) % size here i= 1,2,3...

So, H(205) =( 205+1)%100 = 206%100 = 6

So, key 205 is inserted in the 6th index of the hash table.

----------

Next Key to be inserted : 406

H(406) = 406%100 = 6(collision occurs)

H(406) =(406+1) %100 = 407%100 = 7

So, the value 406 is inserted in 7the index of the hash table.

-----------------

Next key : 5205

H(5205) = 5205%100 = 5(collision)

So, H(5205) = (5205+1)%100 = 6( again collision)

So, H(5205) = 5205+2)%100 = 7(again collision)

So, H(5205) = (5205+3)%100 = 8 ( no collision)

So, value 5205 is inserted at 8th index of the hash table.

-------------

Similarly 8205 is inserted at 9th index of the hash table because , we have collisions from 5th to 8th indexes.

-------------

Next key value is : 307

H(307) = 307%100 = 7(collision)

So, (307+3)%100 = 310%100 = 10(no collision)  

So, 307 is inserted at 10th index of the hash table.

So, hash table will look like this:

Key       index

5         5

205         6

406         7

5205 8

8205 9

307         10

b) Quadratic probing:

Quadratic probing is also similar to linear probing but the difference is in collision resolution. In linear probing in case of collision we use : H(key) = (key+i)%size but here we use H(key) =( key+i^2)%size.

Applying Quadratic probing on above keys:.

First key to be inserted : 5.

5 will go to index 5 of the hash table.

-------

Next key = 205 .

H(205) = 205%100 = 5(collision)

So. H(key)= (205+1^2)%100 = 6(no collision)

So, 205 is inserted into 6th index of the hash table.

--------

Next key to be inserted 406:

So, 406 %100 = 6 (collision)

(406+1^2)%100 = 7(no collision)

So, 406 is moved to 7th index of the hash table.

----------

Next key is : 5205

So, 5205%100 = 5 (collision)

So, (5205+1^2)%100 = 6 ( again collision)

So, (5205+2^2)%100 = 9 ( no collision)

So, 5205 inserted into 9th index of hash table.

-----------

Next key is 8205:

Here collision happens at 5the , 6the , 9th indexes,

So H(8205) = (8205+4^2)%100 = 8221%100 = 21

So, value 8205 is inserted in 21st index of hash table.

--------

Next value is 307.

Here there is collision at 7the index.

So, H(307) = (307+1^2)%100 = 308%100= 8.

So, 307 is inserted at 8the index of the hash table.

Key           Index

5                  5

205                  6

406                  7

5205                9

8205               21

307                   8

3 0
3 years ago
Other questions:
  • True or false over the course of ecological succession,species diversity increases over time?
    12·2 answers
  • An algorithm written out in plain English statements is called __________.
    8·1 answer
  • Rainfall_mi is a string that contains the average number of inches of rainfall in Michigan for every month (in inches) with ever
    12·1 answer
  • Write a program that repeatedly prompts a user for integer numbers until the user enters 'done'. Once 'done' is entered, print o
    6·1 answer
  • A debugging process where you, the programmer, pretend you are a computer and step through each statement while recording the va
    11·1 answer
  • The force required to slide an object is equal to _____.
    13·1 answer
  • Consider the following code snippet:
    13·1 answer
  • Number are stored and transmitted inside a computer in the form of​
    6·1 answer
  • Write down the characterizations that best suits the term Java applets?
    7·1 answer
  • 19. List three things you can do to protect your online reputation:
    7·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!