whether the equation

4. a) Examine
(a'-2xy- y' Jdr-(x+y)' dy =0 is exact.
Ifit be exact then solve it.
equations:
b) Solve the following differential
) log/ ax+by.
1
i) (+1)+4xy=
i) y=5.

5. a) Find the orthogonal trajectories of the family of concentric circles centre

origin.
b) Find the family of curves which make an angle with the
c) Check whether the hyperbolas xy =
differential equation
*'y+4xy +(r'+2)y +3ry =2
is exact.
If not, find the value of m so
that x" is an integrating factor of the above
equation. Obtain its first integral. ditt

6. a) Using the
substitutions y =v-x, reduce the equation dy
y dt*+y' =0
b) homogeneous form and
Find a particular integralhence solve it.
of the
y-5y' +8y'-4y =e+e+ differential
sin x.
equation
c) Convert the differential
(l+2x) y equation
-6(1+2x)atl6y=8(1+2x)'
1o the
differential equation with constant
coefficients and hence solve it.

Group-B
Answer any twO
1 a)
Find the partial questions.
1-7 nlane. Obtain
L EindA the
differential equation
its degree of all
spheres of unit radius with 10x2
partial and order.
from the origin. differential equations of State
Find the partial
the centres on
all planesnature of the equation.
which are
3+
functionf from z=*+y+f(xy).differential equation by
at a constant distar
elimination of arbitr
 Page No. Frame No.

1
2
3
4

machine is 4MB. How

The page size is lKB and the maximum physical memory size of the of the
many bits are required for each page table entry? How many entries are there in a page table? How
address 2050 be
many bits are there in a virtual address? To which physical address will the virtual
ranslated to? Which virtual address will translate to physical address 1024?
b) Show that, if the wait) and signal) semaphore operations are not (1+1+1+1.5+1.5)+2-8
executed atomically, then
mutual exclusion may be violated.

5. Find the page reference string for the following virtual addresses by the CPU in a time span.
Assume that addresses are all in decimal and page size is 1000 bytes.
1050, 100, 2030, 3020, 4003, 4100, 1000, 2050, 5005, 1010, 2020, 2010, 300, 4050, 5050, 503
Find the number of page faults for the FIFO, LRU, and the optimal page replacement algorithms
with 3 frames. You need to show the values of the counters for the LRU page replacement algorithm
by assuming that it is implemented using counters. Also assume that pure demand paging is used.
What is the importance of the aptimal page replacement algorithm? 1+(2+2+2)+1=8

6. a) Suppose that the disk request queue contains requests for sectors on the following cylinders:
30, 50, 20, 100, 70, 150, 200, 80, 250, 300. In which order will the requests be granted under SSTF
and SCAN disk scheduling algorithms. Assume that the disk arm is moving toward 0 and that the
Curent DOsition of the disk arm is over cylinder 50. Calculate the total head movement for each of
the algorithms.
b) Consider a file system that maintains aunique index node for each file in the system. Each index
node includes eight direct pointers, asingle indirect pointer, and adouble îndirect pointer. The block
size of the file system is 2KB, and a block pointer accupies 4 bytes. Find the maximum file size that
the file system can support. (2.5+2.5)+3=8
 B.Se. (1Honours) Examination 201%
Semester-I||
(omputer Science
Course:(C-5
(Data Structure)
Time :3 Hours Full Marks : 40
QuestiOns are of value as indicated in the margin

Answer anv four questions.

1. a) Calculate the hash value of 3456 using (i) Mid square method (ii) Folding method. 6
b) What do you mean by clustering? How one can overcome it?
(2+2)+4+2=10
c) What are the advantages of collision resolution by chaining?
2. a) Definc a rooted ordered tree, binary tree.
b) How a rooted ordered tree can be represented in a computer?
c) Present an iterative function to compute the inorder traversal of a binary tree. 2+3+5=10
3. Compare and contrast the following data structures in relation to linear hist of data items - ()
Static Array, (ii) Dynamic Aray, (iii) Single linked list, (iv) Double linked list, (v) Circular
linked list. 25=10

4. a) Explain, with suitable example, the functioning of a quene, clearly indicating the associated
() insertion, (ii) deletion operations.
6+4=10
b) Explain the importance of stack by clarifying its associated operations. 2+
followings -
5. a) What will be the (i) Inorder, (ii) Preorder and (ii) Postorder traversals of the

Case-l Case-lI

observation?
Hence, can you find any interesting
(ii) portfix representations of
t
b) What will be the (i) prefix and (2×3)+2+2=10
((a+b)*(c+ d)) -(e*a) +(6 * d))
+

Construct a binary search tree from the following data itenms

tree.
0. a) Define a binary search
49, 41.
35, 26, 73. 39, 24, 45, 62, 57, balancing. Why height balancing in necessary? In this
explain height (2+4)+2+1+|=10
D) With an example, is balance factor?
context, indicate what is
 B.Se. (Honours)
Examination, 2022
Semester-1||
Computer Science
Course: (C-6
(Operating Systems)
Time: Thee Hours
Full Marks: 40
Questions areceof value as indicated in the margin.
Answer Question No. 1 and any four from the rest.
. a) What issystem call? Write example of a system call.
) What is spin-lock?
)Why is page size always in the power of 2?
) Differentiate between kernel and shell of Unix.
2% 4=8

. a) Considering the following list of jobs, determine the CPU Gantt chart and calculate the
verage waiting time and CPU uilization for each of the SJF, priority (small integer implies high
riority), and RR CPU scheduling techniques, where time quantum is 3 ms. Assume that the
ontext-switching overhead is 0.1 ms.
Process CPU burst time (ms) Priority
8 3
P2 2
P3 5
P4 3 2
p5 6
) Differentiate between an orphan and a zombie process. 6+2-8

