MCQOPTIONS
Bookmark
Saved Bookmarks
→
Technical Questions
→
Database
→
The time complexity of sequential search is
1.
The time complexity of sequential search is
A.
O(n)
B.
O(2n)
C.
O(n^2)
D.
None
Answer» B. O(2n)
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
Which of the following delimiter is ASP style?
Which of the following function can assign the output to a string variable
In mail($param2, $param2, $param3, $param4), the $param2 contains:
Which of following function return 1 when output is successful?
Which of the following delimiter syntax is PHP\'s default delimiter syntax
Which of the following statement produce different output
Which of the following data type is compound datatype supported by PHP
Which of the following is not a database object in MS Access?
Which of the following is true about cloud computing?
Which of the following is not true about cloud computing?_x005F_x000D_
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply
Your experience on this site will be improved by allowing cookies. Read
Cookie Policy
Reject
Allow cookies
