MIT Arts, Commerce & Science College Alandi (D), Pune   

Question Bank for BCA    Sub: FILE STRUCTURE AND DATABASE CONCEPTS     

Chapter 1:  File Structure and Organization    1. 2. 3. 4. 5.

6. 7. 8. 9. 10. 11. 12.

What is File? Explain file structure in details.  Define logical & physical files.  Explain field structure in brief.   Compare variable length record and fixed length record.  Discuss the advantages and disadvantages of using   a) Unordered file  b) Ordered file  c) Hash file with respect to file operations search, insert & delete.  Write short notes on sequential files  What are Hash files and explain?  What is file? Explain different operations performed on the file.  State difference in spanned and unspanned records.  Write short note on sorted or sequential file   Explain index file organization in brief.  State different types of indexes. 

 

    Chapter 2: Tree Structure Indexing    1. What is an index file? What is the relationship between this files and indexes?  2. What is a clustered index? How many clustered indexes can you build on a file? How  many unclustered indexed can you build?  3. What are the advantages & disadvantages of index sequential files?  4. What are B+ trees? Give insertion & deletions in the same.   5. Write a note on B tree.  6. What is limit indexing? Explain?  7. Explain multilevel indexing in detail..  8. Explain the structure of index sequential files.  9. Explain B + tree deletion algorithm.   

        Chapter 3: Database Management System   

1. 2. 3. 4. 5. 6. 7. 8. 9. 10.

What is DBMS?  What are the limitations of conventional file processing system?  What is the difference between the traditional file system & DBMS?  State and explain the advantages  and disadvantages of DBMS  What is data abstraction? What are different levels of data abstraction?  What is data independence? What are its different types?  List and explain different types of database users?  What are functions performed by Database Administrator ( DBA)?  Give the difference between logical & physical data independence?  Write a short note on   a. DDL  b. DML  c. DCL  d. TCL  11. Explain following terms,  a. Instance   b. Schema  c. DML Compiler   d. Data dictionary   e. Data independence  12. What capabilities a good DBMS should have? Explain any four of them in detail?  13. Explain different components of DBMS structure.   

    Chapter 4: Data Models     1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12.

Explain different types of Data Models?  Explain relational data model with example.  Explain network data model with example.  Explain hierarchical data model with example.  Explain with suitable examples an entity and entity sets.  Explain types of entity with suitable examples.    What is an attributes? Explain its types in detail.  Explain relationships & relationship sets with example.  Write a short note on ER diagrams.  Explain the difference between primary key & foreign key.  Explain following terms  a. Primary key  b. Super key  c. Candidate Key  d. Foreign key  e. Composite key  13. State different types of relationship can exist between entity sets in an E – R Model.  14. What is generalization? Explain with examples.  15. What is specialization? Explain with examples. 

16. Draw an E‐R diagram for College admission system.  17. Draw an E‐R diagram for Hospital system   

    Chapter 5: Relational Databases    1. What are the advantages & disadvantages of RDM?  2. What is a relation? Explain the degree of a relation with types.  3. Write short note on,  f. Entity  g. Domain   h. Tuple  4. What is key constraint? Explain types of constraints.   5. Explain conversion of weak entity set with example.   6. What is data integrity?   7. Enlist the steps followed for conversion of E R to Relational model.  8. Explain different data integrity types?  9. 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       

  Chapter 6: SQL (STRUCTURED QUERY LANGUAGE)     1. Write short note on SQL  2. What is generalized structure of SQL query (with from & where)  3. Explain the following operations with suitable example.   a. Set operations   b. Predicates & join   c. Set membership   d. Set comparison  e. Aggregate function   f. Ordering of Tuple   4. Explain the following DDL commands of SQL.  a. Create  b. Alter 

5.

6. 7. 8. 9. 10. 11. 12.  

c. Drop  d. Truncate  Explain the following DML commands of SQL.  a. Insert  b. Delete  c. Update    How tables are created & maintained by using SQL.   Explain different aggregate functions with examples.  What are nested queries? How would you use the operators in, not in writing nested  queries?   What is grouping? Discuss the interaction of the having & where clauses.  Explain different data types used in SQL?  What is the difference between where and having clause of selected statement.   What is the use of BETWEEN operators in SQL? 

 

    Chapter 7 : Relational Database Design    1. 2. 3. 4. 5.