3. a) Briefly explain the necessary conditions to occur deadlock.

b) Consider the following snapshot of a system:
Max Available
Allocation
A A B
A B
5 3
PO ) 1
2
P
P2 9
2 2
P3
3
P4 2

s using banker's algorithm: request be

Answer the following quesf a from process PI arrives for (1, 0, 2), can the
Is the system in a safe state? reque
of your answers.
granted immediately? Justify bothand external commands of Unix.
Differentiate between internal 2+-442-8
c)
exit0, and wait) system calls in connection with
purpose of fork), exec),
4. a) Briefly explain the onc-level page table
the process life cycle. address space for each process using a process
b) A system
implements a paged virtual space is 16MB. The page table for the running
virtual address
The maximum size of
includes the following entries:
 B.Sc (Sem-1ll)
Subject Examinations,
-Computer 2021
Science
Paper
Full Marks - 40-CC7(Computer Networks] (Theory)
Time:3 hrs

Questions are of value as indicated in the margin.

Answer any four questions.
1. a) What are the
b) shortcomings
Find out a bitstream
of NRZ-L coding ?
for which the number of Illustrate inwith an example. [2]
transitions NRZ-L is one-fourth of thenumberof
ransitions for NRZ-1. Explain with an example.
c) 1-rigBgered NRZ-I scheme is used [4]
to transmit bits between a pair of nodes. But the
handle absence of any transition for more than four bits. Hence, the system cannot
transmitter forcibly
introduces a transition at the end if the signal remains steady for four consecutive bit durations.
Draw the waveform for bit stream
100100000010. [4
2. a) lllustrate the difference of wavefom between RZ and Manchester coding for bit stream 10010011.
Assume that for RZ, return to zero level happens at mid bit. [4]
b) Explain the difference between NRZ-I and Differential Manchester coding schemes with a
suitable example. [4
c) Finda bitstream where number of transitions to transmit the bitstream using NRZ-I is half than
transmission of the same using Differential Manchester coding. [2
3. a) A system uUses a 44-ary line coding schemne, where symbols 00, 01, 11 and 10 are represented using
signal levels -3V, -v, +V and +3V during the symbol. Draw the transmited waveform
for bitstream 10000111. (3)
b) Find a possible bitsuream for which transmited signal would have no transitions. [2)
c) Suggest a mechanism similar to differential manchester code by which the problem of absence
of transition is resolved for all possible bit sequences. Ilusrate with an example. [51

4. a) Illustrate the difference between BFSK and BPSK modulation schemes. transmitting 11010010 (5)
b) Find the arnplitudes of cosine and sine components during each bit while
value for consecutive 0's toggles
using a modified BPSK modulation scheme; where phase 1's.
between pi/4 and 5*pi/4, and between 3 pi/4 and 7 pi/4 for consecutive
[5]

An 8-ary modulation scheme is implemented, where the amplitude of the modulated carrier is
5. a) first bit of the symbol; and the phase of the
chosen to be +V or +3V depending on value of thebits of the symbol. Find the number of
signal is modulated like QPSK using the rest two
changes during transmission of bitstream
times the amplitude and phase of the signal
101001011110.
Find the amplitudes of cosine and sine components (A, and A,) for each symbol.
b)

links ? [21
can't the line coding schemes be used in wireless data over NRZ-L and
6. a) Why
and cons of Manchester and Differential Manchester coding [4]
b) What are the pros 21
OOK ?
NRZ-I ?
BFSK and BPSK modulation over (2]
) What are the benefits of
more error prone than NRZ-L ? Briefly Justify your answer.
NRZ-I
d) Is demodulation for
 B.Sc.(Hons.) Examination, 2022
Semester
Subicet: Computer Science
Course: CCS
(Data Structures - Theory )
Time: 3 Hours
Full Marks: 4I
Questions are of values as
Answer Question No. Iandindicated
in the margin.
any four from the rest.

1. a) xplain ADT
b) Why do we need data
c)
structures?
What do vou mean by primitive and non-primitive data structures?
d) Wrie selection sort algorithm, Calculate the number of approximated steps needed to
perform this algorithm. 14 x 2 = 8]
a) Wrile an appropriate algorithm for inserting a node at and deleting a node from (i) the
beginning. (ii) the middle and (iii) the end, in a singly linked list. Give examples to
illustrate all the cases.
b) What is circular linked list? How is it useful?
|6 +2 = 8]
3. a) Consider an infix expression (17 + (9-8))" 4/3^2 + (8 +7 -6)/3. Find out its
equivalent postfix expression by using stack. Then write an algorithm to evaluate a
postfix expression by using slack and evaluate the above expression with the heip of
this algorithm.
b) Suppose two binary trees are given. Dcsign a suitablc algorithn1 to return irue if they
arc structurally identical. [6 +2 = 8)

4. a) Write an algorithm to crcate an AVL tree. Use this algorithm to create an AVI. tree
for the following list of numbers:
55.44,33.77. 55. 88, 22, 99, 66. 77. 11.
Irom an AVL tree. Use this
b) Wrie an appropriale algorilhm to delete an clement [5 +3 = 8)
algorithm to ean element 66 from the above generated tree.

5. a) Explain linear search and binary scarch. Give examples.

b) Describe a procedure to insert an element aina BST.
manner? 14 + 2 +2 = 8]
c) How can vou traverse all the clements of BST in inorder

6. a) What is hashing?
with appropriate examples.
b) Explain different types of hash functions mairix. [2 +3+3 = 8]
c) Write an algorithm to implement sparse

