The methods or algorithms which are used to increase the performance of disk storage sub-system is called ............. A) Disk performing B) Disk scheduling C) Disk storing D) Disk extending

The methods or algorithms which are used to increase the performance of disk storage sub-system  is called .............
A) Disk performing
B) Disk scheduling
C) Disk storing
D) Disk extending
by

1 Answer

Answer :

B) Disk scheduling
by

Related questions

Which of the following statements is not true about disk-arm scheduling algorithms ? (A) SSTF (shortest seek time first) algorithm increases performance of FCFS. (B) The number of requests for disk service are not influenced by file allocation method. (C) Caching the directories and index blocks in main memory can also help in reducing disk arm movements. (D) SCAN and C-SCAN algorithms are less likely to have a starvation problem.

Description : Which of the following statements is not true about disk-arm scheduling algorithms ? (A) SSTF (shortest seek time first) algorithm increases performance of FCFS. (B) The number of requests for disk ... arm movements. (D) SCAN and C-SCAN algorithms are less likely to have a starvation problem.

Last Answer : (B) The number of requests for disk service are not influenced by file allocation method.

File management function of the operating system includes i) File creation and deletion ii) Disk scheduling iii) Directory creation iv) Mapping file in secondary storage. A) i, ii and iii only B) i, iii and iv only C) ii, iii and iv only D) All i, ii, iii and iv

Description : File management function of the operating system includes i) File creation and deletion ii) Disk scheduling iii) Directory creation iv) Mapping file in secondary storage. A) i, ii and iii only B) i, iii and iv only C) ii, iii and iv only D) All i, ii, iii and iv

Last Answer : B) i, iii and iv only

Which of the following scheduling algorithms may cause starvation? a. First-come-first-served b. Round Robin c. Priority d. Shortest process next e. Shortest remaining time first (1) a, c and e (2) c, d and e (3) b, d and e (4) b, c and d

Description : Which of the following scheduling algorithms may cause starvation? a. First-come-first-served b. Round Robin c. Priority d. Shortest process next e. Shortest remaining time first (1) a, c and e (2) c, d and e (3) b, d and e (4) b, c and d

Last Answer : Answer: 2

Consider a disk queue with request for input/output to block on cylinders 98, 183, 37, 122, 14, 124, 65, 67 in that order. Assume that disk head is initially positioned at cylinder 53 and moving towards cylinder number 0. The total number of head movements using Shortest Seek Time First (SSTF) and SCAN algorithms are respectively (A) 236 and 252 cylinders (B) 640 and 236 cylinders (C) 235 and 640 cylinders (D) 235 and 252 cylinders

Description : Consider a disk queue with request for input/output to block on cylinders  98, 183, 37, 122, 14, 124, 65, 67  in that order. Assume that disk head is initially positioned at cylinder 53 and moving ... and 252 cylinders (B) 640 and 236 cylinders (C) 235 and 640 cylinders (D) 235 and 252 cylinders

Last Answer : Answer: 236 and 208 cylinders Explanation: SSTF Initial head position =53 The closest queue to initial head position=65 head moves from 53 to 65=12 head moves from 65 to 67=2 head moves from 67 ... 122=24 head moves from 122 to 124=2 head moves from 124 to 183=59 Total head movement=208 

Code blocks allow many algorithms to be implemented with the following parameters : (A) clarity, elegance, performance (B) clarity, elegance, efficiency (C) elegance, performance, execution (D) execution, clarity, performance

Description : Code blocks allow many algorithms to be implemented with the following parameters : (A) clarity, elegance, performance (B) clarity, elegance, efficiency (C) elegance, performance, execution (D) execution, clarity, performance

Last Answer : (B) clarity, elegance, efficiency

………… is not the component of data structure. A) Operations B) Storage Structures C) Algorithms D) None of above

Description : ………… is not the component of data structure. A) Operations B) Storage Structures C) Algorithms D) None of above

Last Answer : D) None of above

If the Disk head is located initially at track 32, find the number of disk moves required with FCFS scheduling criteria if the disk queue of I/O blocks requests are: 98, 37, 14, 124, 65, 67 (A) 320 (B) 322 (C) 321 (D) 319

