Obtl_bscs Sample.docx

  • Uploaded by: Ferdinand Labarda Marcos
  • 0
  • 0
  • May 2020
  • PDF

This document was uploaded by user and they confirmed that they have the permission to share it. If you are author or own the copyright of this book, please report to us by using this DMCA report form. Report DMCA


Overview

Download & View Obtl_bscs Sample.docx as PDF for free.

More details

  • Words: 2,637
  • Pages: 15
Republic of the Philippines

TARLAC STATE UNIVERSITY VISION Tarlac State University is envisioned to be a premier university in Asia and the Pacific. MISSION Tarlac State University commits to promote and sustain the offering of quality and programs in higher and advanced education ensuring equitable access to education for people empowerment, professional development, and global competitiveness. Towards this end, TSU shall: 1. Provide high quality instruction trough qualified, competent and adequately trained faculty members and support staff. 2. Be a premier research institution by enhancing research undertakings in the fields of technology and sciences and strengthening collaboration with local and international institutions. 3. Be a champion in community development by strengthening partnership with public and private organizations and individuals. CORE VALUES E - xcellence Q – uality U – nity I - ntegrity T – rust in God, Transparency & True Commitment Y – earning for Global Competitiveness

TSU College of Computer Studies OBTL Plan in Operating Systems1 | Page

College/Faculty of College of Computer Studies Department of Computer Science Outcomes-Based Teaching and Learning Plan in Operating System Course Title Credit Units

Operating System 3

Course Description

This course will provide an introduction to operating system design and implementation. The operating system provides a well-known, convenient, and efficient interface between user programs and the bare hardware of the computer on which they run. The operating system is responsible for allowing resources (e.g., disks, networks, and processors) to be shared, providing common services needed by many different programs (e.g., file service, the ability to start or stop processes, and access to the printer), and protecting individual programs from one another.

Course Intended Learning Outcomes (CILO)

Course Code Course Pre-/Corequisites

OS COAL

The course will start with a brief historical perspective of the evolution of operating systems over the last fifty years, and then cover the major components of most operating systems. This discussion will cover the tradeoffs that can be made between performance and functionality during the design and implementation of an operating system. Particular emphasis will be given to three major OS subsystems: process management (processes, threads, CPU scheduling, synchronization, and deadlock), memory management (segmentation, paging, swapping), file systems, and operating system support for distributed systems. After completing this course, STUDENTS MUST HAVE DEMONSTRATEDFAMILIARITY BY: 1. Describe relationships between system services and application software 2. Compare and contrast different design considerations for major OS components.

PROGRAM MAPPING GRID TSU College of Computer Studies OBTL Plan in Operating Systems2 | Page

Courses ASP PROG 1 DISCRETE

Comp. Concepts & Fund. w/ ASP Computer Programming 1 (PLF with Basic C program)

PROG 2

Discrete Structure Computer Programming 2(Advance C)

ECE 1

Fundamentals of Electronics

OOP

Object Oriented Programming

FREE 1 PROG 3

Free Elective 1 Computer Programming 3(C++/Java)

FREE 2

Free Elective 2

CCNA 1

CISCO 1

SOFTENG

Software Engineering

CCNA 2

CISCO 2

CCNA 3

CISCO 3

CCNA 4

CISCO 4

ETHICS

Professional Ethics in IT

FTS

Field Trips & Seminars

FREE 3

Free Elective 3

OJT

Practicum (172 Hours)

DATASTRUCT

Data Structures

DIGDESIGN COAL

Digital Design Computer Organization and Assembly Language

DBS

Database Systems

OS DAA

Operating Systems Design and Analysis of Algorithm

PROG4

Computer Programming 4

WEBPROG ALT

Web Programming Automata and Theory

THESIS 1

Methods of Research

PL

Programming Languages

CS ELECT1

CS Elective 1

Language

Cre 1 1 1 2

PS 1 1 2 2

CT 1 2 2 3

DML 2 3 2 3

Com 2 2 2 2

Col 2 2 1 2

ICT 3 3 2 3

IL 3 3 2 3

Cit 1 1 1 1

LC 2 3 1 3