7 Differentiate the following:

a) Array and structure
b) Stack and queue
doubly linked list
c) Singly linked list and 14 x2 = 8]
d) BST and AVL tree
 B.Se.
Examination
Semester-(Generic),
111 2022
Computer Science
Course: GEC 3
Time: Three Hours (Introduction to Database System) Full Marks: 40
Answer Questionl and any four from the rest.
1.
Answer any eight
What is a view? (Qucstions.
b Is NULL value the
same as 0 or blank
C
How can we represent a weak entity setspace?
in an ER diagram?
d. What does
e
cardinality mean in DBMS?
Which command in SOL is used to remove a table from database?
f. Give an example of Many-t0-Many
g. What is a candidate key?
Relationship.
h. Discuss the differencec between DDL and DML.
i Why Join operation is useful?
j. Given an example in SQL using the group by clause.
1X8 =8

a. What is the three-tier architecture of DBMS? Explain its advantages over two ticr
architectures?
b. What is Data Independence in DBMS? Explain its types.
(2.5+1.5)+(1+3) =8
3
this system, a
Suppose we want to build a system for an onlinc banking system. Incustomer.
to the The
customer can open accounts in a branch. The branch may issue loan
The
customer borrows loan and the loan is paid through a weak entity "payment".the customer.
employee serves
customer can deposit money in his/ her account. The bank
An account can be of two types: savings or
current.
a. Identify the possible entities with attributes. onlinc banking system.
b. Draw the E-R diagram for the above-mentionedcorresponding Relational Schema.
c. ldentify the primary keys and obain the
2+4+2-8

4
lossless decomposition in DBMS? Consider a relation schema
a. What is whether
R(W.X, Y, Z) is decomposed into R1( W, Z ) and R2(X, Y, Z). Determine
areLossless or Lossy?
the above R1 and R2
are the various types of anomalies in DBMS? Give examples.
b. What examples.
c. Explain transitive and partial dependency with (1.5+2.5)+2+2-8
 B.5c(Semeste-|| ) Exainaton,
Subje Computer Sorne 2021
Papr1 CC7(Theory (ompuiter Netwetke
Full Marks
hour
Questions are ol
value as indcated in the margin with
total ol 70 marks
Answe any number of questions,
Maximum sore 40
1. What is thedifference betwvcen NRZL and Differential Manchester
Encoding |21
2. Write the pseudocode for decoding
waveform. noise-added differential Manchester encoded
|3
3. Illustrate AMI with HDB3 encoding with asuitable
exarnple. 13
4. Is there any bitstream for which the NRZ-L
waveform and Manchester coded waveiorms
have the same number of transitions ? Justify.
[2)
5 A 4-ary data modulation scheme has the following mapping between symbois and
modulated waveforms : [4+2 = 6!
Symbol Equation of modulated
waveform

00 3Acos (2ntt + TU4)

01 3A cos(2nft + 3n/4)
11 Acos (2ft + 31/4)
10 Acos (2ft + n/4)
5.1. Draw and explain the signal-space diagram of the above modulation scheme.
5.2. What are the differences berween the signal space diagram of this modulation
scheme and that of QPSK ?

6. What should be the averaging interval for 8PSK, 16-QAM, 64-QAM and 256-QAM
synchronous demodulation software for operaing bit rate = 12Mbps ? [2
7. Explain why 16-QAM is a better'choice against 16-PSK modulation scheme. [21

8. Calculate the framing overhead to transmit bitstream 01°001"010101"o if bit-oriented

framing is used with delimiter = 01'0 ? (1" here means n number of consecutive l's). 13

9. A transmitter generates packets of sizes 40 bytes, 80 bytes, 120 bytes, 180 bytes and 240
byies with ratios 0.6, 0.2, 0.1, 0.05 and 0.05 respectively. If length based framing is used.
find theaverage overheads if the maximum frame length is chosen to be 240 bytes, 120
bytes and 40 bytes respectively. Remember thal, packets larger than maximum frame length
should be segmented into multiple frames. [51

Would you prefer a character-based framing over length based framing for any
10
scenario ? Explain in brief. [21

Page i o 2
 minimum
Dacket What is the
64-bil error
vertical parity is used for check 2 llustrate one sUCh
An 8-bit hoizontal and 8-bit
cannot be deteed by this parity 5
11 which
number of bit eroIs
pattern and explain.
having generator
1011l and
CRC
packet 10110100 is appended
with
from the righunost bit of the received
An input 8", 9", 11 and 12 bits can be detected by
the
transmitted as a frame, 4, 7", Show if this error
are in error die to noise during transmision.
trame
CRC check or not.
between two
used for providing reliable data transfer
protocol is
AGo-Back-N ARQ stores received out-of-sequence
13
wireless channel. The receiver of
hosts connected through an window equal to the transmission window size. When a set
packets and maintains an Rx delivered to upper layers. Whenever a packet is
in-sequence packets are available, those are
round-trip timer expires in the receiver, it sends an acknowledgement (ACK)
received or if the next expected in-sequence packet.
The
with sequence number = sequence number of
its sequence number. Time
transmitter retransmits a packet if it receives duplicate ACK with transmitter and receiver
100 ms,
required to ransmit a packet = 10 ms, Round rip time = 4 and 7
window size = Show the sequence of transmission and retransmission if packet
are lost only during their 1" transmission, and packet 10 during its 1 retransmision also.
Assume all ACKs are received without errors. [8]

14. Explain why the modulo of sequence number should be at least one more than the
window size for a Go-Back-N ARQ without buffering in the receiver.
15 Aslotted Aloha bus network has bus length - 100 meters, speed of signal through the
medium 10 m/sec, bi rate 10 Mbps. What should be the size so that the slot
duration should be 10 times of the duration of collision detect preamble ? [2]
16. If slot duration in a slotted Aloha system is T,, calculate the minimum and maximum
latency berween a packet being available for transmission and completion of transmission if
it suffers 3 successive collisions and Binary Exponential Backoff is used. [4]
If slot duration in a slotted Aloha system is I;, calculate the minimumn and maximum
latency between a packet being available for transmission and completion of
it suffers 3 successive collisions and &-persistency is used.
transmission if

18. An organization uses a class-B address 164.18.0.0. It has a

where there is provision for upto 30 divisions, and each hierarchical structure
division is provisioned to have unto
15 departments - each department has provisioned to have N hosts.
18.1. Calculate the value of N. [2+3+5 = 10]
18.2. There is a main router to connect the
each division to connect to the main organization t0 the oulside netWork. a router in
router and a router n each department.
the subnet masks which needs to be known
18.3. Calculate the subnet addresses for by the main router and divisional Calculare
first 5 diviSions and Tirst 3 routers
the 5 divisions. departments of each of
 Frame No.
Page No.
2

1 8
10
17

4
many
of the machine is 2MB. Howtable?
physical memory size number of entries in a page
The page size is 2KB and |the maximum
bits are required for each page tableeentry? What is the maximum address will the virtual address
virtual address? To which physical
How many bits are there in a address will translate to physical address 4100?
4100 translate to? Which virtual 3+5=8

following virtual addresses by the CPU in a tume span.

for the
5. Find the page referenceallstring
in decimal and the page size is 1000 bytes.
Assume that addresses are
5050, 5030
1020, 2030, 3020, 4003, 4100, 1000, 2050, S005, 1010, 2020, 2010, 3000, 4050,
1050,
replacement algorithm with 3 frames. Assume that
Find the number of page faults for the LRU pageof the counters by assuming that the LRU page
demand paging is used. Show the values
replacement algorithm is implemented using counters.
organized and how the address translation happens
b) Briefly explain how the inverted page table is
in this memory management scheme. (1+2+1)+(2+2)=8

6.a) Suppose that the disk request queue contains requests for scctors on the following cylinders:
30, 50, 20, 100, 70, 150, 200, 80, 250, 300. In which order will the requests be granted under SCAN
moving toward 0 and that thec current
disk scheduling algorithms? Assume that the disk arm is for each of the
position of the disk arm is over cylinder 50. Calculate the total hcad movement
algorithms. file. Each i-node includes
b) Consider the Linux file system that maintains a unique i-node for eachand a single triple indirect
12 direct pointers, a single indirect pointer, a double indirect pointer,
pointers. Tbe block size of the file system is 4KB, and a block pointer occupies 4 bytes. What is the
maximum file size that the file system can support? be the size of the file allocati
c) Suppose there is a lTB disk with 4KB disk blocks. What would
table (FAT) if a block pointer occupies 4 bytes?
3+3+2=8
7. Write short notes on any two of the following: 4 x 2=8
a) Process control block
b) Multi-threaded process
c) Resource allocation graph
d) Segmentation
5

a. With example explain the concept of total participation and partial partieipation
in ER model.
D. constraints
Explain theinuseS0L.
of DEFAULT, AUTO INCREMENT, UNIQUE, NOT NULL
C. Discuss the use of AVG and ROWCOUNT functions in SQ..
(1+1+(1+t1+]+l+(l +l)-8
6.
a.
What is the purpose of normalization in DBMS? Explain different types of keys
in a database with suitable examples.
b. Consider a relation R(M, N, 0, P., Q, R, S, T, U, V) and Functional Dependency set
FD1 = {MN ’0, M’ PQ, N ’ R,R ’ ST, P ’ UV}
Determine whether the given Ris in 2NF? If not, convert it into first 2NF then
into 3NF and show the intermediate steps. During conversion you should
minimize the number of relations in each nornal form.
(1+2)+5=8
7
a. Consider a relation R(E, F, G, H, 1,J, K, L, M, N) having a set of functional
dependencies-FD2 = {{E, F} ’ {G).[K} ’ {M}, UL) ’ {N})
Find the maximum possible number of super keys? Give explanation.
b. Consider a relation R(A, S, D, F, G) having aset of functional dependencies
FD3 = {{ AS) ’ (G}.(G} (D})
Find the candidate keys. Show intermediate calculations.
c. Consider a relation schema R(A,, A2, A3,....AE) with only prime attributes. What
is the highest normal form satisfied by the relation R. Give explanation.
3+3+2=8
 B. Sc Semester - l| Examination, 2021
Time: 3 hours Data Structure (CC- 5)
Full marks: 40

The question paper contoins six Questions. You may answer ony four out
0j them.
All questions are of equal marks

1. How is a double linked list different from a single linked list? Write
appropriate algoritnms Tor
nserdn8 a node at and deleting a node from (i) the beginning, (i) the middle and (m) the end, in
a double linked list.

3 + 7= 10

2 Indicate the steps involved in evaluating a postfix and a prefix expression. Show the contents of
the associated stack in every step for the following postfix
expression.
623+-38 2/+ *2+3 +
(3+3) + 4 =10
3 (a) What is a Queue? Why is it known as FIFO? Indicate the steps involved in insertion and deletion
of an element in a Double ended queue into/from either end.
(b) Specify a data structure used in the context of LIFO specifying the operations associated.
(2 +1+4) +3 = 10

