3:24 PMlo1ABIs A E l El J 694

B.Sc. Comput... l

SNe: 353 BATCH: 202) Reg.No.:

END OF SEMESTER EXAMINATIONS, APRIL/ MAY- 2022

OPERATING SYSTEM
SUBIECT CODE: 21IUACSO4
MAJOR : BSc(Compater Science) SEMESTER :II
TIME :3 HOURS MAX.MARKS: 50

SECTION-A(10x|- 10)
Answer ALL the Questions:
Choose the correct Answer
. The main memorr accommdates
a) CPL b) user processes c) operating system d) all of the these

2 To access the serv ices of theoperating sy stem.the interface is provided by the

a) Library b) System calls c) Assembly instructions d) API

3. Aprooess can he terminated due to

al normal exit b) fatal error c) killed by another process d) all of these

4. The entry of all the PCBs of the current processes is in

a) Process Register b)Program Counter C) Process Tahle d) Process Unit

S. Which one of the following is the deadlock avoidance algorithm?

a) banker's algorithm b) round-robin algorithm
cl elevator algorithm d) karn's algorithm
6. Multiprogramming is mainly acoomplished by
a) OS b) software c) hardware d) program
7. What typ of scheduling is round-robin scheduling?
a) Lincar data scheduling b) Non-linear data scheduling
c) Preemptive scheduling d) Non-preemptive scheduling
8. Whicha)SJF
of thescheduling
following scheduling algorithm is non-preemptive scheduling?
b) Round-Robin scheduling
c) SRTF scheduling d)None of these

9. The three major methods of allocating disk space that are in wide use are
a) Contiguous b) linked c) indexed d) all of these
10. The file organization module knows about
a) files b) logical blocks of files c) physical blocks of files
d) all of these
SECTION-B(5x3- 15)
Answer ALL the Ouestions:

I1. a) Briefly describe the concept of Processes.

(or)
b) Write short notes on "Systen Calls for Directory Management".
I2. a) llustrate the Process Control Block.
(or)
b) Narrate different types of Interrupts.
13. a) Enumerate the four necessary conditions for Deadlock.
(or)
b) State the advantages and disadvantages of non-contiguous storage allocation.
2.

Scheduling.
14. a) Write down the objectives of
(or)
scheduling.
b) Compare Preemptive verus Non-Preemptive
1S. a) Why Disk Scheduling Is
Necessary?
(or)
systems.
b) List down the responsibilities of File
SECTION-C(515 25)
Apswer AIl the Questions:
16. a)Write an overview about the history of an Operating System.
(Or)
b) Elucidate the System Calls for Process Management.

17. a) Narrate the various Operations on Processes

(Or) dCritical Section.
ethe significances of Mutual E
b) Ey
18, a) Elaborate the Dijkstra's Banker's Algorithm.
(Or)
 Lear d3a SchedUling D) Non-linear data scheduing
c) Preemptive scheduling d) Non-preemptive scheduling

8. Which of the following scheduling algorithm is non-preemptive scheduling?

a)SJF scheduling b) Round-Robin scheduling
c) SRTF scheduling dNone of these

9. The three major methods of allocating disk space that are in wide use are
a) Contiguous b) linked c) indexcd d) all of hese

10. The file organization module knows about

a) files b) logical blocks of files c) physicalblocks of files
d) all of these
SECTION - B(5x3= 15)
Answer ALL the Questions:
11. a) Briefly describe the concept of Processes.
(or)
b) Write short notes on "System Calls for Directory Management"
12. a) Illustrate the Process Control Block.
(or)
b) Narrate different types of Interrupts.
13. a) Enumerate the four necessary conditions for Deadlock.
(or)
b) State the advantages and disadvantages of non-contiguous storage allocation.
.2.

14. a) Write down the objectives of Scheduling

(or)
scheduling.
b) Compare Preemptive verus Non-Preemptive
I5. a) Why Disk Scheduling Is Necessary?
(or)
of File systems
b) List down the responsibilities SECTION-C(615- 25)
Apswer All the Ouestions:

16. a)Write an overview about the history of an Operating System

