What is the time required to locate the occurrences of a pattern P of length m in a string of length n using suffix array?
A. O(nm)
B. O(n2)
C. O(mnlogn)
D. O(mlogn)
Answer: Option D
A. O(nm)
B. O(n2)
C. O(mnlogn)
D. O(mlogn)
Answer: Option D
What is the time complexity of accessing an element in an array by index?
A. O(n)
B. O(1)
C. O(log n)
D. O(n log n)
Which of the following is the correct way to declare an array in C?
A. int array[];
B. array{int};
C. int array[10];
D. int array();
How do you find the length of an array in Java?
A. array.size();
B. array.length;
C. array.length();
D. array.size;
Join The Discussion