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
NISA [10]
3 years ago
8

The weird suspicious box that k12 sends the parents to put on the router. im getting strange privacy error messages on google an

d silk on every single device i try that ive never gotten before my parents put the box on our router. i used to get redirected to "meetbluecircle.com" but now it just does this error and im so annoyed and mad and just freaking confused out of my mind about how i get these errors to go away becuase its blocking any site i try to go to.EVEN THE FREAKING HELP FORUM FOR GOOGLE!!!!Please help me im going crazy trying to figure out how the heck i get this to go the frick away
Computers and Technology
1 answer:
lorasvet [3.4K]3 years ago
7 0

Answer:

34

Explanation:

WHY BECAUSE 34 IS PRIME AND THIS PROBLEM REDUCE THE NUMBER AND CHANGE THE NUMBER INTO A MIXED NUMBER

You might be interested in
What kind of video are you are able to watch by downloading it from the Internet?
Helen [10]

Answer: Digital Video

Explanation: So basically, online content videos on the internet are in the form of encoded digital data displayed in rapid succession. Such kind of data therefore can be streamed in a digital video.

4 0
3 years ago
Difference between volatile and non volatile memory
slega [8]
<span>Volatile memory requires electricity or some kind of current to store information, and nonvolatile memory does not.</span>
6 0
3 years ago
Read 2 more answers
Sergio knows that to meet the project requirements, it is essential to have
zhenek [66]

Answer:

I need a better explanation??

4 0
3 years ago
Given a sorted array of integers created on the heap, its size and a new integer, design a function which will enlarge the array
Debora [2.8K]

Using the computational language in C++ to write a code that will organize the values ​​in an array through a mathematical condition.

<h3>writing code in C++</h3>

<em>#include <bits/stdc++.h></em>

<em>using namespace std;</em>

<em>int getIndexInSortedArray(int arr[], int n, int idx)</em>

<em>{</em>

<em>/* Count of elements smaller than current</em>

<em>element plus the equal element occurring</em>

<em>before given index*/</em>

<em>int result = 0;</em>

<em>for (int i = 0; i < n; i++) {</em>

<em>if (arr[i] < arr[idx])</em>

<em>result++;</em>

<em>if (arr[i] == arr[idx] && i < idx)</em>

<em>result++;</em>

<em>}</em>

<em>return result;</em>

<em>}</em>

<em>int main()</em>

<em>{</em>

<em>int arr[] = { 3, 4, 3, 5, 2, 3, 4, 3, 1, 5 };</em>

<em>int n = sizeof(arr) / sizeof(arr[0]);</em>

<em>int idxOfEle = 5;</em>

<em>cout << getIndexInSortedArray(arr, n, idxOfEle);</em>

<em>return 0;</em>

<em>}</em>

See more about C++ at brainly.com/question/12975450

#SPJ1

7 0
2 years ago
Considering the following algorithm, which of the following requirements are satisfied?
Alisiya [41]

Answer:

b) Bounded Waiting

Explanation:

int currentThread = 1;

bool thread1Access = true;

bool thread2Access = true;

thread1 { thread2 {

While (true) {

                   While (true)

                                   {

                     while(thread2Access == true)

                                       {

                                      while(thread1Access == true)

                                       {

                                            If (currentThread == 2) {

                                              If (currentThread == 1)

                                                {        

                                                  thread1Access = false; thread2Access = false;

                                                  While (currentThread == 2);

                                                 While (currentThread == 1);

                                                  thread1Access = true; thread2Access = true;

} }

/* start of critical section */ /* start of critical section */

currentThread = 2 currentThread = 1

… ...

/* end of critical section */ /* end of critical section */

thread1Access = false; thread2Access = false;

… ...

} }

} }

} }

It can be seen that in all the instances, both threads are programmed to share same resource at the same time, and hence this is the bounded waiting. For Mutual exclusion, two threads cannot share one resource at one time. They must share simultaneously. Also there should be no deadlock. For Progress each thread should have exclusive access to all the resources. Thus its definitely the not the Progress. And hence its Bounded waiting.

4 0
3 years ago
Other questions:
  • A ____ is a type of program that uses a grid to organize and work with data.
    14·1 answer
  • ____ is another term for document properties.
    12·1 answer
  • A range check that can be used in Microsoft access to calculate the data collected which is date and time
    10·1 answer
  • A computer consists of both software and hardware. a)Define the term software​
    5·1 answer
  • Converting Denary to Binary
    15·1 answer
  • Suppose a family has had a house fire in which
    7·2 answers
  • In dos operating system ,write a command to delete the directory as well as the files of the directory ''world'' on drive E.
    15·1 answer
  • The most effective technique of malware propagation among the following list
    7·1 answer
  • Simple example of hybrid computer​
    7·2 answers
  • What are node in a computer network​
    14·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!