Operativni SiSTEMi 1(Drugi Kolokvijum)

Reviewed by Editorial Team

The ProProfs editorial team is comprised of experienced subject matter experts. They've collectively created over 10,000 quizzes and lessons, serving over 100 million users. Our team includes in-house content moderators and subject matter experts, as well as a global network of rigorously trained contributors. All adhere to our comprehensive editorial guidelines, ensuring the delivery of high-quality content.

Learn about Our Editorial Process

| By Nikola

Nikola

Community Contributor

Quizzes Created: 3 | Total Attempts: 4,111

| Attempts: 1,482

Quiz Flashcard

Questions

Feedback

During the Quiz End of Quiz

Difficulty

Easy First Hard First Sequential

1/150 Pitanja

Šta vidite na ovoj slici
- Ovo je evidencija o blokovima-bit-mapa- za svaki klaster ima po jedan bit. Bit mape su jednostavne, ali troše mnogo prostora u memoriji. Fat i linkovane liste nisu isto. Alternativa bit mapama su linkovane liste
- Ovo je bit vector podela
- Ne znam
- Bit mapa

Quiz Preview

2.

Šta vidite na ovoj slici?
- Klastere
- Data aresa
- Ovo je FAT file sistem-predstavlja modifikovanu linkovanu alokaciju. U originalnoj linkovanoj alokaciji u samom praznom data bloku nalazi se pointer na slededi. Kod FAT-a se ti pointeri skupljaju u posebno data područje koje se naziva File Allocation Table-FAT
- Ne znam
Correct Answer

A. Ovo je FAT file sistem-predstavlja modifikovanu linkovanu alokaciju. U originalnoj linkovanoj alokaciji u samom praznom data bloku nalazi se pointer na slededi. Kod FAT-a se ti pointeri skupljaju u posebno data područje koje se naziva File Allocation Table-FAT

Explanation

The correct answer explains that the image represents the FAT file system, which is a modified linked allocation. In the original linked allocation, the empty data block contains a pointer to the next block. In FAT, these pointers are collected in a separate data area called the File Allocation Table (FAT).

Rate this question:
3.

Šta vidite na ovoj slici?
- Ovo je UNIX-LINUX FS prepoznaje se po prisustvu I node-ova. U I-node-ovima je sve osim imena
- Ovo je Windows FS, prepoznaje se po DATA area
- Ovo je linux FS, prepoznaje se po fs layout
- Ne znam
Correct Answer

A. Ovo je UNIX-LINUX FS prepoznaje se po prisustvu I node-ova. U I-node-ovima je sve osim imena

Explanation

The correct answer is that the image represents a UNIX-LINUX file system, which is recognized by the presence of I-nodes. In I-nodes, everything except the name is stored.

Rate this question:
4.

Kako se zove tehnika virtuelne memorije prikazana na slici?
- DM
- PD
- DP(Demand Paging)
- DMV
Correct Answer

A. 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:
5.

Osnovni algoritmi zamene stranica u sistemu sa virtuelnom memorijom su:
- SCAN,LOOK
- FIFO,LRU,OPTIMAL
- FIFO,SJF
- Option 4
Correct Answer

A. FIFO,LRU,OPTIMAL

Explanation

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:
6.

Šta vidite na ovoj slici?
- NTFS
- NFS
- SMB
- VFS (Virtual File System-Virtuelni system datoteka)
Correct Answer

A. VFS (Virtual File System-Virtuelni system datoteka)

Explanation

The correct answer is VFS (Virtual File System-Virtuelni system datoteka). This is because VFS is a software layer that provides a consistent interface for accessing different types of file systems. It allows applications to access files and directories without needing to know the details of the underlying file system. NTFS, NFS, and SMB are all examples of specific file systems that can be accessed through VFS.

Rate this question:
7.

Koju alokaciju vidite na ovoj slici:
- Indeksna alokacija(svi pointeri na jednom mestu)
- Kontinualna alokacija
- Nepoznata
- Linkovana alokacija
Correct Answer

A. Indeksna alokacija(svi pointeri na jednom mestu)

Explanation

The correct answer is "Indeksna alokacija (svi pointeri na jednom mestu)". This means that the allocation shown in the picture is using an index allocation method where all the pointers are stored in one place. This method allows for efficient access to the allocated memory by using an index or pointer to locate the specific memory location. It is a common method used in data structures like arrays, where elements are accessed using their index.

