Networking Chapter 6 - Quiz

1 The sharing of a medium and its link by two or more devices is called _______.

A) modulation

B) encoding

C) line discipline

D) multiplexing

2 Which multiplexing technique transmits analog signals?

A) FDM

B) TDM

C) WDM

D) (a) and (c)

3 Which multiplexing technique transmits digital signals?

A) FDM

B) TDM

C) WDM

D) None of the above

4 Which multiplexing technique shifts each signal to a different carrier frequency?

A) FDM

B) TDM

C) Both (a) and (b)

D) None of the above

5 In synchronous TDM, for n signal sources of the same data rate, each frame contains _______ slots.

A) n

B) n + 1

C) n - 1

D) 0 to n

6 In TDM, the transmission rate of the multiplexed path is usually _______ the sum of the transmission rates of the signal sources.

A) greater than

B) less than

C) equal to

D) not related to

7 Which multiplexing technique involves signals composed of light beams?

A) FDM

B) TDM

C) WDM

D) none of the above

8 _________ utilization is the use of available bandwidth to achieve specific goals.

A) Frequency

B) Bandwidth

C) Amplitude

D) None of the above

9 ________ can be achieved by using multiplexing; ______ can be achieved by using spreading.

A) Efficiency; privacy and antijamming

B) Privacy and antijamming; efficiency

C) Privacy and efficiency; antijamming

D) Efficiency and antijamming; privacy

10 ________ is the set of techniques that allows the simultaneous transmission of multiple signals across a single data link.

A) Demodulating

B) Multiplexing

C) Compressing

D) None of the above

11 In a multiplexed system, __ lines share the bandwidth of ____ link.

A) 1; n

B) 1; 1

C) n; 1

D) n; n

12 The word ______ refers to the portion of a _______ that carries a transmission.

A) channel; link

B) link; channel

C) line; channel

D) line; link

13 ______ can be applied when the bandwidth of a link (in hertz) is greater than the combined bandwidths of the signals to be transmitted.

A) TDM

B) FDM

C) Both (a) or (b)

D) Neither (a) or (b)

14 FSM is an _________technique.

A) analog

B) digital

C) either (a) or (b)

D) none of the above

15 ____ is designed to use the high bandwidth capability of fiber-optic cable.

A) FDM

B) TDM

C) WDM

D) None of the above

16 ______ is an analog multiplexing technique to combine optical signals.

A) FDM

B) TDM

C) WDM

D) None of the above

17 _____ is a digital process that allows several connections to share the high bandwidth of a link.

A) FDM

B) TDM

C) WDM

D) None of the above

18 _____ is a digital multiplexing technique for combining several low-rate channels into one high-rate one.

A) FDM

B) TDM

C) WDM

D) None of the above

19 We can divide ____ into two different schemes: synchronous or statistical.

A) FDM

B) TDM

C) WDM

D) none of the above

20 In ________ TDM, each input connection has an allotment in the output even if it is not sending data.

A) synchronous

B) statistical

C) isochronous

D) none of the above

21 In ________ TDM, slots are dynamically allocated to improve bandwidth efficiency.

A) synchronous

B) statistical

C) isochronous

D) none of the above

22 In ________, we combine signals from different sources to fit into a larger bandwidth.

A) spread spectrum

B) line coding

C) block coding

D) none of the above

23 _______ is designed to be used in wireless applications in which stations must be able to share the medium without interception by an eavesdropper and without

being subject to jamming from a malicious intruder.

A) Spread spectrum

B) Multiplexing

C) Modulation

D) None of the above.

24 The _______ technique uses M different carrier frequencies that are modulated by the source signal. At one moment, the sign modulates one carrier frequency;

at the next moment, the signal modulates another carrier frequency.

A) FDM

B) DSSS

C) FHSS

D) TDM

25 The ______ technique expands the bandwidth of a signal by replacing each data bit with n bits.

A) FDM

B) DSSS

C) FHSS

D) TDM

Solution Manual(Data Communications and Networking(4th))

Solution Manual download here:
http://www.ziddu.com/download/9507760/lutionManualDataCommunicationsandNetworking4th.rar.html

E-books download here:

Upload By

R8y™ Study Zone

--Good Luck---

TTTK2163 - COMPILERS Pass Year some Solution

Section 1

1. Write a brief description for the following terms:

a. Panic-mode error recovery

Panic-mode error recovery is based on the idea of skipping symbols on the the input until a token in a selected set of synchronizing tokens appears.

b. Bottom-up parsing

A bottom-up parse corresponds to the construction of a parse tree for an input string beginning at the leaves (the bottom) and working up towards the root (the top).

c. Predictive Parser

Recursive-descent parsing is a top-down method of syntax analysis in which a set of recursive procedures is used to process the input.


2.

a. Give example of 4 different type of strings that are accepted by the transition diagram.

DD, DD.DD ,DD.DE+DDD

b. Write a pseudocode to recognize the string of the transition diagram.


Section 2

1. Consider the following context-free grammar:

S -> SS + l SS* l a

a. Construct a parse tree to show how the string aa+a* can be generated by this grammar.

S -> S S + (1)

S ->S S * (2)

S ->a (3)

Production (3) allows you to generate a string S0 which consists of a.Using S0 as a starting point, production (1) allows you to generate a string S1 which consists of aa+.Production (3) again allows you to generate a string S2 which consists of a.Then production (2) allows you to generate a string S3 = S1S2* = aa+a*.

b. Rewrite the grammar to eliminate the left factoring and left recursion in the grammar.

left factoring

S -> SG l a

G -> S+lS*

left recursion

S -> aS’

S -> GS’ l E

G -> S+lS*

c. What language does this grammar generate? Justify your answer.

Assuming a is an identifier for a numeric value, for example, then the grammar generates a language consisting of all possible arithmetic combinations of a using only the operations + and * and postfix notation.


2. Show that the string if E1 t"en ifE2 then SJ else S2 is ambiguous when it is parsed using the

following grammar.


stm! -> if exprthen stmt

I if expr then stmt else stmt

I other


Section 3

1.Fill in the table below with the First and Follow sets for the non-terminals in this grammar:


First

Follow

S

[ , a

+ ,- ,c ,b ,],$

X

+ , - , E

] , c

Y

- , E

b

*the FOLLOW answer i not sure

2. Show all the steps in order to produce a predictive parsing table for the following grammar:

NON-TERMINAL

INPUT SYMBOL

id

+

*

(

)

$

E



E->T’


E->e

E’->e

E’


E’->+TE’





T

T->FT’



T->FT’



T’


T' ->e

T’->*F




F

F->id



F->(E)



Related Posts with Thumbnails