Home > Download > SMU - Question Paper
> BSc IT > BT0066
Database Management Systems
This is the collection of
Sikkim Manipal University (SMU) question and answers for Database Management Systems . It will help
to prepare your examination. All question paper are
classified as per semester, subject code and question type of Part A, Part B and Part C with
multiple
choice options
as same as actual examination. SMU question papers includes
year 2025, 2024, 2023 Sem I, II, III, IV, V, VI examinations
of all subjects.
SMU question test set of old,
last and previous year are updated
regularly and it is absolutely free to use. Question paper includes Visual basic 6, VB.Net, C#, ASP.Net,
Web, Oracle, Database, SQL, Software Engineering, C, C++, OOPS, MBA, MCA, BSC IT I have requested
you kindly send me the question paper of Database Management Systems , SMU - Bachelor of Science in Information Technology.
Course Name
BSc IT (Bachelor of Science in Information Technology)
Subject Code BT0066 (Database Management Systems )
Get Questions
PART - A
PART - B
PART - C
Subject : Database Management Systems
BT0066 : PART - B
| Q. 1 | ___________ allows individual row
operation to be performed on a given result set
or on the generated by a selected statement. |
| | A) | Procedure |
| B) | Trigger | | C) | Curser | | D) | None of above | | | | | Q. 2 | What are the salient features of Data
model.
1. It processes a set of concepts for description
of the nature of data interrelationships between
them along with the syntax
2. It should have as minimum concepts which
are close to real world.
3. It should provide primitive by which
meaning of data can be captured.
4. It mainly describes the data, which gets
stored & processed in a given situation. |
| | A) | 1, 3, 4 |
| B) | 1, 2, 3 | | C) | 2, 3, 4 | | D) | 1,2,3,4 | | | | | Q. 3 | Describe the B-tree data structure
a) an order m is associated with a B-tree
b) the root node has at least (m/2) key value
and 2 pointers
c) all root nodes are that same level
d) all nodes other than root have at least (m/2)
key value and (m/2+1) pointers |
| | A) | a), b), c), d) |
| B) | a), b), c) | | C) | a), c), d) | | D) | c) and d) | | | | | Q. 4 | Database Management should:
1. be possible to store, access & maintain the
large size of data
2. permit data storage in integrated fashion by
fragmenting in different application which
control redundant data
3. have a central repository with data
description at both logical & physical levels |
| | A) | 1., 2 |
| B) | 1, 3 | | C) | 2, 3 | | D) | 1, 2, 3 | | | | | Q. 5 | An extent is __ contiguous pages, or ___
KB. Therefore, a database has ___ extents per
megabyte. |
| | A) | 8, 64, 16 |
| B) | 8, 16, 64 | | C) | 16, 8, 64 | | D) | 64, 8, 16 | | | |
Click here to get
Database Management Systems (BT0066 )
New Question
Home > Download > SMU - Question Paper
> BSc IT > BT0066