All categories

3 years ago

is there an app i can use to make a picture appear in the corner of a video then disappear after being up for a second?

Computers and Technology

2 answers:

Nuetrik [128]3 years ago

7 0

Umm i really do not know i'm sorry

WITCHER [35]3 years ago

6 0

Answer:

vivacut or funimate are good for me

You might be interested in

A slide show is another name for a PowerPoint presentation. <br> a. True<br> b. False

ruslelena [56]

It is true because a powepoint is a projecter

8 0

3 years ago

Read 2 more answers

Whenever you are designing a project for commercial use (making money) and need to use photographs with people in them you must

Leya [2.2K]

Answer:

Explanation:

7 0

3 years ago

Hlo friends what is full form of RAM and ROM

Usimov [2.4K]

Answer:

Hello.

Explanation:

The full form of

RAM=Random Acess Memory.

ROM=Read Only Memory.

6 0

2 years ago

Read 2 more answers

A startup disk cannot be detected when booting a computer. The disk's pressence is reported by the system firmware, But Windows

olasank [31]

Answer:

Bootrec.exe

Explanation:

The process of turning on a computer system is called booting. When a computer system boots, it runs the post test and loads into memory, the information or program needed to run the operating system, and then locates the operating system from the boot manager record in the disk partitions. When the disk is failed to be recorded, or the boot manager or sector is corrupt or lost, the bootrec.exe command is used in the command prompt to correct these problems.

8 0

2 years ago

Suppose you wish to develop a matrix-multiplication algorithm that is asymptotically faster than Strassen’s algorithm. Your algo

Kazeer [188]

Answer:

The number of subproblems are given as $T(n)=a*T(n/8)+\theta(n^2)$ while the value of T(n) to be less than S(n) is for 342.

Explanation:

The number of subproblems are given as

$T(n)=a*T(n/8)+\theta(n^2)$

Asymptotic running time for Strassen’s algorithm is $S(n)=\theta(n^{log(7)})$

Now, when a increases, number of subproblems determines the asymptotic running time of the problem and case 1 of master theorem applies. So, in worst case, asymptotic running time of the algorithm will be

$T(n)=\theta(n^{logb(a)})=\theta(n^{log8(a)})=\theta(n^{log_{2}(a^{1/3})})$

Now, for T(n) to be smaller than S(n)

$n^{loga^{1/3}}$

So,

$log(a^{(1/3)})$

So,

a=342

5 0

3 years ago