This is the old Version of MeroSpark, all the data and pages are migrated to

High Speed Network and Multimedia Networking – BIM (TU) Paper 2014 | 7th SEM

Download our Android App from Google Play Store and start reading Reference Notes on your mobile.

Multimedia NetworkingTribhuvan University | Faculty of Management
BIM / ITC 228: High Speed Network and Multimedia Networking
Year: 2014 (2071) | Seventh Semester

Full Marks: 60 | Time: 3 Hrs
Group “A”
Brief Answer Questions: [10 X 1 = 10]

1. Define Attenuation.
2. Differentiate between Image and Graphics.
3. Calculate storage space required to store MPEG II standard video of 20 second in Mega Bytes with spatial resolution 128 pixels X 80 pixels with 24 bits per pixel color encoding. (Use 1024 bytes = 1 kilobytes and 1024 Kilobytes = 1 Mega Bytes).
4. List the most important requirements of multimedia communication from the network point of view.
5. Distinguish between local and global delay.
6. Define Buffering.
7. Distinguish between congestion control and flow control.
8. Define Telemedicine.
9. What is role of control plane in ATM?
10. Define WAP.

Group “B”
Short Answer Questions: [6 X 5 = 30]

11. Define Noise and explain its type.
12. Explain characteristics of data stream for continuous media.
13. Define multimedia terminals and explain various issues of it that must be addressed.
14. Define Telecooperation and explain its four different interaction models with appropriate example.
15. Compare ATM protocol stack with TCP/IP protocol stack.
16. Write Short notes on:

a. HDTV (High-Definition Television)
b. SMDS (Switched Multi-Megabit Data Service)

Group “C”
Long Answer Questions: [2 X 10 = 20]

17. Explain the major factors that create congestion in the network and how it can be solved? How congestion control is done in Virtual Circuit subnet (TCP) and datagram subnet (UDP).
18. Explain the different phase of resource reservation and management process. Discuss C-SCAN, SCAN, First come First Served (FCFS), Shortest Seek Time First (SSTF) disk scheduling algorithm using following queue 95, 180, 34, 119, 11, 123, 62, 64 with the Read-write head serving at the track 50, provided head was serving at track 54 and the tail track at 199.

Posted By : Hari Prasad Chaudhary | Comment RSS | Category : Bachelor Level, Tribhuvan University
Tag :

Post a Comment

Your email is never published nor shared. Required fields are marked *