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
storchak [24]
3 years ago
9

What finger should be on the K key? 1. Pinky 2. Index 3. Middle 4. Ring

Computers and Technology
1 answer:
Sonja [21]3 years ago
8 0

Answer:

The answer would be the middle

Explanation:

Hope this helps

You might be interested in
Who likes video games
polet [3.4K]
I wish i could play but my strict mom would never let me :’(
3 0
2 years ago
Hat are the technical risks and the human risks for the ticktacktoe game
Ierofanga [76]

Answer:

 The technical risk basically occur due to some possible impact modification in the system and due to some technical problem or issue in the entire infrastructure.

Human risk are mainly occur due to the human interference. The technical and human risks are the two main types of risks for ticktacktoe game.

The different types of risks that occur are as follows:

  •  The operational risk
  •   Strategic risk
  •   Compliance risk
  •   Program risk

8 0
3 years ago
programs are often built in a logical sequential order of three connected phases. The three phases in order are__
blsea [12.9K]
The correct answer for this question is IPO or also known as the "Input, Process, Output" Order. This sequential order is a method used by many, especially in terms of Software Engineering. This method is widely use to determine the structure of an informative processing programs and of other process known to programs as well. 
6 0
3 years ago
Consider the following generalization of the Activity Selection Problem: You are given a set of n activities each with a start t
victus00 [196]

Answer:  

Assumption: Only 1 job can be taken at a time  

This becomes a weighted job scheduling problem.  

Suppose there are n jobs

   Sort the jobs according to fj(finish time)

   Define an array named arr to store max profit till that job

       arr[0] = v1(value of 1st job)

       For i>0. arr[i] = maximum of arr[i-1] (profit till the previous job) or wi(weight of ith job) + profit till the previous non-conflicting job

   Final ans = arr[n-1]

The previous non-conflicting job here means the last job with end timeless than equal to the current job.  

To find the previous non-conflicting job if we traverse the array linearly Complexity(search = O(n)) = O(n.n) = O(n^2)  

else if we use a binary search to find the job Complexity((search = O(Logn)) = O(n.Log(n))

4 0
2 years ago
How do you change a Word document to an .html file? Save it as a Web page. Save it as a plain text document. Copy it in rich tex
Flura [38]
Save it as a web page

6 0
3 years ago
Other questions:
  • In programming, what is a string?
    8·2 answers
  • Suppose your parents are planning to take you
    8·1 answer
  • PLS HELP!! 50 Points! Will mark correct answer brainliest!!
    11·2 answers
  • What do you understand by technological depenence?
    9·1 answer
  • To print the number of elements in the array named ar, you can write :
    10·1 answer
  • 6.10.1: Modify a C string parameter. Complete the function to replace any period by an exclamation point. Ex: "Hello. I'm Miley.
    8·1 answer
  • Assume a computer uses pipelining of 9 stages. Each stage demands 3 clock cycles to finish its task. How many clock cycles are n
    9·1 answer
  • Who plays oblox .............................
    8·2 answers
  • The RGB value below produces a shade of purple. What does the number 175
    15·2 answers
  • When dividing it’s total debt by total equity what’s a company trying to measure
    9·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!