Home > Download > SMU - Question Paper
> BCA > BC0041
Fundamentals Of Database Management
This is the collection of
Sikkim Manipal University (SMU) question and answers for Fundamentals Of Database Management. 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 Fundamentals Of Database Management, SMU - Bachelor of Computer Application.
Course Name
BCA (Bachelor of Computer Application)
Subject Code BC0041 (Fundamentals Of Database Management)
Get Questions
PART - A
PART - B
PART - C
Subject : Fundamentals Of Database Management
BC0041 : PART - B
| Q. 1 | True or False
1) The process of finding a good query plan is
called cost based optimizes
2) bit data type can be indexed
3) view cannot be updated
4) Static curser cannot be fetched |
| | A) | TTTT |
| B) | FTFT | | C) | FFTT | | D) | FFTF | | | | | Q. 2 | What are the criteria to be considered,
while designing a database from users point of
view?
a) Meaningful grouping of attributes
b) No inapplicable attributes
c) Define constraints so that correctness of data
will be ensured. |
| | A) | a), b), c) and d) |
| B) | a), and c) | | C) | b), and d) | | D) | a), b) and d) | | | | | Q. 3 | What are the operations that are
normally supported for the indexed-sequential
file
1. Open
2. Read
3. Rewrite
4. Write
5. Delete |
| | A) | 1, 3, 4, 5 |
| B) | 1,2,4,5 | | C) | 1,2,3,4 | | D) | 1, 2, 3, 4, 5 | | | | | Q. 4 | 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 va |
| | A) | a), b), c), d) |
| B) | a), b), c) | | C) | a), c), d) | | D) | c) and d) | | | | | Q. 5 | 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 rea |
| | A) | 1, 3, 4 |
| B) | 1, 2, 3 | | C) | 2, 3, 4 | | D) | 1,2,3,4 | | | |
Click here to get
Fundamentals Of Database Management (BC0041)
New Question
Home > Download > SMU - Question Paper
> BCA > BC0041