Rate this question:
8.

Ovo su imena nekih tehnika: Linear list Hash table B-trees Najmodernija i najbolja je:
- Linear list
- Hash tablet
- Nijedna od ponudjenih
- B-trees
Correct Answer

A. B-trees

Explanation

B-trees are considered the most modern and efficient technique among the given options. B-trees are self-balancing search trees that provide efficient data storage and retrieval operations. They are commonly used in databases and file systems due to their ability to handle large amounts of data and maintain balanced tree structures. Compared to linear lists and hash tables, B-trees offer better performance for operations like searching, inserting, and deleting data. Therefore, B-trees are considered the most advanced and optimal choice among the given techniques.

Rate this question:
9.

Šta vidite na ovoj slici?
- Stack aproksimaciju optimal algoritma
- Stack aproksimaciju FIFO algoritma
- Internu fragmentaciju
- Stack aproksimaciju LRU algoritma
Correct Answer

A. Stack aproksimaciju LRU algoritma

Explanation

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:
10.

Trashing efekat je posledica
- Preopterećenosti mreže
- Pojave ogromnog broja PF grešaka
- Preopterećenja CPU
- Nedostatka prostora na disku
Correct Answer

A. Pojave ogromnog broja PF grešaka

Explanation

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:
11.

Second chance(clock) algoritam zamene stranica u sistemu sa virtuelnom memorijom je aproksimacija ili simulacija
- Optimal algoritma
- FIFO algoritma
- LRU algoritam
- Ne znam
Correct Answer

A. LRU algoritam

Explanation

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:
12.

Šta vidite na slici:
- Stack aproksimaciju LRU algoritma
- Stack aproksimaciju optimal algoritma
- Stack aproksimaciju FIFO algoritma
- Ne znam
Correct Answer

A. Stack aproksimaciju LRU algoritma

Explanation

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:
13.

Šta vidite na ovoj slici:?
- Ulazne adrese u windows arhitekturi
- Standardizovane ulazno izlazne adrese u PC arhitekturi
- Izlazne adrese u Linux arhitekturi
- Ne znam
Correct Answer

A. Standardizovane ulazno izlazne adrese u PC arhitekturi

Explanation

The correct answer is "Standardizovane ulazno izlazne adrese u PC arhitekturi" (Standardized input-output addresses in PC architecture). This answer is based on the information provided in the question, which mentions different types of addresses in different architectures. The answer choice "Standardizovane ulazno izlazne adrese u PC arhitekturi" specifically refers to standardized input-output addresses in PC architecture, which aligns with the context given in the question.

Rate this question:
14.

U sistemima sa vrituelnom memorijom, sa DP tehnikom, između virtuelne i fizičke memorije, prebacuje se
- Nekoliko stranica
- Jedna jedina stranica
- Ceo prenos
- Ne znam
Correct Answer

A. Jedna jedina stranica

Explanation

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.

Simulacija random pristupa u odnosu na ovakav pristup datoteci se realizuje pomocu sistemskog poziva
- Read
- Write
- Open
- Close
- Lseek
Correct Answer

A. Lseek

Explanation

The correct answer is Lseek. Lseek is a system call that is used to change the position of the file pointer within a file. It allows for random access to the file, meaning that the file can be read or written at any position, rather than just sequentially from the beginning. This makes it useful for simulations that require random access to data in a file.

Rate this question:
16.

Na slici vidite?
- Flushing tehniku
- Hash tehniku
- Write-back tehniku
- Journaling tehniku (pomaže, pre svega, write-back upisu)
Correct Answer

A. Journaling tehniku (pomaže, pre svega, write-back upisu)

Explanation

The correct answer is Journaling technique because it primarily helps with write-back updates.

Rate this question:
17.

Gde se primenjuju ove tehnike?
- Kod UNIX-a nazivaju se Direktorijumi, a kod Windows-a-folderi. Linearne liste jesu starinske tehnike, dok su Hash table i B-trees moderne tehnike.
- Kod UNIX-a nazivaju se folderi, a kod Windows-a direktorijumi. Linearne liste jesu starinske tehnike, dok su Hash table i B-trees moderne tehnike.
- Ne znam
Correct Answer

A. Kod UNIX-a nazivaju se Direktorijumi, a kod Windows-a-folderi. Linearne liste jesu starinske tehnike, dok su Hash table i B-trees moderne tehnike.

