recategorized by
97 views
0 votes
0 votes

The average number of accesses to access the desired record stored in a sequential file containing $n$ records is

  1. $(n+1)/2$
  2. $n/2$
  3. $(n − 1)/2$
  4. $n$
recategorized by

Please log in or register to answer this question.

Related questions

0 votes
0 votes
1 answer
1
gatecse asked Aug 4, 2019
304 views
In relational DBMS, the closure of functional dependencies facilitates To determine the candidate key To determine the foreign key To determine the dependency of an attr...
0 votes
0 votes
1 answer
2
gatecse asked Aug 4, 2019
335 views
The schema for the entire database is designed using Data definitional languageStructured query languageData manipulation language Schema structure language
0 votes
0 votes
0 answers
3
gatecse asked Aug 4, 2019
243 views
The Software Development Life Cycle (SDLC) is used in allProcess modelsDesign modelsProgramming modelsNone of these
0 votes
0 votes
0 answers
4
gatecse asked Aug 4, 2019
256 views
The complexity of algorithms is comparatively more accurate in the use ofAsymptotic analysisAmortized analysisBoth of theseNot dependent on the nature of analysis.