System Software Previous Year Question Paper For BTech Degree Examination May 2016

B.TECH DEGREE EXAMINATION, MAY 2016

Sixth Semester

Branch : Computer Science and Engineering

CS 010 603 SYSTEM SOFTWARE (CS)

(New Scheme - 2010 Admission onwards)

[Regular/Improvement/Supplementary]

Time : Three Hours

Maximum : 100 Marks

Part A

Answer all questions.

Each question carries 3 marks.

1. Explain parameterized macros with an example.
2. Give the format of header, text and end records in assembler output.
3. What is an absolute loader ?
4. What are the capabilities of a debugger ?
5. Define block device driver.

(5 × 3 = 15 marks)

Part B

Answer all questions.

Each question carries 5 marks.

6. How can we generate unique labels in a macro ?
7. What is a forward reference ? How is it handled in an assembler with two passes ?
8. What is the need for linking ?
9. Explain text editor user interface.
10. Write notes on general device characteristics.

(5 x 5 = 25 marks)

Part C

Answer all questions.

Each full question carries 12 marks.

11. Explain macropreprocessor algorithm.
    
    Or
12. Describe how nested macrocalls and recursive macrocalls are handled with the help of examples
    
    
13. Give the algorithm for a single pass assembler.
    
    Or
14. Explain the handling of external references by an assembler with the help of examples.
    
    
15. Give the algorithm for linking loader.
    
    Or
16. Write notes on UNIX ELF.
    
    
17. Explain overall editor structure with a diagram.
    
    Or
18. Explain how the debugger relates with other parts of the system.
    
    
19. Give the general design and anatomy of devices.
    
    Or
20. Write notes on character devices and their drivers.

(5 × 12 = 60 marks)

Compiler Construction Previous Year Question Paper MG University BTech

Compiler construction previous year question paper of seventh semester (s7) BTech exam under MG university (MGU).

В ТЕСН. DEGREE EXAMINATION, NOVEMBER 2015 Seventh Semester

Branch Computer Science and Engineering CS 010 702 COMPILER CONSTRUCTION (CS)

