This action might not be possible to undo. Are you sure you want to continue?
B. Tech Degree Course In Information Technology
Scheme and Syllabus
B.Tech Information Technology, University of Kerala
UNIVERSITY OF KERALA B.Tech Degree Course – 2008 Scheme REGULATIONS
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.
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. D.Tech Information Technology.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. Drawing & Practical) The scheme of valuation will be decided by the chief examiner for theory / drawing subjects For practical examinations.A+. 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.5 6 5.A + U. All letter grades except ‘F’ will be awarded if the marks for the University examination is 40 % or above and the total mark (C. B+. based on the total marks obtained by the student in the University examination and Continuous assessment put together a letter grade (S. The evaluation of the candidate should be as per the guidelines given in the syllabus for the practical subject.A marks + University Exam mark) is 50 % or above.E) or below 40 % for U. This provision is allowed only once for a semester. B. The condonation shall be granted subject to the rules and procedures prescribed by the university from time to time.B. No absolute mark will be indicated in the grade card. C+. The shortage shall not be condoned more than twice during the entire course g. E and F) will be awarded.5 0 Point Remarks Excellent Failed 3 . Letter grade corresponding to total marks (C.E only Letter Grade S A+ A B+ B C+ C D E F Grade (G. Letter Grades For each subject in a semester. University of Kerala iv) v) vi) vii) d. % of Total marks (C.5 8 7.P) 10 9 8. 6. The attendance shall not be less than 60% of the total working periods e. The condonation for combined 1st and 2 nd semesters will be reckoned as a single condonation for attendance purposes.5 7 6. C. the examiners together will decide the marks to be awarded. A. The university will conduct examinations for all subjects (Theory. h. The student shall produce the certified record of the work done in the laboratory during the examination.
A. 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. GPA for a particular semester is calculated as per the calculation shown below.5 GPA with a minimum of ‘E’ grade for the all individual subject in that semester. The candidate shall be permitted to improve the examination only along with next available chance. A candidate shall be declared to have passed in an individual subject of a semester examination if he/she secures grade ‘E’ or above. 8. marks already obtained. In addition to the grade cards for each semester all successful candidate shall also be issued a consolidated statement grades. 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. 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. 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. On specific request from a candidate and after remitting the prescribed fees the University shall issue detailed mark to the individual candidate. CGPA is calculated in a 10-point scale as shown below. University of Kerala 7. CGPA Credits for semester GPA obtained for the semester credits for the semester GPA and CGPA shall be rounded to two decimal points. d. 9. b. c.B.Tech Information Technology. 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. subject to the following conditions 4 . 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. letter grades obtained. The Grade card issued to the students shall contain subject number and subject name. Minimum for a pass a. The candidate shall not be allowed to appear for an improvement examination for the subjects of the VII & VIII semesters c. 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. GPA for the semester and CGPA up to that particular semester. credits for the subject. b.
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.Tech Information Technology. Revision of Regulations The university may from time to time revise. The students may undertake one educational tour preferably after fourth semester of the course and submit a tour report b. b. Educational Tour a.5 CGPA up to and including eighth semester shall be declared to have passed the B. 10. The tour period shall be considered as part of the working periods of a semester 12. 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. He/she shall not combine this course work with his/her regular course work c. combined with the vacation / holidays if required.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.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. c. will have effect from the beginning of the academic year / semester following the notification of the University 5 .Tech degree examination in FIRST CLASS. All other successful candidates shall be declared to have passed the B. He/she shall repeat the course work in a particular semester only once and that too at the earliest opportunity offered to him/her. scheme of examinations and syllabi. curriculum. The tour may be conducted during the vacation / holidays taking not more than 5 working days. Total number of Tour days shall not exceed 15 days.B. amend or change the regulations. Students who pass the examination in supplementary examination are also covered under this clause ii) iii) iv) 11. The C.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. University of Kerala a. 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. These changes unless specified otherwise.
B.Tech Information Technology, University of Kerala
B.Tech Information Technology, University of Kerala
SCHEME OF STUDIES AND EXAMINATION FOR B. TECH DEGREE - 2008 ADMISSION COMBINED I AND II SEMESTERS (COMMON FOR ALL BRANCHES)
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
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
701 08.703 08.706 08.801 08.806 08.702 08.707 08.705 08.805 08.803 08.B.802 08. University of Kerala SEMESTER VII Course Code 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 .804 08.Tech Information Technology.704 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.807 08.
705(4) of CSE) A B C Elective III (08.805) Advanced Microprocessors Network Programming Graph Theory (Common with 08.704(3) of CSE) A B C Elective II (08.B.706) Computer Peripherals and Interfacing Optimization Techniques Data Mining Techniques (Common with 08.705) Design and Analysis of Algorithms Simulation and Modelling Principles of Programming Languages Communicative English & Technical Writing (Common with 08.Tech Information Technology.806) A B C Soft Computing Distributed Systems Web Services 11 .805(4) of CSE) Elective IV (08. University of Kerala A B C D Elective I (08.
Wiley Eastern. unit impulse function and periodic functions-second shifiting theorem.differentiation of vector functions-Velocity and acceleration. University of Kerala 08.S.Application to orthogonal trajectories (cartisian form only).Euler’s theorem on homogeneous functions.101 ENGINEERING MATHEMATICS.Eigen values and eigen vectors – Properties of eigen values and eigen vectors. Higher Engineering Mathematics.Ramana. 2006 5. Advanced Engineering Mathematics.Convolution theorem(without proof)-Transforms of unit step function.Errors and approximations. Sureshan J. Michel D Greenberg. B.DiagonalisationQuadratic forms.Equivalent matrices.Inverse of a matrix by gauss-Jordan method.Irrotational and solenoidal fields – Scalar potential.Linear differential eqations with constant coefficients.Radius of curvature.Scalar and vector functions.V.Taylor’s series (one and two variables) .Divergence. Peter O’ Neil . 8th edition.GradientPhysical interpretation of gradient. Zenith Publications 12 .Solution of ordinary differential equations with constant coefficients using Laplace transforms.Curl.Directional derivative.B.Total derivatives.Jacobians.Cayley Hamilton theorem(no proof).Cauchy and Legendre equations – Simultaneous linear equations with constant coefficients.Leibnitz’ Theorem(without proof).Scalar and vector fields. Tata Mc Graw Hill.Linear dependence and independence of vectors.1 Applications of differentiation:– Definition of Hyperbolic functions and their derivativesSuccessive differentiation. REFERENCES 1.centre of curvature.Transform functions multiplied by t and divided by t . Kreyszig.Solution of a system linear equations-Non homogeneous and homogeneous equations.Operator . Nazarudeen and Royson.Transforms of elementary functions . Khanna Publishers 4. Advanced Engineering Mathematics.Transforms of derivatives and integrals.I L-T-P : 2-1-0 Credits: 6 MODULE. MODULE-III Matrices:-Rank of a matrix.Consistency.Reduction to canonical forms-Nature of quadratic formsDefiniteness.polar and parametric forms) Partial differentiation and applications:. Differential Equations and Applications:.Elementary transformations.rank. Higher Engineering Mathematics. Vector differentiation and applications :. MODULE-II Laplace transforms:.Leibnitz rule on differentiation under integral sign.Method of variation of parameters .Identities involving (no proof) .Grewal . Engineering Mathematics I.Pearson International 6.Partial derivatives.Tech Information Technology. Thomson 3.Curvature. 2.Maxima and minima of functions of two variables Lagrange’s method. B.Inverse transforms. Advanced Engineering Mathematics.shifting property.Echelon form and normal form.Evolute ( Cartesian .signature and index.
Harmonic waves. body centered cubic and face centered cubic crystals. 13 . Unit cell and lattice parameters. Uncertainty principle. Simultaneity. MODULE – III Quantum Mechanics : Dual nature of matter. Einstein’s postulates. Resolving power of telescope and microscope. Diffraction of Light : Fresnel and Fraunhofer diffraction. Three dimensional waves . One dimensional waves – Differential Equation. Poynting’s theorem (qualitative only) Physics of Solids: Space lattice. Time dilation. Interference filters. MODULE.102 ENGINEERING PHYSICS L-T-P : 2-1. Michelson’s interferometer. Free electrons in a metal as a Fermi gas. Prediction of electromagnetic waves. curl and their physical significance. Type-I and Type-II superconductors. BoseEinstein and Fermi-Dirac statistics. Derivation of Planck’s formula. Mass energy relation. Double refraction. Density of states.Tech Information Technology. Antireflection coating. div.II Interference of Light: Concept of temporal and spatial coherence. Eigen values and functions. Bosons and Fermions. Nano materials. Wave function. Photo elasticity – isoclinic and isochromatic fringes – photo elastic bench Special Theory of Relativity: Michelson-Morley experiment. Polaroids. Lorentz transformation equations (no derivation). Newton’s rings. Energy and momentum operators. Plane transmission grating. Deduction of Maxwell’s equations. Production and analysis of circularly and elliptically polarized light. Theory of forced harmonic oscillations and resonance. Interplanar spacing in terms of Miller indices. Bio materials.0 Credits: 6 MODULE-I Oscillations and Waves : Basic ideas of harmonic oscillations – Differential equation of a SHM and its solution. Rayleigh’s criterion for resolution. Nicol Prism. Transverse nature of electromagnetic waves. Relativistic mass. Resolving power of grating. Fermi energy. Theory of damped harmonic oscillations. Theory of plane. Types of waves. Coordination number and packing factor with reference to simple cubic. Bragg’s law.Meissner effect. Concept of displacement current. Super conductivity . Introduction to new materials (qualitative) -Metallic glasses. Phase space. Shape memory alloys. Tunnelling (qualitative). Grating equation. Induced birefringence. High temperature superconductors. Fraunhofer diffraction at a single slit. Time Dependent and Time Independent Schrodinger equations. Fraunhofer diffraction at a circular aperture (qualitative). Expectation values. Statistical Mechanics : Macrostates and Microstates. University of Kerala 08. circular and elliptically polarized light. Crystal systems. Length contraction. Plane waves and spherical waves. E and H are at right angles. X-ray diffraction. BCS theory (qualitative). Determination of wave length and thickness. Mass less particle. Velocity addition.Differential Equation and solution. Distribution equations in the three cases (no derivation). Directions and planes. Basic postulates of Maxwell-Boltzmann. Quality factor. Applications of superconductors. Interference in thin films and wedge shaped films. Electromagnetic Theory :Del operator – grad.B. Velocity of transverse waves along a stretched string. Miller indices. Polarization of Light : Types of polarized light. Energy in wave motion. Particle in one dimensional box. Retardation plates.
. J. Mark Ratner& Daniel Ratner. III Edn. Holography. Types of optical fibers.B. Pearson 9. Solid State Physics.. Computer stimulation – superposition of waves. University Physics. (Gauss’ law & Ampere’s law) Pattern of Question Paper University examination is for a maximum of 100 marks. Optical resonant cavity. Pearson 6. Richard L Libboff. Introduction to Electrodynamics. T. Optics. Donald A Mcquarrie. Mechanics. Introduction to Optics. II Edn. Applications. University of Kerala Laser: Einstein’s coefficients. Nanotechnology. . S O Pillai. REFERENCE: 1. David J Griffiths. Spectrometer – Plane transmission grating – wavelength of light. 5. Michelson’s interferometer – Wavelength of light. Air Wedge – Diameter of a thin wire 3. this part contains 3 questions out of which 2 are to be answered. Spectrometer – Refractive indices of calcite for the ordinary and extraordinary rays. Chris D Zafiratos & Michael A Dubson.. Population inversion and stimulated emission.. Advanced Engineering Physics . Laser – Diffraction at a narrow slit.Tech Information Technology. Modern Physics for Scientists and Engineers. Semiconductor Laser (qualitative). Frank & Leno. Robert Resnick . ********* 14 . Pearson 3.C. Newton’s Rings – Determination of wave length. Upadhyaya. The syllabus is spread in 3 modules. Eugene Hecht. Computer stimulation – study of E & H. 8. III Edn. Sears & Zemansky . in 3 hour duration. Michelson’s interferometer – Thickness of thin transparent film. Pearson 2. Helium-Neon Laser. 11. Phasor Books. Laser – Diffraction at a straight wire or circular aperture.. 9. This part contains 10 questions without any choice.. Hassan et al. IV Edn. Polarization by reflection – Brewster’s law. Elementary Solid State Physics. Part B contains long answer questions for 60 marks.. Pearson 5. IV Edn. Premlet. Pearson 11. Trivandrum 14.. 10.. Ruby Laser. 7. Ram Prasad & Sons 4. John Willey and Sons 10. Vivo Books 12. 6. Aswathy Publishers. Carbon dioxide Laser (qualitative).. each of 10 marks. each of 4 marks (uniformly taken from all modules). Part A contains short answer questions for 40 marks. Introduction to Special Relativity. John R Taylor.Numerical Aperture and acceptance angle. The question paper will consist of two parts (A and B). 13. Fiber Optics . LIST OF DEMONSTRATION EXPERIMENTS 1. B.A. M Ali Omar. Introduction to Quantum Mechanics. Kollam. A Text Book of Engineering Physics. 4. New Age International Publishers 7. From each module. Statistical Mechanics. XI Edn. Prentice Hall of India 8. Long answer questions from all the 3 modules will form 60 marks. 2.
Air pollution.Waste water treatment. Injection.Estimation of hardness. Bakelite.Helmotz double layer.Quinhydron electrode-Determination of PH using these electrodes.Thermoplastics and thermosetting plasticsCompounding of plastics-Moulding techniques of plastics (Compression.B.Gas chromatography.Concentration cells. PMMA. Stress corrosion.Electrodes.Fuel cells.Domestic water treatment. PET.Molecular energy levels-Types of molecular spectra. cationic. spin-spin splitting) (6hrs) Chromatography. (2hrs) MODULE-III Polymers. chemical shift. PVA.103 ENGINEERING CHEMISTRY L-T-T : 2-1-0 Credits: 6 MODULE-1 Electrochemistry .Reference electrodes. (12hrs) Corrosion and its control.Degree of hardness.Galvanic series.Sludge and scales in boilers.Biodegradable plastics.Tech Information Technology.Priming and foaming.Mechanism of polymarisation (Addition. phosphate and calgon conditioning).Boiler corrosion-Water softening methods.Standared hydrogen electrode.by EDTA method.Origin of electrode potential.Theories of corrosion (chemical corrosion and electrochemical corrosion).paint (4hrs) Nano materials.CFCs and ozone depletionAlternative refrigerents-Green house effect-Water pollution.Lead acid cell.Electronic spectra (Classification of electronic transitions. anionic and coordination polymarisation). NMR spectra (Basic principle.Electrode potential.Types of hardness.Anaerobic and USAB processes. free radical.Types of corrosion (Concentration cell corrosion. oxidation reduction and precipitation titrations). cathodic protection). Elastomers. . (12hrs) Envirnmental damages and prevention.Aerobic .Coductometric and Potentiometric titrations (acid base. University of Kerala 08.Introduction-Classification-preparation (laser abrasion technique and sputtering technique).synthetic rubbers (Buna-S.Beer Lamberts law.Chemical method (reduction)-Properties and Applications of nano materials-Nano tubes-Nano wires. properties and uses of PVC.Nickel cadmium cell. Vibrational spectra (mechanism of interaction and application). Transfer and Extrusion moulding)-Preparation. (5hrs) Protective coatings. Rotational spectra (Determination of bond length and application). (4hrs) MODULE-II Water treatment.Classifications.General principles. (2hrs) Spectroscopy.Chemical conversion coatings. (3hrs) Thermal methods of analysis-Basic principles involved in Thermo gravimetry.structure of natural rubber.Factors affecting corrosion (nature of metal and nature of environment) and different methods of corrosion control (corrosion inhibitors.Related problems.Nernst equation and application.Metallic coatings. electro dialysis. Butyl rubber and Neoprene) (12hrs) 15 .Silicon polymers. Ion exchange methods-Internal treatments (colloidal.Secondary cells. Nylon. Differential thermal analysis and applications. Lime-soda process.BOD and COD.Lithium-ion cell.Distillation).High performance liquid chromatography.Methods of disinfection of water-Desalination process (Reverse osmosis. carbonate.vulcanisation. Urea formaldehyde resin. Galvanic corrosion) .Saturated calomel electrode.
H. Determination of flash and fire point of a lubricating oil by Pensky Marten’s Potentiometric titrations. Material Science and engineering. Engineering Chemistry. 12. 7. Gopalan. 4. 12. 5.solid and liquid lubricant. REFERENCES H. Preparation of buffers and standardisation of PH meter. A text book of physical chemistry P. Chemistry of liquid crystals S.R. 10. Estimation of dissolved oxygen. 9. 7.A.Bio fuels -Bio hydrogen and Bio-diesel (5hrs) Lubricants. 16 . 6. Ane Students Edition.K. Van Vlack . Rajaram .Introduction-Mechanism of lubrication. 10. Environmental Chemistry K. 6. Jain.Glasstone .Calorific value. Determinations of PH using glass electrode and quinhydron electrode. apparatus. Determination of molarity of HCl solution PH-metrically. Polymer science B. A first course L. Elements of Material science and Engineering J. Chemistry of Engineering and Technology volume I & II 15. Estimation of iron in a sample of heamatite. 8. Engineering Chemistry Shashi Chawla .Raghavan. Gowariker .Klauhunde. Nagarajan .N Goyal and Harmendra Goeal.Manufacture of Portland cement. 5. (4hrs) Cement. (2hrs) Fuels.C. Estimation of total hardness in water using EDTA.B. 8. University of Kerala Organo electronic compounds -Super conducting and conducting organic materials like Polyaniline.W.C. 2. D.Properties of lubricants-Viscosity index. 2. Estimation of copper in brass. 9. Engineering Chemistry J. R. 11.flash and fire point.Venkappayya & S.W. Dean .Goodby . Kuriakose and J. A text book of Engineering Chemistry R.Gonser .J.L. polyacetylene and [polypyrrol and its applications.Tech Information Technology. Estimation of COD in sewage water. 11.HCV and LCV-Experimental determination of calorific valueTheoretical calculation of calorific value by Dulongs formula . Thiruvananthapuram 1. L. Modern materials V. Merrit and J. Estimation of available chlorine in bleaching powder.aniline value. 13. 3. Instrumental methods of analysis A. 4. De . Nanoscale materials in chemistry B. 14.A. Willard. 3.cloud and pour point.Theory of setting and hardening of cement (2hrs) LAB-EXPERIMENTS (DEMONSTRATION ONLY) 1. Engineering Chemistry Juhaina Ahad . Estimation of chloride ions in domestic water.
Venugopal . Engineering Drawing 7. Engineering Graphics 17 . Various Soft wares for CAD. frustum of solids and also their combinations. (Only cases where the axes are perpendicular to each other and intersecting with or without offset. Module -II 2 x 17 = 34 Module III 2 x 17 = 34 Total (32+34+34 =100) REFERENCES 1. pyramids. cone sphere. Archimedian spiral. tetrahedron. K. pyramids.Module -I 2 x 16 = 32. K. section of simple solids cut by parallel. Anil Kumar. lettering. Perspective projection of simple solids like prisms and pyramids in simple positions. MODULE III Isometric Projection : Isometric scale. Principles of Orthographic projection. Isometric view and projections of simple solids like prisms. Their projections and true shape of cut sections. Thamaraselvi.S. perpendicular and inclined cutting planes. cylinder and cone (ii) Cut regular solids. Engineering Graphics 5.) Perspective Projection : Principles of perspective projection. octahedron. abscissa and the transverse axis (iii) given the asymptotes and a point on the curve.N. cylinder. Logarithmic spiral and Helix. cone. Demonstration of any one CAD software. Students are required to answer any two questions from each module. Engineering Drawing 3. Development of Surfaces: Development of surfaces of (i) simple solids like prisms.R. K. Engineering Graphics 9. Benefits of CAD. except from CAD. Engineering Graphics 6. (1 sheet practice) MODULE I Plain Curves: Conic sections by eccentricity method. (i) Cylinder and cylinder (ii) Prism and prism.104 ENGINEERING GRAPHICS L. CAD: Introduction to CAD systems. D. Gopalakrishnan. Epicycloid and Hypocycloid.T-D : 1-0-2 CREDITS: 6 Introduction to technical drawing and its language. symbols and drawing instruments. definition of perspective terminology. Construction of hyperbola (i) Arc of circles method (ii) given ordinate.I. Intersection of Surfaces : Intersection of surfaces of two solids as given below.B. General Note: (i) First angle projection to be followed (ii) Question paper shall contain 3 questions from each module. Construction of Tangent and Normal at any point on these curves Projection of Points and lines: Types of projections. Determination of true length. Engineering Drawing and Graphics 4. K.Tech Information Technology. dimensioning. Fundamentals of Engineering Drawing 2. cylinder. N. Lines. inclination with planes of projection and traces of lines. MODULE II Projection of Solids: Projection of simple solids such as prisms. pyramids. (iii) Cone and Cylinder. Luzadder and Duff . Bhatt . Gill. P. Construction of ellipse: (i) Arc of circles method (ii) Rectangle method (ii) Concentric circles method. Projections of points and lines. Selection of Solids: Types of cutting planes. John. P. Varghese. Construction of Tangent and Normal at any point on these curves Miscellaneous Curves: Construction of Cycloid. scaling of figures. University of Kerala 08. (iii) Distribution of marks . Involute of a circle. sphere and their auxiliary projections.C. Engineering Drawing 8. Construction of parabola (i) Rectangle method (ii) Tangent method.
couple. Kumar K. Tayal A K.Mass moment of inertia of rings. solid discs and solid spheres (no derivations required)Angular momentum-Angular impulse.Varignon’s theorem.Radius of Gyrationmoment of inertia of composite areas. Pearson Education. & Sankarasubramanian G. 3. 1966. 7. H.L. 18 . REFERENCES: 1. 2. 2003.centroid of composite areas. method of resolution. equations of equilibrium. Beer & Johnston. Simple harmonic motion – vibration of mechanical systems .types of loading. Tata McGraw Hill Publishing Company Limited..Moment of a force.2004 8.Lami’s theorem.. Rajasekaran S.basic concepts-analysis of different types of problems Kinetics- Newton’s laws of translatory motion. “Vector Mechanics for Engineers – Statics and Dynamics”. “Mechanics of Solids”. Mc-Graw Hill –International Edition 4.Resultant and Equilibrant of coplanar concurrent force systems-various analytical methods. Kollam. Delhi. 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. Friction-Laws of friction-angle of friction. 2008 Note: Question For University Examination:.2007 5... Forces in space. Shames.D’Alembert’s principle in curvilinear motion. New Delhi.Tech Information Technology. Timoshenko S. Prentice Hall Book Company. Collision of elastic bodies-Law of conservation of momentum-Direct and oblique impact between elastic bodies and impact with fixed plane. Equilibrium of rigid bodies-free body diagrams.principle of transmissibility of a force. motion of connecting rod and piston. H.105 L-T-P: 2 .Theorems of Pappus-GouldinusMoment of inertia of areas. Umesh Publications. 2005.basic elements of a vibrating system – spring mass model – undamped free vibrations – angular free vibration – simple pendulum. Pentex Book Publishers and Distributors.types of beams . MODULE III (20 HRS) Work.Part A – 8 compulsory questions covering entire syllabus. Vikas Publishing House Private Limited. Popov.ladder friction. Parallel and perpendicular axes theorems. motion of link.D’Alembert’s principle. (5 x 8 = 40) Part B – Three questions of 10 marks from each module. 6. 5 marks each. out of which two should be answered (10 x 2 x 3 = 60).Statics and Dynamics” . MODULE II (20 HRS) Properties of surfaces..Conditions of equilibrium. “Engineering Mechanics”.wedge friction. Benjamin J.Motion of lift. Relative velocity . “Engineering Mechanics”.Conditions of equilibrium. Curvilinear motion. Kinetics of rigid bodies under combined translatory and rotational motion – work – energy principle for rigid bodies.composition and resolution. University of Kerala 08. “Engineering Mechanics”. “Engineering Mechanics”. “Engineering Mechanics”.cone of friction. 1998.Elements of vector algebra Statics of rigid bodies-Classification of force systems. Momentum. properties of couple. New Delhi.Resultant and equilibrant of coplanar non-concurrent force systems. Irving.B. New Delhi. “Engineering Mechanics. wheel rolling without slipping.1 – 0 ENGINEERING MECHANICS Credits: 6 MODULE I (20 HRS) Idealizations of Mechanics.Work-Energy principle-Impulse.Motion of connected bodies. Dynamics: Kinematics-Combined motion of translation and rotation-instantaneous centre.Support reactions of simply supported and overhanging beams under different types of loading. Vector approach. Power and Energy . & Young D.(simple problems) Types of supports .
Aggregates – desirable qualities of fine and coarse aggregates Plain Cement Concrete (PCC): preparation-proportioning-mixing of concrete.plastered.brief description of water supply and sewage disposal arrangements for residential buildings. wood and steel surfaces. Total Station & GPS (Brief description only) MODULE II Building construction: Selection of site for buildings .Mild Steel. Foundation: Different types . holding the staff. steel & Aluminium. Trapezoidal rule. Doors. Tests on Cement .desirable qualities of stone and brick.wood. 19 . marble. granite and synthetic materials.0 Credits: 6 MODULE I Surveying: Object and Principles of Surveying. Levelling: Levelling instruments .Tape correction (problems).Introduction to Distomat.1 . AC Sheet. Plumbing services.106 BASIC CIVIL ENGINEERING L-T-P: 2. Roofing: Selection of type of roof -flat roof.Temporary adjustments of a level. Linear Measurements: Direct measurements . Super structure: Masonry .consistency. Qualities of ingredients (brief description only). initial and final setting times. windows & ventilators : Types .materials used for the construction of doors and windows .mosaic tiles. emulsion & distemper.Preparation of Cement mortar Painting: Preparation of surfaces for painting .Components of buildings. Compressive strength -IS Specifications.Spread footing.Tech Information Technology. Selection of roof covering materials. Measurements in levelling . HYSD Steel and their properties. PVC Sheet MODULE III Concrete: Ingredients.Types of paint . Plastering: Mortar – properties . ramps (brief description only). reading the staff . Safe Bearing Capacity of Soil: Importance of determination of the Safe Bearing Capacity of Soil (brief description only).recording measurements in the field book . University of Kerala 08.Mid ordinate rule. Steel-common types used in construction.types of buildings . Isolated footing.plywood. Computation of areas . aggregate.Level (Dumpy Level. sloping roof Concrete roof.enamel. Flooring: Types . Reinforced Cement Concrete (RCC)-advantages of RCC over Plain Cement Concrete. Mat foundation¸ Pile foundation (description only). Contour maps (Brief description only). Simpson’s rule (examples). Partition: Materials used for making partition . GI Sheet . escalators and elevators.reduction of level height of collimation method only (simple examples). Tilting Level ) Levelling Staff.B. brick masonry –Types.cement. Elementary ideas on pre-cast and pre-stressed concrete constructions.stone masonry. average ordinate rule. Combined footing. and water. tiled roof. Building services – vertical transportation – stairs – types.Tape & chain only .Errors .Principles of leveling . ceramic tiles. particle boards & glass.Ranging out survey linesTaking measurements of sloping ground .
.Trivandrum Note: The question paper will consists of two parts. “Basic Civil Engineering” Karunya Publications... Part I is Compulsory covering the entire syllabus. Rangwala. Part I and part II. “Surveying & Leveling” Vol.Charotar publishing house.Tech Information Technology. “Building Construction” ..2004 6. 2004 5. 10. Narayanan and Lalu Mangal . Modern Publishing House distributor. 2004 3. (20 X 3 = 60) 20 . “Construction and Technology” 9.N. Santha Minu. Adler R. – I. for 40 marks. New Delhi. American Elsevier Publishing Company. Part II is to cover 3 modules. “Building Construction”. Roy.C Punmia. It contains 8 questions of 5 marks each. Rangwala.K..B. Moorthy. S. 1957 8. Rangwala.”Introduction to Civil Engineering”Phasor Books. New York.Kollam. 2001 4. B. There will be two questions (20 marks each) from each module out of which one from each module is to be answered. Laxmi publications(P) Ltd. Building Materials. Jha and Sinha. Charotar Publishing House. “Fundamentals of Surveying” Prentice-Hall of India. 1990 7. University of Kerala REFERENCE: 1..1970 2.Delhi. Vertical Transportation for Buildings.“Water Supply and Sanitary Engineering”. Charotar Publishing House.
University of Kerala 08. rope and gear drives-types. Second law of thermodynamics. Part I is to be compulsory for 40 marks. blower. “Engineering Thermodynamics” 2. “Workshop Technology” 7.Electro discharge machining (EDM) and Electro chemical machining (ECM) Principle. comparison and fields of application-velocity ratio-slip (simple problems) friction disc. centrifugal and jet pumps. First law. “Basic Mechanical Engineering” Note: Lectures are to be supplemented by demonstration in laboratories. thread cutting. A brief description of CRDI. “Fundamentals of IC Engines” 3. milling (simple sketches and short notes). CFC free refrigerants.107 BASIC MECHANICAL ENGINEERING L-T-P/D : 3-1-0 Credits: 6 MODULE I Thermodynamics : Basic concepts and definitions of Zeroth law.reciprocating and centrifugal. p-v and T-s diagrams Air cycles: Carnot. drilling. MODULE II Principles and fields of application of . GDI and Hybrid Vehicles Steam boilers: Classification – Cochran boiler. Gill. MPFI. 21 . soldering and brazing Machining processes. grinding. Vapor compression refrigeration system. Spalding and Cole. shaping.impulse and reaction. Non conventional machining . welding. MODULE III Mechanical Power transmission systems: Belt. pumps. Ostwald and Begeman. single plate clutch. “Fluid mechanics and machines” 8. gas turbine cycles.B. rolling.concept of reversibility and entropy. Part II is to cover 3 modules. ignition system and governing system. Smith and Zuirys. Amstead. Roy and Choudhary.Tech Information Technology. fuel system. thermal and nuclear power plants Refrigeration & Air Conditioning: Refrigerants. Crouse. There can be 3 questions from each module (10 marks each) out of which 2 are to be answered. J Benjamin. taper turning. application and advantages of C N C machine REFERENCES 1. Babcock and Wilcox boiler.compressors . Otto and Diesel cycles-Air standard efficiency (simple problems) IC Engines: Working and comparison of two stroke and four stroke petrol and diesel engines . “Automobile Engineering” 5. This may contain 10 questions of 4 marks each. “Elements of Mechanical Engineering” 6.open and closed Elementary ideas of hydro electric. gear trains (no derivations). Manufacturing processes: Elementary ideas of casting.general description of various systems using block diagrams – air system.turning.reciprocating. R K Bensal. Hajra Choudhary. steam and hydraulic turbines. Comfort and Industrial air conditioning-typical window air conditioning unit (general description only). “Manufacturing processes” 4. Benson boilerfluidized bed combustion. The question paper will consist of two parts. forging.
Kirchoffs laws . Solution of RL.plate and pipe earthing. wave and geothermal energy. Rectifiers & power supplies .three wire and four wire systems. energy efficient lamps MODULE – III Diodes .relation between phase and line values of voltage and current .typical electrical power transmission scheme .star and delta connection . thermal and nuclear power plants.Tech Information Technology.j notation . principle of working of series inductor and shunt capacitor filters.PN junction diodes. Review of electromagnetic induction . RC and RLC series circuits. LVDT 22 . MCBs. wind.phasor representation .active and reactive components. ripple factor and peak inverse voltage in each case.EMF equation . final equations of Vrms. Lenz's law .substation equipments. Primary and secondary transmission and distribution systems Different methods of wiring for LT installations.need for high transmission voltage . dynamic & static resistance. Solar cell. field strength. flux density. Schematic layout of LT switchboards.average and rms values . Power devices – V – I characteristics and applications of SCR and Triac Working principle of UPS and SMPS Transducers – Resistance strain guage. Working of incandescent lamps.constructional details of single phase and three phase transformers Methods of bulk generation of electric power. Phasor representation of alternating quantities . Alternating current fundamentals .solar. & LED. ELCBs and switches. Measurement of energy – working of 1-phase energy meter. thermistor. MODULE – II Transformers . circuit diagram & working of half-wave & full wave rectifier. principle of working and V-I characteristics of Zener diode.hydroelectric. -fluorescent lamps. principle of Photo diode.generation of three phase voltage .. University of Kerala 08.period . Renewable energy sources . Working of simple zener voltage regulator.form factor.statically induced and dynamically induced emf self and mutual induction .power and power factor in ac circuits .Principle of operation .108 BASIC ELECTRICAL AND ELECTRONICS ENGINEERING L-T-P : 2–1-0 Credits 6 MODULE – I Elementary concepts . V-I characteristics.MMF.necessity of earthing .block diagram description of a dc power supply.generation of alternating currents – waveforms frequency .inductance.Faradays laws. Vdc.Magnetic Circuits . Three phase systems . Measurement of power in three phase circuits ( two wattmeter method).phasor representation . tidal. Protective fuses. Bulk transmission of electric power .substations . Block schematic of layout of generating stations . reluctance – problems in series magnetic circuits. Earthing of installations . Analysis of simple ac circuits – concept of impedance and admittance .rectangular polar and exponential forms.B.
(50% choice. 1992. Asia 2003. Tata McGraw Hill 11. Prentice Hall of India.S.Bhargava. Part – A is to be compulsory for 40 marks (10 questions of 4 marks each). Volume I. US Bhatnagar and A Chakrabarthy. “Basic Electrical Engineering”. and Mani V. LJ Nagrath. Dhanpath Rai & Sons... Millman and Halkias. B. TP Imthias Ahmed.Phasor Books. Kollam 7. Francis M Fernandez. New Delhi. Pearson Education. Part-B is to cover 3 modules for 60 marks. Rashid. Rajath Publishers. 1990. “A Text Book of Electrical Technology”. "Instrumentation Devices and Systems". Ernakulam. Note : The question paper will consist of two parts. “Introduction To Electronics and Communications”. Muhammad H. Tata McGraw Hill. “Theory and Problems of Basic Electrical Engineering”. ML Soni. “A Text Book on Power System Engineering”. S Chand & Co. Kollam 6. 2. DP Kothari. McGraw-Hill Book Co 8. 2002. 9. Tata McGraw Hill. Rangan C.One out of two or two out of four from each module).L. 12. Mitlle.S.N. PU Guptha. Premlet. 23 . “Introduction to Electrical Engineering”. V. 2000. Thereja. “Basic Electronics and Linear Circuits”. Sarma G.Tech Information Technology.N. 3. University of Kerala REFERENCES 1. New Delhi 1997 10. "Integrated Electronics: Analog and digital circuits and systems".. 1992. Phaser Books.V. 5. “Electrical and Electronic Technology”. B. “A Basic Course in Electrical Engineering”.R. 4. Pearson education. . Gopakumar. Devices and Applications”. “Power Electronic Circuits. Edward Hughes. N.B.
function of each component in the circuit. block schematics of pulsed radar. (5 hrs) 24 .principle &block diagram of super heterodyne receiver. advantages of satellite communication. logic families: TTL and CMOS Logic (No internal diagram) (4 hrs) (f) IC fabrication: purification of silicon. University of Kerala 08. current gain of each. basic principles of cableTV. factors affecting range. concepts of Single Mode and Multi Mode optical fiber. principle of AM &FM demodulation. B. circuit diagram & working of RC phase shift oscillator (7 hrs) (d) Integrated circuits: advantages of ICs. input & output resistances and applications. functional block diagram of operational amplifier. deposition. principle of digital storage oscilloscope. (5hrs) (b) Radio communication: principle of AM & FM. flip flop (JK). comparison with BJT. (6 hrs) (b) Field effect Transistors : basic principles of JFET.interlaced scanning. typical doping. need of proper biasing.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. (4 hrs) (e) Satellite communication: microwave frequency bands. realization of logic functions. basic principles of LCD & Plasma displays. working principle of CRT. summing amplifier. diffusion. (5 hrs) (d) Radar and navigation: principle of radar and radar equation. block diagrams of AM & FM transmitters. bandwidths. block diagram of CRO. (3 hrs) (c) Amplifiers & Oscillators: circuit diagram & working of common emitter amplifier. analog and digital ICs. (4 hrs) MODULE II(Qualitative Treatment) (a) Measurements: principle and block diagram of analog and digital multimeter. working principle of source (semiconductor Laser) & detector ( PIN. principle of combinational and sequential logic circuits. non inverting amplifier. principle and block diagram of function generator. advantages of optical communication. concepts of class A. satellite transponder. structure.B. concepts of feedback.use as inverting amplifier. frequency response. (3 hrs) (f) Optical communication: block diagram of the optical communication system. comparison of AM & FM. epitaxy.APD). integrator and comparator. working principles of oscillators. applications of radar in measurements and navigation. wave forms. AB and Class C power amplifiers. working of NPN transistor. block diagram of PAL TV transmitter & receiver. frequency bands used. voltage gain and 3dB bandwidth. MESFET and MOSFET. CCTV system. wafer preparation. principle of light transmission through fiber. input & output characteristics of common emitter configuration. basic principles of HDTV. comparison of three configurations with reference to voltage & current gain. (4 hrs) (c) Color television: TV Standards. circuit diagram & working of push pull amplifiers.Tech Information Technology. concepts of common base. unit process: oxidation. common emitter & common collector configurations. block diagram of earth station transmitter & receiver. measurements using CRO. photolithography. ideal operational amplifier. (4 hrs) (e) Digital ICs:logic gates. crystal growth. ion implantation. concept of geo-stationary satellite. principle of Global Positioning System (GPS).
M. network devices.TCP/IP. Computer Architecture. switching technologies.modem. Basic Electronics & Linear Circuits. of Electronics and Communication in the Colleges. internetworking concepts.data path and control. Monochrome and Colour Television. 5th edition. virtual memory. IP addresses. frequency reuse. concepts of cells. switch. Neil H E Weste. (7 hrs) REFERENCES 1. principle and block diagram of GSM.Kollam This subject shall be handled by faculty of Dept. Wireless Communications and Networks.D C Kulshreshtha. Introduction to Electronics & Communication . Louis.server computing. 3rd edition. WLL & GPRS technologies. Basic Electronics – Devices. (4hrs) (d) Internet Technology: concepts of networking: client . Gulati.XML.R.circuit switching and packet switching. PHI 2. New Age International [Module 2 (c)] 10. Part I is to cover the entire syllabus. University of Kerala MODULE III (Qualitative Treatment) (a) Computer Architecture: functional units: basic concept of ALU. William Stallings.Kamran Eshraghian. There shall be 3 questions from each module (10 marks each) out of which 2 are to be answered. Part II is to cover 3 modules.B. Santiram Kal. communication protocols. PHI .functional block diagram of 8085 (9 hrs) (b) Data communication: overview. operating systems. Bell. transmission media. basic concepts of error detection .WAN &World wide web. FSK. K Gopakumar. David A. analog and digital data transmission.Frenzel. LAN. Introduction to web languages-HTML . digitization of wave forms. Question Paper The question paper shall consist of two parts.Firewall.[Module 2(a)] 7. PCM . caches. 4. 2008. Circuits and IT fundamentals. R. TMH 3. and carries 60 marks. network interface unit . network security.principle of CDMA. Pearson Education [Module 1(f)] 6. This shall contain 10 compulsory questions of 4 marks each. (6hrs) (c) Mobile communication: basic principles of cellular communications.S C Gupta.ASK. memory hierarchy. PHI 5.basic principles of router. network topologies..Moris Mano. 2008 9. parity checking. Principles of CMOS VLSI design – A system perspective. digital modulation techniques. Principles of Electronic Communication Systems.E. domain names. Introduction to Information Technology. and carries 40 marks. PSK. Electronic Instrumentation and Measurements.Tech Information Technology.MAN. TMH 8. main memory. 25 . ITL Education Solution Ltd.Phasor Publisher’s. bridge. Pearson Education. microprocessors . Pearson Education. N N Bhargava.
Preparing tube joints. H: Machine Tools: Study and demonstration on working of machine tools. cutting. Use of special tools in plumbing work. Study of pipe joints. Male and female joints. hexagonal bolt. E: Foundry: Study of tools. Practice in filing. Dove tail joint. University of Kerala 08. D and E only. 26 .Tech Information Technology. G: Smithy: Study of tools. B. threading and laying of pipes with different fittings using PVC pipes. Fitting: Study of tools. D. Welding: Study of welding machines.T-P: 0-0-2 CREDITS: 4 A. chiseling. Demonstration on forging of square prism. NOTE: For the university examination the student shall be examined in sections A. Making of Butt joint. C: Sheet Metal Work: Study of tools. cutting. Details of plumbing work in domestic and industrial applications. B. drilling and tapping. T joint and Lap joint. Joints – Cross joint.110 ENGINEERING WORKSHOPS L . Lathe and Drilling machine. Practice in planning. C. Carpentry: Study of tools and joints. frustums. marking and sawing. T bolt and Eye bolt. trays and containers. T joint. F. Stepped joints. Practice on riveted joints. Selection of different gauge GI sheets for jobs. Straight line practices. Preparation of sand.B. moulding practice and demonstration of casting. Plumbing: Study of tools.
unless otherwise specified) PART A Short answer questions 10 x 4 marks=40 marks All questions are compulsory.Tech Information Technology. 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. There should be at least three questions from each module.Eighth Semester University Examination Pattern (for all theory subjects. Total Marks: 100 27 . University of Kerala Information Technology Third Semester .B.
MODULE II (18 hours) Fourier Series: Fourier series of periodic functions of period 2 and 2l. Application of PDE: Derivation of one-dimensional Wave and Heat equations. Grewal. 4. Change of order of integration. properties. 5. Half range expansions. Solution by separation of variables. Boundary value problems in one-dimensional Wave and Heat equations.Tech Information Technology. Higher Engineering Mathematics – B. 3. Dirichlet’s condition for convergence. V. Thomson Publications. Stoke’s theorem and Gauss’ divergence theorem (no proof). Vector Integration: Line and surface and volume integrals. – Kreyszig. Pearson Education 28 . Triple integrals. Tata Mc Graw Hill. Ramana. Higher Engineering Mathematics – B. Area enclosed by plane curves. Advanced Engineering Mathematics. Odd and even functions.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). Wiley Eastern. MODULE III (18 hours) Partial differential equations: Formation of PDE. University of Kerala SEMESTER III 08. Advanced Engineering Mathematics – Michael D. Reference Books 1. Solution of Lagranges linear equation. Greenberg. First order nonlinear equations – standard forms – Homogeneous PDE with constant coefficients. Green’s theorem in the plane. inverse Fourier transforms.B. Fourier Transforms: Fourier integral theorem (no proof) – Fourier transforms – Fourier sine and cosine transforms. Advanced Engineering Mathematics – Peter O Neil. Volume of solids. S. 8th Edn. Khanna Publishers. 2.
The C Programming language – Keringhan B.M. Example programs. Venkateshmurthy. Gottfried.W. 4. Gilberg. Rajaraman. 3.G. Programming Techniques through C – M. 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. 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. PHI Reference Books: 1. Computer Programming in C – V. Command line arguments. 2. Thomson Learning. and Ritche D. Pearson/Addison Wesley 5. 29 . Introduction to programming languages – types of programming languages – high level languages – assembly language – machine language. Pearson Education India 3. TMH.S. PHI 2.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. A structured Programming Approach Using C – B. Pearson Education. PHI 1990. Low level programming in C. Pohl.R. 4. Pearson Education India. Text Books: 1. Schaum’s Series. Kelly and I. Example programs including bubble sort.F.A. Programming with ANSI and Turbo C – Ashok N. Data files – formatted. Memory allocation functions. unformatted and text files.B.. and linear and binary search.Tech Information Technology. A Book on C – A. Function – function definition – function prototypes – function call by value and call by reference – recursive functions. Programming with C – B. Problem Solving and Program Design in C – J.B. MODULE III (17 hours) Pointers – arrays of pointers – structures and pointers. University of Kerala 08. Rajaraman. Documentation of programs – debugging of programs. Hanly and E. MODULE II ( 20 hours) Important C concepts. Fundamentals of computers – V. Forouzan and R. Koffman. Kamthane. selection sort.
Algebraic systems with two binary operations – ring. cyclic groups. Cardinality – countable and uncountable sets. conditional. onto. Modern algebra – Herstein. Theory of inference for statement calculus.C. Partial ordering. biconditional. tautological implications. McGraw-Hill 5. Relations and ordering : relations – properties of binary relations in a set. formulas with distinct truth tables. Elsevier. pointers and linked allocation. product algebra and factor algebra. composition of functions. morphism. subalgebra. tautology. well formed formulas. contradiction. subsemigroups and submonoids. Liu. 4. relation matrix and graph of a relation. bijection. truth tables.L. error detection and correction using group codes. Cambridge University Press. congruence relation. Discrete mathematics with applications – Koshy. Boolean algebra. variables and quantifiers. equivalence of formulas. cosets and Lagrange's theorem. 30 . Functions : one to one. two state devices and statement logic. Pigeon hole principle. 3.. paths. semigroups & monoids . subgroups and homomorphism. MODULE II (14 hours) Set Theory: basic concepts of set theory. equivalence relations.V. Boolean functions. Ramana. Lattices as partially ordered sets.303 L-T-P: 2 – 1 – 0 DISCRETE STRUCTURES (R F) Credits: 3 MODULE I (11 hours) Statement calculus: Statements. cyclic semi groups and monoids. Grimaldi and B. rules of inference. Cantor's theorem of power sets.P. Representation of discrete structures: data structures. storage structures. Algorithmic graph theory – Gibbons. Discrete and combinatorial mathematics-an applied introduction – R. predicate formulas. composition of binary relations. free and bound variables.B. Pearson Education. Manohar. compatibility relations. sequential allocation. Prentice Hall. 3. TMH 2. TMH 2. binary and n-ary operations. duality law. inverse functions. sub lattices. Text Books: 1. Partition and covering of a set. MODULE III (14 hours) Algebraic structures : simple algebraic systems and general properties.Tech Information Technology. validity using truth tables. Elements of discrete mathematics . statement functions. normal subgroups. Recursion – recursion in programming languages. integral domain. Ganguly. subalgebra.morphism. Partially ordered set -representation. direct product and homomorphism. Discrete mathematical structures with applications to computer science – J. properties of lattices. Sanguine Technical Publishers Reference Books: 1. theory of inference for predicate calculus. field.P. 1988. 4.H Rosen. functionally complete set of connectives. Predicate calculus: predicates. Discrete mathematical structures for computer science – Kolman B. Tremblay and R. direct product and homomorphism. reachability and connectedness (No theorems and proofs). Basic concepts of graph theory basic definitions of graphs. groups – abelian groups. natural numbers – Peano Axioms and Mathematical induction. Discrete mathematical structures – J. statement formulas. connectives. permutation groups. Discrete mathematics and its applications with combinatorics and graph theory – K. University of Kerala 08. universe of discourse. lattices as algebraic systems. consistency of premises and indirect method of proof.
PHI 2. Clampers. Filters. Electronic Devices and Circuits Theory – Boylestead and Nashelky. Regulators.555 timer and applications ( No derivations) MODULE III (14 hours) Operational Amplifiers. switched mode power supplies MODULE II (13 hours) Transistor amplifiers. wein bridge. IntegratorsRC circuits-response of high pass / low pass RC to sine wave.monostable. characteristic features of OP Amps. Clippers. University of Kerala 08. Block diagram. Band Pass and Band rejection filters. Colpitts..D.feed back configurations.RC phase shift.304 L-T-P: 2 – 1 – 0 ELECTRONIC CIRCUITS (R F) Credits: 3 MODULE I (12 hours) Design and analysis of Rectifiers. Sanguine Technical Publishers 31 . Sudhaker Samuel and V Nattarsu.principle of operation of inverters. ideal OP Amps. pulse and square wave inputs. uninterrupted power supplies. 4th Edn.B. Pearson Education Reference Books: 1. Active filters. High pass Butterworth Filter. Chebyshev and Butterworth filters. common mode and difference mode. differential amplifier. inverting. Hartely oscillator( No derivations). Applications. bistable and astable. Multivibrators.classification – small signal analysis – voltage divider bias – emitter follower configuration. non inverting amplifiers.summing amplifier. Electronic Circuits – R. Low pass Butterworth Filter.Tech Information Technology. Op-amp and Linear Integrated Circuits – Gayakwad. Oscillators.Wein Bridge and Phase shift Oscillators Text Books: 1. Differentiators.
305 L-T-P:2 – 2 – 0 DIGITAL SYSTEM DESIGN (R F) Credits: 4 MODULE I (16 hours) Number systems – Decimal. Basics of Hardware Description language (HDL). code converter. TMH. Jain. PHI.L.M. Introduction to Programmable Logic Devices (PLDs). Text Books: 1. Digital Fundamentals – T. parity generator – design examples. Harris. PHI.B. multiplication and division of binary numbers (no algorithms). multilevel carry look ahead adder. Design of combinational logic circuits – adder. 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. University of Kerala 08. Octal and Hexadecimal numbers. 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. Digital Electronics Principles and Applications – Tokheim. Pearson Education.H. 4.. Rajaraman and T. multiplication and division of floating point numbers (no algorithms). Gothman. magnitude comparator.M. 2. 2. multiplexer. Representation of floating point numbers – precision – addition. demultiplexer.Tech Information Technology. Addition. Addition and subtraction of BCD. Binary. MODULE III (18 hours) Sequential logic circuits – flip flops – RS. Thomson Learning. Pearson Education. decoder. carry look ahead adder. parallel adder. 3. 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. Yarbrough. Digital Logic Applications and Design – J. subtraction. 3.L. subtractor. Morgan Kaufmann Publishers. Digital Electronics-an Introduction to Theory and Practice – W. D and T type – master slave flip flop. JK. subtraction. Digital Design and Computer Architecture – D. Digital Design – M. Reference Books: 1. Morris Mano. BCD adder.P. 32 . Harris and S. Floyd and R. An Introduction to Digital Computer Design – V. 5th Edn. Radhakrishnan.
Gear. Hamacher.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. Mac Even.Tech Information Technology. Hamacher.L Hennessey. 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. 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. Chaudhuri. 2nd Edn. Mc Graw Hill Publishing Company. Text Books: 1. (for PDP-11addressing modes and instructions). Computer peripherals – input devices – output devices. Patterson and J.A.W. segmentation and paging – associative memory. USB). The indispensable PC Hardware Book – H. Prentice Hall of India Pvt. Pearson Education. Zaky. Introduction to Computer Systems using PDP – 11 and Pascal – Glenn H. 33 . Vranesic and S. I/O organization – accessing of I/O devices – interrupts – direct memory access – buses – interface circuits – standard I/O interfaces (PCI. 2. 5. Morgan Kauffmann Publishers. 3. Computer Organization Programming – C. Mc Graw Hill Publishing Company. Zaky. Vranesic and S. Computer Organization and Design – P. Mc Graw Hill International Student Edition. Messmer 6. RAID. MODULE II (14 hours) Basic processing unit – fundamental concepts – execution of a complete instruction – multiple-bus organization – sequencing of control signals. Reference Books: 1. Computer Organization – C. Computer Organization – C. Ltd. Upgrading and Repairing PCs – Scottmuller. Mc Graw Hill. Z. Computer Organization and Design – D. University of Kerala 08. Z.B. 4. SCSI.P. 2.
zener diode.307 L-T-P: 0 – 0 – 4 1. Clipping and Clamping circuits. Simple zener diode regulator. 3. 11. 4. 10. Astable and Monostable multivibraors using 741 OPAMP. Astable and Monostable multivibrators using 555 Timer IC. 5.Tech Information Technology. 6. ELECTRONIC CIRCUITS LAB (R F) Credits: 4 Characteristics of diode. CS characteristics of FET. RC lowpass and highpass circuits. RC coupled amplifier using BJT. Differentiating and Integrating circuits. RC phase shift oscillator using BJT. 9. Rectifier circuits with and without filters. 7. University of Kerala 08. 12. 34 . 8.B. CE characteristics of BJT. 2.
goto statements while. opening/closing. input-output operations command line arguments memory allocation functions bit-wise operators 35 .302 Problem Solving and Programming in C.B. 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. Programming exercises in C based on the course 08. two-dimensional.Tech Information Technology. for statements Arrays and strings one-dimensional. branching and looping if. if … else statements switch. University of Kerala 03. bit-level programming files defining. do.308 L-T-P: 0 – 0 – 4 PROGRAMMING LAB (R F) Credits: 4 Familiarization of operating systems like DOS and Windows. memory allocation. multidimensional arrays reading/writing strings operations on strings string handling Functions user defined functions function calls. The programming exercises include: Decision making.
Greenberg. Milne Thomson method. continuity and differentiation of complex functions.Tech Information Technology. Numerical Methods with Programming – C.S. Higher Engineering Mathematics – B. Runge Kutta methods (derivation of formulae not required for the above methods). Lagranges interpolation formula. Newtons forward and backward interpolation formula. Sastry 36 . Grewal. Ramana. V. Higher Engineering Mathematics – B. 2. Numerical solution of ODE Taylor series method.T. – Kreyszig. Wiley Eastern. Euler’s method. w z 1z . MODULE III (18 hours) Numerical Techniques: Errors in numerical computation – solution of algebraic and transcendental equations by bisection method. Conformal mapping: the transformation. transformations w 1z . w z2 . Evaluation of real definite integrals – with no poles of f ( z ) on the real axis (proof of theorems not required). University of Kerala SEMESTER IV 08. 5. Introductory Methods of Numerical Analysis – S. Thomson Publications. Solution of linear systems by Gauss elimination and Gauss-Seidal method. Analytic functions – Cauchy Reimann equations in Cartesian form (proof of necessary part only). Tata Mc Graw Hill. Advanced Engineering Mathematics. Reference Books 1. S. Power series – radius of convergence – Taylors and Laurents series – zeros and singularities – residues and residue theorem. Numerical integration. 3. Regula false method. Pearson Education 4. 6. Newton-Raphson method. Trapezoidal and Simpson’s rule. Ramachandran 7. Bilinear MODULE II (17 hours) Complex Integration: Line integral – Cauchy’s integral theorem – Cauchy’s integral formula. Veerarajan and T. . Advanced Engineering Mathematics – Michael D. Properties of analytic functions – harmonic functions.B. Advanced Engineering Mathematics – Peter O Neil. Khanna Publishers. 8th Edn.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.
Business Environment in India – Mohinder Kumar Sharma. Meaning of Demand and Supply – Types of demand – Determinants of Demand – Demand forecasting Production function – Law of Variable proportion – Returns to scale . International Trade and Public Finance – D. 3.Keeping and Accountancy -Elements of Double Entry -Book. House.Balance sheet (with simple problems) . Banking. Part II – Accountancy (1 Period per week) MODULE III(13 hours) Book.Keeping-rules for journalising Ledger accounts –Cash book-Banking transactions – Trial Balance. 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.Tech Information Technology. India’s Economic crisis in 1991 – New economic policy – Global Financial meltdown in 2008 – Applicability of Keynesian Theory to UDC’S. 5.P. Addison Wesley Longman Ltd. 4.Introduction to Accounting packages (Description only) Reference Books: Part I 1. 7. Economic Development – Michael Todaro. Modern Economic theory – K. Intermediate Micro Economics – Hal R. Varian. 2nd Edition – Koutsiannis. Part II 37 .GNP – GDP – NNP – Per Capita Income – Three Sectors of the Economy – Primary – Secondary.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 . Stock Market and present scenario – Industrial sector past and present – Industry Analysis – Electronics – Chemical – Automobile – FMCG Industry. Micro Economics. 6.Least cost combination of inputs – Cost concepts – Cost output relationship. Mithani. New Delhi. Final accounts: Preparation of trading and profit and loss Account. 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.Method of Balancing accountsthe journal proper (simple problems).M.B.K Dewett 2. Indian Economy – Rudder Dutt and K. University of Kerala 08. Money. Himalaya Pub. Tertiary Sector – Significance of Money.M Sundaran.
etc. University of Kerala Internal Continuous Assessment (Maximum Marks-50) Marks shall be awarded for Part I and Par II in the ratio 70:30. programming exercises.B. There should be at least four questions from each module and not more than six questions from any module. term-project. 2 x 15 marks = 30 marks Maximum Total Marks: 100 2 x 20 marks = 40 marks 10 x 3 marks = 30 marks 38 . Part II Accountancy Descriptive/Analytical/Problem solving questions Candidates have to answer two questions out of three questions. problem solving. respectively 25 Marks .Tech Information Technology.Regularity in the class University Examination Pattern Part I and Part II to be answered in separate answer books. literature survey. Part – I PART A: Economics Short answer questions All questions are compulsory. seminar.Assignments (minimum 3) such as home work. 10 Marks . 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.Tests (minimum 2) 15 Marks .
Wayne Wolf. Text Books: 1. 39 . The 8051 Microcontroller and Embedded Systems. MODULE II (17 hours) Programming 8051 timer/counter in assembly language and C. 2. Andrew N Sloss. 4. ARM System Developer’s Guide. MODULE I (17 hours) 8051 interfacing – keyboard. Pearson Education. An Embedded Software Primer. University of Kerala 08. LCD. registers and I/O ports. Elsevier. Concept of Embedded Systems – embedded software and hardware development tools. Elsevier 2005. 5. ADC. Reference Books: 1. embedded processors. Computers as Components: Principles of Embedded Computing System Design. serial port programming. Thomson Publishing . C programming in 8051. DAC and stepper motor interface – interfacing to external memory. Simon. Pearson Education. 2005.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. John B. Serial communication using 8051 – interfacing with RS232. ARM Architecture Reference Manual. 3.B. 2. 3/e . New Delhi. Design With PIC Microcontrollers. Peatman.Tech Information Technology. Muhammad Ali Mazidi. David Seal. instruction sets and assembly language programming. 8051 Interrupts – handling and programming. 2002. addressing modes. David E. 2006. Overview of the 8051 family – 8051 architecture – memory organisation. Pearson Education. Introduction to PIC microcontrollers and ARM processors. Kenneth Ayala. The 8051 Microcontroller. Dominic Symes and Chris Wright.
Tata McGraw Hill. 2. Teach yourself C++ . references as function parameters.Tech Information Technology.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. Galgotia Book House. Inheritance and Polymorphism. MODULE III (16 hours) Inheritance and polymorphism: Derived class and base class. returning a reference. Pearson Education (Chapter 4 – for UML part in Module III) 40 . Placement of variable declarations. data structure. Static members. the “const” Qualifier. Malik. Fundamentals of object oriented design in UML. the scope resolution operation. Assigning Attributes and Behaviour.R. accessing data members. File processing – formatted – unformatted and random files. delete operators. 2. derived class constructors. Schaum’s outline of programming with C++ – J. References: References as Aliases. references as return values. Microsoft foundation classes : Strings. Jones. friends.B. “this” pointer.S. Text Books: 1. C++ Programming from problem analysis to program design 3rd Edn. Hubbard. array of class objects. C++ enhancements to C: Default Function Arguments. Sahni and D. A first look at C++: Using streams for input and output. University of Kerala 08. 4th impression 2008 – Meilir P. Object Oriented Programming in Microsoft C++ – Balagurusamy. multiple inheritance. overloaded functions. Object Oriented Programming – Barkakti 4. Thomson Publications Reference Books: 1. class hierarchies. 3. Fundamentals of data structures in C++ – E. creation and destruction of objects. Schildt. class members. Mehta. generic classes. 3. overriding member functions. MODULE II (13 hours) Introduction to classes: Declaring and using classes.H. Encapsulation. polymorphism. finding relationship between classes. Operator overloading: Overloading unary operator. classes within classes. Horwitz. S. Object Oriented Programming in Microsoft C++ – Rober Lafore. public and private inheritance. – D. Universities Press (India) 5. Generic functions. Designing an object-oriented system: Identifying the classes. overloading binary operator. references and pointers similarities and differences. virtual functions. data conversion. Classes and dynamic memory allocation: New. Arranging classes into hierarchies: A design example. Representing classes and attributes using UML. “const” objects and member function. classes.
Horowitz and S. reference counters. stacks. A structured approach to Programming – J. S. Hugges and J. Introduction to data structures with applications – J. Sahni.G.I. storage compaction. Fundamentals of data structures in C – E. Classic data structures – D. Storage management – free storage lists. Algorithms + data Structures = Programs – M. Samanta. TMH.Tech Information Technology. Prentice Hall. sorting with tapes. Text Books: 1. partition exchange sorting. Michtm. Prentice Hall Englewood cliffs.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. Schaum’s series. Searching algorithms – hashing. 3. University of Kerala 08.K. 2. Anderson-Freed. boundary tag method. MODULE III (19 hours) Internal and external sorting techniques – insertion sort. stepwise refinement techniques. Sahni and S. Theory and problems of data structures – Seymour Lipschuts. Horwitz. garbage collection. Study of basic data structures – vectors. 4. records. Computer Science Press. External sorting – sorting with disks. merge sorting. physical representation for strings – linked lists – trees. PHI Reference Books: 1. 3. 2. documentation – analysis of algorithms: frequency count. queues and dequeues. MODULE II (19 hours) Logic characteristics of strings. Sorenson. programming style. Fundamentals of data structures – E. Universities Press (India) 41 . Tremblay and P. Wirth. binary tree traversals – graphs – applications.P.B. arrays. heap sort.
attributes and keys. Serializabilty. database/DBMS distinction. motivation for normal forms. relational algebra operations. 5th Edition. 42 . approaches to building a database. Relational Data Model: Concept of relations. E/R diagrams. – Ramez Elmazri and Shamkant B. 2006 2. Addison Wesley. Navathe. 2NF. ACID properties. Membership and minimal covers. data models. Fundamentals of Database Systems. three schema architecture of a database.Tech Information Technology. data independence.Concepts of transaction processing. Mc Graw Hill. referential integrity and foreign keys. B-Trees. querying in SQL.B. 1NF. relationships. dependency theory – functional dependencies. Conceptual data modeling – motivation. Implementation and Management. Primary and Secondary index structures. 3NF and BCNF. Locking based protocols for Concurrency control.406 L-T-P: 3 – 0 – 0 DATABASE DESIGN Credits: 3 MODULE I (13 hours) Introduction to database systems : traditional file system. various components of a DBMS. Amstrong’s axioms. Database systems – Design. University of Kerala 08. Logging and Recovery Methods. Hash based structures. Thomson Course Technology. MODULE II (13 hours) SQL – data definition in SQL. Decompositions and their desirable properties. embedded SQL. entities. Dependencies – importance of a good schema design. Concurrency control. Text Books: 1. B+ Trees. 2007 Reference : Data Base System concepts – Henry F Korth and Silberschatz. Transaction Processing and Error Recovery . relational calculus. schema-instance distinction. E/R Model. 7th Edition – Peter Rob and Carlos Coronell. Join dependencies and 5NF. Multi-valued dependencies and 4NF. Converting database specification in E/R notation to the relational schema. MODULE III (13 hours) Data Storage and indexes – File Organisations.
insertion and deletion of nodes etc. Implementation of multiple stacks 7. expression evaluation etc.B. and doubly connected linked list and application problems 4. 43 . Creation of binary search tree – searching an item.405 Data Structures and Algorithms. Use of multidimensional arrays and structures 3. Implementation of stacks using arrays and linked lists. 6.407 L-T-P: 0 – 0 – 4 DATA STRUCTURES LAB (R F) Credits:4 Programming exercises in C based on the course 08. 9. University of Kerala 08. Creation and traversals of binary trees – counting nodes. The exercises may include the following:1. Representation of sparse matrix – addition. arithmetic operations on polynomials 5. Standard Template Library – Containers. Linked list – singly linked list. String manipulation applications. Application problems using stacks – Maze problem.404 (Object Oriented Techniques) using Java or C++. Representation of polynomials. finding height etc. Iterators. Associative Arrays. Implementation of Queues using linked list and array – multiple Queues.Tech Information Technology. conversion between infix. multiplication and transpose of sparse matrices 2.408 L-T-P: 0 – 0 – 4 OBJECT ORIENTED PROGRAMMING LAB Credits: 4 Implementation of topics covered in 08. 10. postfix and prefix. priority queue and applications of queues 8. Implementation of sorting and searching algorithms 08. circular linked list. Dequeues.
U.Tech Information Technology.Fitting a straight line .Mean and autocorrelation of Poisson process .Random processes .Principle of least squares . 2006 44 .strict sense stationary process . 2/e. random variable and stochastic processes. Probability and Random Processes for Electrical and Computer Engineers. autocorrelation.Mean and Variance . Probability and Random Processes.Karl Pearson’s coefficient of correlation . uniform and exponential distributions . 3/e. Stark and Woods.Average values such as mean. MODULE II (16 hours) Curve fitting . 4/e.Power spectral density and its properties (no proof) . Poisson.Classification of random processes . Papoulis and S.Distribution functions . TMH 2. MODULE III (18 hours) Joint probability density function . correlation coefficient of random processes stationarity .Mean and Variance of the above distributions Normal distribution .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 .Examples .Hypothesis concerning a mean.Properties of normal distribution .B.Binomial. exponential and normal distributions.Fitting a parabola .Chapman-Kolmogorov equation (no proof) Poisson process .wide sense stationary process .Estimation . Cambridge University Press.Linear correlation and regression .Marginal and conditional distribution Independence . Reference Books 1. Equality of meansHypothesis concerning one proportion. Probability and Random processes with application to signal processing.Related problems.Markov chains.Properties . Gubner.Testing of Hypothesis .Autocorrelation function and its properties . auto covariance.Sampling distributions Standard error . Pearson Education 4. Poisson.Simple problems. .Interval estimation of population mean and proportions ( small and large samples) . Transition probability matrices . Pillai.Probability distribution (density) functions . TMH 3. difference of two proportions. uniform. Veerarajan. University of Kerala SEMESTER V 08. Probability.Related problems .Computing probabilities using Binomial.
Gareth Williams.Degenerate and non-degenerate solutions Optimal solution . Operations Research.Network Analysis-Project Scheduling.Estimation of Floats-Total float. Operations Research. Philips. Kanti Swarup. Free float. G.Slack and surplus variables . Manmohan.Basic Queuing models.Queues-Characteristics of Queues-Kendal’s notation-Random arrivals-Arrival and Departure Distributions-Types of Queues. 45 . Addison Wesley 7. Thomson Learning 6.Solution by simplex method . Linear Algebra. Linear Algebra with Applications. Independent Float-Project Evaluation and Review Technique(PERT)-Computation of expected completion times by PERT. Pearson Education 2. Hadly.Dimension of vector space Rank . Linear Algebra with Applications. Jones and Bartlett publications 5.Singular value decomposition (proof of the theorem are not included).M/M/1:∞/FIFO . Gilbert Strang. M/M/c:∞/FIFO model – Standard results ( no derivation) .Standard form .Inner product space .Problems. Linear Algebra.Artificial variables .Quadratic form Constrained optimization of quadratic forms .Bases .Basic feasible solution . Kenneth Hoffmann and Ray Kunze. PHI. MODULE III (18 hours) Queuing Theory. Linear Programming. 14. Wiley 8.Co-ordinate systems .Length and orthogonality .Least square problem .Solution of LPP .Critical Path Method (CPM)Identification of Critical path using CPM. Linear Algebra with Applications. Solberg.Vector space and subspace Null space and Column spaces . Reference Books 1.502 ADVANCED MATHEMATICS & QUEUEING MODELS (RF) Credits: 4 L-T-P: 3 – 1 – 0 MODULE I (18 hours) General linear programming problem .Tech Information Technology. University of Kerala 08.Gram-Schmidt process . 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.Construction of Project networks. David C Lay. Schaum Series 3.Orthogonal sets Orthogonal projection .basic solution .Little’s Formulae – Problems based on the above results.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 . Ravindran.Change of basis . MODULE II (16 hours) Partitioned matrices and matrix factorization .B.LU decompositions .Big-M method .
offline TMs. MODULE III (13 hours) Turing machines . examples of PDA. NDTM.derivation trees. Mealy and Moore machines. Narosa Publishing. equivalence of NFA and DFA. pumping lemma for CFGs. PDA – formal definition.basics and formal definition. Switching and Finite automata theory – Kohavi. 4. Bernard M. NFA. 2-way finite automata. Introduction to Automata Theory. ambiguity. normal forms of CFGs. decision algorithms for CFGs. equivalence of single tape and multitape TMs. pumping lemma for regular languages. variants of TMs – multitape TM. minimization of FSA. Pearson Education. designing CFGs. Hopcroft . reducibility. 3. Pearson Education. language acceptability by TM. closure properties of regular sets and regular grammars. 2. Universal Turing Machine. Introduction to Automata Theory and Formal Languages – Peter Linz. simplification of CFLs. MODULE II (13 hours) Chomsky classification of languages. Languages and Computation – John E. Introduction to The Theory of Computation (Second Edition).503 L-T-P: 2 – 1 – 0 THEORY OF COMPUTATION Credits: 3 MODULE I (13 hours) Introduction to the theory of computation. decision algorithms for regular sets. Context-Free Grammar . designing finite automata. regular expressions.B. Jeffrey D. properties of transition functions. finite automata with epsilon moves. Recursive and recursively enumerable languages. University of Kerala 08. Moret. Deterministic PDA. Reference Books : 1. applications of finite automata. Finite state automata – description of finite automata. equivalence with CFGs. Michael Sipser. decidable and undecidable problems – examples. halting problem. examples of TM. Thomson. regular sets and regular grammars.Ullman and Rajeev Motwani. 1 Text Books : 1.Tech Information Technology. The Theory of Computation. Tata McGraw Hill 46 .
System Software-An Introduction to System Programming – Leland L. 2. RISC machine – ultra SPARK.504 L-T-P: 2 – 1 – 0 SYSTEMS PROGRAMMING (RF) Credits: 3 MODULE I (13 hours) Systems Programming – What is systems programming. editor structure. Text Books: 1. MODULE II (13 hours) Assemblers – Basic assembler functions – machine dependent assembler features – machine independent assembler features – Hand assembly of SIC/XE programming. relationship with other parts of the system – user interface criteria. Text Editors – overview of the editing process – user interface.Tech Information Technology. dynamic linkage editors. machine independent loader featured. multi pass assembler – assembler implementation – MASM. Pentium Pro architecture. Difference between systems programming and application programming – Dependence on systems programming on hardware – System software and Machine architecture. Reference Books: 1 1. Damdhere. Donovan. Assembler design options – one pass assembler. Power PC. Loaders and Linkers basic loader functions. examples – DOS linker. dynamic linking. University of Kerala 08.M. Debuggers – debugging functions and capabilities. ANSI C macro processors. Tata McGraw Hill. loader design options – linkage editors. Traditional (CISC) machines – VAX architecture.B. Beck. SPARC assemblers. Systems Programming – John J. Tata McGraw Hill. Pearson Education. machine dependent loader features. Assemblers Vs Compilers. 47 . Operating Systems and Systems Programming – D. bootstrap loaders. MODULE III (13 hours) Macro processors – basic macro processor functions – machine dependent and machine independent macro processor architectures – design options – implementation examples – MASM. SIC & SIC/XE Architecture and Programming.
space allocation policies . Operating Systems .characteristics .swapping .allocation methods .file protection .multiprogramming .avoidance .security. MODULE III(16 hours) Device management : Physical characteristics – disk scheduling algorithms .classical problems in process synchronization.scheduling algorithms . Memory management : Basics .time sharing . 48 .sharing and security . Information management: File concepts .OS services -multiprocessor system .demand paging .access matrix and its implementation dynamic protection structures .mechanisms and policies .recovery from dead lock . Critical Section Problem and solutions .page replacement . MODULE II (21 hours) Processor management: CPU scheduling . Brinch Hansen.early systems . Prentice Hall.types of OS batch processing . University of Kerala 08.semaphores .combined approach to dead lock handling. Peterson and A.segmented paging . Reference Books: 1. 2.overlay .B.fixed partitions . Protection : Goals of protection .variable partitions . Dead locks : Deadlock problem .distributed system.Tech Information Technology.directory structure .dynamic linking.prevention . Text Books: Operating System Concepts – J. L.detection .functions and components of an operating system .file system .gaining access to files basic file system calls . Operating System Principles – P. Pearson Education.implementation issues.paging segmentation .scheduling concepts .concurrent processes.real-time system .505 L-T-P: 3 – 1 – 0 OPERATING SYSTEMS Credits:4 MODULE I (15 hours) Introduction : Basic concepts – terminology. Historical perspective . Silberschatz. Addison Wesley.sector queuing device drivers.Gary Nutt.virtual memory concepts .
circuit switching. Basic principles of switching . Biphase.Different types of noise . WDM & DWDM. half duplex and full duplex transmission. Noise .Simplex. Eighth Edition .Encoding analog data into digital signals . FSK.AM.506 L-T-P: 2 – 1 – 0 DATA COMMUNICATION Credits:3 MODULE I (12 hours) Communication model. satellite microwave . PM . terrestrial microwave.Encoding analog data into analog signals . Data and Computer Communications.Transmission media .synchronous and Asynchronous transmission. packet switching. CRC. DM .NRZ.Multiplexing TDM. GPRS 1 Text Books: 1. Fourth Edition – Andrew S Tanenbaum. GSM.Transmission Impairments . message switching. Forward Error Correction .William Stallings .parity check. MODULE III (14 hours) Error Detecting and correcting codes. Block codes. WiMax. VRC. Tata McGraw Hil References : 5.B. Fourth Edition .Tech Information Technology.Attenuation.Channel capacity Shannon's Theorem . PM. Multilevel binary Encoding digital data into analog signals .ASK.Encoding digital data into digital signal . 49 . Data Communications and Networking. Computer Networks.Hamming codes. University of Kerala 08. Coaxial cable.Behrouz A Forouzan. MODULE II (13 hours) Sampling theorem . Delay distortion.PCM.Introduction to WiFi.PHI 2. Convolution codes. PSK . PHI. FDM.twisted pair. optical fiber.Analog & Digital data and signals . Error detection . Basics of wireless communication. Time Domain and Frequency Domain concepts . FM.
DML and DCL). Inventory.B. 4. Familiarization of creation of databases and SQL commands (DDL. 50 . Write a DBMS program to prepare reports for an application using functions. GUI based user friendly database application in any one of the domains such as Banking. University of Kerala 08. Insurance. Electricity Billing.Tech Information Technology. 6. Write SQL procedure for an application which uses exception handling. 2.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 SQL block containing triggers and stored procedures. Library management. 5. Write SQL procedure for an application with cursors.Suitable exercises to practice SQL commands may be given.508 L-T-P: 4 – 0 – 0 DATABASE LAB Credits: 4 1. Health care etc. 3. Develop a menu driven. Payroll. integrating all the features specified in the above exercises.
BNF notations. Reference Books : 1. translation of assignments. 2. LALR(1) parsers. Aho. Cengage Charles River Media. 5. Text books: 1 1. MODULE III (16 hours) Syntax directed translation schemes. case statements. recovery and repair. deterministic and non-deterministic finite automata. PHI. derivations and parse trees. translation of array reference. operator precedence parser. SLR(1). Monica S. predictive parser simple LL(1) grammar. Lam. back patching.601 L-T-P: 3 – 1 – 0 Creidts: 4 COMPILER DESIGN (RF) MODULE I (18 hours) Introduction to compilers and interpreters – overview of compilation. Bottom up parsers. Compiler Construction – Principles and Practice by Kenneth C. Algorithms for Compiler Design – O. Louden.B. Ullman. Ravi Sethi.Tech Information Technology. issues in compilation – structure of a compiler – compiler writing tools – bootstrapping – notations and concepts for languages and grammars – regular expressions – context free grammar. LR grammar. University of Kerala SEMESTER VI 08. 2. Jeffrey D. Pearson Education. Techniques and Tools (Second Edition) . Context of a lexical analyzer – construction of lexical analyzer. sources of sample code generation. Compilers: Principles. Basic parsing techniques – Top down parsing – recursive descent parser.Andrew W. 4. Kakde. Principles of Compiler design – V. Appel. code optimization. error detection. Compiler Design – Santanu Chattopadyaya.Keith D Cooper & Linda Torczon. 51 . Cambridge University Press. intermediate codes. Elsevier. Tata McGraw-Hill. loop optimization and global optimization. MODULE II (18 hours) Compile time error handling. Boolean expressions.G. reporting. Modern Compiler Implementation in C .Alfred V. LR(0). Cengage Learning. Engineering a Compiler (Second Edition) . 3. Raghavan.
PHI.11 a/b/g/n.BGP. Internet Multicasting. ARP. PHI. Exterior routing protocols . QoS.602 L-T-P : 2 – 1 – 0 COMPUTER NETWORKS Credits: 3 MODULE I (12 hours) Introduction – Uses – Network Hardware – LAN –MAN – WAN. 802. IGMP.323 & SIP standards.OSPF – Routing for mobile hosts – Congestion control algorithms. 52 . IPv6 – addressing – issues. University of Kerala 08.Design Issues – Flow Control and ARQ techniques.HDLC DLL in Internet. Data Link layer .Wireless LANs 802. Data link Protocols . Text Books: 1 Computer Networks. Internetworks – Network Software – Protocol hierarchies – Design issues for the layers – Interface & Service – Service Primitives. Voice over IP .Tech Information Technology. An Engineering Approach to Computer Networks – Keshav. Gatekeeper. MODULE III (14 hours) Internetworking – Network layer in internet – IP Addressing – Classful and Classless IP Adressing. Internet Control Protocols – ICMP. Bridges .B.Switches . References: 1.Gigabit Ethernet.High Speed LANs . Tata-McGraw Hill 2 .15. Eighth Edidtion – William Stallings. Network Management – SNMP. Data Communications and Networking . 4. Reference models – OSI – TCP/IP.Data and Computer Communications.Behrouz A Forouzan. BOOTP. 3 . Fourth Edition. MODULE II (13 hours) MAC Sub layer – IEEE 802 FOR LANs & MANs. PHI. Subnetting. Network layer – Shortest path routing – Flooding – Distance Vector Routing – Link State Routing – RIP . Transport Layer – TCP & UDP. Volume 1 – Willman Stallings. MPLS. Addison Wesley.H. Fourth Edition – Andrew S Tanenbaum.Hand book of Computer Communications Standards. RARP.
53 . Mary Shaw.Tech Information Technology.Class Modeling –class diagrams – Links and associations – Generalization and inheritance –Navigation of Class Models – State Modeling – Events – Signal event . Software Architecture in Practice (2nd Ed. James Rumbaugh. Object-Oriented Modeling and Design with UML (2nd Ed. PHI. Thomas J Mowbray. Software Design – From Programming to Architecture.Wiley[M II] 3.B. flexibility. structural and behavioral design patterns . Pearson.603 L-T-P: 2 – 1 – 0 SOFTWARE ARCHITECTURE Credits: 3 MODULE I (13 hours) Modeling as a design technique – UML .change event – states – state diagrams – Activity effects Interaction Modeling – use case models –use case diagrams – sequence models – Activity models. University of Kerala 08.characteristics of design patterns – delegation and recursion.). David Garlan. Pearson [M I] 2. Paul Clements. Raphael Malveau. Software Architecture. 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.). Michael Blah. MODULE II (13 hours) Software Design principles – Correctness and Robustness – Flexibility. Rick Kazman Pearson [M III] References: 1 1. 2. Reusability and Efficiency – Trade offs among robustness. Eric Braude . Software Architect BOOTCAMP 2nd Ed. reusability and efficiency – Design patterns – creational. Len Bass. Text Books: 1.
Boyle. 1 Text Books: 1. Introduction to graphics in three dimension – specification of a 3D view . University of Kerala 08. V.. Gose. PHI 2. Procedural Elements for Computer Graphics – David F.Scan Conversion – frame buffers – solid area scan conversion – polygon filling. Sobel. Newman and Robert F. and Machine Vision – M. S. and R. R. Computer Graphics – Donald Hearn and M. Z. Principles of Interactive Computer Graphics – William M. Scene segmentation and labeling – region-labeling algorithm – perimeter measurement.3D transformations MODULE III (14 hours) Projections – Parallel and perspective projections – vanishing points – Hidden elimination – Back face removal. MODULE II (13 hours) Two dimensional transformations – Homogeneous coordinate systems – matrix formulation and concatenation of transformations – Windowing concepts – two dimensional clipping. Rogers 2. Jost. 3.B. Image processing – introduction – digital image representation – relationship between pixels – gray level histogram – equalization – edge detection – Robert.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 . Sproull. Johnsonbaugh. Pauline Baker. scan line algorithm. Image Processing.Buffer algorithm. Hlavac. Thomson India Edition. 55 . Sonka. Pattern Recognition and Image Analysis – E.Tech Information Technology. Analysis. PHI Reference Books 1. Canny edge detectors.
TATA McGraw Hill.Resource management – File system organization and implementation – I/O subsystems – Interrupt handling .606 L-T-P: 3 – 1 – 0 EMBEDDED SYSTEMS Credits: 3 MODULE I (18 hours) Introduction .Handling of interrupt latency and deadlines .PCI.Queues.Parallel port devices .Timer and counting devices . Raj Kamal. Text Books: Embedded Systems . MODULE II (16 hours) Programming concepts .Synchronous. CAN. stacks and lists .RTOS services . MODULE III (18 hours) Real-time operating systems .Concepts of embedded programming in C++ .Task scheduling models .C Program Elements . University of Kerala 08. iso-synchronous and asynchronous communications from serial devices -Internal serial communication devices .Tech Information Technology.Definition and classification – Processors and hardware units in an embedded system – Software embedded into the system – Embedded system-on-chip . PCI-X and advanced buses Device drivers -Interrupt servicing mechanism.Structures . Programming and Design.C compilers – Cross compiler – Optimization of memory usage. USB and advanced serial high-speed bus . I/O Devices .Processor and memory.Assembly language vs high level language .Architecture. organization.12 C. 2004 1 56 .Performance metrics.B. Inter-process communication and synchronization – Semaphores – Priority inversion problem Deadlock situations – Signals – Message queues – Mailboxes – Pipes – Sockets.
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. monitoring and management-safety risks and hazards-RMMM plan. 1 Text Book: 1. 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.701 L-T-P : 2 – 1 – 0 SOFTWARE PROJECT MANAGEMENT Credits: 3 MODULE I (12 hours) Software . Risk management: software risks-risk identification-risk projection-risk mitigation. Pearson Education 2. Pearson Education 58 . Evolutionary models.B.Measures. MODULE II (14 hours) Software process and project metrics: .Metrics and indicators.software scoperesources-software project estimation-Decomposition Techniques –Empirical estimation modelsCOCOMO model. Project Management concept: People – ProductProcess-Project.Tech Information Technology.characteristics . Pressman. Software Project Management: A unified framework – Walker Royce.Software measurementsmetrics for software quality-Software project planning: Planning objectives . McGraw Hill International References: 1.Process: Process-layered technology-Software process models – Waterfall model .Incremental models. Software Engineering – Roger S. Software Project Management in Practice – Pankaj Jalote. University of Kerala SEMESTER VII 08. Sixth Edition.
POP. MODULE I (17 hours) Applications . Bootstrap and Autoconfiguration (DHCP). Connectionless Datagram Delivery (IPV4) . 59 . The Internet and Its Protocols.702 L-T-P: 3 – 1 – 0 INTERNETWORKING Credits: 4 MODULE I (17 hours) Internet Architecture. Adrian Farrel. WWW (HTTP). PHI 2009 2. Determining an Internet address at start-up (RARP). Forwarding IP datagrams. Error and Control Messages ( ICMP ). Routing Between Peers (BGP).Comer. IP Switching and MPLS. VPN). Reliable Stream Transport Service. Classful Internet Addresses. Routing Within an Autonomous System (RIP. Principles. SSH). OSPF). Classless and Subnet Address Extensions (CIDR). IMAP. MODULE I (18 hours) Routing Architecture : Cores. Douglas E. Private Network Interconnection (NAT.B. QoS). and Algorithms. RSVP.Volume I. TFTP. Voice and Video Over IP (RTP. University of Kerala 08.DNS. Protocol Layering. MIME). Internet Multi casting. 1 Internetworking with TCP/IP . User datagram Protocol. File Transfer and Access ( FTP.Tech Information Technology. NFS) . Text Books : 1. Peers. Mapping Internet Addresses to Physical addresses (ARP). Protocols and Architecture (5th Edition). Elsevier 2005. Remote Login and Desktop (TELNET. Electronic Mail ( SMTP.
Aspects of security. Analysis of the DES. Cryptography and Network Security . Public Key Systems :. Public key systems based on elliptic curves. unicity distance.information measure and absolute security. random properties of shift register sequences. Statistics and cryptanalysis. Entity authentication with symmetrical algorithm.B. The theory of finite state machines. Message integrity. Nonlinear shift registers. Message authentication with digital signatures. The information theoretical approach . CAMBRIDGE UNIVERSITY PRESS 1. A. 60 . DES modes. Classical cipher systems .Behrouz A. MODULE III (13 hours) Authentication and integrity :. Jan C. Fair cryptosystems. Error probability and security. Cryptanalytic attacks. Zero .knowledge techniques. Cracking the Knapsack system. Hagelin machine.Characteristics. Forouzan. Van Der Lubbe. MODULE II (14 hours) The DES algorithm :. IDEA (International Data Encryption Algorithm). University of Kerala 08. RSA system. Cryptanalysis of LFSRs. 2. Text Books : 1 Basic Method of Cryptography. generating function.Stream and block enciphering.Protocols.General aspects of key management. Tata McGraw Hill. Key distribution for symmetrical algorithms. Network security. Message authentication with a message authentication code (MAC). Key Management :. shift Registers.Cryptography and cryptanalysis. Shift Registers :.Transposition ciphers. Substitution ciphers.703 L-T-P: 2 – 1 – 0 CRYPTOGRAPHY Credits :3 MODULE I (12 hours) Introduction to cryptology :. Alternative descriptions. Knapsack system.Introduction. Key distribution for asymmetrical systems.Tech Information Technology.
The J2EE Tutorial. Text Books : 1. Beth Stearns-Pearson Education –Asia. SPD O’Reilly 61 . basic HTTP. EJB framework.lifecycle of EJB . Sharing Data Between JSP pages -Passing Control and Data between Pages – Sharing Session and Application Data – Application Models . JDBC Execution Types.JDBC API. creating data access objects. servlet container. Setting attributes. Dale Green.Stepahnie Bodoff. Retrieving and updating Data. personal roles for EJB Development. service method detail. University of Kerala 08. J2EE Architecture. Kim Hasse. Benefits of Servlets. Monica Pawlan. Ziyad Dean. MODULE III (13 hours) Enterprise JavaBeans : Overview. Scrollable Resultsets.704 L-T-P: 2 – 1 – 0 WEB APPLICATIONS DEVELOPMENT Credits: 3 MODULE I (13 hours) Introduction .B. CORBA and RMI . William Crawford.defining the application . use as controller in MVC. Session and entity beans.O'Reilly Media 3. Implicit JSP Objects. Bean attributes. Batch Statements. Development methodology . validating the code. Application Components. Security. container-managed persistence (CMP) and bean managed . Conditional Processing – Displaying Values. MODULE II (13 hours) Servlets: Introduction to Servlets. Reference Books : 1.Mastering EJB(2nd Edition ) – Ed Roman. building pages. transaction support.creating the interface. Java Server Pages –Hans Bergsten. servlet lifecycle. JDBC: Architecture . Using JavaBeans Components in JSP Pages.Transaction management. Servlets API. Scott Ambler. Parts of a Bean.java message service (JMS) and message driven beans (MDB). J2EE UNLEASHED – Joseph J. javax. Tyler Jewell – John Wiley Publications 2003.servelet Package. Java Server Pages: Generating Dynamic Content.database design . Mark Ashnault.J2EE Layers. Metadata. HTTP response header.MVC Design. HTML clients. Error Handling and Debugging.XML and J2EE.web application lifecycle . web applications.Entity beans. Thomas Garben. SQL-to-Java Data Types. building session beans creating session beans . Bambara. Paul R. 2. Stateless and tateful session bean.Jason Hunter. Java Servlet Programming. Eric Jendrock. session management. Design and development of a J2EE application .Web architecture . distributed programming. distributed programming services. Using Scripting Elements. dispatching requests. Servlets with JDBC.Allen. 1 Sherry Smith – SAMS Techmedia 2. deployment.Tech Information Technology. Reading Servlet parameters. Second Edition.Task list for building J2EE Applications .
time and space complexity. Fundamentals of sequential and parallel algorithms – Kenneth A. Merman and Jerome L. Strassen’s algorithm. Ullman. average and worst – case analysis. building heap. University of Kerala 08. strongly connected components.D. Graphs – DFS and BFS traversals. Fundamentals of Computer Algorithms – Horowitz and Sahni. Dynamic programming – Matrix multiplication problem.B. Shortest paths – single source shortest path algorithms. PHI. Description of quick sort. priority queues. Allen Van Gelder 62 . Analysis of sorting algorithms – insertion sorting. Vikas Publishing Reference Books : 1. Recurrences – substitution method.E. 3. Back tracking – 8 Queens problem. Definitions and Basic concepts of NP-completeness and NPHardness. The Design and Analysis of Computer Algorithms – A. Pearson Education 3. Galgotia Publication. Algorithm for sets – Union and Find operations on disjoint sets. J.Tech Information Technology. Paul. Rivest.V Aho. Addison Wesley Publishing Company. Topological sorting. Branch and Bound – Travelling Salesman problem. Charles E. Introduction to Algorithms – Thomas H. heap sort algorithm. Integer multiplication problem. Text Books : 1 1. Computer algorithms . Hopcroft and J. randomized version of quick sort.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. Levitin.Introduction to design and Analysis – Sara Baase. Kruskal’s and Prim’s algorithms. MODULE II (18 hours) Height balanced trees – AVL Trees – Red-Black trees – Steps involved in insertion and deletion – rotations. heaps. Cormen. 2. Study of NP-Complete problems. Greedy algorithms – Knapsack problem. MODULE III (18 hours) Algorithm Design and analysis Techniques – Divide and Conquer techniques – Merge Sort. 2. maintaining the heap property. Leiserson and Ronald L. Asymptotic notation. Spanning trees – Minimum Cost Spanning Trees. iteration method and master method. Introduction to the design and analysis of algorithms – A. Definition of B-trees – basic operations on B-trees.
MODULE I (17 hours) Modeling complex systems . Geoffrey Gordon. Law. University of Kerala 08. Averill M.Single server queuing simulation Time. TMH System Simulation. 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.shared computer model – Job-shop model. PHI 63 .B. 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.
and Bindings:. Constructors and Destructors. Type Checking. Performance Analysis. Morgan Kaufmann Publishers (Including the companion CD with the book). MODULE II (18 hours) Subroutines and Control Abstraction: . 3. Scope Rules. Second Edition by Ravi Sethi. Files and Input/Output. Cengage Learning Reference Books: 1.Virtual Machines. Structured and Unstructured Flow. Functional and Logic Languages:. Object Orientation. Second Edition by Allen B. Data Types.Scoping rules. Sebesta. Sequencing. Symbolic Debugging. Recursion. MODULE III (17 hours) Innovative features of Scripting Languages:. Inheritance. Control Flow: . Third Edition by Michael L Scott. Multiple Inheritance. Logic Programming in Prolog. Synchronization. 2. Second Edition by Kenneth C. Higher-Order Functions. Calling Sequences. Sets. Selection. Streams and Monads. Overview of Scheme. Pearson Education 64 . Data Abstraction and Object Orientation:. Strictness and Lazy Evaluation. Assertions in C and JAVA. Axiomatic Semantics.Names and Scopes.Encapsulation.Tech Information Technology. Lists. String and Pattern Manipulation. Programming Languages – Principles and Practice.Lambda Calculus. Late Binding of Machine Code.Expression Evaluation. Programming Languages – Principles and Paradigms. Generic Subroutines and Modules. Concepts of Programming Languages. Data Types:.705C L-T-P: 4 – 0 – 0 PRINCIPLES OF PROGRAMMING LANGUAGES Credits: 4 MODULE I (17 hours) Names. Dynamic Method Binding. Binding Time.Type Systems. Equality Testing and Assignment. Strings. Storage Management. Arrays. Overloading. Polymorphism. Run-time program Management:. University of Kerala 08. Denotational Semantics. Concurrency:. Parameter Passing.Static and Dynamic Links. Tucker and Robert E. Smalltalk Object Model. Language-Level Mechanisms.Threads. Coroutines. Proofs of Program Correctness. Separate Compilation.B. Nondeterminacy. Exception Handling. Pearson Education. Tata McGraw-Hill Edition 2. Eighth Edition by Robert W. Limitations of Logic Programming. Programming Languages – concepts & constructs. Introduction to Formal Semantics and Program Verification:. Events. Louden. Aliases. Noonan. Iteration. Programming Language Pragmatics. Binding of Referencing Environments. Text Books: 1 1. Pointers and Recursive Types. Reflection. Scopes. Records and Variants.Operational Semantics.
Reports-types. TMH New Delhi. MODULE II (20 hours) Forms of Technical communication.informal letters-essentials of telephonic conversation-invitations-minutes of a meeting. Basics of Technical Communication. Students should read the book on their own and selected topics may be discussed in the class. Distinction between general and technical communicationlanguage as a tool of communication. Listening Skills: Listening for general content. Official letters-govt. Technical communication. downward and lateral-importance of technical communication.Intensive listening-Listening for specific information.thesis writing. PHI. University of Kerala 08. MODULE III (12 hours) A non-detailed study of the autobiography: “Wings of Fire-an autobiography by APJ Abdul Kalam”. Effective Technical Communication – Barun K Mitra. Business letters-sales and credit letters.705D COMMUNICATIVE ENGLISH & TECHNICAL WRITING (Common with 08. 1 Reference Books: 1. Basic Communication Skills for Technology – Andrea J Rutherford.Technical proposals-writing a proposal –the steps involved. structure and style. 4. Business Correspondence and Report Writing – Mohan K and Sharma R C.projects. writing reports. Writing Skills: Skills to express ideas in sentences. mass communication-the flow of communication: upward.704(3) of CSE) L-T-P: 3-1-0 Credits: 4 MODULE I (20 hours) Listening. graphic representation. use of appropriate vocabulary -sentence construction-paragraphs development-note making-editing a passage and essay writing. organizational. Reading. significance.dissertation. Pearson Education.Tech Information Technology. Speaking Skills: Oral practice-Describing objects/situations/people-Role play-Just A Minute/Group Discussion. Job application and resume. letter of quotation. Everyday Dialogues in English – Robert J Dixson. letters. 2. condensing . 3.levels of communication-interpersonal. Speaking and Writing skills. New Delhi. essays.features.B. Reading Skills: Skimming the text. letter of enquiry.barriers to communication.exposure to a variety of technical articles. and journalistic articles. letter to authorities. Preparing audio-visual aids. placing order. Oxford University Press.Technical papers. 65 .
B. working – Laser printers. Micro DIMM. Mechanical mouse and Optical mouse-working.P. MODULE I (17 hours) Display adapters. 2. Storage interfaces – ATA/IDE -SATA-SCSI. University of Kerala 08. Hardware and Networking-Vikas Gupta-Dreamtech press.Introduction-DRAM. read and write process. DVDs.Hard disks -tracks and sectors-operation of hard disk–. A+ Study Guide . Upgrading and Repairing PCs – ScottMueller. DDR2. 1 Text Books : 1. working– Inkjet printers.PCI slot. David Groth. SDRAM. RIMM. DDR. Reference : The Indispensable PC Hardware Book – Hans Peter Messmer.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. working. Addison Wesley/Pearson Education 66 . SVGA. Memory. Blu-ray Discs. DDR3. Pearson Education. PCI-Express slots. MODULE I (18 hours) Input / Output Devices – Scanners –flat bed scanner-working process. SoDIMM.Core Module . RAM slots-types.WQXGA– Serial access mass storage devices . SXGA.Tech Information Technology. XGA. Expansion Slots. Parallel ports..B.Random access mass storage devices -Magnetic disks. Printers – Impact and Non Impact Printers– Dot matrix.B 3. DIMM. WUXGA. Introduction-CDs. WXGA.introduction.Magnetic tapes and Streamer tapes . USB. Serial ports.IntroductionSIMM. AGP Slots.VGA. Magneto Optical disks.
application in marketing. arrow head representation.706B L-T-P: 4 – 0 – 0 OPTIMIZATION TECHNIQUES Credits : 4 MODULE I (17 hours) General methods of solving operations research models. determination of best replacement age of machine using present worth and discount rate. the mini-max criterion. University of Kerala 08. unbalance transportation problem – Assignment problem.Tech Information Technology. Principles of Operations Research for managers. Simplex algorithm and its applications. Frank S Budnick. minimax regret criterion. Dennis McLeavy. MODULE III (17 hours) Network analysis – project scheduling by PERT – CPM. decision under uncertainty – the Laplace criterion. Operations Research . probability and cost consideration in project scheduling. group replacement .B. Graphical solution. the assignment algorithm. scientific methods in operations research .game theory – definition of a game – two person zero sum game – graphical solution. economic interpretation. advertisement etc. decision trees. Construction of the time chart-resource leveling. Text Books : 1.Mathematical formulation of linear programming problem. Frederick S Hiller. B S Goel. degeneracy and elementary sensitivity analysis – Transportation problem – mathematical formulation – initial feasible solution by VAM method. use of artificial variables. Generald J Liebermann 3. expected variance criterion. Hurvitz criterion. degeneracy. – decision theory – decision under risk – expected value of profit or loss. Operations research. unbalanced assignment problems MODULE II (18 hours) Replacement model. Richard Mojena 67 . types of replacement problems. quality. S K Mittal 2. mathematical formulation. calculation of critical path. problem of choosing between two machines.
Prediction. Pearson Education. Temporal mining.Sridhar.William H. DM versus KDD Data preprocessingAggregation. Grid based methods. Morgan Kaufmann Publishers. Smith. 2. Data warehousing and OLAP Technology – Introduction to Data warehouse. model selection.Hierarchical methods. Data Mining : Concepts and Techniques .Arun K. Text mining. Density based methods. Universities Press.Classification and prediction. 2. Constraint based association mining. Tata McGraw-Hill. Issues. Web mining. University of Kerala 08. Berson and S.B. Inmon. Neural network and rule-based. Data warehouse architecture and implementation. 3. Data mining techniques . Evaluation of accuracy of classifier or predictor. Wiley Publishing. Partitional algorithms . Advanced association rule techniques. Dunham.Jiawei Han. 1 Text Books : 1. Micheline Kamber. Variable transformation. Accuracy and Error measures. Multimedia mining. Association and Prediction . Constraint based cluster analysis. S.706C DATA MINING TECHNIQUES (Common with 08. Other classification methods. MODULE III (18 hours) Cluster analysis – Types of data in cluster analysis. MODULE II (17 hours) Association and Correlation . Data warehousing and data mining. System architecture.Margaret H. Algorithms . Reference Books : 1. Measuring the quality rules. Model based clustering methods. Issues. Increasing the accuracy. Building the Data Warehouse . Data Mining and OLAP – A. J. Sampling. Feature subset selection.Decision tree-based. Distance-based. Dimensionality reduction.Basic algorithms. Advanced Topics .Tech Information Technology. Support vector machines. statistical-based. Discretization and Binarization. Pujari. From association mining to correlation analysis.Multidimensional analysis and descriptive mining of complex data objects.Basic data mining tasks. Data Warehousing.705(4) of CSE) L-T-P: 4-0-0 Credits:4 MODULE I (17 hours) Fundamentals of data mining . Spatial mining. Clustering large data bases. Feature creation. Data Mining : Introductory and Advanced Topics . 68 . Multidimensional data model. classification of major clustering methods.
. Implementing dynamic routing using RIP Implementing dynamic routing using OSPF Implementing dynamic routing using EIGRP Basic switch configuration VLAN configuration VTP. Practice Experiments Familiarization of different Network Cables. 12. 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. Each student along with other team members and under the supervision of a faculty member should identify a problem for the final year project. 69 . 6. 4. University of Kerala 08. 08. Familiarization of Wireless Access Point. VTP pruning. A seminar report should be prepared and submitted. 2. Implement inter-VLAN routing Backup and recovery of configuration files of a router using TFTP server. design etc.707 L-T-P: 0-0-4 COMPUTER NETWORKS LAB Credits : 4 Experiments Using Routers and Switches 1. Basic router configuration.Crimping.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. An evaluation should be conducted at the end of the semester. 10.should be carried out in this semester. Access Control List (Standard and Extended) Configuring PPP. Implementing static routing. 7. 5. The preliminary work for the project . It should be based on the core subjects of the discipline and could involve software and/or hardware implementation. 8. 3.Tech Information Technology.Color coding .literature survey. 11. 9. For awarding internal marks.B. the relative weightage of the seminar and the project design will be 1:1.
DVB. MODULE II (17 hours) Satellite Networks . Signals.Traditional TCP. WAP.IEEE 802. Support for mobility – File Systems. i-mode. FDMA. Multiplexing. DECT. Pearson Education 2. TETRA. TDMA. TCP over 2. HIPERLAN – Blue Tooth. UMTS and IMT-2000 .William Stallings. Mobile ad-hoc networks.5/3G wireless networks. Introduction to wireless sensor networks. Telecommunication systems – GSM. Modulations. Dynamic Host Configuration Protocol. WAP 2.Basics.Jochen Schiller.11a – 802. Antennas. WWW.Tech Information Technology. Broadcast Systems – DAB. Second Edition. University of Kerala SEMESTER VIII 08. Wireless Communications and Networks . Spread spectrum. Cellular Wireless Networks. Mobile Communications . Wireless Transmission – Frequencies for radio transmission. SyncML. Pearson Education 70 . Wireless LAN – IEEE 802. Classical TCP improvements. Capacity Allocation – FAMA and DAMA.Mobile IP.11 .B. Medium Access Control – SDMA. GPRS.0. Signal Propagation. Text Books: 1 1. Parameters and Configurations.801 L-T-P: 3 – 1 – 0 MOBILE COMPUTING Credits: 4 MODULE I (17 hours) Introduction . MODULE III (18 hours) Mobile Network Layer . Mobile Transport Layer . CDMA.11b.
Jeffrey F. Basic Technology . 2nd Edition.Choosing an ISP .M-commerce and e-payment.Credit cards . Electronic Commerce . Elias M.Smart cards . Awad.B2C and B2B models .E-wallet . Pearson Education 2008.802 L-T-P: 3 – 0 – 0 E-COMMERCE Credits: 3 MODULE I (13 hours) Definition and scope of e-commerce .Hosting a web site . Introduction to E-commerce. 71 .Branding.International issues .Taxation . 2008. Jaworski.B2B and e-payment .Planning an intranet .Tracking customers .Tech Information Technology.Advantages and constraints .Intranets and extranets . Text Books : 1 1. 2.Website evaluation and usability testing.Intellectual Property Rights. MODULE III (13 hours) Ethical issues .Customer service .Framework for e-commerce.Extranets and Supply Chain Management .Online gambling .advantages and disadvantages . Business models in e-commerce .E-cash .B. MODULE II (13 hours) Market opportunity analysis . 3rdEdition.Legal issues .Warranties .Types of electronic payment media .Electronic Funds Transfer .Electronic money . Rayport and Bernard J.Web portals and web services .Strategy making in online environment . Payment systems .Requirements for internet-based payments .Internet marketing . Tata McGraw-Hill Edition.From Vision to Fulfillment.Mobile commerce . University of Kerala 08.SCM and B2B .Electronic Data Interchange.Copyrights and trademarks .
803 L-T-P: 2 – 1 – 0 E-SECURITY Credits: 3 MODULE I (12 hours) Security in Computing. Legal. Program Security. MODULE I (14 hours) Protection in general purpose Operating Systems. 72 . McGraw Hill. Shari Lawrence Pfleeger. PKI : Implementing and Managing E Security . Mattord. Principles of Information Security . Pearson Education. Administering Security.Michael E. Herbert J.B. Bill Duane. Designing trusted Operating Systems. Derek Brink. Reference : 1. Text Book : Security in Computing . Privacy and Ethical issues in Computer security.Tech Information Technology. 2.Andrew Nash. MODULE I (13 hours) Security in Networks. University of Kerala 08. Whitman. Database Security. Elementary Cryptography. Course Technology 1 Cengage Learning 2008.Charles P Pfleeger.
B. The Art of Software Testing .test reports Integration test reports – System Test report – acceptance test report . Techniques and Tools . Pearson 1 References : 1. 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 .M G Limaye. Wiley 3.Effective methods.guidelines for writing and using test report .Test strategy – Test plan templates (System testing) – Guidelines for developing test plan .Tech Information Technology. TMH 2. Wiley 4.Tools used to build test data – testing object oriented software – Testing web applications.Developing Testing methodologies – Levels of Testing – Acceptance Testing – Special Tests – Testing Tools. Introducing Software Testing . Pradeep Oak. Myers. Software Testing Fundamentals Methods and Metrics -Marnie L Hutcheson. TMHB 2.final test reporting – test status report . Software Testing. Principles .Glenford J.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 . Tools and Techniques . Software Testing . 50 Specific Ways to Improve Your Testing .Elfriede Dustin Pearson 73 .Test Estimation – Test standards – Building Test data and Test cases Test Scenario – Test Scripts . Effective Software Testing.Renu Rajani. University of Kerala 08. Text Books : 1.benchmarking.Fundamentals of Software Testing – Principles of Software Testing – Structured approach to Testing .Louise Tamres. MODULE II (13 hours) Test planning .
P.Interrupt Systems – Assembly Language Programming Intel 8086 – Architecture . Microprocessors Theory & Applications: Intel & Motorola – Revised Edition by M. The Mechanics of Program Execution.Jon Stokes.Understanding Caching and Performance-Intel's Pentium M. University of Kerala 08.Superscalar Execution . Inside the Machine.Instruction set – Input Output – Interrupts – Design . 74 .Assembly Language Programming.CPU pins & associated signals . An Illustrated Introduction to Microprocessors and Computer Architecture . Motorola's G4e: The Back End. Rafiquzzaman. and Core 2 Duo. Motorola's G4e:Approaches and Design Philosophies. Intel's Pentium 4 vs. 2.The G5: IBM's PowerPC 970.Addressing modes .The Intel Pentium and Pentium Pro . Core Duo. MODULE III (18 hours) 64-Bit Computing and x86-64 .805A L-T-P: 4 – 0 – 0 ADVANCED MICROPROCESSORS Credits : 4 MODULE I (17 hours) Intel 8085 – Introduction-Addressing modes .Tech Information Technology. No Starch Press 2006.Instruction set . Text Books : 1. PHI. PowerPC Processors: 600 Series.B. MODULE II (17 hours) Pipelined Execution . and 7400 . 700 Series.Intel's Pentium 4 vs.
D. 1 Text Books : Internetworking with TCP / IP . Urgent data processing and the push function. MODULE II (17 hours) User datagrams. Error processing.B. Route propagation with an SPF algorithm. TCP. Address Recovery and binding global. Implementation and Internals. E.805B L-T-P: 4 – 0 – 0 NETWORK PROGRAMMING Credits: 4 MODULE I (18 hours) Internet Protocol.Data structures and Input processing. Multi cast processing. Design. PHI. Active Route propagation and Passive acquisition.Volume II. The structure of TCP /IP software in an operating system. Comer and D. L Stevens. Finite state machine implementation. Network interface layer. Routing table and Routing algorithm. flow control and adaptive retransmission. 75 . Fragmentation and reusability of datagrams. University of Kerala 08.Tech Information Technology. MODULE III (17 hours) Socket level interface. Output processing timer management. Software organization.
combinatorial dual. orthogonal vectors and spaces Directed graphs – types of digraphs. Digraphs and binary relation. Distance and centres . 2. Reference Books : 1. ban2 vectors of a graph. PHI. 76 . synthesis of contact networks. Graphs in switching and coding theory – contact networks. Isomorphism.805C GRAPH THEORY (Common with 08. Null graph. pendent vertex. Allied. Euler graphs.Algorithm for computer representation of a graph. A First Look at Graph Theory – John Clark and Derek Allan Hotton. Connected graphs. Analysis of contact Networks. spanning tree. pendent vertex. sub graphs. Trees – properties. algorithm for connectedness and components. Paths and circuits – Isomorphism. searching the graphs. Narosa Publishers. Euler graphs. shortest path. Different representation of planar graphs. Planar graphs. University of Kerala 08. spanning trees.B. Hamiltonian paths and circuits – Travelling salesman problem. walks. unit cube and its graph. Graph Theory – Frank Harara. geometric dual. Text Books : 1. counting trees. trees with directed edges. directed circuits.Tech Information Technology. vector spaces of graph. sequential switching networks. Foulds. disconnected graphs.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. graphs in coding theory. paths and circuits. Graph Theory – Narasingh Deo.Rooted and binary tree. 1 2.R. MODULE II(18 hours) Combinatorial versus geometric graphs. MODULE III18 hours) Graph theoretic algorithms and computer programming . Graphs Theory Applications – L. Narosa Publishers.
Intersection. Neural Fuzzy Systems. Neuro-Fuzzy Modelling. Neurofuzzy and Soft Computing. control. PHI. PHI 2003. GA based Fuzzy Model Identification.formulation and parameterization. Basic Concepts of Fuzzy Logic. 5. C T Sun. Genetic Algorithm with Conventional Artificial Intelligence(hard computing) Neural Networks. Back-propagation Multilayer Perceptrons.Tech Information Technology. 6. Unsupervised Learning – Competitive Learning Network. Neuro. C T Lin & C S G Lee. Fuzzy Logic. Fuzzy Logic. Fuzzy Inference SystemsMamdani and Sugeno Fuzzy models. E Mizutani. Pearson. Simon Haykins. PHI / Pearson. and Complement. Design issues in Genetic Algorithm. Fuzzy Rules and Fuzzy Reasoning.B. MODULE II(18 hours) Fuzzy Set Theory – Basic Definition and terminology. David E Goldberg. John Yen & Reza Langari. 7. 77 . Genetic Algorithms. James A Freeman & David M Skapura. Fuzzy Assocaitive Memories.806A L-T-P: 4 – 0 – 0 SOFT COMPUTING Credits: 4 MODULE I (17 hours) Comparison of Soft Computing Methods -Neural networks. Membership functions. University of Kerala 08. PHI 1997. 2. Bart KoskO. Genetic Modelling. Supervised LearningPerceptrons. Fuzzy Union. Hybrid Approach. J S R Jang. and Information. PHI. 4. Fuzzy Engineering. Pearson. MODULE III(18 hours) Genetic Algorithm – Basics of Genetic Algorithms. Neural Networks. Intelligence. Fuzzy Logic controlled Genetic Algorithm. References : 1 1. 3. Text Book : Neural Networks. Back-propagation Algorithm.Different Architectures. Neural networks. Pearson. S A Vijayalekshmi Pai. Hybrid Learning Rule. Fuzzy Logic & Genetic Algorithms. S Rajasekharan.Genetic Hybrids & Fuzzy – Genetic Hybrids. Set Theoretic Operators.
group communication-Case study: inter process communication in Unix. Distributed file system: File service architecture – Sun network file system. Distributed Systems: Principles and Paradigms – Andrew S Tanenbaum and Maarten Van Steen. System models: Architectural models and fundamental models.B. Jean Dollimore and Tim Kindberg.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. Replication : System model and group Communication. Pearson Education References: 1. Pearson Education 2. Text Books: 1 Distributed Systems: Concepts and Design – George Coulouris. Distributed Systems and Computer Networks – Morris Solomon and Jeff Krammer. University of Kerala 08. PHI 78 .Transactions and concurrency control: Transactions. nested transactions-locks-optimistic concurrency control. 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 . Distributed objects and remote invocation: communication between distributed objects – remote procedure call – Events and notification. MODULE III(18 hours) Operating system support: Operating system layer – protection – processes and threadscommunication and invocation – Operating system architecture.Tech Information Technology.
Tata McGraw Hill 2009. Deitel & Deitel.Benefits of web services .SOAP transports.NET Web Services Architecture & Implementation.SOAP data types . 4.Extensions and restrictions .Types . Keith Ballinger.An Introduction.806C L-T-P: 4 – 0 – 0 WEB SERVICES Credits: 4 MODULE I (18 hours) Introduction to web services .Message patterns.Global declarations . PHI 2002.Namespaces Qualification . Web Services . Pearson Education 2002.SOAP message exchange model . C# How to Program.SOAP encoding and XML schemas . XML in Action : Web Technology.UDDI registries . Text Books : 1 1. Pardi. University of Kerala 08.UDDI publish interface . Universal Directory and Discovery Interface .Defining a web service interface . B.Defining a web service implementation . 2. XML schema Basic elements and attributes .UDDI inquiry interface . Pearson Education 2003.Element groups . . Kumar. MODULE III (17 hours) Web Services Description Language .Modular schemas .Using UDDI and WSDL together.Substitution groups .V.Data types and messages . S. 79 .How web services work.Occurrence constraints .Tech Information Technology. Subrahmanya.V. MODULE II (17 hours) Simple Object Access Protocol .SOAP messages .Importing types. 3.B.
5. Testing the application on an Application Server. In the viva voce. 3. 4. The work can be carried out in the department under the supervision of a faculty member or with the help of an external organization. In the latter case. the seminar presented and the knowledge of the courses in the whole curriculum. The student has to submit a thesis in the prescribed format.808 L-T-P: 0 – 0 – 4 PROJECT & VIVA VOCE Credits: 4 The project should be based on the core subjects of the discipline. An internal guide will be consistently interacting with the external guide and monitoring the progress of the project. 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. respectively. Retrieval of data from database using SQL and exchange of information in XML format.807 L-T-P: 0 – 0 – 4 WEB APPLICATIONS LAB Credits: 4 1. Debugging Web applications locally and remotely. HTML and JSPs. Developing applications in a team environment. 08. The distribution marks will be in the ratio 2:1:2. duly certified by the internal guide and external guide( if any). of the 80 . University of Kerala 08. the student's performance will be evaluated based on the project work.B. 2.Tech Information Technology. There should be a mid-semester and end-semester evaluation of the project. Implementing and deploying web applications using Servlets.
This action might not be possible to undo. Are you sure you want to continue?
We've moved you to where you read on your other device.
Get the full title to continue reading from where you left off, or restart the preview.