Paper Code

CENTRE FOR DEVELOPMENT OF ADVANCED COMPUTING

E4 Common Course End Exam (CCEE) – August 2013

INSTRUCTIONS TO CANDIDATES

DESD – Real-Time Operating Systems (RTOS)

Candidate should read the following instructions before attempting the question paper.

1. DO NOT CLOSE THE BROWSER ANYTIME DURING THE EXAM.

2. Candidate should check his/her name and extended enrollment Number (enrollment
number prefixed with 20) being displayed on the screen. In case of any discrepancy, it
should be reported to Invigilator immediately.

3. Candidate should ensure that he/she has marked attendance on the attendance sheet and
also ensure that session id has also been recorded. Any other session id which has not been
mentioned in the attendance sheet would not be considered and all responses on that
session id would be treated as null and void.

4. Do not start the exam (do not click Next button) before instructed to do so by the
Invigilator.

5. Every Section has 40 objective-type questions. Each objective-type question has four
choices of which only one is correct. Candidate should select the radio button, given below
the question, corresponding to his/her correct choice.

6. Marking scheme of CCEE is as follows:

a. +1 (plus one) marks for each correct answer.

b. 0 (zero) mark for each un-attempted/ wrong question.

7. Duration of each Section is ONE hour. No candidate will be allowed to leave the
examination hall before the completion of exam duration.

8. On clicking the Next button given at the bottom of the Instructions page, candidate will
be directed to the question display screen.

9. Candidate should note down the Session ID that is displayed on the question screen after
clicking on Next button.
Paper Code
CENTRE FOR DEVELOPMENT OF ADVANCED COMPUTING

E4 Common Course End Exam (CCEE) – August 2013

10. Once the exam is started:-

a. Candidate should not close the browser. In case the browser is closed accidentally,
it SHOULD BE reported to the Invigilator immediately.
b. Candidate should not open any other software application on the computer system.
c. Candidate should neither shut down the machine nor fiddle with allocated hardware
or software.
d. In case of any problem it should be reported to Invigilator.

11. Candidate can navigate through questions using scroll bar or directly through the question
number grid.

12. CCEE screen contains the following buttons with the below specified functionality:

Button Functionality

Examination This link will open the instructions for the exam. After reading the
Instruction instructions candidate has to click on Back button to move back to the
questions interface.

Mark for In case a candidate is not sure about the answer, then he/she can use this
Review Button to mark the question for a visit later. It will be shown with
a ? against the question (in the question number grid) if the question has
not been answered but has marked it for review. In case candidate has
answered the question and marked it for review, then √? will be displayed
against the question in the question number grid.

Clear Answer This button will clear the option marked and the question will be shown
as un-answered.

13. Each candidate will be provided one A4 size sheet for rough work. Candidates have to
record their Name, hall ticket number and session ID on the rough sheet. They have to
return the rough sheet to the Invigilator before leaving the exam hall.
14. Calculators, mobile phones, pagers and electronic gadgets in any form are not allowed to be
used in the Exam Hall.

15. Candidate will be disqualified if found indulging in any kind of malpractice.

Paper Code
CENTRE FOR DEVELOPMENT OF ADVANCED COMPUTING

E4 Common Course End Exam (CCEE) – August 2013

Date:

Module Name: Real Time Operating Systems

1. What will the output after executing the following code of segment?

main()

fork();

fork();

fork();

printf("Hello");

How many child processes will be created in this?

A. 3

B. 4

C. 6

D. 8
Paper Code
CENTRE FOR DEVELOPMENT OF ADVANCED COMPUTING

E4 Common Course End Exam (CCEE) – August 2013

2. Relocatable programs

A. cannot be used with fixed partitions

B. can be loaded almost anywhere in memory

C. do not need a linker

D. can be loaded only at one specific location

3. Preemption is

A. forced de allocation of the CPU from a program which is executing on the CPU

B. release of CPU by the program after completing its task

C. forced allotment of CPU by a program to itself