Description : If the Disk head is located initially at track 32, find the number of disk moves required with FCFS scheduling criteria if the disk queue of I/O blocks requests are: 98, 37, 14, 124, 65, 67 (A) 320 (B) 322 (C) 321 (D) 319

Last Answer : (C) 321

Consider a disk queue with I/O requests on the following cylinders in their arriving order: 6,10,12,54,97,73,128,15,44,110,34,45 The disk head is assumed to be at cylinder 23 and moving in the direction of decreasing number of cylinders. Total number of cylinders in the disk is 150. The disk head movement using SCAN-scheduling algorithm is: (1) 172 (2) 173 (3) 227 (4) 228

Description : Consider a disk queue with I/O requests on the following cylinders in their arriving order: 6,10,12,54,97,73,128,15,44,110,34,45 The disk head is assumed to be at cylinder 23 and moving in the direction ... . The disk head movement using SCAN-scheduling algorithm is: (1) 172 (2) 173 (3) 227 (4) 228

Last Answer : (2) 173

Consider the following justifications for commonly using the two-level CPU scheduling : I. It is used when memory is too small to hold all the ready processes. II. Because its performance is same as that of the FIFO. III. Because it facilitates putting some set of processes into memory and a choice is made from that. IV. Because it does not allow to adjust the set of in-core processes. Which of the following is true ? (A) I, III and IV (B) I and II (C) III and IV (D) I and III

Description : Consider the following justifications for commonly using the two-level CPU scheduling : I. It is used when memory is too small to hold all the ready processes. II. Because its performance is same as that of the FIFO. III. Because it ... ? (A) I, III and IV (B) I and II (C) III and IV (D) I and III

Last Answer : (D) I and III

Which of the following storage device can be used for storing large backup data? (a) Floppy disks (b) Hard disk (c) Magnetic tapes (d) None of these -Technology

Description : Which of the following storage device can be used for storing large backup data? (a) Floppy disks (b) Hard disk (c) Magnetic tapes (d) None of these -Technology

Last Answer : "B) Hard Disk.

Which of the following is false? a) The more important the data, the greater the need for backing it up b) A backup is as useful as its associated restore strategy c) Storing the backup copy near to its original site is best strategy d) Automated backup and scheduling is preferred over manual operations

Description : Which of the following is false? a) The more important the data, the greater the need for backing it up b) A backup is as useful as its associated restore strategy c) Storing the ... near to its original site is best strategy d) Automated backup and scheduling is preferred over manual operations

Last Answer : Storing the backup copy near to its original site is best strategy

Which of the following is false? a) The more important the data, the greater the need for backing it up b) A backup is as useful as its associated restore strategy c) Storing the backup copy near to its original site is best strategy d) Automated backup and scheduling is preferred over manual operations

Description : Which of the following is false? a) The more important the data, the greater the need for backing it up b) A backup is as useful as its associated restore strategy c) Storing the ... near to its original site is best strategy d) Automated backup and scheduling is preferred over manual operations

Last Answer : Storing the backup copy near to its original site is best strategy

The concept of multiple inheritance is implemented in Java by A) extending two or more classes B) extending one class and implementing one or more interfaces C) implementing two or more interfaces D) both B and C

Description : The concept of multiple inheritance is implemented in Java by A) extending two or more classes B) extending one class and implementing one or more interfaces C) implementing two or more interfaces D) both B and C

Last Answer : D) both B and C

The concept of multiple inheritance is implemented in Java by A) extending two or more classes B) extending one class and implementing one or more interfaces C) implementing two or more interfaces D) both B and C

Description : The concept of multiple inheritance is implemented in Java by A) extending two or more classes B) extending one class and implementing one or more interfaces C) implementing two or more interfaces D) both B and C

Last Answer : D) both B and C

Which of the following algorithms has lowest worst case time complexity? a) Insertion sort b) Selection sort c) Quick sort d) Heap sort

Description : Which of the following algorithms has lowest worst case time complexity? a) Insertion sort b) Selection sort c) Quick sort d) Heap sort

Last Answer : d) Heap sort

