DCT1063 PROGRAMMING2

DCT1063 PROGRAMMING2 

2012/2013 Semester 2

Course Plan

Note
Chapter 1 - Pointer
Chapter 2 - Managing Memory
Chapter 3 - File Input and File Output
Chapter 4 - String
Chapter 5 - Advanced Data Types

Slide
Chapter 1 Pointer
Chapter 2 Managing Memory
Chapter 3 File Input and File Output
Chapter 4 String
Chapter 5 Advanced Data Type

Lab
Chapter 1 - Pointer
Chapter 2 - Managing Memory
Chapter 3 - File Input and File Output
Chapter 4 - String
Chapter 5 - Advanced Data Types

BCS1333 OS Chapter 10

Name:_______________________

Matric:______________________

True False.

CHAPTER 10

10.0 Introduction

1. Main Memory is usually to small to accommodate all the data and programs, therefor secondary memory is needed (   ).

2. Modern computer systems use tape as the primary storage medium for programs and data.(   ).

3. A file is a collection of related information defined by its creator.(    )

4. The file system consists of two distinct parts: files and directory. (   )

10.1 File concept

5. Most of storage (secondary)  are usually volatile (    )

6. A text file is a sequence pg byte organized into lines and pages. (    )

7. One of a file attributes is date and time (   )

10.1.2 File Operations

8. One of the common file operations is Creating a File. (   )

9.  The operating system did not keep track on which file is open (   )

10. The implementation of open( ) and close() operations is less complicated in an environment.(   )

* pls submit on 28 april 2013 (sunday)

BCS1333 OS: Maklumat Test 1

 Tarikh : 21 /4/2013
Masa : 8:30 am
Topik : Chapter 1 hingga Chapter 3
Bentuk soalan: 


Chapter 1
What is the purpose of an operating system?
A computer system can be diveded roughlt into four components: the hardware, the operating system, the application program and the users. Briefly explain each of them.
Briefly explain the process of booting. (5 marks)
Multiprocesser systema are most common nowdays, explain three main advantages of a Multiprocessor Systems.

Explain asymmetric multiprocessing and symmetric multiprocessing in multiple-processor systems.

Chapter 2

What is the purposes of Operating System Services?
What is System Calls?
There are five major categories of System Calls. Briefly explain each of them.
Explain the concepts of Virtual Machines.
What is the relationship between a quest operating system and a host operating system in a system kernel like VMware?

Chapter 3

What is process?
Explain the five  (5) types of process states.
Each process is represented in the operating system ba a process control block (PCB). PCB contains many pieces of information. What are  the information stored in PCB. Explain each of them.
What is long-term-scheduler (also called job schedular) and what os short-term-schedular (also called CPU schedular).

BCS1333 OS :Chapter 7 Deadlocks

1.)    What is deadlock?
2.)    Draw four (4) symbols used in Resources-Allocation Graph as follows.

I ) Process
II) Resources Type with three instances
III) Pi requests instances of Rj
IV) Pi is holding an instances of Rj
 
3.)    Draw resources-allocation graph for the following situation.
 The sets P,R and E:
•    P = {P1,P2,P3}
•    R= {R1,R2,R3,R4}
•    E = {P1->R1, P2->R3,R1->P2, R2->P2, R2->P1, R3->P3}
Resources Instances:
•    One instance of resources type R1
•    Two instancesof resources type R2
•    One instance of resources type R3
•    Three instance of resources type R4

BCS1333 OS : Assignment 2

CHAPTER 3

1 Explain short-term and long-term scheduling and describe the differences among them.
Describe the actions taken by a kernel to context-switch between processes.


CHAPTER 5

2. Why is it important for the scheduler to distinguish I/O-bound programs from CPU-bound programs?

3. Discuss how the following pairs of scheduling criteria conflict in certain
settings.
a. CPU utilization and response time
b. Average turnaround time and maximum waiting time
c. I/O device utilization and CPU utilization

4. Consider the following set of processes, with the length of the CPU-burst time given in milliseconds:
Process        Burst Time            Priority
P1                    10                        3
P2                     1                         1
P3                     2                         3
P4                     1                         4
P5                     5                         2


a) Draw four Gantt charts illustrating the execution of these processes
using FCFS, SJF, a nonpreemptive priority (a smaller priority
number implies a higher priority), and RR (quantum = 1)
scheduling.


b) What is the average waiting time  for each of the scheduling
algorithms in part a?


c) Which of the schedules in part a results in the minimal average
waiting time (over all processes)?

BCS1243 PP : Chapter 5 Method Lab 3 April 2013