6. 7. 8. 9. 10.    

Define functional dependency.  Define functional dependency with example.  Explain different anomalies related with database design? Explain with example.  Specify needs of normalization.  Define normalization forms.   a. 1NF  b. 2NF  c. 3NF  d. BCNF  What is decomposition? What are the techniques of denormalization?  What is the purpose of Normalization?  Explain advantages and disadvantages of normalization.  What is integrity constraint?   What is unique constraint?  

MIT File Structure & Database Concepts.pdf

... multilevel indexing in detail.. 8. Explain the structure of index sequential files. 9. Explain B + tree deletion algorithm. Chapter 3: Database Management System.

99KB Sizes 7 Downloads 225 Views

Recommend Documents

Flat File Database - IPTNow
organise data using data structures called files, records, fields and characters. ... A Flat file database management system allow you to use only one database.

Data Structure and Algorithm for Big Database
recommendation for further exploration and some reading lists with some ... There is a natural tendency for companies to store data of all sorts: financial data, ...

Data Structure and Algorithm for Big Database - IJRIT
With the explosion of sensors, smart devices as well as social networking, data in an ... When a stack is implemented as a linked list, each node in the linked list ...

Data Structure and Algorithm for Big Database - IJRIT
We define big data as a data that is too big to fit in main memory resulting to a structure requirement on the data. The word “index” or “metadata” suggest that ...

php code to download pdf file from database
php code to download pdf file from database. php code to download pdf file from database. Open. Extract. Open with. Sign In. Main menu. Displaying php code ...

CertCoin - Mit
May 14, 2014 - Current approaches to authentication on the internet include .... We introduce Certcoin, a system that incorporates the best aspects of ... The “online” secret key is used to authenticate messages to and from the server hosting the

MIT-Erfolg-Zum-Goethe-Zertifikat-Ubungbuch-C1-MIT-CD-German ...
Page 1 of 3. Download ]]]]]>>>>>PDF Download MIT Erfolg Zum Goethe-Zertifikat: Ubungbuch C1 MIT CD (German Edition). (eBooks) MIT Erfolg Zum ...

MIT
These people are core researchers in our field. ... collective work well. ... These researchers have been much more interested in the consequences of shocks.

Revised MIT climate model sounds alarm - MIT News
May 20, 2009 - Including that feed- back “is just going to make it worse,” Prinn says. The lead author of the paper describing the new projections is Andrei Sokolov, research scien- tist in the Joint Program. Other authors, besides. Sokolov and P

An Optimised Structure Optimised Structure Optimised ... - IJRIT
Student, R V College of Engineering,ECE,Bangalore,Karnataka,India sachinbrraj@gmail. ... Fig 2: Differentiator. The CIC filter is a cascade of digital integrators followed by a cascade of combs (digital differentiators) in ... digital switch in betwe

MIT-HighSchool.pdf
This is a twopart video conference with a separate conference for Jr high and. Sr High students. Level of Suggested Preparation. 3 ​Requires 3 or more classes ...

Roll structure
Martin L. Samuels, Mount Holly, and John E. Pettit,. Burlington, NJ., assignors to United States Pipe and. Foundry Company, Birmingham, Ala., a corporation.

NARCISSISM AND LEADERSHIP - DSpace@MIT
(Chernow, 2004), business leaders of all stripes including Steve Jobs (Robins .... (see Maccoby, 2000, below), even at their best, narcissistic leaders are bound to leave ... Narcissists are notoriously poor, overinvolved, and abusive managers.

the lunar excursion module - MIT
the vehicle begins a coasting Hohmann transfer orbit to rendezvous with the. CSM. ... lish a collision course between the LEM and CSM. Beginning at about 5 ...

MIT Parkinson Alzheimer.pdf
The MRMR subset of all features is the first 200 features selected by Minimum-Redundancy-Maximum- Relevance .... Displaying MIT Parkinson Alzheimer.pdf.

Download File
ii Create a .GIF image with textual animation for the following theme: Flower and its parts. 30. 3 i Draw a smiley face and reposition the face along a circular path.