what is sequential file in data structure?
914254
hi,\nsequential files are stored as consequence of characters. File can be read/write as text/binary/formated mode.  Most of us using sequence files for store datas. \nApart from this, we also have database files. which can retrieve data from any where with a condition...
463630
I think you're trying to do it the hard way...how about simply traversing the binary tree sequentially and adding each node to the linked list.  \n\nThe binary tree will not readily have a sequential read capability so you need to know the range and smallest increment of the elements.  This one, however, is stated to have "Sequential storage."\n\nThe linked-list will already have an insert-into-list method or it couldn't be a linked list from a working list class.\n\n\nyour algorhithm will have a loop starting with an enf of file check against the binary read and use the insert method of the linked-list until EOF...that's all.  A single loop with a binary read, a write and a check for EOF::\n\npseudocode:\nbinary::readfirst\ndo until eof\n  link::insert\n  binary::readnext\nend do\n\nwasn't that simple?
157926
Choose the most repeated operation and determine of what its repeat is dependent on (amount of input data).\n\nFor example: for (int i=0; i<N; i++) { /* do something */ )\nHas complexety N because /* do something */ is repeated N times. Here N is supplied to the algorightm.\n\nFor example: Two nested loops on of N and another of M operations have complexity of N*M.\n\nYou can ignore constant additions and substractions if they dont depend on the amount of the input data (as the are constant).\n\nFor example if you initialize an array of 100 elements in the begining of the algorithem, you can ignore it instead of include it as 100+N for example :)
462726
its for storing temporary files which needs to be loaded while u run any programs
409038
Its called.. bulk folder.  \nor... thy block list
1162697
For user eyes its stored in Folders.\n\nFor system, its stored in sectors and tracks. You can view the same when you run Defrag Tool.
24430
It's a memory leak.  A type of bug.  When the program uses a section of memory, it never gives it up when its done - so eventually it expands to include all of your usable space.\n\nFile a bug complaint and wait for a patch.
630463
Check this\nhttp://en.wikipedia.org/wiki/Comparison_of_file_systems
53480
.tmp at the end of a file means it is a temporary file. these files act as temporary storage space for programs, u can delete them whenver u see such files. if the program need .tmp file it can create it again, so don't worry about their functionaliy.
1108238
I can provide you complete programs of data structures (linked list, array handling, stacks, queues, tress, graphs, and other algorithms). for this you have to provide me your information and details for what purpose you have to use this? and what your are doing currently. you can communicate me on my email address. abhi_patni@yahoo.com.
374089
It has 2-bytes code, so you need to examine two consequent bytes. It is not C++ specific, it is PC-specific.
6938
When you save and erase files, one of the objectives of the software that manages your disk is to use as much of contiguous available space as possible.  This means that when you erase a file, the space occupied by that file is available for future saves.  Over time the disk begins to have lots of little open spaces since every file you save (or delete) has different sizes. The next time you do a save, starting at the beginning of the disk, the disk manager begins to fill the little open spaces with fragments of the file you're saving.   This means that, while the disk is efficiently used, from a space perspective, any given file is a collection of fragments spread all over the disk.  The disk manager has to maintain a file of the all the locations of the fragments each saved file is made up of.   This takes up a lot of time and additional space.  When you open the file, the disk manager has to collect and assemble all the pieces of the file.  This takes even more time and processor cycles, relatively speaking.  So you may in fact see your computer running slower and slower as fragmentation becomes more and more severe.\n\nDefragmentation software does exactly that.  Starting at the beginning of the disk, it opens each successive file, collecting all their fragments, and writing the entire file out to a block of open space sufficiently large to contain the entire file in one contiguous block of space.  Then all the spaces used by that file are available for rewriting other defragmented files.  This continues until all files are re-combined.  Then the defragmentation software begins to re-organize the now defragmented files in some predetermined way;  typically opertaing system files are located at the beginning of the disk to take advantage of the fact that the read-write heads of the disk are generally parked at the beginning of the disk so the read time is minimized when you turn you computer on.  Also because OS-related files aren't normally modified and re-written by users.  Next the Defrag software starts to store Application software, also since those files are also not typically opened, modified and saved by the user.  Last the defrag mgr will save your files....photos, songs, word processing files and spreadsheets, etc.  Files that you are more likely to open, modify and re-save.
130525
Go to http://filext.com/ and type in any extension.  It will tell you.  In this case it did not have the answer!  It is probably a data file for a program.  If you have a program with the initials "jm" start there.
1167745
a flat file is a simple list - a relational database is 2 or more lists which are linked to each other - for example, if i have a list of customers and a list of the orders they have placed the link is the fact that each customer placed each order - so, the order will have a field saying which customer placed the order so that the order can be tied back to the customer\n\nthis is much more efficient than trying to have a single list with every customer and every order each customer placed.
1108563
First, they will take up storage space in memory that must be allocated and deallocated correctly.  Second, they will run slower if there is any occasion to look up things in two or more tables rather than one.  Third, indexing into the correct table for the correct data type with an inbounds index becomes far more difficult for you and others as changes are made.  Fourth, file saves become more complex as do file loads.\n\nFirst, properly handled, tables in memory are still less time consuming to search and update than files.  Second, when large chunks of data are to be updated, updating table entries in memory and writing them out to a file at once and reading them in once saves a lot of hard disk read/write accesses and time.  Third, storing well thought out data configurations to separate tables allows data to be used from one table to create one report or display rather easily.  \n\nIt boils down to multiple tables are either well thought out and written, complex code that streamlines other functions in the application or they are a tangle of psuedo-organized crap code forming an inefficient Kludge, at best.  So, do them very well or not at all.  I think that about sums it up.
972567
Sounds like an all to common memory issue.\nTry Memtest86: http://www.memtest86.com/
220248
In binary, the first line of a 'flat file' is not the one you want to use as a template for the rest of the file. It is likely to be header information for the file as opposed to data in the file. Most tools, which extract the information you need, will discard or interpret the first line as 'file header'. Information in the first line usually includes the length of the header, the length of the file, the length of the 'record', the number of records, etc. The tools which interpret the first line may need assistance in defining the fields. The tools which discard the first line will assume some form of delimiter is present to provide your information.\nMost of the 'flat files' with which I have worked have no delimiter. This means I have to determine the record length and field length parameters for the tool to utilize by looking at a binary listing. This process can be particularly complex when the record length is variable.\nAs to which tool, it depends on what you have available. At times, I have written my own tool to manipulate a given flat file. \n\nIf you have MS Excel, MS Excel can ‘Import’ your flat file by using the delimiters already present in the flat file or use a wizard-generated template you help design.\n\nI have used several ‘mainframe utilities’ for this purpose.\n\nSome programming language editors can provide a binary/character look at the flat file.\n\nIt helps a great deal to have some idea of how the various fields are used in the file.