Answer:
A. FilmoraGo; C. Adobe Premiere
Explanation:
Many video editing software exists out there, but their function is pretty much the same. They edit, mix and customize clips to create beautiful multimedia content for different purposes (advertisements, podcasts, movies, comedy clips, etc.). This software used are different as some may contain more functions and setting than the other.
Let us take a brief dive into the options:
- FilmoraGo: is a video editing software that runs on Andriod and iOS. It contains many effects and it is pretty basic to use and understand.
- Google Photos: Created by Google, helps to organize your photo albums and stores them for you.
- Adobe Premiere: is also a video editing software, it was first launched in 2003 and has since evolved to contain more sophisticated video editing tools.
- Audacity: is an audio editor available for Windows, Mac OS, and Linux. This software is completely free and open source.
Hence, dLucy can use the FilmoraGo or the Adobe Premiere to edit her video clips.
Answer:
Databases store data in tables that interact; spreadsheets store data in cells that interact.
Explanation:
answer:
1.The program comes to a line of code containing a "function call".
2.The program enters the function (starts at the first line in the function code).
3.All instructions inside of the function are executed from top to bottom.
4.The program leaves the function and goes back to where it started from.
5.Any data computed and RETURNED by the function is used in place of the function in the original line of code.
Import java.util.Scanner;
class hola
{
public static void main(String[]args)
{
Scanner x=new Scanner(System.in);
int a=x.nextInt();
int b;
if(a>20&&a<100)
{
b=a%12;
if(b%2==0){
System.out.print("es par"+b);
}
else{
System.out.print("es impar"+b);
}
}
}
}
Answer:
A linear search is one that scans every record/file until it discovers the value being searched for.
Binary search, on the other hand, is also known as <em>Logarithmic search</em>. It is used to locate the position of a value inside an array that has already been sorted.
The linear search will return the lowest value faster than the binary search when small arrays are involved.
This will only be feasible when the array is sorted prior.
Cheers!