(New Scheme—2010 Admission onwards,

[Regular/Supplementary]

Time - Three Hours

Maximum : 100 Marks

Part A

Answer all questions.

Each question carries 3 marks.

1. Define phases of compiler.
2. What is recursive descent parsing .
3. Define runtime stack.
4. Define ICG.
5. Define various types of errors.

 (5 × 3 = 15 marks)

Part B

Answer all questions.

Each question carries 5 marks.

6. Draw a DFD that accepts the four reserved words case, const and continue from c language.
7. Explain shift reduce parsing.
8. Discuss memory allocation in block structured languages.
9. Explain quadruples.
10. Discuss data descriptors.

(5 x 5 = 25 marks)

Part C

Answer all questions.

Each question carries 12 marks.

11. (a) Explain the tokens using regular expressions.
    
    Or
    (b) Discuss the lexical analysis and its role.
    
12. (a) Given the following grammar contract SLR parsing X->YX/Z, Y->XY/W table for string ZWWZ.
    
    Or
    (b) Explain operator precedence parsing.
    
13. (a) Explain memory allocation strategies.
    
    Or
    (b) Discuss the role of declaration statements in intermediate code generation.
    
14. (a) Explain machine dependent and independent code optimization techniques.
    
    Or
    (b) Give the semantic rules for declarations in a procedure.
    
15. (a) Write a note on  (i) cross compilers; (ii) Incremental compilers.
    
    (6 + 6 =12 marks)
    Or
    (b) Explain the basic issues in code generation.

[5 × 12 = 60 marks]

How to Make Restart Shortcut in Windows

Here we will see how to create a restart shortcut. To make a shortcut for restart option on desktop, follow the given instructions:

1. Right Click on Desktop.
2. Select New > Shortcut
3. In the text box, type: shutdown /r /t 1
4. Click Next.
5. Give a name like 'Restart' for the shortcut .
6. Click Finish.

Advanced Networking Trends BTech Previous Year Question Paper 2016 - MG University

B.TECH, DEGREE EXAMINATION, MAY 2016

Eighth Semester

Branch Computer Science and Engineering

CS 010 804 L06 – ADVANCED NETWORKING TRENDS (Elective III) (CS)

(New Scheme—2010 Admission onwards)

[Regular/supplementary]

Time : Three Hours

Maximum : 100 Marks

Part A

Answer all questions

Each question carries 3 marks

1. Draw the frame format of Ethernet.
2. An AAL1 layer receives data at 2Mbps. How many cells are created per second by ATM layer ?
3. Differentiate between infrared and radio transmission.
4. What is self configuration and autoconfiguration ?
5. What is Hybrid TDMA / FDMA ?

(5 x 3 = 15 Marks)

Part B

Answer all questions.

Each question carries 5 marks.

6. Explain the following with respect to fast Ethernet:
     (a) 100BASET4 ; and (b) 100BASETX.
7. Write a short note on ATM cell header format.
8. With the neat diagram briefly explain Bluetooth protocol stack.
9. What is the scope of mesh 802.11s ?
10. What is Flooding and what are its disadvantages ?

(5 x 5 = 25 Marks)

Part C

Answer all questions.

Each question carries 12 marks.

11. Explain gigabit Ethernet in detail.
    
    Or
12. What is ISDN ? Explain its protocol architecture.
    
    
13. What are the various ATM signaling used ? Explain in detail.
    
    Or
14. With the neat diagram, explain ALL3/4 and AAL5 layers of AAL.
    
    
15. Explain 802.11 architecture and protocol architecture with a neat diagram.
    
    Or
16. What are the collision avoidance methods used in IEEE 802.11 ?
    
    
17. Explain the architecture of 802.11s.
    
    Or
18. Explain the concept of Vehicular Mesh network.
    
    
19. How do we measure the quality of sensor network ?
    
    Or
20. Explain the following issues with respect to sensor networks :
    (a) Synchronization ; and (b) Transport layer issues.

(5 x 12 = 60 marks)

Neural Networks Previous Year Question Paper 2016 - MG University BTech

B.TECH. DEGREE EXAMINATION, MAY 2016

Eighth Semester

Branch : Computer Science and Engineering/Information Technology

CS 010 805 G02/IT 010 805 G05 -NEURAL NETWORKS (Elective IV) (CS, IT)

(New Scheme 2010 Admission onwards)

[Regular/Supplementary]

Time Three Hours

Maximum : 100 Marks

Part A

Answer all questions.

Each question carries 3 marks.

1. What is the difference between human intelligence and machine intelligence ?
2. What are multilayer perceptrons ?
3. What are the applications of Radial Basis Function networks ?
4. What are the various ways to realize competition in neural networks ?
5. What is pattern association ?

(5 x 3 = 15 marks)

Part B

Answer all questions.

Each question carries 5 marks.

6. Why we need pattern classification ?
7. Explain temporal stability.
8. How to train RBF networks ? Explain.
9. What is a counter propagation network ?
10. Give an example for hetero associative networks.

(5 x 5 = 25 marks)

Part C

Answer all questions.

Each question carries 12 marks.

11. Compare the performance of a computer and that of a biological neural network in terms of speed of processing, size and complexity, storage, fault tolerance and control mechanism.
    
    Or
12. Explain McCulloch-Pitts model of neuron.
    
    
13. Briefly explain Back propagation algorithm in detail.
    
    Or
14. Derive the Back propagation algorithm for regression.
    
    
15. What is under fitting and over fitting ? Explain prevention mechanisms for the same.
    
    Or
16. Explain learning with momentum and conjugate gradient learning.
    
    
17. Explain Maxnet fixed weight competitive networks.
    
    Or
18. Explain the application and architecture of full counter propagation network.
    
    
19. Briefly explain the algorithm for hopfield networks.
    
    Or
20. What is the purpose of using bidirectional associative memory ? Explain.

(5 x 12 = 60 marks)

Security in Computing Previous Year Question Paper - MG University BTech Eighth Semester

Eighth semester (s8) BTech Security in Computing previous year question paper - MG university CSE.

B.TECH DEGREE EXAMINATION, MAY 2016

Eighth Semester

Branch: Computer Science and Engineering

CS 010 803 SECURITY IN COMPUTING—(CS)

(New Scheme — 2010 Admission onwards)

[Regular/Supplementary]

Time : Three Hours

Maximum 100 Marks

Part A.

Answer all questions.

Each question carries 3 marks.

1. Define security attacks.
2. What do you mean by Avalanche effect?
3. Differentiate between direct and arbitrated digital signature.
4. What are the services provided by IP Sec ?
5. What do you mean by Biba integrity model ?

(5 x 3 = 15 marks)

Part B

Answer all questions.

Each question carries 5 marks.

6. Briefly explain symmetric cipher model.
7. Explain briefly about prime factorization.
8. Write note on hash functions.
9. What are the different functions provided by S/MIME? Explain.
10. Explain password selection strategies and their significance.

(5 x 5 = 25 marks)

Part C

Answer all questions.

Each question carries 12 marks.

11. What is meant by security services ? Explain different categories of security services.
    
    Or
12. What is meant by transposition cipher ? Explain rail fence cipher and row transposition ciphers with example.
    
13. With a neat sketch, explain about the DES encryption and decryption process with the internal structure of a single round of DES algorithm.
    
    Or
14. Explain the key management of public key encryption in detail.
    
15. Write down and explain SHA-512 algorithm.
    
    Or
16. Discuss the overview of Kerberos. Explain Simple Authentication Dialogue and More Secure Authentication Dialogue, in Kerberos Version 4.
    
17. What is PGP ? What are the services provided by PGP ? Explain.
    
    Or
18. What is meant by firewalls ? Discuss about different types of firewalls.
    
19. Define Intrusion Detection. Explain in detail about the various types of detection mechanisms.
    
    Or
20. What are Security models ? Explain different types of Security models.

(5 x 12 = 60 marks)

Previous Year Computer Graphics Question Paper - MG University BTech Degree Exam

Computer Graphics previous year question paper of seventh semester (s7) BTech exam under MG university (MGU).

В ТЕСН. DEGREE EXAMINATION, MAY 2016

Seventh Semester

Branch: Computer Science and Engineering

CS 010 703 COMPUTER GRAPHICS (CS)

(New Scheme—2010 Admission onwards)

[Regular/Supplementary]

Time : Three Hours

Maximum 100 Marks

Part. A

Answer all questions.

Each question carries 3 marks.

1. Define Raster Scan displays.
2. State Bresenham's Line drawing algorithm.
3. Define Bezier Curves.
4. Define Perspective Projection.
5. What is Texture Mapping ?

(5 x 3 = 15 marks)

Part B

Answer all questions.

Each question carries 5 marks.

6. Describe briefly about Display files.
7. State and explain Cohen Sutherland line clipping algorithm.
8. Briefly explain B-Spline curve technique.
9. Explain any one Back-face detection technique.
10. Describe Constant shading method.

(5 x 5 = 25 marks)

Part C

Answer all questions.

Each full question carries 12 marks.

11. Explain the working of any three Graphical Input devices with neat diagrams.
    
    Or
12. Explain the functions and components of Random Scan display system.
    
13. Explain Polygon clipping and viewing transformations in detail.
    
    Or
14. Describe Bresenham's Circle drawing algorithm with examples.
    
15. Explain Bezier Curves and Surfaces.
    
    Or
16. Write notes on the following :—
    (a) Quadric surfaces
    (b) Sweep representation
    (c) Octrees.
    
17. Explain the Depth Buffer algorithm for hidden surface removal.
    
    Or
18. Describe about various 3D viewing projections.
    
19. Describe Ray Tracing and Ray Casting fractals with examples.
    
    Or
20. Explain various Interpolative shading methods.

(5 × 12 = 60 marks)

Compiler Construction Previous Year Question Paper MG University BTech

Compiler construction previous year question paper of seventh semester (s7) BTech exam under MG university (MGU).

В ТЕСН. DEGREE EXAMINATION, NOVEMBER 2015 Seventh Semester

Branch Computer Science and Engineering CS 010 702 COMPILER CONSTRUCTION (CS)

(New Scheme—2010 Admission onwards,

[Regular/Supplementary]

Time - Three Hours

Maximum : 100 Marks

Part A

Answer all questions.

Each question carries 3 marks.

1. Define phases of compiler.
2. What is recursive descent parsing .
3. Define runtime stack.
4. Define ICG.
5. Define various types of errors.

 (5 × 3 = 15 marks)

Part B

Answer all questions.

Each question carries 5 marks.

6. Draw a DFD that accepts the four reserved words case, const and continue from c language.
7. Explain shift reduce parsing.
8. Discuss memory allocation in block structured languages.
9. Explain quadruples.
10. Discuss data descriptors.

(5 x 5 = 25 marks)

Part C

Answer all questions.

Each question carries 12 marks.

11. (a) Explain the tokens using regular expressions.
    
    Or
    (b) Discuss the lexical analysis and its role.
    
12. (a) Given the following grammar contract SLR parsing X->YX/Z, Y->XY/W table for string ZWWZ.
    
    Or
    (b) Explain operator precedence parsing.
    
13. (a) Explain memory allocation strategies.
    
    Or
    (b) Discuss the role of declaration statements in intermediate code generation.
    
14. (a) Explain machine dependent and independent code optimization techniques.
    
    Or
    (b) Give the semantic rules for declarations in a procedure.
    
15. (a) Write a note on  (i) cross compilers; (ii) Incremental compilers.
    
    (6 + 6 =12 marks)
    Or
    (b) Explain the basic issues in code generation.

[5 × 12 = 60 marks]

How to Schedule a Shutdown in Windows

You can schedule a shutdown in Windows. We will see how to plan a shutdown in your windows computer. It works for Windows 7, Windows 8 and Windows 10. To arrange or organize an automatic shutdown in your Windows computer, we use a run command. Once you set up a shutdown, when the specified time period is elapsed, you computer will shut down. Follow the given instructions to schedule an auto shutdown.

1. Open Run dialog box from start menu (or by pressing Windows key + R).
2. type shutdown /s /t sec in it.
   Here sec is the amount of time in seconds to be elapsed before shut down.
3. Press Enter or click OK.
4. You will be notified that a shutdown is scheduled.
5. It is done.

An example is:

shutdown /s /t 600

Here after 600 seconds (10 minutes), the computer will turn off. The following video will show you.