(Or)
b) Elucidate the System Calls for Process Management.

17. a) Narrate the various Operations on Processes.

(O)
b) Explicate the significances of Mutual Exclusion and Critical Section.
18. a) Elaborate the Dijkstra's Banker's Algorithm.
(Or)
b) Discuss on "Single-User Contiguous Memory Allocation".
19. a) Explicate First-ln-First-Out and Round-Robin Scheduling Algorithms.
(Or)
b) Explain the Multilevel feedback queues.
20. a) Summarize about the different Seek Optimization Strategies.
(Or)
b) Describe any two File organization Schemes.

Reg.No.:
S.No: 387 BATCH :2021
APRIL/MAY - 2022
END OF SEMESTER EXAMINATIONS,
MATHEMATICS -II
SUBJECT CODE: 2IUBMAS2
SEMESTER :II
MAX.MARKS: S0
MAJOR: B.Sc(Computer Science)
TIME :3 HOURS
SECTION-A (10x10
Answer ALLthe Questions:
3:25 PMlo.0KB/s A LTE ettFElll J 694

B.Sc. Comput...

Reg. No.
S.NO: BATCH: 2003-17, 19, 20

END OF SEMESTER EXAMINATIONS, APR/ MAY - 2021

OPERATING SYSTEM

SUBJECT CODE: 19UACS04/ 19UACA08 / 19UAIT10

MAJOR: B.SC. (CS) /IT /BCA SEMESTER :II/III

TIME :3HOURS MAX. MARKS :70

SECTION-A(15xl= 15)
Answer ALL Questions;
Choose the correct answer:
1. The process reads command from a terminal is called as
a) Shell b)Kernel c) Unix d) All the above
2. Which command is used to create a new process in MINIX3?
a) Pipe b) Brk c) Fork d) Sync
3. Which of the following is used to connect two processes together?
a) Pipe b) Processor c) Hub d) Switch
4. A creating process is called
a) Child process b) Parent process c) System process d) None of the above
5. Interrupting clock is a
a) Software b) Hardware c) Both (a) and (b) d) None of the above
6. A process can be suspended by
a) Processor b) Process c) Both (a) and (b) d) None of the above
7. A process which is waiting for an event, that could not occur ever is said to be
a) Locked b) Deadlocked c) Killed d) Threatened
8. Processor & Main Memory are known as resources in deadlock
a) Core b) Un Core c) Preemptible d) Non preemptible
9. Who is a memory manager?
a) Software b) Hardware c) Administrator d) User
10. Which of the following is a preemptive algorithm?
a) Round Robin b) Priority Queue
c) Sequencing job first d) Shortest scheduling
11. FIFO is a scheduling algorithm
a) Preemptive b) Non preemptive
c) Both (a) and (b) d) None of the above
12. Which of the following is a processor bound?
a) Batch processes b) Interactive process
c) Serial processes d) All the above
13. File system contains
a) Access Methods b) File servers
c) File maintenance d) File manager
14. A file descriptor also known as
a) File block b) Control block
c) File control block d) File dictionary
15. The time taken by disk arm from the Head position to current record is
a) Search Time b) Seek Time
c) Transfer Time d) Transmission Time ...2...s,

/2

SECTION- B(5X5 = 25)

Answer ALI estions:
16. a) NA the system calls for d Sry management.
(OR)
 49.
3:25 PMl.1OB/s A LTE el LEtl |J 694

( B.Sc. Comput... a
15. The time taken by disk arm from the Head position to current record is
a) Search Time b) Seek Time
c) Transfer Time d) Transmission Time ...2...,

SECTION -B (5X5 =25)

Answer ALL Questions:
16. a) Narrate the system calls for directory management.
(OR)
b) Outline the system calls for Protection.
17. a) List out the various process operations.
(OR)
b)Describe about Mutual Exclusion and Critical Section.
18. a) Illustrate the use of Resource Allocation graphs.
(OR)
b) Sketch the memory hierarchy with diagram. 7/17
19. a) Compare preemptive scheduling vs. non preemptive scheduling.
(OR)
b) Deseribe the scheduling criteria.
20. a) Differentiate between SPTF and SATF algorithms.
(OR)
b) Analyze the various file organization.

