File Organization and Fundamental of Databases B.SC Question Bank : mitacsc.ac.in
Name of the University : University of Pune
Name of the College : MIT Arts Commerce & Science College
Degree : B.SC
Department : Computer Science
Subject Code/Name : File Organization and Fundamental of Databases
Year : I
Document Type : Question Bank
Website : mitacsc.ac.in
Download Model/Sample Question Paper : https://www.pdfquestion.in/uploads/mitacsc.ac.in/3797-FOFD.pdf
MIT Arts Computer Science Paper II
Subject – FOFD :
Chapter 1 :
File Organization
1. Write short notes on sequential files
Related : MIT Arts Commerce & Science College CS-221 Object Oriented Concepts & Programming in C++ B.SC Question Bank : www.pdfquestion.in/3814.html
2. What are Hash files and explain-
3. What is the difference between Physical and Logical files-
4. What is file- Explain different operations performed on the file.
5. Explain field structure in brief.
6. State difference in spanned and unspanned records.
7. Compare variable length record and fixed length record.
8. Discuss the advantages and disadvantages of usinga)Unordered file
9. Write short note on sorted or sequential file
10. Explain HHCAP file (serial file) organization.
Indexed file organization
Chapter 2 :
1. Explain index file organization in brief.
2. Define logical & physical files. Which are the special characters –
3. Explain field structure in brief.
4. Explain different operation performed on file for locating –
5. Compare variable length record and fixed length record.
6. What is an index file- What is the relationship –
7. What is a clustered index- How many clustered indexes
8. State different types of indexes.
9. What are the advantages & disadvantages of index –
10. What are B+ trees- Give insertion & deletions in the same.
11. Write a note on B tree.
12. What is limit indexing- Explain-
13. Explain multilevel indexing in detail.
14. Explain insertion in index sequential file with example.
15. Explain the structure of index sequential files.
16. Explain B + tree deletion algorithm.
Introduction of DBMS
Chapter 3 :
1. What is DBMS- What are the functions-
2. What are drawbacks of conventional file processing system-
3. What is the difference between the FPS & DBMS-
4. State the advantages of DBMS
5. What is data abstraction- What are different levels of data abstraction-
6. What is data independence- What are its different types-
7. What are tasks or functions of DBS Manager-
8. What are different types of database users-
9. What are functions of DBA-
10. Give the difference between logical & physical data independence-
11. Explain following terms,a. Instance
12. “Controlling redundancy is the capability of good DBMS” Explain.
13. “DBA is responsible for organizing the system
14. What capabilities a good DBMS should have-
15. Explain different components of DBMS structure.
Conceptual Design
Chapter 4 : (E – R Model) :
1. Define an entity and entity sets.
2. What is data dictionary- What is the information stored in the data dictionary.
3. Explain different types of Data Models-
4. Explain with suitable examples an entity and entity sets.
5. Explain relationships & relationship sets with example.
6. Write a short note on ER diagrams.
7. What is generalization? Explain with examples.
8. What is an attributes? Explain its types in detail.
9. What is specialization?
10. Differentiate between specialization & generalization.
11. Explain the difference between primary key & foreign key.
12. What are the candidate key & super key?
13. Explain types of entity with suitable examples.
14. State different types of relationship can exist between entity sets in an E – R Model.
15. What are the different categories of query languages?
16. Discuss in detail two of the most important types of constraints.
Relational Data Model
Chapter 5 :
1. Explain basic structure of SQL expression.
2. Explain relational data model with example.
3. Define functional dependency.
4. What are the advantages & disadvantages of RDM?
5. What is a relation? Explain the degree of a relation with types.
6. Write short note on,
a. Domain
b. Tuple
c. Super key
d. Candidate key
7. What is key constraint? Explain types of constraints.
8. Explain conversion of weak entity set with example.
9. What is data integrity?
10. Enlist the steps followed for conversion of E R to Relational model.
11. Explain different data integrity types?
Relational Algebra
Chapter 6 :
1. Write a short note on query language.
2. Explain the following operation from relational algebra.
a. Select
b. Project
c. Union
d. Rename
e. Division
f. Cartesion product
g. Difference
h. Intersection
i. Natural join
j. Outer join
3. What is join? Explain various forms of outer join with example.
4. What is union? How it is represented. Explain with the example.
5. What is select operation? How it is represented & Explain with an example.
6. Define left outer join.
7. Define Natural join with example.