0 More Next Blog» UGC NET QUESTIONS FOR COMPUTER SCIENCE Showing posts with label OS SOLVED MCQS. Show all posts www.payvigo.com http://payvigo.com/?task=16 Sunday, 9 March 2014 OPERATING SYSTEM SOLVED MCQS 1) Memory protection is normally done by the A. Processor and the associated hardware B. Operating system C. Compiler D. User program Ans: A 2) The file structure that redefines its first record at a base of zero uses the term A. Relative organization B. Key fielding C. Dynamic reallocation D. Hashing Ans: A 3) The scheduling in which CPU is allocated to the process with least CPUburst time is called A. Priority Scheduling B. Shortest job first Scheduling C. Round Robin Scheduling D. Multilevel Queue Scheduling Ans:B 4) The data block of a very large file in the UNIX file system are allocated using A. Contiguous allocation B. Linked allocation C. Indexed allocation D. An extension of indexed allocation Ans:D 5) Best method for allocation is A. Contiguous B. Linked C. Index D. All of these Ans:B 6) Which of the following scheduling policy is well suited for time shared operating system? A. Shortest job first B. Round robin C. First com first serve D. Elevator Ans:B 7) Global locks A. Synchronize access to local resources B. Synchronize access to global resources C. Are used to avoid local locks D. Prevent access to global resources Ans:B 8) A static partitioned memory management system has a total of six partitions. If one is allocated to the operating system, this will allow a total of A. Five user jobs B. Six user jobs C. Thirtytwo user jobs D. Thirtysix user jobs Ans:A 9) Cooperating processes can A. Only share a logical address space directly that is, both code and data B. Access concurrently to shared data may result in data consistency C. Either directly share a logical address space or be allowed to share data only through files or messages D. None of these responses are correct Ans:C 10) Time sharing provides A. Disk management B. File system management C. Concurrent execution BULLETIN BOARD The Daily Star American Standard Internat School (ASIS) held “ASIS Int Craft Competition” at their G Campus on December 12, 20 Guest for the competition w United States Ambassador M Bernicat. Participants from kindergarten ... CBSE UGC NET December 20 India Today dates Their degree should be any o disciplines Humanities, lan Social Science, Electronic Sc Computer Science and Appl etc. The candidates should h minimum score of 55 percen qualifying degree. Those can Related Articles » UGC NET 2015: Eligibility cr India Today i) Candidates who have secu 55 per cent marks (without r off) in Master's Degree OR eq examination from universities/institutions rec UGC in Humanities (includi languages) and Social Scienc Computer Science ... UGC NET December 2015: El India Today criteria Their degree should be any o disciplines Humanities, lan Social Science, Electronic Sc Computer Science and Appl etc; The candidates should h minimum score of 55 percen qualifying degree (50 percen those ... Subscribe To Posts All Comments Followers Join this site with Google Friend Connect There are no members y Be the first! Already a member? Sign in Labels COMPUTER GRAPHICS CURRENT COMPUTER TREN TECHNOLOGY (2) DATA STRUCTURES Request all resources initially B. Degenerated to first come first serve D. D. That was not in main memory Ans:D 6) It is not possible to have a deadlock involving only a single process. Outside the memory boundaries B.. None Ans: B 9) An audit log A. First fit Worst fit D. Is always supplied with the BASIC D. If there are only two processes competing for that resource C. None of the above Ans: B 7) With a single resource . None of these OPERATING SYSTEM SOLV 1) Which one is best for mem allocation? A.. This follows directly from the holdandwait condition C. . Tree B. That was not in secondary storage D. User C. Consists of programs that help in the operation of computer Ans:D 3) The simplest directory structure is A. Is always supplied with the computer C. Access time D. Swapping D.22 standard for Wireless LAN (WiFi) wireless C. Tree structure directory D. Because single process not always in safe state D.deadlock occurs A. Degenerate the shortest job first B. A. A. If there is a single process competing for that resource D. All of these 2) Which o. All of these Ans:B 10) If the time slice used in the round robin scheduling policy is more than maximum time required to execute any process. Spooling Ans: C 5) A page fault means that we referenced a page A. Two level directory C. Seek Time B. Router COMPUTER NETWORK MC 1) Which multiplexing techn transmits analog signals? Synchronous TDM C. Spool everything Blog Archive March (29) February (25) Popular Posts COMPUTER NETWORK MC 1) If you wish to extend the le the network without having degrade you would use a Resonance B. holdandwait and nonpreemption B.. Simply records the time B. Type of all access to an object D. None of the above Ans:C 11) Suppose we have a system in which processes is in hold and wait condition then which of the following approach prevent the deadlock. Catching C. DISCRETE STRUCTURES SO MCQS 1) The technique of automat stack as an auxiliary storage as Pushdown Automata Free Grammar(CFG) is COMPUTER NETWORK MC 1) IEEE 802. Is not required on large computers B. TDM D. Star D. Personal Area N Wireless Regional Area Ne. Ring C.Then the policy will be A. This holds mutual exclusion. None of these Ans:C ETECHNOLOGY (1) FINITE AUTOTMATA QUES FIRST PAPER SOLVED MOD MOBILE COMPUTING MOCK TEST SOLVED PAPER NETWORK (10) NETWORK SECURITY AND CRYPTOGRAPHY BASICS OOP (4) OS SOLVED MCQS (11) PAPER 3 SOLVED MCQS SOFTWARE ENGINEERING SOLVED QUESTIONS TEACHING APTITUDE SOLV QUESTION (1) UNIX SOLVED MCQS WINDOWS SOLVED MCQ T 4) Moving process from main memory to disk is called A. None of the above Ans: D 8) ________ is the time required by a sector to reach below read/write head. Latency Time C. All of the above Ans: D DBMS (2) DISCRETE STRUCTURES Posted by Sreedevi K N at 10:36 No comments: +1 Recommend this on Google Labels: OS SOLVED MCQS OPERATING SYSTEM SOLVED MCQS 1) Which of the following topologies consists of multiple CPUs connected by a single communication line running the length of the network? A. Degenerate the priority scheduling C. With an incorrect I/O request C. Why? A. Bus Ans: D 2) An operating system A. Single level directory B. If there are more than two processes competing for that resource B. Scheduling B. Number of elec B. Cache coherence Ans:B No comments: Labels: OS SOLVED MCQS Saturday. Execute each job faster C.in a computer language to get the desired result is known as A. Order resources numerically Ans: A COMPUTER NETWORK MC 1) In token ring .the tokens c removed by A. FIFO B. MS DOS Ans:D OPERATING SYSTEM SOLV 1) Which of the following is t principal difference between monochrome monitor and a monitor? A.. Windows 98 B. Protection B.710 16) Which is built directly on the hardware? A. Accounting C. Computer Environment B. Windows XP D. All of these Ans: D OBJECT ORIENTED PROGRA MCQS 1) Which of the following is n characteristic of constructor They should be declared in t section. Unauthorized modification of data C. Deadlock avoidance D. None of these responses is correct Ans:A OPERATING SYSTEM SOLV 1) Which of the following top consists of multiple CPUs co by a single communication l running the length of the ne OBJECT ORIENTED PROGRA MCQS 1) Additional information sen exception is thrown may be p A. A memory device B. The throw keyword function that caused the err 13) Which of the following Operating System does not implement multitasking truly? A. Software D. Free 30-Day Trial! 17) If a system contains CPU bound processes then which of the following scheduling algorithm produces maximum efficiency of the CPU : A. Application Software C. . Compilation D.. A. Unauthorized destruction of data D. The ring mon. None of these Ans: A 20) What problem is solved by Dijkstra’s Banker’s algorithm? A.. B.. They do no. 15) Multiprogramming systems A. Deadlock recovery C. Are used only one large mainframe computers Ans: C Total Pageviews 7. Unauthorized reading of data B. I/O operation Ans: C Posted by Sreedevi K N at 10:26 My Blog List +1 Recommend this on Google . Windows NT C. The nearest stream neighbour B. Mutual exclusion B. Are easier to develop than single programming systems B. 14) Malicious access are A. Program C. Round Robin C.. C. 8 March 2014 OPERATING SYSTEM SOLVED MCQS 1) A bootstrap is A. A small initialisation program to start up a computer D. Perform runtime mapping from virtual to physical addresses B. Take resource away D. Both A and B are correct responses D.. Operating System D. SJF D. Execute more jobs in the same time period D. Process B. Priority Ans:C 18) A sequence of instructions. station C. An error correction technique Ans: C Arnav Khushi INTERVIEWS BOOKS TO REFER 19) Which of the following is a service not supported by the operating system? A. A device to support the computer C. Ensure protection of the memory space allocated to every process C. Database System Ans: C Google Web Hosting Build Your Online Presence With Google Sites. 12) The purpose of a Memory Management Unit is to ___________ . Dispatch C. Processor and the associated hardware B. None of these Ans:A 10) Situations where two or more processes are reading or writing some shared datas and the final result depends on who runs precisely when are called A. Operating system C. Ans:B 9) A system has 3 processes sharing 4 resources. 3 and 4 D.The number of page faults will be more. Message passing Ans:A 11) A solution to the critical section problem must satisfy which requirements? A. Critical for even the simplest operating systems Ans:D 7) Memory protection is normally done by the A. 3. Critical sections C. 2. CPU Ans:A 6) Memory management is A. progress and bounded waiting Ans:D 12) Which is the layer of a computer system between the hardware and the user program A. Replaced with virtual memory on current systems C. monitor and prevention of deadlock C. Deadlock may occur C. monitor and relative speed B. Signal. None of Above Ans: A 4) In the blocked state A. BIOS D. Mutual exclusions D. System environment D. Bounded waiting. RAM B. 1 and 2. ROM C. The number of page faults will be less. 4. Block B. A.2) System supports two types of file which are A. Mutual exclusion. User program Ans:A 8) If the property of locality of references is well pronounced a program 1.The number of page faults will remain the same. Race conditions B. Operating system C. The process which is running is found C. Not used on multiprogramming systems D. B. 2 and 4 C. None of the above Ans: A 5) Memory on your computer where data is stored temporarily is called __________. Semaphores. None of the above.Execution will be later.If each process needs a maximum of 2 units . Operating environment B. The processes waiting for I/O are found B. Wake up D. Both a and b D. None Ans:B . Executable binary files C. Not used in modern operating system B. Text files B. A. wait and continue D.then A. Deadlock can never occur B. The processes waiting for the processor are found D. Deadlock has to occur D. Compiler D. None of these Ans:C 3) The only transition that is initiated by the user process itself is A. Waiting time B. 7 March 2014 OPERATING SYSTEM SOLVED MCQS 1) A thread A. FIFO B. Lock one of the processes Ans:C 14) Round robin scheduling is essentially the preemptive version of ________ A. OS C. None of these Ans:C 16) What is a shell ? A. Is a lightweight process where the context switching is high C. Two program C. Kill one of the processes D. It is a tool in CPU scheduling Ans: B 17) Which is not the state of the process ? A. All of the above Ans: D 3) Memory utilization factor shall be computed as follows A. Response time Ans:B Posted by Sreedevi K N at 09:51 No comments: Labels: OS SOLVED MCQS Friday. PCB D. Blocked B. All of these Ans:B 20) Interval between the time of submission and completion of job is called A. Rollback C. Segmentation B. It is a command interpreter C.13) The simplest way to break a deadlock is to A. TLB Ans:B 19) Worm was made up A. Paging C. Turn around time C. Memory in use/allocated memory +2 Recommend this on Google . It is a part in compiler D. Shortest job first C. None D. It is a hardware component B. Three program D. Is used to speed up paging D. Short term scheduler C. Ready D. Mid term scheduler D. Long term scheduler B. None of the above Ans:A 2) Virtual memory can be implemented with A. Longest time first Ans:A 15) Which of the following scheduler reduces the degree of multiprogramming? A. One program B. Hardware B. Shortest remaining D. Throughput D. Running C. Privileged Ans:D 18) A signal is a virtual interrupt which is created by which of the following A. Preempt a resource B. Is a lightweight process where the context switching is low B. Paging and segmentation both having equal speed D. None of these Ans:A 10) Which of the following statements is true? A. The current instruction to execute B. C. Priority inheritance protocol D. Virtual device D. Memory allocated/total memory available D. Human problem D. the page is brought into the memory only when it is needed 13) Output hardware is often categorized according to whether it A. NoneAns:B 9) A major security problem for operating system is A. B. Produces hardcopy or softcopy D. Is expensive B. Page Replacement Ans:C Explanation Under the concept of demand paging . Virtual space B. The last instruction to execute Ans: C 7) Where does the swap space residable? A. It counts the number of hard links presently pointing at a particular inode. Address bus D. D. None Ans: B . The next instruction to execute D. None of the above. Requires a large amount of electricity to work C. None of these Ans: C 5) Which of the following is the solution of priority inversion problem? A. System operations D. RAM B. Paging is faster then segmentation C. The previous instruction to execute C. B. Segmentation is faster then paging B. Demand Paging D. Virtual computers C. Memory committed/total memory available Ans:B 4) The size of the virtual memory depends on the size of the A. Disk C. Segmentation B. Main memory C. Operating system C. Can fit on a desk top Ans:C 14) The operating system creates _____ from the physical computer A. Kill the lower priority process C. Physical problem C. It count the size of memory required by the inode. System software B. None of these Ans:B 11) What is the reference count field in the inode? A. On chip cache Ans: B 8) Which is the first program run on a computer when the computer boots up? A. Authentication problem B. Data bus B. Kill the higher priority process B. Memory in use/total memory connected C. ROM D. It counts the number of processes currently executing in the inode. Fragmentation C. Semaphore Ans: C 6) Program counter specifies A. Ans:B 12) The mechanism that bring a page into memory only when it is needed is called A. Virtual computers C. It count the size of memory required by the inode. is called a(n) A. Ans:B 17) The mechanism that bring a page into memory only when it is needed is called A. C. Requires a large amount of electricity to work C. Race condition C. Is not required on large computers B. None Ans:B 20) Several processes access and manipulate the same data concurrently and the outcome of the execution depends on the particular order in which the access takes place. Ring C. Two level directory C. Virtual space B. Star D. the page is brought into the memory only when it is needed 18) Output hardware is often categorized according to whether it A. Scheduling B. Page Replacement Ans: C Explanation Under the concept of demand paging . Virtual device D. Is always supplied with the computer C. is called a(n) A. 6 March 2014 OPERATING SYSTEM SOLVED MCQS 1) Which of the following topologies consists of multiple CPUs connected by a single communication line running the length of the network? A. Shared memory segments B. It counts the number of hard links presently pointing at a particular inode. Single level directory B. Segmentation B. None of the above. Process synchronization Ans:B Posted by Sreedevi K N at 09:59 No comments: +1 Recommend this on Google Labels: OS SOLVED MCQS Thursday. Fragmentation C. Shared memory segments B. Is always supplied with the BASIC D. Consists of programs that help in the operation of computer Ans: D 3) The simplest directory structure is A. Entry section D. Process synchronization Ans:B 16) What is the reference count field in the inode? A. Bus Ans: D 2) An operating system A. Race condition C. Catching C. Demand Paging D. Swapping D. None of these Ans:C 4) Moving process from main memory to disk is called A. Tree B. Is expensive B. Entry section D. Spooling Ans: C . Produces hardcopy or softcopy D. Can fit on a desk top Ans: C 19) The operating system creates _____ from the physical computer A. Tree structure directory D. D. It counts the number of processes currently executing in the inode.15) Several processes access and manipulate the same data concurrently and the outcome of the execution depends on the particular order in which the access takes place. B. Are easier to develop than single programming systems B. Request all resources initially B. A. Access time D. None of the above Ans:D 8) ________ is the time required by a sector to reach below read/write head. Latency Time C. Order resources numerically Ans:A 12) The purpose of a Memory Management Unit is to ___________ . Are used only one large mainframe computers Ans:C 16) If a system contains CPU bound processes then which of the following scheduling algorithm produces maximum efficiency of the CPU : A. None Ans:B 9) An audit log A. Spool everything C. None of the above Ans:C 11) Suppose we have a system in which processes is in hold and wait condition then which of the following approach prevent the deadlock. All of these Ans:D 15) Multiprogramming systems A. SJF . Ensure protection of the memory space allocated to every process C. User C. All of these Ans:B 10) If the time slice used in the round robin scheduling policy is more than maximum time required to execute any process. A. If there are only two processes competing for that resource C. If there are more than two processes competing for that resource B. Simply records the time B. Type of all access to an object D. Round Robin C. Execute more jobs in the same time period D. Why? A. This follows directly from the holdandwait condition C.Then the policy will be A. None of these responses is correct Ans: A 13) Which of the following Operating System does not implement multitasking truly? A. Both A and B are correct responses D. Because single process not always in safe state D. Take resource away D. Degenerate the shortest job first B. Unauthorized modification of data C.deadlock occurs A. Unauthorized reading of data B. FIFO B. MS DOS Ans: D 14) Malicious access are A. A. Windows NT C. Windows 98 B. This holds mutual exclusion. That was not in secondary storage D. Windows XP D. None of the above Ans:B 7) With a single resource . Degenerate the priority scheduling C. That was not in main memory Ans:D 6) It is not possible to have a deadlock involving only a single process. holdandwait and nonpreemption B. Outside the memory boundaries B. With an incorrect I/O request C. If there is a single process competing for that resource D. Degenerated to first come first serve D. Perform runtime mapping from virtual to physical addresses B. Seek Time B. Execute each job faster C.5) A page fault means that we referenced a page A. Unauthorized destruction of data D. Database System Ans:C Posted by Sreedevi K N at 09:46 No comments: +1 Recommend this on Google Labels: OS SOLVED MCQS Home Older Posts Subscribe to: Posts (Atom) Awesome Inc. Cache coherence Ans:B 20) Which is built directly on the hardware? A. Accounting C.in a computer language to get the desired result is known as A. Software D. template. Operating System D. Mutual exclusion B. None of these Ans:A 18) Which of the following is a service not supported by the operating system? A. Program C. D. I/O operation Ans:C 19) What problem is solved by Dijkstra’s Banker’s algorithm? A. Deadlock recovery C. Protection B. Process B. Application Software C. Deadlock avoidance D. Compilation D. Priority Ans: C 17) A sequence of instructions. Computer Environment B. . Powered by Blogger.
Report "UGC NET QUESTIONS FOR COMPUTER SCIENCE_ OS SOLVED MCQS.pdf"