Questions and Videos Related to competition

Table Tennis competitions only two coloured balls allowed what In General Knowledge - 1 answers - 3 months ago

The Sweater Shop International was a competition which sport In General Knowledge - 1 answers - 3 months ago

Who wrote Stiff Competition? In Books and Novels - 1 answers - 3 months ago

More >>

Videos Related to competition

3 views MobileDemand Rugged Tablet PCs & the Intel Brand Advantage Program	2 views Submarine String puzzle Level 1 and 2	3 views shabeermon oppana
5 views Mapila Song Competition News	4 views Enablis Business Idea winners awarded	1 views NYC Next Idea 2011-2012	4 views 2011 Outrageous Business Plan Competition Winners

APRIL / MAY 2001 COMPUTER NETWORKS (R)

MAHATMA GHANDHI UNIVERSITY (MG)

B.Tech. DEGREE EXAMINATION, APRIL /  MAY 2001

Branch: Computer Science Engineering

Seventh Semester, (New Scheme)

COMPUTER NETWORKS (R)

Time : Three Hours                                          Maximum : 100 Marks

Part A

Answer all questions.

1. Discuss the star network toology.    the IS

2. Discuss the functioning of the Physical Layer thO model

3. Discuss what is meant by routing table.

4. Discuss datagram concept a applied to network layer.

5. Discuss the nature of IP packets and their headers.

7. Explain connectionless protocol with a typical example.

8. Explain the FTP service.

9. Discuss the implementation of access management as applied to the presentation layer.

10. Explain the sliding window protocol.         (10 x 4 = 40 marks)

Part B

Answer all questions.

All questions carry equal marks.

11. (a) With a neat block diagram, explain briefly the ISO Jaye model.

Or

   (b) Compare analog transmission and digital transmission with special reference to ISDN.

12. (a) Discuss the concept of a data packets and their formats tis used in computer networks.

Or

    (b) I xplain the various hardware components used for computer data communication.

13. (a) Discuss satellite packet broadcasting in brief

Or

    (b) Discuss the IEEE and 802.3 standards for LAN.

14. (a) Explain the session layer services and their implementation. Or

    (b) Discuss the services implemented in the transport layer and the nature of the implementation.

15. (a)  Discuss the need for data compression techniques the methods used for it as applied to computer communication.

Or

    (b)    Explain the nil poitant services offered by the presentation layer.       (5 x 12 = 60 marks)

FOR COMPLETE PRINTED QUESTION PAPER SET CONTACT: 9745451920 Rs:50/-

SOFTWARE ENGINEERING (R,T) B. TECH., DEGREE EXAMINATION, NOVEMBER 2005

MAHATMA GHANDHI UNIVERSITY (MG)

B. TECH., DEGREE EXAMINATION, NOVEMBER 2005
Sixth Semester

Branches : Computer Science and Engineering/Information Technology
SOFTWARE ENGINEERING (R,T)

Time : Three Hours                                             Maximum : 100 Marks

Part A

Answer all questions, Each question carries 4 marks.

1. What are the limitations of waterfall model of software development ?

2. Explain Bang metrics.

3. What are the major benefits of reviews ?

4. Explain risk control.

5. What are the major metrics that can he used to evaluate the system design?

6. What are major methods for verifying design ?

7. What is structured p•ogramming? Why is it important?

8. What do you mean by symbolic execution?

9. Explain the concepts of error, fault and failure.

10. What are the basic levels of testing? (10 x 4, 40 marks)

Part B

11 (a) What are the components of SRS? Explain them briefly.

   (7 marks)

   (b) Explain the role of management in software development

   (5 marks)

Or

12. Explain the various software development process models.

    (12 marks)

13. What are the objectives of software project planning ? Explain how to achieve these objectives. (12 marks)

Or

14. Explain COCOMO software cost estimation model. (12 marks)

