Operativni SiSTEMi(Os1) -prvi Kolokvijum Viser

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
N
Nikola
Community Contributor
Quizzes Created: 3 | Total Attempts: 4,119
| Attempts: 1,751 | Pitanja: 197
Please wait...

Question 1 / 197
0 %
0/100
Score 0/100
1. Kako se štiti CPU u računarskim sistemima? Koji je hardverski uređaj najpogodniji za CPU zaštitu:

Explanation

A timer is a hardware device that can be used to protect the CPU in computer systems. It helps in managing and controlling the execution time of different processes and tasks. By setting timers, the CPU can allocate specific time slots for each task, preventing any single task from monopolizing the CPU's resources for an extended period. This ensures fair and efficient utilization of the CPU and enhances system performance. Additionally, timers can also be used for scheduling and synchronization purposes, making them a suitable hardware device for CPU protection.

Submit
Please wait...
About This Quiz
Operativni Sistemi(Os1) -prvi Kolokvijum Viser - Quiz

2. Model na slici je:

Explanation

The model in the picture represents a relationship where many entities from one side can be associated with one entity on the other side. This can be inferred from the fact that there are multiple arrows pointing from the "many" side towards the "one" side. Therefore, the correct answer is "Many to one".

Submit
3. Šta vidite na ovoj slici:

Explanation

The correct answer is "Multiprograming". Multiprogramming is a technique used in operating systems where multiple programs are loaded into the memory and executed concurrently. This allows for efficient utilization of the CPU and resources, as the operating system switches between different programs. In this context, the other options mentioned (Real-time OS, PIC ciklus, Time-sharing OS, DMA ciklus) are not directly related to the concept of multiprogramming.

Submit
4. Imate MMU sa relokacionim registrom. Generisana logička adresa iznosi 150, a vrednost relokacionog registra za proces je 10000. Izračunati fizičku adresu

Explanation

The logical address is calculated by adding the value of the relocation register (10000) to the generated logical address (150). Therefore, the physical address is 10150.

Submit
5. Analizirati straničenje. Imate veličinu stranice od 8K(8192 bajta). Kolika je minimalna interna fregmentacija za ovaj slučaj.

Explanation

The question asks for the minimum internal fragmentation for a page size of 8K (8192 bytes). Internal fragmentation refers to the wasted space within a page due to the allocation of memory in larger chunks than necessary. In this case, since the page size is 8K and there is no mention of any allocation or fragmentation, it can be inferred that there is no internal fragmentation, hence the answer is 0 bytes.

Submit
6. Imate MMU sa relokacionim registrom. Generisana logička adresa iznosi 100, a vrednost relokacionog registra za proces je 8000. Izračunati fizičku adresu

Explanation

The correct answer is 8100. The physical address is obtained by adding the logical address (100) to the value of the relocation register (8000). Therefore, 100 + 8000 = 8100.

Submit
7. U osnovnoj dijagramu stanja procesa, sa slike učestvuju neki od rasporedjivača. To su:

Explanation

In the given question, the correct answer is "Short term scheduler". The short term scheduler is responsible for selecting which processes from the ready queue will be executed next by the CPU. It is also known as the CPU scheduler. The long term scheduler is responsible for selecting which processes will be admitted to the system and brought into the ready queue. The medium term scheduler is responsible for swapping processes in and out of main memory. Therefore, the short term scheduler is the only option that fits the description of participating in the state diagram of the process.

Submit
8. U situaciji na slici štiti se jedan resurs, a to je:

Explanation

The correct answer is Ram memorija. In the given situation, only one resource is being protected, and that is the RAM memory. The other options such as hard disk, network card, input-output system, and CPU are not mentioned in the context of the question. Therefore, the RAM memory is the most logical choice for the protected resource in this scenario.

Submit
9. Koju arhitekturu vidite na ovoj slici?

Explanation

*##*Slojevitu-tacan odgovor*##*Netacan odgovor

Submit
10. U multithread modelu procesa, programski kod je:

Explanation

In a multithreaded model of a process, the program code is shared among all the threads. This means that all the threads within the process can access and execute the same code. Therefore, the program code is "Zajednički-deljiv za sve niti" or "shared among all the threads".

Submit
11. U strukturnoj šemi OS-a, najkvalitetniji i fundamentalni deo naziva se:

Explanation

The kernel is the most important and fundamental part of an operating system's structure. It is responsible for managing the system's resources, such as memory, processes, and input/output devices. The kernel acts as a bridge between the hardware and software components of the system, providing essential services and functions for the operating system to run smoothly. It is often referred to as the heart of the operating system.

Submit
12. Arhitektura prikazana na slici je idealna za razvoj ili učenje:

Explanation

The architecture shown in the picture is ideal for the development or learning of operating systems. This is because operating systems require a specific architecture that can manage and control hardware resources efficiently, handle multiple processes, and provide a stable and secure environment for running applications. The architecture depicted in the picture likely includes components such as a kernel, device drivers, memory management, process scheduling, and inter-process communication mechanisms, which are essential for building an operating system.

Submit
13. Analizirati straničenje. Imate veličinu stranice od 2k(2048 bajta). Kolika je maksimalna interna fragmentacija za ovaj slučaj

Explanation

The maximum internal fragmentation in this case is 2047. This is because the page size is 2048 bytes, and the internal fragmentation refers to the unused space within a page. Since the page size is 2048 bytes, there can be at most 1 byte of unused space within each page. Therefore, the maximum internal fragmentation is 2047 bytes.

Submit
14. U situaciji na slici, ako učestvuje kernelski proces dispečer njegov posao je da:

Explanation

In the given situation, if the kernel dispatcher is involved, its job is to safely stop P0 and safely start P1.

Submit
15. Koju arhitekturu vidite na slici:

Explanation

The architecture depicted in the picture is a layered architecture. In a layered architecture, the system is divided into multiple layers, where each layer performs a specific set of functions. These layers are organized hierarchically, with each layer relying on the layer below it. This architectural style promotes separation of concerns and modularity, making the system easier to understand, maintain, and modify.

Submit
16. Model na slici je:

Explanation

The correct answer is "Moderan kernel, moderna aplikacija." This is because the question is asking about the model in the picture, and based on the given options, the most suitable answer is that the model consists of a modern kernel and a modern application.

Submit
17. Koji je najbolji prijatelj CPU i racunarskog sistema

Explanation

The timer is the best friend of the CPU and computer system because it helps in synchronizing and coordinating various tasks and processes. It ensures that different components of the system work together efficiently and at the right time. The timer is responsible for keeping track of time intervals, scheduling tasks, and generating interrupts when necessary. This allows the CPU to allocate resources effectively, manage multitasking, and maintain system stability. Without a timer, the CPU and computer system would struggle to perform tasks in a timely and organized manner.

Submit
18. Kojem OS najvise odgovara ova slika:

Explanation

The given answer, MS Windows (NT based), is the most suitable operating system for the provided image. This suggests that the image is likely depicting a graphical user interface (GUI) that is specific to the MS Windows operating system. The other options, Novell Netware, Sun Solaris, and DOS-UNIX, are not mentioned in relation to the image, indicating that they are not relevant in this context.

Submit
19. U multithread modelu procesa, globalni podaci su:

Explanation

In the multithread model of a process, global data is shared and accessible by all threads. This means that any thread within the process can read from or write to the global data. The global data is not unique or specific to any individual thread, but rather it is shared among all threads.

Submit
20. U otkrivanju pojave deadlocka je vrlo pouzdana i jednostavna

Explanation

The explanation for the given answer is that the detection of a deadlock is very reliable and simple only if the resources involved in the system contain only one instance each. If there are multiple instances of the resources, the detection becomes more complex and less reliable.

Submit
21. Analizirati straničenje. imate veličinu stranice od 1k(1024 bajta). KOlika je maksimalna interna fragmentacija za ovaj slučaj?

Explanation

The maximum internal fragmentation in this case is 1023 bytes. Internal fragmentation occurs when the allocated memory block is larger than the actual data that needs to be stored. In this scenario, if the page size is 1024 bytes and the allocated memory block is only 1 byte, there will be 1023 bytes of unused space within the page. This unused space is known as internal fragmentation.

Submit
22. Cemu služi struktura sa slike

Explanation

The given correct answer states that the purpose of the structure in the image is for modeling systems in order to test for deadlocks. This suggests that the structure is designed to simulate and analyze potential deadlocks that may occur in a system. It implies that the structure helps in identifying and resolving issues related to deadlocks in order to improve the system's performance and reliability.

Submit
23. U situaciji na slici štiti se jedan hardverski resurs: To je:

Explanation

The correct answer is Ram memorija. In the given situation, only one hardware resource is being protected, and that is the RAM memory. The other options, such as the network card, CPU, input/output system, and hard disk, are not mentioned in the context of protection. Therefore, the RAM memory is the most suitable answer.

Submit
24. U modelu na slici, kada neka od korisničkih niti predje u stanje waiting:

Explanation

In the given model, when one of the user threads enters the waiting state, all other user threads continue their activities normally. This means that the waiting state of one thread does not affect the activities of other threads in the group.

Submit
25. U situaciji sa slike štiti se jedan resurs. To je:

Explanation

In the given situation, the resource that is being protected is the RAM memory. RAM (Random Access Memory) is a type of computer memory that is used to store data that is currently being used by the computer's operating system, software programs, and data files. It is a volatile memory, meaning that its contents are lost when the computer is powered off or restarted. Protecting the RAM memory ensures that the data stored in it is not corrupted or accessed by unauthorized users.

Submit
26. Šta vidite na ovoj slici?

Explanation

The correct answer is "Multiprograming." Multiprogramming is a technique used in operating systems where multiple programs are loaded into memory and executed concurrently. This allows for better utilization of system resources and increased efficiency. In this context, the picture may be depicting the concept of multiprogramming, where multiple programs are running simultaneously.

Submit
27. OS je po pitanju alokacija i upravljanja računarskim resursima:

Explanation

The correct answer is "Istovremeno i resource allocator i resource manager." This means that the operating system is both a resource allocator and a resource manager. This suggests that the operating system is responsible for allocating and managing computer resources, such as memory, CPU time, and input/output devices. It performs the task of allocating these resources to different processes and manages their usage to ensure efficient and fair utilization.

Submit
28. Analizirati segmentaciju. Imate veličinu stranice od 1350 bajtova. KOliko je minimalna interna fragmentacija za ovaj slučaj?(odgovor u bajtovima)

Explanation

The minimum internal fragmentation in this case is 0 bytes. This means that there is no wasted space within the page, as the size of the page (1350 bytes) perfectly matches the size of the segment being allocated. Therefore, there is no need for any additional bytes to be allocated or wasted.

Submit
29. Koji operativni sistem je prikazan na slici:

Explanation

The correct answer is "Dos" because it is the only operating system mentioned in the given options.

Submit
30. Koju arhitekturu vidite na slici?

Explanation

The correct answer is client-server. This architecture is characterized by a central server that manages resources and responds to client requests. In this model, clients send requests to the server, which processes them and sends back the corresponding responses. This architecture is commonly used in networked systems where multiple clients need access to shared resources or services provided by the server.

