X hits on this document

79 views

0 shares

0 downloads

0 comments

5 / 27

Practical Examination: The Practical Examination shall consist of writing and performing an experiment / assignment and oral based on the syllabus as per the journal record. Duration of examination is three hours.

Suggestive list of Experiments:

  • 1.

    Introduction to DBMS

  • 2.

    To create table , alter table & delete table(DDL)

  • 3.

    To study SELECT command

  • 4.

    To insert , delete & update operations on table( DML)

  • 5.

    To study different types of sub queries

  • 6.

    To study referential integrity constraints

  • 7.

    To study other constraints

  • 8.

    To study joins

  • 9.

    To study views

  • 10.

    To study trigger

Title of the Subject: Operating System Course Code: MCA 203

Teaching Scheme: Lectures: 4 Hrs/Week Practical : 2 Hrs/Week

Examination Scheme: Theory Paper: 100 Marks (3 Hrs) Practical Exam: 25 Marks Term Work: 25 Marks

Objectives:

  • To provide the students complete knowledge of Operating Systems principles.

  • To have a clear understanding of OS design methodologies adapted by designers

Contents:

Unit 1:

(8 hrs)

Introduction: Introduction to OS, OS as extended machine, OS as resource manager, History

of OS:-first to fourth generation (simple batch system, time - sharing

systems, Real-time systems,

parallel systems, distributed system), OS concepts (Process, Files, Shell), System calls. Process Management: The process model, process states, PCB (process control block), Threads Process Synchronization: Intercrosses communication (IPC), race condition, critical sections, mutual exclusion

with

busy

waiting, sleep & problems: Dining

wake-up, semaphores, event counters, monitors, message philosophers problem, Readers & Writers problems.

passing,

classical

IPC

Unit 2: Process scheduling:

(8 hrs)

Round Robin scheduling, priority scheduling, multiple queues, shortest job first, policy driven scheduling, two level scheduling Memory management: Memory management without swapping or paging, use of multiprogramming. Swapping: Multiprogramming with fixed and variable partitions, memory management with bitmaps, linked lists and buddy system. Allocation of swap space, Virtual Memory: Paging, segmentation.

Document info
Document views79
Page views79
Page last viewedTue Dec 06 11:37:55 UTC 2016
Pages27
Paragraphs1177
Words8520

Comments