Scribd Logo
Upload

Welcome to Scribd!

  • 27 views

    Bachelor of Science (B.SC.) Semester-III (C.B.S.) Examination COMPUTER SCIENCE (Operating Systems) Paper-II

    Uploaded by

    toby wayn
    The document is an exam for a Computer Science course on Operating Systems. It contains 5 sections with options to answer parts A, B, C, and D in each section. Section 1 covers concurrent processes, threads, round robin algorithm, and operating system structure. Section 2 covers conditions for deadlock, mutual exclusion, hold and wait conditions, and queuing analysis. Section 3 covers dynamic loading and linking, segmentation with paging, multiple partition memory management, and swapping. Section 4 covers I/O devices, I/O buffering including circular buffering, file allocation methods, and user authentication. Section 5 covers the differences between processes and programs, circular wait with an example, logical addresses, and secret key cryptography.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Bachelor of Science (B.SC.) Semester-III (C.B.S.) Examination COMPUTER SCIENCE (Operating Systems) Paper-II

    Uploaded by

    toby wayn
    27 views2 pages
    The document is an exam for a Computer Science course on Operating Systems. It contains 5 sections with options to answer parts A, B, C, and D in each section. Section 1 covers concurrent processes, threads, round robin algorithm, and operating system structure. Section 2 covers conditions for deadlock, mutual exclusion, hold and wait conditions, and queuing analysis. Section 3 covers dynamic loading and linking, segmentation with paging, multiple partition memory management, and swapping. Section 4 covers I/O devices, I/O buffering including circular buffering, file allocation methods, and user authentication. Section 5 covers the differences between processes and programs, circular wait with an example, logical addresses, and secret key cryptography.

    Original Description:

    ggg

    Original Title

    cs 1 s16(1)

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document is an exam for a Computer Science course on Operating Systems. It contains 5 sections with options to answer parts A, B, C, and D in each section. Section 1 covers concurrent processes, threads, round robin algorithm, and operating system structure. Section 2 covers conditions for deadlock, mutual exclusion, hold and wait conditions, and queuing analysis. Section 3 covers dynamic loading and linking, segmentation with paging, multiple partition memory management, and swapping. Section 4 covers I/O devices, I/O buffering including circular buffering, file allocation methods, and user authentication. Section 5 covers the differences between processes and programs, circular wait with an example, logical addresses, and secret key cryptography.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    27 views2 pages

    Bachelor of Science (B.SC.) Semester-III (C.B.S.) Examination COMPUTER SCIENCE (Operating Systems) Paper-II

    Uploaded by

    toby wayn
    The document is an exam for a Computer Science course on Operating Systems. It contains 5 sections with options to answer parts A, B, C, and D in each section. Section 1 covers concurrent processes, threads, round robin algorithm, and operating system structure. Section 2 covers conditions for deadlock, mutual exclusion, hold and wait conditions, and queuing analysis. Section 3 covers dynamic loading and linking, segmentation with paging, multiple partition memory management, and swapping. Section 4 covers I/O devices, I/O buffering including circular buffering, file allocation methods, and user authentication. Section 5 covers the differences between processes and programs, circular wait with an example, logical addresses, and secret key cryptography.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 2

    KNT/KW/16/5131

    Bachelor of Science (B.Sc.) Semester—III (C.B.S.) Examination

    COMPUTER SCIENCE (Operating Systems)

    Paper—II

    Time : Three Hours] [Maximum Marks : 50

    N.B. :— (1) ALL questions are compulsory and carry equal marks.

    (2) Illustrate your answers with suitable examples and diagrams wherever necessary.

    EITHER

    1. (A) Explain the concept of Concurrent Process. 5

    (B) What is the difference between Process and Thread ? 5

    OR

    (C) Explain Round Robin algorithm in brief. 5

    (D) Explain the structure of Operating System. 5

    EITHER

    2. (A) What are the conditions for deadlock ? 5

    (B) Explain Mutual exclusion in detail. 5

    OR

    (C) Explain Hold and Wait Condition in brief. 5

    (D) Explain Queuing Analysis. 5

    EITHER

    3. (A) Explain the concept of dynamic loading and dynamic linking. 5

    (B) Explain the concept of segmentation with paging. 5

    OR

    (C) Explain the method of multiple partition memory management. 5

    (D) Explain the term swapping. 5


    NVM—8002 (Contd.)

    rtmnuonline.com
    EITHER

    4. (A) Explain different aspects of I/O devices. 5

    (B) What is I/O buffering ? Explain circular buffering in brief. 5

    OR

    (C) Explain File Allocation Method in brief. 5

    (D) Explain the term user authentication. 5

    EITHER

    5. (A) What is the difference between process and program ? 2½

    (B) Explain circular wait with example. 2½

    (C) What do you mean by logical address ? 2½

    (D) Explain the term secret key cryptography. 2½

    NVM—8002 KNT/KW/16/5131

    rtmnuonline.com

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy