CD/JUL 2024/CSC207/204

\si^

UNIVERSITI TEKNOLOGI MARA

FINAL EXAMINATION

COURSE FUNDAMENTALS OF OPERATING SYSTEMS /

PRACTICAL APPROACH OF OPERATING
SYSTEMS
COURSE CODE CSC207/204
EXAMINATION JULY 2024
TIME 3 HOURS

INSTRUCTIONS TO CANDIDATES

1. This question paper consists of two (2) parts: PART A (20 Questions)
PART B (7 Questions)

2. Answer ALL questions from all two (2) parts:

i. Answer PART A and PART B in the Answer Booklet. Start each answer on a new page.

3. Do not bring any material into the examination room unless permission is given by the invigilator.

4. Please check to make sure that this examination pack consists of:

i. the Question Paper

ii. an Answer Booklet - provided by the Faculty

5. Answer ALL questions in English.

DO NOT TURN THIS PAGE UNTIL YOU ARE TOLD TO DO SO

This examination paper consists of 11 printed pages

© Hak Cipta Universiti Teknologi MARA

 2 CD/JUL 2024/CSC207/204

PART A
Answer all questions.

QUESTION 1 CP7
The deadlock in a computer system will NOT happen when one of the following conditions
failed to hold simultaneously
A Mutual exclusion
B Circular wait
C Preemption
D Hold and wait
(2 marks)

QUESTION 2
CP7
Which of the method can be used in a computer system that will never enter a deadlock state?
A Deadlock detection
B Deadlock recovery
C Deadlock avoidance
D Deadlock algorithm
(2 marks)

QUESTION 3

Which of the following is the address generated by CPU?

A Physical address
B Logical address.
C Absolute address.
D Base address.
(2 marks)

QUESTION 4

When memory is divided into several fixed size partitions, each partition may contain:
A exactly one process.
B at least one process.
C multiple processes at once.
D different processes at once.
(2 marks)

© Hak Cipta Universiti Teknologi MARA

 3 CD/JUL 2024/CSC207/204

QUESTION 5

In fixed size partition, the degree of multiprogramming is bounded by .

A the number of partitions
B the CPU utilization
C the number of users
D the memory size
(2 marks)

QUESTION 6

In contiguous memory allocation .

A the memory space is contiguous
B all processes are contained in a single contiguous section of memory
C each process is contained in a single contiguous section of memory.
D the operating system is contiguously allocated
(2 marks)

QUESTION 7

Because of virtual memory, the memory can be shared among .

A processes
B threads
C instructions
D users
(2 marks)

QUESTION 8

Effective access time for memory management is directly proportional to .

A page fault rate.
B hit ratio
C memory access time
D swapping
(2 marks)

© Hak Cipta Universiti Teknologi MARA

 4 CD/JUL 2024/CSC207/204

QUESTION 9
In paged memory systems, if the page size is increased, then the internal fragmentation
generally .
A become less
B become more
C not affected
D remain constant
(2 marks)

QUESTION 10

In FIFO page replacement algorithm, when a page must be replaced .

A oldest page is chosen
B newest page is chosen
C random page is chosen
D last page is chosen
(2 marks)

QUESTION 11

Which of the following is the CORRECT sequence for file allocation process in file systems?

. activates appropriate secondary storage

i. update file tables
ii. load file into memory
v. notify processes involved
A
B
C
D n, in, iv
(2 marks)

QUESTION 12

In a tree-structured directory, the series of directory names that arranges in a file name is
referred to as the .
A working directory
B pathname
C symbolic name
D file systems
(2 marks)

) Hak Cipta Universiti Teknologi MARA

 5 CD/JUL 2024/CSC207/204

QUESTION 13

Which of the following statements is FALSE regarding the directory:

A A single-level directory has naming and grouping problems
B A two-level directory enables same file name for different user
C A three-level directory provides efficient searching
D An acyclic directory does not share subdirectories and files
(2 marks)

QUESTION 14

Choose a FALSE statement regarding file or directory protection in file systems.

A the protection is meant for what can be done and by whom
B Access Control Matrix is difficult to implement as compared to Access Control List
C execute, read, write, delete access is types of the control for the file and directory
protection
D which users is allowed to access each file is outline in Access Control List
(2 marks)

QUESTION 15

The technique of free disk space management that employs a pointer from the current free
block to the next free block is the .
A linked list of free blocks
B bit map
C free blocking
D swapping
(2 marks)

QUESTION 16

The following are major methods of allocating disk space EXCEPT:

A contiguous
B first fit
C linked
D indexed
(2 marks)

© Hak Cipta Universiti Teknologi MARA

 6 CD/JUL 2024/CSC207/204