Submit
31. Koju arhitekturu vidite na slici?

Explanation

The correct answer is Cluster. A cluster is a type of computer architecture where multiple computers are connected and work together as a single system. In a cluster, each computer, called a node, performs specific tasks and shares resources, such as storage and processing power, to improve performance and reliability. This architecture is commonly used in high-performance computing and data-intensive applications where scalability and fault tolerance are crucial.

Submit
32. U user modu, proces koristi:

Explanation

The correct answer is "Samo dva resursa: cpu i ram". This means that the process uses only two resources: the CPU (central processing unit) and RAM (random access memory). It does not utilize any other system resources such as files or any additional hardware components.

Submit
33. Koja odobrava svaki zahtev, a obavlja proracun u kom stanju su procesi naziva se:

Explanation

The Banker algorithm is the correct answer because it is the only algorithm mentioned that approves every request and performs a calculation based on the state of the processes. The Ostrich algorithm does not approve every request, the Deadlock detection algorithm only detects deadlocks without approving requests, and the Deadlock prevention algorithm prevents deadlocks but does not perform calculations based on process states.

Submit
34. U situaciji na slici u jednoj grani se sigurno dogodila preemption. To je :

Explanation

In the given situation, the correct answer is the second branch (time slice expired). This is because preemption occurs when a process's time slice expires, meaning that it has used up its allocated time for execution and must be interrupted to allow another process to run. This interruption is a form of preemption, where the currently running process is preempted or temporarily halted to give way to another process. The second branch represents this scenario, making it the correct answer.

Submit
35. U arhitekturu koju vidite na ovoj slici:

Explanation

The correct answer is that layer M can only request services from layers below it (M-1). This means that layer M is dependent on the services provided by the layers beneath it and cannot request services from layers above it or from its own layer.

Submit
36. U otkrivanju pojave deadlocka je vrlo pouzdana i jednostavna

Explanation

The answer suggests that the detection of deadlock is very reliable and simple only if the resources contain only one instance. This means that if there are multiple instances of resources, the detection of deadlock may not be as reliable or simple.

Submit
37. Na slici su prikazana 2 mehanizma

Explanation

The correct answer is that the left mechanism is an indirect IPC, while the right mechanism is a direct IPC. This can be deduced from the given options, where it is stated that the left mechanism is an indirect IPC and the right mechanism is a direct IPC.

Submit
38. Sema koja u odnosu na ovu sliku, koja na svaki zahtev prvo obavi proračun, a tek onda odobrava i privremeno odbija zahtev naziva se

Explanation

The correct answer is Banker algorithm. The Banker algorithm is used to prevent deadlock in a system by dynamically allocating resources to processes. It works by keeping track of the available resources, the maximum resources each process can request, and the resources currently allocated to each process. Before granting a request, the algorithm checks if it will leave the system in a safe state, meaning that there will always be a way to satisfy the remaining processes' resource requests. If the request would lead to an unsafe state, it is denied. This algorithm helps in avoiding deadlock situations by carefully managing resource allocation.

Submit
39. U situaciji na slici učestvuju ili ne sledeće hardverske komponente:

Explanation

Based on the given options, the correct answer is "DMA učestvuje, PIC učestvuje" which translates to "DMA participates, PIC participates" in English. This implies that both DMA (Direct Memory Access) and PIC (Programmable Interrupt Controller) are involved in the situation depicted in the image.

Submit
40. Struktura na slici uglavnom služi:

Explanation

The correct answer suggests that the structure in the picture is mainly used for modeling systems in order to measure deadlocks. This means that the structure depicted in the picture is designed to represent and analyze situations where multiple processes are unable to proceed because each is waiting for the other to release a resource. By using this structure, one can simulate and evaluate the occurrence and impact of deadlocks in a system.

Submit
41. U strukturnoj šemi računarskog sistema, OS je neposredno iznad

Explanation

In the given question, the correct answer is "Hardvera". This means that in the structure of a computer system, the operating system (OS) is directly above the hardware. The hardware refers to the physical components of the computer system such as the processor, memory, storage devices, and input/output devices. The operating system interacts with the hardware to manage and control its resources, allowing the software (system software, application software, and network layer) to run efficiently on the computer system.

Submit
42. Identifikujte short term scheduler algoritam, pa ga ocenite po pitanju preemption

Explanation

The given answer is "Preemptive." This means that the short term scheduler algorithm can interrupt or preempt a running process in order to allocate the CPU to another process. This allows for better responsiveness and priority management in the system. However, without further information, it is not possible to determine the specific algorithm being referred to.

Submit
43. U slučaju ulaska nekih procesa u deadlock, za sistem sa Deadlock detection algoritmom, najbolja metoda je:

Explanation

The best method in case of processes entering a deadlock in a system with a Deadlock detection algorithm is to perform a rollback. Rollback involves reverting the state of the system to a previous checkpoint before the deadlock occurred, allowing the system to recover and continue running without the deadlock. This approach ensures that the system can resolve the deadlock and resume normal operation without the need to terminate or destroy any processes.

Submit
44. Izaberite tacan odgovor

Explanation

The given correct answer states that it is the best way, but not the only way, for a process to obtain any hardware resource. This suggests that there may be other ways for a process to acquire hardware resources, but the option presented is considered the most effective or preferred method.

Submit
45. Objasniti MVT. Koji algoritam za MVT ne mora da analizira postojeće šupljine, prilikom alokacije memorije.

Explanation

The explanation for the correct answer, which is "first-fit," is that the first-fit algorithm does not need to analyze existing holes or gaps in memory during the memory allocation process. It simply allocates the first available block of memory that is large enough to accommodate the requested size. This algorithm is efficient and fast, but it may lead to fragmentation over time as smaller gaps are left between allocated blocks.

Submit
46. Kod TS fundamentalni resurs koji se deli je:

Explanation

CPU time is the correct answer because it refers to the amount of time that the central processing unit (CPU) spends executing a program or task. It is a fundamental resource in programming and computing, as it determines the speed and efficiency of program execution. CPU time is measured in units such as seconds or clock cycles and is crucial for optimizing performance and resource allocation in computer systems.

Submit
47. Postoje 4 uslova vezana za pojavu deadlocka: 1.Mutual Exclusion 2.hold and wait 3.Deadlock prevention algorithm 4.Ostrich algorithm Deadlock ce biti ispunjen

Explanation

The correct answer is "If all four conditions are simultaneously satisfied." This means that for a deadlock to occur, all four conditions (Mutual Exclusion, hold and wait, Deadlock prevention algorithm, and Ostrich algorithm) must be present at the same time. If any of these conditions are not satisfied, a deadlock will not occur.

Submit
48. Sa slike uočite tranziciju waiting-IO or event completion-ready. Da li se u toj tranziciji dogodio preemption:

Explanation

The correct answer is "Sigurno ne". This means "Definitely not" in English. The explanation for this answer is that preemption refers to the act of temporarily interrupting a task to allow other tasks to be executed. In this case, the answer "Definitely not" suggests that preemption did not occur during the transition from waiting-IO or event completion to ready.

Submit
49. Koji je ovo short term scheduler algoritam. Odrediti TQ

Explanation

The given sequence of numbers represents the burst times of different processes. The short term scheduler algorithm is not specified in the question. However, based on the given numbers, it can be observed that the smallest burst time is 17. Therefore, the time quantum (TQ) can be determined as 17.

Submit
50. Tranziciju na koju ukazuje crvena strelica izaziva

Explanation

The correct answer is "Proces roditelji". The red arrow indicates a transition caused by the process of parents.

Submit
51. Kojem operativnom sistemu najvise odgovara ova slika?

Explanation

This image is most suitable for Unix/Linux operating system because Unix/Linux is known for its stability, security, and flexibility, making it a popular choice for servers and high-performance computing. Additionally, Unix/Linux is often used in development and programming environments, which is represented by the image's coding symbols.

Submit
52. Potpunu CPU izolaciju u odnosu na i/o akcije omogucavaju dva hardverska uredjaja. To su:

Explanation

The correct answer is MDA I PIC. MDA stands for Memory Direct Access, which allows the CPU to directly access memory without going through the CPU. PIC stands for Programmable Interrupt Controller, which manages and prioritizes interrupt requests from various devices. Both MDA and PIC contribute to the complete isolation of the CPU from I/O actions. MDA allows direct memory access, reducing the CPU's involvement in I/O operations, while PIC manages interrupts, ensuring that the CPU is not interrupted unnecessarily during I/O actions.

Submit
53. Najtipicniji predstavnik TS(timesharing systems) je:

Explanation

UNIX/LINUX is the most typical representative of timesharing systems (TS) because TS allows multiple users to share the resources of a single computer simultaneously. UNIX/LINUX is a multi-user, multitasking operating system that provides the necessary features and functionality for efficient timesharing. It allows multiple users to access the system, run programs, and perform tasks concurrently, making it an ideal choice for timesharing environments. MS Windows, DOS, Cloud computing, and Chrome are not specifically designed as timesharing systems, making UNIX/LINUX the correct answer.

Submit
54. Prethodni algoritam(nepoznato ime) koliko procesa može da opslužuje

Explanation

The given answer suggests that the previous algorithm can serve N processes.

Submit
55. Čiji je ovo many-to-many model

Explanation

Sun Solaris je operativni sistem koji je razvio Sun Microsystems (sada deo Oracle korporacije). Ovaj operativni sistem koristi many-to-many model, što znači da omogućava više korisnika da pristupe i koriste resurse sistema istovremeno. Ovo je suprotno od one-to-one ili one-to-many modela, gde samo jedan korisnik može pristupiti resursima ili jedan korisnik može pristupiti više resursa.

Submit
56. Analizirati segmentaciju. Imate segment od 1350 bajtova. Kolika je maksimalna interna fragmentacija za ovaj slučaj.

Explanation

The maximum internal fragmentation for this case is 1349. This means that out of the total segment size of 1350 bytes, only 1 byte will be wasted due to internal fragmentation.

Submit
57. Šta je prikazano na slici

Explanation

The correct answer is Linked Lists. A linked list is a data structure that consists of a sequence of nodes, where each node contains a reference to the next node in the sequence. It is used to store and manipulate collections of data. In this context, the image is likely depicting a visual representation or illustration of linked lists.

Submit
58. Kojem OS najviše odgovara ova slika:

Explanation

This image most likely represents a screenshot or a reference to the MS-DOS operating system. MS-DOS, which stands for Microsoft Disk Operating System, was a popular operating system in the 1980s and early 1990s. It was primarily used on personal computers and was known for its command-line interface. The image may be suggesting that the operating system depicted in the image is MS-DOS.

Submit
59. Koju arhitekturu vidite na ovoj slici?

Explanation

The architecture seen in the picture is Parallel(NUMA) architecture.

Submit
60. U situaciji na slici, tranziciju na koju ukazuje crvena strelica izaziva:

Explanation

The correct answer is "Samo proces." In the given situation, the red arrow indicates a transition that is caused by the process itself. This means that the process is responsible for initiating the change or transition shown in the picture.

