CS-403 Final Term Exams Preparation Virtual University With Answers

image
image
image

CS-403 Final Term Exams Preparation Virtual University

Sr. # Questions Answers Choice
1 Which of the following is not true about relational tables? Column values are of the same kind Each row is unique Each column must have a unique name. The sequence of rows is significant.
2 Which feature of database provides conversion from inconsistent state of DB to a consistent state ensuring minimum data loss? User accessible catalog Data processing Authorization service Recovery service
3 ALTER TABLE exams RENAME COLUMN Q_description TO Question_Descp, Std_ID to Student_ID. Syntax of ALTER TABLE is NOT correct True False Not Sure
4 Which of following is NOT generally the aim of data partitioning and placement of data? Reduce Workload Balance Workload Merging different relations Speed up rate of useful works.
5 _______ records data by burning microscopic holes in the surface of the disk with a laser. Hard disk RAM Optical disk Floppy disk
6 _______is a control that enables users to select one option from an associated list; users can also type an option. Combo box Button Text box Static area
7 The main memory of a computer system is also known as ROM RAM PROM Hard disk
8 Which of the following is not true regarding Indexes? Index can be defined even when there is no data in the table It support Range selections It can be created using ‘Create Index’ statement It can not be created on composite attributes
9 What is the impact of setting multiple indexes for the same key, in index sequential files? Multiple indexes for the same key can not be set It increases efficiency It decreases efficiency It will increase complexity as the access time will be increased
10 Identify the correct statement Entity integrity constraints specify that primary key values can be composite Entity integrity constraints are specified on individual relations. Entity integrity constraints are specified between weak entities. When entity integrity rules are enforced, a tuple in one relation that refers to another relation must refer to an existing tuple.
Download This Set
×