l Ulu l l'W. UI n1gc.

::s L-
M.TEC H (DSC)
FJRST SEMESTER
MID SEMESTER EXAM INATIO N
Septem ber 2024

DSC 505 DATA MANA GEME NT AND ETHIC S

Ma x. Marks: 20
Time I :30 hours
Note: All Questions Carries equal marks. Assum!J an suitable miss in da ta if an

QI. Explain Lhe following terms:

(a) Data abstraction wilh example
(b) Schema diagram with example
(c) Data model with its types
(1*4= 4) (COlj
(d) Logical vs Physical data independence

Q2. Answer the following :

(a) Three-schema architecture with well labelled diagram .
(b) Two-Tier vs Three-Tier ClienUServer Architectures for D13MSs
.,, (2 *2=4) fCO I I
Q3 (a) Make ER diagram for the requirement Analysis for Bank Management System
(Assume aUi-ibutes of Entities by yoursel f) :

i) A bank can have multiple branches associated to it. Each bank should have at least
one branch and every branch must be associated with ex actly one bank.

ii) A branch can maintain multiple accounts and each account be long to exactly one
branch. A newly opened branch might not have any account associated to it

iii) A branch can offer mulliple loans and each loan must belong to exactly one branch
A newly opened branch might not have any loan associated Lu it.

(iv) An account can be held by mu lti ple customers (joint account ) and n single
customer can hold mulliple accounlS .

(v) A loan can be availed by multiple customers UoinL loan) and a single customer
can avail multiple loans.
(vi) A customer who has availed a loan, might not have an account and a cu st0 mer
who holds an account, might not have availed any loan.

(b) Convert the above obtained ER diagram into tables . with schema diagram
representation (2+ I) IC03 I

Q4. Consider the following MAILORDER relational schema describing the data for
a mail order company :
PARTS (Pno, Pname, Qoh, Price, Olevel)
CUSTOMERS (Cno, Cname, Street, Zip, Phone)
EMPLOYEES (Eno, Ename, Zip, 1-ldate)
ZIPCODES (Zip. City)
ORDERS (Ono, Cno, Eno, Received, Shipped)
ODETAILS (Ono, Pno, Qty)
Qoh stands for quantity on hand, the other attribute names are self-explanatory.

(a) Specify and execute the following queries using the Relational algebra query on
the MAILORDER database schema

I) Retrieve the names of parts that cost less than $20.00 .

2) Retrieve the names and cities of employees who have taken orders for parts
costing more than $50.00.

(b) Specify and execute the fo llowing queries usmg the SQL query on the
MAlLORDER database schema

1) Retrieve the pairs of customer number values of customers who live in the same
ZlP Code.
2) Retrieve the names of customers who have ordered parts from employees
living in Wichita.
3) Retrieve the names of customers who have ordered parts costing less _than
$20.00.
4) Retrieve the names of customers who have not placed an order.
5) Retri'eve the names of customers who have placed exactly two orders.
(2+5=7) 1co21

Q5. What do you understand by subqueries? Explain the concept and execution order
of child and parent query. Also explain Co-related subquery with example.
(2) 1co21
 Total No. ofPages OJ Roll No .... ...
FffiST SEMESTER
M.Tech. (SWE/DSC)
MID TERM EXAMINATION Sept-2024
SWE 5406/DSC 504 - MACHINE LEARNING
Time: 1:30 Hours Max. Marks: 20
Note: Answer ALL questions. All questions carry equal marks.
Assume suitable missin data, if an .

QI . A) What is Perceptron convergence 111eorem? (CO2) [2]

