Operativni Sistemi 1(Drugi Kolokvijum)
.
Questions and Answers
- 1.
Na slici je prikazano?-Ko je kriv za ovu pojavu?
- A.
Long-term scheduler
- B.
Page-fault routine
- C.
Dispatcher
- D.
Medium term scheduler
Correct Answer
D. Medium term schedulerExplanation
The given correct answer is "Medium term scheduler." The medium-term scheduler is responsible for temporarily removing processes from main memory and placing them in secondary storage when there is not enough memory available. This helps in managing memory efficiently and preventing memory overload. Therefore, the medium-term scheduler is the most suitable option for the given question about who is responsible for this phenomenon.Rate this question:
-
- 2.
Na slici je prikazano?
- A.
Globalno rešenje za trashing efekat
- B.
Kombinovano rešenje
- C.
Trajno rešenje
- D.
Lokalno rešenje za Trashing Efekat
Correct Answer
A. Globalno rešenje za trashing efekatExplanation
The correct answer is "Globalno rešenje za trashing efekat" which translates to "Global solution for the trashing effect." This suggests that the image represents a solution that can be applied globally to address the trashing effect.Rate this question:
-
- 3.
Šta vidite na ovoj slici?
- A.
Belady anomaliju i ona prati LRU algoritam
- B.
Belady anomaliju i ona prati optimal algoritam
- C.
Belady anomaliju i ona prati FIFO algoritam
- D.
PF
Correct Answer
C. Belady anomaliju i ona prati FIFO algoritamExplanation
The correct answer is "Belady anomaliju i ona prati FIFO algoritam" (Belady's anomaly and it follows the FIFO algorithm). Belady's anomaly refers to the phenomenon where increasing the number of page frames in a page replacement algorithm can actually lead to more page faults. This anomaly is specifically associated with the FIFO (First-In-First-Out) algorithm, where the oldest page is replaced when a new page needs to be brought into memory.Rate this question:
-
- 4.
Šta vidite na ovoj slici?
- A.
Samo bit validnosti
- B.
Disk prostora i bit validnosti
- C.
Samo disk prostor
- D.
Paging
Correct Answer
B. Disk prostora i bit validnostiExplanation
The correct answer is "Disk prostora i bit validnosti." This answer suggests that the image is related to disk space and the validity of data. The other options mentioned, such as "Samo bit validnosti," "samo disk prostor," and "Paging," do not accurately describe what is seen in the image.Rate this question:
-
- 5.
Šta vidite na ovoj slici?
- A.
Stack aproksimaciju optimal algoritma
- B.
Stack aproksimaciju FIFO algoritma
- C.
Internu fragmentaciju
- D.
Stack aproksimaciju LRU algoritma
Correct Answer
D. Stack aproksimaciju LRU algoritmaExplanation
The correct answer is "Stack aproksimaciju LRU algoritma." This answer suggests that the image is related to the stack approximation of the Least Recently Used (LRU) algorithm. The LRU algorithm is used to manage the cache memory and prioritize the most recently used items. The stack approximation of this algorithm involves using a stack data structure to keep track of the most recently accessed items. Therefore, the image likely represents the implementation or visualization of this stack approximation for the LRU algorithm.Rate this question:
-
- 6.
Kako se zove tehnika virtuelne memorije prikazana na slici?
- A.
DM
- B.
PD
- C.
DP(Demand Paging)
- D.
DMV
Correct Answer
C. DP(Demand Paging)Explanation
The correct answer is DP (Demand Paging). Demand Paging is a technique used in virtual memory systems where pages are loaded into memory only when they are demanded by the program. This helps in optimizing memory usage by loading only the required pages, reducing the overall memory footprint.Rate this question:
-
- 7.
Pojava koja se dogodila na ovoj slici naziva se?
- A.
DP
- B.
DM
- C.
DA
- D.
DNV
- E.
PF
Correct Answer
E. PFExplanation
The correct answer is PF.Rate this question:
-
- 8.
Šta vidite na ovoj slici?
- A.
Second Chance algoritam koji aproksimira FIFO algoritam
- B.
Second Chance algoritam koji aproksimira LRU algoritma
- C.
Second Chance algoritam koji aproksimira optimal algoritam
- D.
Second Chance algoritam koji aproksimira Round Robin algoritam
Correct Answer
B. Second Chance algoritam koji aproksimira LRU algoritmaExplanation
The correct answer is "Second Chance algoritam koji aproksimira LRU algoritma". This means that the Second Chance algorithm approximates the Least Recently Used (LRU) algorithm. The Second Chance algorithm is a page replacement algorithm that gives a second chance to pages that have been referenced recently, similar to how the LRU algorithm replaces the least recently used page. Therefore, the Second Chance algorithm is designed to closely mimic the behavior of the LRU algorithm in managing page replacements.Rate this question:
-
- 9.
Za sistem sa virtuelnom memorijom, sa DP tehnikom, zahteva se procesor:
- A.
Koji ima keš memoriju
- B.
Koji ima COSC bazirane instrukcije
- C.
Koji ima restartibilne instrukcije
- D.
Koji ima risc bazirane instrukcije
Correct Answer
C. Koji ima restartibilne instrukcijeExplanation
A system with virtual memory and DP technique requires a processor that has restartable instructions. Restartable instructions allow the processor to restart or resume execution from a specific point in the program, which is essential for managing virtual memory and handling page faults efficiently. By using restartable instructions, the processor can easily handle the swapping of pages between main memory and secondary storage, ensuring smooth operation of the virtual memory system.Rate this question:
-
- 10.
Do zamene stranica u sistemu sa virtuelnom memorijom dolazi zbog
- A.
Veličine keš memorije
- B.
Veličine virtuelne memorije
- C.
Veličine fizičke memorije
- D.
Veličine ram memorije
Correct Answer
C. Veličine fizičke memorijeExplanation
The swapping of pages in a system with virtual memory occurs due to the size of the physical memory. When the physical memory becomes full and cannot accommodate all the pages required by the running processes, the operating system swaps out some pages from the physical memory to the disk. This frees up space in the physical memory for new pages to be loaded. When a process needs a swapped-out page, it is brought back into the physical memory, and another page may be swapped out if necessary. Therefore, the size of the physical memory directly affects the frequency and amount of swapping that occurs.Rate this question:
-
- 11.
Virtuelna memorija može omogućiti deljenje datoteka?
- A.
Da
- B.
Zavisi od OS
- C.
Ne
- D.
Samo na Windows sistemima
Correct Answer
A. DaExplanation
Virtualna memorija omogućava deljenje datoteka jer se koristi kao produžetak fizičke memorije računara. Kada se fizička memorija napuni, nekorišćeni delovi podataka mogu biti premješteni na virtuelnu memoriju na disku. Ovo omogućava da se više programa istovremeno izvršava i deli iste datoteke, jer svaki program ima pristup virtuelnoj memoriji. Dakle, virtuelna memorija omogućava deljenje datoteka između različitih programa i procesa na računaru.Rate this question:
-
- 12.
Za sistem sa virtuelnom memorijom sa DP tehnikom, programer mora da vodi računa o pojavi PF
- A.
Ne
- B.
Zavisi od OS
- C.
Da
- D.
Samo na Windows sistemima
Correct Answer
A. NeExplanation
For a system with virtual memory and demand paging technique, the programmer does not have to worry about the occurrence of a page fault.Rate this question:
-
- 13.
Second chance clock algoritam zamene stranica u sistemu sa virtuelnom memorijom
- A.
Polazi od FIFO algoritma da bi simulirao optimal algoritam
- B.
Polazi od FIFO algoritma da bi simulirao LRU algoritam
- C.
Polazi od LRU algoritma da bi simulirao optimal algoritam
Correct Answer
B. Polazi od FIFO algoritma da bi simulirao LRU algoritamExplanation
The second chance clock algorithm starts with the FIFO algorithm to simulate the LRU algorithm. This means that the algorithm first uses the FIFO (First-In-First-Out) approach to determine which page to replace, but it also incorporates a second chance mechanism. When a page is accessed, it is given a "second chance" and is moved to the end of the queue. If a page has not been accessed again by the time it reaches the front of the queue, it is considered for replacement. This combination of FIFO and second chance gives the algorithm a similar behavior to the LRU (Least Recently Used) algorithm.Rate this question:
-
- 14.
U sistemima sa vrituelnom memorijom, sa DP tehnikom, između virtuelne i fizičke memorije, prebacuje se
- A.
Nekoliko stranica
- B.
Jedna jedina stranica
- C.
Ceo prenos
- D.
Ne znam
Correct Answer
B. Jedna jedina stranicaExplanation
In systems with virtual memory and demand-paging technique, only one single page is transferred between virtual and physical memory. This means that when a page is needed, it is brought into physical memory from virtual memory, and when it is no longer needed, it is moved back to virtual memory. This allows for efficient memory management by only transferring the necessary pages, reducing the amount of data that needs to be moved between the two memory spaces.Rate this question:
-
- 15.
Optimal algoritam zamene stranica u sistemu sa virtuelnom memorijom se
- A.
Retko koristi
- B.
Često koristi
- C.
Nije ga moguće realizovati, pa se ne koristi
Correct Answer
C. Nije ga moguće realizovati, pa se ne koristi -
- 16.
Optimal algoritam zamene stranica sa virtuelnom memorijom ima
- A.
Srednje performanse
- B.
Najgore persormanse
- C.
Jako slabe performanse
- D.
Najbolje performanse
Correct Answer
D. Najbolje performanseExplanation
The optimal page replacement algorithm has the best performance because it selects the page that will not be used for the longest period of time in the future. This ensures that the number of page faults is minimized, resulting in efficient memory management.Rate this question:
-
- 17.
LRU algoritam zamene stranica u sistemu sa virtuelnom memorijom
- A.
Nije ga moguce realizovati
- B.
Jednostavan za realizaciju
- C.
Jako složen za realizaciju
- D.
Ne znam
Correct Answer
C. Jako složen za realizacijuExplanation
The correct answer is "Jako složen za realizaciju" which translates to "Very complex to implement". This means that the LRU (Least Recently Used) page replacement algorithm in a system with virtual memory is difficult to implement. This algorithm requires keeping track of the order in which pages are accessed and replacing the least recently used page when the memory is full. Implementing this algorithm involves maintaining a data structure such as a queue or a linked list to track the page usage, which adds complexity to the system.Rate this question:
-
- 18.
U sistemu sa virtuelnom memorijom
- A.
Moderniji su swaping sistemi
- B.
Oba sistema su relativno moderna
- C.
Moderniji su paging sistemi
- D.
Ne znam
Correct Answer
C. Moderniji su paging sistemiExplanation
The correct answer is "Moderniji su paging sistemi." This is because in a system with virtual memory, paging systems are more modern compared to swapping systems. Paging systems divide the virtual address space into fixed-size pages and map them to physical memory, allowing for more efficient memory management. Swapping systems, on the other hand, move entire processes in and out of main memory, which can be less efficient. Therefore, the statement suggests that paging systems are the more advanced option in virtual memory systems.Rate this question:
-
- 19.
U sistemu sa virtuelnom memorijom, i to kod swaping sistema
- A.
Prebacuju se celi procesi između virtuelne fascikle i memorije
- B.
Prebacuju se samo stranice procesa između virtuelne i fizičke memorije
- C.
Prebacuju se samo bajtovi procesa između fizičke memorije
- D.
Ne znam
Correct Answer
A. Prebacuju se celi procesi između virtuelne fascikle i memorijeExplanation
In a swapping system with virtual memory, entire processes are moved between the virtual disk and memory. This means that when a process is not actively being used, it can be moved to the virtual disk to free up memory space for other processes. When the process needs to be accessed again, it can be swapped back into memory. This swapping of entire processes allows for efficient memory management and enables the system to handle more processes than the available physical memory can accommodate.Rate this question:
-
- 20.
FIFO algoritam zamene stranica u sistemu sa virtuelnom memorijom je:
- A.
Jako složen za realizaciju
- B.
Nije ga moguće realizovati
- C.
Jednostavan za realizaciju
- D.
Nemoguc za realizaciju
Correct Answer
C. Jednostavan za realizacijuExplanation
The correct answer is "Jednostavan za realizaciju" (Simple to implement). The FIFO (First-In-First-Out) page replacement algorithm is one of the simplest algorithms used in virtual memory systems. It works by replacing the oldest page in memory, which requires minimal computation and is easy to implement. Other page replacement algorithms may be more efficient in terms of performance, but FIFO is straightforward and does not require complex calculations or data structures.Rate this question:
-
- 21.
Kada nastupi Trashing efekat iskorišćenje procesa je oko
- A.
50%
- B.
100%
- C.
90%
- D.
0%
Correct Answer
D. 0%Explanation
The given question is in Serbian language and it is asking about the utilization process when the Trashing effect occurs. The correct answer is 0% because the Trashing effect refers to a situation where the system's performance decreases significantly due to excessive multitasking or resource allocation. In this case, the utilization process is not effectively utilized, resulting in a 0% utilization rate.Rate this question:
-
- 22.
Trashing efekat je posledica
- A.
Preopterećenosti mreže
- B.
Pojave ogromnog broja PF grešaka
- C.
Preopterećenja CPU
- D.
Nedostatka prostora na disku
Correct Answer
B. Pojave ogromnog broja PF grešakaExplanation
The correct answer is "Pojave ogromnog broja PF grešaka." This means that the trashing effect is caused by the occurrence of a large number of page fault errors. Trashing refers to a situation in which the system is constantly swapping pages between the main memory and the disk, resulting in poor performance. When there are a high number of page fault errors, it indicates that the system is struggling to find the required pages in memory, leading to excessive swapping and trashing.Rate this question:
-
- 23.
Second chance algoritam zamene stranica u sistemu sa virtuelnom memorijom je:
- A.
Može se izvršavati, ako je napisan u formi overlay
- B.
Ne može da se izvršava uopšte
- C.
Može da se izvršava, ako je napisan u dil formi
- D.
Može se izvršavati bez ikakvih problema
Correct Answer
D. Može se izvršavati bez ikakvih problemaExplanation
The second chance algorithm for page replacement in a virtual memory system can be executed without any issues.Rate this question:
-
- 24.
U sistemima sa virtuelnom memorijom, sa DP tehnikom
- A.
Prebacuju se celi procesi između virtuelne i fizičke memorije
- B.
Prebacuju se grupa stranica počevši od one koja je napravila PF
- C.
Prebacuju se samo stranica koja nije napravila PF
- D.
Prebacuju se samo stranica koja je napravila PF
Correct Answer
D. Prebacuju se samo stranica koja je napravila PFExplanation
In systems with virtual memory, using the Demand Paging technique, only the page that caused a page fault is transferred between the virtual and physical memory. This means that when a page fault occurs, the operating system only brings in the specific page that caused the fault from the secondary storage into the physical memory, rather than transferring the entire process or a group of pages. This helps optimize memory usage and improves overall system performance.Rate this question:
-
- 25.
LRU algoritam zamene stranica u sistemu sa virtuelnom memorijom se može aproksimirati
- A.
Keš tehnikom
- B.
TLP tehnikom
- C.
TLP tehnikom
- D.
Brojačima ili stek mehanizmom
Correct Answer
D. Brojačima ili stek mehanizmomExplanation
The LRU (Least Recently Used) page replacement algorithm in a virtual memory system can be approximated using counters or a stack mechanism. This means that either counters can be used to keep track of the usage of each page, and the page with the lowest count can be replaced, or a stack can be used to keep track of the most recently used pages, and the page at the bottom of the stack can be replaced. Both of these approaches are valid ways to approximate the LRU algorithm.Rate this question:
-
- 26.
Optimal algoritam zamene stranica u sistemu sa virtuelnom memorijom
- A.
Se može realizovati i maksimalno se koristi
- B.
Se ne može realizovati i ne koristi se uopšte
- C.
Se ne može realizovati i koristi se za procenu kvaliteta realnih algoritma
- D.
Ne znam
Correct Answer
C. Se ne može realizovati i koristi se za procenu kvaliteta realnih algoritmaExplanation
The correct answer states that the optimal page replacement algorithm cannot be implemented and is used to evaluate the quality of other real algorithms. This suggests that the optimal algorithm is not practical or feasible to use in real systems, but it serves as a benchmark to compare the performance of other algorithms.Rate this question:
-
- 27.
Second chance(clock) algoritam zamene stranica u sistemu sa virtuelnom memorijom je aproksimacija
- A.
Optimal algoritam
- B.
LRU algoritam
- C.
FIFO algoritam
- D.
PCB
Correct Answer
B. LRU algoritamExplanation
The correct answer is LRU algorithm. LRU stands for Least Recently Used, and it is a page replacement algorithm used in virtual memory systems. It works on the principle that the page that has not been used for the longest time will be the least likely to be used in the future. Therefore, when a page needs to be replaced, the LRU algorithm selects the least recently used page for eviction. This helps to minimize the number of page faults and optimize memory usage.Rate this question:
-
- 28.
Osnovni kriterijum za LRU algoritam je
- A.
Vreme poslednjeg pristupa stanice
- B.
Vreme ulaska stanice u sistem
- C.
Broj pristupa u stanici
- D.
Ne znam
Correct Answer
A. Vreme poslednjeg pristupa staniceExplanation
The correct answer is "Vreme poslednjeg pristupa stanice" which translates to "Time of the last access to the station" in English. This means that the LRU (Least Recently Used) algorithm uses the timestamp of the most recent access to determine which data should be replaced in the cache. It prioritizes evicting the least recently used data to optimize cache performance.Rate this question:
-
- 29.
LRU algoritam zamene stranica u sistemu sa virtuelnom memorijom ima
- A.
Najbolje perfomanse
- B.
Slabe performanse
- C.
Dobre performanse
- D.
Srednje performanse
Correct Answer
C. Dobre performanseExplanation
The LRU (Least Recently Used) page replacement algorithm in a virtual memory system performs well. It aims to minimize the number of page faults by replacing the least recently used page with a new one. By doing so, it ensures that the most recently used pages are kept in the memory, which reduces the occurrence of page faults and improves the overall performance of the system.Rate this question:
-
- 30.
FIFO algoritam zamene stranica u sistemu sa virtuelnom memorijom se može realizovati
- A.
Zato što se bazira na svim referencama kojima je sistem ikada pristupao
- B.
Zato što se bazira na referencama iz prošlosti
- C.
Zato što se bazira na referencama iz budućnosti
- D.
Ne znam
Correct Answer
B. Zato što se bazira na referencama iz prošlostiExplanation
The correct answer is "Zato što se bazira na referencama iz prošlosti" (Because it is based on past references). The First-In-First-Out (FIFO) page replacement algorithm replaces the oldest page in memory first. It assumes that the pages that have been in memory the longest are less likely to be used in the future. Therefore, it makes sense to replace the pages that have not been accessed recently, which is why it is based on past references.Rate this question:
-
- 31.
Trashing efekat je posledica
- A.
Curenje memorija
- B.
Malog broja procesa koji imaju ogromne CPU zahteve
- C.
Velikog broja procesa koji imaju male CPU zahteve
- D.
Nepažljivo uvodjenje novih procesa u sistem
Correct Answer
D. Nepažljivo uvodjenje novih procesa u sistemExplanation
The correct answer is "Nepažljivo uvodjenje novih procesa u sistem" (Careless introduction of new processes into the system). This means that the trashing effect is caused by the careless or reckless introduction of new processes into the system. This can lead to an overload of processes and resources, resulting in poor system performance and excessive swapping of data between the main memory and the disk.Rate this question:
-
- 32.
Second chance(clock) algoritam zamene stranica u sistemu sa virtuelnom memorijom je aproksimacija ili simulacija
- A.
Optimal algoritma
- B.
FIFO algoritma
- C.
LRU algoritam
- D.
Ne znam
Correct Answer
C. LRU algoritamExplanation
The correct answer is LRU (Least Recently Used) algorithm. LRU algorithm is a page replacement algorithm used in virtual memory systems. It works on the principle that the least recently used page is the one that is most likely to be replaced. It keeps track of the usage of each page and replaces the page that has not been used for the longest time. By doing so, it maximizes the likelihood of keeping frequently used pages in memory, which helps in improving the overall system performance.Rate this question:
-
- 33.
Virtuelna memorija za memorijski mapirane datoteke:
- A.
Ima nepredvidiv uticaj na brzinu rada sa datotekama
- B.
Osetno usporava rad sa datotekama
- C.
Ubrzava rad sa datotekama
- D.
Delimično usporava rad sa datotekama
Correct Answer
C. Ubrzava rad sa datotekamaExplanation
Virtual memory for memory-mapped files speeds up file operations. By mapping files into virtual memory, the operating system can treat them as if they were part of the computer's physical memory. This allows for faster access to the file data, as it can be directly accessed from memory rather than having to be read from the disk. Therefore, using virtual memory for memory-mapped files accelerates file operations.Rate this question:
-
- 34.
Second chance clock algoritam zamene stranica u sistemu sa virtuelnom memorijom se:
- A.
Često koristi
- B.
Nije ga moguće realizovati, pa se ne koristi
- C.
Retko koristi
- D.
Ne znam
Correct Answer
A. Često koristiExplanation
The Second Chance clock algorithm is a commonly used page replacement algorithm in virtual memory systems. It is designed to approximate the behavior of the optimal page replacement algorithm while being more efficient to implement. This algorithm keeps track of a reference bit for each page, which is set to 1 whenever the page is accessed. When a page needs to be replaced, the algorithm looks for a page with a reference bit of 0. If all pages have a reference bit of 1, the algorithm gives them a second chance by setting their reference bit to 0 and moving to the next page. This process continues until a page with a reference bit of 0 is found for replacement.Rate this question:
-
- 35.
Da biste realizovali sistem sa virtuelnom memorijom sa DP tehnikom, u tabelu stranica morate ubaciti
- A.
R bit
- B.
D bit
- C.
V bit
- D.
Age bits
Correct Answer
C. V bitExplanation
In order to implement a virtual memory system with the Demand Paging technique, the V bit (Valid bit) needs to be included in the page table. The V bit is used to indicate whether a particular page is currently in main memory or if it has been swapped out to secondary storage. This allows the system to efficiently manage the allocation and retrieval of pages as needed, optimizing memory usage and performance. The R bit (Referenced bit) and D bit (Dirty bit) are also important for tracking page usage and modifications, but they are not specifically required for implementing the Demand Paging technique.Rate this question:
-
- 36.
Za sistem sa virtuelnom memorijom, sa DP tehnikom pojave PF za dati proces se prikazuje na ekranu
- A.
Da
- B.
Ne
- C.
Zavisi od OS
- D.
Ne znam
Correct Answer
B. NeExplanation
In a system with virtual memory, page faults (PF) occur when a process requests a page that is not currently in the main memory. These page faults are not typically shown on the screen as they are handled by the operating system internally. Therefore, the answer "Ne" (No) is correct as page faults are not directly displayed on the screen.Rate this question:
-
- 37.
Za virtuelnu memoriju, proces mora biti direktno u memoriji
- A.
Zavisi od OS
- B.
Ne
- C.
Da
- D.
Option 4
Correct Answer
B. NeExplanation
The statement is saying that for virtual memory, the process does not need to be directly in memory. This means that the process can be stored in secondary storage, such as a hard drive, and only portions of it that are actively being used are loaded into memory. This allows for efficient memory management and the ability to run larger programs than the available physical memory would allow.Rate this question:
-
- 38.
Osnovni algoritmi zamene stranica u sistemu sa virtuelnom memorijom su:
- A.
SCAN,LOOK
- B.
FIFO,LRU,OPTIMAL
- C.
FIFO,SJF
- D.
Option 4
Correct Answer
B. FIFO,LRU,OPTIMALExplanation
The correct answer is FIFO, LRU, OPTIMAL. These algorithms are used for page replacement in a system with virtual memory. FIFO (First-In-First-Out) replaces the oldest page in memory, LRU (Least Recently Used) replaces the page that has not been used for the longest time, and OPTIMAL replaces the page that will not be used for the longest time in the future. These algorithms help in efficient management of memory by replacing pages when there is a need for more space.Rate this question:
-
- 39.
Da biste realizovali Second chance clock algoritam zamene stranica u sistemu sa virtuelnom memorijom, u tabelu stranica morate ubaciti
- A.
Ne znam
- B.
R bit
- C.
V bit
- D.
D bit
Correct Answer
B. R bitExplanation
To implement the Second chance clock algorithm for page replacement in a virtual memory system, the pages in the page table need to have a "R bit" (Referenced bit). The R bit is used to track whether a page has been recently accessed or not. When a page needs to be replaced, the algorithm checks the R bit of each page in a circular manner. If the R bit is set, indicating that the page has been recently accessed, it is given a second chance and the R bit is cleared. If the R bit is not set, the page is chosen for replacement. Therefore, the R bit is necessary for the functioning of the Second chance clock algorithm.Rate this question:
-
- 40.
Za sistem sa virtuelnom memorijom sa DP tehnikom, vremena izvršavanja instukcije kada napravi PF i kada ne napravi PF su:
- A.
Ne mnogo različita
- B.
Ista
- C.
Veoma različita
- D.
Ne znam
Correct Answer
C. Veoma različitaExplanation
For a system with virtual memory using the Demand Paging technique, the execution times of an instruction when it causes a Page Fault (PF) and when it does not cause a Page Fault are very different.Rate this question:
-
- 41.
Virtuelna memorija može imati veliki uticaj na način programiranja
- A.
Samo u slučaju ograničene dodele okvira fizičke memorije
- B.
Uvek
- C.
Samo u slučaju ograničene dodele okvira virtuelne memorije
- D.
Nema uticaja
Correct Answer
A. Samo u slučaju ograničene dodele okvira fizičke memorijeExplanation
The correct answer suggests that virtual memory can have a significant impact on programming only in the case of limited allocation of physical memory. This implies that when there is a restriction on the amount of physical memory available, virtual memory becomes crucial in managing memory resources and optimizing program execution. In such cases, programmers need to consider the limitations and constraints imposed by the allocation of physical memory frames to effectively utilize virtual memory.Rate this question:
-
- 42.
Osnovni kriterijum za FIFO algoritam je:
- A.
Broj pristupa stanici
- B.
Vreme poslednjeg pristupa stranice
- C.
Vreme ulaska stranice u sistem
- D.
Ne znam
Correct Answer
C. Vreme ulaska stranice u sistemExplanation
The basic criterion for the FIFO algorithm is the time at which a page enters the system. This means that the page that has been in the system for the longest time will be selected for replacement when a page fault occurs. The FIFO algorithm does not consider the number of accesses to the page or the time of the last access. It simply follows a first-in-first-out approach, where the oldest page is replaced first.Rate this question:
-
- 43.
Šta vidite na slici:
- A.
Stack aproksimaciju LRU algoritma
- B.
Stack aproksimaciju optimal algoritma
- C.
Stack aproksimaciju FIFO algoritma
- D.
Ne znam
Correct Answer
A. Stack aproksimaciju LRU algoritmaExplanation
The correct answer is "stack aproksimaciju LRU algoritma". This suggests that the image is showing a stack approximation of the Least Recently Used (LRU) algorithm. LRU is a commonly used cache replacement algorithm where the least recently used item is evicted from the cache when it is full and a new item needs to be inserted. The stack approximation of LRU algorithm maintains a stack of recently accessed items, with the most recently accessed item at the top. When a new item needs to be inserted, the item at the bottom of the stack (the least recently used item) is evicted.Rate this question:
-
- 44.
Optimal algoritam zamene stranica u sistemu sa virtuelnom memorijom ima ::f
- A.
Jako slabe performanse
- B.
Srednje performanse
- C.
Najbolje performanse
- D.
Dobre performanse
Correct Answer
C. Najbolje performanseExplanation
The optimal page replacement algorithm in a virtual memory system provides the best performance. This algorithm selects the page that will not be used for the longest period of time in the future and replaces it with the new page. By doing so, it minimizes the number of page faults and maximizes the efficiency of the system. Therefore, it can be concluded that the optimal algorithm has the best performance among the given options.Rate this question:
-
- 45.
Globalno rešenje za Trashing efekat je:
- A.
Održavati CPU iskorišćenje ispod 90%
- B.
Napraviti sistemski model radnog skupa celog sistema i komparirati ga veličinom fizičke memorije
- C.
Napraviti sistemski model radnog skupa celog sistema i komparirati ga veličinom virtuelne memorije
- D.
Održavati CPU iskorišćenje ispod 50%
- E.
Pratiti PF greške za svaki proces pojedinačno i regulisati raspodelu fizičke memorije po procesima
Correct Answer
B. Napraviti sistemski model radnog skupa celog sistema i komparirati ga veličinom fizičke memorijeExplanation
The correct answer suggests that creating a system model of the entire system's working set and comparing it with the size of physical memory is the global solution for the Trashing effect. This implies that by analyzing the system's working set and comparing it with the available physical memory, one can determine if the system is experiencing excessive page swapping, which is characteristic of the Trashing effect. By identifying this, appropriate measures can be taken to optimize memory usage and prevent the Trashing effect.Rate this question:
-
- 46.
Imate sledece stranice(proveri ovo)
- A.
Stranica 4
- B.
Stranica 1
- C.
Stranica 3
- D.
Stranica 2
Correct Answer
B. Stranica 1Explanation
The correct answer is "Stranica 1" because it is the first page mentioned in the given list. The list starts with "Stranica 4" and then goes on to "Stranica 1," followed by "Stranica 3," and finally "Stranica 2." Therefore, "Stranica 1" is the correct answer as it is the first page mentioned in the given list.Rate this question:
-
- 47.
Lokalno rešenje za Trashing efekat je
- A.
Održavati CPU iskorišćenje ispod 90%
- B.
Napraviti sistemski model radnog skupa celog isstema i komparirati ga sa veličinom fizičke memorije
- C.
Napraviti sistemski model radnog skupa celog isstema i komparirati ga sa veličinom virtuelne memorije
- D.
Održavati CPU iskorišćenje ispod 50%
- E.
Pratiti PF greške za svaki proces pojedinačno i regulisati rapodelu fizičke memorije po procesima
Correct Answer
E. Pratiti PF greške za svaki proces pojedinačno i regulisati rapodelu fizičke memorije po procesimaExplanation
The correct answer suggests that the solution to the Trashing effect is to monitor page fault errors (PF greške) for each process individually and adjust the allocation of physical memory (fizička memorija) for each process accordingly. This approach allows for efficient memory management and helps prevent excessive swapping of pages between main memory and secondary storage, which is the main cause of the Trashing effect.Rate this question:
-
- 48.
Za sisteme sa virtuelnom memorijom, sa DP (Demand Paging) tehnikom, rešavanje problema sa PF (page fault) obavlja:
- A.
programmer
- B.
Operativni sistem
- C.
Sam hardver
- D.
Ne znam
Correct Answer
B. Operativni sistemExplanation
In systems with virtual memory and demand paging technique, the operating system handles the problem of page faults (PF). This means that when a page fault occurs, the operating system is responsible for retrieving the required page from secondary storage and bringing it into main memory. The programmer does not directly handle page faults, as it is the operating system's responsibility to manage memory and handle page faults. The hardware also plays a role in handling page faults, but the primary responsibility lies with the operating system.Rate this question:
-
- 49.
Osnovni kriterijum za LFU/MFU algoritam je:
- A.
Vreme ulaska stranice u sistem
- B.
Vreme poslednjeg pristupa stranice
- C.
Broj pristupa stranici
- D.
Option 4
Correct Answer
C. Broj pristupa straniciExplanation
The basic criterion for the LFU/MFU algorithm is the number of accesses to a page. This means that the algorithm prioritizes pages that have been accessed the least or the most frequently, depending on whether it is the LFU (Least Frequently Used) or MFU (Most Frequently Used) variant. The aim is to keep the most frequently accessed pages in memory to improve overall system performance.Rate this question:
-
- 50.
Virtuelna memorija može imati veliki uticaj na nači programiranja:
- A.
Samo ako fizička memorija po procesu nije ograničena
- B.
samo ako je fizička memorija po procesu ograničena
- C.
Zavisi od OS
Correct Answer
B. samo ako je fizička memorija po procesu ograničena -
Back to top