Web Technologies Previous Year Question Paper - Computer Science - BTech - MG University

Web technologies (WT) previous year question paper for seventh semester (s7) Computer Science and Engineering BTech Degree Examination under MGU (MG University) syllabus.

B.TECH. DEGREE EXAMINATION, NOVEMBER 2015

Seventh Semester

Branch Computer Science and Engineering

CS 01 07 01 WEB TECHNOLOGIES

(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 are character entities ?
2. Explain XML document structure.
3. What are Perl scalars ?
4. Mention the origins and uses of PHP.
5. How do rails work with databases ?

Part B

Answer all questions.

Each Question carries 5 marks.

6. Explain ordered lists and unordered lists with an example
7. What is DTD ? Give the declaration syntax for internal and external DTDs.
8. List and explain any five string functions in Perl.
9. Explain about relational operators in PHP.
10. Describe the rails layout template.

(5 x 5 = 25 marks)

Part C

Answer all questions.

Each question carries 12 marks.

11. Discuss about the syntax and example of anchor tags and href tags.
    
    (12 marks)
    Or
12. Explain CSS syntax using selector, property and value for assigning style properties
    
    (12 marks)
13. (a) List the basic rules of XML.
    
    (6 marks)
    b) Explain the need for using document type definitions
    
    (6 marks)
    Or
14. With suitable examples explain simple and complex data types in ХМL Schema.
    
    (12 marks)
15. (a) Explain string functions in Perl with suitable examples
    
    (6 marks)
    (b) Give the syntax and example of Foreach statement in Perl.
    
    (6 marks)
    Or
16. Write a program to create a hash with a set of student-name and student-id pairs. Populate the hash with five sets of data. Prompt the user for student-id and print both the details.
    
    (12 marks)
17. Explain the two types of arrays in PHP with suitable examples.
    
    (12 marks)
    Or
18. What is a Cookie? Explain with PHP sample code how to create, read and delete a cookie.
    
    (12 marks)
19. Illustrate with meat diagrams and explain the traditional and ajax browser-server interactions.
    
    (12 marks)
    Or
20. Explain how rails implements ajax in detail.
    
    (12 marks)

[5 × 12 = 60 marks]

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)

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)

Signals And Communication Systems Previous Year Question Paper - MGU Btech

Previous year question paper of Signals and Communication Systems paper of Fourth semester BTech Computer Science and Engineering degree under MG University (MGU)

B.TECH DEGREE EXAMINATION,MAY 2013 Fourth Semester

Branch : Computer Science and Engineering