Explanation

The explanation is that in UNIX, directories are called "Direktorijumi" while in Windows they are called "folderi". Linear lists are considered outdated techniques, while Hash tables and B-trees are considered modern techniques.

Rate this question:
18.

Šta vidite na ovoj slici?
- Samo bit validnosti
- Disk prostora i bit validnosti
- Samo disk prostor
- Paging
Correct Answer

A. Disk prostora i bit validnosti

Explanation

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:
19.

Virtuelna memorija može omogućiti deljenje datoteka?
- Da
- Zavisi od OS
- Ne
- Samo na Windows sistemima
Correct Answer

A. Da

Explanation

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:
20.

Kada nastupi Trashing efekat iskorišćenje procesa je oko
- 50%
- 100%
- 90%
- 0%
Correct Answer

A. 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:
21.

Second chance(clock) algoritam zamene stranica u sistemu sa virtuelnom memorijom je aproksimacija
- Optimal algoritam
- LRU algoritam
- FIFO algoritam
- PCB
Correct Answer

A. LRU algoritam

Explanation

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:
22.

Na slici vidite?
- Razne tehnike za ubrzavanje performasni FS (slika prikazuje podelu keša!)
- Razne tehnike za smanjenje interne fragmentacije FS
- Razne tehnike za povecanje pouzdanosti FS
- Razne tehnike za smanjenje interne fragmentacije FS
Correct Answer

A. Razne tehnike za ubrzavanje performasni FS (slika prikazuje podelu keša!)

Explanation

The correct answer is "Razne tehnike za ubrzavanje performasni FS (slika prikazuje podelu keša!)" because the image shown represents different techniques for accelerating performance in a file system, specifically related to cache partitioning.

Rate this question:
23.

Šta vidite na ovoj slici?
- Tabela adresa
- Vektori
- Interrupt-vector tabela. Adresa prekidnih rutina
- Blok adrese
Correct Answer

A. Interrupt-vector tabela. Adresa prekidnih rutina

Explanation

The correct answer is "Interrupt-vector tabela. Adresa prekidnih rutina" (Interrupt-vector table. Address of interrupt routines). This is because the given options are related to different types of addresses or tables, and only the option "Interrupt-vector tabela" specifically mentions interrupt vectors and their addresses. Interrupt vectors are used in computer systems to store the addresses of interrupt service routines, which are executed when a specific interrupt occurs. Therefore, this option is the most relevant and accurate answer.

Rate this question:
24.

LRU algoritam zamene stranica u sistemu sa virtuelnom memorijom se može aproksimirati
- Keš tehnikom
- TLP tehnikom
- TLP tehnikom
- Brojačima ili stek mehanizmom
Correct Answer

A. Brojačima ili stek mehanizmom

Explanation

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:
25.

Imate sledece stranice(proveri ovo)
- Stranica 4
- Stranica 1
- Stranica 3
- Stranica 2
Correct Answer

A. Stranica 1

Explanation

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:
26.

Šta vidite na ovoj slici?
- Hard linking
- Mounting
- Junction points
- Symbolic linking
Correct Answer

A. Mounting

Explanation

Mounting refers to the process of integrating a file system into the existing directory structure of the operating system. It allows the user to access the files and directories in the mounted file system as if they were part of the local file system. This can be done by associating a directory with a device or a remote file system. Mounting is commonly used in operating systems to access external storage devices or network shares. Therefore, the correct answer is Mounting.

Rate this question:
27.

Šta vidite na ovoj slici?
- Struktura magistrale kod PC-a
- Struktura rama kod PC-a
- Struktura hard diska
- Ne znam
Correct Answer

A. Struktura magistrale kod PC-a

Explanation

The correct answer is "Struktura magistrale kod PC-a" (Structure of the bus in a PC). This answer is correct because the image is likely showing the internal components and connections of a computer's bus system. The bus is responsible for transferring data between different components of a computer, such as the CPU, memory, and peripherals. Therefore, it is logical to identify the image as depicting the structure of the bus in a PC.

Rate this question:
28.

Na slici vidite?
- Tehniku za povecanje pouzdanosti FS
- Aging tehniku
- Data area tehniku
- Tehniku za smanjenje pozudanosti FCB
Correct Answer

A. Tehniku za povecanje pouzdanosti FS

Explanation