SECTION-C(3X 10 =30)
Answer any THREE Questions:
21. Outline the history of operating system.
22. Describe various process states & its state transitions with neat diagram.
23. Discuss the Dijkstra's Bankers algorithm.
24. Examine the Round Robin scheduling algorithm.
25. Discuss in detail about any two disk scheduling algorithms.
****

Reg. No.:
S. No.: BATCH: 2019

END OF SEMESTER EXAMINATIONS, APRIL / MAY -2021

VISUAL PROGRAMMING
3:26 PMlo9KB/s A LE ll L E l |J 694

DOC-202403..

Reg.Ne,

MATCIH 2o16,2019
IND OF SIMISTERENAMINArIONS,
OrERAUNG SySIEM
DECEMBER -2020
SURIECT( ODE: 19UACS4 SEIESTER
TIME :HOURS MAM \RKS:O

SECTION -A( 15 XI- 15)

Anwer ALL the Questinns:
Chense the correet Answer:

1 Whhch of the following is used to conneet two processes together?

a Pipe b) Processor c) Hub d)Switch
2 CREAT command belongs to
ay Irocess Management b) Signaling
c) Iile Management d) Directory Management
3 Which command is the only way to create a ew process in MININ3?
a) Iork b) Brk c) Pipe di Syne
4 A
program n eNCcution is called
a) Algorithm b) lask c) Process d Job

is an afray of puinter to interrupt handler

a) Interupt Array b)Interrupt Vcctor c) Interrupt Processor d Interup: Machine

6 When a thread is accessing shared moditiable data, it is sid o be in

a) Citical place b) Critical scetion c)Cntical situation dy Critical thread

7. What are preemptible tesouves in deadlock"

a) Processor & Min Meory b) Proceor & Seeondary Memery
c) Man Memory & Secondary Memory d) None ot these

8. A related problem of Deadlock is

a) Proces Allocation b) Systemn Allocation
c) Indefinite Postponement d) All the above

9. Ifallcurrent processes can be completed within a tinite time, the sy stem is said to be in
a) Safe State b) Unsafe Stute c) Deadlock d) Starvation

10 FIL0 is a scheduling algorithm

) P'reemptive b)Non preemptive c) Both (a) and (b) di None of the abov

1| Which Aind of prucesses requires frequent input from the user?

a) Btch provesses b) Interactive prucess e) Senal Prvcesses dy Ail the alove

12 Shortest Remning Time aigorthm isa scheduling algonthm

a) Proempttve b)Non Premptive cQueue truscd d) Link

/2/
13. Filc descriptor can manage data resides in
a) Main Memory b) Secondary Storage c) Both (a) and (b) d) None of the

14. Physical record with only one Logical record is called

a) Blocked records b) Unblocked records c) Matched records d) Unmatched

15. Rotational latency is for every disk access

a) Jdentical b) Vary depends on Location
) Similar d) None of the above

SECTION X5=25)
Answer ALLL the Ouest
 6 When a thrcad is aceessing shared moditisble data, it is satd to v in
a) Critical place b) Critical sectien c) Critical situation dy Critical thrcad

7. What are preenptible resoutces in deallock'

a) Processor & Min Meory b) Procesor & Sceondary Memory
c) Man Memory & Secondary Memory d) None of these

s. A related problem of Deadlock is

a) Proces Allocation b) System Allocation
c) ndefinite Postponenent d) All the alove

9. Ifall current processes can be completed within a finite time. the sy stemis said to be in
a) Safe State b) Unsafe Stute c) Deadlock d) Staration

10 FIL0 is a scheduling algorithm

a) P'reemnptive b) Non preemptive c) Both (a) and (b) d None of the above

|L Whch Aind of proceNSCs requires frequent input trom the user?

a) Batch provesses b) Interactive prvccss e) Senal Prvcesses d Ait the avve
2 Shortest Remnning Time aigorith is a scheduling algonthm
a) Precpove b) Non Prvemptive coQucue bascd d Link

