1) Which one of the following statements is / are true about SQL?
a. SQL permits attribute names to be repeated in the same relation
b. If there are no indexes on the relations then an SQL query will not work
c. Duplicates are automatically eliminated by an SQL query
d. None of the above
b. The number of blocks used for the index, the size of the blocks and the size of the address of the blocks
c. The number of blocks used for the index and the size of the blocks
d. None of the above
b. In red-black trees, the leaf nodes are not relevant and do not contain data.
c. In red-black trees, the leaf nodes are relevant but do not contain data.
d. Both a and c above
b. Rooted Complete Binary Tree
c. Complete Binary Tree
d. Degenerate Tree
b. <html>.....</html>
c. <body>.....</body>
d. <p>.....</p>
b. BCNF is stricter than 3NF
c. Lossless, dependency - preserving decomposition into 3NF is always possible
d. Lossless, dependency - preserving decomposition into BCNF is always possible
a. SQL permits attribute names to be repeated in the same relation
b. If there are no indexes on the relations then an SQL query will not work
c. Duplicates are automatically eliminated by an SQL query
d. None of the above
2) What is the maximum possible size of the file in the index allocation scheme of blocks to a file depend on? (Database)
a. The size of the blocks and the size of the address of the blocksb. The number of blocks used for the index, the size of the blocks and the size of the address of the blocks
c. The number of blocks used for the index and the size of the blocks
d. None of the above
3)What is the pecularity of Red - black Trees?
a. In red-black trees, the root do not contain data.b. In red-black trees, the leaf nodes are not relevant and do not contain data.
c. In red-black trees, the leaf nodes are relevant but do not contain data.
d. Both a and c above
4) ________ is a tree where each parent node have only one associated child node.
a. Balanced Binary Treeb. Rooted Complete Binary Tree
c. Complete Binary Tree
d. Degenerate Tree
5) Which of the following is a declaration for an HTML document?
a. <!DOCTYPE html>b. <html>.....</html>
c. <body>.....</body>
d. <p>.....</p>
6) Which of the following statement is / are not true about normal forms? (Database)
a. Any relation with two attributes is in BCNFb. BCNF is stricter than 3NF
c. Lossless, dependency - preserving decomposition into 3NF is always possible
d. Lossless, dependency - preserving decomposition into BCNF is always possible
Answers:
1) d
2) c
3) b
4) d
5) a
6) d
No comments:
Post a Comment