CS 010 404-SIGNALS AND COMMUNICATION SYSTEMS (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. Write short notes on Quantisation.
2. Describe different communication channels.
3. Explain about Sample problems based on different modulation methods.
4. Compare Datagram's and virtual circuits.
5. What is Bar code?

(5*3=15 marks)

Part B

Answer all questions.

Each question carries 5 marks.

6. List the different types of signals and explain its properties.
7. Explain signal propagation delay and attenuation .
8. Explain pulse width modulation.
9. Describe in detail Wavelength division multiplexing.
10. Explain convolution coding.

(5*5=25 marks)

Part C

Answer all questions.

Each full question carries 12 marks.

11. (a) Explain sampling theorem with necessary diagrams.

Or

(b) Determine the Fourier transform of the signal.


12. (a) Draw and explain the Architecture of a Typical communication system. And explain the different types of noise.

Or

(b) Explain in detail different types of communication channels.


13. (a) Explain any three types of Pulse modulation techniques.

Or

(b) Explain the following types of modulation schemes (PSK,DPSK)


14. (a) Explain various switching methods.

Or

(b) Explain with block diagram Time Division Multiplexing (TDM) (Transmitter and Receiver section ).

15. (a) Write the following error correction and detection code with example:
Line coding schemes, block coding

Or

(b)Write short notes on ASCII, EBCDIC, Bar coding and Baudot coding

(5*12=60 marks)

Signals And Communication Systems Previous Year Question Paper - MG University BTech

This is the previous year question paper (2014 May) of signals and communication systems (SCS) paper of BTech Computer Science and Engineering under MG university (MGU).

B.TECH DEGREE EXAMINATION,MAY 2014 Fourth Semester

Branch : Computer Science and Engineering

CS 010 404-SIGNALS AND COMMUNICATION SYSTEMS (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. Enumerate the properties of the signals. Explain any two.
2. Define and explain Noise. List the types of noise
3. What is the difference between PPM and PDM ? Explain in detail.
4. What is the principle of WDM ? Mention the types of WDM.
5. Explain the properties of hamming codes.

(5*3=15 marks)

Part B

Answer all questions.

Each question carries 5 marks.

6. Define and explain CTFS .
7. Differentiate Twisted pair from coaxial cables. Explain.
8. What is OOK ? Bring out its mathematical representation .
9. Explain the principles of Half and Full duplex transmissions with neat diagrams.
10. Give an account on "Baudot code".

(5*5=25 marks)

Part C

Answer all questions.

Each full question carries 12 marks.

11. (i) State and explain sampling theorem.
(ii) Prove the properties of CTFS.

Or

12. Differentiate continuous time signals from discrete time signals with examples. Explain the difference.


13. Define and explain typical parameters of communication systems.

Or

14. State and explain Shannon Hartley theorem. Derive an expression for Channel capacity of a Noisy channel.


15. Explain AM,PM and FM in detail with neat diagrams. Bring out their mathematical representations.

Or

16. Compare and contrast the parameters of different modulation formats. Explain the comparison in detail.


17. Explain the principles of TDM and FDM in detail with neat diagrams .

Or

18. Explain the basic concept of SONET with neat diagrams.


19. Explain the properties and advantages of Linear block codes. Drive its code vector.

Or

20. Write technical notes on:
(i) EBCDIC
(ii) Parity coding
(iii) Syndrome calculator.

(5*12=60 marks)

Computer Networks Modulewise Short Notes Free PDF and Doc Download

Welcome. I have uploaded some short notes (lecture notes) and slides for CN (Computer networks). Computer Networks is a subject taught for Computer Science and Engineering Branches and Information technology Branches. The notes for Computer networks are available for download. There are different notes from different sources. We have also included slideshows (slides). The note full set is complete. You can compare and study. Computer networks slides are specially mentioned as slides. MGU (MG university) Computer networks syllabus is available here.

Module 1:

Network requirements, Network Architecture, Layering and Protocols, OSI Architecture, Internet Architecture, Performance - bandwidth and latency, Delay bandwdith product, high speed networks.

Note Full Set

Download Module 1 note Part A

Download Module 1 note Part B

Other notes:

Download Module 1 note

Download Module 1 note

Module 2:

Direct Link network, hardware Building Block, Framing - Byte Oriented protocol, Bit oriented protocol, Clock based framing, Reliable transmission- stop and wait, sliding windows, Ethernet (802.3)- physical properties, Access protocol, wireless-bluetooth, wifi, Wimax

Note Full Set

Download Module 2 note Part A

Download Module 2 note Part B

Other notes:

Download Module 2 note

Download Module 2 note

Download Module 2 Slides -Ethernet onwards

Download Module 2 Wireless slides

Module 3:

Packet switching-switching and forwarding-Datagram,  virtual circuit switching, source routing bridges and LAN switches - Learning bridges, Spanning tree algorithms, Broadcast and multicast, Limitations of bridges, simple internetworking - service model, global address, datagram forwarding in IP, address translation, Routing - network as graph, distance vector, link state, matrix.

Note Full Set

Download Module 3 note Part A

Download Module 3 note Part B

Download Module 3 Packet switching Slides ppt

Other notes:

Download Module 3 note

Module 4

End to End protocol, simple de-multiplexer, reliable byte stream, TCP - Issues, segment format,connection establishment and termination, sliding window revisited, triggering transmission,, adaptive retransmission, RPC- fundamentals, TCP congestion control, - additive increase, slow start, fast retransmit and fast recovery, congestion avoidance mechanism, DEC bit, Randomearly detection bit, source based congestion avoidance.

Note Full Set

Download Module 4 note Part A

Download Module 4 note Part B

Download Module 4 slide pptx

Other notes:

Module 5

Applications -WWW, Email, name service, network management, web services custom application protocol, generic application protocol, overlay networks - peer to peer networks.

Note Full Set

Download Module 5 note Part A

Download Module 5 note Part B

Other notes:

Data Structures and Algorithms Previous Year Question Paper For BTech Computer Science and IT

Here i have uploaded the previous year (2014 MAY) question paper of DATA STRUCTURES AND ALGORITHMS (DS)  for Fourth semester for Computer Science and Engineering (CS or CSE) and Information Technology (IT) branches under MG university BTech course.

Course : B.Tech Engineering (degree)
University: MG university (Mahatma Gandhi university) Kottayam, Kerala
Department or branch: Computer Science and Engineering (CS or CSE) and Information Technology (IT)

DBMS Previous Year Question Paper for Fifth Semester BTech Computer Science and IT

Here i have uploaded the previous year (2014 November) question paper of Database management systems (C S, IT) for Fifth semester for Computer science and engineering (CS or CSE) and information technology (IT) branches under MG university BTech course.

Course : B.Tech Engineering (degree)
University: MG university (Mahatma Gandhi university) Kottayam, Kerala
Department or branch: Computer science and engineering (CS or CSE) and Information Technology (IT)

STLD Previous Year Question Paper 2013 for Third Semester Computer Science

Free download Previous year 2013 question paper for B.Tech degree examination of Switching Theory and Logic Design for third semester Computer science and engineering (CSE).

Subject : Switching Theory and Logic Design or STLD (3rd sem)
Course : BTech Engineering
Department: Computer Science and engineering (CS)
Semester: Third semester (s3)
University : MG university Kottayam kerala

Previous Year Question Paper for Principle of Management for B.Tech Courses

Free download Previous year 2014 question paper for B.Tech degree examination of Principle of management for the branches : Aeronautical Engineering, Computer science, Electrical and electronics engineering (AN, CS, EE) Fifth semester.

Subject : Principle of Management (5th sem)
Course : BTech Engineering
Department: Aeronautical Engineering, Computer Science and engineering (CS), Electrical and electronics engineering
Semester: Fifth semester (s5)
University : MG university Kottayam kerala

Binary Tree And Prefix & Postfix Notations Of Arithmetic Expressions

We can construct meaningful derivation trees that enable us to represent arithmetic expressions in infix, prefix and postfix forms. A binary tree is enough to represent all these three notations of arithmetic expressions. Both prefix and postfix notations are unintelligable for humans. But they are of great use in computer science. Compilers often convert infix to prefix notation and then to assembler code. From a derivation tree of an algebraic expression, we can get equivalent prefix and postfix notations. An algebraic expression in terms of operators and operands can be derived by an ambiguous context-free grammar. Prefix notation is the parenthesis-free notational scheme invented by Polish logician Jan Lukasiewicz and is often called polish notation. In prefix notation operators are followed by operands.

For example, in prefix notation A + B is written as +AB. Postfix notation is reverse of prefix notation. AB+ is  the equivalent postfix notation of A + B. The infix form is evaluated and the binary tree is created according to the priority of the operators. Let us start from the simplest examples.

Syllabus for First Year Btech under MG University (combined Ist & IInd Sem) (Common for all branches)

EN010 101 ENGINEERING MATHEMATICS – I

Credits: 5

Teaching Scheme

2 hour lecture and 1 hour tutorial per week

MODULE I (18 hours) - MATRIX

Elementary transformation – echelon form – rank using elementary transformation by reducing in to echelon

form – solution of linear homogeneous and non – homogeneous equations using elementary transformation.

Linear dependence and independence of vectors – eigen values and eigen vectors – properties of eigen values

and eigen vectors(proof not expected) – Linear transformation – Orthogonal transformation –

Diagonalisation – Reduction of quadratic form into sum of squares using orthogonal transformation – Rank,

index, signature of quadratic form – nature of quadratic form

BTech Computer Science and Engineering Third Semester Syllabus for MG University

The syllabus for Third semester BTech Computer Science and Engineering under MG (Mahatma Gandhi) University is given below. You can also download the syllabus.
Click here to download as pdf

EN010301B ENGINEERING MATHEMATICS II (CS, IT)

Credits 4

MODULE 1 Mathematical logic (12 hours)

Basic concept of statement, logical connectives, Tautology and logical equivalence - Laws of algebra of propositions - equivalence formulas- Tautological implications (proof not expected for the above laws, formulas and implications). Theory of inference for statements — Predicate calculus - quantifiers - valid formulas and equivalences -free and bound variables - inference theory of predicate calculus

BTech Computer Science and Engineering Fourth Semester Syllabus - MG University

This post contains the syllabus for Fourth semester BTech Computer Science and Engineering from Mahatma Gandhi University (MG University), Kottayam. Click here to download pdf

EN 010 401 ENGINEERING MATHEMATICS III (Common to all branches)

Teaching scheme Credits: 4
2 hours lecture and 2 hour tutorial per week

MODULE 1 FOURIER SERIES (12 hours)

Dirichlet conditions - Fourier series with period 2π and 2l - Half range sine and cosine series - Harmonic Analysis - r.m.s Value