Submit
61. Ne dozvoljava da sistem predje safe, unsafe liniju, naziva se

Explanation

The correct answer is Banker algorithm. The Banker algorithm is used to prevent deadlocks in a system. It ensures that resources are allocated in a safe manner by keeping track of the available resources, the maximum resources each process can request, and the resources currently allocated to each process. By using a series of checks and calculations, the Banker algorithm determines if granting a resource request will lead to a safe state or a potential deadlock. If a request will result in a safe state, the resource is allocated; otherwise, the process is made to wait.

Submit
62. Na slici vidite veoma bitnu strukturu OS. To je?

Explanation

The correct answer is PCB. The image shows a printed circuit board (PCB), which is a crucial component of an operating system (OS). PCBs are used to mechanically support and electrically connect electronic components using conductive pathways, tracks, or traces etched from copper sheets laminated onto a non-conductive substrate. They provide a platform for the various hardware components of an OS to communicate and work together efficiently.

Submit
63. Na osnovu dijagrama stanja procesa, sa slike uočite tranziciju running i-o ewent wait-waiting. Da li se u toj tranziciji dogodio premtion?

Explanation

Based on the given question and answer options, it can be inferred that the correct answer is "Sigurno ne" which translates to "Definitely not" in English. The question asks whether preemption occurred during the transition from "running" to "waiting" in the process state diagram. The correct answer states that preemption did not occur.

Submit
64. Na Intel procesorima, IA-32 arhitektura, primenjena je sledeća memorijska šema:

Explanation

The correct answer is "segmentacija+straničenje u dva nivoa" because in IA-32 architecture, Intel processors implement a memory management scheme that combines both segmentation and paging in two levels. This means that the memory is divided into segments, and within each segment, it is further divided into pages. This allows for more efficient memory management and address translation.

Submit
65. U osnovnom dijagramu stanja procesa, sa slike, proces poseduje ili ne poseduje neke resurse. KOnkretno u stanju ready, proces ima sve osim:

Explanation

In the given question, the correct answer is "CPU". This means that in the ready state, the process has all the resources except for the CPU. This implies that the process is waiting for the CPU to be available in order to execute its tasks.

Submit
66. Analizirati straničenje. Slika sadrži pored straničenja i jednu strukturu koja se nalazi u samom CPU, i koja služi za poboljšanje performansi koje drastično padaju uvođenjem straničenja. Ta strukutra je u osnovi:

Explanation

The structure mentioned in the question serves to improve performance, which drastically decreases with the introduction of paging. Associative memory is a type of computer memory that enables fast searching and retrieval of information. It allows the CPU to quickly access data that is frequently used, reducing the time required for memory operations and improving overall performance.

Submit
67. Na ovoj slici se vidi prelazak iz:

Explanation

The correct answer is "User mod u kernel mod pod dejstom prekida i proces nije svestan te situacije". This is because the image represents a transition from user mode to kernel mode under the influence of an interrupt, and the process is unaware of this situation.

Submit
68. I/O se u računarskim sistemima obično štite preko

Explanation

The correct answer is "Privilegovanih I/O instrukcija". This is because privileged I/O instructions are used to protect I/O in computer systems. These instructions can only be executed by privileged users or processes, providing an additional layer of security. By restricting access to privileged I/O instructions, the system can prevent unauthorized users or processes from performing potentially harmful or disruptive operations on input/output devices.

Submit
69. 3 procesa izvrsavaju isti editor teksta koji je velicine 20k. Za privatne data podatke potrebno je 3k. Odrediti koliko je memorije potrebno za MVT. Izabrati broj u kb

Explanation

Each process requires 3k of private data, and there are 3 processes in total. Therefore, the total memory needed for private data is 3 * 3k = 9k. In addition to the private data, each process also uses the same text editor, which is 20k in size. So the total memory needed for the text editor is 3 * 20k = 60k. Adding the memory needed for private data and the text editor, we get 9k + 60k = 69k. Therefore, the correct answer is 69.

Submit
70. Slika predstavlja:

Explanation

The given answer, Dynamic Loading, is the most appropriate choice because the image represents the concept of dynamic loading. Dynamic loading is a technique in which a program loads a library or module into memory only when it is needed, rather than loading it at the start of the program. This allows for efficient memory usage and faster program execution. The image may depict a program loading a module or library dynamically, indicating the concept of dynamic loading.

Submit
71. Na slici je prikazano resenje problema Bounded Buffer Deljeni podaci: struct buffer #all in structure is shader { int pool[in]; int count,in,out; } Producer region buffer when(count

Explanation

The correct answer is "Pool[n],count in,out". The given options are related to the shared data structure "buffer" in the Bounded Buffer problem. "Pool[n]" represents the array of elements in the buffer, "count" represents the number of elements currently in the buffer, "in" represents the index where the next element will be inserted, and "out" represents the index from where the next element will be removed. These variables are essential for managing the buffer and ensuring proper synchronization between the producer and consumer processes.

Submit
72. Koji je ovo algoritam, po pitanju klase?(Bakery algoritam)

Explanation

The correct answer is "Čisto softversko rešenje" which translates to "Pure software solution". This suggests that the algorithm mentioned (Bakery algorithm) is implemented solely through software, without the need for any additional hardware or external devices. It implies that the algorithm can be executed and run on a computer or any other software platform without any physical dependencies.

Submit
73. Identifikujte koji je ovo short term scheduler algoritam, pa ga ocenite po pitanju performansi (Zakucavanje 1, jeste preemptive)

Explanation

This question is asking to identify and evaluate a short term scheduler algorithm based on its performance. The given answer "5 odlican" suggests that the algorithm is excellent in terms of performance.

Submit
74. Objasnite MVT. Koji algoritam za mvt ima najbrže pretraživanje u pogledu šupljine izbora

Explanation

First fit is an algorithm used in memory management that allocates the first available block of memory that is large enough to accommodate a process. It starts searching from the beginning of the memory and selects the first block that meets the size requirement. This algorithm has a relatively fast search time compared to best fit and worst fit algorithms because it does not need to search through the entire memory space. Therefore, in terms of hole selection, First fit has the fastest search time among the given options.

Submit
75. Analizirati straničenje. Za poboljšanje performansi koje drastično padaju uvođenjem straničenja, koristi se TLB keš memorija. Osnova za TLB je:

Explanation

The basis for the TLB (Translation Lookaside Buffer) is an associative memory. Associative memory allows for faster access to data by searching for a match in parallel rather than sequentially. In the context of TLB, it is used to store the virtual to physical address mappings, allowing for quicker translation of virtual addresses to physical addresses. This helps improve performance by reducing the time it takes to access memory, especially when there is a high rate of page faults and page swapping occurring due to paging.

Submit
76. Zahteva od procesa da se izjasne na samom pocetku koriscenja svih tj maksimalnih resursa naziva se

Explanation

The Banker algorithm is a resource allocation and deadlock avoidance algorithm. It requires processes to declare their maximum resource needs at the beginning of their execution. This allows the system to determine if granting the requested resources will result in a deadlock. If the resources can be allocated without causing a deadlock, they are granted; otherwise, the process is made to wait. This algorithm helps in preventing deadlocks by ensuring that resources are allocated in a safe manner.

Submit
77. Na slici je prikazana deljivost:

Explanation

The image represents the divisibility of segments.

Submit
78. Kod Deker Pitersona, u kojoj liniji koda mu je exit section:

Explanation

The exit section in the code of Kod Deker Pitersona is located in Linija 8.

Submit
79. Koliko procesa pekarski algoritam(Bakery) može da opslužuje?

Explanation

The Bakery algorithm can serve any number of processes (n) as it is a mutual exclusion algorithm that guarantees that no two processes can be in their critical section at the same time. It uses a ticket system to determine the order in which processes can enter the critical section, ensuring fairness and preventing starvation. Therefore, the algorithm can handle any number of processes effectively.

Submit
80. Objasniti dinamičko punjenje? Ko je glavni i odgovorni za dinamičko punjenje.

Explanation

Dinamičko punjenje se odnosi na postupak u kojem se memorija ili resursi alociraju i oslobađaju tokom izvršavanja programa. Programer je glavni i odgovorni za dinamičko punjenje jer on određuje kada i kako će se resursi alocirati i osloboditi u programu. Programer može koristiti odgovarajuće funkcije ili metode za dinamičko alociranje memorije ili resursa, kao što su malloc() ili new() u jezicima poput C ili C++, kako bi efikasno upravljao memorijom i resursima tokom izvršavanja programa.

Submit
81. Koju arhitekturu vidite na ovoj slici?

Explanation

not-available-via-ai

Submit
82. Identifikujte koji je ovo short term scheduler algoritam, pa ga ocenite po pitanju preemption

Explanation

This question is asking to identify the short-term scheduler algorithm and evaluate it based on preemption. The given answer is "Preemptive." Preemptive scheduling means that the scheduler can interrupt a running process and allocate the CPU to another process. Therefore, the identified short-term scheduler algorithm allows for preemption, meaning it can interrupt the execution of a process if necessary.

Submit
83. Na slici je prikazana deljivost:

Explanation

The image is showing the concept of divisibility in terms of pages. It is indicating that the segments, bits, bytes, and 32-bit words can be divided into pages.

Submit
84. Sledeća slika predstavlja:

Explanation

The given image represents buddy systems. Buddy systems is a memory allocation technique in which memory is divided into fixed-size blocks and allocated to processes based on their memory requirements. Each block is a power of two in size, and blocks of the same size are grouped together to form "buddies". When a process requests memory, the system finds the smallest buddy that can satisfy the request and splits it into two equal-sized buddies. This allocation technique helps in reducing fragmentation and efficiently managing memory allocation.

Submit
85. Analizirati straničenje, Imate veličinu stranice od 1k(1024 bajta). Ako povećate veličinu stranice, šta se dešava sa tabelom stranica

Explanation

Kada se poveća veličina stranice, tabela stranica se smanjuje. To se događa zato što veća veličina stranice omogućava smeštanje više podataka u jednu stranicu, što znači da će biti manje stranica potrebno za čuvanje podataka. Kada se tabela stranica smanji, smanjuje se i broj unosa u tabeli, što rezultira manjim zahtevima za memorijom za čuvanje same tabele stranica.

Submit
86. Kojem operativnom sistemu najvise odgovara ova slika?

Explanation

The given image is most suitable for the MS Windows (NT based) operating system. This is because MS Windows (NT based) is a widely used operating system that is known for its user-friendly interface and compatibility with various software applications. Additionally, the image may depict the Windows logo or any other visual element associated with MS Windows, further indicating its compatibility with this operating system.

Submit
87. Analizirati straničenje. Šta se dešava sa performansama uvođenjem straničenja?

Explanation

The correct answer is "Smanjuju se 100%". When paging is introduced, the performance decreases because the system needs to constantly access the disk to load and unload pages from memory. This process of disk I/O slows down the overall performance of the system. Therefore, the performance is reduced by 100% when paging is implemented.

Submit
88. Na ovoj slici vidi se:

Explanation

not-available-via-ai

Submit
89. Na ovoj slici se može videti:

Explanation

not-available-via-ai