D. a program terminating itself due to detection of an error

4. Normally user mode bit is represented by

A. 0

B. 1

C. 2

D. none of the above

Paper Code
CENTRE FOR DEVELOPMENT OF ADVANCED COMPUTING

E4 Common Course End Exam (CCEE) – August 2013

5. Which one of the following is not shared by threads?

A. program counter

B. stack

C. both (A) and (B)

D. none of the above

6. To avoid race condition, the number of processes that may be simultaneously inside their
critical section is

A. 8

B. 1

C. 16

D. 0

7. What do you mean by memory compaction?

A. combine multiple equal memory holes into one big hole

B. combine multiple small memory holes into one big hole

C. divide big memory hole into small holes

D. divide memory hole by 2

Paper Code
CENTRE FOR DEVELOPMENT OF ADVANCED COMPUTING

E4 Common Course End Exam (CCEE) – August 2013

8. What does belady‟s anomaly related to?

A. page replacement algorithm

B. memory management algorithm

C. deadlock prevention algorithm

D. disk scheduling algorithm

9. The interval from the time of submission of a process to the time of completion is termed as

A. waiting time

B. turnaround time

C. response time

D. throughput

10. Which of the following is page replacement policy using this strategy “Replace the page that
hasn‟t been used for the longest period of time” ?

A. least recently used page replacement

B. optimal page replacement

C. fifo page replacement

D. second chance page replacement

Paper Code
CENTRE FOR DEVELOPMENT OF ADVANCED COMPUTING

E4 Common Course End Exam (CCEE) – August 2013

11. Time quantum is defined in

A. shortest job scheduling algorithm

B. round robin scheduling algorithm

C. priority scheduling algorithm

D. multilevel queue scheduling algorithm

12. Which one is the fastest form of IPC

A. shared memory

B. pipe

C. message queue

D. sockets

13. What is the return value of read system call when end of file occurs?

A. 0

B. a positive number

C. -1

D. none of these
Paper Code
CENTRE FOR DEVELOPMENT OF ADVANCED COMPUTING

E4 Common Course End Exam (CCEE) – August 2013

14. Information about a process is maintained in a

A. stack

B. translation look aside buffer

C. process control block

D. program control block

15. The usual effect of abnormal termination of a program is :

A. signal destruction core dump file generation

B. system crash

C. program switch

D. core dump file generation

16. Using optimal page replacement algorithm calculate the number of page faults in
referencing the following string of page numbers with the number of frames 3

7,0,1,2,0,3,0,4,2,3,0,3,2,1,2,0,1,7,0,1

A. 6

B. 8

C. 9

D. 10
Paper Code
CENTRE FOR DEVELOPMENT OF ADVANCED COMPUTING

E4 Common Course End Exam (CCEE) – August 2013

17. Thrashing

A. is a natural consequence of virtual memory systems

B. can always be avoided by swapping

C. always occurs on large computers

D. can be caused by poor paging algorithms

18. Using priority scheduling algorithm, find the average waiting time for the following set of
processes waiting time for the following set of processes given with their priorities in the
order:

Process Burst Time Priority

P1 10 3

P2 1 1

P3 2 4

P4 1 5

P5 5 2

A. 8

B. 8.2

C. 7.75

D. 3
Paper Code
CENTRE FOR DEVELOPMENT OF ADVANCED COMPUTING

E4 Common Course End Exam (CCEE) – August 2013

19. Address binding is

A. going to an address in memory

B. locating an address with the help of another address

C. binding two addresses together to form a new address in a different memory space

D. a mapping from one address space to another

20. If the resources are always preempted from the same process, …………. can occur.

A. deadlock

B. system crash

C. aging

D. starvation

21. The banker‟s algorithm is an example of a technique for

A. deadlock prevention

B. deadlock avoidance

C. deadlock detection

D. deadlock recovery
Paper Code
CENTRE FOR DEVELOPMENT OF ADVANCED COMPUTING