Define a tree. What is a rooted binary tree? Construct a binary tree, exhibiting all intermediate
steps, given the corresponding Inorder and Postorder traversals as follows -
Inorder: DGBAHEICF and Postorder: GDBHIEFCA
Is it possible to determine the Inorder traversal ofa binary tree given the Preorder and Postorder
traversals? Justify.

1 +1+6+2=10
balancing? What is an AVL
5. What is a Binary Search Tree (BST)? What is the significance of height
Construct an AVL
Tree? Given a specific sequence of data arrival, is the AVL Tree unique? Justify.
following seguence of data
Tree. demonstrating all intermediate strUctures, from the
62
23, 34, 19, 71, 44, 32, 29, 25, 53, +1+1+
1 1+6= 10

6 Write short notes on (any two):

(a) Threaded binary tree
(b) Circular linked list
traversal
(c) BFS vs. DFS in graph
5x 2 = 10
 B.Sc. (Honours) Examination, 2021
Semester-III
Computer Science
Course: CC-6
(Operating Systems)
Time: 3 Hours
Full Marks: 40
Questions are of value as indicated in the margin.
Answer Question No. 1 and any four from the rest.
1. a) Can we implement virtual memory using a single level of
b) Can a deadlock occur while using semaphore? memory? Justify your answer.
Justify your
c) Can we relate the locality of reference with the L.RU pageanswer.
answer.
replacement algorithm? Justify your
d) Why does each entry of the inverted page-table containa process id?
4 2 =8
2. a) Considering the following list of jobs, draw the CPU Gantt chart, calculate the average waiting
time, and CPU utilization for each of the priority (smaller the integer implies higher
priority ), and
RR CPUscheduling techniques, where time quantum is 4 ms. Assume that the context-switching
overhead is 0.1 ms.

Process CPU burst time (ms) Priority Arrival time (ms)

P 8 3
P2 6
P3 2
P4 8 4 5

b) Mention two scheduling criteria that need to be minimized and two scheduling criteria that need
to be maximized for the CPU performance. (1+3+2)+2=8

3. a) Consider the following snapshot of a system where columns indicate resources and roWS
indicate processes:
Allocation Max Available
A B A A
7 3 2 1
P
P? 3
1 9 2
P4 0 2 2
P5 2 3

Answer the following questions using Bankers' algorithm:

from process Pl arrives for (1, 0, 0), can the request be
Is the system ina safe state? If a request
granted immediately? Justify both of your answers.
sufficient condition tor
When cycle in the resource-allocation graph is a necessary but not a (3+2)+3-8
b)
deadlock? Answer with an example.

paged virtual address space for each process using a one-level page
4. a) A system implementsof avirtual address space is 16 MB. The page table for the running proe
table. The maximum size
includes the following entries:
 B.Se. Examination (Generic), 2021
Semester - I||
Computer Science
Course: GEC 3
me: Three Hours (Introduction to Database System)
Full Marks: 40
Answer Question I and any four from the rest.
1.
Answer any four Questions.
a
Discuss the role of the DBAs.
b. What is data definition language (DDLY? Provide two
examples.
C. Discuss the differences between char and varchar types?
d. What is the command to remove a table from the database? Give an example.
e. With example, explain how As clause is used in MySQL?
What is the view of a database? Why it is used?
g. Which clause comes first Having or Group by and why?
4X2 = 8
2.
a. Discuss the drawbacks of file systems over database management systems
(DBMS).
b What is physical data independence?
c. Why is Data Abstraction needed in DBMS? What are its levels?
2+2+(2+2) =8
3. Consider a university database for scheduling of classrooms for final exams. Use
following entities and consider appropriate relationships between them to design the
database.
a. Student with attributes s-id, s-name, dob, address, contact number
b. Course with attributes c-name, department, and c-number
C. Section with attributes s-number and it is dependent on Course
d. Room with attributes r-number, capacity, and building
Draw an ER diagram for this database and write down the schema. Specify key attributes
of each entity type, and structural constraints on each relationship type. State any
unspecified requirement(s) and make appropriate assumption(s) to make the specification
complete.

4 Consider the following database schema of an Institute

Instructor (id, name. dept_name, salary)
Department (dept name, building, budget)
Form the following queries in SQL:
alphabetical order.
Find the name of all the instructors arranged indepartment
instructors in 'Computer Science' with salary > 50000.
b. Find all the
 B.Sc. (Honours) Examination, 2O19
Semester-1||(CBCS)
Computer Science
Course : CC-7
(Computer Networks)
Time: 3 Hours FullMarks : 40 60
Questions are of valuc as indicated in the margin
Answer any five questions
1. a) Illustrate diflerential Manchcster coding with an example. 4
b) Somet devises a new line coding scheme hy modiving Manchester coding such that. the
information carring transitions are moved to the beginning of bit boundaries, and clocking
transitions are moved to mid-bits. Show the waveform for input bitstream |100010). 2
c) Is there any bitstream for which the wayeform for NRZ-L and the new encoding mentioned
2
in (b) would be identical? Justify.
a. A data modulation scheme is devised with 4 bitssymbol. The amplitude of the carrier sinusoid is
modulated as pcr first 2 bits of each symbol. The mapping is : 00 -L, 01- 2L, 11- 3L, 10 -
4
4L. The phase is modulated as per the last 2 bits of each symtbol using the mapping : 00 -
n/4, 01 - 3r/4, 11-5n /4, 10- 7r /4. n
a) Draw the signal-space diagram of this modulation scheme.
b) Draw the signal-space diagram of 16-QAM for the same value of L. 3
the same
c) Compare thc average powcr of the modulation scheme with that of 16-QAM for 4
value ofL and symbol durat ion.
CRC with gencrator =
3. a) In a data communication systcm, each byte is appended with 4-bi
1|101. Find the codeword for input byte = 10001011.
the CRC check in the
b) Verify if transmission error in 1", 6", and last bit can be detected by
4
2
recciver.
detectable by this CRC chcck. 3
c) Find a transmission error pattcrn which is not
framing if flag =01|11|10 and input stream
4. a) Find the number of bil overhcads for flag-based 3
= 0101 1Ill10101||||11110|11110.
3
a suitable example.
b) Illustrate character-based framing with based framing if the maximum number of bytes in
c) Find the amount of bit overhead for length 2
the input packet = 1500. different sections, and
address 160.24.0.0. There are 8
An organization has a single class-B for the organization and one gateway
for
has 10 units. There is a main gateway star-connccted
cach section a
the main gateway are connected in
each section. The section gatgeways and gateways through
also connected to all its unit
optical-fibre network. Each section gateway is gateway
each unit is connccted as a DHCP server access
high-speed token-ring network, and Hosts within each unit are served through
the
WiFiaccess Points using LAN cables.
points. within each unit.
Find the maxmum number of hosts
a) unit.
the subnet masks for cach section and gateway as part of
b) Find
cach section and unit; and IP addresses of cach
c) Allocate subnet id's lor
data fllowing from unit 4 of2
their connected subnets.
repcctive gateways to enable
entries in
d) Find the routing table section 8 within the
organization.
10
section Ito unit 6 unit of
designed with a medium with speed of signal=
nctwork is to be
6A slotted ALOHA bus rate 100 Mbps, frame
length 1500 bytes. P.T.O.
m/sec, peak data
 (2)