PSR 1 1 1 1

1 2 1 3 1 1 3 2 3 3 1 1 1 3 3 1 1 2 2 3

2 2 1 3 1 2 2 2 2 2 1 1 1 3 3 1 1 3 1 3

3 3 1 3 1 2 2 2 2 2 2 1 1 3 3 2 2 3 2 3

2 3 1 3 1 2 3 2 2 2 2 1 1 3 3 2 2 3 2 3

1 2 1 2 1 2 3 2 2 2 2 1 2 3 2 2 2 2 2 2

3 1 2 2 2 2 3 3 3 3 1 2 2 3 2 2 2 3 1 2

1 3 1 3 2 3 3 3 3 3 1 1 1 3 3 3 3 3 3 3

2 3 2 2 2 3 3 3 3 3 3 2 2 3 2 2 2 3 2 2

1 1 1 1 1 1 1 1 1 1 2 1 1 3 1 1 1 1 1 1

1 3 1 3 1 2 3 3 3 2 3 1 1 3 3 1 1 3 3 3

1 1 1 1 1 1 1 1 1 1 3 2 1 3 1 1 1 1 1 1

3 3 3 3 3 1

3 3 3 3 3 1

3 3 3 3 3 1

3 3 3 3 3 1

2 2 2 3 2 2

2 2 2 3 2 2

3 3 3 3 3 2

2 2 2 3 2 2

1 1 1 3 1 1

3 3 3 3 3 2

1 1 1 3 1 1

TSU College of Computer Studies OBTL Plan in Operating Systems3 | Page

Codes: 3 To a Large Extent

CS ELECT2

CS Elective 2

THESIS 2

Thesis Writing

CS ELEC 3

CS Elective 3

CS ELEC 4

CS Elective 4

2=To Some Extent

1 3 1 1

1 3 1 1

1 3 1 1

1 3 1 1

2 3 2 2

2 3 2 2

2 3 2 2

2 3 2 2

1 3 1 1

2 3 2 2

1 3 1 1

1= To a little Extent

Legend:(Note: Program Objectives as per CHED Memos shall be corresponded with the listed Graduate Attributes.) Cre Creativity PS Problem Solving CT Critical Thinking DML Decision Making & Learning Com Communication Col Collaboration ICTInformation and Communications Technology IL Information Literacy Cit Citizenship PSR Personal and Social Responsibility

LC Life and Career

COURSE MAPPING GRID Directions: As a department, you are to prepare your course mapping grid that will identify soft skills emphasis in every course in the discipline. In this activity, you are to prioritize the 21st Century skills that you wish to develop in your students as they progress in the course. The level of emphasis may be coded as 3= to a large extent; 2= to some extent; 1to a little extent.

LEARNING UNIT Overview of Operating Systems Process Management CPU Scheduling Deadlocks Memory Management Virtual Memory File-system Interface Codes: 3 To a Large Extent

2=To Some Extent

Cre 1 2 2 2 2 2 2

PS 1 1 1 1 1 1 1

CT 1 2 2 2 2 2 2

DML 1 2 2 2 2 2 2

Com 1 2 2 2 2 2 2

Col 1 1 1 1 1 1 1

ICT 2 2 3 3 3 3 3

IL 1 2 2 2 2 2 2

Cit 1 1 1 1 1 1 1

LC 2 3 3 3 3 3 3

PSR 1 1 1 1 1 1 1

1= To a little Extent

TSU College of Computer Studies OBTL Plan in Operating Systems4 | Page

Legend:(Note: Program Objectives as per CHED Memos shall be corresponded with the listed Graduate Attributes.) Cre Creativity PS Problem Solving CT Critical Thinking DML Decision Making & Learning Com Communication Col Collaboration ICTInformation and Communications Technology IL Information Literacy Cit Citizenship PSR Personal and Social Responsibility

Liminal Period (MIDTERM/FINAL TERM) Week

1&2

Content Standards

Demonstrate familiarity on the history and typical function of Operating Systems and its structure.

LC Life and Career

Unit 1: Essential Learning Declarative Knowledge Functional Knowledge

Overview of Operating Systems



History

