Explain direct sequence-analog signal, Operating System

Assignment Help:

1. A digitized voice channel is made by digitizing a 7 KHz bandwidth analog signal. The signal is to be sampled twice the highest frequency (two samples per hertz) . Assume each sample requires 16 bits. What is the required bit rate?

2. If the signal at the beginning of a cable with -0.5 db/km has a power of 5 mW. What is the power of the signal at 8 Km.

3. What are the propagation time and transmission time for a 10 M byte message if the bandwidth of the network is 2 Mbps. The distance between the sender and the receiver is 15,000 KM and the light travels at 2.4 x 108 m/s.

4. Define Frequency Hopping Spread Spectrum and how it achieves bandwidth spreading.

5. Explain how Direct Sequence Spread Spectrum expands the bandwidth of the original signal

6. A multiplexer combines four 200 kbps channels using a time slot of 2 bits. Show the output with four arbitrary inputs. What is the frame rate? What is the frame duration? What is the bit rate? What is the bit duration?

7. There are four sources each creating 250 characters per second. If the interleaved unit is a character and 1 synchronizing bit is added to each frame , find (a) the data rate of each source (b) the duration of each character in each source (c) the frame rate (d) duration of each frame (e) the number of bits in each frame (f) the data rate of the link

8. Explain multilevel multiplexing, multiple slot multiplexing, pulse stuffing and framing bits with diagrams.

9. Explain the process of streaming stored audio/video by using a web server with metafile, using a media server and Real time streaming protocol (RSTP)

10. Explain JPEG image compression process with diagram.


Related Discussions:- Explain direct sequence-analog signal

Explain bounded buffer and unbounded buffer, Explain bounded buffer and unb...

Explain bounded buffer and unbounded buffer. Here in a producer-consumer problem the producer process produces information that is consumed by a consumer process. At this time

Describe the buddy system of memory allocation, Buddy system of memory allo...

Buddy system of memory allocation Free memory is used to maintain in linked lists, each of similar sized blocks. Every block is of size 2^k. When some memory is needed by a th

Define dynamic linking, Define dynamic linking. Dynamic linking is same...

Define dynamic linking. Dynamic linking is same to dynamic loading, rather that loading being postponed unless execution time, linking is postponed. This feature is usually use

What are files and explain the access methods for files, What are files and...

What are files and explain the access methods for files? File definition Attributes, operations and types Direct access Sequential access with diagram Other access

System bus and device speeds as the cpu speed increases, Q. Why is it impor...

Q. Why is it important to scale up system bus and device speeds as the CPU speed increases? Answer: Consider a system which carries out 50% I/O and 50% computes. Doubling-up

How is memory management done using linked lists?, How is memory management...

How is memory management done using linked lists?   Each one node of the l list will have 4 fields as follows 1-this tells whether it s a hole or a process 2-starting ad

Request or response interface - interaction using message, Explain the Requ...

Explain the Request or Response interface The Request/Response interface is ideal for a message based client-server interaction. By modeling components to interact via a reque

Define fifo page replacement algorithm, Define FIFO Page Replacement Algori...

Define FIFO Page Replacement Algorithm This policy simply eliminates pages in the order they arrived in the main memory. By using this policy we simply remove a page based upo

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd