Aspire Faculty ID #18873 · Topic: UGC NET Computer Science Nov 2021 (Paper II) · Just now
UGC NET Computer Science Nov 2021 (Paper II)

Given a fixed-length record file that is ordered on the key field. The file needs $B$ disk blocks to store $R$ number of records. Find the average access time needed to access any record of the given file using binary search.

Solution

The file is ordered on the key field, so binary search can be applied.

Binary search works on disk blocks, not directly on records.

If there are $B$ disk blocks, then number of block accesses required is approximately:

$\log_2 B$

So, average access time using binary search is:

$\log_2 B$

Previous 10 Questions — UGC NET Computer Science Nov 2021 (Paper II)

Nearest first
1
Consider following two statements:Statement I: Relational database schema represents the logical design of the database…
Topic: UGC NET Computer Science Nov 2021 (Paper II)
2
Consider a domain consisting of three Boolean variables Toothache, Cavity, and Catch. The full joint distribution is a …
Topic: UGC NET Computer Science Nov 2021 (Paper II)
3
Consider a domain consisting of three Boolean variables Toothache, Cavity, and Catch. The full joint distribution is a …
Topic: UGC NET Computer Science Nov 2021 (Paper II)
4
Consider a domain consisting of three Boolean variables Toothache, Cavity, and Catch. The full joint distribution is a …
Topic: UGC NET Computer Science Nov 2021 (Paper II)
5
Consider a domain consisting of three Boolean variables Toothache, Cavity, and Catch. The full joint distribution is a …
Topic: UGC NET Computer Science Nov 2021 (Paper II)
6
Consider a domain consisting of three Boolean variables Toothache, Cavity, and Catch. The full joint distribution is a …
Topic: UGC NET Computer Science Nov 2021 (Paper II)
7
Consider a domain consisting of three Boolean variables Toothache, Cavity, and Catch. The full joint distribution is a …
Topic: UGC NET Computer Science Nov 2021 (Paper II)
8
Consider the sentence below.There is a country that borders both India and Pakistan.Which of the following logical expr…
Topic: UGC NET Computer Science Nov 2021 (Paper II)
9
Which among the following statement(s) is(are) FALSE?A. Greedy best-first search is not optimal but is often efficient.…
Topic: UGC NET Computer Science Nov 2021 (Paper II)
10
Consider the given tree below. Calculate the value at the root of the tree using alpha‐beta pruning algorithm.
Topic: UGC NET Computer Science Nov 2021 (Paper II)

Next 10 Questions — UGC NET Computer Science Nov 2021 (Paper II)

Ascending by ID
1
Given the following STUDENT-COURSE scheme:STUDENT(Rollno, Name, courseno)COURSE(courseno, coursename, capacity)where Ro…
Topic: UGC NET Computer Science Nov 2021 (Paper II)
2
STUDENT(Rollno, Name, Courseno)COURSE(Courseno, Coursename, Capacity)where Rollno is the primary key of relation STUDEN…
Topic: UGC NET Computer Science Nov 2021 (Paper II)
3
Suppose a B tree is used for indexing a database file. Consider the following information:size of the search key field …
Topic: UGC NET Computer Science Nov 2021 (Paper II)
4
Given a relation scheme $R(x,y,z,w)$ with functional dependencies set$F=\{x\to y,\ z\to w\}$.All attributes take single…
Topic: UGC NET Computer Science Nov 2021 (Paper II)
5
A company is consuming parts in the manufacturing of other products. Each of the part is either manufactured within the…
Topic: UGC NET Computer Science Nov 2021 (Paper II)
6
 A transaction may be in one of the following states during its execution life cycle in concurrent execution envir…
Topic: UGC NET Computer Science Nov 2021 (Paper II)
7
 Which of the following is used to create a database schema?
Topic: UGC NET Computer Science Nov 2021 (Paper II)
8
Given memory access time as $p$ nanoseconds and additional $q$ nanoseconds for handling the page fault. What is the eff…
Topic: UGC NET Computer Science Nov 2021 (Paper II)
9
In a file allocation system, the following allocation schemes are used:A. ContiguousB. IndexedC. Linked allocationWhich…
Topic: UGC NET Computer Science Nov 2021 (Paper II)
10
Given below are three statements related to interrupt handling mechanism.A. Interrupt handler routine is not stored at …
Topic: UGC NET Computer Science Nov 2021 (Paper II)
Ask Your Question or Put Your Review.

loading...