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

PLZ HELP WILL MARK BRANLIEST Jargon is:

Computers and Technology
1 answer:
77julia77 [94]2 years ago
7 0

Answer:C language that include terms that only a select

Explanation:

It’s the right one

You might be interested in
Website managers use____ every day.
babymother [125]

Answer:

technology

Explanation:

4 0
3 years ago
Read 2 more answers
What is the name given a technological program that typically copies itself and moves through a computer system in order to disr
goldfiish [28.3K]

Answer:

Class of software called "malware"

Explanation:

Some features of malware software:

  • Viruses, worms, Trojans and bots are malware.
  •  Malware is the abbreviation for "malicious software" (malicious code).
  •  Specifically designed to damage, interrupt, illegally steal data from a network.
  • A Trojan it is  software that looks legitimate. Users are typically tricked into loading and executing it on their systems.  

7 0
2 years ago
What is the meaning of the word joystick
Roman55 [17]
<span>The meaning of Joystick is the control column of an aircraft</span>
4 0
2 years ago
Read 2 more answers
Is it safe to tape down cords such as internet cables to the floor?
zhenek [66]

Yes it is safe to tape down cords such as internet cables to the floor

5 0
3 years ago
Chegg Suppose the heap is a full tree, size 2^n-1. what is the minimum number of steps to change a min heap to a max heap. Show
adoni [48]

Answer:

Explanation:

We start from the bottom-most and rightmost internal node of min Heap and then heapify all internal modes in the bottom-up way to build the Max heap.

To build a heap, the following algorithm is implemented for any input array.

BUILD-HEAP(A)

   heapsize := size(A)

   for i := floor(heapsize/2) downto 1

       do HEAPIFY(A, i)

   end for

Convert the given array of elements into an almost complete binary tree.

Ensure that the tree is a max heap.

Check that every non-leaf node contains a greater or equal value element than its child nodes.

If there exists any node that does not satisfy the ordering property of max heap, swap the elements.

Start checking from a non-leaf node with the highest index (bottom to top and right to left).

4 0
2 years ago
Other questions:
  • Technological _____ is the term used to describe the merging of several technologies into a single device.
    13·1 answer
  • What error, if any, is in the following code?
    11·1 answer
  • Microsoft words spell checker
    9·1 answer
  • Pleasee help. How do you fix this problem in discord?
    10·1 answer
  • The data-mining technique that creates a report or visual representation is _____.
    13·1 answer
  • Can someone help me with this lab assignment? I really do not know what should I do?
    5·1 answer
  • When looking at security standard and compliance, which three (3) are characteristics of best practices, baselines and framework
    8·1 answer
  • You should move around and take a rest for 30 minutes every 5 minutes.<br><br>True Or False​
    9·1 answer
  • When the CPU performs the work described in the commands,
    11·1 answer
  • What are the importance of computer software​
    9·2 answers
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!