Checkpoints are a part of
Answer: A
Correct answer: Recovery measures.
A checkpoint records that everything up to a point has been written to disk, so recovery after a crash need only examine the log from that point onwards instead of from the beginning.
Please log in or register to report this question.
Relational Algebra is
Answer: C
Correct answer: Procedural query Language
Relational algebra is procedural: an expression specifies a sequence of operations - select, then project, then join - and so says how the result is to be obtained. Relational calculus and SQL are declarative by contrast.
Please log in or register to report this question.
The transactions like adding an employee, enrolling a student in a course are examples of _______
Answer: A
Correct answer: Logical
Adding an employee or enrolling a student is one logical operation as the user sees it, though the DBMS may carry it out as several physical writes to different tables and index pages. Keeping the two levels apart is what lets a transaction be treated as indivisible.
Please log in or register to report this question.
Maximum height of a B+ tree of order m with n key values is
Answer: D
Correct answer: None of these
In a B+ tree of order m each node holds at least \( \lceil m/2 \rceil \) pointers, so the height is bounded by
\[ h \le \log_{\lceil m/2 \rceil}(n) \]
The base is \( \lceil m/2 \rceil \), not m - the minimum fill, since the worst case is the sparsest tree. None of the three expressions offered has that form.
Please log in or register to report this question.
Which of the following addressing modes permits relocation without any change over in the code?
Answer: B
Correct answer: Base register addressing
With base register addressing every address in the code is an offset from a register loaded with the program's actual location, so moving the program means loading a different value into that register and changing nothing in the code itself. Indexed addressing exists to step through arrays and does not relocate anything.
Please log in or register to report this question.
Which among following relationship type is not possible to realize in Access Database directly?
Answer: C
Correct answer: Many to many
Access cannot store a many-to-many relationship directly; it has to be resolved into a junction table holding two one-to-many relationships, one to each of the original tables. That is a general property of the relational model rather than a limitation of Access.
Please log in or register to report this question.
SQL Server stores index information in the ______ system table.
Answer: C
Correct answer: sys indexes
Index information is held in the system table sysindexes, one of the catalogue tables whose names all begin with sys.
Please log in or register to report this question.
_____ database is used to provide statistical information or summaries of values based on various criteria.
Answer: A
Correct answer: Statistical
A statistical database is one designed to answer questions about aggregates - counts, sums, averages - rather than about individual records, which raises the particular problem of preventing individual values from being deduced from a series of summaries.
Please log in or register to report this question.
By ______ an area on disk in certain ways, one can make it represent a bit value of either zero (0) or one (1).
Answer: C
Correct answer: Magnetizing
A disk surface is coated with a magnetic material, and writing a bit means magnetizing a small region in one of two directions, which the head later reads back as 0 or 1.
Please log in or register to report this question.
In an ER model,_____ is described in the database by storing its data.
Answer: A
Correct answer: Entity
An entity is a thing about which data is kept - a student, an order - and it is represented in the database by the stored values of its attributes. An attribute is one such value and a relationship connects entities.
Please log in or register to report this question.
