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 structures of files vary from operating system to operating system. In this unit, we will discuss the fundamentals of file structures with the generic file organisations.
A file may be described as a collection of records. Though, a text file doesn't conform to this definition at the first glance, it is also a set of records and records are words in the file.
Let a file consisting of information regarding students. We may name such a file as Student file. The typical records of such file are illustrated in Figure
Enum
Name
Ph no
Country
Programme
012786345
John
999896708965
USA
BCA
98387123
mandy
99997854775
MCA
Figure: Typical records of a Student file
A file should always be stored in such a way that the fundamental operations on it can be performed easily. In other terms, queries must be able to be executed without much hassle. We target, in this unit, on the ways of storing the files on external storage devices. Selection of a specific way of storing the file on the device based on factors such as retrieval records, the way the queries can be put onto the file, the total number of keys in each of record etc.
After learning this unit, you must be able to
Representation of data structure in memory is known as: Abstract data type
Q. Write down an algorithm to evaluate an expression given to you in postfix notation. Show the execution of your algorithm for the following given expression. AB^CD-EF/GH+/+*
Advantages of dry running a flowchart When dry running a flowchart it's advisable to draw up a trace table illustrating how variables change their values at every stage in the
Q. The reason bubble sort algorithm is inefficient is that it continues execution even after an array is sorted by performing unnecessary comparisons. Therefore, the number of comp
Circular Queues:- A more efficient queue representation is get by regarding the array Q(1:n) as circular. It becomes more convenient to declare the array as Q(O: n-1), when re
Have you ever thought about the handling of our files in operating system? Why do we contain a hierarchical file system? How do files saved & deleted under hierarchical directories
Huffman Encoding is one of the very simple algorithms to compress data. Even though it is very old and simple , it is still widely used (eg : in few stages of JPEG, MPEG etc). In t
Q. Give the algorithm for the selection sort. Describe the behaviours of selection sort when the input given is already sorted.
Suppose there are exactly five packet switches (Figure 4) between a sending host and a receiving host connected by a virtual circuit line (shown as dotted line in figure 4). The tr
An algorithm is a sequence of steps to solve a problem; there may be more than one algorithm to solve a problem. The choice of a particular algorithm depends upon following cons
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