In microsoft word, when you highlight existing text you want to replace, you’re in

1 answer:

6 0

Hello <span>Christinamauffp2olwu</span><span>

Answer: In Microsoft Word, when you highlight existing text you want to replace, you're in insert mode.

Hope This Helps :-)
-Chris</span>

You might be interested in

Write a program that prompts the user to enter their name store this value in a variable called name Prompt the user for their c

Anarel [89]

Answer:

Explanation:

The following code is written in Python. It prompts the user for the name and age, saves them to their own variables. Then it creates and calculates the dogAge variable. Finally, it combines all of this information and prints out the statement.

name = input("Enter your name: ")

age = input("Enter your age: ")

dogAge = int(age) * 7

print("Your name is", name, "and in dog years you are", dogAge, "years old.")

8 0

3 years ago

Computer science student jones has been assigned a project on how to set up sniffer. What just he keep in mind as part of the pr

noname [10]

In the case above, what just comes to mind as part of the process is option d.

<h3>What is sniffer?</h3>

A sniffer is known to be a kind of a software or hardware tool that gives room for a person to be able to “sniff” or look through one's internet traffic in real time, getting all the data flowing to and from a person's computer.

Therefore, In the case above, what just comes to mind as part of the process is option d.

Learn more about sniffer from

brainly.com/question/14265770

#SPJ1

3 0

2 years ago

Suppose that, even unrealistically, we are to search a list of 700 million items using Binary Search, Recursive (Algorithm 2.1).

damaskus [11]

Answer:

There is also an attachment below

Explanation:

Since we are talking about binary search, let's assume that the items are sorted according to some criteria.

Time complexity of binary search is O(logN) in worst case, best case and average case as well. That means it can search for an item in Log N time where N is size of the input. Here problem talks about the item not getting found. So, this is a worst case scenario. Even in this case, binary search runs in O(logN) time.

N = 700000000.

So, number of comparisions can be log(N) = 29.3 = 29.

So, in the worst case it does comparisions 29 times