Archive for technical database questions and answers

You are browsing the archives of technical database questions and answers.

RDBMS -advanced Interview questions for freshers

81. What are database files, control files and log files. How many of these files should a database have at least? Why?
Database Files
The database files hold the actual data and are typically the largest in size. Depending on their sizes, the tables (and other objects) for all the user accounts can go in one database file—but [...]

RDBMS questions with answers for freshers

21. What is an attribute?
It is a particular property, which describes the entity.
22. What is a Relation Schema and a Relation?
A relation Schema denoted by R(A1, A2, …, An) is made up of the relation name R and the list of attributes Ai that it contains. A relation is defined as a set of tuples. Let [...]

Quantitative Aptitude questions and answers

Try the following.
1. There are seventy clerks working in a company, of which 30 are females. Also, 30 clerks are married; 24 clerks are above 25 years of age; 19 married clerks are above 25 years, of which 7 are males; 12 males are above 25 years of age; and 15 males are married. [...]

Quantitative Aptitude questions and answers

For the following, find the next term in the series
1. 6, 24, 60,120, 210
a) 336 b) 366 c) 330 d) 660
Answer : a) 336
Explanation : The series is 1.2.3, 2.3.4, 3.4.5, 4.5.6, 5.6.7, ….. ( ‘.’ means product)
2. [...]

Quantitative Aptitude questions and answers

Quantitative Aptitude  questions and answers

19. If a light flashes every 6 seconds, how many times will it flash in ¾ of an hour?
20. If point P is on line segment AB, then which of the following is always true?
(1) AP = PB (2) AP > PB (3) PB > AP (4) AB > AP (5) [...]

data structures aptitude questions and answers

data structures aptitude questions and answers

26. In RDBMS, what is the efficient data structure used in the internal storage representation?
B+ tree. Because in B+ tree, all the data is stored only in leaf nodes, that makes searching easier. This corresponds to the records that shall be stored in leaf nodes.
27. Draw the B-tree of order 3 created by [...]

Close