0% found this document useful (0 votes)
53 views16 pages

Oraw The Schematie Diagram of 3-Way Handshaking For Connection Establishment in

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)
53 views16 pages

Oraw The Schematie Diagram of 3-Way Handshaking For Connection Establishment in

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/ 16

Instructions to candidates

= 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

4, Xetwork layer is capable of providing conectionless as well as connection


services. Explain how the two services are provided highlighting the difference in the
implementation of the two services.
showing all the fields present. Exl:
5. (a) Draw schematic of the link state packet
way cach value is decided/ derived.
y purpose of cach ficld with the neighbours. However.
(b) Not every received link state packet is forwarded to the
acknowledged. How the received packets are
cach eceived link state packet is used.
opanized at cach host? Explain with the data structure
Multiplicative Decrease
Explain., with suitable line diagrams, "Additive Increase explain why
(AIMD)" used for finding appropriate flow point in transport layer. Also unlikely to
are
multiplicative increase and decrease / additive increase and decrease
work for the purpose.
7. How DNS resolution is carried out? Name and justify the protocols used in the
process. Explain and differentiate differçnttypes of response.
8, (a) Can a machine with a single DNS name have multiple IP addresses? (b) Can a
machine with single IP have multiple domain names? Give reasons in case of
"NO"and way to implement in case of "YES".

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

The Distance Veçtor Protocol is


sent every 5 time steps, all links areused in both networks. Assume advertisements are
Nodes take zero time to process fully functional and there is no delay in the links.
protocol runs in the background advertisements once they receive them. The
every
connectivity are reflected in the next DV time step in a way that any changesHELLO in
time steps. How long it takes for advertisement. We count time steps from link
Host D. Showstepwise building of completion of routing table of (i) Host A t-0
the routing table in ach step. and (ii)
(b) Now assume the link B-C
fails at t= 51 and link D-E fails at t =
After how many time steps (i) B's 71 time steps.
advertisements
routing table reflects C is unreachable and reflect that C is
for E. (iii) D's routing table unreachable. (ii) A's
reflects a new route
Acompany has been
allocated the following addresses for use in its
a. 192.1.0.*/24 network:
b. 192.1.1,*/24 2 13
C. 192.1.2.*/24
d. 192.1.3.*/24
e. 192.14,*/24
Compute the routing entries at the 1SP..
6. Suppose that host Ais connected to £
to host B. router RI, R1 is connected to another router,
R2, and R2 is
connected
bytes of data and 20 bytes of Suppose that a TCP message that
delivery to B. Show the TCP hcader is passed to the IP code contains 900
fietds of the IP header irtTotallength.
caclh ldentification, at host A
DE, ME, and for
link A-Rl can support a packe transmitted Fragment offset
over the three links.
maximum
header, link R1-R2 can support a frame size of 24 bytes Assume that
bjte frame header, and link maxinmum including a
frame size of 512 bytes. 14-byte framel
R2-B
Ancluding a 12-byte frame header. (s2usupport a maximum frame sizeincluding
can an 8-($2)
Draw the (i)1R,Header and (i) of 5l2 bytes
field. UDP Header. Show length of cach ficld. Explain each
Computer Science Engineering
Subject:Object Oriented Programming
Time: 3 Hours
Branch:CS/IT
Maximum Marks: 100

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:

Rol No 22uCT T023 MainExam(UD) 2023


B.Tech. II-Sem. Branch-CSE/A.T.
Subject Code: 3CSDC02/3ITDCO2
Structures and Algorithms
Subject Name: Data Time: 3 Hours
Maximum Marks: 100
Instructions to candidates:
10x 2 marks = 20 marks,
answer questions (upto 25 vords)
PART A:Short compulsory.
All ten questions are 1words)6x5 marks
Soling questions (up to 100
PART B:Analtical/Problem to answer six questions out of eight.
have
= 30marks. Candidates marks
Analvtical/Problem solving questions 5 x 10
PART C: Descriptive/ answer fivequestions out ofseven.
50 marks. Candidates have to
required:
The follosing code(s) are
2.

Part-A

(Answer should be given upto 25 words only) |10×2=20]


Allquestions are compulsory
What is Data structure?
What is an algorithm?
93. What do you understand by the term link list in data structure?
04 What is analysis of algorithm?
5. Write some linear data structure?
BOg What is space complexity.
Define the term stack in data structure.
Write the complexity of quick sort and merge sort in best case?
0. What is data, information?
Q1. Write the operations of stack?
Part-B
(Analytical/Problem solving questions) |6x5-30|
questions
Attempt any six

concept of Big(O) and


asymptotic notations? Explain the
What are
grnega(s2) notation?
algorithm?
PQ2 Explaincharacteristics of an their operations?
What is stack and Queue and write
an AVL tree? Explain the rotations of AVL tree.
What is using quick sort:
Sort the following data in ascending order
E5,50,15,25,80,20,90,45
ANrite difference between BFS and DFS.
Explain the following with suitable exanples:
a) Binary tree b) binary search tree
Q8. Explain the implementation of queue with an example.

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)

manager myths associated with the software.


)Write any two
you understand by Test Case and Test Plan.
9 Q27What do
engineering.
O3nlist the need ofsoftware
you understand by LOC and debugging.
\4)What do
designing phase in software engineering?
aplain the benefits of
in waterfall model.
different steps involved
Q:6 Xhatare the
software metrics. Why it is required?
QExplain
diagram inUML.
R)What is activity
modelling.
9)Explain data DFD. Explain.
understand by
QT0) What do you
To

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

Q:1hat do you understand by RMMM. Explain RMMM Plan.