QUESTION 17
The following are problems for contiguous allocation EXCEPT:
A finding space for file
B knowing file size
C need for compaction
D no fragmentation
(2 marks)

QUESTION 18

Based on the linked allocation diagram below, which statement is FALSE.

^N directory
file start end
jeep 25
oD i D 2D 3D

4Q !£] 6 p ?D

12p^3Dl4JUl5Q
i6Qi7Di8Di«D
2C>r]2lLfc2D23Q

24 025LJ26027[j
>l 12

280290300310

A Each block contains pointer to next block

B Locating a block can take many l/O's and disk seeks
C Very reliable even if one of the pointers get corrupted.
D Improve efficiency by clustering blocks into groups but increase internal fragmentation.
(2 marks)

© Hak Cipta Universiti Teknologi MARA

 7 CD/JUL 2024/CSC207/204

QUESTION 19

Choose the FALSE statement regarding password in system authentication:

A Multi factors authentication usually requires only a single factor for access control
B Physical attributes like fingerprint, palm and face are part of biometric authentication
C Generation of one-time password is done frequently to make sure a new password is
always updated
D Password must be stored in encrypted format
(2 marks)

QUESTION 20
Code fragment that is embedded in legitimate program to infect our systems is called a

A Worm
B Trap door
C Virus
D Trojan horse
(2 marks)

© Hak Cipta Universiti Teknologi MARA

 8 CD/JUL 2024/CSC207/204

PARTB
Answer all questions.
CP7

QUESTION 1

You are given the following set of edges that consists of request and assignment edges.
Answer the following questions.

E • {Pi ->Ri, R2 -> Pi, P2 -> Rs, Ri-> P2, R2 -> P2, P3 ->R2, R3 -> P3)

a) Draw the complete Resource-Allocation Graph (RAG). Label all components clearly
including the symbol' • ' to represent an instance.
(5 marks)

b) Supposed that P, --> R, are claim edges. Convert the RAG to a corresponding wait-for
graph, and define the existence of deadlock state.
(3 marks)

QUESTION 2 CP 8

Tables 1 lists the jobs arriving in order (Job A, B, C, and D), while Table 2 shows the block of
memory from low order memory to high order memory:

Table 1 Table 2
Job list: Main memory:
Job Size Block Size
A 256k Block 1 910K
B 900k Block 2 900K
C 50K Block 3 200K
D 350K Block 4 300K

a) Determine which partition each request will be allocated if the following strategy is used:

i. Best-fit algorithm
(3 marks)

ii. First-fit algorithm

(3 marks)

© Hak Cipta Universiti Teknologi MARA

 9 CD/JUL 2024/CSC207/204

b) Which type of fragmentation occurs? Calculate the total amount of fragmentation for best-
fit algorithm.

(3 marks)

QUESTION 3

Consider a logical address space of 28 pages with a 4 KB page size, mapped onto a physical
memory of 4096 frames. Its page table is given in Table 3.

Table 3
50
30
400
100

a) What is the size of logical and physical addresses (in 2" bytes)?

(4 marks)

b) Calculate the physical address if the logical address is 3: 400.

(3 marks)

c) What is the page number and offset for the logical address of 51152? (2 marks)

(3 marks)

© Hak Cipta Universiti Teknologi MARA

 10 CD/JUL 2024/CSC207/204

QUESTION 4

Consider the following page reference string: 7,2,3,1,2, 5, 3,4,6,7,1,3. Assuming demand
paging with four frames, how many page faults would occur for the following replacement
algorithms? Please circle which references cause page faults.

(10 marks)

a) Optimal (OPT) replacement

b) LRU replacement

QUESTION 5

Answer the following questions: In the Unix system, directory listing is shown as below:

-rw-r-r-- 1 pbg staff 9423 Apr 19 2018 program

drwx 3 pbg staff 1024 Aug 19 10:31 mail/

a) Name and define the directory protection.

(3 marks)

b) Name and define the file protection.

(3 marks)

c) How to let all the users use the file without restriction? Hint: chmod

(2 marks)

© Hak Cipta Universiti Teknologi MARA

 11 CD/JUL 2024/CSC207/204

QUESTION 6

Describe and show the example of free space management below:

a) Linked list
(5 marks)

b) Grouping
(5 marks)

QUESTION 7

Match the security violation methods below with its description:

Session hijacking, Denial of Service, Man-in-the-middle attack, Masquerading, Replay

attack

Description Security violation method

Intruder sits in data flow, masquerading as
sender to receiver and vice versa

Pretending to be an authorized user to

escalate privileges

As is or with message modification

Intercept an already-established session to

bypass authentication

Overload the targeted computer preventing

it from doing any useful work

(5 marks)

END OF QUESTION PAPER

© Hak Cipta Universiti Teknologi MARA