A job has four pages A, B, C, D and the main memory has two page frames only. The job needs to process its pages in following order: ABACABDBACD Assuming that a page interrupt occurs when a new page is brought in the main memory, irrespective of whether the page is swapped out or not. The number of page interrupts in FIFO and LRU page replacement algorithms are (A) 9 and 7 (B) 7 and 6 (C) 9 and 8 (D) 8 and 6

Description : A job has four pages A, B, C, D and the main memory has two page frames only. The job needs to process its pages in following order: ABACABDBACD Assuming that a page interrupt occurs when a new page is brought in the main ... replacement algorithms are (A) 9 and 7 (B) 7 and 6 (C) 9 and 8 (D) 8 and 6

Last Answer : (C) 9 and 8

Find the false statement: (A) In Modern Cryptography, symmetric key algorithms use same key both for Encryption and Decryption. (B) The Symmetric cipher DES (Data Encryption Standard) was widely used in the industry for security product. (C) The AES (Advanced Encryption Standard) cryptosystem allows variable key lengths of size 56 bits and 124 bits. (D) Public key algorithms use two different keys for Encryption and Decryption.

Description : Find the false statement: (A) In Modern Cryptography, symmetric key algorithms use same key both for Encryption and Decryption. (B) The Symmetric cipher DES (Data Encryption Standard) was widely used ... and 124 bits. (D) Public key algorithms use two different keys for Encryption and Decryption.

Last Answer : (C) The AES (Advanced Encryption Standard) cryptosystem allows variable key lengths of size 56 bits and 124 bits.

Consider a program that consists of 8 pages (from 0 to 7) and we have 4 page frames in the physical memory for the pages. The page reference string is : 1 2 3 2 5 6 3 4 6 3 7 3 1 5 3 6 3 4 2 4 3 4 5 1 The number of page faults in LRU and optimal page replacement algorithms are respectively (without including initial page faults to fill available page frames with pages): (A) 9 and 6 (B) 10 and 7 (C) 9 and 7 (D) 10 and 6

Description : Consider a program that consists of 8 pages (from 0 to 7) and we have 4 page frames in the physical memory for the pages. The page reference string is :  1 2 3 2 5 6 3 4 6 3 7 3 1 5 3 6 3 4 2 4 3 4 5 ... to fill available page frames with pages): (A) 9 and 6 (B) 10 and 7 (C) 9 and 7 (D) 10 and 6

Last Answer : (B) 10 and 7

Consider f(N) = g(N) + h(N) Where function g is a measure of the cost of getting from the start node to the current node N and h is an estimate of additional cost of getting from the current node N to the goal node. Then f(N) = h(N) is used in which one of the following algorithms ? (A) A* algorithm (B) AO* algorithm (C) Greedy best first search algorithm (D) Iterative A* algorithm

Description : Consider f(N) = g(N) + h(N) Where function g is a measure of the cost of getting from the start node to the current node N and h is an estimate of additional cost of getting from the current ... ? (A) A* algorithm (B) AO* algorithm (C) Greedy best first search algorithm (D) Iterative A* algorithm

Last Answer : (C) Greedy best first search algorithm

Which of the following algorithms is not a broadcast routing algorithm ? (A) Flooding (B) Multidestination routing (C) Reverse path forwarding (D) All of the above

Description : Which of the following algorithms is not a broadcast routing algorithm ? (A) Flooding (B) Multidestination routing (C) Reverse path forwarding (D) All of the above

Last Answer : (D) All of the above

Which of the following algorithms sort n integers, having the range 0 to (n2 -1), in ascending order in O(n) time ? (A) Selection sort (B) Bubble sort (C) Radix sort (D) Insertion sort

Description : Which of the following algorithms sort n integers, having the range 0 to (n2 -1), in ascending order in O(n) time ? (A) Selection sort (B) Bubble sort (C) Radix sort (D) Insertion sort

Last Answer : (C) Radix sort

What type of discount is given to a purchaser for performing activities such as transporting, storing, and selling? A)Quantity discount B)Cash discount C)Geographic discount D)Service discount E)Trade discount

Description : What type of discount is given to a purchaser for performing activities such as transporting, storing, and selling? A)Quantity discount B)Cash discount C)Geographic discount D)Service discount E)Trade discount

