With …………………. A page is written out to secondary memory only when it has been selected for replacement. A) pre-cleaning B) demand cleaning C) required cleaning D) fast cleaning

With …………………. A page is written out to secondary memory only when it has been selected for replacement.
A) pre-cleaning
B) demand cleaning
C) required cleaning
D) fast cleaning
by

1 Answer

Answer :

B) demand cleaning
by

Related questions

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

The ……………. Determines when a page should be brought into main memory. A) Fetch policy B) Placement policy C) Replacement policy D) Resident set management

Description : The ……………. Determines when a page should be brought into main memory. A) Fetch policy B) Placement policy C) Replacement policy D) Resident set management

Last Answer : A) Fetch policy

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

Suppose that the virtual Address space has eight pages and physical memory with four page frames. If LRU page replacement algorithm is used, .............. number of page faults occur with the reference string. 0 2 1 3 5 4 6 3 7 4 7 3 3 5 5 3 1 1 1 7 2 3 4 1 (A) 11 (B) 12 (C) 10 (D) 9

Description : Suppose that the virtual Address space has eight pages and physical memory with four page frames. If LRU page replacement algorithm is used, .............. number of page faults occur with the reference string. 0 2 1 3 5 4 6 3 7 4 7 3 3 5 5 3 1 1 1 7 2 3 4 1 (A) 11 (B) 12 (C) 10 (D) 9

Last Answer : (A) 11

With ................ a page is brought into main memory only when the reference is made to a location on that page. A) demand paging B) main paging C) prepaging D) postpaging

Description : With ................ a page is brought into main memory only when the reference is made to a location on that page. A) demand paging B) main paging C) prepaging D) postpaging

Last Answer : A) demand paging

In a demand paging memory system, page table is held in registers. The time taken to service a page fault is 8 m.sec. if an empty frame is available or if the replaced page is not modified, and it takes 20 m.secs., if the replaced page is modified. What is the average access time to service a page fault assuming that the page to be replaced is modified 70% of the time ? (A) 11.6 m.sec. (B) 16.4 m.sec. (C) 28 m.sec. (D) 14 m.sec.

Description : In a demand paging memory system, page table is held in registers. The time taken to service a page fault is 8 m.sec. if an empty frame is available or if the replaced page is not modified, and it takes 20 m.secs., if the replaced ... ? (A) 11.6 m.sec. (B) 16.4 m.sec. (C) 28 m.sec. (D) 14 m.sec.

Last Answer : (B) 16.4 m.sec. 

A memory management system has 64 pages with 512 bytes page size. Physical memory consists of 32 page frames. Number of bits required in logical and physical address are respectively: (1) 14 and 15 (2) 14 and 29 (3) 15 and 14 (4) 16 and 32

Description : A memory management system has 64 pages with 512 bytes page size. Physical memory consists of 32 page frames. Number of bits required in logical and physical address are respectively: (1) 14 and 15 (2) 14 and 29 (3) 15 and 14 (4) 16 and 32

Last Answer : (3) 15 and 14

Which of the following is incorrect for virtual memory? (1) Large programs can be written (2) More I/O is required (3) More addressable memory available (4) Faster and easy swapping of process

Description : Which of the following is incorrect for virtual memory? (1) Large programs can be written (2) More I/O is required (3) More addressable memory available (4) Faster and easy swapping of process

Last Answer : Answer: 2

The task of correcting and pre processing data is called as (A) Data streaming (B) Data cleaning (C) Data mining (D) Data storming

Description : The task of correcting and pre processing data is called as (A) Data streaming (B) Data cleaning (C) Data mining (D) Data storming

Last Answer : (B) Data cleaning

A LRU page replacement is used with four page frames and eight pages. How many page faults will occur with the reference string 0172327103 if the four frames are initially empty? (A) 6 (B) 7 (C) 5 (D) 8

Description : A LRU page replacement is used with four page frames and eight pages. How many page faults will occur with the reference string 0172327103 if the four frames are initially empty? (A) 6 (B) 7 (C) 5 (D) 8

Last Answer : (B) 7

Consider the reference string 0 1 2 3 0 1 4 0 1 2 3 4 If FIFO page replacement algorithm is used, then the number of page faults with three page frames and four page frames are .......... and ........... respectively. (A) 10, 9 (B) 9, 9 (C) 10, 10 (D) 9, 10

