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
rodikova [14]
2 years ago
9

Printed versions of your presentation that contain the slides and blank lines below are called

Computers and Technology
1 answer:
m_a_m_a [10]2 years ago
6 0

Answer:

Handouts

Explanation:

matches description

You might be interested in
Which is the highest level of the hierarchy of needs model?
quester [9]
It’s intrapersonal...so it’s b
5 0
3 years ago
Read 2 more answers
You are configuring a network attached storage (nas) appliance. what file sharing protocol(s) could you use to allow access to w
kicyunya [14]

Most clients should support Server Message Block (SMB)/Common Internet File System (CIFS).

<h3>What is CIFS used for?</h3>

Common Internet File System (CIFS) is a network filesystem protocol used for providing shared access to files and printers between machines on the network. A CIFS client application can read, write, edit and even remove files on the remote server.

<h3>What are CIFS servers?</h3>

CIFS stands for “Common Internet File System.” CIFS is a dialect of SMB. That is, CIFS is a particular implementation of the Server Message Block protocol, created by Microsoft.

To learn more about Internet File System , refer

brainly.com/question/13008468

#SPJ4

6 0
2 years ago
Recursively computing the sum of the first n positive odd integers, cont. About (a) Use induction to prove that your algorithm t
julia-pushkina [17]

The recursive function would work like this: the n-th odd number is 2n-1. With each iteration, we return the sum of 2n-1 and the sum of the first n-1 odd numbers. The break case is when we have the sum of the first odd number, which is 1, and we return 1.

int recursiveOddSum(int n) {

 if(2n-1==1) return 1;

 return (2n-1) + recursiveOddSum(n-1);

}

To prove the correctness of this algorithm by induction, we start from the base case as usual:

f(1)=1

by definition of the break case, and 1 is indeed the sum of the first odd number (it is a degenerate sum of only one term).

Now we can assume that f(n-1) returns indeed the sum of the first n-1 odd numbers, and we have to proof that f(n) returns the sum of the first n odd numbers. By the recursive logic, we have

f(n)=f(n-1)+2n-1

and by induction, f(n-1) is the sum of the first n-1 odd numbers, and 2n-1 is the n-th odd number. So, f(n) is the sum of the first n odd numbers, as required:

f(n)=\underbrace{\underbrace{f(n-1)}_{\text{sum of the first n-1 odds}}+\underbrace{2n-1}_{\text{n-th odd}}}_{\text{sum of the first n odds.}}

6 0
3 years ago
Consider the use of 1000-bit frames on a 1-Mbps satellite channel with a 270-ms delay. What is the maximum link utilization for,
natka813 [3]
I feel as if it would be B.
5 0
3 years ago
Define the following terms: Line authority,in your own words.
konstantin123 [22]
The power given to a person in a supervisory position who makes decisions and actions by subordinates. An engineer manager is an example of like authority.
7 0
3 years ago
Other questions:
  • What is the best way to protect computer equipment from damage caused by electrical spikes?
    9·2 answers
  • What does computer means?
    13·2 answers
  • Which design element involves the act of lining up objects vertically or horizontally to give a sense of order?
    15·1 answer
  • The ____ button resets slide placeholders to their default position, size, and text formatting.
    11·1 answer
  • Can someone help me to give this guy brainliest the button is not there
    8·1 answer
  • Which of the following statements are true about quick sort
    12·1 answer
  • If you are trying to improve your budget and spending, which option would save you the most money?
    13·2 answers
  • Write an if statement that prints the message ""The number is not valid"" if the variable distance is outside the range 100 thr
    8·1 answer
  • Exercise 3.6.9: 24 vs. "24"5 points
    7·1 answer
  • A binary search algorithm ____________ an ordered list in<br> half to find an item.
    13·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!