The correct answer is "Tehniku za povecanje pouzdanosti FS" which translates to "Technique for increasing the reliability of FS" in English.

Rate this question:
29.

Optimal algoritam zamene stranica sa virtuelnom memorijom ima
- Srednje performanse
- Najgore persormanse
- Jako slabe performanse
- Najbolje performanse
Correct Answer

A. Najbolje performanse

Explanation

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:
30.

FIFO algoritam zamene stranica u sistemu sa virtuelnom memorijom je:
- Jako složen za realizaciju
- Nije ga moguće realizovati
- Jednostavan za realizaciju
- Nemoguc za realizaciju
Correct Answer

A. Jednostavan za realizaciju

Explanation

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:
31.

Virtuelna memorija može imati veliki uticaj na nači programiranja:
- Samo ako fizička memorija po procesu nije ograničena
- samo ako je fizička memorija po procesu ograničena
- Zavisi od OS
Correct Answer

A. samo ako je fizička memorija po procesu ograničena
32.

Struktura clusters predstavlja koju alokaciju:i Koju alokaciju vidite na ovoj slici:
- Kontinualna alokacija
- Nepoznata
- Linkovana alokacija (modifikovana linkovana alokacija)
- Indeksna alokacija
Correct Answer

A. Linkovana alokacija (modifikovana linkovana alokacija)

Explanation

The correct answer is "Linkovana alokacija (modifikovana linkovana alokacija)" because the image shows a structure where each element is connected to the next element through links. This type of allocation is commonly used in linked lists, where each node contains a reference to the next node in the list. The term "modifikovana linkovana alokacija" suggests that there might be some modifications or variations in the implementation of the linked allocation.

Rate this question:
33.

Kako se zove struktura na slici?
- Directory
- FCB
- Partion Table
- FS
- MBR
Correct Answer

A. Directory

Explanation

The correct answer is "Directory." A directory is a structure that organizes files and subdirectories into a hierarchical structure. It is used in file systems to keep track of the location and metadata of files. In the given question, the structure depicted in the image is likely a directory, which is why "Directory" is the correct answer.

Rate this question:
34.

Šta je ovo?
- Fajl operacije. Sve su prirodne osim dve veštačke:Open i close
- Fajl operacije. Sve su prirodne osim dve veštačke:Open i Truncate
- Fajl operacije. Sve su prirodne osim dve veštačke:Open i Read
- Ne znam
Correct Answer

A. Fajl operacije. Sve su prirodne osim dve veštačke:Open i close

Explanation

The correct answer is "Fajl operacije. Sve su prirodne osim dve veštačke: Open i close." This answer states that the file operations are all natural except for two artificial ones: Open and close.

Rate this question:
35.

Šta je PIO?
- Programiran ulaz izlaz kada proces mora sam da obavlja transfer podataka
- Neprogramiran ulaz izlaz
- Kontrola poslova
- Proces input ouput
Correct Answer

A. Programiran ulaz izlaz kada proces mora sam da obavlja transfer podataka

Explanation

The correct answer is "Programiran ulaz izlaz kada proces mora sam da obavlja transfer podataka." This answer suggests that PIO (Programmed Input Output) refers to a process where the transfer of data is handled by the program itself. This means that the program controls the input and output operations and is responsible for transferring the data.

Rate this question:
36.

Šta vidite na ovoj slici?
- Second Chance algoritam koji aproksimira FIFO algoritam
- Second Chance algoritam koji aproksimira LRU algoritma
- Second Chance algoritam koji aproksimira optimal algoritam
- Second Chance algoritam koji aproksimira Round Robin algoritam
Correct Answer

A. Second Chance algoritam koji aproksimira LRU algoritma

Explanation

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:
37.

Optimal algoritam zamene stranica u sistemu sa virtuelnom memorijom ima ::f
- Jako slabe performanse
- Srednje performanse
- Najbolje performanse
- Dobre performanse
Correct Answer

A. Najbolje performanse

Explanation

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:
38.

Za sisteme sa virtuelnom memorijom, sa DP (Demand Paging) tehnikom, rešavanje problema sa PF (page fault) obavlja:
- programmer
- Operativni sistem
- Sam hardver
- Ne znam
Correct Answer

A. Operativni sistem

Explanation

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:
39.

Šta vidite na ovoj slici?
- Reparse points
- Symbolic links
- Mount points
- Junction points
- Hard links
Correct Answer

A. Hard links

Explanation

