Oraw The Schematie Diagram of 3-Way Handshaking For Connection Establishment in
Oraw The Schematie Diagram of 3-Way Handshaking For Connection Establishment in
= 20 marks. All
PARTA: Short answer questions (up to 25 words) 10x 2 marks
10questions are compulsory.
x 5 marks:
PART B: Analytical/Problem Solving questions (up to 100 words) 6
eight.
30 marks. Candidates have to answer six questions outofmarks = 50
questions 5x 10
PART C: Descriptive/ Analytical/Problem solving seven.
marks. Candidates have to answer five questions out of
PART-A
schematie diagram of 3-way handshaking for connection establishment in
Oraw the correctly.
TCP. No Description required. Label the messages
difference in datagram and virtual circuit based services on the basis of
2) Enunmerate the
() bandwidth utilizatien, and (ii) fast delivery. ISO/OSIModels?
different in TCP/IP and
How the network and transport layers are
receiver. Why?
4/n wireless networks, collision is detectable only by the
screen images over an optical fiber. The
B. It is desired t0 send a sequence of computer images per
sereen is 2560 x1600 pixels, each pixel being 24 bits. There are 60screen
second. How much bandwidth is needed?
are suggested to
B6Flooding generates vast number of duplicate packets. What methods
control number of generated duplicates?
7 What is the role of extension headers in IPV6? Suggest through an example.
What is the purposeof Address Resolution Protocol (ARP)?
What is the
9In DNS, every domain has aresource record associated with the domain.
format of each resource record?
K. What is the role of cookies in World Wide Web?
PART-B
Ave the expression for throughput in ALOHA and Slotted ALOHA. Show the
stnerable period for the transmitted frame for both protocols.
What is the role of propagation delay in deciding the window size in a selective repcat
sliding window protocol? Explain. Further, why the sender and receiver windows are
nequal in theprotocol?
Explain the difference in the "RST" and FIN" flags in TCP, Also explain with neat
diagrams theprocess of disconnection in TCP.
Page 1 of 3
4(
.aC)
onsi
PART-C
(a)h anetwork using ALOHA, cach frame is 1000 bits long. The data rate is I Mbps
TTO bps). Total numbers of 1000 frames on an aggregate basis are generated per
second and follow a Poisson distribution. Compute the throughput as the ayerage
number of frames transmitted successfully.
o Frames of 1000 bits are sent over a l-Mbps channel using a geostationary satellite
dvhose propagation time from the carth is 270 msec. Acknowledgements are always
piggybacked onto data frames. The header's are very short. Three-bit sequence
numbers are used. Wha is the maximum achievable channel utilization for (a) Stop
and-wait? (b) Go Back N(ii) Selective Repeat:
2. (a) A 10 Gbps WAN has a 50 millisecond RTT. Assume that the TCP send and
Rceive buffer sizes are set to 1Mbyte. Compute the efficiency if the next buffer is
sent only after receipt of acknowledgement for the previous buffer. Compute the
minimum buffer size to achieve 100% efficiency. Assume a lossless line.
(b) To get around the problem of sequence numbers wrapping around while old
packets stillexist, one could use 64-bit sequence numbers. However, theoretically, an
optical fiber can run at 75 Tbps. What maximum packet lifetime is required to make
sure that future 75-Tbps networks do not have wraparound problëms even with 64-bit
sequence numbers? Assume that cach byte has its own sequence number, as TCp
does.
for three
3. (a) A TCP machine has received window sizes 65535, 32000, 16000
successive transmissions. The line operates at 1-GBps" and has a 10-mscc one-way
transmission.
delay. Compute the line efficiency and achieved throughput for the
Assume loss less line,
blast out 1500-byte TCP
(b) What is the fastest line speed at which a host can
without having the sequence
payloads with a 120-sec maximum packet lifetime overhead into consideration.
Ethernet
numbers wrap around? Take TCP, IP, and
Assume that Ethernet frames may be sent continuously. Se V1t
Page 2of3
4. (a) Consider the following
network ll (containing nodes networks:
D,E, )
network I (containing nodes A, B. O) and
Instructions to candidates: -
PART A: Short answer questions (up to 50 words) 10x 2 marks = 20 marks.
Allten questions are compulsory.
PART B: Analytical/Problem Solving questions (up to 100words) 6x 5 marks
= 30 marks. Candidates have to answer six questions out of eight.
PART C: Descriptive/ Analytical/Problem solving questions 5 x 10 marks =50
marks. Candidates have to answer five questions out of seven.
The following code(s) are required:
1. 2.
PART (A)
Q1)What is the significance of access specifiers?
Q:2) What is a Garbage Collector?
A:3) What ismeant by Data Hiding?
04) Define Overriding.
Q5) What is Static Variables?
Q:7What is mean by Abstract Class?
7) Define Polymorphism and Abstraction.
o8) What is meant by Reusability?
limitations?
any
inheritancehave
Q9)Does String?
meant by
is
Q10What
PART(B)
Features of 00Ps?
main
arethe
A)What withexample.
encapsulation explainitfunction.
J2)Eyplain array ofanobjectand C++?
classfor in
)Design a varioustypesofconstructors
arethe
Inheritance withanexample?
)EXplain
Exception handling with an example. Modifiers
R0 Explain Attributes b) Access
Classes
short notes: a)
Explain a life cycle of objects with example
Q:8)
PART (C)
Q:1De_efíbe amulti-threading and Data collections with example.
QÉxplain the Multilevel and Hybrid Inheritance with an example.
Q:3 Explen the library management system in C++,
QAExplain the Destructor in C++ with example.
Explain the concept of function
example/ overloading and operator
overloading with proper
oDesign aclass program for a
Shopping list using
friend function with class andswitch-case for more options to the user
0:7 Wíte a program for
obiect.
Totat No, ofPages: 2
Total No. ofQuestions:
Part-A
Part-C
(Descriptive/Analytica/Problem solving/Design questions)
(5x10=50]
Attempt any five questions
Evaluate the given expression into postfix notation
A+(B*C-(D/E F)*G)*h
X What is the difference between B tree and B+tree?
03. What do you understand by the terms:
A Array b) graph c) stack d) queue e) binary tree
The in-order and pre-order traversal sequence of nodes in a binary tree are
given below:
In-orderEACKFHDBG
Pre-order FAE KCDHGB
raw the Binary Tree
Explain the advantage of Binary search over linear search?
search with the help of example? Explain binary
KKplain sparse matrices with the help of suitable example?
RYExplain BFS with an example.
ofr Questions: 25 Total No. of Pages: 2
Total No.
2lEQCO23
RollNo.
B.Tech, I|-Sem. UDMain Exam 2023
30| Computer Science & Engineering
Paper Code:3CSDCO5/31TDCOS
Subject Name:Software Engineering
Maximum Marks: 100
Time: 3Hours
Jnstructions to candidates:
All ten
(up to 25 words) 10 x 2marks = 20 marks.
questions
PARI A:Short answer
questions are compulsory.
(up to 100 words)6 x 5marks = 30marks.
PARTB:Analytical/Problem Solving questions
questions out of eight.
Candidates have to answer six
solving questions 5 x 10 marks = 50 marks.
Analytical/Problem
PART C:Descriptive/ answer five questions out of
seven.
Candidates have to
required:
The following code(s) are
PART (A)
PART B
QDeseribe RAD Model in detail.
RDiferentiate between white box, black box and grey box testing.
QHowsoftware metrics areclassified. Explain. Also listtheir characteristics.
Q4) Explain basic and detailed COCOMO Modelin detail.
Q:5)What do you understand by software requirement analysis. Explain by taking a live
Aample.
Q:6) Eyplain SDLCin detail.
QDifferentiate between verification and validation.
Q:8) Explain any three non-functional testing in detail. '
PART C
o0000000
Instructions to candidates: -
PART A:Short answer questions (up to 50 words) 10 x 2 marks = 20 marks.
Allten questions are compulsory.
els.
ase PART B: Analytical/Problem Solving questions (up to 100 words) 6 x 5
marks
=30 marks. Candidates have to answer six
questions out of eight.
PART C: Descriptive/ Analytical/Problem solving
questions 5 x 10 marks = 50
marks. Candidates have to answer five questions out of seven.
The following code(s)are required:
2.
PART (A)
)What is aTautology ?
Deine Relations.
a) What is a
Converse?
What do you mean by a Graph?
,96) Delfine Mixed Grapls.
Ao)What is a
Multi-graph?
What are Propositions?
atisaCompound Proposition?
Q9YDefine Negation.
Statement?
Q:a What do you mean by a Conditional
PART(B)
table of OR. AND/ EX-OR
QWhat do you mean by a truth table? Write down the truth
(G) (Gz)
PART(C)
Part A
Part B
Part C