NETWORKING FOROUZAN QUESTION SET

 Networking (Forouzan Ch-4)

1. What is line coding?characteristics of line coding.

2. Signal level vs data level.

3. Pulse rate vs bit rate

4. DC component.

5. Self synchronisation.

6. unipolar , polar , bipolar line coding.

7. NRZ,RZ,Manchester, Differential manchester,NRZ-L,NRZ-I.

8. Block coding.

9. Sampling, PAM, PCM. 

10. Transmission mode.

NETWORKING FOROUZAN QUESTION SET

 Networking (Forouzan Ch-3)

1. bit rate , bit synchronization.

2. what is signal?

3. What is analog signal,digital signal?

4. What is periodic signal, aperiodic signal? 

5. def-peak amplitude, time domain, frequency domain, composite signal, bandwidth.

6. Bit rate, bit interval, baud rate.

7. Low pass channel, band pass channel.

8. analog transmission, digital transmission

9. noisy channel, noise lesschannel.

10. Shannon capacity, Nyquist bit rate.
11. transmission impairement--attenuation, distortion,noise, cross-talk
12. decibel
13. throughput, propagation time, propagation speed, wavelength

NETWORKING FOROUZAN QUESTION SET

 Networking (Forouzan Ch-2)

1. Network model.

2. Functions of each layer of OSI model.

3. Functions of each layer of TCP/IP model.

4. header,trailer of data.

5. framing 

6. hop-to-hop delivery, source-to-destination delivery, process-to-process delivery

7. logical addressing , routing, port address

NETWORKING FOROUZAN QUESTION SET

 Networking (Forouzan Ch-1)

1. Component of data communication..

2. Network criteria.
3. Point to point protocol, multi-point protocol
4. Various types of topology,and their advantages,disadvantages.
5. Various types of networking, and their advantages, disadvantages.
6. Difference between internet and intranet.
7. ARPANET

PROLOG PROGRAM LIST:::

1. introduction

2.arithmetic

3. if-else  - CLICK

4.loop

5. List: click

6. CBCS university assignments  CLICK

7. Read value from user:

1. BIRYINI IS A FOOD.

QUESTION:? 

A) IS BIRIYANI A FOOD?

B) IS MOMO  A FOOD?

CLICK HERE

2. 

BIRYINI IS A FOOD.

MOMO IS A FOOD.

QUESTION:? 

A) HOW MANY FOODS?

B) IF ALL FOODS ARE MEAL , THEN DISPLAY ALL MEALS.

CLICK HERE

3.

BIRYINI IS A FOOD.

MOMO IS A FOOD.

BIRIYANI IS A LUNCH.

QUESTION:? 

A) WHICH ITEMS ARE IN LUNCH?

CLICK HERE

PROLOG -> PROGRAM 3

 BIRYINI IS A FOOD.

MOMO IS A FOOD.

BIRIYANI IS A LUNCH.

QUESTION:? 

A) WHICH ITEMS ARE IN LUNCH?

PROLOG -> PROGRAM 2

 BIRYINI IS A FOOD.

MOMO IS A FOOD.

QUESTION:? 

A) HOW MANY FOODS?

B) IF ALL FOODS ARE MEAL , THEN DISPLAY ALL MEALS.

PROLOG -> PROGRAM 1

 

1. BIRYINI IS A FOOD.

QUESTION:? 

A) IS BIRIYANI A FOOD?

B) IS MOMO  A FOOD?

8. If L is a context-free language, then we can construct a pda A accepting L by empty store, i.e. L = N(A).

 8. If L is a context-free language, then we can construct a pda  A accepting L by empty store, i.e. L = N(A).

7. Construct a pda A accepting the set of all strings over {a, b} with equal number of a's and b's.

 7. Construct a pda A accepting the set of all strings over {a, b} with equal  number of a's and b's.

Construct a pda A accepting L = {WCWT } by final state.

 Construct a pda A accepting L = {WCW^T } by final state. 

5. deterministic pda

 5. deterministic pda

4. move of pushdown automaton.

 4. move of  pushdown automaton. 

3. instantaneous description (ID) of pushdown automaton.

 3. instantaneous description (ID) of pushdown automaton.

III ) Design a TM that accepts {0N1N: n >=1}.

  III )  Design a TM that accepts {0^N1^N: n >=1}.

Design a Turing machine over {I. b} which can compute a concatenation function over L = {I}. If a pair of words (W1,W2) is the input. the output has to be W1.W2.

 Design a Turing machine over {I. b} which can compute a concatenation function over L = {I}. If a pair of words (W1,W2) is the input. the output has to be W1.W2.

2. Definition - pushdown automaton.

 2. Definition -  pushdown automaton.

1. Model of a pushdown automaton.

 1. Model of a pushdown automaton.

NUMERICAL ANALYSIS CLASS LAB CLASS - 1

5. DESIGN OF TURING MACHINES -

 I )  Design a Turing machine to recognize all stlings consisting of an even number

             of 1's.