B) What do you mean by Overfitting? Explain two techniques to reduce iL (CO i) [2]
Q2. Explain different feature representation strategics for various types of data_ (CO2) [4]
Q3. Based on below table, find Information gain for Outlook, Temperature, Humidity, and
Windy using entropy as splitting criteria.
/O utlook
---
Tempe r.-ture
-
Humidity
- --- Wind Played footb ... ll{ye~/no)
Sunny Hot ' Hl&h wea k No •
Sunn y Hot ;, Hl&h Strona No
/ Ove rc.-st H ot '
R a in MIid t ' hilh
High
Weak
We•k
Ye s
Yes
•
•
/R•tn Cool . Normal We•k Yes
I
Aa , n Cool , Normal Str on tt No '•
\Ovar..t,u Cool , Normal serons Yes )'I
Sunny
S unny
Mild I
Cool . High
Normal
weak
weak
No •
Yes '
R ain M Iid • l ,1ormal w e ak Yes
1s unny
Ove r~ st
Mild
M Iid •
• Normal
Hl&h
Strona Yes .'
1
Strona Yes •
overc.-st Hot \ Nor m.- 1 Wea k Ye s
Rain Mild \ HIIJh Slrons No
'
'
(CO2)[4]
Q4. Calculate the regression coefficient and find regression line x on y for the given data.
(CO2) [4]
X 2. 4 e a
V G e "12

QS. A) How logistic regression and sigmoid function are related? (CO2) [2]
8) Explain Binary Cross Entropy as a loss function? (CO3) [2]
 - -- - - - . - - ,
FIRST SEMESTER
M.Tech. (SWE, DSC, RSE)
MID SEMESTER EXAMINATION September-2024
SWE505, DSC507 Advanced Data Structure
Time: 1:30 Hours Max. Marks: 20

Note: Answer ALL questions. All questions carry equal marks.

Assume suitable missing data, if any.

Q.1. Write short notes on:

