Total number of printed pages-4e dos

CSC HC 2
3 (Sem-3/CBCS)
ni boinoto
2 0 2 11 0 908q6

(Held in 2022)
COMPUTER SCIENCE

(Honours)
ED Paner : cSC-HC-3026efe
osla
(Operating System)
e ms to
ein 10 9sTFull Marks 6013ns
Time Three hours
wolic
indicate
The flgures in the margin
marks for the questions.
full
questions ass
1. Answer the following
b h ei s u z i y 1x7=7
directed:
operating system may
(a) A
on a single
run many programs
(Fill in the blank)
processor.
SS ana
to create
system call is used
b) a child process identical to the parent.
(Fll in the blank)

Contd.
DsOH80eo
 procesS
has its own address
Each
(c)
(c) (State True or False)
space.
sOH 08 be implemented in user
Threads can
d)
(d) in the kernel.
space o r
(State True or False)

causes all the processes to

(e (Fll in the blank)
wait forever.

is a non-preemptive scheduling
(Fill in the blank)
algorithm.
In any system, users must be
(g secure
authenticated. (State True or False)

2. Define the following terms 2x4-8

(a) Kernels

(b) Threads
(c) Virtual address space
(d) Paging.

3. Answer any three of the following8

questions 5x3-15
(a) State the basic
functions of
systema. operating
3
(Sem-3/CBCS) CSC HC 2/G 22
 (b) What is system call ? Give example of
any five system call.

(c) Give brief description of Round-Robin

scheduling.
(d) What are the advantages and
disadvantages of implementing threads
in user space ?

(e) Write in brief about Hierarchical

Directory Systems.

4. Answer any three of the following

questions :
10x3=30

of
(a) Give description of different types
operating system.

Describe the issues related to inter

(b)
process communication.

and
how time quantum value
(e) Explain
context
time affect each other,
switching
round-robin scheduling algorithm.
in a
5+5 10

Contd.
3
3 (Sem-3/CBCS) CSC HC 2/G
 (d) What is deadlock ? What are the
necessary and sufficient conditions for
deadlock ? Describe Banker's algorithm
for avoidance of deadlock.

(e) Describe any two file allocation

methods.

Write short notes on security policy

mechanism and authorization.

3 (Sem-3/CBCS) CSC HC
2/G 4
1000
Total number of printed pages-4
3 (Sem-3/CBCS) CSC HC 1
2021
(Held in 2022)
COMPUTER SCIENCE

(Honours)
Paper CSC-HC-3016

(Data Structures)
Full Marks: 60
Time: Three hours
The figures in the margin indicate
full marks for the questions.
1. Answer the following as directed 1x7=7
) In a stack, if a user tries to remove an
element from an empty stack, it is called
(a) underflow
(b) overflow
(c) empty
(d) push
(Choose the correct answer)
ii) Assuming int is of 4 bytes, what is the
size of int a [15]?
(a) 15 bytes
(b) 19 bytes
(c) 60 bytes
(d) 11 bytes
(Choose the correct answer)
Contd.
 Write two applications of stack data
ii)
structure.

iv) Name two sorting techniques.

(v) What is a binary tree?

(vi) Consider the following pictorial

representation of a singly linked list
Start G>INULL
Which of the following statements will
remove the second node from the list ?
(a) Start =
start next
(b) Start > next = start

(CStart next = start > next next

(d) Start next =start > next > next > next
(Choose the correct answer)
(vi) Write an advantage of hashing.

2. Answer the following questions 2x4-8

(a) Differentiate linear search and binary

Search.

(b) What will be the maximum height and

minimum height of a binary tree with
15 elements ?

(C) Write down the advantages of doubly

linked list structure over singly linked
list structure.

3
(Sem-3/CBCS) CSC HC 1/G 2
 Draw binary search tree with the
(d) a

following elements, if you insert one

after another
10, 15, 25, 5,4, 30, 2,7
Answer any three questions from the
3.
following: 5x3-15
(a) Describe collision resolving by open5
addressing technique.
(b) Write down the result of inorder,
traversals of the
preorder and postorder
following binary tree: 5

(B) G
C) D
(K

Convert the following infix expression

(c) 5
into postfix expression
a+(b*c(d/e-f)*g)+h
search
d) Write the algorithm for binary
5
technique.
is it known as
(e) What is a queue ? Why
? Write the ways for
FIFO data structure
implementing a queue. Briefly
explain twvo
applications of queue. 1+1+1+2-5

3 Conta.
(Sem-3/CBCS) CSC HC 1/G
 Answer any three questions from
the
the
following: 10x3-30
(a) Sort the following data using insertion
sort (showthe steps)
10
7 5 18 3 6 09

(b) Write a
program to
implement a stack
using array. 10
(c) Write a program to
implement a doubly
linked list for inserting an
element at
the beginning of the
list, deleting an
element from the end of the list. 10
(d) What is recursion ? How does
function work ? Explain with recursive
of an the help
example. Also mention two
advantages of recursion. 1+2+5+2=10
(e) Explain different cases for
node from deleting a
the help of
a
binary search tree with
example. 10
) Write short notes the
on
following
2%x4-10
Threaded binary tree
(i) Circular queue
ii) Multidimensional array
(iv) Perfect binary tree

3 (Sem-3/CBCSI CsC HC LO