15. (a) Discuss Top-Down and Bottom-up design approaches.

    (6 marks)

    (b) What is Data flow diagram ? Illustrate with an example.

    (6 marks)

16. (a) Explain Network metrics and stability matrics for design.

    (8 marks)

    (b) Differentiate betweenca flow chart and structure chai-t.

    (4 marks)

17. Explain the various programming practices.          (12 marks)

Or

18. (a) Explain information hiding.      (4 marks)

    (b) Write short notes on.

            (i)         Static analysis. (4 marks)

            (ii)        Unit testing.     (4- marks)

19. Discuss the following approaches of structural testing :    

            (i)         Mutation. testing.         (6 marks)

            (ii)        Control flow based testing.      (6 marks)

Or

20. Give a detailed comparison of verification and validation techniques.      (12 marks)

(5 x 12 = 60 marks)

FOR COMPLETE PRINTED QUESTION PAPER SET CONTACT: 9745451920 Rs:50/-

MAY / JUNE 2002 COMPUTER NETWORKS (R)

MAHATMA GHANDHI UNIVERSITY (MG)

B.Tech. DEGREE EXAMINATION, MAY / JUNE 2002

Branch: Computer Science Engineering

COMPUTER NETWORKS (R)

(New Scheme - 1997 admission onwards)

Time: Three Hours                             Maximum: 100 Marks

Part A

Answer all questions.

1. Compare Bus and Ring topology.

2. What is Polling ?

3. Compare Virtual circuits and Datagrams.

4. What is Flooding

5. What are aloha systems ?

6. What is CSMA/CD ?

7. What (10 you meant by Quality of services ?

8. Describe the role of sessions layer.

9. Describe any one data compression technique.

10. Describe is Telnet ?           (10 x 4 --- 40 marks)

Part B

Answer all questions. All questions cam, equal marks.

11. (a) Explain ISO reference model.  Or

    (b) Explain sliding window protocol.

12. (a) Explain adaptive routing algorithms.    Or

    (b) Explain different congestion control algorithms.

13. (a) Explaill Ethernet networks.

    (b) Explain about satellite networks.

14. (a) Explain how transport layer performs connection establishment and multiplexing.      Or

    (b)    Explain how transport layer perform connection rAease.

15. (a) I x plain bout cryptography.     Or

    (b)    I x l) la i I I Clerent data compression methods.

(5 x 12 60 marks)

FOR COMPLETE PRINTED QUESTION PAPER SET CONTACT: 9745451920 Rs:50/-

MAHATMA GHANDHI UNIVERSITY (MG) B.TECH. DEGREE EXAMINATION, OCTOBER/NOVEMBER 2003 Computer Science and Engineering COMPUTER NETWORKS (R)

MAHATMA GHANDHI UNIVERSITY (MG)

B.TECH. DEGREE EXAMINATION, OCTOBER/NOVEMBER 2003

Computer Science and Engineering
COMPUTER NETWORKS (R)

Time: Three Hours                                           Maximum: 100 Marks

Part A

Answer all questions.

1. Compare fibre cable.

2. Write notes on bus and ring technology.

3. Write notes on datagrams.

4. Compare and contrast non-adaptive algorithm and adaptive algorithm.

5. Describe briefly the key feature's of LAN protocols.

6. Write note on IEEE standards.

7. What are the uses  transport service primitives ?

8. What are the uses of session layer

9. What is entrophy encoding ?

10. Give the two fundamental cryptography principles.

(10 x 4 = 40 marks)

Part B

Answer all .questions. All questions carry equal marks.

11. (a) Give an account of different transmission media. Or

    (b) Describe the various layers of OSI model.

12. (a) Describe the internal organization of network layer. Or

    (b) Give an account for routing algorithm. and explain the optimality principle.

13. (a) Describe ALOHA system. Or

    (b)    Describe IEEE standard 802 for LANS.

14. (a) Describe the elements of transport protocols.

