P. 1


|Views: 14|Likes:
Published by ashmitashrivas

More info:

Published by: ashmitashrivas on Feb 01, 2013
Copyright:Attribution Non-commercial


Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less






B. Tech Degree Course In Information Technology
Scheme and Syllabus
(2008 scheme)

B.Tech Information Technology, University of Kerala

1. Conditions for Admission Candidates for admission to the B.Tech degree course shall be required to have passed the Higher Secondary Examination, Kerala or 12th Standard V.H.S.E., C.B.S.E., I.S.C. or any examination accepted by the university as equivalent thereto obtaining not less than 50% in Mathematics and 50% in Mathematics, Physics and Chemistry/ Bio- technology/ Computer Science/ Biology put together, or a diploma in Engineering awarded by the Board of Technical Education, Kerala or an examination recognized as equivalent thereto after undergoing an institutional course of at least three years securing a minimum of 50 % marks in the final diploma examination subject to the usual concessions allowed for backward classes and other communities as specified from time to time. 2. Duration of the course i) The course for the B.Tech Degree shall extend over a period of four academic years comprising of eight semesters. The first and second semester shall be combined and each semester from third semester onwards shall cover the groups of subjects as given in the curriculum and scheme of examination. Each semester shall ordinarily comprise of not less than 400 working periods each of 60 minutes duration. A candidate who could not complete the programme and pass all examinations within Ten (10) years since his first admission to the B.Tech programme will not be allowed to continue and he has to quit the Programme. However he can be readmitted to the first year of the programme if he/she satisfies the eligibility norms applicable to the regular candidates prevailing at the time of readmission.

ii) iii)

3. Eligibility for the Degree Candidates for admission to the degree of bachelor of technology shall be required to have undergone the prescribed course of study in an institution maintained by or affiliated to the University of Kerala for a period of not less than four academic years and to have passed all the examinations specified in the scheme of study 4. Subjects of Study The subjects of study shall be in accordance with the scheme and syllabi prescribed 5. Evaluation Candidates in each semester will be evaluated both by continuous assessment and end semester University examination. The individual maximum marks allotted for continuous assessment and University examination for each subject is as prescribed by the scheme of study.


B.Tech Information Technology, University of Kerala

5.1 Continuous Assessment (C.A)
The marks awarded for the continuous assessment will be on the basis of the day-to-day work, periodic tests (minimum two in a semester) and assignments (minimum of three – one each from each module). The faculty member concerned will do the continuous assessment for each semester. The C.A. marks for the individual subjects shall be computed by giving weight age to the following parameters.

Subject Theory Subjects Drawing Practical Project Work


Assignments/ Class Work 20% 50% 30% 20% 40% 40% 20% 40% 40% Work Assessed by Guide – 50% Assessed by a three member committee out of which one member is the guide – 50%


The C.A. marks for the attendance (20%) for each theory, practical and drawing shall be awarded in full only if the candidate has secured 90% attendance or above in the subject. Proportionate reduction shall be made in the case of subjects in which he/she gets below 90% of the attendance for a subject. The CA marks obtained by the student for all subjects in a semester is to be published at least 5 days before the commencement of the University examinations. Anomalies if any may be scrutinized by the department committee and the final CA marks are forwarded to the university within the stipulated time. 5.2. End Semester University Examinations i) There will be University examinations at the end of the first academic year and at the end of every semester from third semester onwards in subjects as prescribed under the respective scheme of examinations. Semester classes shall be completed at least 10 working days before the commencement of the University examination. The examination will be held twice in a year – April/May session (for even semester) and October/November session (for odd semester). The combined 1 st and 2nd semester is reckoned as equivalent to an even semester for the purpose of conduct of examination and the University examination will be held during April/May. However VII and VIII Semester examination will be conducted in both the sessions. This schedule will not be changed. A student will be permitted to appear for the university examination only if he/she satisfies the following requirements a. He/she must secure not less than 75% attendance in the total number of working periods during the first year and in each semester thereafter and shall be physically present for a minimum of 60% of the total working periods. In addition, he/she also shall be physically present in at least 50% of total working periods for each subject b. He must earn a progress certificate from the head of the institution of having satisfactorily completed the course of study in the semester as prescribed by these regulations c. It shall be open to the Vice-Chancellor to grant condonation of shortage of attendance on the recommendation of the head of the institution in accordance with the following norms




He/she shall be physically present for a minimum of 50% of the total working periods f. Drawing & Practical) The scheme of valuation will be decided by the chief examiner for theory / drawing subjects For practical examinations. B+.E only Letter Grade S A+ A B+ B C+ C D E F Grade (G. A student who is not permitted to appear for the University examinations for a particular semester due to the shortage of attendance and not permitted by the authorities for condonation of shortage of attendance shall repeat the semester when it is offered again. This provision is allowed only once for a semester.A marks + University Exam mark) is 50 % or above. The university will conduct examinations for all subjects (Theory.P) 10 9 8. B.A marks+ University Exam mark) and the corresponding grade point in a ten-point scale is described below.A marks + University Exam mark) 90 % and above 85 % and above but less than 90% 80 % and above but less than 85% 75 % and above but less than 80% 70 % and above but less than 75% 65 % and above but less than 70% 60 % and above but less than 65% 55 % and above but less than 60% 50 % and above but less than 55% Below 50% (C. The condonation shall be granted subject to the rules and procedures prescribed by the university from time to time. The shortage shall not be condoned more than twice during the entire course g.5 7 6.B. E and F) will be awarded. The attendance shall not be less than 60% of the total working periods e.A + U. Letter Grades For each subject in a semester. University of Kerala iv) v) vi) vii) d.5 8 7. The condonation for combined 1st and 2 nd semesters will be reckoned as a single condonation for attendance purposes. Letter grade corresponding to total marks (C. based on the total marks obtained by the student in the University examination and Continuous assessment put together a letter grade (S. the examiners together will decide the marks to be awarded.E) or below 40 % for U. 6.A+. % of Total marks (C. All letter grades except ‘F’ will be awarded if the marks for the University examination is 40 % or above and the total mark (C.5 0 Point Remarks Excellent Failed 3 . h. C. The student shall produce the certified record of the work done in the laboratory during the examination.5 6 5. The evaluation of the candidate should be as per the guidelines given in the syllabus for the practical subject. D. C+. A.Tech Information Technology. No absolute mark will be indicated in the grade card.

A candidate shall be declared to have passed a semester examination in full in the first appearance if he/she secures not less than 5. The grades obtained by the candidate for each subject in the improvement chance he has appeared for or the already existing grades – whichever is better will be reckoned as the grades secured. 9. First & Second semester will be counted as a single chance and they can improve a maximum of three subjects ii) A candidate shall be allowed to repeat the course work in one or more semesters in order to better the C. The candidate shall be permitted to improve the examination only along with next available chance. Minimum for a pass a. CGPA is calculated in a 10-point scale as shown below.B. A candidate who does not secure a full pass in a semester examination as per clause (a) above will have to pass in all the subjects of the semester examination as per clause (b) above before he is declared to have passed in that semester examination in full. c. marks already obtained. GPA for a particular semester is calculated as per the calculation shown below.A. credits for the subject. The candidate shall not be allowed to appear for an improvement examination for the subjects of the VII & VIII semesters c. GPA for the semester and CGPA up to that particular semester.5 GPA with a minimum of ‘E’ grade for the all individual subject in that semester. b. In addition to the grade cards for each semester all successful candidate shall also be issued a consolidated statement grades. b. On specific request from a candidate and after remitting the prescribed fees the University shall issue detailed mark to the individual candidate. subject to the following conditions 4 . letter grades obtained. Improvement of Grades i) A candidate shall be allowed to re-appear for a maximum of two subjects of a semester examination in order to improve the marks and hence the grades already obtained subject to the following conditions a. A candidate shall be declared to have passed in an individual subject of a semester examination if he/she secures grade ‘E’ or above.Tech Information Technology. 8. d. Credit  GP obtained for the subject GPA    credit for subject Cumulative Grade point Average (CGPA) is the average grade points obtained by the students till the end of any particular semester. CGPA   Credits for semester  GPA obtained for the semester  credits for the semester GPA and CGPA shall be rounded to two decimal points. University of Kerala 7. The Grade card issued to the students shall contain subject number and subject name. Grade Point Average (GPA) and Cumulative Grade Point Average (CGPA) Grade point average is the semester wise average points obtained by each student in a 10point scale.

He/she shall not combine this course work with his/her regular course work c. He/she shall repeat the course work in a particular semester only once and that too at the earliest opportunity offered to him/her.Tech Degree examination in SECOND CLASS Successful candidates who complete the examination in four academic years (Eight consecutive semesters after the commencement of the course of study shall be ranked branch-wise on the basis of the CGPA in all eight semesters put together. will have effect from the beginning of the academic year / semester following the notification of the University 5 . curriculum. c. Revision of Regulations The university may from time to time revise. All other successful candidates shall be declared to have passed the B. amend or change the regulations. He/she shall not be allowed to repeat the course work of any semester if he has already passed that semester examination in full d.Tech Information Technology. The C. Students who pass the examination in supplementary examination are also covered under this clause ii) iii) iv) 11. 10. In the case of a tie in the CGPA the total marks of the students who have got same CGPA shall be considered for finalizing the rank.5 CGPA up to and including eighth semester shall be declared to have passed the B.Tech degree examination in FIRST CLASS WITH DISTINCTION A candidate who qualifies for the degree passing all the subjects of the eight semesters within five academic years ( ten consecutive semesters after the commencement of his/her course of study) and secures less than 8 CGPA but not less than 6. The students may undertake one educational tour preferably after fourth semester of the course and submit a tour report b. b.Tech degree examination in FIRST CLASS.B. Educational Tour a. Classification of Successful candidates i) A candidate who qualifies for the degree passing all the subjects of the eight semesters within five academic years ( ten consecutive semesters after the commencement of his/her course of study) and secures not less than 8 CGPA up to and including eighth semester (overall CGPA) shall be declared to have passed the B. University of Kerala a. combined with the vacation / holidays if required. Total number of Tour days shall not exceed 15 days. scheme of examinations and syllabi. The tour period shall be considered as part of the working periods of a semester 12. These changes unless specified otherwise.A marks obtained by the repetition of the course work will be considered for all purposes iii) A candidate shall be allowed to withdraw from the whole examination of a semester in accordance with the rules for cancellation of examination of the University of Kerala. The tour may be conducted during the vacation / holidays taking not more than 5 working days.

B.Tech Information Technology, University of Kerala


B.Tech Information Technology, University of Kerala

Course Code 08.101 08.102 08.103 08.104 08.105 08.106 08.107 08.108 08.109 08.110 Hours / Week

Engineering Mathematics Engineering Physics Engineering Chemistry Engineering Graphics Engineering Mechanics Basic Civil Engineering Basic Mechanical Engineering Basic Electrical and Electronics Engineering Basic Communication and Information Engineering Engineering Workshops Total Total Marks




Maximum Sessional Marks

2 2 2 1 2 2 2 2 2 0 17

1 1 1 0 1 1 1 1 1 0 8

0 0 0 2 0 0 0 0 0 2 4

50 50 50 50 50 50 50 50 50 50 500

University Exams Maximum Hours Marks 3 100 3 100 3 3 3 3 3 3 3 3 100 100 100 100 100 100 100 100 1000

Credits 6 6 6 6 6 6 6 6 6 4 58


The subject 08.109 shall be handled by the Department of Electronics and Communication Engineering,


B.Tech Information Technology, University of Kerala

Course Code 08.301 08.302 08.303 08.304 08.305 08.306 08.307 08.308

Hours / Week L 3 2 2 2 2 2 0 0 13 T 1 2 1 1 2 1 0 0 8 D/P 0 0 0 0 0 0 4 4 8

Engineering Mathematics II (CMPUNERFTAHB) Problem Solving and Programming in C(R F) Discrete Structures(R F) Electronic Circuits (R F) Digital System Design (R F) Computer Organization (R F) Electronic Circuits Lab (R F) Programming Lab (R F) Total Total Marks

Maximum Sessional Marks

University Exams Hours 3 3 3 3 3 3 3 3 Maximum Marks 100 100 100 100 100 100 100 100 800 Credits

50 50 50 50 50 50 50 50 400 1200

4 4 3 3 4 3 4 4 29

Course Code 08.401 08.402 08.403 08.404 08.405 08.406 08.407 08.408

Hours / Week

University Exams
Maximum Sessional Marks

Engineering Mathematics III (CMPUNERFHB) Humanities (CRFTAHB) Microcontroller-based Design Object Oriented Techniques (R F) Data Structures and Algorithms (R F) Database Design Data Structures Lab (R F) Object Oriented Programming Lab Total Total Marks

3 3 3 2 2 3 0 0 16

1 0 1 1 2 0 0 0 5

0 0 0 0 0 0 4 4 8

3 3 3 3 3 3 3 3

Maximum Marks 100 100 100 100 100 100 100 100 800


50 50 50 50 50 50 50 50 400 1200

4 3 4 3 4 3 4 4 29


B.Tech Information Technology, University of Kerala

Course Code 08.501 08.502 08.503 08.504 08.505 08.506 08.507 08.508

Hours / Week L 3 3 2 2 3 2 0 0 15 T 1 1 1 1 1 1 0 0 6 D/P 0 0 0 0 0 0 4 4 8

Engineering Mathematics IV (ERFBH) Advanced Mathematics & Queueing Models (RF) Theory of Computation Systems Programming (RF) Operating Systems Data Communication Digital Circuits Lab Database Lab Total Total Marks

Maximum Sessional Marks

University Exams Hours 3 3 3 3 3 3 3 3 Maximum Marks 100 100 100 100 100 100 100 100 800 Credits

50 50 50 50 50 50 50 50 400 1200

4 4 3 3 4 3 4 4 29

Course Code 08.601 08.602 08.603 08.604 08.605 08.606 08.607 08.608

Hours / Week L 3 2 2 3 2 3 0 0 15 T 1 1 1 1 1 1 0 0 6 D/P 0 0 0 0 0 0 4 4 8

Compiler Design (RF) Computer Networks Software Architecture Internet Technology Computer Graphics Embedded Systems Internet Lab Computer Graphics Lab Total Total Marks

Maximum Sessional Marks

University Exams Hours 3 3 3 3 3 3 3 3 Maximum Marks 100 100 100 100 100 100 100 100 800 Credits

50 50 50 50 50 50 50 50 400 1200

4 3 3 4 3 4 4 4 29


704 08.808 Hours / Week L 3 3 2 2 3 3 0 0 16 T 1 0 1 1 1 1 0 0 5 D/P 0 0 0 0 0 0 4 4 8 Subject Mobile Computing E-Commerce E-Security Software Testing Elective III Elective IV Web Applications Lab Project & Viva Voce Total Total Marks Maximum Sessional Marks University Exams Hours 3 3 3 3 3 3 3 3 Maximum Marks 100 100 100 100 100 100 100 100 800 Credits 50 50 50 50 50 50 50 100 450 1250 4 3 3 3 4 4 4 4 29 10 .707 08.801 08.702 08.705 08.703 08.804 08.701 08.708 Hours / Week L 2 3 2 2 3 3 0 0 15 T 1 1 1 1 1 1 0 0 6 D/P 0 0 0 0 0 0 4 4 8 Subject Software Project Management Internetworking Cryptography Web Applications Development Elective I Elective II Computer Networks Lab Seminar / Project Design Total Total Marks Maximum Sessional Marks University Exams Maximum Marks 100 100 100 100 100 100 100 Credits Hours 3 3 3 3 3 3 3 3 50 50 50 50 50 50 50 100 450 1150 3 4 3 3 4 4 4 4 700 29 SEMESTER VIII Course Code 08.803 08.706 08.805 08.Tech Information Technology. University of Kerala SEMESTER VII Course Code 08.B.802 08.807 08.806 08.

