Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
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 signal6. 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 link8. 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.
An operating system involves 3 user processes each one requiring 2 units of resource R .The minimum number of units of R like no deadlocks will ever take place is The minimum
Long term scheduler calculates which processes are admitted to the machine for processing. It accepts the degree of multiprogramming. Once accepted, a job converts a process.
How Memory utilization factor shall be computed Memory utilization factor shall be defined as Memory in use/total memory connected
Worst Fit Algorithm Here we obtain the largest space available for the smallest. Therefore after that process entered there will be much more space remaining. In this space we
Conservative GC can be used for languages such as C and C++, which were not explicitly designed for garbage collection. This is a non-copying technique. A conservative garbage coll
List sample file types, based on use, on the VAX under VMS. source programs (.BAS, .FOR, .COB, .PLI, .PAS, .MAR) data files (.DAT) text files (.TXT) command proced
FIRST FIT ALGORITHM Scanning a list along with if a free hole is available with necessary space for the process to allocate it allocates the process in that space. The first s
Second-Chance algorithm When a page has been selected, we inspect its reference bit. If the value is 0, we proceed to replace this page. If the reference bit is set to 1, thoug
What are the different accessing methods of a file? The different types of accessing a file are: Sequential access: Information in the file is accessed sequentially
Problem 1. List out the conditions that result in Deadlock situations. Illustrate deadlock situation with a simple graphical notation Listing conditions for deadlock occu
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!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd