0% found this document useful (0 votes)
19 views14 pages

6th Sem Papers

Uploaded by

Vaibhav
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
19 views14 pages

6th Sem Papers

Uploaded by

Vaibhav
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 14

Scholar Number....

Name of the Student...


TECHNOLOGY BHOPAL
MAULANAAZAD NATIONAL INSTITUTE OF
ENGINEERING
DEPARTMENT OF COMPUTER SCIENCE &
EXAMINATION: B.Tech MONTH and YEAR: September 25, 2023

VII Branch: CSE Subject Code: CS 5703


Course: B.Tech Semester:
Maximum Marks: 20
Subject Name: Digital Image Processing Date: 27-09-2023 Time: 09:30 t 11:00
Duration: 1:30 Hours

Note: ifany.
Marks COs
Questions
o. No. 3
to enhance the visuality of the given
1 Design a weighted filter mask using GCD number
weighted mask. 6
Image and compare their results with average
92 78 100
12 24
130 155 233 3
output 4
the image is Noisy or no? What will be the
2. Consider the image of question no. Ito identify
image after applying adaptive filtering?

1/1
6 2
3. A given image has the following histogram: Compute the probabilities of occurrences
of each grey value in the inage. Equalize the given histogram and recompute the grey
value probabilities. What diference do you notice in the two sets of probability
values?

2 3 4 6 7
Gray
values

No. of 3244 3899 4559 2573 1428 530 101 50

pixels
4. Analyze the given intensity values of an image using Log Transformation with different values ofC 4 1,2
(0.1 to 0.9)in tabular form. Writhe down the output values for the same.
150 152 148 149
147 152 151 150
152 148 149 151
151 149 150 148

2/1
Name of the Student.
Scholar Number.0!1243)
MAULANAAZLAD NATIONAL INSTITUTE OF TECHNOLOGY BHOPAL
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
EXAMINATION: MID-TERM September 2023
Course:B. Tech Semester: VII Branch: CSE
Subject Code: CS 5702 Subject Name: Network & System Securities
Duration: 90 minutes Date: 29-10-2023 Maximum Marks: 40

