hamburger menu
All Coursesall course arrow
adda247
reward-icon
adda247
    arrow
    arrow
    arrow
    Consider the following: Which of the following is correct matching?
    Question

    Match the columns.

    Consider the following:

    Which of the following is correct matching?

    A.

    A-III, B-II, C-IV, D-I

    B.

    A-II, B-III, C-IV, D-I

    C.

    A-III B-II, C-I, D-IV

    D.

    A-II, B-III, C-I, D-IV

    Correct option is A


    The correct matching of the given algorithms and their applications is as follows:
    1. Stack Algorithm: It is associated with Page Replacement. The Stack Algorithm is used in memory management systems to determine which page to replace when a page fault occurs.
    2. Elevator Algorithm: This is related to Disk Scheduling. The Elevator Algorithm optimizes the movement of the read/write head on a disk drive, mimicking the behavior of an elevator.
    3. Priority Scheduling Algorithm: It is a method of CPU Scheduling. In this algorithm, processes are assigned priorities, and the process with the highest priority is executed first.
    4. Havender’s Algorithm: It is associated with Deadlock prevention or avoidance. Havender’s Algorithm provides methods for ensuring that a system does not enter a deadlock state.
    Thus, the matching aligns with (a) A-III, B-II, C-IV, D-I.
    Information Booster:
    1. Stack Algorithm:
    · A page replacement algorithm often used in operating systems.
    · Determines the least recently used (LRU) or optimal page replacement.
    · Common in scenarios requiring efficient memory management.
    2. Elevator Algorithm:
    · Also known as SCAN Algorithm.
    · Moves the disk arm back and forth, serving requests in the direction of the current movement.
    · Reduces the seek time for disk scheduling.
    3. Priority Scheduling Algorithm:
    · A preemptive or non-preemptive scheduling algorithm.
    · Can lead to starvation, which can be mitigated using aging.
    4. Havender’s Algorithm:
    · Addresses circular wait conditions in deadlocks.
    · Implements resource allocation graphs to avoid cyclic dependencies.
    Additional Knowledge:
    · Page Replacement:
    · Algorithms like FIFO, LRU, and Optimal fall under this category.
    · Helps in determining which memory page to swap out during a page fault.
    · Disk Scheduling: Includes other algorithms like FCFS, SSTF, and C-SCAN.
    · CPU Scheduling: Includes algorithms like Round Robin, SJF, and Multilevel Queue Scheduling.
    · Deadlock Avoidance: Techniques include Banker’s Algorithm and safe state checks.

    Free Tests

    Free
    Must Attempt

    Basics of Education: Pedagogy, Andragogy, and Hutagogy

    languageIcon English
    • pdpQsnIcon10 Questions
    • pdpsheetsIcon20 Marks
    • timerIcon12 Mins
    languageIcon English
    Free
    Must Attempt

    UGC NET Paper 1 Mock Test 1

    languageIcon English
    • pdpQsnIcon50 Questions
    • pdpsheetsIcon100 Marks
    • timerIcon60 Mins
    languageIcon English
    Free
    Must Attempt

    Basics of Education: Pedagogy, Andragogy, and Hutagogy

    languageIcon English
    • pdpQsnIcon10 Questions
    • pdpsheetsIcon20 Marks
    • timerIcon12 Mins
    languageIcon English
    test-prime-package

    Access ‘UGC NET Computer Science’ Mock Tests with

    • 60000+ Mocks and Previous Year Papers
    • Unlimited Re-Attempts
    • Personalised Report Card
    • 500% Refund on Final Selection
    • Largest Community
    students-icon
    354k+ students have already unlocked exclusive benefits with Test Prime!
    Our Plans
    Monthsup-arrow