Assignment No 2
1. Convert the binary data “011010” into analog waveforms using following modulation techniques:
a. Two level Amplitude Shift Keying
b. Two level Frequency Shift Keying
c. Two level Phase Shift Keying
d. Differential Phase shift keying
e. Four level Amplitude Shift Keying
f. Four level Phase Shift Keying
g. Eight level Amplitude Shift Keying
2. With fc = 500 kHz, fd = 25 kHz, and M = 16 (L = 4 bits), compute the frequency
assignments for each of the sixteen possible 4-bit data combinations.
3. Draw the approximate Analog Modulation and Frequency Modulation waveforms in
complete steps for the following signal:
4. Draw the 16 QAM Constellation Diagram having two different amplitude levels and eight
different phase levels.
5. Explain and draw the Error Detection Process for Cyclic Redundancy Check (CRC).
6. Compute the frame check sequence for the following information:
Message = 10111100, Pattern = 11011
7. Compute the transmitted signal using Direct Sequence Spread Spectrum for the
following information:
Input: 1011, Locally Generated PN bit stream: 101011011010, T = 3Tc
8. What is the difference between Infrastructure and ad hoc modes in WLAN? Draw their
relative diagrams as well.
9. Compare the differences of TCP and OSI protocols for wired and wireless LANs using
diagrams.
10. Explain why the square and circle shapes cells for cellular communications are not
appropriate as compared to hexagonal shape cells.

Assignment 4
Recent Computer Science Questions

Q:

CSC230 Discrete Mathematics I – a Convert the following graph to an adjsceney b. Draw a graph from the following matrix 1 011

CSC230 Discrete Mathematics I – a Convert the following graph to an adjsceney b. Draw a graph from the following matrix 1 011 C1 101
Q:

(3) (4 pts) List two differences between PLAs (Programmable logic arrays) and FPGAs (Field programmable gate arrays).

(3) (4 pts) List two differences between PLAs (Programmable logic arrays) and FPGAs (Field programmable gate arrays).
Q: In the UnGraphList class, create a method public DiGraphMatrix convert() that returns a new graph directed type DiGraphMatrix equivalent to the graph (this). In such a way that the returned g
Q: Let the following figure be the schematic view of a communication network between two end-systems A and B. Assume that the nodal processing delay is negligible. Also, assume that the link between A a
Q:

CSC230 Discrete Mathematics I – a Convert the following graph to an adjsceney b. Draw a graph from the following matrix 1 011

CSC230 Discrete Mathematics I – a Convert the following graph to an adjsceney b. Draw a graph from the following matrix 1 011 C1 101
Q:

Module B: A state-rand()%4; if (A.state1) global time 6; Module C: private int C state; parameters i, j-1;/ a call without de

Module B: A state-rand()%4; if (A.state1) global time 6; Module C: private int C state; parameters i, j-1;/ a call without defining parameter j is fine if (i%2) C state-7; else C state-100: return C s