a. Priority Queue
b. Header Linked List
c. Skip List
d. Circular Doubly Linked List
e. Sparsity [5) [C02 J
Q.2. Defin e Spars e Matr ix and discuss its time complexity. Cons ider
an array
arr[ I :9, -4: I, 5: 10] with base address as 400. Assume that each eleme
nt
occupies 2 bytes of memory. Find the address of the element arr[S][-1 ][8]
using the row-major order. (Sl(C 02]
Q.3. Implement a function reverse K(Q, k) that reverses the first k eleme
nts
of a given queue Q while maintaining the order of the remaining elements.
For example, if the queue is Q = [10, 20, 30, 40, 50] and k = 3, the outpu
t
should be [30, 20, 10, 40, 50]. You can only use the bas ic queue operations
and one additional stack. (5][C 02}

Q.4. You are developing a music playlist app where songs are mana
ged
using a linked list. Each node contains inform ation about a song, such
as
song ID, name , and artist. The app also supports a "Recently Played" featu
re
implemented using a stack to track the last few songs that were played. Wri
te
pseudocode to add a song to the "Recently Played" stack. If the stack is full
(maximum of 5 songs), remove the oldest song. [5][C02]
.. u,w Hu. UJ rages:uL J\Vll JWV, , , . , , • ..., . , , . I -

FIRST SEMESTER
M.Tech. (SE/DSC)
MID SEMESTER EXAMINATION SEP-2023

SWE/DSC 5405 ADVAN CED OPERATING SYSTEM

Time: J:30 Hours Max. Marks: 20
Note: Choose any 5 questions
Assume suitable missing data, if any.

1. Explain the role of a Bootstrap program in Linux and where it is located.

[5] [CO J]

2. Compare the interrupt handJing mechanisms polling and vectored

interrupt system [51 [C021

3. For the following processes

Process Anival Time (ms) Burst Time (ms) Priority

Pl 0 8 2

P2 1 4 1

P3 2 9 3 '

P4 3 5 2

PS 4 2 4

Find the Average Turnaround Time and Average Waiting Time for each
scheduling algorithm.
1. Round Robin with 4 quantum

2. Preemptive SJF (CO2] (5]

4. Explain the working of Test and Set for synchronization and mutual
exclusion. What are the perfonnance issues related to it tS J (CO2 J
5. Explain how Deadlock can be prevented along wi th proposed solutions
[5] [C03]

6. a. Consider the 5 processes and 4 resources, each with a single instance

and with the following allocation [C03] [3]
D Pl holds R1 and requests R2.
D P2 holds R2 and requests RJ.
D P3 holds R3 and requests R 1.
D P4 is holding no resources and requests R4.
D PS holds R4 and is not requesting any additional resources.

1. Create a resource al location graph

ii. Analyse the graph if deadlock occurs, which processes are
impacted, and how you can handle the deadlock if it occurs.

b. What is a context switch and how it deals with a PCD [C02 J [21
 7
Tntal No. nr Pages : ~
Roll no ........... ..

FIRST SEMESTEf ~
M.Tcc h.
MID TERM EXAMINA TION Scptembcr-202-1

COURSE CODE: SWE-SU/DSC -511 COURSE TITLE: RESEARCH PAPER WRITING

Time: I :30 11011 rs Max. Marks : 25

Note: All question are compulsory.
A II questions carry equal marks.
Assume suitable missin _~ data, if any.

Q. 1 What is Research and why we do research ? Whal are the vanous

characteristi cs or research'7 What is the nature or research process?
[5 J[CO I]

Q.2 Whal are the various stages of a research process? Explain

l5Jf CO I]

Q.J Whal are the various types of empirical studies? Exp lain.
f5l[C01J

Q.4 (a) Differentiate between sy stematic literatu re revi ew and survey papc:r.
(b) List the import:rnce of research from the pers pective o f sofh vart'
industries, academicians, and researchers'?
Is11 co 1,cn~1

Q.5 (a ) What is im pncl fa ctor nnd 11 -in de~? Explain how do we L'akulote them
with nn example.
(h) Wha l is th e diffi.:renci.: between conle rcn ce paper, _i numnl paper, and
book chapter?
1s11co11
 Roll No ....
Total No. of Pages () I
FIR ST SEM EST ER
M.Tech. (DSCJ
Sep tem ber -20 24
MID SEM EST ER EXAMINATION
IN CO MP UTE R
DSC 501 MATHEMATICAL FOU ND ATI ON S
SCI ENC E
/Jlfla. J'v/arks: 2{)
Time: 1:30 Hours
l marks.
Note: Answer ALL question s. All question s carry equa
Assume suitable missin g data, if any.

h 1s more likely a :.um ol 11 or a sum o l

QI lnl A six-sided die is rolled 1hrec limes 111depcnde111ly Whic [JI {col l
12? G1veade1ailedexplana1io11
0111hc rules ofprobabiltl} wuh fomi ulas
[bl Whal urc lhe axioms of probabil11y 1hcory'/ Men11 [21 [col I

A hutch of one hundred ilems is inspecled by 1es1m

g four randomly sc:lec led tlcm:. If one of lhc
Q2 fal 1:. accep tcJ 1f 11
brl11y 1hu1 1hc: bu1ch
fo ur 1s defec tive, lhc biuch 1s rejeclcd What 1s 1he proba [21 lcol l
conlains livedefec1ives?
[hi A random vuriahle X hns the fo llowing probab
d11y d1s1n bu111.m

~5)
f ind 1hc value of (i} K, (Ii} P(X~ 2) und (iii) l'(J<X

ol J1 sJ01111 i::vcnt:. ~ 1 -.; 1 ~ 1

QJ A par1i11 011 of 1hc sumple space O 1s a collecllun
n = u~= 1S,
(i) Show thnl for any event A, we have
P(A) = t:~1 /J(A n
S,)

(.' we hnv1:
(II) Use part (i) to show 1ha1 for nny event s A. B, nnd
n - P(A n ll n C)
/'(A) :; /'(A nn) + /J(A n C ) -t /'(An 11' C')
151 jc,) 11

dcn:.11) f11111.. 1111 11 1:-, giH·n b)

().j I( X 1s u con1muous rumlom vnrioble who:-.c probuh1l11y
f(r) = [c('1x - 2t l) 0 -... .\ ..._ 2}
0 ot /i e, 1111\ e

rind 1hc vo lu!! of (i} l. , (ii} 111c11n ,1f X