Intended Learning Outcomes (ILO)

Recognize the paths took in the past, and have better understanding on both the present and the future by understanding the past of Operating systems.



Functionality of a typical OS

State why operating systems are what they are by how they developed.



OS Structure

Identify operating system interface that users actually see: system calls.

Suggested Teaching/Learning Activities (TLAs) Reading Lecture/discussion/Presentation

Homework, quiz

Assessment Tasks (ATs)

 Recitation  Quiz – Identificati on and Enumerati on  Assignmen t – Define the essential properties of OS types.

TSU College of Computer Studies OBTL Plan in Operating Systems5 | Page

3&4

Demonstrate knowledge on the concepts of process, concurrent execution and management.

Process Management



Process concept

Define the notion of a process – a program in execution, which forms the basis of all computation. Relate the concept as the very heart of modern operating system, as a program in execution and, the unit of work in a modern time-sharing system.



Process synchronization

Show the cases of process synchronization among concurrently executing processes.



Process scheduling

Identify the various features of processes, including scheduling, creation and termination, and communication.

Reading Lecture/discussion Video Presentations

 Recitation  Quiz – Identificati on & Enumerati on

Output: Quiz

Distinguish how processes multiplexed among them by switching the CPU between processes.

TSU College of Computer Studies OBTL Plan in Operating Systems6 | Page

5&6

Demonstrate knowledge about CPU scheduling as the basis of multiprogrammed operating systems.

CPU Scheduling





Basic Concept

CPU scheduling algorithms

To introduce CPU scheduling, which is the basis for multiprogrammed operating systems. To describe various CPUscheduling algorithms. Infer evaluation criteria for selecting a CPUscheduling algorithm for a particular system.

Reading Lecture/discussion Brainstorming/Tutoring

Output: Seatwork, Quiz

 Recitation  Quiz – Identificati on & Problem solving on scheduling algorithm  





Gantt Chart Turna round time Waiti ng time

Seatwork

Problem solving on scheduling algorithm  



Gantt Chart Turna round time Waiti ng time

TSU College of Computer Studies OBTL Plan in Operating Systems7 | Page

7&8

Demonstrate knowledge about deadlock as problem that can only arise in a system with multiple active asynchronous processes.

Deadlocks



Deadlock problem

Summarize a description of deadlocks, which prevent sets of concurrent processes from completing their tasks.



Deadlock characterization

Understand the four necessary conditions for a deadlock



Prevention, Avoidance, Detection and Recovery

Distinguish a number of different methods for preventing or avoiding deadlocks in a computer system.

Reading Lecture/discussion Group discussion Brainstorming/Tutoring

Output: Seatwork, Quiz

 Recitation  Seatwork, Quiz – Problem solving  Ident ify if the syste m is in safe state or unsaf e state using the Bank er’s algor ithm matri x. (need , max, alloc ation, avail

TSU College of Computer Studies OBTL Plan in Operating Systems8 | Page

able)

9

Assessment and Extended Learning Outcome

10& 11

Demonstrate knowledge on memory management strategies.

Module 3 –Memory Management

Midterm Exam 







Background

Provide a detailed description of various ways of organizing memory hardware.

Resident monitor, swapping, partitions, paging, segmentation

To discuss various memory-management techniques, including paging, and segmentation

Fragmentation and compaction

Identify patterns about the difference between internal fragmentation, external fragmentation and, compaction

First-fit, worse-fit, best-fit

Distinguish the most efficient memory management algorithms.

Reading Lecture/discussion Group discussion Brainstorming/Tutoring

Term Exam  Recitation  Quiz/assig nment/ seatwork – Problem solving 

Output: Assignment, Seatwork, Quiz

Given a mem ory partiti on, how woul d each algori thm (firstfit, bestfit, worst -fit )

TSU College of Computer Studies OBTL Plan in Operating Systems9 | Page



make s the most efficie nt use of mem ory. Given the segm ent table, what will be the physi cal addre sses for the logica l addre sses?

TSU College of Computer Studies OBTL Plan in Operating Systems10 | Page

12& 13

Demonstrate knowledge on the concepts on how paging works.

Virtual Memory





Demand paging

Page faults and Page replacement

Relate the hardware support required to support demand paging. Construct situation under which the least frequently used page-algorithm generates fewer page faults.

Reading Lecture/discussion Group discussion Brainstorming/Tutoring

 Recitation  Qui/seatw ork/ assignmen t– Problem solving 

Output: Assignment, Seatwork, Quiz Group Project



Comp ute page faults that occur s for each page replac emen t algori thm given a refere nce string .

Group project 

Devel op a C or

TSU College of Computer Studies OBTL Plan in Operating Systems11 | Page

Java progr am that imple ment s the FIFO and LRU page replac emen t algori thms to be submi tted on the last day of our meeti ng befor e the final term exam.

TSU College of Computer Studies OBTL Plan in Operating Systems12 | Page

14& 15

Demonstrate knowledge on the various methods for storing information on secondary storage.

File System Interface



Distinguish the function of file systems.



Device directory

Describe the interfaces to file systems.



Files system design and access methods

Show file-system design tradeoffs, including access methods, file sharing, file locking, and directory structures.

File system protection

Identify file-system protection.

 16 - 18

File systems operation

Assessment and Extended Learning Outcome

Reading Lecture/discussion Group discussion

 Recitation  Quiz – Identificati on and Enumerati on

Output: Seatwork, Quiz

Final Term Exam

Term Exam

Progressive Learning

Basic Readings

Extended Readings

Operating System Concepts 9th Edition Abraham Silberschatz

http://www.tutorialspoint.com/operating_system/ TSU College of Computer Studies OBTL Plan in Operating Systems13 | Page

Course Assessment

Cognitive/Psychomotor: Assignments & Seatworks Quizzes Written Exam Case studies Total:

Affective: 10 % 20 % 40 % 15 %

Attendance & conduct Class Participation 5%

10 %

100%

Credit Grade = (Midterm Grade + Final Term Grade)/2

Course Policies

All students who are enrolled in this course should conform to the following class policies. 1. 2. 3. 4.

The university rule on a 54-hour attendance applies: 20% absence is considered failed or dropped, as the case may be. Students are encouraged to use resources of other libraries, etc. in the absence of sufficient references in the University Library. There will be no make-up arrangements for oral presentation, hence, the professor lectures in the absence of the discussion. Those that cannot come on the examination day are advised to take the test on the day prior to the schedule.

Late Policies This course covers a lot of material and late assignments will seriously impact your ability to learn the next section of the course. Late programming assignments will be penalized 10% per day, up to 4 days. Late homeworks will not be accepted (no exceptions). Please try to finish your assignments and homeworks on time. Cooperation and Cheating Feel free to discuss homework and labs with other members of the class, or myself. However, do not look at or copy another student’s solution to a homework or lab. I am not concerned with how you come to understand the problem and how to solve it, but once you have the background necessary to solve it, you must provide your own solution. Exchanging homework or lab solutions is cheating and will be reported to the University,

TSU College of Computer Studies OBTL Plan in Operating Systems14 | Page

and you will lose credit for the course. Cheating will not be tolerated. A student found cheating on an exam will receive an automatic grade of 5.0 on the exam, and likely will fail the course as well.

Committee Members

Cluster Leader: Members:

Consultation Schedule

Faculty Member : Nicolas Z. Diaz, Jr. Email-address : [email protected] Consultation Hours: 2.5 Time and Venue :

Course Title

AY/Term of Effectively

Prepared by

Recommending Approval

Pages:

ROGEL T. QUILALA Department Chair

Operating System

1st Semester Curriculum 2009

Engr. MARLON V. GAMIDO

NICOLAS Z. DIAZ, JR.

Dean

Approved

DR. LOLITA V. SICAT Vice President for Academic Affairs

TSU College of Computer Studies OBTL Plan in Operating Systems15 | Page

More Documents from "Ferdinand Labarda Marcos"

3d.docx
April 2020 1
3d_act.docx
April 2020 1
Obtl_bscs Sample.docx
April 2020 1
Schematic Jvc Av21at
December 2019 20
Pvc-2.pdf
October 2019 33