Last Answer : E)Trade discount

Repository of information gathered from multiple sources, storing under unified scheme at a single site is called as (A) Data mining (B) Meta data (C) Data warehousing (D) Database

Description : Repository of information gathered from multiple sources, storing under unified scheme at a single site is called as (A) Data mining (B) Meta data (C) Data warehousing (D) Database

Last Answer : (C) Data warehousing

In process scheduling, …………………… determines when new processes are admitted to the system. A) long term scheduling B) medium term scheduling C) short term scheduling D) none of the above

Description : In process scheduling, …………………… determines when new processes are admitted to the system. A) long term scheduling B) medium term scheduling C) short term scheduling D) none of the above

Last Answer : A) long term scheduling

Process Management function of an operating system kernel includes. A) Process creation and termination. B) Process scheduling and dispatching C) Process switching D) All of the above

Description : Process Management function of an operating system kernel includes. A) Process creation and termination. B) Process scheduling and dispatching C) Process switching D) All of the above

Last Answer : D) All of the above

........... is a large kernel, including scheduling file system, networking, device drivers, memory management and more. A) Monolithic kernel B) Micro kernel C) Macro kernel D) Mini kernel

Description : ........... is a large kernel, including scheduling file system, networking, device drivers, memory management and more. A) Monolithic kernel B) Micro kernel C) Macro kernel D) Mini kernel

Last Answer : A) Monolithic kernel

........... is a large kernel containing virtually the complete operating system, including, scheduling, file system, device drivers and memory management. A) Multilithic kernel B) Monolithic kernel C) Micro kernel D) Macro kernel

Description : ........... is a large kernel containing virtually the complete operating system, including, scheduling, file system, device drivers and memory management. A) Multilithic kernel B) Monolithic kernel C) Micro kernel D) Macro kernel

Last Answer : B) Monolithic kernel

Which of the following is/are the functions of operating system? i) Sharing hardware among users. ii) Allowing users to share data among themselves. iii) Recovering from errors. iv) Preventing users from interfering with one another. v) Scheduling resources among users. A) i, ii, iii and iv only B) ii, iii, iv and v only C) i, iii, iv and v only D) All i, ii, iii, iv and v

Description : Which of the following is/are the functions of operating system? i) Sharing hardware among users. ii) Allowing users to share data among themselves. iii) Recovering from errors. iv) Preventing users from interfering with one another. ... only C) i, iii, iv and v only D) All i, ii, iii, iv and v

Last Answer : D) All i, ii, iii, iv and v

A thread is usually defined as a light weight process because an Operating System (OS) maintains smaller data structure for a thread than for a process. In relation to this, which of the following statement is correct? (A) OS maintains only scheduling and accounting information for each thread. (B) OS maintains only CPU registers for each thread. (C) OS does not maintain a separate stack for each thread. (D) OS does not maintain virtual memory state for each thread.

Description : A thread is usually defined as a light weight process because an Operating System (OS) maintains smaller data structure for a thread than for a process. In relation to this, which of the following ... separate stack for each thread. (D) OS does not maintain virtual memory state for each thread.

Last Answer : (B) OS maintains only CPU registers for each thread.

Linux operating system uses (A) Affinity Scheduling (B) Fair Preemptive Scheduling (C) Hand Shaking (D) Highest Penalty Ratio Next

Description : Linux operating system uses (A) Affinity Scheduling (B) Fair Preemptive Scheduling (C) Hand Shaking (D) Highest Penalty Ratio Next

Last Answer : (B) Fair Preemptive Scheduling Explanation: Linux uses two process-scheduling algorithms: 1. A time-sharing algorithm for fair preemptive scheduling between multiple processes 2. A real-time algorithm for tasks where absolute priorities are more important than fairness

Which of the following statements is not true for Multi Level Feedback Queue processor scheduling algorithm? (A) Queues have different priorities. (B) Each queue may have different scheduling algorithm (C) Processes are permanently assigned to a queue (D) This algorithm can be configured to match a specific system under design

Description : Which of the following statements is not true for Multi Level Feedback Queue processor scheduling algorithm? (A) Queues have different priorities. (B) Each queue may have different scheduling algorithm (C) ... to a queue (D) This algorithm can be configured to match a specific system under design