2.a) Consider a system with 24-bil virtual and 22-bit physical address spaces along with 2 KB
page size. The page table for a running process includes tlhe following entries:
|Page No0. Frame No.
0

How many bits are required for each page table entry? To which physical address the virtual
address 2050 translates to? Which virtual address will translate to physical address 2050?
b) Consider a paging system with the page table stored in memory. If a memory reference takes
200 ns. how long docs a paged memory reference take? If we add TLB with a hit ratio of
90%, what would be the effective menory-access-time? Assume that finding a page-table
entry in the TLB takes 20 ns.
c) Briefly explain the inverted page table. 3+2+3-8
6. a) Find the page reference string for the following virtual addresses by the CPU in a time span.
Assume that acddresses are all in decimal and page size is 100 bytes.
705, 75, I05, 255, 65, 350, 325, 50, 75, 3S, 400, 205., 307, 55, 300. 201, 100, 250, 30, 150.
730. 60, 150.
Find the number of page faults using LRU page replacemnent algorithm with three page
frames.
b) Briefly explain C-SCAN disk scheduling algorithm.
c) Briefly explain the structure of Unix Inode. 3+2+3=8
7. Write short notes on any two of the following : 4x2=8
a) Process control block,
b) Hardware-based solution to the critical-section problem,
c) Resource allocation graph for detecting deadlock,
d) Unix internal vs. external commands.
 B.Se. (Honours) Examination, 20019
Semester-l|l (CBCS)
Computer Scienee
(ourse:CC5
(Data Structures)
Time:3 Hours Full Marks : 40
Questions are of value as indicated in the margin
Answer any four questions
I. a) lndicate the difference between a binary search tree and height balanced trec providing
suitable examples. 2
b) Construct an AVL tree showing every intermediate step of the following elements
35. 26. 73, 39, 24, 45, 62, 57, 49, 41
2. a) Critically elaborate the pros and cons of the following data structures -
4
() Singly linked list, (i) Doubly linked list (iii) Circular linked list
b) Define Stack indicating its usefulness. In this context discuss the associated operations using
singly linked list. 2+4=6
3. Consider the NULL Spccificd preorder traversal of a rooted binary tree

a) Is it possible to construct the binary tree uniquely from this? If yes, deduce it. If no, justify
why is it not possible. |+4=5
b) Looking at the sequence above determinc the leaf nodes. How many leaf nodes are there?
2+1=3
c) Can you find out the NULL specified inorder traversal? Is there any interesting observation
in the pattern of the scquence? It1=2
4. a) Why do we nccd hashing?
b) Given the size of a hash table in 10and the key values are
27, 80, 45, 32, 17, 69, 55.
the given order.
Draw the table (step by step) that results after inserting the above elements in
by -
for cach of the following cases below when collisions are handled 2+3+2-7
i) Linear probing, (ii) Double hashing (ii) Separate chaining. 2
c) Biefly describe Coalesced hashing.
associated. 4
a) Consider a queue clarifying the operations linked list and linear array
b) Compare and contrast inplementation of queue using linear 2+2=4

Justify the advantage of doubly linked list over singly linked list in implementing queue. 2
c) 5x2=10
6. Write short notes on (any two):
a) DEQUE
b) Two dimensional dynamic array
c) Threaded binary tree.
 Allocation Max Available
Process
A BC ABC A BC
3 32
010 753 Tir
Po
P: 2 00 32 2
30 2 902
P
21| 2 2
P
0 0 2 4 33
P: algorithm:
Answer the following questions using Banker's
Is the system in safe state? Justify.
Ir Process P, requests one additional instance of resource type A and two instances o
resource type C. can the request be grnted immediately? Justify.
c) Consider two concurrently running process: P, with statement S, and P: with statement S.
Suppose we require that S, be executed only after S has completed. How do you implement
this scheme using semaphores? 3+3+2=8
5. a) Why are segmentation and paging sometimcs combined into one scheme?
b) A system implements a paged virtual address space for cach process using a one-level page
table. The maximum size of virtual address space is 8 MB. The page size is 1KB and the
maximum physical memory size of the machine is 1MB. What is the maximum number of
entries in a page table? How many bits are there in a virtual address? Suppose the page table
for a running process includes the following entries:

Page No. Frame No.

4
1

To which physical address the virtual address

translate to physical address 3075? 1039 translate to? Which
c) What is locality of virtual address will
6. a) Find the page reference?
reference
time span. Assume that string for the following logical 2+4+2=8
7000, 325, 1010, 2123,addresses are all in decimal and addresses generated by the CPU in a
2105, 620, 1030, 7042, 17, 2025, 20, page size
3034, 40, 70, 2011, 310, 20, is 1000 bytes.
Show the 1095, 1023, 1050. 3037, 30S7, 2040,
conents of the frames after cnch 1010,
page-replacement
In cach
case?
page reference, assuming the LRU and
algorithms are used with three page frames. How many page fault optimal
b) Suppose that the
disk
50, 100, 200, 150, 30, request qucue contains requests for occurs
SSTF disk 70, 300, 400, 500. In which sectors on the following
is over the head schcduling order cylinders:
by assuming that thewill the requests be handled
7 cylinder 150, algorithms
Write short notes on any Calculnte the tolal head current position of the diskunder
a) Process contro two of the
lollowing : movement. arm
c) b) Interprocess communication
Multi-threaded process d) FAT 32 file systenm (1+2+2)+(1+2)-8
2x4=8
 Find the average salary of the instructors for each department.
d. Find name of all the instructors who have a higher salary than some instructor in
*Physics department. 2+2+2+2= 8
5.
a. Define Functional Dependency. Explain nontrivial Functional Dependency with
an example.
b. Consider a relational schema R = (A,B, C, D, E, H) on which the following
Functional Dependencies hold:{A ’ B, BC ’ D, E ’ C, D ’ A}. What are the
candidate keys of R?
c. Given a set of Functional Dependencies F = (AB ’ CD, AF ’ D, DE ’ F,C’
G, F ’ E, G ’ A}. Find the closure of ABF.
(1+2) +3+2-8
6
a. What is Data Redundancy? Write down the disadvantages of it.
b. What are the additional constraints 2NF imposes on a relation which is already in
INF?
c. Given a relation R{X, Y, Z, W, P} with a set of Functional Dependencies: G, G =
{X ’Y,Y ’P,Z ’ W), determine whether the given relation is in 3NF. If not,
then convert it into 3NF.
(1+1) +2+4-8

7. Write short notes on the following topics (any two)

a. Integrity Constraints
b. Weak Entity
c. Natural Join
d. Nested Relational Model
2X4-8
 |2|

a a) Sohex+*y= sin(log, x*).

b) Apply the method of variation of parameters to solve d'y +y= cos x. 4

c) Solve the equations dy

dt =-Wy and dt -= Wx and show that the point (x, y) lies on a
circle.

Group-B(Marks: 20)
Answer any two questions. 10×2=20
7. a) Form a partial differential equation (PDE) by eliminating the arbitrary function
from
z=eoa-by), z=z(x,y). 3
b) Give one example of each of the following exclusive types of first order PDE in two
independent variables:
i) linear ii) semilinear iii) quasilincar iv) nonlinear.
c) Find the general solution of the PDE +2019 =2020. Hence, show that the Cauchy
ôz
problem
solution.
+201992020,
y z(x,y) = 2020 on the line 2019x-y =0 has no
3+2
8. a) Find the equation of the integral surface of the PDE

2y(z-3)+(2x-)-(2r-3).
which passes through the circle z =0, x²+y' =2x.
b) Using Charpit's method, find a complete integral of x*

9. a) Show that the Partial differential egquations

*and z*-2xy are
compatible and find the one-parameter family of common solutions. 2+3
b) What do you mean by a singular integral as applied to the solution of first order nonlinear
PDE

Hence, find the singular integral of. I+4

 B.Sc. (Honours) Examination, 2018
Semester-I1|
Computer Science
Course:CC-6
Time :3 Hours (Operating Systems) Full Marks : 40
Questions are of value as indicated in the margin
Answer question No.l and any four from the rest.

1. Answer any four of the folowing: 4x2=8

a) Draw the state transition diagram of a process.
b) Differentiate between a program and a process.
c) What is system call? Write an cxample.
d) What do you mean by virtual memory?
e) What is belady's anomaly? Write an example.
) What is thrashing?
2. a) Distinguish between short-tcrm scheduler and long-erm schedulcr.
the
b) Consideering the following list of jobs, determine the CPU Gantt chart and calculate
(1 ms
average waiting time for cach of the FCFS, Preemptive Priority, Round Robin
quantum) scheduling techniques.
Arrival Time
Process Burst Time (ms) Priority
P. 8 4
1 2
P 6
2 2
P:
2
P. 9
3 3
P 3
(Ims Quantum) scheduling technique where
Calculate the CPU utilization for Round Robin
context-switching overhead is 0.1 ms.
scheduling algorithm is optimal with respect to average witing time for a
c) Show that SJF 2+4+2=8
given set of processes.
3. a) What is critical section problem? multiprocessor system? Briefly explain how to
Why is it uscful for semaphores.
b) What is busy waiting? problem by modifying the classical definition of
overcome busy waiting the problem using
synchronization problem andsolve 1+(1+1+2+(1+2)-8
readers-writers
C) State the classical
semaphores. deadlock.
Briefly explain how it can be used to detect
) What is
resource-allocation graph?
P and three resource types A, B, C.
five process Po through instances.
Considering a system withinstances, type Bhas and type C has 7
5 instancestaken:
Kesource type A has 10 snapshot ofof the system has been
Suppose at time ta following
P.T.O.
 B.Sc. (Honours) Examination, 2019