E4 Common Course End Exam (CCEE) – August 2013

22. In segmentation, the segment base contains the :

A. starting logical address of the process

B. starting physical address of the segment in memory

C. segment length

D. none of the above

23. With the FIFO page replacement policy and enough space for storing 3 page frames, the
memory page reference string „ABCABDDCABCD‟ would produce:

A. 5 page faults

B. 6 page faults

C. 7 page faults

D. 8 page faults

24. When the valid – invalid bit is set to valid, it means that the associated page:

A. is in the TLB

B. has data in it

C. is in the process‟s logical address space

D. is the system‟s physical address space

Paper Code
CENTRE FOR DEVELOPMENT OF ADVANCED COMPUTING

E4 Common Course End Exam (CCEE) – August 2013

25. Situation where two or more processes are reading or writing some shared data and the
final result depends upon who runs precisely is called?

A. race condition

B. critical section

C. mutual exclusion

D. message passing

26. fork system call returns ……………to child process

A. child‟s pid

B. 0

C. 1

D. -1

27. Thread synchronization is achieved by

A. pthread_create

B. pthread_join

C. pthread_self

D. pthread_exit
Paper Code
CENTRE FOR DEVELOPMENT OF ADVANCED COMPUTING

E4 Common Course End Exam (CCEE) – August 2013

28. Which semaphore API function provides a number of control operations on semaphore

A. semctl()

B. semget()

C. semop()

D. semstat()

29. Consider the following program

main()

int p[2];

pipe(p);

fork();

Choose the correct answer

A. the pipe will be recognized only by the parent process

B. p[0] is the file descriptor of the write end of the pipe

C. there will be 4 file descriptors in memory

D. the pipe will not be shared by both the parent and child processes
Paper Code
CENTRE FOR DEVELOPMENT OF ADVANCED COMPUTING

E4 Common Course End Exam (CCEE) – August 2013

30. shmdt ( ) function is used to ………………….address space of our process

A. map

B. unmap

C. block

D. unblock

31. In real time operating system

A. all processes have the same priority

B. a task must be serviced by its deadline period

C. process scheduling can be done only once

D. kernel is not required

32. For real time operating systems, interrupt latency should be

A. minimal

B. maximum

C. zero

D. dependent on the scheduling

Paper Code
CENTRE FOR DEVELOPMENT OF ADVANCED COMPUTING

E4 Common Course End Exam (CCEE) – August 2013

33. A conventional RTOS supports

A. preemptive kernel

B. non-preemptive kernel

C. depends on implementation

D. none of the above

34. Time duration required for scheduling dispatcher to stop one process and start another is
known as

A. process latency

B. dispatch latency

C. execution latency

D. interrupt latency

35. The priority of a real time task:

A. must degrade over time

B. must not degrade over time

C. may degrade over time

D. none of these
Paper Code
CENTRE FOR DEVELOPMENT OF ADVANCED COMPUTING

E4 Common Course End Exam (CCEE) – August 2013

36. A task executing in the ready state cannot be moved into which of the following states?

A. wait, ISR state

B. running state

C. dormant state

D. both (B) and (C)

37. The ......................... scheduling algorithm schedules periodic tasks using a static priority
policy with preemption.

A. earliest deadline first

B. rate monotonic

C. first cum first served

D. priority

38. A conventional real time task can be allocated

A. only fixed size stack, decided by kernel

B. variable size stack, decided by developer

C. dynamically expandable stack

D. all of the above

Paper Code
CENTRE FOR DEVELOPMENT OF ADVANCED COMPUTING

E4 Common Course End Exam (CCEE) – August 2013

39. Reentrant function is one that

A. should be executed by only one task at a time otherwise data corruption

B. will allow 2 tasks to use it but not more than 2

C. will allow any number of tasks to execute it without data corruption

D. both (A) and (B)

40. Preemptive, priority based scheduling guarantees:

A. hard real time functionality

B. soft real time functionality

C. protection of memory

D. none of the these