Submit
90. Deker Piterson algoritam je:(kakvo resenje)

Explanation

The correct answer is "Čisto softverko rešenje" which translates to "Pure software solution" in English. This suggests that Deker Piterson algorithm is solely implemented using software without any hardware components involved.

Submit
91. 3 procesa izvrsavaju isti editor teksta koji je velicine 20k. Za privatne data podatke potrebno je 3k. Odrediti koliko je memorije potrebno za paging sa velicinom stranice od 2k. Upisati broj u KB

Explanation

The given question states that there are 3 processes running the same text editor, each of size 20k. Additionally, 3k of memory is required for private data. To determine the memory required for paging with a page size of 2k, we need to calculate the total memory required for all processes and private data.

Each process requires 20k of memory, so the total memory required for the processes is 3 * 20k = 60k.
In addition, 3k of memory is required for private data.

To calculate the memory required for paging, we need to round up the total memory required to the nearest multiple of the page size.

The nearest multiple of 2k greater than or equal to 63k (60k + 3k) is 64k.
Therefore, the memory required for paging with a page size of 2k is 64k, which is equivalent to 64 KB.

Hence, the correct answer is 32.

Submit
92. Sistemski poziv predstavlja interfejs između

Explanation

The correct answer is "Procesa i kernela". A system call is an interface between a process and the kernel of an operating system. When a process needs to access a resource or perform a privileged operation, it makes a system call to request the kernel to perform the task on its behalf. The kernel then handles the request and returns the result to the process. Therefore, system calls facilitate communication and interaction between processes and the underlying kernel of an operating system.

Submit
93. Kom algoritmu odgovara ovaj slučaj: I da li mu se moze odobriti zahrev P(0,2,0)

Explanation

The correct answer is "Banker algoritam, ne moze mu se odobriti zahtev" which translates to "Banker's algorithm, the request cannot be granted." The Banker's algorithm is used for deadlock detection and prevention in resource allocation systems. In this case, the algorithm determines that the request P(0,2,0) cannot be granted without causing a deadlock.

Submit
94. Tranzicija na koju ukazuje crvena strelica

Explanation

The given answer suggests that the transition indicated by the red arrow is definitely not preemption.

Submit
95. Diskutujte RT. Iddentifikujte koji je ovo short term scheduler alogirtam, najbolji po pitanju RT

Explanation

The correct answer is RR, which stands for Round Robin. Round Robin is a short term scheduling algorithm that assigns a fixed time slice to each process in the system, allowing them to execute in a circular manner. This algorithm is considered to be the best in terms of Real-Time (RT) scheduling because it ensures fairness and prevents any single process from monopolizing the CPU for an extended period of time. It provides equal opportunity for all processes to execute and is commonly used in time-sharing systems.

Submit
96. Da li Deker Piterson algoritam ima busy waiting?

Explanation

The correct answer is "Uvek ima busy waiting." This means that the Deker Piterson algorithm always involves busy waiting. Busy waiting refers to a situation where a process continuously checks for a condition to be satisfied, without releasing the CPU to other processes. In the case of the Deker Piterson algorithm, busy waiting is used to ensure mutual exclusion between processes. Therefore, it can be concluded that the algorithm always includes busy waiting.

Submit
97. U situaciji na slici, tranziciju na koju ukazuje crvena strelica izaziva:

Explanation

The correct answer is "Nedostatak podataka ili resursa koji se dugo čeka" which translates to "Lack of data or resources that are long awaited." This suggests that the transition indicated by the red arrow is caused by a delay in receiving the necessary data or resources.

Submit
98. Na ovoj slici vidi se prelazak iz:

Explanation

The correct answer is "User mode u kernelski mod pod dejstvom SC i proces je svestan te situacije." This is because the image shows a transition from user mode to kernel mode under the influence of a system call (SC), and the process is aware of this situation.

Submit
99. Koji je ovo algoritam?

Explanation

The correct answer is Bakery algoritam.

Submit
100. Analizirati straničenje. Šta se dešava sa performansama uvođenjem straničenja. Koliko imate memorijskih ciklusa, prilikom jednog ciklusa upisa

Explanation

The given answer suggests that the number of memory cycles during one write cycle is not always the same. This implies that there may be variations in the performance when introducing paging. The introduction of paging involves dividing the memory into fixed-size pages and swapping them in and out of the main memory. Depending on the specific implementation and the size of the pages being swapped, the number of memory cycles required for a write operation may vary.

Submit
101. Za time sharing sisteme, kao što su UNIX i linux, identifikujte short term scheduler alogirtam, koji je najbolji za njih:

Explanation

The best short term scheduler algorithm for time sharing systems like UNIX and Linux is Round Robin (RR). This algorithm is preferred because it ensures fairness by allocating equal time slices to each process in the system. It works by dividing the CPU time into small time intervals called time slices and each process gets to execute for one time slice before being preempted and moved to the back of the queue. This allows for efficient multitasking and prevents any single process from monopolizing the CPU for too long.

Submit
102. Na slici vidite jednu veoma bitnu strukturu OS. Sa tom strukturom najčešće manipuliše jedan kernelski proces. To je:

Explanation

The correct answer is "Dispatcher." The given explanation states that the structure shown in the image is an important structure in the operating system, and it is usually manipulated by a kernel process. The term "Dispatcher" refers to the component responsible for transferring control of the CPU from one process to another. Therefore, it aligns with the information provided in the explanation.

Submit
103. Identifikujte koji je ovo short term scheduler algoritam, pa ga ocenite po pitanju zakucavanja

Explanation

The given correct answer states that the short term scheduler algorithm is "Odličan" (Excellent). This implies that the algorithm is highly efficient and effective in terms of avoiding deadlock situations. It suggests that the algorithm is capable of making optimal decisions in selecting processes for execution, ensuring smooth and uninterrupted operation of the system.

Submit
104. Memorija se u računarskim sistemima obično štiti preko

Explanation

In computer systems, memory is typically protected using base and limit registers. These registers store the starting address (base) and the size (limit) of a memory segment. When a program tries to access memory, the base and limit registers are checked to ensure that the memory access is within the allowed range. This helps to prevent unauthorized access to memory and protects the system from potential security vulnerabilities.

Submit
105. Koji je ovo short term scheduler algoritam

Explanation

The correct answer is RR, which stands for Round Robin. In this scheduling algorithm, each process is assigned a fixed time slice, known as a time quantum. The processes are executed in a circular order, where each process is given a chance to run for the duration of its time quantum. If a process cannot complete within its time quantum, it is moved to the back of the queue and the next process is given a chance to run. This algorithm ensures fairness among processes and prevents starvation.

Submit
106. Online komunikacija sa sistemom

Explanation

Online communication with the system is not necessary in batching systems because these systems process tasks in batches, without requiring real-time interaction with users. On the other hand, online communication is necessary in interactive systems as these systems require real-time interaction with users to provide immediate responses or feedback. Therefore, the correct answer is that online communication is not necessary in batching systems, but it is necessary in interactive systems.

Submit
107. U situaciji na slici učestvuju neki od kernelskih procesa. To su :

Explanation

The correct answer is "Short term scheduler i dispatcher". In the given situation, the short term scheduler and dispatcher are involved. The short term scheduler is responsible for selecting which process should be executed next from the ready queue, while the dispatcher is responsible for actually switching the context and transferring control of the CPU to the selected process. These two components work together to efficiently manage the execution of processes in the operating system.

Submit
108. Analizirati straničenje. Kako poboljšati performanse koje drastično padaju uvođenjem straničenja.

Explanation

The correct answer suggests that using a Translation Lookaside Buffer (TLB) can help improve performance when paging is introduced. A TLB is a hardware cache that stores recently accessed virtual-to-physical memory translations, allowing for faster memory access. By using a TLB, the system can quickly retrieve the physical memory addresses associated with virtual addresses, reducing the time needed for memory lookups and improving overall performance.

Submit
109. Koji je ovo short term scheduler algoritam. Diskutuje TQ

Explanation

This answer suggests that the short term scheduler algorithm discussed has a negative impact on performance. It implies that the algorithm may slow down the system or reduce its efficiency.

Submit
110. Analizirati straničenje. Kod straničenja je logički adresni prostor

Explanation

The given correct answer is "Kontinualan." This suggests that when analyzing paging, the logical address space is continuous or contiguous. In other words, the logical addresses are allocated in a sequential manner without any gaps or interruptions. This allows for efficient memory management and allocation of resources.

Submit
111. Analizirati straničenje. Imate veličinu stranice od 4k(4096 bajta). Ako smanjite veličinu stranice, šta se dešava sa internom fragmentacijom.

Explanation

Kada smanjite veličinu stranice, interna fragmentacija se smanjuje. Interna fragmentacija se odnosi na prostor unutar stranice koji ostaje neiskorišten. Kada je veličina stranice manja, manji je i prostor koji ostaje neiskorišten unutar svake stranice. Stoga, smanjenje veličine stranice smanjuje internu fragmentaciju.

Submit
112. U kojoj liniji koda mu je entry section

Explanation

The correct answer is "Linija broj 3 ili 4 (proveri tacno koja)". This suggests that the entry section of the code is located on either line 3 or line 4, but it is not specified which one exactly.

Submit
113. Kolekcija procesora koja pre svega deli Ram memoriju predstavlja:

Explanation

The correct answer is "Paralelnu multi-cpu arhitekturu". This answer suggests that the processor collection primarily shares RAM memory and utilizes multiple CPUs in parallel. This architecture allows for simultaneous processing of multiple tasks, enhancing overall performance and efficiency.

Submit
114. Deljivost memorije između različitih procesa je kod segmentacije moguća, na nivou:

Explanation

In segmentation, memory is divided into segments, and each segment can be shared between different processes. This allows different processes to access and use the same segment of memory simultaneously. Therefore, the correct answer is "segmenata."

Submit
115. Objasniti MVT. Koji algoritmi za MVT moraju analizirati se postojeće šupljine, prilikom alokacije memorije.

Explanation

The algorithms for MVT (Memory Variable Technique) that need to analyze existing holes during memory allocation are best fit and worst fit. Best fit algorithm searches for the smallest hole that is big enough to accommodate the process being allocated, while worst fit algorithm searches for the largest hole. Both algorithms analyze the available holes in order to find the most suitable one for the allocation.

Submit
116. Analizirati straničenje. AKo se koriste tehnike, kao što su hijerarhijsko straničenje, hashing ili invertovane tabele stranica, šta se dešava sa veličinom tabele stranica.

Explanation

When techniques such as hierarchical paging, hashing, or inverted page tables are used, the size of the page table decreases. This is because these techniques allow for more efficient mapping of virtual addresses to physical addresses, reducing the number of entries needed in the page table. As a result, the overall size of the page table is reduced.

Submit
117. BitMap, LinkedLists, Buddy systems

Explanation

The given answer "algoritmi za evidenciju slobodnog prostora u memoriji" is the correct answer because BitMap, LinkedLists, and Buddy systems are all algorithms used for managing and tracking free memory space in a computer's memory. These algorithms help in keeping track of which memory blocks are free and available for allocation, making it easier and faster to allocate and deallocate memory as needed.

Submit
118. Na ovoj slici vidi se:

Explanation

not-available-via-ai

Submit
119. Objasniti MVT.Od koje vrste fragmentacije pati algoritam MVT?

Explanation

The MVT (Multiprogramming with a Variable number of Tasks) algorithm suffers from external fragmentation. External fragmentation occurs when free memory blocks are scattered throughout the memory, making it difficult to allocate contiguous blocks of memory to a process. In MVT, as tasks are loaded and unloaded, the memory becomes fragmented, resulting in inefficient memory utilization. This can lead to wasted memory space and decreased system performance.

Submit
120. MMU šema na slici se naziva:

Explanation

The correct answer is hierarcical paging. Hierarchical paging is a memory management technique where the virtual address space is divided into multiple levels of page tables. Each level of the page table corresponds to a different level of the hierarchy. This allows for efficient memory management by reducing the size of the page table and improving lookup times.

Submit
121. Analizirati Segmentaciju. Od koje vrste fragmentacije pati segmentacija?

Explanation

Segmentacija je proces podeljavanja memorije u segmente radi efikasnog upravljanja resursima. Eksterna fragmentacija se javlja kada se slobodni segmenti memorije raspoređuju na nekontinuirane delove memorije, što može dovesti do toga da se neki segmenti ne mogu smestiti u slobodan prostor, iako ukupno ima dovoljno slobodne memorije. Dakle, segmentacija pati od eksterne fragmentacije.

Submit
122. Situacija sa slike je sustinski vazna za jednu klasu OS. za tu klasu OS, identifikujte short term scheduler algoritam koji je najbolji za njih

Explanation

The given question is asking for the best short term scheduler algorithm for a specific class of operating systems. The correct answer is "Priority." This suggests that the operating system class in question prioritizes tasks based on their importance or urgency. The Priority algorithm allows tasks with higher priority to be executed first, ensuring that critical tasks are completed promptly.

Submit
123. Tehnika aging u short temrm scheduler algoritmima se koristi za

Explanation

The explanation for the given correct answer is that the technique of aging in short-term scheduler algorithms is used to reduce or prevent deadlock situations. Deadlock occurs when two or more processes are unable to proceed because each is waiting for the other to release a resource. By using aging, the scheduler gives priority to processes that have been waiting for a longer time, which helps to break potential deadlocks and ensure that processes can continue running smoothly.

Submit
124. MMU na slici naziva se:

Explanation

The correct answer is "paging" because the question is asking for the name of the MMU (Memory Management Unit) shown in the picture. Paging is a memory management technique used by the MMU to divide the memory into fixed-size pages and map them to corresponding frames in the physical memory. This allows for efficient memory allocation and retrieval, as well as providing protection and sharing of memory resources. Therefore, the correct answer is paging.

Submit
125. Identifikujete koji je ovo short term scheduler algoritam, pa ga ocenite po pitanju preemption

Explanation

This question is asking to identify a short-term scheduler algorithm and evaluate it based on preemption. The answer "Non-preemptive" suggests that the identified algorithm does not allow preemption.

Submit
126. Kako se zove struktura na slici:

Explanation

The correct answer is "Resource of allocation graph" because the structure depicted in the image is showing the allocation of resources. It is representing how different resources are allocated to various processes or entities. Therefore, it can be referred to as a "Resource of allocation graph."

Submit
127. U osnovnom dijagramu stanja procesa, sa slike uočite tranziciju running-exit-terminated. Da li se u toj tranziciji poziva shorm term scheduler

Explanation

In the given question, the correct answer is "Obavezno". This means that in the transition from running to exit to terminated in the state diagram of the process, the short-term scheduler is definitely called.

Submit
128. U strukturnoj šemi računarskog sistema, OS je neposredno ispod:

Explanation

In a hierarchical structure of a computer system, the operating system (OS) is positioned directly below the system software and application software layers. The system software includes the OS itself, as well as other software components that provide essential functions for the computer system to operate effectively. The application software layer consists of programs and applications that are built on top of the OS to perform specific tasks and fulfill user requirements. Therefore, the OS is situated between the system software and application software layers in the computer system structure.

Submit
129. NAZIV OVOG ALGORITMA JE ?

Explanation

The correct answer is Dekker Peterson algorithm. This algorithm is named after its inventors, C. Dekker and T. Peterson. It is a mutual exclusion algorithm used in concurrent computing to solve the critical section problem. The algorithm allows multiple processes to access a shared resource without interference, ensuring that only one process can enter the critical section at a time. It is a classic algorithm in the field of parallel computing and is widely used in various applications to ensure synchronization and avoid race conditions.

Submit
130. Šema na ovoj slici, naziva se

Explanation

The correct answer is Banker algoritam. The given question is asking for the name of the schema shown in the picture. Out of the given options, the Banker algorithm is the only one that is a valid schema related to deadlock management. Therefore, the correct answer is Banker algoritam.

Submit
131. Na intelovim procesorima, poslednja adresa razrešava se u bloku:

Explanation

The correct answer is "Page table frame". On Intel processors, the last address is resolved in the page table frame. This means that the page table frame is responsible for translating the virtual address to the physical address. The page table frame contains the necessary information to map the virtual address to a physical address, such as page table entries and page directories. Therefore, the page table frame plays a crucial role in the address resolution process on Intel processors.

Submit
132. Deljivost memorije između različitih procesa kod straničenja je moguća, na nivou:

Explanation

In the context of paging, memory is divided into fixed-size blocks called pages. Each process is allocated a certain number of pages for its execution. The question asks about the level at which memory sharing between different processes is possible. The correct answer is "Stranice" which means "Pages" in English. This means that different processes can share memory at the page level, allowing them to access and modify the same pages of memory. Sharing memory at the page level is a common technique used in operating systems to optimize memory usage and improve performance.

Submit
133. Diskutujte ATAT. Identifikujte short term scheduler algoritam, koji je najgori po pitanju ATAT.

Explanation

The Round Robin (RR) scheduling algorithm is the worst in terms of Average Turnaround Time (ATAT). This is because RR assigns a fixed time slice to each process, regardless of its execution time. This can lead to inefficient scheduling, as longer processes may not be able to complete within a single time slice, resulting in frequent context switches and increased overhead. This can significantly increase the turnaround time for processes, making RR the worst choice in terms of ATAT.

Submit
134. Kada morate procesu da dodelite više memorije od onoga što je tražio, to je onda

Explanation

When you have to allocate more memory to a process than it requested, it results in internal fragmentation. This means that there is unused memory within a allocated block, leading to inefficient memory utilization.

Submit
135. Kod Bakery algoritma, u kojoj liniji koda mu je exit section

Explanation

The exit section in the code is at line number 15.

Submit
136. MMU na slici naziva se:(videti odgovor)

Explanation

not-available-via-ai

Submit
137. Dozvoljava da sistem predje safe i unsafe liniju, pa cak i da udje u belu zonu, ali ima resenje i za taj slucaj naziva se

Explanation

The given correct answer is "deadlock detection algorithm". This algorithm allows the system to cross both safe and unsafe lines, and even enter the white zone. It is designed to identify and detect deadlocks in a system.

Submit
138. Bound Buffer resenje moze da opsluzuje

Explanation

The correct answer is "samo 1 proces proizvodjac i samo 1 proces potrosaca" because in a bound buffer, there is typically only one producer process that produces items and one consumer process that consumes those items. This ensures that the producer and consumer do not interfere with each other and prevents any race conditions or data inconsistencies. Having multiple producer or consumer processes could lead to synchronization issues and make it difficult to manage the buffer effectively.

Submit
139. Analizirati segmentaciju. Koje vrste fragmentacije, segmentacija nema uopste

Explanation

The correct answer is "internu fragmentaciju". This means that the segmentation does not have internal fragmentation. Internal fragmentation occurs when allocated memory blocks are larger than the actual data they hold, resulting in wasted space within the block. In this case, the segmentation does not have this type of fragmentation, indicating that the allocated memory blocks are appropriately sized for the data they hold.

Submit
140. Kada ukupno u zbiru imate dovoljno slobodne memorije, a ne možete je dodeliti procesu koji je tražio, to je onda

Explanation

The correct answer is Eksterna fragmentacija. This is because when there is enough free memory in the system but it cannot be allocated to the process that requested it, it leads to external fragmentation. External fragmentation occurs when free memory blocks are scattered throughout the memory space, making it difficult to allocate contiguous blocks of memory to processes. This can result in inefficient memory utilization and can cause performance issues in the system.

Submit
141. U slučaju ulaska nekih procesa u deadlock, sistem se deadlock detection algoritmom u slučaju modernih računarskih sistema

Explanation

The correct answer states that in the case of some processes entering a deadlock, the system detects the deadlock by identifying a cycle and breaks the cycle by performing a roll back for one or more processes. This means that the system identifies the processes involved in the deadlock and rolls back their progress to a previous state, allowing them to continue execution and resolving the deadlock situation.

Submit
142. Tehnika prikazana na slici koristi se kod jednog algoritma:

Explanation

The technique shown in the picture is used in the Shortest Remaining Time First (SRTF) algorithm. In this algorithm, the process with the shortest remaining burst time is given the CPU for execution. It is a preemptive scheduling algorithm where the CPU can be taken away from a running process if a new process with a shorter burst time arrives. This ensures that the process with the shortest remaining time is always given priority, resulting in improved response time and reduced waiting time for processes.

Submit
143. Select the ones you like

Explanation

The given options are related to graphs and waiting for something. "Graph of process" and "memory allocation graph" are not commonly used phrases, making them less likely to be the correct answer. "Resource allocation graph" could be a possibility, but "Wait for graff" seems like the most appropriate answer as it suggests waiting for a graph, possibly indicating that the graph is being generated or loaded.

Submit
144. U kodu sa dva procesa Pi i Pj i dva dogadjaja A i B: semafor fleg je inicijalizovan na 0 Pi Pj MM A wait(flag) signal(flag)B

Explanation

Since the semaphore flag is initialized to 0, when process Pi encounters the instruction wait(flag), it will be blocked until another process signals the flag. In this case, process Pj will execute the instruction signal(flag) before process Pi reaches the instruction wait(flag), allowing process Pi to continue its execution. Therefore, event B (signal(flag)) will always occur before event A (wait(flag)), ensuring that event A is executed after event B.

Submit
145. 3 procesa izvršavaju isti editor teksta koji je velicine 20k. Za privatne data podatke potrebno je 3k. Odrediti kolika je interna fragmentacija za segmentaciju. Upisati broj u kb

Explanation

not-available-via-ai

Submit
146. Identifikujte koji je ovo  short term scheduler algoritam, pa ga ocenite po pitanju preemption(proveri)

Explanation

The correct answer is RR, which stands for Round Robin. This scheduling algorithm is known for its preemption feature, as it assigns a fixed time slice to each process in the system. If a process's time slice expires, it is preempted and moved to the back of the queue, allowing other processes to execute. This ensures fairness and prevents any single process from monopolizing the CPU for too long.

Submit
147. U kodu, sa dva procesa Pi i Pj i dva semafora S i Q Neka S i Q budu dva semafora inicijalizovana na 1 Pi Pj wait(S),wait(Q); wait(Q),wait(S); : : : signal(S),signal(Q); signal(Q),signal(S);

Explanation

The given code consists of two processes, Pi and Pj, and two semaphores, S and Q. The initial state of both semaphores is 1. The code includes wait and signal operations on the semaphores. Based on the provided code, it can be concluded that there is a possibility of deadlock occurring between processes Pi and Pj. However, it is not guaranteed that deadlock will always occur.

Submit
148. Identifikujte koji je ovo short term scheduler algoritam , pa ga ocenite po pitanju performansi

Explanation

This answer suggests that the short term scheduler algorithm being referred to is rated as "odličan" or excellent in terms of performance.

Submit
149. Analizirati straničenje. Koje vrste fragmentacije, straničenje nema uopšte.

Explanation

The given question is asking about the types of fragmentation that paging does not have. The correct answer is "Eksternu fragmentaciju" which translates to "External fragmentation" in English. This means that paging does not have external fragmentation. External fragmentation occurs when free memory blocks are scattered throughout the memory, making it difficult to allocate contiguous memory for a process. Paging, on the other hand, divides memory into fixed-size pages and allocates them to processes, eliminating the issue of external fragmentation.

Submit
150. Analizirati straničenje. Imate veličinu stranice od 1k(1024 bajta). Ako povećate veličinu stranice šta se dešava sa internom fragmentacijom

Explanation

When the page size is increased, the internal fragmentation increases. This is because larger page sizes result in more unused space within each page, leading to a higher amount of wasted memory. As a result, the internal fragmentation, which refers to the unused memory within a page, increases when the page size is increased.

Submit
151. Analizirati straničenje. Šta se dešava sa performansama uvođenjem straničenja u dva nivoa. Koliko imate memorijskih ciklusa, prilikom jednog ciklusa čitanja

Explanation

not-available-via-ai

Submit
152. Koji je ovo short term algoritam, pa ga ocenite po pitanju zakucavanja

Explanation

This short-term algorithm is rated as "Odličan" (excellent) in terms of cache hits.

Submit
153. Kod Time-sharing sistema

Explanation

The correct answer states that multiprogramming is mandatory and online communication is mandatory for a time-sharing system. This means that the system must be capable of running multiple programs simultaneously and also support online communication between users.

Submit
154. Analizirati straničenje. Imate veličinu stranice od 4096 bajta. Ako smanjite veličinu stranice, šta se dešava sa tabelom stranica.

Explanation

Kada smanjite veličinu stranice, tabela stranica će se povećati. To se događa jer manja veličina stranice zahteva više tabela stranica kako bi se pokrila ista količina memorije. Kada je veličina stranice veća, manje tabela stranica je potrebno jer svaka tabela stranica može da pokriva više memorije.

Submit
155. Identifikujte koji je ovo short term scheduler algoritam, pa mu izaberite OS za koji je on najbolji

Explanation

The correct answer is "Nijedan" which means "None" in English. This implies that there is no specific short term scheduler algorithm that is best suited for any of the listed operating systems (Unix-Linux, Sun Solaris, Dos, Chrome, Novel netware, Windows, RTOS). Each operating system may have its own unique requirements and characteristics that determine the most suitable short term scheduler algorithm.

Submit
156. Multiprograming

Explanation

The correct answer states that multiprogramming is not used in batching systems but is used in interactive systems. This means that multiprogramming allows multiple programs to run simultaneously in interactive systems, but not in batching systems where programs are executed one after another.

Submit
157. Objasnite dinamičko punjenje? Da li dinamičko punjenje zahteva pomoc od OS

Explanation

Dinamičko punjenje se odnosi na proces u kojem se memorija alocira ili oslobađa tokom izvršavanja programa. U ovom slučaju, odgovor "ne" ukazuje da dinamičko punjenje ne zahteva pomoć operativnog sistema. To znači da program samostalno može upravljati alociranjem i oslobađanjem memorije bez potrebe za intervencijom operativnog sistema.

Submit
158. Objasniti overlay tehniku? U koju kategoriju spada overlay tehnika

Explanation

Overlay tehnika je tehnika koja se koristi u programiranju kako bi se omogućilo da se više delova programa smesti u isti memorijski prostor. Ova tehnika omogućava efikasnije korišćenje memorije, posebno u situacijama kada je dostupan ograničen memorijski prostor. Overlay tehnika spada u kategoriju dinamičkog punjenja, jer se delovi programa učitavaju u memoriju samo kada su neophodni za izvršavanje određene funkcionalnosti, a zatim se zamene drugim delovima programa kada su potrebni.

Submit
159. Analizirati segmentaciju. Kod segmentacije je:

Explanation

The correct answer states that in segmentation, the logical address space is discontinuous, meaning that it is divided into separate segments. Additionally, the physical address space is also discontinuous, indicating that the physical memory is divided into non-contiguous segments. This means that the logical and physical addresses do not have a continuous relationship, and there may be gaps or unused portions in both address spaces.

Submit
160. Page tabela na slici predstavlja:

Explanation

Inverted paging is a memory management technique where instead of each process having its own page table, there is a single global page table for all processes. In this technique, each page table entry contains information about the process that owns the page, allowing for efficient memory allocation and sharing among processes. This is in contrast to the other options mentioned, where either each process has its own page table or the page tables are grouped by processes.

Submit
161. U situaciji na slici jasno se vide krugovi. Na prvi pogled, da li je to deadlock

Explanation

not-available-via-ai

Submit
162. MMU na slici naziva se:

Explanation

The correct answer is MVT. MVT stands for Multiprogramming with Variable Tasks, which is a memory management technique used in operating systems. In MVT, the main memory is divided into fixed-sized partitions, and each partition can hold a single task. The tasks are loaded into the partitions dynamically, and the size of the partitions can vary depending on the requirements of the tasks. This allows for efficient memory allocation and utilization, as tasks can be allocated memory based on their specific needs.

Submit
163. Objasniti dinamičko linkovanje? Da li dinamičko linkovanje zahteva pomoć operativnog sistema?

Explanation

Dinamičko linkovanje je proces kojim se omogućava da se programi povezuju sa bibliotekama ili modulima tokom izvršavanja, umesto da se vežu za njih tokom kompilacije. Ovo omogućava da se biblioteke mogu menjati ili ažurirati nezavisno od samog programa. Dinamičko linkovanje zahteva pomoć operativnog sistema kako bi se pronašle i učitale potrebne biblioteke u memoriju tokom izvršavanja programa. Dakle, odgovor "Da" je tačan jer dinamičko linkovanje zahteva pomoć operativnog sistema.

Submit
164. Deker piterson koliko procesa istovremeno može da opslužuje

Explanation

The given statement indicates that Deker Piterson can only serve 2 processes simultaneously. This means that Deker Piterson has a limited capacity and can handle only 2 processes at a time, suggesting a constraint on its ability to multitask or handle multiple tasks concurrently.

Submit
165. Identifikujte koji je ovo short term scheduler algoritam, pa ga ocenite po pitanju preemption

Explanation

This question is asking to identify the short-term scheduler algorithm and evaluate it based on preemption. The given answer is "Non-preemptive." This means that the identified short-term scheduler algorithm does not allow preemption, which refers to the ability to interrupt a running process before it has completed its execution. Therefore, in this algorithm, once a process starts executing, it will continue until it finishes or voluntarily yields the CPU.

Submit
166. Identifikujte koji je ovo short term scheduler algoritam, pa mu izaberite OS za koji je on najbolji

Explanation

The given answer suggests that the short term scheduler algorithm is best suited for most operating systems. This means that the algorithm can effectively manage and prioritize tasks in a wide range of operating systems, making it a versatile and adaptable choice.

Submit
167. U osnovnom dijagramu stanja procesa, sa slike uočite tranziciju running interrupt ready. Da li se u toj tranziciji poziva short term scheduler.

Explanation

In the given question, the correct answer is "Sigurno ne" which means "Definitely not" in English. This implies that in the transition from running to interrupt ready in the state diagram of the process, the short term scheduler is not called.

Submit
168. Instrukcija na slici je: boolean TestAndSet(boolean &target) { boolean rv=target target=true return rv }

Explanation

The given code snippet is implementing a TestAndSet function which takes a boolean target as a reference parameter. It first assigns the value of target to a local variable rv. Then, it sets the value of target to true and finally returns the value of rv. Based on this implementation, we can infer that the function is memory-based and cannot be interrupted. This means that once the function is called, it will execute without any interruptions until it returns a value.

Submit
169. U kernelskom modu, proces koristi:

Explanation

In kernel mode, the process uses any system resources that it has requested and has the right to use. This means that the process can utilize any resources of the system that it has specifically requested and has been granted access to. This includes resources such as CPU, RAM, and any other system resources that the process requires for its execution.

Submit
170. Objasniti MVT. Koju vrstu fragmentacije algoritam MVT nema uopste.

Explanation

MVT (Memory Variable Technique) je algoritam za upravljanje memorijom koji se koristi u operativnim sistemima. Ovaj algoritam nema internu fragmentaciju. Interna fragmentacija se javlja kada se alocira više memorije nego što je potrebno za izvršavanje programa, što dovodi do gubitka neiskorišćenog prostora. MVT se koristi za efikasno upravljanje memorijom tako da se minimizira interna fragmentacija i obezbedi optimalno korišćenje raspoložive memorije.

Submit
171. Objekat Semafor S, sa operacijama

Explanation

The given answer states that the modern semaphore does not have the phenomenon of busy waiting. Busy waiting refers to a situation where a process continuously checks for a condition to be true, wasting CPU cycles in the process. In the context of semaphores, busy waiting occurs when a process repeatedly checks the value of the semaphore without being able to enter the critical section. Modern semaphores typically use more efficient mechanisms, such as blocking or sleeping, to avoid busy waiting and improve system performance. Therefore, the answer suggests that the modern semaphore does not exhibit busy waiting.

Submit
172. Koji je ovo short term scheduler algoritam, i ocenite ga po pitanju zakucavanja

Explanation

This answer suggests that the short term scheduler algorithm being referred to is excellent in terms of avoiding deadlock.

Submit
173. Kolekcija procesora koja pre svega deli storage prostor predstavlja:

Explanation

The correct answer is "Klaster arhitekturu" (Cluster architecture). This type of processor collection primarily divides storage space. Cluster architecture is a design where multiple computers or processors work together as a single system. It allows for improved performance, scalability, and fault tolerance by distributing the workload across multiple nodes or computers.

Submit
174. U kojoj liniji koda mu je entry section: ?(Bakery algoritam)

Explanation

The entry section in the code refers to the part of the code where the program starts executing. In this case, the entry section is in lines 9, 10, 11, and 12. These lines likely contain the necessary code to initialize variables, set up any necessary data structures, and perform any other tasks required before the main execution of the program begins.

Submit
175. MMU na slici se naziva?

Explanation

The correct answer is MFT. MFT stands for Multiprogramming with a Fixed number of Tasks. It is a memory management technique where the main memory is divided into fixed-size partitions, and each partition is assigned to a specific task or process. This allows for efficient memory allocation and management, as each task is allocated a fixed amount of memory.

Submit
176. Kod Deker Pitersona, kakva je veza izmedju algoritma i operativnog sistema

Explanation

The correct answer is "Algoritam ne zavisi od OS" which translates to "The algorithm does not depend on the OS" in English. This means that the algorithm is independent of the operating system and can be implemented on any OS without any modifications. The relationship between the algorithm and the operating system is that the algorithm can be executed on the OS, but it does not rely on the specific features or functionalities of the OS to function correctly.

Submit
177. Analizirati straničenje. Od koje vrste fragmentacije pati straničenje?

Explanation

Straničenje je proces u kojem se memorija deli na male jedinice, poznate kao stranice, radi efikasnijeg upravljanja i korišćenja memorije. Od inertne fragmentacije pati straničenje. Inertna fragmentacija se javlja kada se slobodni prostor između stranica ne može iskoristiti za smeštanje novih procesa, što dovodi do gubitka memorije. Ova vrsta fragmentacije može smanjiti efikasnost straničenja i ukupne performanse sistema.

Submit
178. Analizirati straničenje. Straničenje je napravljeno

Explanation

Straničenje je napravljeno da bi se izbegla eksterna fragmentacija. Straničenje je tehnika upravljanja memorijom koja deli fizičku memoriju na jedinice poznate kao stranice. Kada se program izvršava, stranice se smeštaju u virtuelnu memoriju, a samo potrebne stranice se učitavaju u fizičku memoriju. Ovo smanjuje eksternu fragmentaciju jer omogućava efikasnije korišćenje raspoloživog prostora u memoriji. Interna fragmentacija se odnosi na nepotrebno zauzimanje dela stranice, ali straničenje ne rešava ovaj problem.

Submit
179. Identifikujte koji je ovo short term scheduler algoritam, pa ga ocenite po pitanju zakucavanja

Explanation

This answer suggests that the identified short term scheduler algorithm is "veoma slab" or "very weak" when it comes to avoidance of deadlock.

Submit
180. Identifikujte koji je ovo short term scheduler alogirtam, pa ga ocenite po pitanju performansi

Explanation

The given answer suggests that the short term scheduler algorithm being referred to is preemptive. Preemptive scheduling involves interrupting a running process before its completion and allocating the CPU to another process. This type of scheduling allows for better responsiveness and can improve overall system performance by ensuring that critical processes are given priority. However, it may also result in increased overhead due to frequent context switches. The answer does not provide information about the performance of the algorithm, so it cannot be evaluated in terms of performance.

Submit
181. Objekat Semafor S, sa operacijama wait(S) while S £ 0 do no-op; S--; Signal(S) s++; je:

Explanation

The given answer states that the object S is a classical semaphore and it exhibits the phenomenon of busy waiting. Busy waiting refers to a situation where a process continuously checks a condition in a loop without yielding the CPU, which can lead to wastage of CPU resources. Therefore, the classical semaphore S in this scenario is causing busy waiting.

Submit
182. U slučaju ulaska u DeadLock, Sistem sa deadlock detection algoritmom u slučaju ne bas modernih starijih računarskih sistema

Explanation

The correct answer states that in the case of entering a deadlock, a system with a deadlock detection algorithm in older computer systems detects the cycle and breaks the entire cycle by destroying one or more processes. This means that the system will never enter a deadlock.

Submit
183. Identifikujte koji je ovo short term scheduler algoritam, pa ga ocenite po pitanju performansi

Explanation

This answer suggests that the identified short term scheduler algorithm is "veoma slab" or very weak in terms of performance.

Submit
184. Ocenite ga po pitanju zakucavanja:

Explanation

The given answer "1 veoma slab" suggests that the person being evaluated has a very poor performance in terms of dunking. This rating indicates that their ability to execute a dunk is extremely weak.

Submit
185. Kom algoritmu odgovara ovaj slucaj od P0 do P4 A(7 instanci) B(2 instance) C(6 instanci) Stanje sistema u trenutku t0

Explanation

The deadlock detection algorithm is the most suitable for this case because it can identify if there is a deadlock in the system. In this scenario, the system has multiple processes with different instances. The deadlock detection algorithm can analyze the resource allocation and resource request graphs to determine if there is a circular wait, which indicates a deadlock. Therefore, it can effectively identify the deadlock situation in the system and take appropriate actions to resolve it.

Submit
186. Kolekcija procesora od kojih svaki ima sopstvenu memoriju i RTC, a poveyani su preko mreze predstavlja:

Explanation

The correct answer is "Distribuiranu multicomputer arhitekturu" because this architecture refers to a collection of processors, each with its own memory and RTC (real-time clock), connected through a network. This allows for distributed processing and parallel computing, where tasks can be divided among multiple processors for increased efficiency and performance.

Submit
187. Koji je ovo short term scheduler algoritam Vreme izvrsavanja 7,4,1,4

Explanation

SRTF stands for Shortest Remaining Time First. In this algorithm, the process with the shortest remaining burst time is selected for execution. In the given scenario, the processes have burst times of 7, 4, 1, and 4 units. Since the process with the shortest remaining burst time is selected, the process with a burst time of 1 will be executed first, followed by the process with a burst time of 4, then the process with a burst time of 4 again, and finally the process with a burst time of 7. Therefore, SRTF is the correct answer.

Submit
188. Koliko je Bakery algoritam zavistan od OS

Explanation

The Bakery algorithm is partially dependent on the operating system. This means that while it can be implemented and executed independently of the OS, it may still rely on certain OS functionalities or features to function properly. The algorithm itself is designed to provide a fair ordering of concurrent processes, but the specific implementation and execution may require OS support for tasks such as process synchronization or inter-process communication. Therefore, the Bakery algorithm is not completely independent of the OS, but it does not rely fully on it either.

Submit
189. MMU šema na slici je napravljena

Explanation

The correct answer is "Da bi se smanjila eksterna fragmentacija" which translates to "To reduce external fragmentation." This means that the purpose of using MMU šema (Memory Management Unit scheme) in the given image is to decrease the external fragmentation in the system. External fragmentation occurs when free memory blocks are scattered throughout the memory, making it difficult to allocate large contiguous blocks of memory to processes. By using the MMU scheme, the system can manage memory more efficiently and reduce external fragmentation.

Submit
190. MMU šema na slici je napravljena

Explanation

The correct answer is "Da bi se povećale performanse za paging" which translates to "To increase paging performance" in English. This implies that the MMU (Memory Management Unit) on the image is designed to improve the efficiency and speed of the paging process.

Submit
191. Za hard real time sisteme, identifikujte short term scheduler algoritam koji je najbolji za njih

Explanation

The best short term scheduler algorithm for hard real-time systems is the Priority algorithm. This algorithm assigns priorities to each task or process based on their importance or urgency. It ensures that the most critical tasks are executed first, allowing for efficient and timely completion of tasks in real-time systems. The Priority algorithm is particularly suitable for hard real-time systems where meeting strict deadlines and prioritizing critical tasks is crucial.

Submit
192. Identifikujte koji je ovo short term scheduler algoritam, pa ga ocenite po pitanju performansi

Explanation

The given answer suggests that the short term scheduler algorithm being referred to is rated as "4 jako dobar" which translates to "very good" in English. The answer further states that the performance of this algorithm is considered to be excellent.

Submit
193. DIskutujte AWT(average waiting time). Identifikujte, koji algoritam je najbolji po pitanju awt

Explanation

The Shortest Job First (SJF) algorithm is considered the best in terms of Average Waiting Time (AWT). This algorithm selects the process with the smallest burst time first, allowing shorter processes to be executed earlier. By prioritizing shorter jobs, the average waiting time is reduced as processes with longer burst times are delayed. This leads to better efficiency and faster completion of processes, resulting in a lower average waiting time compared to other scheduling algorithms.

Submit
194. Za koji OS je najbolji?

Explanation

The question is asking for the best operating system (OS). The correct answer is "Dos" and "Nijedan" (None). This suggests that neither Dos nor any other OS listed (Real time, Sun Solaris, Google chrome, Unix-linux, Windows) is considered the best.

Submit
195. Bound Buffer resenje(proveri tacan odgovor)

Explanation

The correct answer is "zavisi od OS i nije semaforski bazirano". This means that the behavior of the bound buffer depends on the operating system it is running on, and it is not based on semaphores. This suggests that the implementation of the bound buffer may vary depending on the OS, and it does not use semaphores for synchronization.

Submit
196. Identifikujte koji je ovo short term scheduler algoritam, pa ga ocenite po pitanju performani

Explanation

The given answer states that the short term scheduler algorithm is "vrlo dobar" which translates to "very good" in English. This suggests that the algorithm is highly efficient and effective in terms of performance.

Submit
197. U slučaju ulaska nekih procesa u deadlock, sistem sa deadlock detection algoritmom u slučaju modernih računarskih sistema

Explanation

This answer is incorrect. The correct answer is "Detektuje krug i razbija ceo krug uništavajući jedan ili više procesa" which means "It detects the cycle and breaks the entire cycle by destroying one or more processes." The phrase "Sistem zabija glavu u pesak" means "The system buries its head in the sand" and is not related to deadlock detection.

Submit
View My Results

Quiz Review Timeline (Updated): Mar 21, 2023 +

Our quizzes are rigorously reviewed, monitored and continuously updated by our expert board to maintain accuracy, relevance, and timeliness.

  • Current Version
  • Mar 21, 2023
    Quiz Edited by
    ProProfs Editorial Team
  • Apr 07, 2019
    Quiz Created by
    Nikola
Cancel
  • All
    All (197)
  • Unanswered
    Unanswered ()
  • Answered
    Answered ()