805) Advanced Microprocessors Network Programming Graph Theory (Common with 08.806) A B C Soft Computing Distributed Systems Web Services 11 .706) Computer Peripherals and Interfacing Optimization Techniques Data Mining Techniques (Common with 08. University of Kerala A B C D Elective I (08.705) Design and Analysis of Algorithms Simulation and Modelling Principles of Programming Languages Communicative English & Technical Writing (Common with 08.704(3) of CSE) A B C Elective II (08.Tech Information Technology.705(4) of CSE) A B C Elective III (08.B.805(4) of CSE) Elective IV (08.

Divergence.Inverse of a matrix by gauss-Jordan method.Convolution theorem(without proof)-Transforms of unit step function.Transforms of elementary functions .Curvature.signature and index.101 ENGINEERING MATHEMATICS.Euler’s theorem on homogeneous functions. REFERENCES 1.Irrotational and solenoidal fields – Scalar potential. Higher Engineering Mathematics.Echelon form and normal form.V.Errors and approximations. unit impulse function and periodic functions-second shifiting theorem.Reduction to canonical forms-Nature of quadratic formsDefiniteness.Elementary transformations.Radius of curvature. University of Kerala 08.I L-T-P : 2-1-0 Credits: 6 MODULE. Advanced Engineering Mathematics.Transforms of derivatives and integrals.Scalar and vector fields.Cauchy and Legendre equations – Simultaneous linear equations with constant coefficients. Vector differentiation and applications :.Maxima and minima of functions of two variables Lagrange’s method.DiagonalisationQuadratic forms.Leibnitz’ Theorem(without proof).GradientPhysical interpretation of gradient. Higher Engineering Mathematics. MODULE-III Matrices:-Rank of a matrix. Wiley Eastern.Ramana.Solution of ordinary differential equations with constant coefficients using Laplace transforms. Kreyszig. Sureshan J.Partial derivatives. Differential Equations and Applications:. B.differentiation of vector functions-Velocity and acceleration.Operator  .S.Equivalent matrices.Scalar and vector functions. Michel D Greenberg.Consistency.Inverse transforms. 8th edition.rank.Solution of a system linear equations-Non homogeneous and homogeneous equations.Linear differential eqations with constant coefficients.Cayley Hamilton theorem(no proof). Nazarudeen and Royson.Pearson International 6.Total derivatives. Thomson 3. 2. MODULE-II Laplace transforms:.Jacobians.centre of curvature. Peter O’ Neil .Linear dependence and independence of vectors. B.Leibnitz rule on differentiation under integral sign. Zenith Publications 12 .shifting property.Eigen values and eigen vectors – Properties of eigen values and eigen vectors.Identities involving  (no proof) .Taylor’s series (one and two variables) . Advanced Engineering Mathematics. Engineering Mathematics I.Directional derivative. 2006 5.Tech Information Technology.B.1 Applications of differentiation:– Definition of Hyperbolic functions and their derivativesSuccessive differentiation.polar and parametric forms) Partial differentiation and applications:.Evolute ( Cartesian . Khanna Publishers 4.Grewal .Method of variation of parameters .Curl.Transform functions multiplied by t and divided by t .Application to orthogonal trajectories (cartisian form only). Advanced Engineering Mathematics. Tata Mc Graw Hill.

Polarization of Light : Types of polarized light. Fraunhofer diffraction at a single slit. Production and analysis of circularly and elliptically polarized light. Poynting’s theorem (qualitative only) Physics of Solids: Space lattice. Fermi energy. Nano materials. Distribution equations in the three cases (no derivation). Particle in one dimensional box. Deduction of Maxwell’s equations. Energy and momentum operators. Nicol Prism. Concept of displacement current. High temperature superconductors. Type-I and Type-II superconductors. BoseEinstein and Fermi-Dirac statistics. Prediction of electromagnetic waves. Theory of damped harmonic oscillations. Wave function. Uncertainty principle.0 Credits: 6 MODULE-I Oscillations and Waves : Basic ideas of harmonic oscillations – Differential equation of a SHM and its solution. Transverse nature of electromagnetic waves. Miller indices. Time dilation. BCS theory (qualitative). Double refraction. Super conductivity . Theory of plane. Energy in wave motion. Basic postulates of Maxwell-Boltzmann. Relativistic mass. Electromagnetic Theory :Del operator – grad. Plane waves and spherical waves. Length contraction. circular and elliptically polarized light. Crystal systems. Shape memory alloys. Free electrons in a metal as a Fermi gas. Bio materials. Interference in thin films and wedge shaped films. X-ray diffraction. Rayleigh’s criterion for resolution. Polaroids. Interference filters. Einstein’s postulates. University of Kerala 08. Newton’s rings. Theory of forced harmonic oscillations and resonance. Michelson’s interferometer. Resolving power of grating. Bosons and Fermions. Coordination number and packing factor with reference to simple cubic. Types of waves. Photo elasticity – isoclinic and isochromatic fringes – photo elastic bench Special Theory of Relativity: Michelson-Morley experiment. Velocity of transverse waves along a stretched string. 13 . Three dimensional waves . Applications of superconductors. Phase space. Antireflection coating. Resolving power of telescope and microscope.B. One dimensional waves – Differential Equation. Density of states.II Interference of Light: Concept of temporal and spatial coherence. Simultaneity. Time Dependent and Time Independent Schrodinger equations. div. Expectation values. Mass less particle. curl and their physical significance. Interplanar spacing in terms of Miller indices. Lorentz transformation equations (no derivation). MODULE. Statistical Mechanics : Macrostates and Microstates. Introduction to new materials (qualitative) -Metallic glasses. Plane transmission grating. Directions and planes. Velocity addition. Diffraction of Light : Fresnel and Fraunhofer diffraction. E and H are at right angles. Harmonic waves. MODULE – III Quantum Mechanics : Dual nature of matter. Quality factor. body centered cubic and face centered cubic crystals. Determination of wave length and thickness. Mass energy relation.Tech Information Technology. Fraunhofer diffraction at a circular aperture (qualitative).Differential Equation and solution. Eigen values and functions. Grating equation. Retardation plates. Unit cell and lattice parameters. Induced birefringence.Meissner effect.102 ENGINEERING PHYSICS L-T-P : 2-1. Derivation of Planck’s formula. Bragg’s law. Tunnelling (qualitative).

Tech Information Technology. Population inversion and stimulated emission. Introduction to Electrodynamics. Introduction to Special Relativity.A.B. Introduction to Optics. Vivo Books 12. 8. Types of optical fibers. Kollam. Polarization by reflection – Brewster’s law. B. J. Eugene Hecht. University of Kerala Laser: Einstein’s coefficients. Computer stimulation – study of E & H.. New Age International Publishers 7. Introduction to Quantum Mechanics. II Edn. Pearson 3. 4. XI Edn.. Upadhyaya. S O Pillai. 13. ********* 14 . Premlet. 11. IV Edn. Laser – Diffraction at a narrow slit. LIST OF DEMONSTRATION EXPERIMENTS 1. Trivandrum 14. Ruby Laser.. M Ali Omar. Pearson 2. T. A Text Book of Engineering Physics. Chris D Zafiratos & Michael A Dubson. Long answer questions from all the 3 modules will form 60 marks. Computer stimulation – superposition of waves.. Statistical Mechanics. III Edn. Holography. Solid State Physics. Helium-Neon Laser. 2. The question paper will consist of two parts (A and B). Applications. From each module. Mark Ratner& Daniel Ratner. . each of 10 marks.. Michelson’s interferometer – Thickness of thin transparent film. 10. Modern Physics for Scientists and Engineers. This part contains 10 questions without any choice. Spectrometer – Refractive indices of calcite for the ordinary and extraordinary rays. Pearson 9.. Laser – Diffraction at a straight wire or circular aperture. David J Griffiths. Optics. John Willey and Sons 10. each of 4 marks (uniformly taken from all modules). Mechanics. Fiber Optics . The syllabus is spread in 3 modules. in 3 hour duration. . Advanced Engineering Physics . Optical resonant cavity. 9. Prentice Hall of India 8. Sears & Zemansky . John R Taylor. Phasor Books. Michelson’s interferometer – Wavelength of light. Donald A Mcquarrie.Numerical Aperture and acceptance angle.C. Hassan et al. III Edn. Aswathy Publishers. REFERENCE: 1. Newton’s Rings – Determination of wave length. Elementary Solid State Physics. 5. IV Edn. Carbon dioxide Laser (qualitative). Spectrometer – Plane transmission grating – wavelength of light. Robert Resnick . Ram Prasad & Sons 4. Pearson 5. Pearson 6. Frank & Leno. Part A contains short answer questions for 40 marks.. Air Wedge – Diameter of a thin wire 3.. 7. Nanotechnology. 6. Richard L Libboff. Semiconductor Laser (qualitative). Pearson 11. (Gauss’ law & Ampere’s law) Pattern of Question Paper University examination is for a maximum of 100 marks. this part contains 3 questions out of which 2 are to be answered. University Physics.. Part B contains long answer questions for 60 marks.

Galvanic series. oxidation reduction and precipitation titrations). free radical.Types of hardness. Urea formaldehyde resin.Related problems.Reference electrodes.Tech Information Technology.Secondary cells. Injection.Aerobic . Rotational spectra (Determination of bond length and application).Estimation of hardness. properties and uses of PVC.Silicon polymers.Mechanism of polymarisation (Addition. spin-spin splitting) (6hrs) Chromatography. Bakelite.structure of natural rubber.Waste water treatment.Chemical method (reduction)-Properties and Applications of nano materials-Nano tubes-Nano wires. cationic.Helmotz double layer. PVA. electro dialysis. carbonate.Sludge and scales in boilers.Degree of hardness.Chemical conversion coatings.Electrodes.Nickel cadmium cell.Gas chromatography.Factors affecting corrosion (nature of metal and nature of environment) and different methods of corrosion control (corrosion inhibitors. anionic and coordination polymarisation).General principles. (2hrs) Spectroscopy. (5hrs) Protective coatings. Ion exchange methods-Internal treatments (colloidal.Distillation).by EDTA method. Transfer and Extrusion moulding)-Preparation. Vibrational spectra (mechanism of interaction and application).Lead acid cell.paint (4hrs) Nano materials.CFCs and ozone depletionAlternative refrigerents-Green house effect-Water pollution.Lithium-ion cell.Coductometric and Potentiometric titrations (acid base.B.Quinhydron electrode-Determination of PH using these electrodes. Nylon. cathodic protection).Boiler corrosion-Water softening methods.BOD and COD.synthetic rubbers (Buna-S.Saturated calomel electrode. Lime-soda process.Types of corrosion (Concentration cell corrosion. Galvanic corrosion) . Differential thermal analysis and applications.Domestic water treatment. Elastomers. phosphate and calgon conditioning).Standared hydrogen electrode.Origin of electrode potential.Beer Lamberts law.Methods of disinfection of water-Desalination process (Reverse osmosis. University of Kerala 08. (12hrs) Envirnmental damages and prevention. (3hrs) Thermal methods of analysis-Basic principles involved in Thermo gravimetry. (12hrs) Corrosion and its control.Molecular energy levels-Types of molecular spectra. Stress corrosion.Electronic spectra (Classification of electronic transitions.Priming and foaming.Thermoplastics and thermosetting plasticsCompounding of plastics-Moulding techniques of plastics (Compression.Electrode potential. Butyl rubber and Neoprene) (12hrs) 15 .Classifications.Nernst equation and application.Fuel cells.Metallic coatings.Anaerobic and USAB processes. PMMA.Theories of corrosion (chemical corrosion and electrochemical corrosion).High performance liquid chromatography.Introduction-Classification-preparation (laser abrasion technique and sputtering technique).Air pollution.vulcanisation. (4hrs) MODULE-II Water treatment. NMR spectra (Basic principle. chemical shift. PET.103 ENGINEERING CHEMISTRY L-T-T : 2-1-0 Credits: 6 MODULE-1 Electrochemistry . . (2hrs) MODULE-III Polymers.Biodegradable plastics.Concentration cells.

R. Merrit and J. Estimation of chloride ions in domestic water. Dean .L.Properties of lubricants-Viscosity index.K.Calorific value.N Goyal and Harmendra Goeal. 4.Goodby .Glasstone . 6.C. Determination of molarity of HCl solution PH-metrically. A text book of Engineering Chemistry R. Chemistry of liquid crystals S. Gowariker .C. Environmental Chemistry K. 14. Determinations of PH using glass electrode and quinhydron electrode. 6. Estimation of total hardness in water using EDTA. Modern materials V. Gopalan. Material Science and engineering. 5. Preparation of buffers and standardisation of PH meter. Kuriakose and J. A text book of physical chemistry P. Willard. 2. 7.flash and fire point. 12. 4. Engineering Chemistry.HCV and LCV-Experimental determination of calorific valueTheoretical calculation of calorific value by Dulongs formula . Jain. (2hrs) Fuels. A first course L.Introduction-Mechanism of lubrication. 16 .B. Rajaram .A. 12.Gonser .solid and liquid lubricant. D.aniline value. Estimation of iron in a sample of heamatite.Raghavan.W. 13. Chemistry of Engineering and Technology volume I & II 15. polyacetylene and [polypyrrol and its applications. 9. (4hrs) Cement. 2.Manufacture of Portland cement. Engineering Chemistry J. apparatus.A. Thiruvananthapuram 1. 5.Tech Information Technology.Venkappayya & S.R.cloud and pour point. 3. 10. Polymer science B. 10. 8.Theory of setting and hardening of cement (2hrs) LAB-EXPERIMENTS (DEMONSTRATION ONLY) 1.Bio fuels -Bio hydrogen and Bio-diesel (5hrs) Lubricants. 11. Estimation of COD in sewage water. 3. 7.W. Nagarajan . Nanoscale materials in chemistry B. 11.H. Estimation of copper in brass. Instrumental methods of analysis A. Ane Students Edition. Van Vlack . 8. Estimation of dissolved oxygen.Klauhunde.J. 9. Estimation of available chlorine in bleaching powder. Determination of flash and fire point of a lubricating oil by Pensky Marten’s Potentiometric titrations. REFERENCES H. University of Kerala Organo electronic compounds -Super conducting and conducting organic materials like Polyaniline. De . L. Elements of Material science and Engineering J. Engineering Chemistry Juhaina Ahad . Engineering Chemistry Shashi Chawla .

Gill. Gopalakrishnan.N. except from CAD. (1 sheet practice) MODULE I Plain Curves: Conic sections by eccentricity method. P. Isometric view and projections of simple solids like prisms. Anil Kumar. University of Kerala 08. K. frustum of solids and also their combinations. Engineering Drawing 8. inclination with planes of projection and traces of lines. Bhatt . (i) Cylinder and cylinder (ii) Prism and prism. Module -II 2 x 17 = 34 Module III 2 x 17 = 34 Total (32+34+34 =100) REFERENCES 1. pyramids.R. N. perpendicular and inclined cutting planes. cylinder. definition of perspective terminology.C. pyramids. CAD: Introduction to CAD systems. Engineering Graphics 9. lettering. Luzadder and Duff . symbols and drawing instruments. Their projections and true shape of cut sections. Construction of Tangent and Normal at any point on these curves Miscellaneous Curves: Construction of Cycloid. D. abscissa and the transverse axis (iii) given the asymptotes and a point on the curve. Intersection of Surfaces : Intersection of surfaces of two solids as given below. K.Tech Information Technology. (iii) Distribution of marks .S. Engineering Graphics 17 . Selection of Solids: Types of cutting planes. cone sphere. Epicycloid and Hypocycloid. Thamaraselvi. dimensioning. Fundamentals of Engineering Drawing 2.) Perspective Projection : Principles of perspective projection. Demonstration of any one CAD software. Engineering Drawing 7. pyramids. Various Soft wares for CAD.I. General Note: (i) First angle projection to be followed (ii) Question paper shall contain 3 questions from each module. K. (iii) Cone and Cylinder.Module -I 2 x 16 = 32. John. Students are required to answer any two questions from each module. Engineering Drawing and Graphics 4. Construction of parabola (i) Rectangle method (ii) Tangent method. Venugopal . Logarithmic spiral and Helix. octahedron. cylinder. sphere and their auxiliary projections. K. (Only cases where the axes are perpendicular to each other and intersecting with or without offset. Varghese.B. Construction of hyperbola (i) Arc of circles method (ii) given ordinate. cylinder and cone (ii) Cut regular solids. section of simple solids cut by parallel. Archimedian spiral. MODULE III Isometric Projection : Isometric scale. Construction of ellipse: (i) Arc of circles method (ii) Rectangle method (ii) Concentric circles method. Engineering Graphics 6. Principles of Orthographic projection. Projections of points and lines. Involute of a circle.T-D : 1-0-2 CREDITS: 6 Introduction to technical drawing and its language. Construction of Tangent and Normal at any point on these curves Projection of Points and lines: Types of projections. tetrahedron. Benefits of CAD. Perspective projection of simple solids like prisms and pyramids in simple positions. Engineering Drawing 3. MODULE II Projection of Solids: Projection of simple solids such as prisms. Lines. scaling of figures. Engineering Graphics 5. P. cone. Determination of true length.104 ENGINEERING GRAPHICS L. Development of Surfaces: Development of surfaces of (i) simple solids like prisms.

. New Delhi. (5 x 8 = 40) Part B – Three questions of 10 marks from each module. 1966. Relative velocity .cone of friction. solid discs and solid spheres (no derivations required)Angular momentum-Angular impulse.Tech Information Technology. & Sankarasubramanian G.1 – 0 ENGINEERING MECHANICS Credits: 6 MODULE I (20 HRS) Idealizations of Mechanics. “Engineering Mechanics”. Centrifugal and centripetal forces – motion of vehicles on curved paths in horizontal and vertical planes – super elevation – stability of vehicles moving in curved paths (qualitative ideas only). Tata Mc-Graw Hill Publishing Company Limited.Radius of Gyrationmoment of inertia of composite areas. Kumar K. & Young D.Resultant and equilibrant of coplanar non-concurrent force systems. Tata McGraw Hill Publishing Company Limited. Pearson Education.Conditions of equilibrium. Irving.Elements of vector algebra Statics of rigid bodies-Classification of force systems. method of resolution. Delhi. Popov. Simple harmonic motion – vibration of mechanical systems . Shames. New Delhi. Vector approach.L. couple. motion of link. Benjamin J. Friction-Laws of friction-angle of friction. Equilibrium of rigid bodies-free body diagrams. “Engineering Mechanics”.Motion of connected bodies. Power and Energy .Conditions of equilibrium. Parallel and perpendicular axes theorems. wheel rolling without slipping.Motion of lift. REFERENCES: 1. MODULE III (20 HRS) Work. “Engineering Mechanics”.composition and resolution.Resultant and Equilibrant of coplanar concurrent force systems-various analytical methods.centroid of composite areas.105 L-T-P: 2 . “Vector Mechanics for Engineers – Statics and Dynamics”. Collision of elastic bodies-Law of conservation of momentum-Direct and oblique impact between elastic bodies and impact with fixed plane. Rajasekaran S.Varignon’s theorem.wedge friction. Dynamics: Kinematics-Combined motion of translation and rotation-instantaneous centre.basic concepts-analysis of different types of problems Kinetics- Newton’s laws of translatory motion. equations of equilibrium.principle of transmissibility of a force.2004 8. Kollam.Moment of a force.D’Alembert’s principle.basic elements of a vibrating system – spring mass model – undamped free vibrations – angular free vibration – simple pendulum. “Mechanics of Solids”.types of loading.D’Alembert’s principle in curvilinear motion. Kinetics of rigid bodies under combined translatory and rotational motion – work – energy principle for rigid bodies. H. 1998.B.types of beams . Beer & Johnston. 3. “Engineering Mechanics. Umesh Publications. “Engineering Mechanics”. Momentum.Theorems of Pappus-GouldinusMoment of inertia of areas. Timoshenko S.Part A – 8 compulsory questions covering entire syllabus. 6. 2. New Delhi. Forces in space.ladder friction. H.Work-Energy principle-Impulse. properties of couple. Tayal A K... MODULE II (20 HRS) Properties of surfaces.Support reactions of simply supported and overhanging beams under different types of loading.(simple problems) Types of supports .Mass moment of inertia of rings.2007 5. Mc-Graw Hill –International Edition 4. 7.. motion of connecting rod and piston. Prentice Hall Book Company. 2008 Note: Question For University Examination:. University of Kerala 08. Pentex Book Publishers and Distributors. “Engineering Mechanics”. Vikas Publishing House Private Limited. Curvilinear motion.Lami’s theorem. out of which two should be answered (10 x 2 x 3 = 60).. 5 marks each. 2005. 18 . 2003.Statics and Dynamics” .

1 .reduction of level height of collimation method only (simple examples).Components of buildings.Tape correction (problems). escalators and elevators. Contour maps (Brief description only).recording measurements in the field book .desirable qualities of stone and brick.0 Credits: 6 MODULE I Surveying: Object and Principles of Surveying. Isolated footing.Introduction to Distomat. Tilting Level ) Levelling Staff. Combined footing. Foundation: Different types . steel & Aluminium. ramps (brief description only).mosaic tiles. Levelling: Levelling instruments .stone masonry.Spread footing. Super structure: Masonry .Mid ordinate rule. wood and steel surfaces. Measurements in levelling . Mat foundation¸ Pile foundation (description only). Tests on Cement . Doors.Types of paint . Qualities of ingredients (brief description only).Preparation of Cement mortar Painting: Preparation of surfaces for painting . Flooring: Types .wood. emulsion & distemper.Principles of leveling . ceramic tiles. marble.Temporary adjustments of a level. particle boards & glass.consistency. Roofing: Selection of type of roof -flat roof. initial and final setting times. average ordinate rule. AC Sheet. Computation of areas . Linear Measurements: Direct measurements .B. Steel-common types used in construction. 19 . PVC Sheet MODULE III Concrete: Ingredients. Plastering: Mortar – properties .Tape & chain only .Errors . Selection of roof covering materials.brief description of water supply and sewage disposal arrangements for residential buildings.types of buildings . Safe Bearing Capacity of Soil: Importance of determination of the Safe Bearing Capacity of Soil (brief description only). reading the staff .Level (Dumpy Level.Tech Information Technology. Compressive strength -IS Specifications. Total Station & GPS (Brief description only) MODULE II Building construction: Selection of site for buildings . Aggregates – desirable qualities of fine and coarse aggregates Plain Cement Concrete (PCC): preparation-proportioning-mixing of concrete. sloping roof Concrete roof. tiled roof. Partition: Materials used for making partition . GI Sheet .cement. windows & ventilators : Types . aggregate. Plumbing services. Elementary ideas on pre-cast and pre-stressed concrete constructions.plastered. Trapezoidal rule.enamel. Reinforced Cement Concrete (RCC)-advantages of RCC over Plain Cement Concrete. HYSD Steel and their properties. and water. holding the staff.Mild Steel. Simpson’s rule (examples). granite and synthetic materials. brick masonry –Types.Ranging out survey linesTaking measurements of sloping ground .106 BASIC CIVIL ENGINEERING L-T-P: 2. University of Kerala 08.plywood.materials used for the construction of doors and windows . Building services – vertical transportation – stairs – types.

1970 2.C Punmia. Moorthy.“Water Supply and Sanitary Engineering”.N. It contains 8 questions of 5 marks each. “Construction and Technology” 9. Jha and Sinha.Kollam.”Introduction to Civil Engineering”Phasor Books. Rangwala. 1957 8. 2001 4.2004 6. B.Delhi. “Building Construction”. Part I is Compulsory covering the entire syllabus. There will be two questions (20 marks each) from each module out of which one from each module is to be answered.. “Fundamentals of Surveying” Prentice-Hall of India. 1990 7.B. Rangwala. Vertical Transportation for Buildings.Charotar publishing house. University of Kerala REFERENCE: 1. Charotar Publishing House. New York. Building Materials... Part II is to cover 3 modules. Rangwala. Narayanan and Lalu Mangal . Modern Publishing House distributor. 2004 3. Roy. “Basic Civil Engineering” Karunya Publications. for 40 marks. S. – I.Tech Information Technology.. Adler R. Santha Minu. “Building Construction” .K. “Surveying & Leveling” Vol. 10.Trivandrum Note: The question paper will consists of two parts. Laxmi publications(P) Ltd. New Delhi. Part I and part II. 2004 5.. Charotar Publishing House. (20 X 3 = 60) 20 . American Elsevier Publishing Company..

Roy and Choudhary. thread cutting. Manufacturing processes: Elementary ideas of casting. Part I is to be compulsory for 40 marks. 21 . “Automobile Engineering” 5. First law.general description of various systems using block diagrams – air system. “Fluid mechanics and machines” 8. Crouse. milling (simple sketches and short notes).B. Hajra Choudhary. Gill. Amstead. R K Bensal. welding. Non conventional machining . shaping. blower. taper turning. Comfort and Industrial air conditioning-typical window air conditioning unit (general description only). rolling. Otto and Diesel cycles-Air standard efficiency (simple problems) IC Engines: Working and comparison of two stroke and four stroke petrol and diesel engines . A brief description of CRDI. MPFI. Benson boilerfluidized bed combustion. Smith and Zuirys.Tech Information Technology. University of Kerala 08. Part II is to cover 3 modules. CFC free refrigerants. grinding. thermal and nuclear power plants Refrigeration & Air Conditioning: Refrigerants. rope and gear drives-types.reciprocating. “Elements of Mechanical Engineering” 6. Spalding and Cole. ignition system and governing system. drilling.compressors . steam and hydraulic turbines. p-v and T-s diagrams Air cycles: Carnot. forging.turning. There can be 3 questions from each module (10 marks each) out of which 2 are to be answered. MODULE III Mechanical Power transmission systems: Belt. J Benjamin. “Fundamentals of IC Engines” 3. “Engineering Thermodynamics” 2. comparison and fields of application-velocity ratio-slip (simple problems) friction disc. MODULE II Principles and fields of application of . fuel system. “Workshop Technology” 7.concept of reversibility and entropy.impulse and reaction. pumps. Second law of thermodynamics. “Basic Mechanical Engineering” Note: Lectures are to be supplemented by demonstration in laboratories.107 BASIC MECHANICAL ENGINEERING L-T-P/D : 3-1-0 Credits: 6 MODULE I Thermodynamics : Basic concepts and definitions of Zeroth law. centrifugal and jet pumps. This may contain 10 questions of 4 marks each.Electro discharge machining (EDM) and Electro chemical machining (ECM) Principle. soldering and brazing Machining processes. Vapor compression refrigeration system. gear trains (no derivations). gas turbine cycles.open and closed Elementary ideas of hydro electric. single plate clutch. application and advantages of C N C machine REFERENCES 1.reciprocating and centrifugal. The question paper will consist of two parts. “Manufacturing processes” 4. GDI and Hybrid Vehicles Steam boilers: Classification – Cochran boiler. Babcock and Wilcox boiler. Ostwald and Begeman.

form factor.hydroelectric.active and reactive components. University of Kerala 08. final equations of Vrms. ELCBs and switches.typical electrical power transmission scheme . thermistor.star and delta connection . Block schematic of layout of generating stations .Kirchoffs laws . principle of Photo diode.PN junction diodes. Rectifiers & power supplies .rectangular polar and exponential forms. RC and RLC series circuits.j notation . Working of simple zener voltage regulator. Vdc. Measurement of power in three phase circuits ( two wattmeter method). principle of working of series inductor and shunt capacitor filters.108 BASIC ELECTRICAL AND ELECTRONICS ENGINEERING L-T-P : 2–1-0 Credits 6 MODULE – I Elementary concepts . wind.EMF equation . tidal. Three phase systems . Lenz's law . Alternating current fundamentals . LVDT 22 . field strength. MODULE – II Transformers . dynamic & static resistance.period . Primary and secondary transmission and distribution systems Different methods of wiring for LT installations.need for high transmission voltage . thermal and nuclear power plants.statically induced and dynamically induced emf self and mutual induction .plate and pipe earthing. Renewable energy sources . Bulk transmission of electric power .substation equipments. Power devices – V – I characteristics and applications of SCR and Triac Working principle of UPS and SMPS Transducers – Resistance strain guage. -fluorescent lamps.inductance.Tech Information Technology.solar.Magnetic Circuits .three wire and four wire systems. flux density.necessity of earthing .block diagram description of a dc power supply. Phasor representation of alternating quantities . Measurement of energy – working of 1-phase energy meter. Protective fuses. ripple factor and peak inverse voltage in each case. Analysis of simple ac circuits – concept of impedance and admittance .phasor representation .MMF..Faradays laws. principle of working and V-I characteristics of Zener diode. V-I characteristics. MCBs. Working of incandescent lamps. wave and geothermal energy.generation of alternating currents – waveforms frequency .phasor representation . Earthing of installations .Principle of operation .constructional details of single phase and three phase transformers Methods of bulk generation of electric power. Solar cell.power and power factor in ac circuits . & LED. reluctance – problems in series magnetic circuits. Review of electromagnetic induction .average and rms values . circuit diagram & working of half-wave & full wave rectifier.relation between phase and line values of voltage and current . Solution of RL.B. Schematic layout of LT switchboards.generation of three phase voltage .substations . energy efficient lamps MODULE – III Diodes .

.. “Theory and Problems of Basic Electrical Engineering”. Rajath Publishers. Millman and Halkias. Mitlle. 12. New Delhi 1997 10. 3. “A Basic Course in Electrical Engineering”. S Chand & Co. Part-B is to cover 3 modules for 60 marks.S. Tata McGraw Hill. “Basic Electronics and Linear Circuits”. “Electrical and Electronic Technology”. and Mani V. “Basic Electrical Engineering”.N. 2000. Dhanpath Rai & Sons. 4. Asia 2003. Tata McGraw Hill. 5. LJ Nagrath. “Introduction To Electronics and Communications”. B. 2002. Sarma G. Premlet. "Integrated Electronics: Analog and digital circuits and systems". Pearson education. Volume I. Rangan C.R. Edward Hughes. TP Imthias Ahmed. DP Kothari.Bhargava. “Introduction to Electrical Engineering”.One out of two or two out of four from each module). “Power Electronic Circuits. Devices and Applications”. Phaser Books. 23 . Kollam 7. 1992.. N.Phasor Books. “A Text Book on Power System Engineering”. Kollam 6.. Part – A is to be compulsory for 40 marks (10 questions of 4 marks each). 1990. (50% choice. New Delhi. "Instrumentation Devices and Systems". B. Note : The question paper will consist of two parts. Tata McGraw Hill 11. University of Kerala REFERENCES 1. Thereja. Ernakulam. V. Pearson Education. PU Guptha.S.V. Muhammad H.N. 9.Tech Information Technology. Prentice Hall of India. 2.B. ML Soni. Rashid. “A Text Book of Electrical Technology”. Gopakumar.L. Francis M Fernandez. McGraw-Hill Book Co 8. US Bhatnagar and A Chakrabarthy. 1992.

AB and Class C power amplifiers. principle of digital storage oscilloscope. common emitter & common collector configurations. wafer preparation. (4 hrs) (e) Satellite communication: microwave frequency bands. concepts of common base. advantages of optical communication. current gain of each.APD). comparison of AM & FM. bandwidths. block diagram of CRO. typical doping.B. basic principles of HDTV. wave forms. voltage gain and 3dB bandwidth. satellite transponder. (4 hrs) (e) Digital ICs:logic gates.use as inverting amplifier. concept of geo-stationary satellite. (4 hrs) MODULE II(Qualitative Treatment) (a) Measurements: principle and block diagram of analog and digital multimeter. advantages of satellite communication. block diagram of earth station transmitter & receiver. principle of light transmission through fiber. (3 hrs) (c) Amplifiers & Oscillators: circuit diagram & working of common emitter amplifier. functional block diagram of operational amplifier.principle &block diagram of super heterodyne receiver. principle and block diagram of function generator. input & output characteristics of common emitter configuration. basic principles of LCD & Plasma displays. unit process: oxidation. need of proper biasing. working principle of CRT. University of Kerala 08. non inverting amplifier. circuit diagram & working of RC phase shift oscillator (7 hrs) (d) Integrated circuits: advantages of ICs. flip flop (JK). applications of radar in measurements and navigation.109 BASIC COMMUNICATION AND INFORMATION ENGINEERING L – T – P: 2-1-0 Credits: 6 MODULE I (Qualitative Treatment) (a) Bipolar junction transistors: NPN & PNP transistors. working of NPN transistor. deposition. realization of logic functions. B. block diagram of PAL TV transmitter & receiver. comparison of three configurations with reference to voltage & current gain. concepts of Single Mode and Multi Mode optical fiber. (6 hrs) (b) Field effect Transistors : basic principles of JFET. CCTV system. principle of AM &FM demodulation. analog and digital ICs.interlaced scanning. comparison with BJT. principle of Global Positioning System (GPS). crystal growth. block schematics of pulsed radar. working principle of source (semiconductor Laser) & detector ( PIN. factors affecting range. MESFET and MOSFET. block diagrams of AM & FM transmitters. epitaxy. principle of combinational and sequential logic circuits. ideal operational amplifier. function of each component in the circuit. summing amplifier. concepts of feedback. (5 hrs) (d) Radar and navigation: principle of radar and radar equation. (3 hrs) (f) Optical communication: block diagram of the optical communication system.Tech Information Technology. structure. (4 hrs) (c) Color television: TV Standards. diffusion. (5 hrs) 24 . working principles of oscillators. concepts of class A. circuit diagram & working of push pull amplifiers. (5hrs) (b) Radio communication: principle of AM & FM. frequency response. ion implantation. integrator and comparator. photolithography. basic principles of cableTV. frequency bands used. measurements using CRO. input & output resistances and applications. logic families: TTL and CMOS Logic (No internal diagram) (4 hrs) (f) IC fabrication: purification of silicon.

2008. internetworking concepts. Santiram Kal. 3rd edition. IP addresses.Moris Mano.ASK.R. There shall be 3 questions from each module (10 marks each) out of which 2 are to be answered. transmission media. Part II is to cover 3 modules. Neil H E Weste.Phasor Publisher’s. Monochrome and Colour Television. Wireless Communications and Networks. FSK. R. Computer Architecture. Gulati. network interface unit . (4hrs) (d) Internet Technology: concepts of networking: client . communication protocols.S C Gupta. Circuits and IT fundamentals. (7 hrs) REFERENCES 1. concepts of cells.E. Pearson Education.functional block diagram of 8085 (9 hrs) (b) Data communication: overview. network devices.WAN &World wide web. Electronic Instrumentation and Measurements.[Module 2(a)] 7. TMH 3. memory hierarchy. LAN. Part I is to cover the entire syllabus. PHI 5. This shall contain 10 compulsory questions of 4 marks each. Introduction to web languages-HTML .B. 5th edition. ITL Education Solution Ltd. analog and digital data transmission.Firewall. Pearson Education [Module 1(f)] 6.server computing. switching technologies. David A. Introduction to Electronics & Communication . parity checking. TMH 8. PSK. Louis. frequency reuse. digital modulation techniques. N N Bhargava. basic concepts of error detection . virtual memory. (6hrs) (c) Mobile communication: basic principles of cellular communications.MAN. of Electronics and Communication in the Colleges. New Age International [Module 2 (c)] 10. 4. M. Principles of CMOS VLSI design – A system perspective.Frenzel. William Stallings.Kollam This subject shall be handled by faculty of Dept. network security.Tech Information Technology. domain names. operating systems. microprocessors . K Gopakumar. Introduction to Information Technology. WLL & GPRS technologies. PHI . 25 . switch.modem. Basic Electronics & Linear Circuits. University of Kerala MODULE III (Qualitative Treatment) (a) Computer Architecture: functional units: basic concept of ALU.data path and control.XML. and carries 60 marks.TCP/IP. PCM . main memory.. Pearson Education. PHI 2. bridge. caches.basic principles of router. Basic Electronics – Devices. network topologies.circuit switching and packet switching. digitization of wave forms. Bell. principle and block diagram of GSM.principle of CDMA. Principles of Electronic Communication Systems. and carries 40 marks.Kamran Eshraghian. Question Paper The question paper shall consist of two parts. 2008 9.D C Kulshreshtha.

26 . Straight line practices. Dove tail joint. T joint and Lap joint. T bolt and Eye bolt. B. Fitting: Study of tools. Welding: Study of welding machines. marking and sawing. Carpentry: Study of tools and joints. University of Kerala 08. B. G: Smithy: Study of tools. NOTE: For the university examination the student shall be examined in sections A. E: Foundry: Study of tools. chiseling. drilling and tapping. C: Sheet Metal Work: Study of tools. Practice on riveted joints. moulding practice and demonstration of casting. H: Machine Tools: Study and demonstration on working of machine tools. Details of plumbing work in domestic and industrial applications. Demonstration on forging of square prism. D. trays and containers. Lathe and Drilling machine. T joint. Study of pipe joints. hexagonal bolt. Selection of different gauge GI sheets for jobs. Male and female joints. D and E only.110 ENGINEERING WORKSHOPS L . Use of special tools in plumbing work. Joints – Cross joint.T-P: 0-0-2 CREDITS: 4 A.B. F. cutting.Tech Information Technology. Practice in planning. Plumbing: Study of tools. Stepped joints. frustums. Making of Butt joint. C. threading and laying of pipes with different fittings using PVC pipes. Preparation of sand. Preparing tube joints. Practice in filing. cutting.

University of Kerala Information Technology Third Semester . PART B Descriptive/Analytical/Problem solving questions 3 x 20 marks=60 marks Candidates have to answer one question out of two or two questions out of four from each module.Eighth Semester University Examination Pattern (for all theory subjects.Tech Information Technology. There should be at least three questions from each module.B. unless otherwise specified) PART A Short answer questions 10 x 4 marks=40 marks All questions are compulsory. Total Marks: 100 27 .

V. Volume of solids. Wiley Eastern. S. Area enclosed by plane curves. 5. Thomson Publications. Grewal. Solution of Lagranges linear equation. First order nonlinear equations – standard forms – Homogeneous PDE with constant coefficients. properties.B.301 L-T-P : 3-1-0 ENGINEERING MATHEMATICS II (C M P U N E R F T A H B) Credits: 4 MODULE I (16 hours) Multiple Integrals: Double Integrals (Cartesian only). Ramana. inverse Fourier transforms. Higher Engineering Mathematics – B. MODULE II (18 hours) Fourier Series: Fourier series of periodic functions of period 2 and 2l. Khanna Publishers. Advanced Engineering Mathematics. Boundary value problems in one-dimensional Wave and Heat equations. Vector Integration: Line and surface and volume integrals. MODULE III (18 hours) Partial differential equations: Formation of PDE. Odd and even functions. – Kreyszig. Triple integrals. Tata Mc Graw Hill. Fourier Transforms: Fourier integral theorem (no proof) – Fourier transforms – Fourier sine and cosine transforms. Green’s theorem in the plane. Advanced Engineering Mathematics – Peter O Neil. Pearson Education 28 .Tech Information Technology. Change of order of integration. Solution by separation of variables. 8th Edn. 3. University of Kerala SEMESTER III 08. Application of PDE: Derivation of one-dimensional Wave and Heat equations. Dirichlet’s condition for convergence. Higher Engineering Mathematics – B. Advanced Engineering Mathematics – Michael D. Reference Books 1. 4. Half range expansions. 2. Greenberg. Stoke’s theorem and Gauss’ divergence theorem (no proof).

4. Forouzan and R. 29 . Memory allocation functions. Data files – formatted.B.F. Documentation of programs – debugging of programs. Schaum’s Series. Preprocessor directives – header files – data types and qualifiers – operators and expressions – enumerations – data input and output – control statements – arrays and strings – structures and unions – working with bits in C – storage classes. MODULE II ( 20 hours) Important C concepts. MODULE III (17 hours) Pointers – arrays of pointers – structures and pointers. Example programs. Pearson/Addison Wesley 5. University of Kerala 08. Programming Techniques through C – M. The C Programming language – Keringhan B. Text Books: 1. Programming with C – B.. Pearson Education India.A. PHI 2. Pohl.W. Kelly and I. Programming with ANSI and Turbo C – Ashok N. and linear and binary search. Problem Solving and Program Design in C – J. Gilberg. 2. A Book on C – A. Venkateshmurthy. Introduction to programming languages – types of programming languages – high level languages – assembly language – machine language. Problem solving concepts – flow charts and algorithms – problem definition phase – general problem solving strategies – top-down design – breaking a problem into sub problems – choice of a suitable data structure. PHI 1990. A structured Programming Approach Using C – B. and Ritche D.Tech Information Technology. Thomson Learning. Gottfried. Pearson Education India 3.M. Koffman.302 L-T-P : 2-2-0 PROBLEM SOLVING AND PROGRAMMING IN C Credits: 4 MODULE I (15 hours) Introduction to digital computer – Von Neumann concept – hypothetical decimal computer – functional units of a computer – storage – primary storage – secondary storage. 3.B. Function – function definition – function prototypes – function call by value and call by reference – recursive functions. selection sort. Command line arguments. Computer Programming in C – V. Rajaraman.S.R. Example programs including bubble sort. Pearson Education.G. PHI Reference Books: 1. 4. Kamthane. TMH. Rajaraman. Hanly and E. unformatted and text files. Fundamentals of computers – V. Low level programming in C.

subalgebra. equivalence of formulas. tautology. pointers and linked allocation. TMH 2. 4. University of Kerala 08. conditional. direct product and homomorphism. Cambridge University Press. reachability and connectedness (No theorems and proofs). Functions : one to one. Modern algebra – Herstein. Prentice Hall. Sanguine Technical Publishers Reference Books: 1. Ganguly. Liu.morphism. integral domain.H Rosen. inverse functions.P. product algebra and factor algebra. equivalence relations. formulas with distinct truth tables. cyclic groups.B. Boolean functions. Relations and ordering : relations – properties of binary relations in a set. two state devices and statement logic.C. normal subgroups. biconditional. Pigeon hole principle. compatibility relations. sub lattices. groups – abelian groups. 1988. 3. cyclic semi groups and monoids. Partial ordering. predicate formulas. MODULE III (14 hours) Algebraic structures : simple algebraic systems and general properties. composition of binary relations. Discrete mathematics with applications – Koshy. tautological implications. lattices as algebraic systems. Manohar. Theory of inference for statement calculus. cosets and Lagrange's theorem. subsemigroups and submonoids. onto. error detection and correction using group codes. Ramana. rules of inference. subgroups and homomorphism. contradiction. Elements of discrete mathematics . binary and n-ary operations. MODULE II (14 hours) Set Theory: basic concepts of set theory. consistency of premises and indirect method of proof. Pearson Education. TMH 2.Tech Information Technology. Cantor's theorem of power sets. Algebraic systems with two binary operations – ring.. natural numbers – Peano Axioms and Mathematical induction. direct product and homomorphism. Discrete mathematical structures with applications to computer science – J. semigroups & monoids . Discrete mathematical structures for computer science – Kolman B. Representation of discrete structures: data structures. validity using truth tables. bijection. Discrete and combinatorial mathematics-an applied introduction – R. Lattices as partially ordered sets. Predicate calculus: predicates. Cardinality – countable and uncountable sets. relation matrix and graph of a relation. Recursion – recursion in programming languages. Discrete mathematics and its applications with combinatorics and graph theory – K. statement functions. free and bound variables. statement formulas. 3. connectives. Partition and covering of a set. paths. field. Boolean algebra. properties of lattices. functionally complete set of connectives. permutation groups. Algorithmic graph theory – Gibbons. McGraw-Hill 5. morphism. sequential allocation. theory of inference for predicate calculus. Basic concepts of graph theory basic definitions of graphs. Elsevier. 4.303 L-T-P: 2 – 1 – 0 DISCRETE STRUCTURES (R F) Credits: 3 MODULE I (11 hours) Statement calculus: Statements. subalgebra. Grimaldi and B. Tremblay and R. Partially ordered set -representation. storage structures. 30 . variables and quantifiers.P. congruence relation.L. composition of functions. well formed formulas. Text Books: 1. truth tables.V. duality law. Discrete mathematical structures – J. universe of discourse.

. Applications. Electronic Devices and Circuits Theory – Boylestead and Nashelky. Regulators. University of Kerala 08. characteristic features of OP Amps.Wein Bridge and Phase shift Oscillators Text Books: 1. Hartely oscillator( No derivations). Pearson Education Reference Books: 1.principle of operation of inverters. Block diagram. uninterrupted power supplies. IntegratorsRC circuits-response of high pass / low pass RC to sine wave. Clampers. pulse and square wave inputs. Band Pass and Band rejection filters. Electronic Circuits – R.Tech Information Technology.classification – small signal analysis – voltage divider bias – emitter follower configuration.555 timer and applications ( No derivations) MODULE III (14 hours) Operational Amplifiers. wein bridge.summing amplifier.feed back configurations.D.monostable. High pass Butterworth Filter. bistable and astable. Chebyshev and Butterworth filters. Low pass Butterworth Filter. ideal OP Amps. Multivibrators. Differentiators.RC phase shift. differential amplifier. Active filters. common mode and difference mode. PHI 2. switched mode power supplies MODULE II (13 hours) Transistor amplifiers. Op-amp and Linear Integrated Circuits – Gayakwad. Sanguine Technical Publishers 31 .304 L-T-P: 2 – 1 – 0 ELECTRONIC CIRCUITS (R F) Credits: 3 MODULE I (12 hours) Design and analysis of Rectifiers. Clippers. Oscillators. 4th Edn. Colpitts. Filters. non inverting amplifiers. inverting. Sudhaker Samuel and V Nattarsu.B.

magnitude comparator.Tech Information Technology.L. Yarbrough. Digital Electronics-an Introduction to Theory and Practice – W.M. Text Books: 1. Design of combinational logic circuits – adder. Gothman. Analysis and design of clocked sequential circuits – state diagram – state reduction and assignment – design with state equations – shift registers – universal shift registers – serial adder – design of synchronous and asynchronous counters – timing Sequences. subtractor. MODULE III (18 hours) Sequential logic circuits – flip flops – RS. multiplication and division of floating point numbers (no algorithms). An Introduction to Digital Computer Design – V. MODULE II (18 hours) Postulates of Boolean algebra – logic functions – logic gates – methods of minimization of logic functions – Karnaugh map method and tabulation method – realization using logic gates. 5th Edn. 32 . subtraction. subtraction. University of Kerala 08. Rajaraman and T. Addition and subtraction of BCD. Thomson Learning. JK. Digital Design – M. parallel adder. 2. Morris Mano. Jain. Octal and Hexadecimal numbers.M.P. PHI. code converter. Floyd and R. Morgan Kaufmann Publishers. 3. TMH. multilevel carry look ahead adder. Harris. demultiplexer. Basics of Hardware Description language (HDL). 3. Reference Books: 1. D and T type – master slave flip flop. Pearson Education. decoder. Digital Fundamentals – T. multiplication and division of binary numbers (no algorithms).. BCD adder. Representation of floating point numbers – precision – addition. multiplexer. Pearson Education. Radhakrishnan. 4. Digital Electronics Principles and Applications – Tokheim. Digital Logic Applications and Design – J. Digital Design and Computer Architecture – D. parity generator – design examples. PHI.B. carry look ahead adder.H. Octal and Hexadecimal – conversion from one system to another – representation of negative numbers – representation of BCD numbers – character representation – character coding schemes – ASCII – EBCDIC etc. 2. Addition.L. Introduction to Programmable Logic Devices (PLDs). Harris and S. Binary.305 L-T-P:2 – 2 – 0 DIGITAL SYSTEM DESIGN (R F) Credits: 4 MODULE I (16 hours) Number systems – Decimal.

Zaky. Mc Graw Hill Publishing Company. Computer Organization – C. 2. Morgan Kauffmann Publishers. MODULE III (15 hours) Memory system – basic concepts – semiconductor RAMs – memory system considerations – semiconductor ROMs – flash memory – cache memory – interleaving – basic concepts of virtual memory. Mac Even. 4. segmentation and paging – associative memory. Hamacher. Computer peripherals – input devices – output devices. 5. 33 . Patterson and J. 3. Z. University of Kerala 08. Computer Organization and Design – D. RAID. Computer Organization – C. 2. Vranesic and S. SCSI. Pearson Education. Z.306 L-T-P: 2 – 1 – 0 COMPUTER ORGANIZATION (R F) Credits: 3 MODULE I (10 hours) Basic Structure of computers – functional units – basic operational concepts – bus structures – software. Zaky.Tech Information Technology.B. Mc Graw Hill. Hamacher.A. Upgrading and Repairing PCs – Scottmuller. Mc Graw Hill International Student Edition. Memory locations and addresses – memory operations – instructions and instruction sequencing – addressing modes – assembly language – PDP-11 addressing modes and instructions – basic I/O operations – stacks and queues – subroutines. Introduction to Computer Systems using PDP – 11 and Pascal – Glenn H. USB). Prentice Hall of India Pvt.P. Chaudhuri. Vranesic and S. Computer Organization and Design – P.L Hennessey. Gear. Computer Organization Programming – C. (for PDP-11addressing modes and instructions).W. Text Books: 1. MODULE II (14 hours) Basic processing unit – fundamental concepts – execution of a complete instruction – multiple-bus organization – sequencing of control signals. Messmer 6. 2nd Edn. I/O organization – accessing of I/O devices – interrupts – direct memory access – buses – interface circuits – standard I/O interfaces (PCI. The indispensable PC Hardware Book – H. Mc Graw Hill Publishing Company. Ltd. Reference Books: 1.

3. 4.B. Simple zener diode regulator. Astable and Monostable multivibraors using 741 OPAMP. 7. RC lowpass and highpass circuits. University of Kerala 08. RC phase shift oscillator using BJT.Tech Information Technology. 10. zener diode. 9. ELECTRONIC CIRCUITS LAB (R F) Credits: 4 Characteristics of diode. 6. Astable and Monostable multivibrators using 555 Timer IC. 34 . 5. RC coupled amplifier using BJT. CE characteristics of BJT. 12. Differentiating and Integrating circuits. 8. 2. 11.307 L-T-P: 0 – 0 – 4 1. Clipping and Clamping circuits. CS characteristics of FET. Rectifier circuits with and without filters.

308 L-T-P: 0 – 0 – 4 PROGRAMMING LAB (R F) Credits: 4 Familiarization of operating systems like DOS and Windows. arguments & return values nesting of functions recursive functions passing arrays and strings to functions Structures and unions copying and comparing structure variables arrays of structures arrays within structures structures with in structures structures and functions unions Pointers pointers and arrays pointers and character strings array of pointers pointers and functions pointers and structures Files. do. memory allocation. opening/closing. two-dimensional.B. branching and looping if.Tech Information Technology. The programming exercises include: Decision making. if … else statements switch. Programming exercises in C based on the course 08. goto statements while. for statements Arrays and strings one-dimensional. input-output operations command line arguments memory allocation functions bit-wise operators 35 . bit-level programming files  defining. multidimensional arrays reading/writing strings operations on strings string handling Functions user defined functions function calls. University of Kerala 03.302 Problem Solving and Programming in C.

Numerical Methods with Programming – C. continuity and differentiation of complex functions. Higher Engineering Mathematics – B. Bilinear MODULE II (17 hours) Complex Integration: Line integral – Cauchy’s integral theorem – Cauchy’s integral formula. Wiley Eastern.401 L-T-P: 3 – 1 – 0 ENGINEERING MATHEMATICS III (C M P U N E R F H B) Credits: 4 MODULE I (17 hours) Complex Differentiation: Limits. Veerarajan and T. Grewal. V. Power series – radius of convergence – Taylors and Laurents series – zeros and singularities – residues and residue theorem. 2. Regula false method. Evaluation of real definite integrals – with no poles of f ( z ) on the real axis (proof of theorems not required). Euler’s method. Analytic functions – Cauchy Reimann equations in Cartesian form (proof of necessary part only). – Kreyszig. Khanna Publishers. MODULE III (18 hours) Numerical Techniques: Errors in numerical computation – solution of algebraic and transcendental equations by bisection method. Greenberg. Ramachandran 7. S. Introductory Methods of Numerical Analysis – S. Advanced Engineering Mathematics – Michael D. Solution of linear systems by Gauss elimination and Gauss-Seidal method. Conformal mapping: the transformation. . Advanced Engineering Mathematics. Reference Books 1. w  z  1z . 5. 6. w  z2 .S. Runge Kutta methods (derivation of formulae not required for the above methods). Newton-Raphson method. Milne Thomson method. Numerical integration. Ramana. Pearson Education 4. Numerical solution of ODE Taylor series method. Sastry 36 . Newtons forward and backward interpolation formula.Tech Information Technology. Lagranges interpolation formula. 8th Edn. University of Kerala SEMESTER IV 08. transformations w  1z . 3. Tata Mc Graw Hill.T. Advanced Engineering Mathematics – Peter O Neil. Higher Engineering Mathematics – B. Trapezoidal and Simpson’s rule. Thomson Publications.B. Properties of analytic functions – harmonic functions.

Business Environment in India – Mohinder Kumar Sharma.Tech Information Technology. 5.Balance sheet (with simple problems) . International Trade and Public Finance – D.B.Least cost combination of inputs – Cost concepts – Cost output relationship. Part II – Accountancy (1 Period per week) MODULE III(13 hours) Book. House. Meaning of Demand and Supply – Types of demand – Determinants of Demand – Demand forecasting Production function – Law of Variable proportion – Returns to scale . New Delhi.Introduction to Accounting packages (Description only) Reference Books: Part I 1. Himalaya Pub. Banking.M. 2nd Edition – Koutsiannis.P.K Dewett 2.Method of Balancing accountsthe journal proper (simple problems). Stock Market and present scenario – Industrial sector past and present – Industry Analysis – Electronics – Chemical – Automobile – FMCG Industry. University of Kerala 08. Modern Economic theory – K.M Sundaran. Addison Wesley Longman Ltd.Keeping-rules for journalising Ledger accounts –Cash book-Banking transactions – Trial Balance. Varian. 6. 4. 7. 3. Indian Economy – Rudder Dutt and K. Part II 37 .402 HUMANITIES (C R F T A H B) L-T-P: 3 – 0 – 0 Part I – Economics (2 Periods per week) Credits:3 MODULE I(13 hours) Definition of Economics – Basic Concepts Goods – Choice of techniques – Production possibility curve National Income concepts . Intermediate Micro Economics – Hal R.Keeping and Accountancy -Elements of Double Entry -Book. Money. Final accounts: Preparation of trading and profit and loss Account. Environment and Development – Basic Issues – Sustainable Development and Environmental Accounting – Population – Resources and the Environment – Poverty and the Environment – Growth versus the Environment – The Global Environment. Mithani. Tertiary Sector – Significance of Money. Micro Economics. MODULE II(13 hours) Inflation – causes of inflation – measures to control inflation – Demand – Pull inflation – cost push inflation – effects of Inflation – effects of inflations comparison between inflation and deflation. Economic Development – Michael Todaro. India’s Economic crisis in 1991 – New economic policy – Global Financial meltdown in 2008 – Applicability of Keynesian Theory to UDC’S.GNP – GDP – NNP – Per Capita Income – Three Sectors of the Economy – Primary – Secondary.

PART B: Descriptive/Analytical/Problem solving questions Candidates have to answer one question out of two or two questions out of four from each module. University of Kerala Internal Continuous Assessment (Maximum Marks-50) Marks shall be awarded for Part I and Par II in the ratio 70:30.B.Tests (minimum 2) 15 Marks . 2 x 15 marks = 30 marks Maximum Total Marks: 100 2 x 20 marks = 40 marks 10 x 3 marks = 30 marks 38 .Tech Information Technology.Assignments (minimum 3) such as home work. problem solving. Part – I PART A: Economics Short answer questions All questions are compulsory. respectively 25 Marks . etc. Part II Accountancy Descriptive/Analytical/Problem solving questions Candidates have to answer two questions out of three questions. seminar.Regularity in the class University Examination Pattern Part I and Part II to be answered in separate answer books. 10 Marks . literature survey. programming exercises. term-project. There should be at least four questions from each module and not more than six questions from any module.

ADC. 3/e . ARM System Developer’s Guide. C programming in 8051. Andrew N Sloss. Thomson Publishing . addressing modes.403 L-T-P: 3 – 1 – 0 MICROCONTROLLER-BASED DESIGN Credits:4 MODULE I (18 hours) Introduction to microcontrollers – general architecture of microcontrollers and microprocessors. MODULE II (17 hours) Programming 8051 timer/counter in assembly language and C. Design With PIC Microcontrollers. Overview of the 8051 family – 8051 architecture – memory organisation.Tech Information Technology. registers and I/O ports. Pearson Education. Concept of Embedded Systems – embedded software and hardware development tools. 4. Computers as Components: Principles of Embedded Computing System Design. 3. John B. 2002. 2. The 8051 Microcontroller and Embedded Systems.B. instruction sets and assembly language programming. LCD. An Embedded Software Primer. 2005. New Delhi. Serial communication using 8051 – interfacing with RS232. Elsevier. Wayne Wolf. Introduction to PIC microcontrollers and ARM processors. Pearson Education. Simon. Elsevier 2005. Kenneth Ayala. 8051 Interrupts – handling and programming. Peatman. The 8051 Microcontroller. David E. MODULE I (17 hours) 8051 interfacing – keyboard. 5. Dominic Symes and Chris Wright. embedded processors. University of Kerala 08. 2006. David Seal. 2. Text Books: 1. Reference Books: 1. serial port programming. DAC and stepper motor interface – interfacing to external memory. Muhammad Ali Mazidi. Pearson Education. ARM Architecture Reference Manual. 39 .

C++ enhancements to C: Default Function Arguments. Hubbard. Schaum’s outline of programming with C++ – J. – D. 2. overloaded functions. Operator overloading: Overloading unary operator. class members. finding relationship between classes. A first look at C++: Using streams for input and output.R. data conversion. Thomson Publications Reference Books: 1. “const” objects and member function. File processing – formatted – unformatted and random files. overriding member functions. Representing classes and attributes using UML. creation and destruction of objects.S. classes. Schildt. Universities Press (India) 5. Mehta. references as return values. MODULE III (16 hours) Inheritance and polymorphism: Derived class and base class. classes within classes. Microsoft foundation classes : Strings. data structure.404 L-T-P: 2 – 1 – 0 OBJECT ORIENTED TECHNIQUES (R F) Credits:3 MODULE I (10 hours) Fundamentals of object-oriented design: Data Abstraction. Fundamentals of data structures in C++ – E. Arranging classes into hierarchies: A design example. array of class objects. University of Kerala 08. S. Tata McGraw Hill. Malik. 4th impression 2008 – Meilir P. virtual functions. Encapsulation.Tech Information Technology. Assigning Attributes and Behaviour. 3. generic classes. references as function parameters. Sahni and D. Classes and dynamic memory allocation: New. 2. the “const” Qualifier. “this” pointer.B. public and private inheritance. class hierarchies. polymorphism. multiple inheritance. Object Oriented Programming in Microsoft C++ – Balagurusamy. accessing data members. Placement of variable declarations. Horwitz. Generic functions. Pearson Education (Chapter 4 – for UML part in Module III) 40 . the scope resolution operation. Designing an object-oriented system: Identifying the classes. friends. overloading binary operator. Galgotia Book House. Teach yourself C++ .H. derived class constructors. references and pointers similarities and differences. MODULE II (13 hours) Introduction to classes: Declaring and using classes. Static members. Inheritance and Polymorphism. 3. References: References as Aliases. Fundamentals of object oriented design in UML. Object Oriented Programming – Barkakti 4. Text Books: 1. delete operators. C++ Programming from problem analysis to program design 3rd Edn. Jones. Object Oriented Programming in Microsoft C++ – Rober Lafore. returning a reference.

P. Text Books: 1. physical representation for strings – linked lists – trees. Michtm. Hugges and J. Schaum’s series. Introduction to data structures with applications – J.I. TMH. Storage management – free storage lists. Sahni and S. programming style. partition exchange sorting. Prentice Hall. garbage collection. Theory and problems of data structures – Seymour Lipschuts. 2. documentation – analysis of algorithms: frequency count. stacks. Samanta. sorting with tapes. Prentice Hall Englewood cliffs. Searching algorithms – hashing. MODULE III (19 hours) Internal and external sorting techniques – insertion sort. records. storage compaction. External sorting – sorting with disks. University of Kerala 08. merge sorting. boundary tag method. stepwise refinement techniques. Anderson-Freed. Fundamentals of data structures – E. 3.B. Tremblay and P.G. Universities Press (India) 41 . 3. Computer Science Press. Classic data structures – D. A structured approach to Programming – J.405 DATA STRUCTURES AND ALGORITHMS L-T-P: 2– 2 – 0 (R F) Credits: 4 MODULE I (14 hours) Introduction to programming methodologies – structured approach. queues and dequeues. Fundamentals of data structures in C – E. Study of basic data structures – vectors. MODULE II (19 hours) Logic characteristics of strings. reference counters.K. heap sort. Sahni. Wirth. Horwitz. 4. 2. Horowitz and S.Tech Information Technology. S. Sorenson. arrays. binary tree traversals – graphs – applications. PHI Reference Books: 1. Algorithms + data Structures = Programs – M.

406 L-T-P: 3 – 0 – 0 DATABASE DESIGN Credits: 3 MODULE I (13 hours) Introduction to database systems : traditional file system. E/R Model. database/DBMS distinction. entities. Addison Wesley. Hash based structures.B. 2007 Reference : Data Base System concepts – Henry F Korth and Silberschatz. 2006 2. querying in SQL.Tech Information Technology.Concepts of transaction processing. three schema architecture of a database. Database systems – Design. University of Kerala 08. 2NF. 42 . Decompositions and their desirable properties. data independence. Transaction Processing and Error Recovery . MODULE III (13 hours) Data Storage and indexes – File Organisations. Locking based protocols for Concurrency control. data models. 1NF. relational calculus. Concurrency control. Fundamentals of Database Systems. various components of a DBMS. ACID properties. – Ramez Elmazri and Shamkant B. 7th Edition – Peter Rob and Carlos Coronell. dependency theory – functional dependencies. Relational Data Model: Concept of relations. Text Books: 1. Multi-valued dependencies and 4NF. Mc Graw Hill. Thomson Course Technology. referential integrity and foreign keys. E/R diagrams. Implementation and Management. MODULE II (13 hours) SQL – data definition in SQL. Join dependencies and 5NF. B+ Trees. 3NF and BCNF. Serializabilty. schema-instance distinction. Dependencies – importance of a good schema design. Amstrong’s axioms. B-Trees. approaches to building a database. Converting database specification in E/R notation to the relational schema. Conceptual data modeling – motivation. embedded SQL. relational algebra operations. Logging and Recovery Methods. relationships. attributes and keys. 5th Edition. motivation for normal forms. Navathe. Primary and Secondary index structures. Membership and minimal covers.

arithmetic operations on polynomials 5.B. and doubly connected linked list and application problems 4.407 L-T-P: 0 – 0 – 4 DATA STRUCTURES LAB (R F) Credits:4 Programming exercises in C based on the course 08. conversion between infix. 9. 43 . finding height etc. Application problems using stacks – Maze problem. Use of multidimensional arrays and structures 3. Implementation of multiple stacks 7. Representation of sparse matrix – addition. Representation of polynomials. Creation of binary search tree – searching an item. University of Kerala 08. 6. String manipulation applications. circular linked list. priority queue and applications of queues 8. Associative Arrays. Dequeues. postfix and prefix.408 L-T-P: 0 – 0 – 4 OBJECT ORIENTED PROGRAMMING LAB Credits: 4 Implementation of topics covered in 08. Implementation of Queues using linked list and array – multiple Queues.Tech Information Technology. multiplication and transpose of sparse matrices 2. insertion and deletion of nodes etc. Standard Template Library – Containers.404 (Object Oriented Techniques) using Java or C++. expression evaluation etc.405 Data Structures and Algorithms. Iterators. Linked list – singly linked list. Implementation of stacks using arrays and linked lists. Implementation of sorting and searching algorithms 08. Creation and traversals of binary trees – counting nodes. 10. The exercises may include the following:1.

Fitting a parabola . Probability.strict sense stationary process . Stark and Woods.Fitting a straight line . Cambridge University Press.U. uniform. Gubner.Binomial.Random processes .Computing probabilities using Binomial. random variable and stochastic processes. 4/e. difference of two proportions. University of Kerala SEMESTER V 08.Chapman-Kolmogorov equation (no proof) Poisson process .Karl Pearson’s coefficient of correlation .Probability distribution (density) functions .Properties of normal distribution .Estimation .wide sense stationary process .Power spectral density and its properties (no proof) . TMH 3. exponential and normal distributions. Probability and Random Processes.B. 3/e.Markov chains.Interval estimation of population mean and proportions ( small and large samples) .Simple problems. Veerarajan. correlation coefficient of random processes stationarity .Mean and Variance of the above distributions Normal distribution .Mean and autocorrelation of Poisson process .Classification of random processes .Autocorrelation function and its properties .Examples .Marginal and conditional distribution Independence . Probability and Random Processes for Electrical and Computer Engineers. autocorrelation.Distribution functions . Pearson Education 4.Properties .501 L-T-P: 3 – 1 – 0 ENGINEERING MATHEMATICS (E R F B H) Credits: 4 MODULE I (18 hours) Discrete and continuous random variables and their probability distributions . . Probability and Random processes with application to signal processing. TMH 2.Testing of Hypothesis . Poisson. Poisson.Tech Information Technology. Papoulis and S.Hypothesis concerning a mean. Reference Books 1.Average values such as mean.Related problems. 2/e. MODULE III (18 hours) Joint probability density function . uniform and exponential distributions .Principle of least squares .Linear correlation and regression . MODULE II (16 hours) Curve fitting . Pillai. Transition probability matrices .Related problems .Mean and Variance . 2006 44 . Equality of meansHypothesis concerning one proportion. auto covariance.Sampling distributions Standard error .

Solution by simplex method .Dimension of vector space Rank . Linear Algebra with Applications. David C Lay.Singular value decomposition (proof of the theorem are not included).Network Analysis-Project Scheduling. Jones and Bartlett publications 5.Change of basis .Standard form . Philips. Linear Algebra.B. MODULE II (16 hours) Partitioned matrices and matrix factorization . Free float.Degenerate and non-degenerate solutions Optimal solution .Orthogonal sets Orthogonal projection . Kanti Swarup.Little’s Formulae – Problems based on the above results.Inner product space . Operations Research. Wiley 8.Basic feasible solution . M/M/c:∞/FIFO model – Standard results ( no derivation) .Vector space and subspace Null space and Column spaces . 14.LU decompositions .Slack and surplus variables . MODULE III (18 hours) Queuing Theory.Gram-Schmidt process . Solberg. Linear Algebra with Applications. Schaum Series 3. M/M/1:N/FIFO model – Formulae (without proof) for the average number of units in the system and in the queue and the average waiting time – Problems.Bases .Quadratic form Constrained optimization of quadratic forms .Problems.Estimation of Floats-Total float. Addison Wesley 7. Independent Float-Project Evaluation and Review Technique(PERT)-Computation of expected completion times by PERT. Linear Algebra with Applications. Linear Programming.502 ADVANCED MATHEMATICS & QUEUEING MODELS (RF) Credits: 4 L-T-P: 3 – 1 – 0 MODULE I (18 hours) General linear programming problem . Reference Books 1.Basic Queuing models.M/M/1:∞/FIFO .basic solution . Ravindran. Kenneth Hoffmann and Ray Kunze.Big-M method . Gareth Williams. Pearson Education 2.Artificial variables . PHI.Construction of Project networks. Operations Research. Thomson Learning 6.Length and orthogonality . Manmohan. G.Least square problem .Critical Path Method (CPM)Identification of Critical path using CPM.Solution of LPP .Tech Information Technology. 45 . Gilbert Strang.Co-ordinate systems . University of Kerala 08.Pn=ρnP0 (no proof)-Derivation of the following Characteristics (a) Probability that queue size ≥ n (b) Average number of customers in the system (c) Average length of the waiting line – Waiting time distribution (no proof) – Waiting time in the system – Waiting time in the queue . Hadly. Linear Algebra.Queues-Characteristics of Queues-Kendal’s notation-Random arrivals-Arrival and Departure Distributions-Types of Queues.

Introduction to Automata Theory. applications of finite automata. offline TMs.basics and formal definition. Thomson. 4. designing finite automata. reducibility. variants of TMs – multitape TM. 2.503 L-T-P: 2 – 1 – 0 THEORY OF COMPUTATION Credits: 3 MODULE I (13 hours) Introduction to the theory of computation. equivalence of NFA and DFA.Ullman and Rajeev Motwani. 3. Mealy and Moore machines. University of Kerala 08. normal forms of CFGs. MODULE II (13 hours) Chomsky classification of languages. 2-way finite automata. examples of PDA. PDA – formal definition. decidable and undecidable problems – examples. closure properties of regular sets and regular grammars. language acceptability by TM. Introduction to The Theory of Computation (Second Edition). regular sets and regular grammars. Narosa Publishing. properties of transition functions. ambiguity. Bernard M. pumping lemma for regular languages. regular expressions. Recursive and recursively enumerable languages. Universal Turing Machine. Jeffrey D. decision algorithms for regular sets.B. Languages and Computation – John E. simplification of CFLs. MODULE III (13 hours) Turing machines . halting problem. Pearson Education. equivalence of single tape and multitape TMs. pumping lemma for CFGs. examples of TM.derivation trees. designing CFGs. 1 Text Books : 1. Finite state automata – description of finite automata. finite automata with epsilon moves. Context-Free Grammar . minimization of FSA. Switching and Finite automata theory – Kohavi. Hopcroft . Reference Books : 1. Deterministic PDA. Pearson Education. decision algorithms for CFGs. The Theory of Computation. NDTM. Introduction to Automata Theory and Formal Languages – Peter Linz. Michael Sipser. Moret. NFA. Tata McGraw Hill 46 .Tech Information Technology. equivalence with CFGs.

Reference Books: 1 1. MODULE II (13 hours) Assemblers – Basic assembler functions – machine dependent assembler features – machine independent assembler features – Hand assembly of SIC/XE programming.Tech Information Technology. Assemblers Vs Compilers. dynamic linking. Loaders and Linkers basic loader functions. Beck.504 L-T-P: 2 – 1 – 0 SYSTEMS PROGRAMMING (RF) Credits: 3 MODULE I (13 hours) Systems Programming – What is systems programming. machine dependent loader features. Pentium Pro architecture. bootstrap loaders. Donovan. Tata McGraw Hill. Debuggers – debugging functions and capabilities. Power PC.B. Text Books: 1. ANSI C macro processors. editor structure. Assembler design options – one pass assembler. dynamic linkage editors. Tata McGraw Hill. 2. multi pass assembler – assembler implementation – MASM. Damdhere. Traditional (CISC) machines – VAX architecture. Pearson Education. loader design options – linkage editors. Systems Programming – John J. RISC machine – ultra SPARK.M. System Software-An Introduction to System Programming – Leland L. examples – DOS linker. University of Kerala 08. SIC & SIC/XE Architecture and Programming. SPARC assemblers. machine independent loader featured. relationship with other parts of the system – user interface criteria. 47 . Difference between systems programming and application programming – Dependence on systems programming on hardware – System software and Machine architecture. MODULE III (13 hours) Macro processors – basic macro processor functions – machine dependent and machine independent macro processor architectures – design options – implementation examples – MASM. Text Editors – overview of the editing process – user interface. Operating Systems and Systems Programming – D.

demand paging .virtual memory concepts .time sharing . Information management: File concepts .Gary Nutt.sector queuing device drivers. University of Kerala 08. Historical perspective . Reference Books: 1. Critical Section Problem and solutions .detection . Pearson Education.avoidance .Tech Information Technology.fixed partitions . Prentice Hall. Dead locks : Deadlock problem .scheduling concepts .page replacement .directory structure . Brinch Hansen.recovery from dead lock .types of OS batch processing .sharing and security .swapping .concurrent processes.access matrix and its implementation dynamic protection structures .overlay . Protection : Goals of protection .characteristics . Peterson and A.mechanisms and policies .space allocation policies . MODULE II (21 hours) Processor management: CPU scheduling .paging segmentation . Silberschatz.semaphores .file system .allocation methods . Operating Systems .B.functions and components of an operating system .distributed system.early systems .segmented paging . Operating System Principles – P. MODULE III(16 hours) Device management : Physical characteristics – disk scheduling algorithms .gaining access to files basic file system calls .implementation issues.real-time system .security.scheduling algorithms . Memory management : Basics . Addison Wesley.file protection .505 L-T-P: 3 – 1 – 0 OPERATING SYSTEMS Credits:4 MODULE I (15 hours) Introduction : Basic concepts – terminology.variable partitions .combined approach to dead lock handling.prevention . L.classical problems in process synchronization.multiprogramming . Text Books: Operating System Concepts – J.dynamic linking.OS services -multiprocessor system . 48 . 2.

NRZ. Basics of wireless communication.Multiplexing TDM.Transmission media . Forward Error Correction . VRC. Time Domain and Frequency Domain concepts .William Stallings . Coaxial cable.Channel capacity Shannon's Theorem .Different types of noise . message switching. PHI. Fourth Edition – Andrew S Tanenbaum. Biphase. Computer Networks.Hamming codes.PHI 2. optical fiber. PSK . Eighth Edition . PM .Tech Information Technology. FM. WDM & DWDM.B. DM . MODULE III (14 hours) Error Detecting and correcting codes. Error detection .Behrouz A Forouzan. Delay distortion. FDM. WiMax.circuit switching. GPRS 1 Text Books: 1. CRC. terrestrial microwave.Attenuation. PM.506 L-T-P: 2 – 1 – 0 DATA COMMUNICATION Credits:3 MODULE I (12 hours) Communication model.parity check. satellite microwave . Data and Computer Communications.Analog & Digital data and signals . Block codes.Introduction to WiFi. 49 .Simplex. Convolution codes. FSK.ASK. Data Communications and Networking. Fourth Edition . Tata McGraw Hil References : 5.PCM.Encoding digital data into digital signal .Transmission Impairments . Multilevel binary Encoding digital data into analog signals . half duplex and full duplex transmission. packet switching.Encoding analog data into digital signals .synchronous and Asynchronous transmission. GSM.AM.twisted pair. MODULE II (13 hours) Sampling theorem .Encoding analog data into analog signals . Noise . University of Kerala 08. Basic principles of switching .

integrating all the features specified in the above exercises.B. Write SQL block containing triggers and stored procedures.Suitable exercises to practice SQL commands may be given.Tech Information Technology. Payroll. Health care etc. University of Kerala 08. 6. Electricity Billing. Inventory. 50 . 3. 4.508 L-T-P: 4 – 0 – 0 DATABASE LAB Credits: 4 1. 2. Write SQL procedure for an application which uses exception handling. Write SQL procedure for an application with cursors. Insurance. GUI based user friendly database application in any one of the domains such as Banking. 5. Develop a menu driven. DML and DCL). Library management. Familiarization of creation of databases and SQL commands (DDL.507 L-T-P: 4 – 0 – 0 DIGITAL CIRCUITS LAB Credits: 4 1 Realization of digital gates 2 3 4 5 6 7 Realization of flip-flops Design and implementation of a counter Design and implementation of a shift register Multiplexer / Demultiplexer Timer Circuits (using 555) Experiments using the 8051 microcontroller 08. Write a DBMS program to prepare reports for an application using functions.

University of Kerala SEMESTER VI 08. error detection.Alfred V. Cambridge University Press. PHI. translation of array reference. Appel. Techniques and Tools (Second Edition) . recovery and repair. derivations and parse trees.G. LR(0). 51 . Engineering a Compiler (Second Edition) . SLR(1).Tech Information Technology. 5. Compiler Construction – Principles and Practice by Kenneth C. code optimization. loop optimization and global optimization. LALR(1) parsers. Compilers: Principles. Cengage Charles River Media. Basic parsing techniques – Top down parsing – recursive descent parser.B. predictive parser simple LL(1) grammar. 4. Text books: 1 1. Bottom up parsers. MODULE III (16 hours) Syntax directed translation schemes. Jeffrey D. MODULE II (18 hours) Compile time error handling. Ravi Sethi.Andrew W. translation of assignments.601 L-T-P: 3 – 1 – 0 Creidts: 4 COMPILER DESIGN (RF) MODULE I (18 hours) Introduction to compilers and interpreters – overview of compilation. Raghavan. Louden. Lam. reporting. Kakde. Cengage Learning. Monica S. issues in compilation – structure of a compiler – compiler writing tools – bootstrapping – notations and concepts for languages and grammars – regular expressions – context free grammar. 2. Aho. intermediate codes. Algorithms for Compiler Design – O. 2. Context of a lexical analyzer – construction of lexical analyzer. LR grammar. 3. Reference Books : 1.Keith D Cooper & Linda Torczon. Pearson Education. back patching. case statements. BNF notations. Modern Compiler Implementation in C . Compiler Design – Santanu Chattopadyaya. Ullman. Boolean expressions. Elsevier. Principles of Compiler design – V. operator precedence parser. sources of sample code generation. Tata McGraw-Hill. deterministic and non-deterministic finite automata.

602 L-T-P : 2 – 1 – 0 COMPUTER NETWORKS Credits: 3 MODULE I (12 hours) Introduction – Uses – Network Hardware – LAN –MAN – WAN.OSPF – Routing for mobile hosts – Congestion control algorithms. RARP. 3 .Wireless LANs 802. Tata-McGraw Hill 2 .Behrouz A Forouzan. References: 1. Network Management – SNMP. MPLS.Hand book of Computer Communications Standards. Fourth Edition – Andrew S Tanenbaum. IGMP.High Speed LANs .Switches . Transport Layer – TCP & UDP. Fourth Edition. Data Link layer . PHI.Design Issues – Flow Control and ARQ techniques. Reference models – OSI – TCP/IP. Data Communications and Networking .15. 802.HDLC DLL in Internet.Tech Information Technology.Data and Computer Communications. Exterior routing protocols . Data link Protocols . Internet Multicasting. Subnetting. MODULE III (14 hours) Internetworking – Network layer in internet – IP Addressing – Classful and Classless IP Adressing. Text Books: 1 Computer Networks. An Engineering Approach to Computer Networks – Keshav. Volume 1 – Willman Stallings. 4. Bridges . University of Kerala 08.Gigabit Ethernet. Internetworks – Network Software – Protocol hierarchies – Design issues for the layers – Interface & Service – Service Primitives.11 a/b/g/n. ARP. Eighth Edidtion – William Stallings. Network layer – Shortest path routing – Flooding – Distance Vector Routing – Link State Routing – RIP . 52 . MODULE II (13 hours) MAC Sub layer – IEEE 802 FOR LANs & MANs. QoS.B. Voice over IP . BOOTP. Internet Control Protocols – ICMP.323 & SIP standards. IPv6 – addressing – issues. Gatekeeper.BGP. Addison Wesley.H. PHI. PHI.

Michael Blah.603 L-T-P: 2 – 1 – 0 SOFTWARE ARCHITECTURE Credits: 3 MODULE I (13 hours) Modeling as a design technique – UML . Reusability and Efficiency – Trade offs among robustness.).characteristics of design patterns – delegation and recursion. PHI. University of Kerala 08. Software Architect BOOTCAMP 2nd Ed.Tech Information Technology. Eric Braude . Pearson. Software Design – From Programming to Architecture. Software Architecture. Paul Clements. Rick Kazman Pearson [M III] References: 1 1. Text Books: 1. 2. Raphael Malveau. Thomas J Mowbray. MODULE III (13 hours) Software Architecture – Functionality and Architecture – Architecture and quality attributes – Availability tactics – Modifiability tactics – Performance tactics – Security tactics – Testability tactics – Usability tactics – Relationship of tactics to architectural patterns – Documenting Software architecture.Wiley[M II] 3.change event – states – state diagrams – Activity effects Interaction Modeling – use case models –use case diagrams – sequence models – Activity models. James Rumbaugh. Object-Oriented Modeling and Design with UML (2nd Ed. 53 . MODULE II (13 hours) Software Design principles – Correctness and Robustness – Flexibility. flexibility. structural and behavioral design patterns .Class Modeling –class diagrams – Links and associations – Generalization and inheritance –Navigation of Class Models – State Modeling – Events – Signal event . Pearson [M I] 2. Len Bass. Software Architecture in Practice (2nd Ed. David Garlan.). Mary Shaw.B. reusability and efficiency – Design patterns – creational.

B. Non-Blocking I/O. 4. 5. H. Event Handling. Programming the World Wide Web 2009 (Fifth edition).604 L-T-P: 3 – 1 – 0 INTERNET TECHNOLOGY Creidts: 4 MODULE I (17 hours) Introduction . Sockets for Servers.Web Browsers and Web Servers – URL. Pearson Education.M. Pearson Education.J. XML (Creating Markup with XML -XML Namespaces. JavaScript (Introduction to Scripting. Herbert Schildt. Apache Web Server . AWT components. Strings. Mowbray. Web Services). Extensible Stylesheet Language. TELNET. Helper Applications. University of Kerala 08. Sockets for Clients. Swing components.Search Engines .B. Java – Packages and Interfaces. Java2 – The Complete Reference. Tata McGraw Hill. 6. 3. Web Content Preparation . Event Model). IDL. IMAP – MIME . Cascading Style Sheets.Web Servers – IIS . SMTP. A. Plug-ins. 54 . Arrays. DHTML (Object Model and Collections.Browsers. Simple API for XML. Multithreaded Programming.Proxy Server . Pearson Education. I/O. Elliotte Rusty Harold. Pearson Education. POP3. Inside CORBA.HTTP. MODULE III (17 hours) Network Programming in JAVA – Looking Up Internet Addresses. Robert W. UDP Datagrams and Sockets – RMI . FTP. 2. Control Statements.Tech Information Technology. Text Books: 1.Content Display . Deitel. Applets. DOM Methods.Persistence Java Beans – CORBA. Exception Handling. Document Object Model. Component Software: Beyond Object-Oriented Programming. MODULE II (18 hours) Protocols. Deitel. Clemens Szyperski. O'Reilly. Sebesta.HTML. Java Network Programming (Third edition).Goldberg. Document Type Definitions and Schema. Internet & World Wide Web – How To Program (Third edition). P. Objects). Functions.

Pattern Recognition and Image Analysis – E. Hlavac. scan line algorithm. 1 Text Books: 1. Introduction to graphics in three dimension – specification of a 3D view . Z. Boyle.3D transformations MODULE III (14 hours) Projections – Parallel and perspective projections – vanishing points – Hidden elimination – Back face removal. and Machine Vision – M. Sobel.Buffer algorithm. Pauline Baker. Johnsonbaugh. MODULE II (13 hours) Two dimensional transformations – Homogeneous coordinate systems – matrix formulation and concatenation of transformations – Windowing concepts – two dimensional clipping.. Canny edge detectors. 3. Image processing – introduction – digital image representation – relationship between pixels – gray level histogram – equalization – edge detection – Robert.Tech Information Technology. Computer Graphics – Donald Hearn and M. Rogers 2. Analysis. University of Kerala 08. Scene segmentation and labeling – region-labeling algorithm – perimeter measurement.605 L-T-P: 2 – 1 – 0 COMPUTER GRAPHICS Credits:3 MODULE I (12 hours) Basic concepts in Computer Graphics – Types of Graphic Devices – Interactive Graphic inputs – Basic Raster Scan Graphics – Line Drawing Algorithms – Circle Generation Algorithms .Scan Conversion – frame buffers – solid area scan conversion – polygon filling. Principles of Interactive Computer Graphics – William M. Procedural Elements for Computer Graphics – David F. S. Image Processing. PHI Reference Books 1. V. Sonka.B. R. Thomson India Edition. 55 . PHI 2. and R. Jost. Newman and Robert F. Gose. Sproull.

Architecture.Tech Information Technology.Task scheduling models . organization.B.PCI.Timer and counting devices . stacks and lists .Handling of interrupt latency and deadlines .Concepts of embedded programming in C++ . 2004 1 56 . Programming and Design. MODULE III (18 hours) Real-time operating systems .Definition and classification – Processors and hardware units in an embedded system – Software embedded into the system – Embedded system-on-chip .12 C.Assembly language vs high level language . USB and advanced serial high-speed bus . PCI-X and advanced buses Device drivers -Interrupt servicing mechanism.Processor and memory.606 L-T-P: 3 – 1 – 0 EMBEDDED SYSTEMS Credits: 3 MODULE I (18 hours) Introduction .Resource management – File system organization and implementation – I/O subsystems – Interrupt handling . TATA McGraw Hill.RTOS services . Text Books: Embedded Systems .Structures . Inter-process communication and synchronization – Semaphores – Priority inversion problem Deadlock situations – Signals – Message queues – Mailboxes – Pipes – Sockets. University of Kerala 08. MODULE II (16 hours) Programming concepts . iso-synchronous and asynchronous communications from serial devices -Internal serial communication devices . CAN.Queues.C Program Elements .Performance metrics.Synchronous. Raj Kamal. I/O Devices .C compilers – Cross compiler – Optimization of memory usage.Parallel port devices .

8. Rotation. chat application with datagram sockets and datagram packets. 3. borders. tables.obtaining information on the browser and the operating system. 3D Graphics: Curves and Surfaces. Polygon). Surface rendering. JavaScript . 5. Java applets – labels. proxy server. Interactive Graphics: Interactive input techniques (mouse programming).use of external style sheets. e-mail client. colors. XML document parsing using DOM. JavaScript features. padding. a war aircraft bombing a ship. Transformations (Scaling. Server configuration – web server. embedded maps. 08. timed JavaScript redirect.608 L-T-P: 0 – 0 – 4 COMPUTER GRAPHICS LAB Credits: 4 2D Graphics: Drawing Elementary figures (line. XML – conversion to HTML.607 L-T-P: 0 – 0 – 4 INTERNET LAB Credits:4 1. Basics of flash animation : Motion Tweening in flash player 57 . University of Kerala 08. Polygon Filling (Boundary fill. Clipping. Translation. CORBA. Java RMI. Flood fill and Scan fill) . lists. etc). Rotation of a 3D object about arbitrary axis.Tech Information Technology. text fields and animation. Shear) Windowing and clipping (Polygon and line clipping). XSLT. Cascading Style Sheets. Java network programming – simple web client. 6. 4. Reflection. Hidden line and surface removal. 7. Creation of HTML documents . 2D Animations using primitives (eg : man cycling along a road. ordered lists.B. TCP/IP client and server. 2.

Software configuration management: baselines--the SCM processidentification of objects in software configuration-Version control-Change control-Configuration audit-status reporting-Software Quality Assurance-SQA activities. Software Project Management: A unified framework – Walker Royce. monitoring and management-safety risks and hazards-RMMM plan. Project Management concept: People – ProductProcess-Project. Pressman.Metrics and indicators. MODULE III (13 hours) Project scheduling and tracking: Basic concepts-relation between people and effort-defining task set for the software project-selecting software engineering task-refinement of major task-defining a task network-Scheduling-project plan.characteristics .Measures. Software Engineering – Roger S.B. Sixth Edition. Pearson Education 58 . Pearson Education 2.Incremental models.701 L-T-P : 2 – 1 – 0 SOFTWARE PROJECT MANAGEMENT Credits: 3 MODULE I (12 hours) Software . Evolutionary models.Process: Process-layered technology-Software process models – Waterfall model .Software measurementsmetrics for software quality-Software project planning: Planning objectives . 1 Text Book: 1. McGraw Hill International References: 1. Software Project Management in Practice – Pankaj Jalote.software scoperesources-software project estimation-Decomposition Techniques –Empirical estimation modelsCOCOMO model.Tech Information Technology. Risk management: software risks-risk identification-risk projection-risk mitigation. University of Kerala SEMESTER VII 08. MODULE II (14 hours) Software process and project metrics: .

B. Peers. Text Books : 1. POP. Elsevier 2005. Internet Multi casting. IMAP. 59 . SSH).Tech Information Technology.DNS. QoS). Protocols and Architecture (5th Edition). Principles. WWW (HTTP). Electronic Mail ( SMTP. VPN). The Internet and Its Protocols. Classful Internet Addresses. Adrian Farrel. Routing Within an Autonomous System (RIP. PHI 2009 2. MODULE I (18 hours) Routing Architecture : Cores. Private Network Interconnection (NAT. File Transfer and Access ( FTP. Bootstrap and Autoconfiguration (DHCP). TFTP. NFS) . User datagram Protocol. Forwarding IP datagrams. Protocol Layering. Mapping Internet Addresses to Physical addresses (ARP). 1 Internetworking with TCP/IP . Reliable Stream Transport Service. University of Kerala 08. Classless and Subnet Address Extensions (CIDR). Routing Between Peers (BGP). OSPF). Douglas E.702 L-T-P: 3 – 1 – 0 INTERNETWORKING Credits: 4 MODULE I (17 hours) Internet Architecture. RSVP. and Algorithms. Connectionless Datagram Delivery (IPV4) . Voice and Video Over IP (RTP. Remote Login and Desktop (TELNET.Volume I.Comer. Error and Control Messages ( ICMP ). MIME). Determining an Internet address at start-up (RARP). MODULE I (17 hours) Applications . IP Switching and MPLS.

Fair cryptosystems. Zero . Substitution ciphers.Behrouz A. Cryptanalytic attacks. DES modes. Shift Registers :. CAMBRIDGE UNIVERSITY PRESS 1. random properties of shift register sequences. Message authentication with digital signatures. Key Management :. University of Kerala 08. Van Der Lubbe. Message authentication with a message authentication code (MAC). The theory of finite state machines. Entity authentication with symmetrical algorithm. Public key systems based on elliptic curves.information measure and absolute security.703 L-T-P: 2 – 1 – 0 CRYPTOGRAPHY Credits :3 MODULE I (12 hours) Introduction to cryptology :. shift Registers. IDEA (International Data Encryption Algorithm). Cracking the Knapsack system. Classical cipher systems . Key distribution for asymmetrical systems. Cryptanalysis of LFSRs.Transposition ciphers. A. Hagelin machine.Protocols. 60 . MODULE II (14 hours) The DES algorithm :. 2. Tata McGraw Hill.Tech Information Technology.B. MODULE III (13 hours) Authentication and integrity :. Nonlinear shift registers. Public Key Systems :.General aspects of key management. Network security.knowledge techniques. Message integrity. Analysis of the DES. Statistics and cryptanalysis.Stream and block enciphering. unicity distance. Error probability and security. Forouzan. Aspects of security. Text Books : 1 Basic Method of Cryptography. Jan C. Alternative descriptions. Cryptography and Network Security .Characteristics.Cryptography and cryptanalysis. RSA system. generating function. Key distribution for symmetrical algorithms. Knapsack system. The information theoretical approach .Introduction.

Servlets with JDBC. transaction support.Allen. MODULE III (13 hours) Enterprise JavaBeans : Overview. University of Kerala 08. Stateless and tateful session bean. JDBC: Architecture . Java Servlet Programming. Bean attributes.web application lifecycle .creating the interface. deployment.Jason Hunter. Text Books : 1. Scrollable Resultsets.defining the application . Error Handling and Debugging. CORBA and RMI .Mastering EJB(2nd Edition ) – Ed Roman.J2EE Layers. service method detail. Using JavaBeans Components in JSP Pages. Kim Hasse.servelet Package. Second Edition.java message service (JMS) and message driven beans (MDB). building session beans creating session beans . Bambara. Reading Servlet parameters. Metadata.Tech Information Technology. 2. use as controller in MVC. Setting attributes. Beth Stearns-Pearson Education –Asia. Tyler Jewell – John Wiley Publications 2003. Application Components. SPD O’Reilly 61 . servlet container. SQL-to-Java Data Types. J2EE Architecture. Sharing Data Between JSP pages -Passing Control and Data between Pages – Sharing Session and Application Data – Application Models . Paul R. William Crawford. Session and entity beans.Stepahnie Bodoff. dispatching requests. javax. Monica Pawlan. EJB framework. web applications. Dale Green. Conditional Processing – Displaying Values. container-managed persistence (CMP) and bean managed . Using Scripting Elements. Development methodology . HTTP response header. Eric Jendrock. session management. J2EE UNLEASHED – Joseph J. Implicit JSP Objects. Servlets API. Retrieving and updating Data. building pages.MVC Design. validating the code. The J2EE Tutorial. Java Server Pages: Generating Dynamic Content.Web architecture .Transaction management. distributed programming.O'Reilly Media 3. 1 Sherry Smith – SAMS Techmedia 2. servlet lifecycle. Security. Ziyad Dean. Scott Ambler. personal roles for EJB Development. Batch Statements.704 L-T-P: 2 – 1 – 0 WEB APPLICATIONS DEVELOPMENT Credits: 3 MODULE I (13 hours) Introduction .XML and J2EE.JDBC API. MODULE II (13 hours) Servlets: Introduction to Servlets. Java Server Pages –Hans Bergsten. Thomas Garben.database design . Design and development of a J2EE application .Task list for building J2EE Applications . Benefits of Servlets. Reference Books : 1.B. creating data access objects. Parts of a Bean. basic HTTP. JDBC Execution Types. HTML clients.lifecycle of EJB . Mark Ashnault.Entity beans. distributed programming services.

The Design and Analysis of Computer Algorithms – A. Text Books : 1 1.D. Back tracking – 8 Queens problem. MODULE II (18 hours) Height balanced trees – AVL Trees – Red-Black trees – Steps involved in insertion and deletion – rotations. Graphs – DFS and BFS traversals. 2. University of Kerala 08. Integer multiplication problem. heap sort algorithm. Definition of B-trees – basic operations on B-trees. Strassen’s algorithm. Allen Van Gelder 62 .E. priority queues. Definitions and Basic concepts of NP-completeness and NPHardness. Fundamentals of sequential and parallel algorithms – Kenneth A. Vikas Publishing Reference Books : 1. PHI. building heap. Algorithm for sets – Union and Find operations on disjoint sets. strongly connected components. Fundamentals of Computer Algorithms – Horowitz and Sahni. MODULE III (18 hours) Algorithm Design and analysis Techniques – Divide and Conquer techniques – Merge Sort. Paul. Rivest. Topological sorting. Pearson Education 3. average and worst – case analysis. Analysis of sorting algorithms – insertion sorting. Introduction to Algorithms – Thomas H. Recurrences – substitution method. Greedy algorithms – Knapsack problem. Dynamic programming – Matrix multiplication problem. Introduction to the design and analysis of algorithms – A. Asymptotic notation. Spanning trees – Minimum Cost Spanning Trees. heaps.Tech Information Technology. iteration method and master method. Description of quick sort. Shortest paths – single source shortest path algorithms.Introduction to design and Analysis – Sara Baase. Merman and Jerome L. Branch and Bound – Travelling Salesman problem. Hopcroft and J. Levitin.705A L-T-P: 4-0-0 ALGORITHM ANALYSIS AND DESIGN Credits :4 MODULE I (16 hours) Concepts in algorithm analysis – the efficiency of algorithms. Computer algorithms .B. randomized version of quick sort. Kruskal’s and Prim’s algorithms. Galgotia Publication. Ullman. Study of NP-Complete problems. J.V Aho. 2. 3. maintaining the heap property. Charles E. time and space complexity. Cormen. Leiserson and Ronald L. Addison Wesley Publishing Company.

B. Law. TMH System Simulation. MODULE I (17 hours) Modeling complex systems .shared computer model – Job-shop model. University of Kerala 08. Averill M. MODULE I (17 hours) Simulation software – comparison of simulation packages with programming languages – classification of simulation software – desirable software features – General purpose simulation packages – Object – oriented simulation.Tech Information Technology. Geoffrey Gordon. Text Book : Reference : 1 Simulation Modeling and Analysis 4th Ed.705B L-T-P: 4 – 0 – 0 SIMULATION AND MODELING Credits : 4 MODULE I (18 hours) Basic simulation Modeling – Discrete-event simulation – simulation of a single-server queuing system – simulation of an inventory system – steps in a simulation study – continuos simulation – combined discrete-continuous simulation – Monte-Carlo simulation – Advantages – disadvantages – and pitfalls of simulation. PHI 63 .Single server queuing simulation Time.

Second Edition by Kenneth C. Second Edition by Ravi Sethi. Higher-Order Functions. Limitations of Logic Programming. Denotational Semantics. Data Abstraction and Object Orientation:. Recursion. MODULE III (17 hours) Innovative features of Scripting Languages:. Pearson Education 64 . Arrays. Data Types:. Assertions in C and JAVA. String and Pattern Manipulation. Performance Analysis. Second Edition by Allen B. Pointers and Recursive Types. Programming Languages – Principles and Paradigms. Tucker and Robert E.Encapsulation.Lambda Calculus.Operational Semantics. Concepts of Programming Languages. Overloading. Nondeterminacy.Tech Information Technology. Late Binding of Machine Code. Functional and Logic Languages:. Run-time program Management:. Events. Storage Management. Text Books: 1 1. Streams and Monads. Sets. MODULE II (18 hours) Subroutines and Control Abstraction: .Threads. Files and Input/Output. Proofs of Program Correctness. Sequencing. Noonan. Sebesta. Reflection. Tata McGraw-Hill Edition 2. Multiple Inheritance. Type Checking. Binding of Referencing Environments. Dynamic Method Binding. Pearson Education. Iteration. Cengage Learning Reference Books: 1.Virtual Machines. Lists. Structured and Unstructured Flow. Inheritance. Polymorphism.Names and Scopes.Scoping rules. Parameter Passing. Introduction to Formal Semantics and Program Verification:. Equality Testing and Assignment.Static and Dynamic Links. Louden. Synchronization. Binding Time. Concurrency:. Aliases. Calling Sequences. Scope Rules. Generic Subroutines and Modules. Programming Languages – concepts & constructs. Programming Languages – Principles and Practice.705C L-T-P: 4 – 0 – 0 PRINCIPLES OF PROGRAMMING LANGUAGES Credits: 4 MODULE I (17 hours) Names. Logic Programming in Prolog. Strictness and Lazy Evaluation. Selection. Constructors and Destructors. Third Edition by Michael L Scott. Eighth Edition by Robert W. Programming Language Pragmatics. 2. Overview of Scheme. Language-Level Mechanisms. Control Flow: . and Bindings:. University of Kerala 08. Coroutines. Exception Handling. Axiomatic Semantics. Scopes.B. Smalltalk Object Model.Expression Evaluation. Strings. Symbolic Debugging.Type Systems. Separate Compilation. Object Orientation. Morgan Kaufmann Publishers (Including the companion CD with the book). Data Types. Records and Variants. 3.

letters. 2.dissertation. Reading Skills: Skimming the text. Oxford University Press.exposure to a variety of technical articles. letter to authorities. Pearson Education. Speaking Skills: Oral practice-Describing objects/situations/people-Role play-Just A Minute/Group Discussion. graphic representation.B.levels of communication-interpersonal. Technical communication. condensing . structure and style. Basics of Technical Communication.features.Technical proposals-writing a proposal –the steps involved. significance. Students should read the book on their own and selected topics may be discussed in the class.barriers to communication.705D COMMUNICATIVE ENGLISH & TECHNICAL WRITING (Common with 08. 65 . Basic Communication Skills for Technology – Andrea J Rutherford. use of appropriate vocabulary -sentence construction-paragraphs development-note making-editing a passage and essay writing.projects. Preparing audio-visual aids. Speaking and Writing skills. letter of quotation.informal letters-essentials of telephonic conversation-invitations-minutes of a meeting. Business letters-sales and credit letters. and journalistic articles. downward and lateral-importance of technical communication. MODULE II (20 hours) Forms of Technical communication. organizational. Writing Skills: Skills to express ideas in sentences. Effective Technical Communication – Barun K Mitra. 4. mass communication-the flow of communication: upward. PHI. essays. Reading. Distinction between general and technical communicationlanguage as a tool of communication. 3.thesis writing. placing order. TMH New Delhi. Everyday Dialogues in English – Robert J Dixson. New Delhi. Official letters-govt. writing reports.Technical papers.Tech Information Technology. letter of enquiry. Job application and resume.704(3) of CSE) L-T-P: 3-1-0 Credits: 4 MODULE I (20 hours) Listening. University of Kerala 08. Business Correspondence and Report Writing – Mohan K and Sharma R C. Listening Skills: Listening for general content. Reports-types. 1 Reference Books: 1. MODULE III (12 hours) A non-detailed study of the autobiography: “Wings of Fire-an autobiography by APJ Abdul Kalam”.Intensive listening-Listening for specific information.

Printers – Impact and Non Impact Printers– Dot matrix. DDR2. USB.Introduction-DRAM.Magnetic tapes and Streamer tapes . Introduction-CDs. Mechanical mouse and Optical mouse-working.P. SoDIMM. Hardware and Networking-Vikas Gupta-Dreamtech press. AGP Slots. working.Hard disks -tracks and sectors-operation of hard disk–. WXGA. Addison Wesley/Pearson Education 66 . working– Inkjet printers. Storage interfaces – ATA/IDE -SATA-SCSI. Memory. DDR3. DIMM.PCI slot.B. MODULE I (18 hours) Input / Output Devices – Scanners –flat bed scanner-working process. SXGA. XGA. Reference : The Indispensable PC Hardware Book – Hans Peter Messmer. 1 Text Books : 1. Micro DIMM.B.Random access mass storage devices -Magnetic disks.706A L-T-P: 4 – 0 – 0 COMPUTER PERIPHERALS & INTERFACING Credits: 4 MODULE I (17 hours) Introduction-Motherboard Components -Processors-Introduction-Microprocessor ComponentsDesktop processors-Microprocessor Associates-Microprocessor Packaging-Microprocessor Sockets. WUXGA. Blu-ray Discs. Pearson Education. Parallel ports.B 3. Serial ports.VGA.introduction. working – Laser printers. A+ Study Guide . SDRAM. Expansion Slots. Upgrading and Repairing PCs – ScottMueller. RIMM.Core Module .IntroductionSIMM. SVGA. RAM slots-types. DDR. read and write process..WQXGA– Serial access mass storage devices . DVDs.Tech Information Technology. PCI-Express slots. University of Kerala 08. MODULE I (17 hours) Display adapters. David Groth. 2. Magneto Optical disks.

S K Mittal 2. expected variance criterion. Construction of the time chart-resource leveling.706B L-T-P: 4 – 0 – 0 OPTIMIZATION TECHNIQUES Credits : 4 MODULE I (17 hours) General methods of solving operations research models. economic interpretation. Operations Research .B. problem of choosing between two machines.Tech Information Technology. quality. Graphical solution. unbalanced assignment problems MODULE II (18 hours) Replacement model. determination of best replacement age of machine using present worth and discount rate. Generald J Liebermann 3. Frank S Budnick. Hurvitz criterion. Text Books : 1. use of artificial variables. mathematical formulation. degeneracy and elementary sensitivity analysis – Transportation problem – mathematical formulation – initial feasible solution by VAM method. Richard Mojena 67 . minimax regret criterion. unbalance transportation problem – Assignment problem. types of replacement problems. the assignment algorithm. group replacement . calculation of critical path. Operations research. degeneracy. scientific methods in operations research . Frederick S Hiller.Mathematical formulation of linear programming problem. advertisement etc. probability and cost consideration in project scheduling. Dennis McLeavy. MODULE III (17 hours) Network analysis – project scheduling by PERT – CPM. Principles of Operations Research for managers. decision under uncertainty – the Laplace criterion. University of Kerala 08. Simplex algorithm and its applications. B S Goel. the mini-max criterion.game theory – definition of a game – two person zero sum game – graphical solution. arrow head representation. – decision theory – decision under risk – expected value of profit or loss. decision trees. application in marketing.

S. Feature creation. Text mining. Other classification methods. Measuring the quality rules. Algorithms . Sampling. Tata McGraw-Hill.Decision tree-based.Margaret H.Classification and prediction. Accuracy and Error measures. MODULE II (17 hours) Association and Correlation . Data warehouse architecture and implementation.Jiawei Han. model selection. Constraint based cluster analysis. Association and Prediction . 2. Wiley Publishing. Advanced Topics . Evaluation of accuracy of classifier or predictor.Arun K. Density based methods. Multimedia mining. Increasing the accuracy. Variable transformation. Data mining techniques . Grid based methods. Discretization and Binarization. Advanced association rule techniques. University of Kerala 08. Data Warehousing. Issues. 68 . 1 Text Books : 1. Dimensionality reduction. Data Mining and OLAP – A. Data Mining : Concepts and Techniques . Distance-based. 3.Tech Information Technology. Data warehousing and OLAP Technology – Introduction to Data warehouse.706C DATA MINING TECHNIQUES (Common with 08. Feature subset selection. From association mining to correlation analysis. Clustering large data bases.Sridhar. classification of major clustering methods. Partitional algorithms . Data Mining : Introductory and Advanced Topics . Reference Books : 1. Model based clustering methods. Pujari. Dunham. Spatial mining.Hierarchical methods.Basic data mining tasks. Morgan Kaufmann Publishers. System architecture. Smith. DM versus KDD Data preprocessingAggregation.B. Neural network and rule-based. MODULE III (18 hours) Cluster analysis – Types of data in cluster analysis. Berson and S. Data warehousing and data mining. Issues. Prediction. Constraint based association mining. statistical-based.Multidimensional analysis and descriptive mining of complex data objects. Micheline Kamber.Basic algorithms. Inmon. Web mining. J.William H. Multidimensional data model. Support vector machines. Pearson Education. Building the Data Warehouse . Temporal mining.705(4) of CSE) L-T-P: 4-0-0 Credits:4 MODULE I (17 hours) Fundamentals of data mining . 2. Universities Press.

11.707 L-T-P: 0-0-4 COMPUTER NETWORKS LAB Credits : 4 Experiments Using Routers and Switches 1.literature survey. Each student along with other team members and under the supervision of a faculty member should identify a problem for the final year project.Crimping. Practice Experiments Familiarization of different Network Cables. A seminar report should be prepared and submitted.708 L-T-P: 0 – 0 – 4 SEMINAR / PROJECT DESIGN Credits : 4 Each student should present a seminar of 30 minutes duration on any one of the emerging topics in Information Technology. It should be based on the core subjects of the discipline and could involve software and/or hardware implementation. The seminars should preferably be based on research papers from reputed journals and should be done under the guidance of a faculty member of the department. Implement inter-VLAN routing Backup and recovery of configuration files of a router using TFTP server. 8.B. 6. An evaluation should be conducted at the end of the semester. Basic router configuration.Color coding . 08. 4. the relative weightage of the seminar and the project design will be 1:1. 5. VTP pruning. 9.Tech Information Technology. design etc.should be carried out in this semester. 3. 2. 7. Familiarization of Wireless Access Point. Implementing static routing. 10. 69 . . The preliminary work for the project . Implementing dynamic routing using RIP Implementing dynamic routing using OSPF Implementing dynamic routing using EIGRP Basic switch configuration VLAN configuration VTP. Access Control List (Standard and Extended) Configuring PPP. For awarding internal marks. University of Kerala 08. 12.

Introduction to wireless sensor networks.IEEE 802. DVB. Wireless LAN – IEEE 802. Wireless Transmission – Frequencies for radio transmission. GPRS. Signals.801 L-T-P: 3 – 1 – 0 MOBILE COMPUTING Credits: 4 MODULE I (17 hours) Introduction . Signal Propagation. Modulations.Traditional TCP. Parameters and Configurations. WAP.Jochen Schiller. WWW.Tech Information Technology. WAP 2.5/3G wireless networks. UMTS and IMT-2000 . TCP over 2.Basics. FDMA. Antennas.William Stallings. Mobile Transport Layer . Cellular Wireless Networks. MODULE III (18 hours) Mobile Network Layer . Classical TCP improvements. Support for mobility – File Systems. Wireless Communications and Networks . Broadcast Systems – DAB.11b. MODULE II (17 hours) Satellite Networks .11 . University of Kerala SEMESTER VIII 08. CDMA. Multiplexing. Spread spectrum.0.11a – 802. Capacity Allocation – FAMA and DAMA. HIPERLAN – Blue Tooth. i-mode. DECT. TDMA.B. Pearson Education 70 .Mobile IP. Mobile ad-hoc networks. Text Books: 1 1. Medium Access Control – SDMA. TETRA. Pearson Education 2. Telecommunication systems – GSM. Second Edition. Mobile Communications . SyncML. Dynamic Host Configuration Protocol.

B2C and B2B models .Types of electronic payment media .advantages and disadvantages .Electronic Funds Transfer .802 L-T-P: 3 – 0 – 0 E-COMMERCE Credits: 3 MODULE I (13 hours) Definition and scope of e-commerce .Choosing an ISP .Hosting a web site .Tech Information Technology. Text Books : 1 1.Customer service .Extranets and Supply Chain Management .Warranties .B. Jaworski.Online gambling .E-wallet . Jeffrey F. Tata McGraw-Hill Edition.Requirements for internet-based payments .Web portals and web services . Elias M. Electronic Commerce . MODULE III (13 hours) Ethical issues .M-commerce and e-payment. 71 .Intellectual Property Rights.Strategy making in online environment .Internet marketing .Website evaluation and usability testing. Basic Technology . Pearson Education 2008. Payment systems . 2.Legal issues . Introduction to E-commerce. Business models in e-commerce .E-cash .Electronic Data Interchange.Advantages and constraints . 2nd Edition. 2008.Planning an intranet . 3rdEdition.Framework for e-commerce.B2B and e-payment .Mobile commerce .SCM and B2B . MODULE II (13 hours) Market opportunity analysis .From Vision to Fulfillment.Branding.Smart cards .Taxation .Electronic money .International issues . University of Kerala 08.Intranets and extranets .Copyrights and trademarks .Tracking customers . Rayport and Bernard J.Credit cards . Awad.

PKI : Implementing and Managing E Security . Principles of Information Security . Shari Lawrence Pfleeger. Database Security. MODULE I (14 hours) Protection in general purpose Operating Systems.803 L-T-P: 2 – 1 – 0 E-SECURITY Credits: 3 MODULE I (12 hours) Security in Computing. University of Kerala 08. Herbert J. Elementary Cryptography.Andrew Nash. Reference : 1. Course Technology 1 Cengage Learning 2008.Tech Information Technology. 72 . Whitman. Privacy and Ethical issues in Computer security. 2. Administering Security. Program Security. Bill Duane. Mattord.B. Legal.Charles P Pfleeger. Derek Brink.Michael E. Designing trusted Operating Systems. MODULE I (13 hours) Security in Networks. Pearson Education. Text Book : Security in Computing . McGraw Hill.

Wiley 4.test reports Integration test reports – System Test report – acceptance test report .Louise Tamres. Tools and Techniques .final test reporting – test status report . Techniques and Tools . Software Testing.benchmarking. 50 Specific Ways to Improve Your Testing .guidelines for writing and using test report . TMHB 2.Glenford J.Tech Information Technology.Effective methods.Test Estimation – Test standards – Building Test data and Test cases Test Scenario – Test Scripts .M G Limaye. Text Books : 1.Developing Testing methodologies – Levels of Testing – Acceptance Testing – Special Tests – Testing Tools. Wiley 3. Introducing Software Testing . University of Kerala 08. Myers. Pradeep Oak.Fundamentals of Software Testing – Principles of Software Testing – Structured approach to Testing . MODULE II (13 hours) Test planning . MODULE III (13 hours) Test metrics and Test reports – categories of the product/project test metrics – Resources consumed in Testing – Effectiveness of testing – defect density – defect leakage ratio – residual defect density – test team efficiency – test case efficiency . Software Testing Fundamentals Methods and Metrics -Marnie L Hutcheson. Pearson 1 References : 1.Test strategy – Test plan templates (System testing) – Guidelines for developing test plan .B.Tools used to build test data – testing object oriented software – Testing web applications. Effective Software Testing. Principles . The Art of Software Testing .Renu Rajani.Elfriede Dustin Pearson 73 . TMH 2. Software Testing .804 L-T-P: 2 – 1 – 0 SOFTWARE TESTING Credits: 3 MODULE I (13 hours) Characteristics of Software – Software Development process – Software quality Management – Processes related to software quality .

Microprocessors Theory & Applications: Intel & Motorola – Revised Edition by M. Core Duo. Motorola's G4e: The Back End.P.Superscalar Execution .B. Inside the Machine. Motorola's G4e:Approaches and Design Philosophies. Text Books : 1.Understanding Caching and Performance-Intel's Pentium M. and Core 2 Duo.The G5: IBM's PowerPC 970. MODULE II (17 hours) Pipelined Execution . 74 . No Starch Press 2006.805A L-T-P: 4 – 0 – 0 ADVANCED MICROPROCESSORS Credits : 4 MODULE I (17 hours) Intel 8085 – Introduction-Addressing modes .Intel's Pentium 4 vs.Jon Stokes. PowerPC Processors: 600 Series. MODULE III (18 hours) 64-Bit Computing and x86-64 .CPU pins & associated signals .Assembly Language Programming.Instruction set – Input Output – Interrupts – Design . Intel's Pentium 4 vs. The Mechanics of Program Execution. PHI. University of Kerala 08.Instruction set .The Intel Pentium and Pentium Pro .Interrupt Systems – Assembly Language Programming Intel 8086 – Architecture . and 7400 .Tech Information Technology. 2.Addressing modes . Rafiquzzaman. 700 Series. An Illustrated Introduction to Microprocessors and Computer Architecture .

Output processing timer management. E. flow control and adaptive retransmission. L Stevens. The structure of TCP /IP software in an operating system. Routing table and Routing algorithm. PHI. Software organization. Multi cast processing. MODULE III (17 hours) Socket level interface. Urgent data processing and the push function.B. Route propagation with an SPF algorithm. Active Route propagation and Passive acquisition. Comer and D.Data structures and Input processing. Network interface layer. Implementation and Internals. Fragmentation and reusability of datagrams. 75 .Tech Information Technology. TCP. Finite state machine implementation. Error processing. D. University of Kerala 08. 1 Text Books : Internetworking with TCP / IP . MODULE II (17 hours) User datagrams. Design. Address Recovery and binding global.Volume II.805B L-T-P: 4 – 0 – 0 NETWORK PROGRAMMING Credits: 4 MODULE I (18 hours) Internet Protocol.

trees with directed edges. Graph Theory – Frank Harara. Graphs in switching and coding theory – contact networks. pendent vertex. pendent vertex. Analysis of contact Networks. 1 2. Distance and centres . University of Kerala 08. Euler graphs. vector spaces of graph.Rooted and binary tree. spanning tree. Different representation of planar graphs. spanning trees. combinatorial dual. 76 . MODULE III18 hours) Graph theoretic algorithms and computer programming . ban2 vectors of a graph. Narosa Publishers. Graph Theory – Narasingh Deo. Paths and circuits – Isomorphism. disconnected graphs. Graphs Theory Applications – L. Text Books : 1. A First Look at Graph Theory – John Clark and Derek Allan Hotton. 2. Hamiltonian paths and circuits – Travelling salesman problem. Isomorphism. Trees – properties. shortest path.R. counting trees.805(4) of CSE) L-T-P: 4-0-0 Credits: 4 MODULE I (16 hours) What is graph – Application of graphs – finite and infinite graphs – Incidence and Degree – Isolated vertex.Algorithm for computer representation of a graph. Null graph. Allied. Foulds. Digraphs and binary relation. searching the graphs. sub graphs. unit cube and its graph. Reference Books : 1. orthogonal vectors and spaces Directed graphs – types of digraphs.B. directed circuits. sequential switching networks. synthesis of contact networks. graphs in coding theory. Connected graphs.Tech Information Technology. PHI. MODULE II(18 hours) Combinatorial versus geometric graphs. Euler graphs. algorithm for connectedness and components. geometric dual. Planar graphs. paths and circuits. walks.805C GRAPH THEORY (Common with 08. Narosa Publishers.

Supervised LearningPerceptrons. James A Freeman & David M Skapura. References : 1 1. 5. 4.B. Fuzzy Logic & Genetic Algorithms. MODULE II(18 hours) Fuzzy Set Theory – Basic Definition and terminology. David E Goldberg. Pearson. University of Kerala 08. PHI. Fuzzy Logic controlled Genetic Algorithm. Fuzzy Union. Membership functions. Fuzzy Engineering. John Yen & Reza Langari. 2. Hybrid Approach. Hybrid Learning Rule.Different Architectures. Fuzzy Logic. Text Book : Neural Networks. Neural networks. Pearson. GA based Fuzzy Model Identification. PHI. C T Lin & C S G Lee. Neuro-Fuzzy Modelling. Bart KoskO. Simon Haykins. Fuzzy Assocaitive Memories. Basic Concepts of Fuzzy Logic. S A Vijayalekshmi Pai. 7. PHI 2003. Neurofuzzy and Soft Computing. Back-propagation Multilayer Perceptrons. Genetic Modelling. and Complement. Neural Networks. Neural Fuzzy Systems. control. Design issues in Genetic Algorithm. S Rajasekharan. Genetic Algorithm with Conventional Artificial Intelligence(hard computing) Neural Networks. 77 . C T Sun. MODULE III(18 hours) Genetic Algorithm – Basics of Genetic Algorithms. Genetic Algorithms.Tech Information Technology. Set Theoretic Operators. 3. Fuzzy Logic. 6. PHI / Pearson. Fuzzy Inference SystemsMamdani and Sugeno Fuzzy models. E Mizutani. Pearson.formulation and parameterization. Unsupervised Learning – Competitive Learning Network.Genetic Hybrids & Fuzzy – Genetic Hybrids. Fuzzy Rules and Fuzzy Reasoning. Intelligence. Back-propagation Algorithm. Intersection. and Information. Neuro. J S R Jang.806A L-T-P: 4 – 0 – 0 SOFT COMPUTING Credits: 4 MODULE I (17 hours) Comparison of Soft Computing Methods -Neural networks. PHI 1997.

Text Books: 1 Distributed Systems: Concepts and Design – George Coulouris. University of Kerala 08.Transactions and concurrency control: Transactions. Distributed Systems and Computer Networks – Morris Solomon and Jeff Krammer. Pearson Education 2.B. Jean Dollimore and Tim Kindberg. Pearson Education References: 1. System models: Architectural models and fundamental models. nested transactions-locks-optimistic concurrency control. PHI 78 . Distributed Systems: Principles and Paradigms – Andrew S Tanenbaum and Maarten Van Steen. MODULE III(18 hours) Operating system support: Operating system layer – protection – processes and threadscommunication and invocation – Operating system architecture. Replication : System model and group Communication. Distributed objects and remote invocation: communication between distributed objects – remote procedure call – Events and notification. Distributed file system: File service architecture – Sun network file system.806B L-T-P: 4 – 0 – 0 DISTRIBUTED SYSTEMS Credits:4 MODULE I (17 hours) Characteristics of distributed System: Examples of distributed systems – resource sharing and web – world wide web – issues in the design of distributed system. Networking and internetworking: Types of network – network principles – Internet protocols MODULE II(17 hours) Interprocess communication : the API for Internet protocol – external data representation and Marshalling – client server communication .Tech Information Technology.group communication-Case study: inter process communication in Unix.

Deitel & Deitel.Using UDDI and WSDL together. University of Kerala 08.806C L-T-P: 4 – 0 – 0 WEB SERVICES Credits: 4 MODULE I (18 hours) Introduction to web services .Element groups . .Data types and messages .Extensions and restrictions .Modular schemas .V. Keith Ballinger.Namespaces Qualification .Defining a web service interface .Types .SOAP transports. 79 . PHI 2002. Tata McGraw Hill 2009. Universal Directory and Discovery Interface . Text Books : 1 1.Defining a web service implementation . Web Services . Kumar. Pearson Education 2002. B.An Introduction. C# How to Program. 2. XML in Action : Web Technology. XML schema Basic elements and attributes . 4.Global declarations . MODULE II (17 hours) Simple Object Access Protocol . Pardi.UDDI publish interface . 3.Substitution groups .UDDI inquiry interface .Occurrence constraints . Pearson Education 2003. S.NET Web Services Architecture & Implementation.SOAP messages .SOAP message exchange model .Importing types.How web services work.SOAP data types . MODULE III (17 hours) Web Services Description Language .V.Message patterns.Benefits of web services .UDDI registries .Tech Information Technology. Subrahmanya.B.SOAP encoding and XML schemas .

respectively. Implementing and deploying web applications using Servlets. 5. 08. 3. Retrieval of data from database using SQL and exchange of information in XML format. 4.Tech Information Technology. HTML and JSPs. Testing the application on an Application Server. The student has to submit a thesis in the prescribed format. The work can be carried out in the department under the supervision of a faculty member or with the help of an external organization. There should be a mid-semester and end-semester evaluation of the project. In the latter case.807 L-T-P: 0 – 0 – 4 WEB APPLICATIONS LAB Credits: 4 1. the motivation of the organizations should be purely academic and they should provide an external guide whose qualifications should be on par with that of a faculty member. duly certified by the internal guide and external guide( if any). of the 80 . An internal guide will be consistently interacting with the external guide and monitoring the progress of the project. In the viva voce. Developing applications in a team environment. Debugging Web applications locally and remotely.808 L-T-P: 0 – 0 – 4 PROJECT & VIVA VOCE Credits: 4 The project should be based on the core subjects of the discipline. The distribution marks will be in the ratio 2:1:2. the seminar presented and the knowledge of the courses in the whole curriculum.B. University of Kerala 08. the student's performance will be evaluated based on the project work. 2.

You're Reading a Free Preview

/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->