Exam Details
| Subject | data communications and networking – i (paper – i) | |
| Paper | ||
| Exam / Course | b.sc. – i (ecs) | |
| Department | ||
| Organization | solapur university | |
| Position | ||
| Exam Date | November, 2018 | |
| City, State | maharashtra, solapur |
Question Paper
B.Sc. III (Semester (Old CGPA) Examination, 2018
data communications and networking I (paper
Day and Date Saturday, 17-11-2018 Total Marks 70
Time 2.30 p.m. to 5.00 p.m.
Instructions All questions are compulsory.
Figures to right indicate full marks.
1. Choose the correct alternative. 14
An example for dynamic routing algorithm is
Shortest path Flooding
Dijisktra Distance vector
error detection method is used in internet.
Checksum CRC
Simple parity check None of mentioned
mechanism is used to control congestion in virtual circuit
subnet.
Admission control Retransmission
Discard None of these
The variation in the packet arrival time in the delivery of audio or video packet
is called as
Timeliness Jitter
Reliability None
Point-to-point transmission with one sender and one receiver is sometimes
called as
Multicasting Unicasting
Point casting None
In mesh topology for n nodes we can generate links.
N 1 N(N
N(N 2N
Set P
Following is the dynamic routing algorithm.
Flooding Optimality principal
Shortest path Link state routing
Packet retransmission policy does not affect congestion at the
layer.
Transport Data link
Network Physical
By using program user can copy files from one location to
other by using Internet.
Telnet RARP ARP FTP
10) In check single parity bit is added to every data unit for error
detection.
CRC Internet checksum
Simple parity None
11) protocol is very efficient for sending frames in noisy links.
Simplex Stop and wait
Go Back n Selective repeat
12) The problem of resynchronization is resolved in
Character count Byte stuffing
Bit stuffing None
13) primitive is used to block waiting for incoming connection.
conect listen
receive disconect
14) noise generated from motors and appliances.
Crosstalk Impulse
Induced Thermal
2. Answer the following (any four). 8
What is meant by Distortion
What is a hamming distance
What is an optimality principle
What are the various standards of data communications
Which are the various components of Data communications
Write notes on (any two). 6
E xplain Shannon's capacity formula.
E xplain data link layer design issues.
E xplain broadcast transmission technology.
3. Answer the following (any two). 8
E xplain CSMA/CD in detail.
E xplain serial transmission in detail.
E xplain various service primitives in detail.
Answer the following (any one). 6
Frequency division multiplexing.
Congestion prevention policies.
4. Answer the following (any two). 10
E xplain unbounded media in detail.
E xplain TCP/IP reference model.
E xplain Stop and wait ARQ protocol.
Answer the following (any one). 4
State the difference between connection oriented and connectionless
services.
E xplain network criteria.
5. Answer the following (any two). 14
E xplain the difference between circuit switching and packet switching.
E xplain various channelization methods in detail.
E xplain shortest path algorithm with example.
data communications and networking I (paper
Day and Date Saturday, 17-11-2018 Total Marks 70
Time 2.30 p.m. to 5.00 p.m.
Instructions All questions are compulsory.
Figures to right indicate full marks.
1. Choose the correct alternative. 14
An example for dynamic routing algorithm is
Shortest path Flooding
Dijisktra Distance vector
error detection method is used in internet.
Checksum CRC
Simple parity check None of mentioned
mechanism is used to control congestion in virtual circuit
subnet.
Admission control Retransmission
Discard None of these
The variation in the packet arrival time in the delivery of audio or video packet
is called as
Timeliness Jitter
Reliability None
Point-to-point transmission with one sender and one receiver is sometimes
called as
Multicasting Unicasting
Point casting None
In mesh topology for n nodes we can generate links.
N 1 N(N
N(N 2N
Set P
Following is the dynamic routing algorithm.
Flooding Optimality principal
Shortest path Link state routing
Packet retransmission policy does not affect congestion at the
layer.
Transport Data link
Network Physical
By using program user can copy files from one location to
other by using Internet.
Telnet RARP ARP FTP
10) In check single parity bit is added to every data unit for error
detection.
CRC Internet checksum
Simple parity None
11) protocol is very efficient for sending frames in noisy links.
Simplex Stop and wait
Go Back n Selective repeat
12) The problem of resynchronization is resolved in
Character count Byte stuffing
Bit stuffing None
13) primitive is used to block waiting for incoming connection.
conect listen
receive disconect
14) noise generated from motors and appliances.
Crosstalk Impulse
Induced Thermal
2. Answer the following (any four). 8
What is meant by Distortion
What is a hamming distance
What is an optimality principle
What are the various standards of data communications
Which are the various components of Data communications
Write notes on (any two). 6
E xplain Shannon's capacity formula.
E xplain data link layer design issues.
E xplain broadcast transmission technology.
3. Answer the following (any two). 8
E xplain CSMA/CD in detail.
E xplain serial transmission in detail.
E xplain various service primitives in detail.
Answer the following (any one). 6
Frequency division multiplexing.
Congestion prevention policies.
4. Answer the following (any two). 10
E xplain unbounded media in detail.
E xplain TCP/IP reference model.
E xplain Stop and wait ARQ protocol.
Answer the following (any one). 4
State the difference between connection oriented and connectionless
services.
E xplain network criteria.
5. Answer the following (any two). 14
E xplain the difference between circuit switching and packet switching.
E xplain various channelization methods in detail.
E xplain shortest path algorithm with example.
Other Question Papers
Subjects
- advanced java (paper – iii)
- advanced microprocessor
- compiler construction (paper – iv)
- computer graphics
- core java (old cgpa) (paper – iii)
- data communication and networking – i
- data communication and networking – ii (paper – i)
- data communications and networking – i (paper – i)
- data structures (paper – iv)
- data structures algorithms enginering – ii
- database management system – i (paper – ii)
- database management system – ii (paper – ii)
- dbms using oracle
- descriptive statistics – i
- descriptive statistics – ii
- digital electronics – i
- digital electronics and microprocesor – ii
- discrete structure
- embedded system – i
- embedded system – ii (paper – v)
- english (compulsory) (new) (cbcs)
- fundamental of computer
- golden petals
- introduction to programming using c – ii (paper – iii)
- introduction to web designing (paper – ii)
- linear electronics – i
- linear electronics – ii
- linux operating system (new)
- literary quest
- mathematical algebra
- mathematics(numerical methods)
- microprocesor – ii
- object oriented programming using c++
- object oriented programming using java (paper – i)
- on track – english skills for success
- oop using c++ – ii
- operating system
- operating system – ii (paper – i)
- operations research
- organization of pc – ii
- peripherals and interfacing – ii
- pr obabili ty theory – ii
- probability theory – i (paper – ix)
- programming using “c”
- python – i (paper – v)
- software engineering
- software enginering – ii
- theory of computer science
- theory of computer science (paper – iv)
- visual programming – i
- visual programming and aplication software – i (old)
- visual programming and aplication software – ii(paper – vi)
- web technology and e-commerce – i
- web technology and e-commerce – i (paper – v)
- web technology and e-commerce – ii (paper – v)