Marketing Research Essentials 8th edition Carl McDaniel Jr., Roger Gates - Solutions

Unlock a comprehensive guide to mastering "Marketing Research Essentials, 8th Edition" by Carl McDaniel Jr. and Roger Gates with our expertly crafted answers and solutions. Access an online answers key for all your questions and discover detailed chapter solutions in our solution manual. Find solutions in PDF format and explore solved problems with step-by-step answers. Our resource includes a test bank and instructor manual, ensuring you have all the tools needed for success. This textbook's questions and answers are available for free download, providing a complete learning experience for marketing research enthusiasts.

Consider a file system where a file can be deleted and its disk space reclaimed while links to that file still exist. What problems may occur if a new file is created in the same storage area or with the same absolute path name? How can these problems be avoided?
Some systems automatically delete all user files when a user logs off or a job terminates, unless the user explicitly requests that they be kept; other systems keep all files unless the user explicitly deletes them. Discuss the relative merits of each approach.
Why do some systems keep track of the type of a file, while others leave it to the user or simply do not implement multiple file types? Which system is “better?”
What are the advantages and disadvantages of recording the name of the creating program with the file’s attributes (as is done in the Macintosh Operating System)?
Could you simulate a multilevel directory structure with a single-level directory structure in which arbitrarily long names can be used? If your answer is yes, explain how you can do so, and contrast this scheme with the multilevel directory scheme. If your answer is no, explain what prevents your
Explain the purpose of the open and close operations.
Some systems automatically open a file when it is referenced for the first time, and close the file when the job terminates. Discuss the advantages and disadvantages of this scheme as compared to the more traditional one, where the user has to open and close the file explicitly.
Give an example of an application in which data in a file should be accessed in the following order: a. Sequentially b. Randomly
Some systems provide file sharing by maintaining a single copy of a file; other systems maintain several copies, one for each of the users sharing the file. Discuss the relative merits of each approach.
In some systems, a subdirectory can be read and written by an authorized user, just as ordinary files can be. a. Describe the protection problems that could arise. b. Suggest a scheme for dealing with each of the protection problems you named in part
Consider a system that supports 5000 users. Suppose that you want to allow 4990 of these users to be able to access one file. a. How would you specify this protection scheme in UNIX? b. Could you suggest another protection scheme that can be used more effectively for this purpose than the scheme
Researchers have suggested that, instead of having an access list associated with each file (specifying which users can access the file, and how), we should have a user control list associated with each user (specifying which files a user can access, and how). Discuss the relative merits of these
What is a file?
List sample file types, based on use, on the VAX under VMS.
List some file types on the VAX under VMS.
What does OPEN do?
What does CLOSE do?
List advantages of operating system “knowing” and supporting many file types.
List the disadvantages of operating system “knowing” and supporting many file types.
What is a sequential file?
What is direct access?
How does user specify block to be fetched in direct access?
Can a direct access file be read sequentially? Explain.
How can an index file be used to speed up the access in direct-access files?
Explain what ISAM is.
List two types of system directories
List operations to be performed on directories?
List disadvantages of using a single directory.
What is the MFD? UFD? How are they related?
What advantages are there to this two-level directory?
What disadvantages are there to this two-level directory?
How do we overcome the disadvantages of the two-level directory?
What is a file path name?
If we use the two-level directory, how do we access common files and programs, like FORTRAN compiler? Show two or more ways.
Why would we want a subdirectory in our account?
List steps you need to follow to delete a subdirectory in your account.
What is an acyclic graph?
List ways to share files between directories in operating systems.
What problems might arise on deletion if a file is shared?
What problems might arise on deletion if a file is shared? Discuss.
How can we solve this problem?
What is a general graph?
Give advantages of each directory structure above.
Consider a file currently consisting of 100 blocks. Assume that the file control block (and the index block, in the case of indexed allocation) is already in memory. Calculate how many disk I/O operations are required for contiguous, linked, and indexed (single-level) allocation strategies, if, for
Consider a system where free space is kept in a free-space list. a. Suppose that the pointer to the free-space list is lost. Can the system reconstruct the free-space list? Explain your answer. b. Suggest a scheme to ensure that the pointer is never lost as a result of memory failure.
What problems could occur if a system allowed a file system to be mounted simultaneously at more than one location?
Why must the bit map for file allocation be kept on mass storage, rather than in main memory?
Consider a system that supports the strategies of contiguous, linked, and indexed allocation. What criteria should be used in deciding which strategy is best utilized for a particular file?
One problem with contiguous allocation is that the user must preallocate enough space for each file. If the file grows to be larger than the space allocated for it, special actions must be taken. One solution to this problem is to define a file structure consisting of an initial contiguous area (of
Fragmentation on a storage device could be eliminated by recompaction of the information. Typical disk devices do not have relocation or base registers (such as are used when memory is to be compacted), so how can we relocate files? Give three reasons why recompaction and relocation of files often
How do caches help improve performance? Why do systems not use more or larger caches if they are so useful?
In what situations would using memory as a RAM disk be more useful than using it as a disk cache?
Why is it advantageous for the user for an operating system to dynamically allocate its internal tables? What are the penalties to the operating system for doing so?
Consider the following backup scheme: Day 1: Copy to a backup medium all files from the disk. Day 2: Copy to another medium all files changed since day 1. Day 3: Copy to another medium all files changed since day 1. This contrasts to the schedule given in Section 11.6.2 by having all subsequent
List three ways of allocating storage, and give advantages of each.
What is contiguous allocation?
What main difficulty occurs with contiguous allocation?
What is a “hole” in contiguous allocation method?
Explain first-fit, best-fit, and worst-fit methods of allocating space for contiguous files.
What is external fragmentation in a system with contiguous files?
How can we overcome fragmentation?
What is preallocation? Why do it?
What is linked allocation, as detailed in text?
Can linked allocation have external fragmentation? Internal fragmentation?
Can linked allocation be used for direct-access files?
What is indexed allocation?
Rank the allocation methods on speed.
List four ways a system could use to determine which sectors are free. Give advantages of each way.
List kinds of information we’d likely want to keep in a directory, and estimate number of bytes needed to store each compactly.
What data structures can be used for directory information?
What problems might arise with above data structures?
State three advantages of placing functionality in a device controller, rather than in the kernel state three disadvantages
Consider the following I/O scenarios on a single-user PC. a. A mouse used with a graphical user interface b. A tape drive on a multitasking operating system (assume no device preallocation is available) c. A disk drive containing user files d. A graphics card with direct bus connection,
Describe three circumstances under which blocking I/O should be used. Describe three circumstances under which nonblocking I/O should be used. Why not just implement nonblocking I/O and have processes busy-wait until their device is ready?
Why might a system use interrupt-driven I/O to manage a single serial port, but polling I/O to manage a front-end processor, such as a terminal concentrator?
UNIX coordinates the activities of the kernel I/O components by manipulating shared in-kernel data structures, whereas Windows NT uses object-oriented message passing between kernel I/O components. Discuss three pros and three cons of each approach.
How does DMA increase system concurrency? How does it complicate hardware design?
Why is it important to scale up system bus and device speeds as the CPU speed increases?
None of the disk-scheduling disciplines, except FCFS, is truly fair (starvation may occur). a. Explain why this assertion is true. b. Describe a way to modify algorithms such as SCAN to ensure fairness. c. Explain why fairness is an important goal in a time-sharing system. d. Give three or more
Suppose that a disk drive has 5000 cylinders, numbered 0 to 4999. The drive is currently serving a request at cylinder 143, and the previous request was at cylinder 125. The queue of pending requests, in FIFO order, is 86, 1470, 913, 1774, 948, 1509, 1022, 1750, 130 Starting from the current head
From elementary physics, we know that when an object is subjected to a constant acceleration a, the relationship between distance d and time t is given by d = ½ at2. Suppose that, during a seek, the disk in Exercise 14.2 accelerates the disk arm at a constant rate for the first half of the seek,
Suppose that the disk in Exercise 14.3 rotates at 7200 RPM. a. What is the average rotational latency of this disk drive? b. What seek distance can be covered in the time that you found for part a?
The accelerating seek described in Exercise 14.3 is typical of hard-disk drives. By contrast, floppy disks (and many hard disks manufactured before the mid-1980s) typically seek at a fixed rate. Suppose that the disk in Exercise 14.3 has a constant-rate seek rather than a constant-acceleration
Compare the performance of C-SCAN and SCAN scheduling, assuming a uniform distribution of requests. Consider the average response time (the time between the arrival of a request and the completion of that request’s service), the variation in response time, and the effective bandwidth. How does
Is disk scheduling, other than FCFS scheduling, useful in a single-user environment? Explain your answer.
Explain why SSTF scheduling tends to favor middle cylinders over the innermost and outermost cylinders.
Requests are not usually uniformly distributed. For example, a cylinder containing the file system FAT or in odes can be expected to be accessed more frequently than a cylinder that only contains files. Suppose you know that 50 percent of the requests are for a small, fixed number of cylinders. a.
Why is rotational latency usually not considered in disk scheduling? How would you modify SSTF, SCAN, and C-SCAN to include latency optimization?
How would use of a RAM disk affect your selection of a disk-scheduling algorithm? What factors would you need to consider? Do the same considerations apply to hard-disk scheduling, given that the file system stores recently used blocks in a buffer cache in main memory?
Why is it important to balance file system I/O among the disks and controllers on a system in a multitasking environment?
What are the trade offs involved in rereading code pages from the file system versus using swap space to store them?
Is there any way to implement truly stable storage? Explain your answer.
The reliability of a hard-disk drive is typically described in terms of a quantity called mean time between failures (MTBF). Although this quantity is called a “time,” the MTBF actually is measured in drive-hours per failure. a. If a disk farm contains 1000 drives, each of which has a 750,000
The term “fast wide SCSI-II” denotes a SCSI bus that operates at a data rate of 20 megabytes per second when it moves a packet of bytes between the host and a device. Suppose that a fast wide SCSI-II disk drive spins at 7200 RPM, has a sector size of 512 bytes, and holds 160 sectors per
More than one disk drive can be attached to a SCSI bus. In particular, a fast wide SCSI-II bus (see Exercise 14.17) can be connected to atmost 15 disk drives. Recall that this bus has a bandwidth of 20 megabytes per second. At any time, only one packet can be transferred on the bus between some
Remapping of bad blocks by sector sparing or sector slipping could influence performance. Suppose that the drive in Exercise 14.17 has a total of 100 bad sectors at random locations and that each bad sector is mapped to a spare that is located on a different track, but within the same cylinder.
Discuss the relative advantages and disadvantages of sector sparing and sector slipping.
The operating system generally treats removable disks as shared file systems but assigns a tape drive to only one application at a time. Give three reasons that could explain this difference in treatment of disks and tapes. Describe additional features that would be required of the operating system
In a disk jukebox, what would be the effect of having more open files than the number of drives in the jukebox?
If magnetic hard disks eventually have the same cost per gigabyte as do tapes, will tapes become obsolete, or will they still be needed? Explain your answer.

Showing 100 - 200 of 586

Marketing Research Essentials 8th edition Carl McDaniel Jr., Roger Gates - Solutions

Step by Step Answers