change
This commit is contained in:
parent
14de295a1b
commit
af761f133b
223 changed files with 109433 additions and 16949 deletions
25
4a1s/CP/PL - Aula 2.md
Normal file
25
4a1s/CP/PL - Aula 2.md
Normal file
|
@ -0,0 +1,25 @@
|
|||
20 de Setembro 2023 - #CP
|
||||
|
||||
> [!note]
|
||||
> As resoluções dos exercícios aqui contidos podem conter erros. Se detetares um problema (e se o souberes resolver) por favor contacta-nos.
|
||||
|
||||
> [!note]
|
||||
> These resolutions are using the file ***mmult.c*** available and developed by the professors.
|
||||
## Ex. 1
|
||||
a)
|
||||
> [!help]- What is the complexity of the MM (i.e., in big O notation, where N is the problem size and NxN is the matrix size)?
|
||||
> O()
|
||||
|
||||
>[!hint]- Big O Notation Cheat Sheet
|
||||
>- Constant: O(1)
|
||||
>- Linear time: O(n)
|
||||
>- Logarithmic time: O(n log n)
|
||||
>- Quadratic time: O(n^2)
|
||||
>- Exponential time: O(2^n)
|
||||
>- Factorial time: O(n!)
|
||||
|
||||
>[!help]- What increase in execution time is expected when the N doubles?
|
||||
|
||||
>[!help]- Which component of the performance equation is affected (e.g., \#I, CPI or Tcc)?
|
||||
>
|
||||
|
Loading…
Add table
Add a link
Reference in a new issue