The correct answer is "Hard links." Hard links are a feature in the file system that allows multiple file names to be associated with the same file data. This means that multiple hard links can point to the same file, and deleting one hard link does not affect the other hard links or the file data itself. Hard links are commonly used to create backups or to create multiple access points to the same file.

Rate this question:
40.

Kvalitetne funkcijeza IO, kao što su, buffering, spooling, caching nalaze se:
- Samo u višem delu kernela
- Kombinovano
- Samo u nižem delu kernela
- Nalaze se van kernlea
Correct Answer

A. Samo u višem delu kernela

Explanation

The correct answer is "Samo u višem delu kernela" which translates to "Only in the higher part of the kernel". This suggests that high-quality IO functions such as buffering, spooling, and caching are present only in the higher part of the kernel. This implies that these functions are not available in the lower part of the kernel or outside the kernel.

Rate this question:
41.

Virtuelna memorija za memorijski mapirane datoteke:
- Ima nepredvidiv uticaj na brzinu rada sa datotekama
- Osetno usporava rad sa datotekama
- Ubrzava rad sa datotekama
- Delimično usporava rad sa datotekama
Correct Answer

A. Ubrzava rad sa datotekama

Explanation

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:
42.

Za sistem sa virtuelnom memorijom sa DP tehnikom, vremena izvršavanja instukcije kada napravi PF i kada ne napravi PF su:
- Ne mnogo različita
- Ista
- Veoma različita
- Ne znam
Correct Answer

A. Veoma različita

Explanation

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:
43.

Virtuelna memorija može imati veliki uticaj na način programiranja
- Samo u slučaju ograničene dodele okvira fizičke memorije
- Uvek
- Samo u slučaju ograničene dodele okvira virtuelne memorije
- Nema uticaja
Correct Answer

A. Samo u slučaju ograničene dodele okvira fizičke memorije

Explanation

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:
44.

Na slici je prikazano?-Ko je kriv za ovu pojavu?
- Long-term scheduler
- Page-fault routine
- Dispatcher
- Medium term scheduler
Correct Answer

A. Medium term scheduler

Explanation

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:
45.

Do zamene stranica u sistemu sa virtuelnom memorijom dolazi zbog
- Veličine keš memorije
- Veličine virtuelne memorije
- Veličine fizičke memorije
- Veličine ram memorije
Correct Answer

A. Veličine fizičke memorije

Explanation

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:
46.

Šta vidite na ovoj slici. Ova procedura je
- izvodljiva ali destruktivna, sasvim pravilna
- Izvodljiva ali ne-destruktivna, sasvim pravilna
- Izvodljiva ali destruktivna, ne sasvim pravilna
- Izvodljiva, ne-destruktivna, ne sasvim pravilna
Correct Answer

A. Izvodljiva, ne-destruktivna, ne sasvim pravilna

Explanation

The procedure shown in the image is feasible, meaning it can be done. However, it is non-destructive, which means it does not cause any damage or harm. However, it is not entirely correct or accurate, as there may be some errors or inaccuracies involved.

Rate this question:

2
47.

Which one do you like?
- Prevodioce i editore teksta
- Email servere
- Web servere
- Database server
Correct Answer

A. Database server

Explanation

The correct answer is "Database server" because it is the only option that is related to managing and storing data. A database server is responsible for storing, managing, and retrieving data, making it an essential component in many applications and systems. The other options, such as "Prevodioce i editore teksta," "Email servere," and "Web servere," are not directly related to data storage and management.

Rate this question:
48.

Tipična primena ove alokacije je kod sledećih FS
- FAT
- NUMA
- FCB
- PCB
Correct Answer

A. FAT

Explanation

The correct answer is FAT. FAT (File Allocation Table) is a file system commonly used in older versions of Windows operating systems. It is a simple and straightforward file system that uses a table to keep track of the allocation status of each cluster on a storage device. This allocation method is particularly suitable for devices with limited storage capacity or slower access times. It allows for efficient storage and retrieval of files, making it a typical choice for various file systems.

Rate this question:
49.

Šta vidite na ovoj slici
- Učestvuju DMA I PIC. IO ciklus' prekid odvijanje
- Učestvuju DMA I PCF.
- Učestvuju DMA I PCB.
- Učestvuju MDA I PCB.
Correct Answer

A. Učestvuju DMA I PIC. IO ciklus' prekid odvijanje