341 views
0 votes
0 votes
An array A of unknown size is filled with special symbols let say ‘#’ . Time required to find the size of A is:

(A) O(1)

(B) O(logn)

(C) O(n)

(D) O((logn)$^{2}$)

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
1
jugnu1337 asked May 16, 2023
364 views
The total number of binary trees possible with height n - 2 having n nodes are?(2n - 5)^ 2n - 3 (2n - 7)^2n - 3(n - 3) ^2n - 2(2n - 7)^ 2n - 2
0 votes
0 votes
1 answer
2
0 votes
0 votes
1 answer
3
rsansiya111 asked Dec 20, 2021
489 views
Consider the following C program:#include <stdio.h>int r( ){static int num = 7;return num ;}int main ( ) {for (r( ) ;r ( ) ;r ( ) )printf(“ % d”, r( ) );return 0;}Whi...
0 votes
0 votes
1 answer
4
rsansiya111 asked Dec 19, 2021
270 views