Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
The File Based System
File based systems are an early attempt to computerise the manual filing system. For example, a manual file can be set up to hold all the correspondence relating to an exacting matter as a project, product, task, employee or client. In an organisation there could be a lot of such files which may be stored and labelled. The same could be done at homes where file relating to tax payments, bank statements, receipts, etc., could be maintained.
What do we do to search information from these files? For finding of information, the entries could be searched in sequence. Alternatively, an indexing system could be used to situate the information.
The manual filing system works well when the amount of items to be stored is small. It even works fairly well when the number of items stored is fairly large and they are only needed to be retrieved and stored. Though, a manual file system crashes when processing of information and cross-referencing in the files is carried out. For instance, in a university a number of students are enrolled who have the options of doing many courses. The university may have divide files for the personal details of students, fees paid by students, the number and details of the courses taught, the number and details of each faculty member in many departments. Consider the effort to answer the following queries.
The solutions to all the questions above would be time consuming in the file based system and cumbersome.
MOSS VALE is a town with 15000 inhabitants. The fire department wishes to develop a system that automates the despatch of fire engines to attend fires. The ERD below describes the
Compare wait-die deadlock prevention scheme with wait-wound scheme Ans: Wait-Die Scheme a) Based upon a nonpreemptive technique. b) If Pi requests a resource present
An ideal data dictionary should have everything a DBA wants to know about the database. 1 Conceptual, External, and internal database descriptions. 2. Descriptions of attr
Define Assertions in SQL a. An assertion is a predicate that is expressing a condition we wish the database to always satisfy. b. Domain constraints, functional dependency
Critically evaluate the bulleted list of information-related items in this case study. How are each contradictory to the notion of being an information-literate knowledge worker?
DDL Compiler The DDL compiler changes the data definition statements (such as CREATE TABLE .... in SQL) into a set of tables having metadata tables. These tables have infor
Hierarchical
explain in detail about crash recovery
Define instance and schema? Instance: Collection of data kept in the data base at a particular moment is known as an Instance of the database. Schema: The o
WHY SHOULD NULL IN A RELATION BE AVOID AS possible?
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd