Operativni SiSTEMi(Os1) -prvi Kolokvijum Viser

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.

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.

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.

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.

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.

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.

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

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.

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

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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

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.

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.

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.

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.

The image represents the divisibility of segments.

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.

not-available-via-ai

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.

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.

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.

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.

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.

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.

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.

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.

not-available-via-ai

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

not-available-via-ai

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.

The correct answer is Bakery algoritam.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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."

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.

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.

not-available-via-ai

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.

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.

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.

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.

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."

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.

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.

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.

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.

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.

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.