Last Answer : (C) Processes are permanently assigned to a queue

The Unix Kernel maintains two key data structures related to processes, the process table and the user structure. Which of following information is not the part of user structure? (A) File descriptor table (B) System call state (C) Scheduling parameters (D) Kernel stack

Description : The Unix Kernel maintains two key data structures related to processes, the process table and the user structure. Which of following information is not the part of user structure? (A) File descriptor table (B) System call state (C) Scheduling parameters (D) Kernel stack

Last Answer : (C) Scheduling parameters

Consider three CPU intensive processes P1, P2, P3 which require 20, 10 and 30 units of time, arrive at times 1, 3 and 7 respectively. Suppose operating system is implementing Shortest Remaining Time first (preemptive scheduling) algorithm, then .............. context switches are required (suppose context switch at the beginning of Ready queue and at the end of Ready queue are not counted). (A) 3 (B) 2 (C) 4 (D) 5

Description : Consider three CPU intensive processes P1, P2, P3 which require 20, 10 and 30 units of time, arrive at times 1, 3 and 7 respectively. Suppose operating system is implementing Shortest Remaining Time first (preemptive scheduling) ... end of Ready queue are not counted). (A) 3 (B) 2 (C) 4 (D) 5

Last Answer : (A) 3

One of the disadvantages of user level threads compared to Kernel level threads is (1) If a user level thread of a process executes a system call, all threads in that process are blocked. (2) Scheduling is application dependent. (3) Thread switching doesn’t require kernel mode privileges. (4) The library procedures invoked for thread management in user level threads are local procedures.

Description : One of the disadvantages of user level threads compared to Kernel level threads is (1) If a user level thread of a process executes a system call, all threads in that process are ... privileges. (4) The library procedures invoked for thread management in user level threads are local procedures.

Last Answer : If a user level thread of a process executes a system call, all threads in that process are blocked.

The H-disk in the skeletal muscle fibre is due to (a) the absence of myofibrils in the central portion of Aband (b) the central gap between myosin filaments in the Aband Questions (c) the central gap between actin filaments extending through myosin filaments in the A-band (d) birefringence of myosin filaments in the central portion of A-band

Description : The H-disk in the skeletal muscle fibre is due to (a) the absence of myofibrils in the central portion of Aband (b) the central gap between myosin filaments in the Aband Questions (c) the ... myosin filaments in the A-band (d) birefringence of myosin filaments in the central portion of A-band

Last Answer : Ans:(c)

What are the ways of storing data in Files?

Description : What are the ways of storing data in Files?

Last Answer : Ans: There are two ways of storing data in files 1. Text Format- In text format data is stored as a line of character with each line terminated by a new line character ( \n'). Text files ... different on different machine. In text format , these problem do not arise,and hence it is more portable.

In an ER model, ……………. is described in the database by storing its data. A) Entity B) Attribute C) Relationship D) Notation

Description : In an ER model, ……………. is described in the database by storing its data. A) Entity B) Attribute C) Relationship D) Notation

Last Answer : A) Entity

The technology used to distribute service requests to resources is referred to as _____________ a) load performing b) load scheduling c) load balancing d) all of the mentioned

Description : The technology used to distribute service requests to resources is referred to as _____________ a) load performing b) load scheduling c) load balancing d) all of the mentioned

Last Answer : load balancing

The technology used to distribute service requests to resources is referred to as_____________ a) load performing b) load scheduling c) load balancing d) all of the mentioned

Description : The technology used to distribute service requests to resources is referred to as_____________ a) load performing b) load scheduling c) load balancing d) all of the mentioned

Last Answer : load balancing

The technology used to distribute service CSE-R17.BLOGSPOT.COM requests to resources is referred to as_____________ a) load performing b) load scheduling c) load balancing d) all of the mentioned

Description : The technology used to distribute service CSE-R17.BLOGSPOT.COM requests to resources is referred to as_____________ a) load performing b) load scheduling c) load balancing d) all of the mentioned

Last Answer : load balancing

The technology used to distribute service requests to resources is referred to as _____________ a) load performing b) load scheduling c) load balancing d) all of the mentioned