Or

    (b) Describe the two-army problem.

15. (a) Describe how data compression is done.

Or

    (b) Describe the organization and use of email system.

(5 x 12 60 marks)

FOR COMPLETE PRINTED QUESTION PAPER SET CONTACT: 9745451920 Rs:50/-

B.TECH. DEGREE EXAMINATION, OCTOBER/NOVEMBER 2003 COMPUTER NETWORKS (R, I)

MAHATMA GHANDHI UNIVERSITY (MG)

B.TECH. DEGREE EXAMINATION, OCTOBER/NOVEMBER 2003

Computer Science and Engineering
COMPUTER NETWORKS (R, I)

Time: Three Hours                                           Maximum: 100 Marks

Part A

Answer all questions. Each question carries 4 marks.

1. Explain the principle of sliding window protocol.

2. Explain the advantages of LAN.

3. What is a datagram? Explain.

4. Explain Query Flooding.

5. Explain the finite population ALOHA.

6. Write notes on IEEE standards.

7. List the Quality of Service (QOS) parameters and explain:..

8. What are the goals of transport layer ? Explain.

9. What is meant by source encoding ? Explain with examples.

10. Explain the two fundamental principles of cryptography. (10 x 4 40 marks)

Part B

Answer all questions. Each question carries 12 marks.

11. (a)  What is meant by ISDN ? What are its services ? Explain in detail the ISDN architectur.e.,

Or

    (b)    Draw the OSI refefence model and explain the functions of different layers.

12. (a)  Explain any two routing algorithms with examples. Or

    (b)    Explain centralised routing and decentralised routing.

13. (a) Explain in detail the communication satellites with their properties.     Or

    (b)    Explain in detail the CSMA/CD protocol and compare CSMA with CSMA/CD.

14. (a) Explain TCP protocols. Or

    (b) Discuss the implementation of RPC (Remote Procedure Call).

15. (a) Explain in detail the different data compression techniques. Or

    (b) Write notes on : (i) Virtual terminal. (ii) Electronic mail.

(5 x 12 ----- 60 marks)

FOR COMPLETE PRINTED QUESTION PAPER SET CONTACT: 9745451920 Rs:50/-

COMPUTER NETWORKS (R, I) OCTOBER/NOVEMBER 2003 B.TECH. DEGREE EXAMINATION

MAHATMA GHANDHI UNIVERSITY (MG)

B.TECH. DEGREE EXAMINATION, OCTOBER/NOVEMBER 2003

Computer Science and Engineering
COMPUTER NETWORKS (R, I)

Maximum : 100 Marks

Part A

Ans^-wer all questions.

1. What is Network Architecture? What does its specification contain ?

2. In which lay..:..bridge          ? Why ?

3. What is the name given,to the division of routers in hierarchical routing `)What are its functions

5. How both TDIVI and F DM are used in AM radio broadcastin_g?

6. How can errors be handled ? What is Hamming distance ?

7. Briefl           l           a one y expain bit sliding' window protocol.

8. Draw a diagram to explain Diffe-Hellman key exchange and mention the application of this protocol.

9. What are the places in which file transfer protocol is used ?

10. Explain source coding.      (10 x 4

Part B

11. Explain in detail about gateways.

Or

12. What is a transparent bridge ? how it is different from n H tree_ bridge. With suitable diagrams, explain. Monte-Carlo connectivity analysis done

14. Discuss the function of Queue.

15. Compare the timing of events in i) PaCket switching' and (ii) Message switching.

16. Explain the geosynchronous satellite in detail.

16. What is the basis for MIT algorithm ? Explain the algorithm

18. Discuss the principles of congestion control.

19. Explain the application of I-I u      coding.

Or

20. What are the issues arising out of a crash? How are these issues handled?            (5 x 12 --- 60 marks)

FOR COMPLETE PRINTED QUESTION PAPER SET CONTACT: 9745451920 Rs:50/-