Description : Consider the reference string 0 1 2 3 0 1 4 0 1 2 3 4 If FIFO page replacement algorithm is used, then the number of page faults with three page frames and four page frames are .......... and ........... respectively. (A) 10, 9 (B) 9, 9 (C) 10, 10 (D) 9, 10

Last Answer : (D) 9, 10

Which of the following information not included in memory table? A) The allocation of main memory to process. B) The allocation of secondary memory to process C) Any information needed to manage virtual memory D) Any information about the existence of file

Description : Which of the following information not included in memory table? A) The allocation of main memory to process. B) The allocation of secondary memory to process C) Any information needed to manage virtual memory D) Any information about the existence of file

Last Answer : D) Any information about the existence of file

.................. is a facility that allows programmers to address memory from a logical point of view, without regard to the main memory, physically available. A) Visual memory B) Real memory C) Virtual memory D) Secondary memory

Description : .................. is a facility that allows programmers to address memory from a logical point of view, without regard to the main memory, physically available. A) Visual memory B) Real memory C) Virtual memory D) Secondary memory

Last Answer : C) Virtual memory

Let the page fault service time be 10 millisecond(ms) in a computer with average memory access time being 20 nanosecond(ns). If one page fault is generated for every 106 memory accesses, what is the effective access time for memory? (A) 21 ns (B) 23 ns (C) 30 ns (D) 35 ns

Description : Let the page fault service time be 10 millisecond(ms) in a computer with average memory access time being 20 nanosecond(ns). If one page fault is generated for every 106 memory accesses, what is the effective access time for memory? (A) 21 ns (B) 23 ns (C) 30 ns (D) 35 ns

Last Answer : (C) 30 ns

Suppose that the number of instructions executed between page faults is directly proportional to the number of page frames allocated to a program. If the available memory is doubled, the mean interval between page faults is also doubled. Further, consider that a normal instruction takes one micro second, but if a page fault occurs, it takes 2001 micro seconds. If a program takes 60 sec to run, during which time it gets 15000 page faults, how long would it take to run if twice as much memory were available? (A) 60 sec (B) 30 sec (C) 45 sec (D) 10 sec

Description : Suppose that the number of instructions executed between page faults is directly proportional to the number of page frames allocated to a program. If the available memory is doubled, the mean interval between page faults is also ... memory were available? (A) 60 sec (B) 30 sec (C) 45 sec (D) 10 sec

Last Answer : Answer: C Explanation: T = Ninstr x 1µs + 15,000 x 2,000 µs = 60s Ninstr x 1µs = 60,000,000 µs - 30,000,000 µs = 30,000,000 µs Ninstr = 30,000,000 The number of instruction ... doesn't mean that the program runs twice as fast as on the first system. Here, the performance increase is of 25%.

A virtual memory has a page size of 1K words. There are eight pages and four blocks. The associative memory page table contains the following entries: Image Which of the following list of virtual addresses (in decimal) will not cause any page fault if referenced by the CPU? (A) 1024, 3072, 4096, 6144 (B) 1234, 4012, 5000, 6200 (C) 1020, 3012, 6120, 8100 (D) 2021, 4050, 5112, 7100