Kako se štiti CPU u računarskim sistemima? Koji je hardverski...
Model na slici je:
Šta vidite na ovoj slici:
Imate MMU sa relokacionim registrom. Generisana logička adresa iznosi...
Analizirati straničenje. Imate veličinu stranice od 8K(8192 bajta)....
Imate MMU sa relokacionim registrom. Generisana logička adresa iznosi...
U osnovnoj dijagramu stanja procesa, sa slike učestvuju neki od...
U situaciji na slici štiti se jedan resurs, a to je:
Koju arhitekturu vidite na ovoj slici?
U multithread modelu procesa, programski kod je:
U strukturnoj šemi OS-a, najkvalitetniji i fundamentalni deo...
Arhitektura prikazana na slici je idealna za razvoj ili učenje:
Analizirati straničenje. Imate veličinu stranice od 2k(2048 bajta)....
U situaciji na slici, ako učestvuje kernelski proces dispečer njegov...
Koju arhitekturu vidite na slici:
Model na slici je:
Koji je najbolji prijatelj CPU i racunarskog sistema
Kojem OS najvise odgovara ova slika:
U multithread modelu procesa, globalni podaci su:
U otkrivanju pojave deadlocka je vrlo pouzdana i jednostavna
Analizirati straničenje. imate veličinu stranice od 1k(1024 bajta)....
Cemu služi struktura sa slike
U situaciji na slici štiti se jedan hardverski resurs: To je:
U modelu na slici, kada neka od korisničkih niti predje u stanje...
U situaciji sa slike štiti se jedan resurs. To je:
Šta vidite na ovoj slici?
OS je po pitanju alokacija i upravljanja računarskim resursima:
Analizirati segmentaciju. Imate veličinu stranice od 1350 bajtova....
Koji operativni sistem je prikazan na slici:
Koju arhitekturu vidite na slici?
Koju arhitekturu vidite na slici?
U user modu, proces koristi:
Koja odobrava svaki zahtev, a obavlja proracun u kom stanju su procesi...
U situaciji na slici u jednoj grani se sigurno dogodila preemption. To...
U arhitekturu koju vidite na ovoj slici:
U otkrivanju pojave deadlocka je vrlo pouzdana i jednostavna
Na slici su prikazana 2 mehanizma
Sema koja u odnosu na ovu sliku, koja na svaki zahtev prvo obavi...
U situaciji na slici učestvuju ili ne sledeće hardverske komponente:
Struktura na slici uglavnom služi:
U strukturnoj šemi računarskog sistema, OS je neposredno iznad
Identifikujte short term scheduler algoritam, pa ga ocenite po pitanju...
U slučaju ulaska nekih procesa u deadlock, za sistem sa Deadlock...
Izaberite tacan odgovor
Objasniti MVT. Koji algoritam za MVT ne mora da analizira postojeće...
Kod TS fundamentalni resurs koji se deli je:
Postoje 4 uslova vezana za pojavu deadlocka: ...
Sa slike uočite tranziciju waiting-IO or event completion-ready. Da...
Koji je ovo short term scheduler algoritam. Odrediti TQ
Tranziciju na koju ukazuje crvena strelica izaziva
Kojem operativnom sistemu najvise odgovara ova slika?
Potpunu CPU izolaciju u odnosu na i/o akcije omogucavaju dva...
Najtipicniji predstavnik TS(timesharing systems) je:
Prethodni algoritam(nepoznato ime) koliko procesa može da opslužuje
Čiji je ovo many-to-many model
Analizirati segmentaciju. Imate segment od 1350 bajtova. Kolika je...
Šta je prikazano na slici
Kojem OS najviše odgovara ova slika:
Koju arhitekturu vidite na ovoj slici?
U situaciji na slici, tranziciju na koju ukazuje crvena strelica...
Ne dozvoljava da sistem predje safe, unsafe liniju, naziva se
Na slici vidite veoma bitnu strukturu OS. To je?
Na osnovu dijagrama stanja procesa, sa slike uočite tranziciju...
Na Intel procesorima, IA-32 arhitektura, primenjena je sledeća...
U osnovnom dijagramu stanja procesa, sa slike, proces poseduje ili ne...
Analizirati straničenje. Slika sadrži pored straničenja i jednu...
Na ovoj slici se vidi prelazak iz:
I/O se u računarskim sistemima obično štite preko
3 procesa izvrsavaju isti editor teksta koji je velicine 20k. Za...
Slika predstavlja:
Na slici je prikazano resenje problema Bounded Buffer ...
Koji je ovo algoritam, po pitanju klase?(Bakery algoritam)
Identifikujte koji je ovo short term scheduler algoritam, pa ga...
Objasnite MVT. Koji algoritam za mvt ima najbrže pretraživanje u...
Analizirati straničenje. Za poboljšanje performansi koje...
Zahteva od procesa da se izjasne na samom pocetku koriscenja svih tj...
Na slici je prikazana deljivost:
Kod Deker Pitersona, u kojoj liniji koda mu je exit section:
Koliko procesa pekarski algoritam(Bakery) može da opslužuje?
Objasniti dinamičko punjenje? Ko je glavni i odgovorni za dinamičko...
Koju arhitekturu vidite na ovoj slici?
Identifikujte koji je ovo short term scheduler algoritam, pa ga...
Na slici je prikazana deljivost:
Sledeća slika predstavlja:
Analizirati straničenje, Imate veličinu stranice od 1k(1024 bajta)....
Kojem operativnom sistemu najvise odgovara ova slika?
Analizirati straničenje. Šta se dešava sa performansama...
Na ovoj slici vidi se:
Na ovoj slici se može videti:
Deker Piterson algoritam je:(kakvo resenje)
3 procesa izvrsavaju isti editor teksta koji je velicine 20k. Za...
Sistemski poziv predstavlja interfejs između
Kom algoritmu odgovara ovaj slučaj: ...
Tranzicija na koju ukazuje crvena strelica
Diskutujte RT. Iddentifikujte koji je ovo short term scheduler...
Da li Deker Piterson algoritam ima busy waiting?
U situaciji na slici, tranziciju na koju ukazuje crvena strelica...
Na ovoj slici vidi se prelazak iz:
Koji je ovo algoritam?
Analizirati straničenje. Šta se dešava sa performansama...
Za time sharing sisteme, kao što su UNIX i linux, identifikujte...
Na slici vidite jednu veoma bitnu strukturu OS. Sa tom strukturom...
Identifikujte koji je ovo short term scheduler algoritam, pa ga...
Memorija se u računarskim sistemima obično štiti preko
Koji je ovo short term scheduler algoritam
Online komunikacija sa sistemom
U situaciji na slici učestvuju neki od kernelskih procesa. To su :
Analizirati straničenje. Kako poboljšati performanse koje...
Koji je ovo short term scheduler algoritam. Diskutuje TQ
Analizirati straničenje. Kod straničenja je logički adresni prostor
Analizirati straničenje. Imate veličinu stranice od 4k(4096 bajta)....
U kojoj liniji koda mu je entry section
Kolekcija procesora koja pre svega deli Ram memoriju predstavlja:
Deljivost memorije između različitih procesa je kod segmentacije...
Objasniti MVT. Koji algoritmi za MVT moraju analizirati se postojeće...
Analizirati straničenje. AKo se koriste tehnike, kao što su...
BitMap, LinkedLists, Buddy systems
Na ovoj slici vidi se:
Objasniti MVT.Od koje vrste fragmentacije pati algoritam MVT?
MMU šema na slici se naziva:
Analizirati Segmentaciju. Od koje vrste fragmentacije pati...
Situacija sa slike je sustinski vazna za jednu klasu OS. za tu klasu...
Tehnika aging u short temrm scheduler algoritmima se koristi za
MMU na slici naziva se:
Identifikujete koji je ovo short term scheduler algoritam, pa ga...
Kako se zove struktura na slici:
U osnovnom dijagramu stanja procesa, sa slike uočite tranziciju...
U strukturnoj šemi računarskog sistema, OS je neposredno...
NAZIV OVOG ALGORITMA JE ?
Šema na ovoj slici, naziva se
Na intelovim procesorima, poslednja adresa razrešava se u...
Deljivost memorije između različitih procesa kod straničenja je...
Diskutujte ATAT. Identifikujte short term scheduler algoritam, koji je...
Kada morate procesu da dodelite više memorije od onoga...
Kod Bakery algoritma, u kojoj liniji koda mu je exit section
MMU na slici naziva se:(videti odgovor)
Dozvoljava da sistem predje safe i unsafe liniju, pa cak i da udje u...
Bound Buffer resenje moze da opsluzuje
Analizirati segmentaciju. Koje vrste fragmentacije, segmentacija nema...
Kada ukupno u zbiru imate dovoljno slobodne memorije, a ne možete je...
U slučaju ulaska nekih procesa u deadlock, sistem se deadlock...
Tehnika prikazana na slici koristi se kod jednog algoritma:
Select the ones you like
U kodu sa dva procesa Pi i Pj i dva dogadjaja A i B: ...
3 procesa izvršavaju isti editor teksta koji je velicine 20k....
Identifikujte koji je ovo  short term scheduler algoritam, pa ga...
U kodu, sa dva procesa Pi i Pj i dva semafora S i Q ...
Identifikujte koji je ovo short term scheduler algoritam , pa ga...
Analizirati straničenje. Koje vrste fragmentacije, straničenje nema...
Analizirati straničenje. Imate veličinu stranice od 1k(1024 bajta)....
Analizirati straničenje. Šta se dešava sa performansama...
Koji je ovo short term algoritam, pa ga ocenite po pitanju zakucavanja
Kod Time-sharing sistema
Analizirati straničenje. Imate veličinu stranice od 4096 bajta. Ako...
Identifikujte koji je ovo short term scheduler algoritam, pa mu...
Multiprograming
Objasnite dinamičko punjenje? Da li dinamičko punjenje zahteva pomoc...
Objasniti overlay tehniku? U koju kategoriju spada overlay tehnika
Analizirati segmentaciju. Kod segmentacije je:
Page tabela na slici predstavlja:
U situaciji na slici jasno se vide krugovi. Na prvi pogled, da li je...
MMU na slici naziva se:
Objasniti dinamičko linkovanje? Da li dinamičko linkovanje zahteva...
Deker piterson koliko procesa istovremeno može da opslužuje
Identifikujte koji je ovo short term scheduler algoritam, pa ga...
Identifikujte koji je ovo short term scheduler algoritam, pa mu...
U osnovnom dijagramu stanja procesa, sa slike uočite tranziciju...
Instrukcija na slici je: ...
U kernelskom modu, proces koristi:
Objasniti MVT. Koju vrstu fragmentacije algoritam MVT nema uopste.
Objekat Semafor S, sa operacijama
Koji je ovo short term scheduler algoritam, i ocenite ga po pitanju...
Kolekcija procesora koja pre svega deli storage prostor predstavlja:
U kojoj liniji koda mu je entry section: ?(Bakery algoritam)
MMU na slici se naziva?
Kod Deker Pitersona, kakva je veza izmedju algoritma i operativnog...
Analizirati straničenje. Od koje vrste fragmentacije pati...
Analizirati straničenje. Straničenje je napravljeno
Identifikujte koji je ovo short term scheduler algoritam, pa ga...
Identifikujte koji je ovo short term scheduler alogirtam, pa ga...
Objekat Semafor S, sa operacijama ...
U slučaju ulaska u DeadLock, Sistem sa deadlock detection algoritmom...
Identifikujte koji je ovo short term scheduler algoritam, pa ga...
Ocenite ga po pitanju zakucavanja:
Kom algoritmu odgovara ovaj slucaj od P0 do P4 ...
Kolekcija procesora od kojih svaki ima sopstvenu memoriju i RTC, a...
Koji je ovo short term scheduler algoritam Vreme izvrsavanja 7,4,1,4
Koliko je Bakery algoritam zavistan od OS
MMU šema na slici je napravljena
MMU šema na slici je napravljena
Za hard real time sisteme, identifikujte short term scheduler...
Identifikujte koji je ovo short term scheduler algoritam, pa ga...
DIskutujte AWT(average waiting time). Identifikujte, koji algoritam je...
Za koji OS je najbolji?
Bound Buffer resenje(proveri tacan odgovor)
Identifikujte koji je ovo short term scheduler algoritam, pa ga...
U slučaju ulaska nekih procesa u deadlock, sistem sa deadlock...
Alert!

Advertisement