Curioustab
Aptitude
General Knowledge
Verbal Reasoning
Computer Science
Interview
Aptitude
General Knowledge
Verbal Reasoning
Computer Science
Interview
Home
»
Technical Questions
»
Database
The time complexity of sequential search is
O(n)
O(2n)
O(n^2)
None
Correct Answer:
O(n)
Explanation:
The time complexity of sequential search is O(n)
← Previous Question
Next Question→
More Questions from
Database
If you are using C language to implement the heterogeneous linked list, what pointer type will you use?
Does the minimum spanning tree of a graph give the shortest distance between any 2 specified nodes?
Which of the following products implemented the CODASYL DBTG model?
Which of the following indicates the maximum number of entities that can be involved in a relationship?
A reason for using an SQL view to hide columns is:
Which of the following occurs when a transaction rereads data it has previously read and finds modification or deletions caused by a committed transaction?
SQL Server program code that is executed instead of an SQL command that needs to be processed is called
The expression FOR XML RAW tells SQL Server to:
The "curse of dimensionality" relates to which problem of using operational data for BI reporting?
A report generated by a reporting system is delivered to the appropriate users via a user-accessed Web site. This system uses which of the following report modes?
Discussion & Comments
No comments yet. Be the first to comment!
Name:
Comment:
Post Comment
Join Discussion
Discussion & Comments