Description : The technology used to distribute service requests to resources is referred to as _____________ a) load performing b) load scheduling c) load balancing d) all of the mentioned

Last Answer : load balancing

In process scheduling, ………………… determines which ready process will be executed next by processor. A) long term scheduling B) medium term scheduling C) short term scheduling D) none of the above

Description : In process scheduling, ………………… determines which ready process will be executed next by processor. A) long term scheduling B) medium term scheduling C) short term scheduling D) none of the above

Last Answer : C) short term scheduling

A .................... architecture assigns only a few essential functions to the kernel, including address spaces, Inter process communication(IPC) and basic scheduling. A) Monolithic kernel B) Micro kernel C) Macro kernel D) Mini kernel

Description : A .................... architecture assigns only a few essential functions to the kernel, including address spaces, Inter process communication(IPC) and basic scheduling. A) Monolithic kernel B) Micro kernel C) Macro kernel D) Mini kernel

Last Answer : B) Micro kernel

.................. executes must frequently and makes the fine grained decision of which process to execute the next. A) Long-term scheduling B) Medium-term scheduling C) Short-term scheduling D) None of the above

Description : .................. executes must frequently and makes the fine grained decision of which process to execute the next. A) Long-term scheduling B) Medium-term scheduling C) Short-term scheduling D) None of the above

Last Answer : C) Short-term scheduling

A virtual memory based memory management algorithm partially swaps out a process. This is an example of (A) short term scheduling (B) long term scheduling (C) medium term scheduling (D) mutual exclusion

Description : A virtual memory based memory management algorithm partially swaps out a process. This is an example of (A) short term scheduling (B) long term scheduling (C) medium term scheduling (D) mutual exclusion

Last Answer : (C) medium term scheduling

A scheduling Algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (lowest priority). The scheduler re-evaluates the process priority for every 'T' time units and decides next process to be scheduled. If the process have no I/O operations and all arrive at time zero, then the scheduler implements .............. criteria. (A) Priority scheduling (B) Round Robin Scheduling (C) Shortest Job First (D) FCFS

Description : A scheduling Algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (lowest priority). The scheduler re-evaluates the process priority for every 'T' time ... (A) Priority scheduling (B) Round Robin Scheduling (C) Shortest Job First (D) FCFS

Last Answer : (B) Round Robin Scheduling

Which of the following is not an inherent application of stack? (A) Implementation of Stack (B) Evaluation of a postfix expression (C) Job Scheduling (D) Reverse a string

Description : Which of the following is not an inherent application of stack? (A) Implementation of Stack (B) Evaluation of a postfix expression (C) Job Scheduling (D) Reverse a string

Last Answer : (C) Job Scheduling

Which of the following is not one of three software product aspects addressed by McCall's software quality factors? (1) Ability to undergo change. (2) Adaptability to new environments. (3) Operational characteristics (4) Production costs and scheduling

Description : Which of the following is not one of three software product aspects addressed by McCall's software quality factors? (1) Ability to undergo change. (2) Adaptability to new environments. (3) Operational characteristics (4) Production costs and scheduling

Last Answer : Answer: 4

Which is the protocol for performing RPCs between applications in a language and system independent way? (A) Hyper Text Transmission Protocol (HTTP) (B) Simple Network Management Protocol (SNMP) (C) Simple Object Access Protocol (SOAP) (D) Simple Mail Transfer Protocol (SMTP)

Description : Which is the protocol for performing RPCs between applications in a language and system independent way? (A) Hyper Text Transmission Protocol (HTTP) (B) Simple Network Management Protocol (SNMP) (C) Simple Object Access Protocol (SOAP) (D) Simple Mail Transfer Protocol (SMTP)

Last Answer : (C) Simple Object Access Protocol (SOAP)

What is first step to Handle Retrieving Data from an Encrypted Hard Drive? A. Formatting disk B. Storing data C. Finding configuration files. D. Deleting files.

Description : What is first step to Handle Retrieving Data from an Encrypted Hard Drive? A. Formatting disk B. Storing data C. Finding configuration files. D. Deleting files.

Last Answer : C. Finding configuration files.