Note: 1. Atempt all questions. 2. Assume necessary data, if required, and mention it clearly.
Q. No. Questions Marks COs
CO1
I(a Discuss the working principles of the RSA algorithm for public-private (5)
key cryptography. In a public-key system using RSA, you intercept the
ciphertext C= 20sent to a user whose public key is e = 13, n=77. What
is theplaintext M?
(bj What is the entropy of the cryptosystem? A six-sided die rolled 7 times(5) CO1

vields 2 occurring twice and the rest of the numbers occurring once. What
is the entropy of such a system, assuming the die is fair? CO1&2
characters. (5)
2 (a) Device the Huffman coding for the following frequency of
Z K M C U D
Letter
24 32 37 42 42 120
7
Frequency 2
CO2
properties should it have to (5)
Define a cryptographic hash function. What
be considered secure and preserve integrity?
(5) C02
(9 What is a digital signature? How does the X.509 standard contribute to
3
the functioning of PKI?
(5) CO1&2
botnet, and how does it differ from other malware? How botnets
What is a
of Service (DDoS)attacks?
can be used for Distributed Denial CO1&2
(10)
Write short notes on any four:
identification
Authentication, authorization and
(i)
Web Securities
(ii) Buffer overflows attack
(iii)
Access control
(iv)
network security
(v) Trust management in spam
(vi) Anatomy of monetization using

CND*
Scholar Number..
Name of the Student.
BHOPAL
MAULANA AZAD NATIONAL INSTITUTE OF TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
EXAMINATION: END-TERM November 2023

Branch: CSE
Course:B. Tech Semester: VII
Subject Code: CS 5702 Subject Name: Network & System Securities
Date: 23-11-2023 Maximum Marks: 60
Duration: 3 Hours

mention it clearly.
Note: 1. Attempt all questions, 2. Assume necessary data, if required, and
Marks COs
Q. No. Questions
1(a) I. Case Study:- A kill chain is a systematic process to target and engage (5) CO1,2
an adversary to create desired effects. U.S. military targeting doctrine
defines the steps of this process as find, fix, track, target, engage, assess
(F2T2EA): find adversary targets suitable for engagement; fix their
location; track and observe; target with suitable weapon or asset to create
desired effects; engage adversary; assess effects. This is an integrated, end
to-end process described as a "chain" because any one deficiency will
interrupt the entire process.
Expanding on this concept, a new kill chain model is prepared specifically
for intrusions. The essence of an intrusion is that the aggressor must
develop apayload to breach a trusted boundary, establish a presence inside
a trusted environment, and from that presence, take actions towards their
objectives, be they moving laterally inside the environment or violating
the confidentiality, integrity, or availability ofa system in the environment.
The intrusion kill chain is defined as reconnaissance, weaponization,
delivery, exploitation, installation, command and control (C2), and actions
on objectives. Killchain has the purpose of gaining access to information
about the Industrial control system (1CS), learming the system and
providing mechanisms to defeat internal perimeter protections or gain
access to production environments. The phases of the first stage are
illustrated in Figure 1.
Intelligence-driven Intrusion detection system is proposed to be
developed. Suggest the different technology to be place at:
reconnaissance, weaponization, targeting, delivery, exploitation,
installation, command and control (C2), and actions.
STAGG
Cyber Intrusion Prepáratlon and Execution
ARING Reconnaissance

PAEPALATON Wexponiation Targeting

ATTEMPI Delivery
CYBER
INTROSION Exploit
SUCCES Store I mimics a
InstallModify torgeted and structured
ottock compalgn.
NANAGENENT ENABLENENT
SUSTAINNENT, ENTRENCHNENT
DEVELOPMENT &EXEUTiON Act

Discover Movcmcn: InstallExeCUte Lauch


Capture Collee Eyfiltrao Cler- De'enc

Figure 1. Cyber Intrusion Preparation and Execution


(b/ i) What is an access control and how it is used in
Banking? (5) CO1
(1) Consider a computer system with three users: Alice, Bob, and
Cyndy.
Alice owns the file alicerc, and Bob and Cyndy can read it. Cyndy
read and write the file bobrc, which Bob owns, but Alice can can
only read
it. Only Cyndy can read and write the file cyndyrc,
which she owns.
Assume that the owner of each of these files can execute it.
a. Create the coresponding access control matrix.
b. Cyndy gives Alice permission to read cyndyrc, and Alice
removes
Bob's ability to read alicerc. Show the new access control matrix.
a) Howthe basic requirements of security, integrity,
authentication, session (5) CO1&2
management, etc. are provided for e-commerce transactions? Describe the
working of SSL.
Consider the following threats to Web security and describe how each is
countered by a particular feature of TLS. (5) CO2

a. Brute-Force Cryptanalytic Attack:


b. Known Plaintext Dictionary
c. Replay Attack
d. IP Spoofing
e. SYN Flooding
3(a)| What is a buffer overflow and stack overflow? (5) C02

The administrator is building a web server that runs the following code
sequence, in which process req0 is invoked with a user-supplied string of
arbitrary length. Assume that process get) is safe,
CO1&2 Co1&2 Dehalwar
Vasudev
Dr
CO1 C02 Co1 C02

(10)
(5) (5) (5) (5) (5)
and |ASCII passwordsmustthat to
blockchainmany key
to per
aAssume limitations
multiplication encryptions trafficproxies
How public
code. printable
length. possible Web possible
this in programming?
for
practices? possible
used used million external
return; in
overflow addition, incharacters
95
all
****
**********END*****
structures it of
6.4
exhaustively the the
Describe security
get(buf); best is use all are
theseHow
buffer point
secure Cryptography?the ofrate that What
data integrity? 12 proxy." network
worms
process aexploitand for through for tolimited are encryption
test
isrequirement
traffic. Equivocation
and
Entropy
technologies logic passwords to in and proof
Zero-knowledge
(vi)
{*input) data practices
removed Curve? Web web
take four: management

l0
4)) organization' viruses,
various s
the are
"GET", can attacker
protect Curveis Ellipticpasswordsan it
will management any
machine
Rotor
req(char input); all with Malware, Kerberos
strcpy(buf, be What
basicand best can Elliptic
(!strncmp(buf, longsystem? for traffic?
that cracker proxy
such on
char
buf[256]); an cryptography?
thevulnerabilitiesthe and How defined notes Trust
process how the secure in thatcharacters the
common
are password UNIX
negationAssume second. via short
Explainare itmake isL(bYWhat
flowbe (ii)
Write (i) (ii) (iv)(v)
void What What aon can
if A
(a) |57a)
b) 4 (b)
MarksCO1 &5
Cos COS
EnggSubject pm
2023 12:00
Science
and (4) (4) (3) (8)
April,
Number.
Scholar marks-pm clearly. pixels
for Level-1 with figure.
only.
BHOPAL
TECHNOLOGY and
YEAR: 09:00 respectively,
Computer50 itand
mention two {1}
V= explain following
output
ENGINEERINGMarks: Time: to
and between up of
MONTH Branch:Maximum when image nature? be
(2,3) theshould
required distance the
Dm of
& and decomposeininvariant closing
diagram B=
SCIENCE data,
if when
OF
INSTITUTE CSE-5703
Code:
Subject Dm (3,0)
22-11-2023
Date: necessary
2.Assume and be
figure
with and 3
VII
Semester:
COMPUTER & is the
opening
q
,D4,Dg
Questions representation
transformation and
and
diagram
NATIONAL p shown
and Morphological
PROCESSING De of below:
OF coordinates example.
the operational
DEPARTMENT questions,Compute Wavelet code)
TERM
EXAMINATION:
END figure
AZAD measure with (Chain A
IMAGE all pixelin 10l(q) the output of Two
MAULANA
Attempt V={0,1}, 3 1 1
shown 0 1 1distance0
the explore output
CSE the 2 1 Object only
Student. Three
Duration:
hour
DIGITAL their the Draw
-Tech 1.Note: q.let image 1 {0,
V=
1}? Briefly
Let
(A). Compare
show Whyexample.
the and 0 1|1 (p) Note:
B.
p the
of Course: Name: Find (B)and (C)
Name 23
Q.No. Q2.
Q1.
C02&3 CO3 CO4&5

6) 4) (5) (6) (4) 6)

of Gray secret image.image,


calculations Apply it following
stretching domain. answer,
new the table. 0.01
the
the frequencyIf Consider
X yourthe
Lincar 787 the
image. error
the of
be image
Justify
will Do in 0.02
the 878 and an bit. and shown X6
What restoration. Output
perform 6 in 6th
domain message method.
bit,output
image. 655 as efficiency.
Xs 0.03 the
4th probabilities Shown
Ostu'S
histogram: Spatial bit, and
visualized secret the
0.07
417 enhancement the X4
2id Also
using
4
(0-100)? of extract
following 1054 categories the last construct - & X3 0.15 efficiently?
better 3 hidethe of symbol value
of to In output to 36 180165 35
211 Image techniques 0.30
the the range2 broad process LSB, method X2
threshold
160
bit
and the of image 35 37 B6
has get the detail an between
compare set
to 100
78 Mean Contra
4.Harmonic Shannon-feno0.42
Probability 175
image for
histogram a in the X1 the the image.160 200
is hided 80 200
70 75 given 36
levels in Steganography Consider find
given Describe and
Differentiate trimGeometric
2. 3.Hamonic segments 160 180 165
0
is each Symbols 35
ValucsNo
scale Grey ofpixels 50 60 Alpha Let's
message Compute
A the
(A) (B) for
26 12 45 (A) (B)
1.
(A) (B)

Q3. Q4 Q5
CO 1&2 1&2 1&2
2

201|1243) Marks
necessary. 5 5 5 5
BHOPAL doubling theunder Binomialbelow
the given thanfollowing
excavate,
CS-503
Code: 1,20}. = the
in P
complexity.
with that better
ENGINEERING
whenever/wherever 3
considered
key the inserting Pattern "iceberg".
TECHNOLOGY Marks:
Max
50 array 3, Assume
Branch:
CSE of on along 5, is theexhale,
the structure 15, the operation
Subject using operation
for splaying. of {10,time for
operation steps complexity for matching. Trie and
values its table) extract,
2023 arrays steps:
node analyse a "express"
seareh
& assumptions intermediate
Extract-Min Construct
Jan-May
SCIENCE key Top-Down
OF dynamic delete the intermediate
transition
pattern
following between 4 time,
and the icecream,
INSTITUTE Question(s)
a and for string
EXAM Perform the heap for algorithm. P.T.O.
COMPUTER suitable for thethe a used Tries
Semester:
6th complexitythe splayingdifferentiate analyse (alternatively,
all constructed iceberg,
the
methods. Perform
all showing be of
TERM complexity for
NATIONAL make with13. matching
illustrate and can search
andBottom-Up icicle,
OF
END Structures compulsory,amortized Tree
potential 6, Heap. heapandthe
DEPARTMENT 14, and and that the
Splay Fibonacci timeon automata timestring
binomial icecube,
Perform
AZAD 5,9, describe, complexity
analysis. min aababababaa,
such
DataHrs.are the and a 1,3,assumptions:Heap a
at extract
b}. the
MAULANA Construct
aggregate one an {a, thatRabin-Karp
ice,expresident.
3
Advanced questions Analysis Design,
andFibonacci a Designis Justify
sequence: Create
elements
Tech. Time:
Course:
B. Perform alphabet strings:
a) for b) the a) Heap
Attempting
All b) a) b) the
Subject: Q.No.
Notes:
1. 2 3
2

3 2 5 5

withwherel search of where= string exhale,


stored be or where
and andthe
filter h2(4word) to Positive for
along starting
array
101, Bloom 7, theare are 19}
of mod extract, structures
tree? words icecaps"
keysmod derivation consonantsin False 17,l8, (Prefix
|word| contains
search and
of 7) a
sequence dictionary,
"word'following in
icecream, the
* andresults 13, structures
(k binary = thatCompare
function with h1(word)
n). of entangle" 9, queries,
below a a string the filter 6,
alonglike O(login number iceberg, 5, different
hash 13. stored the when
functions Bloom 4, elements.
the behave range
key structure height in the words {1, operations.
for the the below, letters filtericicle, thewords. integers
Using
using following
order)
around have hash is Bloom theif
structure the
C#word) identify searched 7.
data listed icecube, of
heap
evaluated trees the of Suppose 8 to
sum range-query
treap with numberof of 0 the
13. treap. list this blackwords, state dictionary, from
treap(Min3, does where
maintained the array answer evaluate
is 18,constructed skip ice, expresident.
which
splitted red the
following the both indexed
sortedtrees)sum[0, 3] Q2-[2,
6]
7, the When the dictionary:
7, Identify
represents
2, mod for to
a the Describe that also searched
in
the
index, Q1=
key:5,
priority
Construct complexity. Positive
a are and
Segmented
the
12, Merge the C#(word) excavate, Given
cPrOve is word". :
elements insertion
the Keys:Split
theiris For 7 word the endingQueries
True
ay k i) ) b) a) size in b)

4
CO,
BT CO1
BTI CO2
BT2 C01
BT2 COI
BT3 BT3 BT3 CO2
C02 CO2 BT3 BT2 COI
COI BTI CO2
BT2

Subject
Code:
ME3605/ME4601/MES601
of Marks
b
and 5 5 5
BHOPAL 5 5 5 5 5

a Operations project System: IT gravity


purt significance. Interchangeability.
the
TECHNOLOGY, Attempt productivity.
management?
project
Explain Layout. for of
2023
Date:
April/May
Brancl::
CSE/ECE/EE
/ following location centre
Management with
marks. Process
50
Marks:
Max diagram the
factor
and attarctive using
equal and
INSTITUTE
OF multi the Standardization,
AOA Layout warehouse
carry Engineering an
Question and with city
Question productivity Producttools.
phases
of project 0.857
Reliability bangluru
NATIONAL
Management
of control 0.0858s Simplification, the
of any characteristics for
Examination All
Evolution factor different
detail. of quality ihe site
Questions. Path 0-85
VI single in make best
MAULANA
AZAD Engineering
Semester: Critical five the product
End-7erm the Management. Whatphase
are
the Differentiate -085 factors
the
the any
Fiveany
question
together. Determine
Explain Explain planningExplain ExplainCalculate Explain industry? method.
Tech., any What
Name:Hrs
Examination: :3
B. Solve
a
Subject
Course: b
b
Time
Note: SI
No. b
1. 2. 4.
3.
5
CO3
BT3 CO3
BT3 BT3
CO3 COI
BT2 CO2
BT2 CO3
BT3

10 10
6 4

for to
costfixes 15,000. factors relevant
company.icompany
t profit
6,00,000
Rs. 80,000
Rs. variable Life
Quality
supthewarchousc
ure
Ltd: Ltd
B 20% Sales net Rs. of Product study
consequences
400
.N=500
=
Y. W= andB
170 each 1,00,000.The
were
hy
nd The and case
C by units.The overheads Assurance on
scrved
suppliers Ltd Marginal
90,000 l5,000. Control industrial
600 A 3,00,000.
1,50,000
thc
wurchouse of Rs.
ofperiod Depict solution.
three
serve 500
respect6,00,000 Rs cost. fixed Rs. 1,50,000. Quality Quality
Rs. 90,000
Rs. any
thewill
"110)400
Ltd
A 25% of of Rs. on of management?
ncw Miles in profit production the profit OR with
300 100
=
Y 25% and Rs. the and
o that
u loxations
consruet
camiers
(140)
200 B
available companies.
companies.
aearn
is
Cost
of
unit}? certain
point affecting Assurance
Rs.10,000 aearnof sales.
Break-even
caseissues
tigure: ratio? sales Dabbawala
profit
Fixed (in
a Management
100
are to a BEPP/V during to cycle
0
Thetnuck
following aFollowing
particulars required
for anda salesfrom factors
going
C. 600 500 400 300 200 100
bothboth fetch
budget thethe was lifeQuality
of 10/unit)
Sales
(Rs.
Particulars 15 salesperiod P/V
ratio. profit
Required Mumbai
and
of of is is product
is
numbcr
the
Miles 50
,1=Y, =140
250
= 1W,
BEPMS Sales company Rs. to
priceWhatWhat made the the Engineering
B. Net Enumerate
costCalculate:
-
compuny
is
ratioFixed
Control.is affecting
A, in P/V sameout:
shown unit selling Find Explain
unnual
plicrs
A
Ltd What Cycle.
A 1. III.
A per I X the III. IV.

6a 7. 8.a
b 9
Marks
necessary. 3 2 2 3
BHOPAL newvalidoperation using an, = the search
0.2,| out potential|
CS-503
Code:
Subject a; is
ENGINEERING
wheneverwherever
thea tree. , each
pattern. 0.5, Find
whatbinary
TECHNOLOGY 10 text a3,
Marks:
Max into
CSE
Branch: inserting black
deletion some of en, 0.3, complexity. using
it given2, search
Convertred aj,
probabilities
to possible cases. counter
in the eo
after perform
assumptions
balanced for events successful
searchedidentifiers time
&
2023SCIENCE
obtained
for the
probability binary
OF valid.
Jan-Mav table failure
all with amortized
INSTITUTE Question(s) Also, 7
not obtained be prefixcontainingof only the
COMPUTER Min.) suitable tree explanation. 5 R cost11
TEST VI is to and of of
Semester:
it
Red-Black "aaabaaaab' probability
the 7, considering
the complexity
(50 the
however, B=
BLACK the
NATIONAL 10:50AM make Constructa, Find3,
8 R=
RED
MINI from B
tree <
of
are importance
OF Structures compulsory, ... tree.
DEPARTMENT below with1value < the keys
search
to 7, ag while time
AZAD 10:00AM value
tree algorithm.< is search
pattern the
Data are the with a qn whenrespectively,
binary amortized
MAULANA Red-Black
with < to the the
questions Consider node a a, qo Explainmethod.
09-Feb-2023
Date:Time:
Advanced
Tech.
B.Course: node
Given
KMP a where andof trees
For cost the
on pi
Attempting All
Subject: No.
Q.
Notes:
1. 2 3 4
CO 1&2 1&2
2
1

2ou1243) Marks1+1+2
necessary. 4
3+1+1
3 4

BHOPAL of| and| |using


T=31415926535
spurious
Subject
Code:
CS-503 the ofn of priority q
structure complexity steps that
ver/wherever in set step-by-step
ENGINEERINGMarks:
Max
20 left corresponding Assuming
and
TECHNOLOGY a 0.1 0.05 the 10
Branch:
CSE the for 4
heaps. 1
the tree Explain valid
from time
be and leftist 23
whene search 3 algorithm.
of
will root trees. 0.150.05 algorithmof treap.
inserted. number
2023 assumptions
what the
3 of terms the
& binary operation 5 48 text
OF SCIENCE of
binomial
in withthe the
March
50 the the
nodes,
INSTITUTE child 0.250.05 the heaps in is
Question(s) optimal element explainlocation.
shift
2
Write merge keysinserted in count
Exam
COMPUTER 500 secondthe
suilable binary 10 18 searched
Semester:
VI of an following
probabilities.
of each andthen
of properties heaps.of be
Term
make heap the of 0.2 0.05 and
complexity sequence
to after 14 26 Algorithm
value),
NATIONAL structure 1
of leftist heaps priority) be respective
their
MidOF binomial list.
the
root
degree
compulsory, the
operations. treap 20
18 45 to
hash
Structure the
binomial
heap. below leftists following 26
DEPARTMENT proveand 0.1 15 Searching
the 0 the the
highest 30 P= find
Priority
AZAD the illustration. illustrate
Min. are Determine cost
the the Determine
Consider last
of
treeand Compare
different patternto
Data the Merge the has Keys g with
along
|hits
MAULANA
90 questions State with Rabin-Karp
(modulo
Determine Pi 50 stepwise
Consider
Time:
Advance keys (where a
Course:
B.Tech Given
Attempting i. ii. iii. =4 i. ii. iii. 11
All
Subject: Q.No.
Notes:
1.
2 3 4 5

You might also like