Description : A virtual memory has a page size of 1K words. There are eight pages and four blocks. The associative memory page table contains the following entries:  Which of the following list of virtual addresses (in ... 1234, 4012, 5000, 6200 (C) 1020, 3012, 6120, 8100 (D) 2021, 4050, 5112, 7100

Last Answer : Answer: C Explanation: The pages which are not in main memory are: 1020 will not cause page fault (1024-2047) 3012 will not cause page fault (3072-4095) 6120 will not cause page fault (4096-5119) 8100 will not cause page fault (6144-7167)

Let Pi and Pj be two processes, R be the set of variables read from memory, and W be the set of variables written to memory. For the concurrent execution of two processes Pi and Pj, which of the following conditions is not true? (A) R(Pi)∩W(Pj)=Φ (B) W(Pi)∩R(Pj)=Φ (C) R(Pi)∩R(Pj)=Φ (D) W(Pi)∩W(Pj)=Φ

Description : Let Pi and Pj be two processes, R be the set of variables read from memory, and W be the set of variables written to memory. For the concurrent execution of two processes Pi and Pj, which of the following conditions is not true? (A) R(Pi)∩W(Pj)=Φ (B) W(Pi)∩R(Pj)=Φ (C) R(Pi)∩R(Pj)=Φ (D) W(Pi)∩W(Pj)=Φ

Last Answer : (C) R(Pi)∩R(Pj)=Φ 

In ............. method, the word is written to the block in both the cache and main memory, in parallel. (A) Write through (B) Write back (C) Write protected (D) Direct mapping

Description : In ............. method, the word is written to the block in both the cache and main memory, in parallel. (A) Write through (B) Write back (C) Write protected (D) Direct mapping

Last Answer : (A) Write through 

Assume that we need to download text documents at the rate of 100 pages per minute. A page is an average of 24 lines with 80 characters in each line and each character requires 8 bits. Then the required bit rate of the channel is ................ (A) 1.636 Kbps (B) 1.636 Mbps (C) 2.272 Mbps (D) 3.272 Kbps

Description : Assume that we need to download text documents at the rate of 100 pages per minute. A page is an average of 24 lines with 80 characters in each line and each character requires 8 bits. Then the required bit rate of the channel is ... ...... (A) 1.636 Kbps (B) 1.636 Mbps (C) 2.272 Mbps (D) 3.272 Kbps

Last Answer : Answer: Marks given to all

………………….. means coordinated effort, to communicate the information of the system written form. A) System documentation B) Resource required C) Development schedule D) User Document

Description : ………………….. means coordinated effort, to communicate the information of the system written form. A) System documentation B) Resource required C) Development schedule D) User Document

Last Answer : A) System documentation

What is the purpose of Ctrl + I shortcut key in MS - Word: a) It converts selected text into the next larger size of the same font. b) It applies the Italic formatting to the selected text. c) It makes the selected text bold d) It adds a line break to the document. e) None of The Above

Description : What is the purpose of Ctrl + I shortcut key in MS - Word: a) It converts selected text into the next larger size of the same font. b) It applies the Italic formatting to the selected text. c) It makes the selected text bold d) It adds a line break to the document. e) None of The Above

Last Answer : b) It applies the Italic formatting to the selected text.

................ allows individual row operation to be performed on a given result set or on the generated by a selected by a selected statement. A) Procedure B) Trigger C) Curser D) None of above

Description : ................ allows individual row operation to be performed on a given result set or on the generated by a selected by a selected statement. A) Procedure B) Trigger C) Curser D) None of above

Last Answer : C) Curser

What is the probability that a randomly selected bit string of length 10 is a palindrome? (A) 1/64 (B) 1/32 (C) 1/8 (D) ¼

Description : What is the probability that a randomly selected bit string of length 10 is a palindrome? (A) 1/64 (B) 1/32 (C) 1/8 (D) ¼

Last Answer : (B) 1/32

Images tend to be very large collection of data. The size of memory required for a 1024 by 1024 image in which the colour of each pixel is represented by a n-bit number, (in an 8 bit machines) is (A) n × 8 MB (B) n / 8 MB (C) (1024 × 1024) / 8 MB (D) 1024 MB

Description : Images tend to be very large collection of data. The size of memory required for a 1024 by 1024 image in which the colour of each pixel is represented by a n-bit number, (in an 8 bit machines) is (A) n × 8 MB (B) n / 8 MB (C) (1024 × 1024) / 8 MB (D) 1024 MB

Last Answer : (B) n / 8 MB

A dynamic RAM has refresh cycle of 32 times per msec. Each refresh operation requires 100 nsec and a memory cycle requires 250 nsec. What percentage of memory’s total operating time is required for refreshes? (A) 0.64 (B) 0.96 (C) 2.00 (D) 0.32

Description : A dynamic RAM has refresh cycle of 32 times per msec. Each refresh operation requires 100 nsec and a memory cycle requires 250 nsec. What percentage of memory’s total operating time is required for refreshes? (A) 0.64 (B) 0.96 (C) 2.00 (D) 0.32