Q2) Eyplain software configuration management in detail.
Explain spiral model for software development. Enlist its advantages overether models.
Q:4) What do you understand by data dictionary. Where and how it is used. Draw use cas
diagram and sequence diagram of hotel nmanagement system. Explain its each part briefly.
Writeshort notes on:
a) Behavioral modeling(
ProtÐtype model
Q:6What do you understand by software quality assurance. How it is different from quality
Control. Also explain how quality assurance cycle works?
example.
What is project planning, Why it is needed? Explain WBS and PERT with
* ** FEND ***
Computer Science Engineering
aking a Subject code: Discrete Mathematics Structure
Branch: CS/IT
gime:3 Hours
Maximum Marks: 100

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

0.2yCheck whether the following sentences are Propositions or not.


(a) yhat time it is? (b) Close the door. (c) x+1=2 (d) x>5
Q.3) Kive the negation of each of the following.
(a) 5+8 > 3 (b) It is hot (c) 2 is an even integer and 8 is an odd integer
Ad) It willrain tomorrow or it will snow tomorrow

Q Le Pand Qbe the propositions


P: You get an A in the final exam

Q: You do every exercise in this book


Write the following Propositions using P, Qand logical connectives.
(a) You do not get an A in the final exam.
(b) You get an A in the final exam and you do cvery exercise in this book .
(c) If you do every exercise in this book then you will get an A in the final exam.
(d) If you do not every exercise in this book then you will not get an Ain the final exam.
(o y'ou do) do not get an A in the final exam then you will do every exercise in this book.
OySuppose Ube the universal set i.e.,
U=N= {1. 2, 3 ....;
Let A= (1, 2. 3, 4}. B=(3, 4. 5, 6. 7}
C=(2.3, 8, 9; , E= (2,4, 6. .....
Then find :

i) A° i) B' ii) E° iv) A/B v) B/C


vi)C/A vi) AB vi) A E E
Q.0) Fad the ihcidence matrix of the following graphs
0.7) Let Pand Q be two propositions:
P:Today is Monday
Q:Grass is dry
Then solve the following:
(a)poQ (b) P>Q (c) PV(Pv)
Q8 nd the Union. Intersection and Ring-sum of the following two graphs:

(G) (Gz)

PART(C)

1)Findtransitiveclosure of the relation :


R-{(a,c). (b.d),(c,a), (d.b), (e,d)}
On SgrA-{ab,c.d,e} using Warshall's Algorithm.
Explain Kruskal algorithm with an example.
bielyexplain the following:
group (c) Monoid Group (d) SemiGroup
(a) clic Group (b) Factor
Tautology.
Q4) Show by truth table that the following statement arc
(a) (p ) (pV ) (b) (p A ) A (r ^ S) ’ p
Q5) Explain sets operation with example.
Q6) Discuss about
Homomorphism, Isonorphism of Groups.
7). Briefly explain the
(a) Whccls Graph
following:
(c) BipartiteGraph (b) Complete Graph
(d) Regular Graph
RAJASTHAN
I|MID TERM
Subject code and
TECHNICAL
EXAMINATION UNIVERSITY,KOTA
(2022-23) BTECH |ISEMESTER CS BiT
NOTE: ATTEMPT ANYsubject:CEL101: Environmental
FIVE ALL QUESTIONS Science MAX MARKS 25
CARRY EQUAL MARKS.
v i EXPLAIN THE MARINE
v02 DESCRIBE THE POLLUTION.
COMMON SOIL
a3 EXPLAIN THE PRIMARY AND POLLUTANTS.
A4EXPLAIN THE AIR SECONDARY TREATMENTS OFWASTEWATER.
05
POLLUTION AND THEIR PREVENTION.
EXPLAIN THE NOISE POLLUTION AND THEIR
PREVENTION.
B.Tech IIISem. (Main/Back) UD,Exam 2023
(Common to EE, CS,IT, EC, EIC)
Environmental Science
CEL101
Time: 3Hours
Maximum Marks: 100
Min. Passing Marks: 33
Instructions to Candidates:
PART A : Short answer questions(up to 25 words) 10 x2 marks = 20 marks. All ten
questions are compulsory.
PART B : Analytical/Problem Solving questions(up to 100 words) 6 x 5 marks = 30*
marks. Candidate has to answer six questions out of eight.
PART C: Descriptive/ Analytical/Problem solving question 5 x 10 marks 50 marks.
Candidates have to answer five questions out of seven.

Part A

What do you mean by environmental studies?


What are natural resources?
What do you mean by landslides?
, 4/Define ozone layer depletion?
Define conventional energy resources?
6 . Write about mineral resources?
What is aquatic ccosystem?
8. /Explain about thermal pollution.
9. What is marine pollution?
C. Define the types of ecosystem?

Part B

I. ave the st1ucture of desert ecosystem.


Explain the oxygen & nitrogen cycle.
Wh are biotic and abiotic components? Explain.
Ðifferentiate between renewable and non-renewable resources.
$. Discuss some of the commonly known soil pollutants.
Explain various measures to conserve the biodiversity. ih-fih
What is drought and also write its effects?
8. How thermal pollution is caused? Discuss.

Part C

What is soil erosion? Explain the effects of soil erosion.


Desçribe food chain, food chein and ecological pyramid with suitable examples
3
anddiagrams.
What is forest ecosystem? Discuss its function.
Describe the types of mineral resources. Also discuss the uses and exploitation of
minerals resources.
5. What do you mean by use of
non-conventional energy resources? Discuss about
wind energy and bio-fuel.
6. What is environmental pollution? Discuss the
causes of water pollution.
7. What is climate change? Describe the
impact of climate ch¡nge on human
communities and agriculture.

You might also like