Escolar Documentos
Profissional Documentos
Cultura Documentos
Operating system is the key foundation software that set up the computer to run other advantage software. As a perspective software engineer that will e designing application software that will run!operate in computer platform, e"plain in detail and specificity the importance of operating system to you. 2. #numerate and e"plain in detail common techniques used in software engineering to create the illusion of quick response initiation of a software program installed in a computer system. $ou should give concrete or specific e"amples of the operating initiation mechanics of software which will create perception of quick response despite the fact that normal amounts of time to complete loading up %front key essential files remain the same. 3. &hat key parts of operating system help load software program into a computer system and ensures that the program runs smoothly' (lease e"plain this process in your own words, as well as eing very specific in your response. )int* the answer to this question is not presented as a + lock* in your te"t ook or any one particular reading material. ,his technique was e"plained in class using internet rowser as an e"ample.
4. #fficient use of the processor and -!O facilities has een a key concern of software engineers for the past 3. years. /iscuss in your own words, how processor and -nput!Out facilities can efficiently e managed to yield ma"imum efficiency and output without si0e restrictions in the program development process. An operating system is the program that, after eing initially loaded into the computer y a oot program, manages all the other programs in a computer. ,he other programs are called applications or application programs. ,he application programs make use of the operating system y making requests for services through a defined application program interface 1A(-2. -n addition, users can interact directly with the operating system through a user interface such as command language or a graphical user interface 134-2. An operating system performs these services for applications
-n a multitasking operating system where multiple programs can e running at the same time, the operating system determines which applications should run in what order and how much time should e allowed for each application efore giving another application -t manages the sharing of internal memory among multiple applications. -t handles input and output to and from attached hardware devices, such as hard disks, printers, and dial%up ports -t sends messages to each application or interactive user 1or to a system operator2 a out the status of operation and any errors that may have occurred. -t can offload the management of what are called atch 5o s 1for e"ample, printing2 so that the initiating application is freed from this work On computers that can provide parallel processing, an operating system can manage how to divide the program so that it runs on more than one processor at a time
6. 4ni%processor 7cheduling is very crucial as an operating system must assign computer resources 1e.g. e"ecution time, etc2 among competing needs of multiple processes. 8riefly discuss in your own words three main types of processor scheduling with specific e"amples of each type. $ou may use schematics to support your e"planation. 9. -nput!Out management and disk scheduling were e"tensively discussed in class this quarter. #la orate on forms of -!O devices, O!7 design issues familiar to you, -!O uffering, :A,/ and disk cache. $ou can see that this question is ;open%ended<, which suggest that you should choose your discussion tra5ectory very wisely. (lease do not write more than 2 pages for this question.
=. #"plain in detail the differences etween a field and a record, and a file and a data ase. >. ?ile organi0ation to a software engineer is very important. ,herefore, list and define five file organi0ations. 7econdly, riefly discuss the functions of O!7 :egistry. (lease provide your e"planations in your own words.
Pile
It's the simplest possible organization: the data are collected in the file in the order in which they arrive, and it's not even required that the records have a common format across the file (different fields/sizes, same fields in different orders, etc.are possible . !his implies that each record/field must be self"describing. #espite the obvious storage efficiency and the easy update, it's quite clear that this $$structure'' is not suited for easy data retireval, since retrieving a datum basically requires detailed analysis of the file content. It ma%es sense only as temporary storage for data to be later structured in some way.
Sequential
!his is the most common structure for large files that are typically processed in their entirety, and it's at the heart of the more comple& schemes. In this scheme, all the records have the same size and the same field format, with the fields having fi&ed size as well. !he records are sorted in the file according to the content of a field of a scalar type, called $$%ey''. !he %ey must identify uniquely a records, hence different record have diferent %eys. !his organization is well suited for batch processing of the entire file, without adding or deleting items: this %ind of operation can ta%e advantage of the fi&ed size of records and file' moreover, this organization is easily stored both on dis% and tape. !he %ey ordering, along with the fi&ed record size, ma%es this organization amenable to dicotomic search (owever, adding and deleting records to this %ind of file is a tric%y process: the logical sequence of records tipycally matches their physical layout on the media storage, so to ease file navigation, hence adding a record and maintaining the %ey order requires a reorganization of the whole file. !he usual solution is to ma%e use of a $$log file'' (also called $$transaction file'' , structured as a pile, to perform this %ind of modification, and periodically perform a batch update on the master file.
Indexed sequential
)n inde& file can be used to effectively overcome the above mentioned problem, and to speed up the %ey search as well. !he simplest inde&ing structure is the single"level one: a file whose records are pairs %ey"pointer, where the pointer is the position in the data file of the record with the given %ey. *nly a subset of data records, evenly spaced along the data file, are inde&ed, so to mar% intervals of data records. ) %ey search then proceeds as follows: the search %ey is compared with the inde& ones to find the highest inde& %ey preceding the search one, and a linear search is performed from the record the inde& %ey points onward, until the search %ey is matched or until the record pointed by the ne&t inde& entry is reached. In spite of the double file access (inde& + data needed by this %ind of search, the decrease in access time with respect to a sequential file is significant. ,onsider, for e&le, the case of simple linear search on a file with -,... records. /ith the sequential organization, an average of 0.. %ey comparisons are necessary (assuming uniformly distributed search %ey among the data ones . (owever, using and evenly spaced inde& with -.. entries, the number of comparisons is reduced to 0. in the inde& file plus 0. in the data file: a 0:- reduction in the number of operations. !his scheme can obviously be hyerarchically e&tended: an inde& is a sequential file in itself, amenable to be inde&ed in turn by a second"level inde&, and so on, thus e&ploiting more and more the hyerarchical decomposition of the searches to decrease the access time. *bviously, if the layering of inde&es is pushed too far, a point is reached when the advantages of inde&ing are hampered by the increased storage costs, and by the inde& access times as well.
Indexed
/hy using a single inde& for a certain %ey field of a data record1 Inde&es can be obviously built for each field that uniquely identifies a record (or set of records within the file , and whose type is amenable to ordering. 2ultiple inde&es hence provide a high degree of fle&ibility for accessing the data via search on various attributes' this organization also allows the use of variable length records (containing different fields . It should be noted that when multiple inde&es are are used the concept of sequentiality of the records within the file is useless: each attribute (field used to construct an inde& typically imposes an ordering of its own. 3or this very reason is typicaly not possible to use the $$sparse'' (or $$spaced'' type of inde&ing previously described. !wo types of inde&es are usually found in the applications: the e&haustive type, which
contains an entry for each record in the main file, in the order given by the inde&ed %ey, and the partial type, which contain an entry for all those records that contain the chosen %ey field (for variable records only .
Hashed
)s with sequential or inde&ed files, a %ey field is required for this organization, as well as fi&ed record length. (owever, no e&plicit ordering in the %eys is used for the hash search, other than the one implicitly determined by a hash function.
,he registry is a data ase of all configuration and operating information for the operating system. Warning* #diting the registry is considered to e a very dangerous process, and could (if done incorrectly) cause the operating system to fail and the computer to not start. 8e very, very careful and follow @icrosoftAs recommendations for acking up and eing a le to restore the registry, and also to know e"actly what you are doing. ,his is complicated y the fact that the registry editing tools do not give you a chance to confirm your actions % they happen immediately % so you get no second chances.
Thanks for taking SOF 560. You have made the course en oya!le and re"arding for all of us. #ood luck to all of you$