Last Answer : Answer: D Explanation: in 1ms : refresh = 32 times Memory cycle = 1ms/250ns = 106ns/250ns = 4000 times Therefore, % of refresh time = (32 x 100ns)/(4000 x 250ns) = 3200ns/1000000 x 100% = 0.32%

Fragmentation is: a) Dividing the secondary memory into equal sized fragments b) Fragments of memory words used in a page c) Fragments of memory words unused in a page d) None of The Above

Description : Fragmentation is: a) Dividing the secondary memory into equal sized fragments b) Fragments of memory words used in a page c) Fragments of memory words unused in a page d) None of The Above

Last Answer : c) Fragments of memory words unused in a page

A box contains 100 balls numbers from 1 to 100. If three balls are selected at random and with replacement from the box, what is the probability -Maths 9th

Description : A box contains 100 balls numbers from 1 to 100. If three balls are selected at random and with replacement from the box, what is the probability -Maths 9th

Last Answer : (d) \(rac{1}{4}\)The box contains 100 balls numbered from 1 to 100. Therefore, there are 50 even and 50 odd numbered balls. The sum of the three numbers drawn will be odd, if all three are odd or one is even and 2 are odd. ∴ Required probability = P(odd) × P(odd) × P(odd) + P(even) × P(odd) × P(odd)

The type of sampling in which each member of the population selected for the sample is returned to the population before the next member is selected is called _________. a. Sampling without replacement b. Sampling with replacement c. Simple random sampling d. Systematic sampling

Description : The type of sampling in which each member of the population selected for the sample is returned to the population before the next member is selected is called _________. a. Sampling without replacement b. Sampling with replacement c. Simple random sampling d. Systematic sampling

Last Answer : b. Sampling with replacement

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

As compared to the secondary memory, the primary memory of a computer is A) Large B) Cheap C) Fast D) Slow

Description : As compared to the secondary memory, the primary memory of a computer is A) Large B) Cheap C) Fast D) Slow

Last Answer : Answer : C

As compared to the secondary memory, the primary memory of a computer is a. Large b. Cheap c. Fast d. Slow

Description : As compared to the secondary memory, the primary memory of a computer is a. Large b. Cheap c. Fast d. Slow

Last Answer : Fast

As compared to the secondary memory, the primary memory of a computer is a. Large b. Cheap c. Fast d. Slow

Description : As compared to the secondary memory, the primary memory of a computer is a. Large b. Cheap c. Fast d. Slow

Last Answer : c. Fast

As compared to the secondary memory, the primary memory of a computer is a. Large b. Cheap c. Fast d. Slow

Description : As compared to the secondary memory, the primary memory of a computer is a. Large b. Cheap c. Fast d. Slow

Last Answer : c. Fast

In Java variables, if first increment of the variable takes place and then the assignment occurs. This operation is also called ............................. . A) pre increment B) post increment C) incrementation D) pre incrementation

Description : In Java variables, if first increment of the variable takes place and then the assignment occurs. This operation is also called ............................. . A) pre increment B) post increment C) incrementation D) pre incrementation

Last Answer : A) pre increment

The translator which performs macro calls expansion is called : (A) Macro processor (B) Micro pre-processor (C) Macro pre-processor (D) Dynamic linker

Description : The translator which performs macro calls expansion is called : (A) Macro processor (B) Micro pre-processor (C) Macro pre-processor (D) Dynamic linker

Last Answer : (C) Macro pre-processor 

What is the output of the following program ? (Assume that the appropriate pre-processor directives are included and there is no syntax error) main() { char S[ ] = "ABCDEFGH"; printf ("%C",* (& S[3])); printf ("%s", S+4); printf ("%u", S); /* Base address of S is 1000 */ } (A) ABCDEFGH1000 (B) CDEFGH1000 (C) DDEFGHH1000 (D) DEFGH1000

