$(1)$ Given functions $f(n)$ and $g(n),$ we say that $f(n)$ is $O(g(n))$ if and only if there.

are positive constants $c$ and no such that

for $n>-n_0.$

Answer:

$($A$)f(n)>g(n)$

$($B$)f(n)cg(n)$

$($C$)f(n)cg(n)$

$($D$)$ ppNO$(N)O(N^2)O(1)O(logN)f(n)$

$(2)$ Given a node $pin$ a $singly$ linked list, what $is$ the time complexity $of$

deleting node $p$ without knowing which node $is$ before $p?Nis$ the number

$of$ nodes $in$ the list.

Answer:

$(A)O(N)$

$(B)O(N^2)$

$(C)O(1)$

$(D)O(logN)$