Computer Science | Practice Questions 01
Q1. Which of the following algorithm is used to solve the all-pair shortest path problem ? [RRB JE IT 2019] (a) Floyd- Warshall ’s algorithm (b) Dijkstra’s algorithm (c) Bellman-Ford’s algorithm (d) Prim’s algorithm
Q2. ___________ model couples the iterative nature of the prototyping with the controlled and systematic aspects of the linear sequential model. (a) Rapid Application Development (RAD) (b) Spiral Model (c) Incremental Development (d) Iterative Development
Q3. In E-R Diagram, derived attributes are represented by – (a) Diamond (b) Dashed oval (c) Double oval (d) Rectangle
Q4. Which of the following statements is/are TRUE ? (i) LED devices are emissive display devices. (ii) Emissive display devices can convert electrical energy into light. (a) Only (i) (b) Only (ii) (c) Both (i) and (ii) (c) Neither (i) nor (ii)
Q5. In Assembly language which field may be empty ? (a) Label field & Instruction field (b) Instruction field & comment field (c) Label field & comment field (d) None of the above
Q6. Each instruction in an assembly language program has the following fields. 1. Label field 2. Mnemonic field 3. Operand field 4. Comment field. What is the correct sequence of these fields ? (a) 1, 2, 3 and 4 (b) 2, 1, 4 and 3 (c) 1, 3, 2 and 4 (d) 2, 4, 1 and 3
Q7. Which register holds the operand read from memory ? (a) Accumulator Register (b) Instruction Register (c) Data Register (d) None of the above
Q8. Which register holds the operand read from memory ? (a) Accumulator Register (b) Instruction Register (c) Data Register (d) None of the above
Q9. The final code after encoding data bits 1101 into 7-bit even parity Hamming Code is – (a) 1110101 (b) 1011101 (c) 1010101 (d) 0110101
Q10. Which CPU scheduling algorithm is used in Time Sharing Operating System ? (a) First Come First Serve (b) Shortest Job First (c) Round Robin Scheduling (d) None of the above
Q11. In Basic Computer which register’s size is 16 bits ? (i) DR (ii) AR (iii) AC (iv) PC (a) (i) & (ii) (b) (i) & (iv) (c) (ii) & (iii) (d) (i) & (iii)
Answer : 1 (d), 2 (b), 3 (c), 4 (c), 5 (c), 6 (a), 7 (c), 8 (c), 9 (c), 10 (c), 11 (d)
Detailed Explanation Please visit Our YouTube Channel @ODEAcademy 🚀
Explanation :
Computer Science | Quiz
Q. In _______, there is an inefficient use of memory due to internal fragmentation. [SSC Scientific Assistant Computer Science 2017] (a) Fixed partitioning (b) Simple Paging (c) Virtual memory paging (d) Simple segmentation
Fixed Partitioning : It is a contiguous allocation scheme which results in unequal partitions of the memory, hence, resulting in inefficient use of memory due to internal fragmentation. Simple Paging : Paging is a non-contiguous memory allocation technique. The problem of page faults occurs in paging. Virtual Memory Paging : It is a storage allocation scheme in which secondary memory can be addressed as though it were part of the main memory. Simple Segmentation : It is a memory management technique in which the memory is divided into variable size parts.
Q. Write Through technique is used in which memory for updating the data ? [SSC Scientific Assistant Computer Science Official 2017] (a) Virtual memory (b) Main memory (c) Auxiliary memory (d) Cache memory
Q. Page information in memory is also called as Page Table. The essential contents in each entry of a page table is/are. [UGC NET 2018] (a) Page Access information (b) Virtual Page number (c) Page Frame number (d) Both virtual page number and Page Frame Number
Q. An Address in main memory is called : [UGC NET Computer Science 2023] (a) Virtual address (b) Memory address (c) Logical address (d) Physical address
Virtual address: This term is used in a system that uses virtual memory, where the memory management unit (MMU) and the operating system work together to give each process the illusion that it is the only process running on the computer. Each process has its own set of virtual address spaces, which the MMU translates into actual physical addresses. Virtual addresses help in the abstraction of the memory implementation, making programming easier.
Q. The memory management technique that used RAM and hard disk space to provide dedicated memory space for each program is known as [ECGC PO 2022] (a) Cache memory (b) Virtual memory (c) Read only memory (d) Flash memory
Q. Size of virtual memory depends on [UPSSSC JE 2015] (a) Address line (b) Data Base (c) Disc Space (d) All the above
Q. The memory management function of virtual memory includes 1. Space allocation 2. Program relocation 3. Program execution 4. Code sharing [ESE Electrical 2019] (a) 1, 2 and 3 only (b) 1, 2 and 4 only (c) 1, 3 and 4 only (d) 2, 3 and 4 only
Q. ________ actually separates the logical memory as perceived by users from physical memory on a computer. [OSSC BSSO 2022] (a) Primary Memory (b) Virtual Memory (c) Memory Cache (d) Kernel Memory
Virtual Memory- Virtual memory is a common technique used in a computer’s operating system (OS). Virtual memory uses both hardware and software to enable a computer to compensate for physical memory shortages, temporarily transferring data from random access memory (RAM) to disk storage. Primary Memory – Primary storage is the component of the computer that holds data, programs, and instructions that are currently in use. Primary memory is also known as the main memory. Cache memory – It is a high-speed memory, which is small in size but faster than the main memory (RAM). The CPU can access it more quickly than the primary memory. It acts as a temporary storage area.
Q. Which of the following(s) are main memory? (A) Virtual memory (B) Cache memory (C) RAM (D) SSD Choose the correct answer from the options given below: This question was previously asked in UGC NET Computer Science (Paper 2) 07 Dec 2023 Official Paper View all UGC NET Papers > (A) and (C) Only (B) and (C) Only (C) and (D) Only (A), (B) and (C) Only
Cache Memory: Cache memory is a type of computer memory that is very fast compared to regular RAM and is situated on the processor chip. After the processor reads from the main memory for the first time, it stores a copy of the data in the cache. If the same data is needed again, it can be rapidly accessed from the cache. This improves the performance and speed of the computer. (C) RAM (Random Access Memory): RAM is a type of computer memory that can be accessed randomly; that is, any byte of memory can be accessed without touching the preceding bytes. RAM serves as the computer’s “working” memory. It provides space for your computer to read and write data to be accessed by the CPU (central processing unit). When you shut your computer off, everything stored in RAM is lost. Additional Information (A) Virtual Memory: Virtual memory is a memory management capability of an operating system (OS) that uses hardware and software to allow a computer to compensate for physical memory shortages by temporarily transferring data from random access memory (RAM) to disk storage. This process is done automatically and is completely transparent to the user.
Q. Increasing the RAM of a computer typically improves performance because This question was previously asked in ISRO Scientist CS 2015 Official Paper View all ISRO Scientist CS Papers > Virtual memory increase Larger RAMs are faster Fewer page faults occur Fewer segmentation fault occurs
Q. ______ helps the computer’s operating system in pretending that it have more RAM than it actually has. This question was previously asked in JKSSB Finance Sub-Inspector Official Paper 2 (Held On : 1 April 2021 Shift 1) View all JKSSB SI Commercial Taxes Papers > Primary memory Flash memory Real memory Swap memory
Swap Memory helps the computer’s operating system in pretending that it has more RAM than it actually has. Key Points Memory swapping is a memory reclamation method wherein memory contents not currently in use are swapped to a disk to make the memory available for other applications or processes. The exact state or “page” of memory is copied to the disk to make the data contiguous and easy to restore later. Enables an operating system to provide more memory to a running application or process than is available in physical random access memory (RAM). When the physical system memory is exhausted, the operating system can opt to make use of memory swapping techniques to get additional memory. Additional Information Memory swapping works by making use of virtual memory and storage space in an approach that provides additional resources when required. In short, this additional memory enables the computer to run faster and crunch data better. Swapping is often enabled by default, though users can choose to disable the capability.
Q. Memory used by your PC’s video system is known as This question was previously asked in HSSC Female Police Constable Official Paper (Held on: 18 Sept 2021 Shift 2) View all HSSC Haryana Police Constable Papers > Cache Memory Video Memory Virtual Memory Flash Memory
Memory used by your PC’s video system is known as video memory. VRAM (video RAM) refers to any type of random access memory (RAM) specifically used to store image data for a computer display. VRAM’s purpose is to ensure the even and smooth execution of graphics display. It is most important in applications that display complex image textures or render polygon-based three-dimensional (3D) structures. People commonly use VRAM for applications such as video games or 3D graphic design programs.
Q. The mechanism that brings a page into memory only when it is needed is called _______. This question was previously asked in KVS PGT CS 2017 Official Paper View all KVS Papers > segmentation Demand paging Fragmentation Page replacement
Q. Thrashing This question was previously asked in SSC Scientific Assistant Computer Science Official Paper (Held On: 25 November 2017 Shift 1) View all SSC Scientific Assistant Papers > is a natural consequence of virtual memory systems can always be avoided by swapping always occurs on large computers None of these
Thrashing: Thrashing is a condition or circumstance in which the system spends a significant percentage of its time servicing page faults, while the actual processing done is little. Thrashing has an effect on the performance of the operating system’s execution. Thrashing also has a negative impact on the operating system’s performance. When the CPU is underutilised, the process scheduling system attempts to load numerous processes into memory at the same time, hence raising the degree of Multiprogramming. Explanation: Thrashing happens when a computer’s virtual memory resources become saturated, resulting in a persistent state of paging that prevents the most application-level activity from taking place. Thrashing is a phenomenon in virtual memory schemes when the processor spends most of its time swapping pages, rather than executing instructions. Thrashing can not always occur on large computers.
Q. Which algorithm in a computer Operating System uses paging for memory management? This question was previously asked in RRB Officer Scale-I Mains 1 October 2022 Memory Based Paper View all RRB Officer Scale – I Papers > Page Replacement Priority scheduling Page Management First Come First Serve
In a computer operating system that uses paging for virtual memory management, page replacement algorithms decide which memory pages to page out, sometimes called swap out, or write to disk, when a page of memory needs to be allocated. Page replacement happens when a requested page is not in memory (page fault) and a free page cannot be used to satisfy the allocation, either because there are none, or because the number of free pages is lower than some threshold. When the page that was selected for replacement and paged out is referenced again it has to be paged in (read in from disk), and this involves waiting for I/O completion. This determines the quality of the page replacement algorithm: the less time waiting for page-ins, the better the algorithm.
Q. Among all memory management techniques ______ is simple to implement little operating system overhead. This question was previously asked in SSC Scientific Assistant Computer Science Official Paper (Held On: 24 November 2017 Shift 2) View all SSC Scientific Assistant Papers > Fixed partitioning Simple Paging Virtual memory paging Simple segmentation
Q. _________ is a memory management scheme that permits the physical address space of a process to be noncontiguous. This question was previously asked in RRB JE ME CBT 2 Previous Paper 1: Held on 29 Aug 2019 View all RRB JE Papers > Segmentation Paging Fragmentation Swapping
Paging Paging is a memory management scheme by which a computer stores and retrieves data from secondary storage for use in the main memory. In this scheme, the operating system retrieves data from secondary storage in same-size blocks called pages. Paging is an important part of virtual memory implementations in modern operating systems, using secondary storage to let programs exceed the size of available physical memory. Segmentation Segmentation is a memory – management scheme that supports the user view of memory. A logical address space is a collection of segments. Each segment has a name and a length. The addresses specify both the segment name and the offset within the segment. The user, therefore, specifies each address. Fragmentation Fragmentation is done at routers which makes them complex to implement when routers take too much time to fragment packets. This may lead to a DOS attack on other packets. Swapping The medium-term scheduler reduces the degree of multiprogramming. Some processes are removed from memory to reduce multiprogramming. Later, the process can be reintroduced into memory, and its execution can be continued where it left off. This scheme is called swapping. The long-term scheduler, or job scheduler, selects processes from a mass-storage device and loads them into memory for execution. The short-term scheduler, or CPU scheduler, selects from among the processes that are ready to execute and allocates the CPU to one of them.
Q. The memory management scheme that permits the physical address space of a process to non-contiguous space is called This question was previously asked in UKPSC AE General Studies 2013 Official Paper View all UKPSC AE Papers > Paging Spooling Swapping None of the above
Paging Paging is a memory management scheme by which a computer stores and retrieves data from secondary storage for use in the main memory. In this scheme, the operating system retrieves data from secondary storage in same-size blocks called pages. Paging is an important part of virtual memory implementations in modern operating systems, using secondary storage to let programs exceed the size of available physical memory. Additional Information Swapping The medium-term scheduler reduces the degree of multiprogramming. Some processes are removed from memory to reduce multiprogramming. Later, the process can be reintroduced into memory, and its execution can be continued where it left off. This scheme is called swapping. The long-term scheduler, or job scheduler, selects processes from a mass-storage device and loads them into memory for execution. The short-term scheduler, or CPU scheduler, selects from among the processes that are ready to execute and allocates the CPU to one of them.
Q.