Description : What is the output of the following program ? (Assume that the appropriate pre-processor directives are included and there is no syntax error) main() { char S[ ] = "ABCDEFGH"; printf ("%C",* (& ... Base address of S is 1000 */ } (A) ABCDEFGH1000 (B) CDEFGH1000 (C) DDEFGHH1000 (D) DEFGH1000

Last Answer : (D) DEFGH1000

Consider the following statements: (a) Depth - first search is used to traverse a rooted tree. (b) Pre - order, Post-order and Inorder are used to list the vertices of an ordered rooted tree. (c) Huffman's algorithm is used to find an optimal binary tree with given weights. (d) Topological sorting provides a labelling such that the parents have larger labels than their children. Which of the above statements are true ? (A) (a) and (b) (B) (c) and (d) (C) (a) , (b) and (c) (D) (a), (b) , (c) and (d)

Description : Consider the following statements: (a) Depth - first search is used to traverse a rooted tree. (b) Pre - order, Post-order and Inorder are used to list the vertices of an ordered rooted tree. (c) Huffman's algorithm is used to find an optimal ... (d) (C) (a) , (b) and (c) (D) (a), (b) , (c) and (d)

Last Answer : (D) (a), (b) , (c) and (d)

In an operating system, indivisibility of operation means : (A) Operation is interruptable (B) Race - condition may occur (C) Processor can not be pre-empted (D) All of the above

Description : In an operating system, indivisibility of operation means : (A) Operation is interruptable (B) Race - condition may occur (C) Processor can not be pre-empted (D) All of the above 

Last Answer : (C) Processor can not be pre-empted 

The type of restrained three point linkage system in which the depth of implement is automatically adjusted to maintain a pre selected constant draft is called : E. Automatic draft control system F. Precision control system G. Depth control system H. None of the above

Description : The type of restrained three point linkage system in which the depth of implement is automatically adjusted to maintain a pre selected constant draft is called : E. Automatic draft control system F. Precision control system G. Depth control system H. None of the above

Last Answer : E. Automatic draft control system

A process that execute only in main memory is referred to as ……………… and that allocated in disk is referred to a ……………. A) virtual memory, true memory B) virtual memory, real memory C) real memory, virtual memory D) imaginary memory, real memory

Description : A process that execute only in main memory is referred to as ……………… and that allocated in disk is referred to a ……………. A) virtual memory, true memory B) virtual memory, real memory C) real memory, virtual memory D) imaginary memory, real memory

Last Answer : C) real memory, virtual memory

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.

Arrays in C language can have ................. with reference to memory representation. (A) n-subscripts (B) two-subscripts (C) only one subscript (D) three subscripts only

Description : Arrays in C language can have ................. with reference to memory representation. (A) n-subscripts (B) two-subscripts (C) only one subscript (D) three subscripts only

Last Answer : (C) only one subscript 

Which of the following is not typically a benefit of dynamic linking? I. Reduction in overall program execution time. II. Reduction in overall space consumption in memory. III. Reduction in overall space consumption on disk. IV. Reduction in the cost of software updates. (A) I and IV (B) I only (C) II and III (D) IV only

Description : Which of the following is not typically a benefit of dynamic linking? I. Reduction in overall program execution time. II. Reduction in overall space consumption in memory. III. Reduction in overall space consumption on disk. IV. ... updates. (A) I and IV (B) I only (C) II and III (D) IV only

Last Answer : (B) I only 

In FDDI, data normally travel on .................. A) The primary ring B) The Secondary ring C) Both rings D) Neither ring

Description : In FDDI, data normally travel on .................. A) The primary ring B) The Secondary ring C) Both rings D) Neither ring

Last Answer : A) The primary ring

In mesh topology, relationship between one device and another is .............. A) Primary to peer B) Peer to primary C) Primary to secondary D) Peer to Peer

Description : In mesh topology, relationship between one device and another is .............. A) Primary to peer B) Peer to primary C) Primary to secondary D) Peer to Peer

Last Answer : D) Peer to Peer

ey to represent relationship between tables is called (A) Primary key (B) Secondary Key (C) Foreign Key (D) None of these

Description : ey to represent relationship between tables is called (A) Primary key (B) Secondary Key (C) Foreign Key (D) None of these

Last Answer : (C) Foreign Key

.......... displays the information about the active document such as page number, section number, number of pages, insertion point, position, etc. A) View Bar B) Menu Bar C) Status Bar D) Ruler Lin

Description : .......... displays the information about the active document such as page number, section number, number of pages, insertion point, position, etc. A) View Bar B) Menu Bar C) Status Bar D) Ruler Lin

Last Answer : C) Status Bar