13/60
/2/
13. File descriptor can manage data resides in
a) Main Memory b) Sccondary Storage c) Both (a) and (b) d) None of the above

14. Physical record with only one Logical record is called

a) Blocked records b) Unblockedrecords c) Matched records d) Unmatched records

15. Rotational latency is for every disk access

a) Identical b) Vary depends on Location
c) Similar d) None of the above

SECTION- B(5X5-25)
Answer ALL the Questions:

16. a) Narate the History of MINIX3.

(OR)
b) Outline the system calls for file management.
17. a) Summarize the need of process control block &process table.
(OR)
b) List out the various process operations.
18. a) Illustrate the Deadlock with an example.
(OR)
b) Deseribe the memory placement strategies used in storage management.
19. a) Bring out the Scheduling levels.
(OR)
b) Deseribe the scheduling objectives.
20. a) Sketch the desirable characteristics of disk scheduling.
(OR)
b) Explain the data hierarchy in file management.
SECTION-C(3 X10-30)
Answer any THREE Questions:
21. Justify the operating system as an Extended Machine and a Resource Manager.
22. Discover mutual exclusion primitives. How would you implement it?
23. Outline the Fixed partition multiprogramming technique.
24. Discuss the following scheduling algorithms. (i) First in First out (ii) Shortest process First.
25. Enumerate the various file allocation methods.

S.NO:562
Reg. No.
BATCH:87-2016,2019
END OF SEMESTER EXAMINATIONS, DECEMBER- 2020
MATHEMATICS-II
SUBJECT CODE: 19UBMAS2
MAJOR: B.Sc. (CS) SEMESTER
 S. No.: 530 BATCH: 20/7 -2018 Reg. No.:
END OF SEMESTEREXAMINATIONS, DECEMBER- 2020
OPERATING SYSTEM
SUBJECT CODE: 16UACSO5
MAJOR: B.Sc. (CS) SEMESTER :II
TIME :3 HOURS MAX. MARKS: 75

SECTION -A (5X2 =10)

Answer ALL thequestions:
1. What is an Operating System?
2. Define an Interrupt.
3. Compare Contiguous Vs Non-Contiguous Storage Allocation.
4. What is Scheduling?
5. List diflerent types of File Organization.
SECTION-B (5X4= 20)
Answer ALL the questions:
6. a) Write short notes on Layered System.
(OR)
b) Discuss about the Client Server modcl of operating system structure.
7. a) Explain Operations on Processes.
(OR)
b) Write short notes on Mutual Exclusion.
8. a) Discuss four necessary /cocondition for Deadlock.
(OR)
b) Explain Storage management Strategies with neat diagram.
9. a) List any five Scheduling objectives.
(OR)
b) Discuss about Prccmptive Vs Non-Preemptive schcduling.
10. a) Discuss about File System.
(OR)
b) Write short note on File Descriptor.
SECTION-C (3X 15 =45)
Answer any THREEquestions:
1. Explain about System Call in detil.
12. Describe about Process Concept Call in detail.
13. Explain deadlock with an example.
14. Discuss briefly about Scheduling algorithms.
15. Summarize Scek Optimization strategies.

S.NO: 123 BATCH: 95-16,2019 REG. NO.

END OF SEMESTER EXAMINATIONS, DECEMBER - 2020
DATA STRUCTURES}DATA STRUCTURES AND ALGORITIIMS
SUBJECT CODE: 19UACsos /19UACA07/ 19UACTO6/ 19UAITO8
MAJOR: B.SC |CS/ CA/CT/IT] SEMESTER :III
TIME :3 HOURS MAX. MARKS: 70

SECTION-A (15 X 1 = 15)

Answer AIl the questions:
Clhoose the correet ansver:
1. Which of thefollowing refers to asingle units of values?
a) Group item b) Basic item c) Data item d) Elementary item
2. Whiclh is the logical or mathematical model of a particular organization ofa data?
a) structure b) data structure c) variable d) function
3. To represent hierarchical relationship between elements, which data structure is suitable?
a) Dequeue b) priority c) tree d) All of above
4. Choose the homogenous data elements
a) sort b) linear array c) stack d) tree