Semester-Il (CBCS)
Computer Science
Course: CC-6
Time: 3Hours (Operating Systems) Full Marks : 40

Questions are of value as indicated in the margin

Answer Question No.l and any four from the rest
1. a) Distinguish between Unix kernel and shell.
b) Why page size is always a power of 2?
c) What is virtual
d)
memory?
What is the difference between zombie and orphan process? 2x4=8
2. a) Considering the following list of processes, draw the CPU Gantt chart and calculate the
average turmaround time, and the average waiting time for each of trhe preemptive SJFS, and
Round Robin (with time quantum 3 ms) CPU scheduling algorithms.
Process |CPU burst time (ms) Arival time (ms)
Po
| P, 2
P.
P, 8 3

b) Does the SJFS scheduling algorithm suffer from starvation? Justify.

c) What is a multi-threaded process? How is it advantageous over a single-threaded
3, a) Briefly explain the purpose of fork), exec), exit), and wait) system calls in connection with
the process life cycle.
b) Can deadlock be occurred due to the use of semaphores? Justify with example.
c) State the classical reader-writers synchronization problem and provide a solution using
semaphores. 3+2+3=8
4. a) Briefly explain the necessary conditions to occur deadlock.
b) Consider the following snapshot of a system:
Allocation Max Available
R R R R R R Ro R R R
R R
0 0 5 0
P.
0 ) )
P
4 5
P.
3 2 0 6 2
P 0
P4 )
algorithm:
Answer the following questions with justifications using banker's
Is the sVstem in a safe state? If a request Irom process P arrives for (0, 4, 2, 0), can the
request be granted immediately? svstem.
c) Briefly explain the structure ofUnix file 2+3+3-8

P.I.0.
 JseSepi
swerseripts
eschgroup
for
LAamination
Semester-1I (CBCS) 2018
(
MathematCourse:
Generic Elective ics GEC-3
ime: ThreeHours
Differential Equations and its Applications )
Ouestions are of value as indicated in the margin. Full Marks: 60
Notations and symbols have their usual
meanings.
Group-A
Answer any four questions. :60

Canstruct a differential equation by elimination of arbitrary constants a and10-4=40

b from
the equation ar* +by =1.
Also find the order and degree of the differential equation. 2+%+%
Find the general solution of the following diferential equation by using the method
of variation of parameters: 5

+y= sec x.

c) Examine for the singular solution of the differential equation

2)(2-)-4(0-y).
of
2 a) Show that e,e and e are three linearly independent solutions
2+1

dr
Hence find the general solution.
equations
b) Solve the simultaneous differential
th
d -7x+y = 0,

dt
2x-5y =0.
c) Reduce the differential equation substitutions u=r and
Clairaut's form by the
to 3

v=y'. 3
following differential equations: 4
3. general solution of ftthe
Find the 3
a) r'p' +xyp -6y - 0. P.T.0.
b) y=x+p'.
C) y' logy = xyp+p.
P.T.O
 Use Separate
Answer seripts for Undergraduate Examination 2019
each group Semester -Il(CBCS)
Mathematics
Generic Elective Course: GEC-3
(Differential Equations and its applications )
Time: Three Hours Full Marks: 60
Questions are of value as indicated in the mnargin.
Notations and symbols have their usual meanings.
Group-A (Marks: 40)
Answer any four questions. 10x4=40
a) Determine the differential equation, whose primitive is x cos 0+ ysin =5, where is a
parameter. 3
b) Solve the following differential equations:

i) (*+1)-24ry =x(x' +2x'+1)cos.,

(y'+ 2xy)dy =ds. 3+4

2. a) Show that is an integrating factor of the equation

(+y')àr-2xy dy =0. 3

b) Solve the following differential equations:

-sin(x +y),
ii) 3+4
3. a) Find the equation of the family of curves, that cut a system of concentric circles

*+y' =a at an angle 45.

b) Find the orthogonal trajectories of the following families of curves:
r(l+ cos0)= 2,
4+3
i) +y'+2Ax +9=0, where is aparameter.
4. a) Solve the differential equation v{x{2x+1)p-y°}= 2r, p= dr
b) Solve y= px+ya'p' +b and obtain the singular solution, if any. 4

c) Reduce the differential equation y=2px+y»p by substituting y' =v to Clairaut's form

and then solve it.
e sinx and e' cos.
5. a) Show that linearly independent solutions of y-2y'+2y =0 are
What is the general solution? Find the particular solution y(x) with the conditions
y(0) =land y'(0)=-3.
4

d'y t20y =rr

b) i) Solve

ii) Solve d'y +4y = sin 2x. 3+3

P.T.0.
, a) Find the surface which intersects the surfaces of the
one-parametric system
z=3cxy(x+y') orthogonally and which passes through the hyperbola
x-y' =a', z=0. 5
b) Find the general integral of the partial differential equation
2xy+z*)p+y(2y +z)q=z.Write a short note on geometrical interpretation of
the partial differential equation 6

P(x,y,z)z, +O(x,y,z)z, =R(xy,z). 3+2

3. a) Show that z= ax+ by +a' +b is a complete integral of the partial differential

equation z= pr+ qy +p´+q'. Hence obtain the singular integral, if 2+1/%+1½ any, and
particular integral assuming a =b.
Show that the partial differential equation p'x+g'y' =z can be transformed to
b)
f(p,g)=0 by using suitable transformation. Hence solve the equation
the form 3+2
using Charpit's rule.