Course Description

AC6/6/2012 ItemNo.4.
76

UNIVERSITY OF MUMBAI
Bachelor of Engineering
FirstYearEngineering(SemesterI&II),Revisedcourse (REV2012)fromAcademicYear201213, (CommonforAllBranchesofEngineering)
(As per Credit Based Semester and Grading System with effect from the academic year 20122013)
FirstYearEngineering(SemesterI&II),Revisedcoursefrom AcademicYear201213,(REV2012),
SubCode FEC101 FEC102 FEC103 FEC104 FEC105 FEC106 FEL101 SubjectName TeachingScheme CreditsAssigned Theory Pract. Tut. Theory TW/Pract Tut. AppliedMathematicsI 04 01 04 01 AppliedPhysicsI 03 01 03 0.5 AppliedChemistryI 03 01 03 0.5 EngineeringMechanics 05 02 05 01 BasicElectrical& 04 02 04 01 ElectronicsEngineering Environmentalstudies 02 02 BasicWorkshopPracticeI 04 02 21 10 01 21 05 01
Total 05 3.5 3.5 06 05 02 02 27
(CommonforallbranchesofEngineering) SchemeforFESemesterI
Sub. Code SubjectName ExaminationScheme TheoryMarks Term Pract. Oral InternalAssessment Endsem. Work exam Test1 Test2 Average ofTest1 andTest2 20 20 20 80 25 15 15 20 20 15 15 20 20 15 15 20 20 60 60 80 80 25 25 25 25 25 25 Total
FEC101 Applied MathematicsI FEC102 AppliedPhysicsI FEC103 Applied ChemistryI FEC104 Engineering Mechanics FEC105 BasicElectrical& Electronics Engineering FEC106 Environmental studies FEL101 BasicWorkshop PracticeI
125 100 100 150 150
15
15
15 105
60 420
50 175
50
75 50 750
FirstYearEngineering(SemesterI&II),Revisedcoursefrom AcademicYear201213,(REV2012),(Commonforallbranches)
Subject SubjectName Code FEC201 Applied MathematicsII FEC202 AppliedPhysicsII FEC203 AppliedChemistryII FEC204 EngineeringDrawing FEC205 Structured Programming Approach FEC206 CommunicationSkills FEL201 BasicWorkshop PracticeII TeachingScheme Theory Pract. Tut. 04 01 03 03 03 04 01 01 04 02 CreditsAssigned TW/Pract Tut. Total 01 05 0.5 0.5 02 01 3.5 3.5 05 05
Theory 04 03 03 03 04
02 19
02 04 14
01
02 19
01 02 07
01
03 02 27
SchemeforSemesterII
Sub. Code SubjectName ExaminationScheme Theorymarks Term Pract InternalAssessment Endsem. Work . exam Test1 Test2 Av.of Test1&2 20 20 20 80 25 15 15 15 20 15 15 15 20 15 15 15 20 60 60 60 80 25 25 25 25 50 25 Oral Total 125 100 100 150 150
FEC201 FEC202 FEC203 FEC204 FEC205
Applied MathematicsII Applied PhysicsII Applied ChemistryII Engineering Drawing Structured Programming Approach Communication Skills BasicWorkshop PracticeII
FEC206 FEL201
10
10
10 95
40 380
25 50 200
75
75 50 750

Sub Code SubjectName TeachingScheme Theory 04 Pract. Tut. 01 Theory 04 CreditsAssigned TW/Pract Tut. 01 Total 05
FEC101 Applied MathematicsI
Sub. Code
SubjectName
ExaminationScheme Theory InternalAssessment Test1 Test2 20 End sem. Av.ofTest1 exam &2 20 80 Term Work Prat. Oral
Total
FEC101
Applied MathematicsI
20
25
125
DetailedSyllabus Sr.No 1 Topics Hrs
Prerequisite: Review on Complex NumberAlgebra of Complex Number, 2hrs Different representations of a Complex number and other definitions, DMoivresTheorem. Module1:Complex Numbers: 1.1: 1.2: PowersandRootsofExponentialandTrigonometricFunctions. Circularfunctionsofcomplex numberandHyperbolicfunctions.Inverse 2hrs 6hrs 3hrs
CircularandInverseHyperbolicfunctions.Logarithmicfunctions. 1.3: 1.4: SeparationofrealandImaginarypartsofalltypesofFunctions.
Expansion of sinn,cosn in terms of sines and cosines of 2hrs multiplesofandExpansionofsinn,cosninpowersofsin,cos
Module2:Matrices and Numerical Methods: 2.1:
TypesofMatrices(symmetric,skewsymmetric,Hermitian,Skew 9hrs
Hermitian,Unitary, Orthogonal Matrices and properties of Matrices).Rank of a Matrix using Echelon forms, reduction to normal form, PAQ forms, system of
homogeneous and non homogeneous equations, their consistency and solutions.Lineardependentandindependentvectors. 2.2: Solution of system of linear algebraic equations, by (1) Gauss Elimination Method (Review) (2) Guass Jordan Method (3) Crouts Method (LU) (4) Gauss Seidal Method and (5) Jacobi iteration (Scilab programming for 6hrs abovemethodsistobetaughtduringlecturehours) 3 Module3:Differential Calculus: 3.1:
Successive differentiation: nth derivative of standard functions. 5hrs LeibnitzsThoerem(withoutproof)andproblems. 7hrs 3hrs
3.2:
PartialDifferentiation:Partialderivativesoffirstandhigherorder,total differentials,differentiationofcompositeandimplicitfunctions.
3.3:
Eulers Theorem on Homogeneous functions with two and three independentvariables(withproof).DeductionsfromEulersTheorem.
Module4: Application of Partial differentiation, Expansion of functions , Indeterminate forms and curve fitting:
3.1.:MaximaandMinimaofafunctionoftwoindependentvariables. 4hrs Lagranges method of undetermined multipliers with one constraint. Jacobian, Jacobian of implicit function. Partial derivative of implicit function using jacobian. 3.2: Taylors Theorem(Statement only) and Taylors series, Maclaurins series (Statement only).Expansion of ex, sinx, cosx, tanx, sinhx, 6hrs
coshx, tanhx, log(1+x), sin1x, cos1x, Binomial series. Indeterminate forms, L HospitalRule,problemsinvolvingseriesalso. 3.3:Fittingofcurvesbyleastsquaremethodforlinear,parabolic,and 5hrs exponential. Regression Analysis(to be introduced for estimation only) (Scilab programming related to fitting of curves is to be taught during lecturehours)
RecommendedBooks: 1: A text book of Applied Mathematics, P.N.Wartikar and J.N.Wartikar,Vol I and II by Pune Vidyarthi Graha. 2:HigherEngineeringMathematics,Dr.B.S.Grewal,KhannaPublication 3:AdvancedEngineeringMathematics,ErwinKreyszig,WileyEasternLimited,9thEd. 4:MatricesbyShantiNarayan. 5:NumericalbyS.S.Sastry,PrenticeHall TheoryExamination: 1.Questionpaperwillcompriseof6questions,eachcarrying20marks. 2.Total4questionsneedtobesolved. 3:QuestionNo.1willbecompulsoryandbasedonentiresyllabuswhereinsubquestionsof2to3marks willbeasked. 4:Remainingquestionwillberandomlyselectedfromallthemodules. 5:Weightageofmarksshouldbeproportionaltonumberofhoursassignedtoeach Module. TermWork: GeneralInstructions: (1)Batchwisetutorialsaretobeconducted.Thenumberofstudentsperbatchshould beasperUniversitypatternforpracticals. (2)StudentsmustbeencouragedtowriteScilabProgramsintutorialclassonly.Each Studenthastowriteatleast4Scilabtutorials(includingprintout)andatleast 6classtutorialsonentiresyllabus. (3)SciLabTutorialswillbebasedon(1)GuassJordanMethod(2)Crouts Method(LU)(3)GuassSeidalMethodand(4)Jacobiiteration(5)CurveFitting forlinear,parabolicandexponentialfunctions
Thedistributionofmarksfortermworkwillbeasfollows, Attendance(TheoryandTutorial) ClassTutorialsonentiresyllabus SciLabTutorials :10 :05marks :10marks
Thefinalcertificationandacceptanceoftermworkensuresthesatisfactory Performanceoflaboratoryworkandminimumpassinginthetermwork.
Sub Code
Subject Name
Teaching Scheme Theory 03 Pract. 01 Tut. Theory 03
Credits Assigned TW/Pract 0.5 Tut. Total 3.5
FEC102 Applied Physics-I
Sub. Code
Subject Name
FEC102 Applied Physics-I
Examination Scheme Theory (out of 75) Internal Assessment (out of 15) End sem. Test 1 Test 2 Average of Test exam (out of 60) 1 and Test 2 15 15 15 60
Term Work
Pract.
Oral
Total
25
100
Detailed Syllabus: 1. CRYSTAL STRUCTURE (15)
Crystallography: Space lattice, Unit Cell, Lattice parameters, Bravais lattices and Crystal systems, Cubic crystal system & lattices; Density & Packing Fraction; Miller indices of crystallographic planes & directions; interplanar distance; Diamond structure, NaCl structure, HCP structure, BaTiO3 structure; Ligancy and Critical radius ratio; Determination of crystal structure using X-ray diffraction techniques viz. Laue method, rotating crystal method (Bragg method) & powder method; Real crystals & pointdefects; photonic crystals; Liquid crystal phases and application in LCD ( with brief introduction of optical polarization). 2. SEMICONDUCTOR PHYSICS (14)
Energy bands of solids and classification of solids; Concepts of holes, effective mass; drift mobility and conductivity in conductors, intrinsic semiconductors and extrinsic semiconductors; Fermi-Dirac distribution function and Fermi energy level in a conductor, insulator, intrinsic & extrinsic semiconductor; Effect of impurity concentration and temperature on the Fermi Level; Hall Effect (applied electric field along x-axis and applied magnetic field along z-axis) and its application. Drift and Diffusion of charge carriers across the Energy band structure of P-N Junction leading to formation of depletion region and potential barrier; concept of carrier current densities in p-n junction in
equilibrium, forward bias and reverse bias; Uses of p-n junction in Light emitting diode (LED), photoconductors & photovoltaic solar cells. 3. DIELECTRICS & MAGNETIC MATERIALS (09)
Dielectric material, dielectric constant, polarization, polarizability & its types; relative permittivity; Piezoelectrics, Ferroelectrics, Applications of dielectric materials - Requirement of good insulating material, some important insulating material. Origin of magnetization using Atomic Theory; classification of magnetic materials based on Susceptibility value; Qualitative treatment of Langevins and Weiss equation for Dia, Para and Ferro magnetic materials (no derivation); Microstructure of ferromagnetic solids- Domains and Hysteresis loss; Soft & hard magnetic materials and their uses; Magnetic circuits and microscopic Ohms Law. 4. ACOUSTICS & ULTRASONICS: (07 )
Introduction to architectural acoustics; reverberation and Sabines formula; Common Acoustic defects and Acoustic Design of a hall Ultrasonic Waves and their applications; Methods of production of ultrasonic waves (Piezoelectric Oscillator & Magnetostriction Oscillator) ---------------------------------------------------------------------------------------------------Books Recommended: 1. A Textbook of Engineering physics - Avadhanulu & Kshirsagar, S.Chand 2. Applied Solid State Physics - Rajnikant, Wiley india 3. Engineering Physics- Uma Mukherji ( third edition), Narosa 4. Engineering Physics - R.K.Gaur & S.L. Gupta, Dhanpat Rai publications 5. Solid State physics - A.J. Dekker, Macmillan Student Edition 6. Modern Engineering Physics Vasudeva, S.Chand 7. Solid State Physics- Charles kittle, EEE Pbl 8. Concepts of Modern Physics- Arther Beiser, Tata Mcgraw Hill Suggested Experiments: (Any five) 1. Study of SC, BCC, FCC. 2. Study of Diamond, NaCl ,BaTiO3. 3. Study of HCP structure.
4. Study of Miller Indices Plane and direction. 5. Study of Hall Effect. 6. Determination of energy band gap of semiconductor. 7. Determination of h using photocell. 8. Study of Ultrasonic Distance Metre. 9. Determination of losses using hysteresis loop. 10. Study of I / V characteristics of semiconductor diode. Note: Distribution of marks for term work 1. Laboratory work (Experiments and Journal): 15 marks 2. Assignments :05 marks 3. Attendance (Practical and Theory): 05marks Theory Examination: 1. Question paper will comprise of 6 questions, each carrying 15 marks. 2. Total 4 questions need to be solved. 3: Q.1 will be compulsory, based on entire syllabus wherein sub questions of 2 to 3 marks will be asked. 4: Remaining question will be randomly selected from all the modules. 5: Weightage of marks should be proportional to number of hours assigned to each Module.
Sub Code
SubjectName
TeachingScheme
CreditsAssigned
Theory 03
Pract. 01
Tut.
Theory 03
TW/Pract 0.5
Tut.
Total 3.5
FEC103 Applied ChemistryI Sub. Code SubjectName
ExaminationScheme Theory(outof75) InternalAssessment (outof15) Test1 Test2 Averageof Test1and Test2 15 Endsem. exam (outof 60) Term Work Pract. Oral Total
FEC103 Applied ChemistryI 15
15
60
25
100
Detailsofthesyllabus: Sr.No. Module1 Water: Impuritiesinwater,Hardnessofwater,DeterminationofHardnessof waterbyEDTAmethodandproblems.SofteningofwaterbyHotcold limesodamethodandproblems.Zeoliteprocessandproblems.Ion Exchangeprocessandproblems. DrinkingwaterorMunicipalwater,Treatmentsremovalof microorganisms,byaddingBleachingpowder,Chlorination(no breakpointchlorination),DisinfectionbyOzone,Electrodialysisand Reverseosmosis,ultrafiltration. BOD,COD(def,&significance),sewagetreatmentsactivatedsludge process,numericalproblemsrelatedtoCOD. Details Hrs 12
Module 2
Polymers: Introductiontopolymers,ThermoplasticandThermosettingplastic. Ingredientsoftheplastic(Compoundingofplastic.) FabricationofplasticbyCompression,Injection,Transfer,Extrusion molding.Preparation,propertiesandusesofPhenolformaldehyde, PMMA,Kevlar. Effectofheatonthepolymers(Glasstransitiontemperatures) Polymersinmedicineandsurgery. Conductingpolymers,Industrialpolymers. Rubbers: Naturalrubber(latex),Drawbacksofnaturalrubber,Compoundingof rubber(vulcanizationofrubber),Preparation,propertiesandusesof BunaS,SiliconeandPolyurethanerubber. Lubricants Introduction,Definition,MechanismofLubrication,Classificationof lubricants,Solidlubricants(graphite&Molybdenumdisulphide), Semisolidlubricants(greasesNabase,Libase,Cabase,Axlegreases.), Liquidlubricants(blendedoils). Importantpropertiesoflubricants,definitionandsignificance ,viscosity,viscosityindex,flashandfirepoints,cloudandpourpoints, oiliness,Emulsification,Acidvalueandproblems,Saponificationvalue andproblems. PhaseRule GibbsPhaseRule,Explanation,OneComponentSystem(Water), ReducedPhaseRule,TwoComponentSystem(PbAg),Limitationsof PhaseRule. ImportantEngineeringMaterials CementManufactureofPortlandCement,ChemicalCompositionand ConstitutionofPortlandCement,SettingandHardeningofPortland Cement,ConcreteRCCandDecay.RefractoriesPreparation, propertiesandusesofSilicabricks,Dolomitebricks,SiliconCarbide (SiC). Nanomaterials,preparation(LaserandCVDmethod),propertiesand usesofCNTS
12
Module 3
08
Module 4
05
Module 5
08
TheoryExamination:
1.Questionpaperwillcompriseoftotal6questions,eachof15marks. 2.Totalfourquestionsneedtobesolved.
3.Question1willbecompulsoryandbasedonentiresyllabuswhereinsubquestionsof2to3marks willbeasked. 4.Remainingquestionswillbemixedinnature(forexamplesupposeQ.2haspart(a)frommodule3 thenpart(b)willbeformanymoduleotherthanmodule3). 5.Inquestionpaperweightageofeachmodulewillbeproportionaltonumberofrespectivelecture hoursasmentionedinthesyllabus. Termwork: Termworkshallconsistofminimumfiveexperiments.Thedistributionofmarksfortermworkshallbe asfollows: LaboratoryWork(Experimentsandjournal):10marks Attendance(PracticalandTheory):05marks Assignments:10marks Total:25marks ThefinalcertificationandacceptanceofTWensuresthesatisfactoryperformanceoflaboratorywork andminimumpassingintheTW. SuggestedExperimentsAppliedChemistryI 1)Todeterminetotal,temporaryandpermanenthardnessofwatersample. 2)Removalofhardnessusingionexchangecolumn. 3)TodetermineSaponificationvalueofalubricatingoil. 4)Todetermineacidvalueofalubricatingoil. 5)TodeterminefreeacidPHofdifferentsolutionsusingPHmeter/Titration. 6)Todeterminemetalionconcentrationusingcolorimeter. 7)Todetermineflashpointandfirepointofalubricatingoil 8)TodetermineChloridecontentofwaterbyMohrsMethod. 9)Todeterminemeltingpointand/orglasstransitiontemperatureofapolymer.
10)Todetermineconductanceofpolymer. 11)Todeterminethepercentageoflimeincement. 12)HardeningandsettingofcementusingVicatsapparatus 13)TodeterminetheCODofthegivenwatersample./Dichromatemethod. 14)ViscositybyRedwoodViscometer. Recommended Books: 1. Engineering Chemistry Jain & Jain, Dhanpat Rai 2. Engineering Chemistry Dara & Dara, S Chand 3. Engineering Chemistry Wiley India (ISBN-9788126519880) 4. A Text Book of Engineering Chemistry Shashi Chawla (Dhanpat Rai)

Sub Code Subject Name Teaching Scheme Theory 05 Pract. 02 Tut. Theory 05 Credits Assigned TW/Pract 01 Tut. Total 06
FEC104 Engineering Mechanics
Sub. Code
Subject Name
FEC104 Engineering Mechanics
Examination Scheme Theory (out of 100) Internal Assessment (out of 20) End sem. Test 1 Test 2 Average of Test 1 exam (out of and Test 2 80) 20 20 20 80
Term Work
Pract.
Oral
Total
25
25
150
Details of Syllabus: Sr.No. 01 Topics 1.1 System of Coplanar forces:Resultant of Concurrent forces, Parallel forces, Non Concurrent Non Parallel system of forces, Moment of force about a point, Couples, Varignons Theorem. Distributed Forces in plane. 1.2 Center of Gravity and Centroid for plane Laminas. 02 2.1 Equilibrium of system of coplanar forces:Condition of equilibrium for concurrent forces, parallel forces and Non concurrent Non Parallel general forces and Couples. 2.2 Types of support, loads, Beams, Determination of reactions at supports for various types of loads on beams. 2.3 Analysis of plane trusses by using Method of joints and Method of sections.(Excluding pin jointed frames) 03 3.1 Forces in space: Resultant of Noncoplanar force systems: Resultant of Concurrent force system, Parallel force system and Nonconcurrent nonparallel force system. Hrs 05
04
06
04
04
05
Equilibrium of Noncoplanar force systems: Equilibrium of Concurrent force system, Parallel force system and Nonconcurrent nonparallel force system. 3.2 Friction: Introduction to Laws of friction, Cone of friction, Equilibrium of bodies on inclined plane, Application to problems involving wedges, ladders. 4.1 Kinematics of Particle: - Velocity & acceleration in terms of rectangular co-ordinate system, Rectilinear motion, Motion along plane curved path, Tangential & Normal component of acceleration, Motion curves (a-t, v-t, s-t curves), Projectile motion, Relative velocities. 06
04
10
05
5.1 Kinematics of Rigid Bodies :- Introduction to general plane motion, 06 Instantaneous center of rotation for the velocity, velocity diagrams for bodies in plane motion, (up to 2 linkage mechanism) 6.1 Kinetics of a Particle: Force and Acceleration:- Introduction to basic 04 concepts, DAlemberts Principle, Equations of dynamic equilibrium, Newtons Second law of motion. 6.2 Kinetics of a Particle: Work and Energy: -Principle of Work and Energy, Law of Conservation of Energy. 6.3 Kinetics of a Particle: Impulse and Momentum:-Principle of Linear Impulse and Momentum. Law of Conservation of momentum. Impact and collision. 03
06
03
Theory Examination:
1. Question paper will comprise of 6 questions, each carrying 20 marks. 2. Total 4 questions need to be solved. 3: Question No.1 will be compulsory and based on entire syllabus wherein sub questions of 2 to 3 marks will be asked.
4. Remaining questions will be mixed in nature.( e.g. Suppose Q.2 has part (a) from module 3 then part (b) will be from any module other than module 3 ) having 15 marks each. 5. In question paper weightage of each module will be proportional to number of respective lecture hours as mentioned in the syllabus. Oral examination:Oral examination will be based on entire syllabus.
Term work:Term work shall consist of minimum six experiments, assignments consisting numerical based on above syllabus, at least 3 numerical from each module. The distribution of marks for term work shall be as follows: Laboratory work (Experiment/ programs and journal) Assignments Attendance (Theory and Practical) :10 marks : 10 marks : 05 marks
The final certification and acceptance of term work ensures the satisfactory performance of laboratory work and minimum passing in the term work. List of experiments:1. Polygon law of coplanar forces. 2. Non concurrent non parallel (general). 3. Bell crank lever. 4. Support reaction for beam. 5. Simple / compound pendulum. 6. Inclined plane (to determine coefficient of friction). 7. Collision of elastic bodies (Law of conservation of momentum). 8. Moment of Inertia of fly wheel. 9. Screw friction by using screw jack. Any other experiment based on above syllabus. Recommended Books 1. Engineering Mechanics by Hibblar, McMillan. 2. Engineering Mechanics by Beer & Johnson, Tata McGraw Hill 3. Engineering Mechanics by Merium, Wiley. 4. Engineering Mechanics by F. L. Singer, Harper & Raw Publication 5. Engineering Mechanics by Macklin & Nelson, Tata McGraw Hill 6. Engineering Mechanics by Shaum Series, 7. Engineering Mechanics by Tayal, Umesh Publication.
Sub Code
Subject Name
Teaching Scheme Theory 04 Pract. 02 Tut. Theory 04
Credits Assigned TW/Pract 01 Tut. Total 05
FEC105 Basic Electrical & Electronics Engineering
Sub. Code
Subject Name
Examination Scheme Theory (out of 100) Internal Assessment (out of 20) End sem. Test 1 Test 2 Average of Test exam (out of 80) 1 and Test 2 20 20 20 80
Term Work
Pract.
Oral
Total
FEC105 Basic Electrical & Electronics Engineering
25
25
150
Detailed Syllabus: Module Content A. Concept of e.m.f, potential difference, current, ohms law, resistance, resistivity, series and parallel connections, power dissipation in resistance, effect of temperature on resistance B. Capacitors, with uniform and composite medium, energy stored in capacitor, R-C time constant. C. Magnetic field, Faradays laws of Electromagnetic induction, Hysterics and eddy current losses, energy stored in an inductor, time constant in R-L circuit. D.C. circuits: (only independent sources). Kirchhoff s laws, Ideal and practical voltage and current source, Mesh and Nodal analysis (super node and super mesh excluded), Source transformation, Star-delta transformation ,Superposition theorem, Thevenins theorem, Nortons theorem, Maximum power transfer theorem, (Source transformation not allowed for Superposition theorem, Mesh and Nodal analysis) Hours No questions to be asked in Theory paper on Prerequisite 02
Prerequisite
20
A.C Circuits : Generation of alternating voltage and currents, RMS and Average value, form factor , crest factor, AC through resistance, inductance and capacitance, R-L , R-C and R-L-C series and parallel circuits, phasor diagrams , power and power factor, series and parallel resonance, Q-factor and bandwidth Three phase circuits : Three phase voltage and current generation, star and delta connections (balanced load only), relationship between phase and line currents and voltages, Phasor diagrams, Basic principle of wattmeter, measurement of power by two wattmeter method Single phase transformer : Construction, working principle, Emf equation, ideal and practical transformer, transformer on no load and on load, phasor diagrams, equivalent circuit, O.C. and S.C test, Efficiency Electronics (no numericals): Semiconductor diode, Diode rectifier with R load: Half wave, full wave center tapped and bridge configuration, RMS value and average value of output voltage, ripple factor, rectification efficiency, introduction to C and L filter (no derivation). CE, CB, CC transistor configuration, CE input-output characteristics.
12
10
10
06
Theory Examination: 1. Question paper will comprise of 6 questions, each carrying 20 marks. 2. Total 4 questions need to be solved. 3: Q.1 will be compulsory, based on entire syllabus wherein sub questions of 2 to 3 marks will be asked. 4: Remaining question will be randomly selected from all the modules. 5: Weightage of marks should be proportional to number of hours assigned to each Module.
List of laboratory experiments (Minimum Six): 1. Mesh and Nodal analysis. 2. Verification of Superposition Theorem. 3. Verification Thevenins Theorem. 4. Study of R-L series and R-C series circuit. 5. R-L-C series resonance circuit 6. R-L-C parallel resonance circuit. 6. Relationship between phase and line currents and voltages in 3 phase System (star & delta)
7. Power and phase measurement in three phase system by two wattmeter method. 8. O.C. and S.C. test on single phase transformer 9. Half wave and full wave rectifier circuits
Recommended Books Text Books 1. V. N. Mittal and Arvind Mittal Basic Electrical Engineering Tata McGraw Hill, (Revised Edition) 2. Electrical Engineering Fundamentals" by Vincent Del Toro, PHI Second edition ,2011 3. Electronics Devices & Circuit Theory" by Boylestad, Pearson Education India 4. Edward Hughes: Electrical and Electrical Technology, Pearson Education (Tenth edition) 5. D P Kothari and I J Nagrath Theory and Problems of Basic Electrical Engineering, PHI 13 th edition 2011.
Reference Books: 1. B.L.Theraja Electrical Engineering Vol-I and II, 2. S.N.Singh, Basic Electrical Engineering PHI , 2011

Sub Code SubjectName TeachingScheme CreditsAssigned
Theory 6 Environmental studies 02
Pract.
Tut.
Theory 02
TW/Pract
Tut.
Total 02
Sub. Code SubjectName ExaminationScheme Theory(outof75) InternalAssessment (outof15) Test1 Test2 Averageof Test1and Test2 15 Endsem. exam (outof 60) Term Work Pract. Oral Total
Environmental studies
15
15
60
75
Detailsofthesyllabus: Sr.No. Module1 Details MultidisciplinaryNatureofEnvironmentalStudies: ScopeandImportance NeedforPublicAwareness DepletingNatureofEnvironmentalresourcessuchasSoil,Water, Minerals,andForests. GlobalEnvironmentalCrisisrelatedtoPopulation,Water,Sanitation andLand. Ecosystem:Concept,Classification,StructureofEcosystem,overview ofFoodchain,FoodwebandEcologicalPyramid Hrs 04
Module 2
SustainableDevelopment Conceptofsustainabledevelopment Social,EconomicalandEnvironmentalaspectofsustainable development. ControlMeasures:3R(Reuse,Recovery,Recycle),Appropriate Technology,Environmentaleducation,Resourceutilizationasperthe carryingcapacity. EnvironmentalPollution: AirPollution:Sources,Effectsofairpollutionwithrespect toGlobalWarming,OzonelayerDepletion,AcidRain, Photochemicalsmog,TwoControlMeasuresBaghouseFilter, Venturiscrubber. CaseStudy:BhopalGasTragedy WaterPollution:SourcesandTreatment,Conceptofwastewaters Domestic&Industrialandtreatment. CaseStudy:MinamataDisease. LandPollution:Solidwaste,SolidwasteManagementbyLandfilling, Composting. NoisePollution;SourcesandEffects EPollution:SourcesandEffects.
04
Module 3
07
Module 4
EnvironmentalLegislation: Overview MinistryofEnvironmentandForests(MoE&F).Organizational structureofMoE&F. FunctionsandpowersofCentralControlPollutionBoard. FunctionsandpowersofStateControlPollutionBoard. EnvironmentalClearance,ConsentandAuthorizationMechanism. EnvironmentalProtectionAct AnytwocasestudiespertainingtoEnvironmentalLegislation. RenewablesourcesofEnergy: LimitationsofconventionalsourcesofEnergy. Variousrenewableenergysources. SolarEnergy:Principle,WorkingofFlatplatecollector&Photovoltaic cell. WindEnergy:Principle,WindTurbines.
05
Module 5
05
Module 6
HydelEnergy:Principle,Hydropowergeneration. GeothermalEnergy:Introduction,SteamPowerPlant EnvironmentandTechnology RoleofTechnologyinEnvironmentandhealth ConceptofGreenBuildings,Indoorairpollution CarbonCredit:Introduction,Generalconcept. DisasterManagement:TwoEvents:Tsunami,Earthquakes,Techniques ofDisasterManagement CaseStudy:EarthquakeinJapan
05
TheoryExamination: 1.Questionpaperwillcompriseoftotal6questions,eachof15marks. 2.Totalfourquestionsneedtobesolved. 3.QuestionNumberOnewillbecompulsoryanditwillbebasedonentiresyllabuswhereinsub questionsof2to3markswillbeasked. 4.Remainingquestionsi.eQ.2toQ.6willbemixedinnatureandwillbedividedinthreeparts(a),(b) &(c)andtheywillbelongtodifferentmodules. 5.Inquestionpaper,weightofeachmodulewillbeproportionaltonumberofrespectivelecturehours asmentionedinthesyllabus. RecommendedBooks: 1. TextbookofEnvironmentalstudiesbyErachBharucha,UniversityPress. 2. EnvironmentalStudiesbyR.Rajagopalan,OxfordUniversityPress. 3. EssentialsofEnvironmentalStudiesbyKurianJoseph&Nagendran,PearsonEducation 4. RenewableEnergybyGodfreyBoyle,OxfordPublications. 5. PerspectiveOfEnvironmentalStudies,byKaushikandKaushik,NewAgeInternational 6.EnvironmentalStudiesby.AnanditaBasak,PearsonEducation 7.TextbookofEnvironmentalStudiesbyDaveandKatewa,CengageLearning 8.EnvironmentalStudiesbyBennyJoseph,TataMcGrawHill
Sub Code
Subject Name
Teaching Scheme Theory Pract. 04 Tut. Theory -
FEL101 Basic Workshop Practice - I Sub. Code Subject Name
FEL101 Basic Workshop Practice-I
Examination Scheme Theory Internal Assessment End sem. Test 1 Test 2 Average of Test exam 1 and Test 2 -
Term Work
Pract.
Oral
Total
50
50
Detailed Syllabus Note:
Periods
1.
The syllabus and the Term- work to be done during semester I and Semester II is given together. Individual Instructor for the course is to design the jobs for practice and demonstration and spread the work over entire two semesters. The objective is to impart training to help the students develop engineering skill sets. This exercise also aims in inculcating respect for physical work and hard labor in addition to some amount of value addition by getting exposed to interdisciplinary engineering domains. The two compulsory trades (Sr. No. 1- Fitting and 2 - Carpentry) shall be offered in separate semesters. Select any four trade topics (two per semester) out of the topic at Sr. n. 3 to 11. Demonstrations and hands on experience to be provided during the periods allotted for the same. Report on the demonstration including suitable sketches is also to be included in the term work 30 Fitting (compulsory) Use and setting of fitting tools for chipping, cutting, filing, marking, center punching, drilling, tapping. Term work to include one job involving following operations : filing to size, one simple male- female joint, drilling and tapping
2.
Carpentry (compulsory) Use and setting of hand tools like hacksaws, jack planes, chisels and gauges for construction of various joints, wood tuning and modern wood turning methods.
30
3.
Term work to include one carpentry job involving a joint and report on demonstration of a job involving wood turning Forging (Smithy) At least one workshop practice job (Lifting hook and handle) is to be demonstrated. Welding Edge preparation for welding jobs. Arc welding for different job like, Lap welding of two plates, butt welding of plates with simple cover, arc welding to join plates at right angles.
15
4.
15
5. 6.
Machine Shop At least one turning job is to be demonstrated. Electrical board wiring House wiring, staircase wiring, wiring diagram for fluorescent tube light, Godown wiring and three phase wiring for electrical motors.
15 15
7.
8.
PCB Laboratory Exercises Layout drawing, Positive and negative film making, PCB etching and drilling, Tinning and soldering technique. Sheet metal working and Brazing Use of sheet metal, working hand tools, cutting , bending , spot welding
15
15
9.
Plumbing Use of plumbing tools, spanners, wrenches, threading dies, demonstration of preparation of a domestic line involving fixing of a water tap and use of coupling, elbow, tee, and union etc.
15
10.
Masonry Use of masons tools like trowels, hammer, spirit level, square, plumb line and pins etc. demonstration of mortar making, single and one and half brick masonry , English and Flemish bonds, block masonry, pointing and plastering.
15
11
Hardware and Networking: Dismantling of a Personal Computer (PC), Identification of Components of a PC such as power supply, motherboard, processor, hard disk, memory (RAM, ROM), CMOS battery, CD drive, monitor, keyboard, mouse, printer, scanner, pen drives, disk drives etc. Assembling of PC, Installation of Operating System (Any one) and Device drivers, Boot-up sequence. Installation of application software (at least one) Basic troubleshooting and maintenance Identification of network components: LAN card, wireless card, switch, hub, router, different types of network cables (straight cables, crossover cables, rollover cables) Basic networking and crimping.
15
NOTE: Hands on experience to be given in a group of not more than four students.
Term work: Term work shall consist of respective reports and jobs of the trades selected the distribution of marks for term work shall be as follows. Laboratory work (Job and Journal) Attendance (Practical and Theory) : 40 marks : 10 marks
The final certification and acceptance of term work ensures the satisfactory performance of laboratory work.
Subject Code FEC201 SubjectName TeachingScheme Theory Applied MathematicsII 04 Pract. Tut. 01 Theory 04 CreditsAssigned TW/Pract Tut. 01 Total 05
Sub. Code SubjectName ExaminationScheme TheoryMarks InternalAssessment Test1 FEC201 Applied MathematicsII 20 Test2 20 Averageof Test1and Test2 20 Endsem. exam TW Prat Oral Total
80
25
125
DetailedSyllabus: Sr.No. 1 Topic Hrs
Prerequiste: Idea of Curve tracing in cartesian, parametric and polar forms. Straight lines, Circles, Parabolas, Hyperbola, Catenary, Cissoid, Astroid, Cycloid, Lemniscate of Bernoulli, Cardiode. Concept of Solid Geometry Planes, Spheres,Cones,Cylinders,Paraboloids(TracingofcurvesbyusingSciLab). 2hrs
Module1:BetaandGammafunctions,DifferentiationunderIntegralsignandexact differentialequation: 1.1: Beta and Gamma functions and its properties. Differentiation under integral 5hrs signwithconstantlimitsofintegration.
1.2:Rectificationofplanecurves.
4hrs
1.3: Differential Equation of first order and first degreeExact differential 4hrs equations,Equationsreducibletoexactequationsbyintegratingfactors.
2 3
Module2:DifferentialCalculus
2.1: Linear differential equations(Review), equation reduciable to linear form, 2hrs Bernoullisequation. 2.2:LinearDifferentialEqautionwith constantcoeffiecientComplimentaryfunction, particularintegralsofdifferentialequationofthetypef(D)y=XwhereXiseax,sin (ax+b),cos(ax+b),xn,eaxV,xV. 6hrs
2.3: Cauchys homogeneous linear differential equation and Legendres 4hrs differentialequation,Methodofvariationofparameters. 2.4: Simple application of differential equation of first order and second order to electrical and Mechanical Engineering problem (no formulation of differential 3hrs equation) Module3: Numerical solution of ordinary differential equations of first order and firstdegreeandMultipleIntegrals 3.1:(a)Taylorsseriesmethod(b)Eulersmethod (c) Modified Euler method (d) RungaKutta fourth order formula (SciLab programmingistobetaughtduringlecturehours) 5hrs
3.2:Multiple IntegralsDouble integrationdefinition, Evaluation of Double Integrals, 10hrs Change of order of integration, Evaluation of double integrals by changing the order of integration and changing to polar form (Examples on change of variables by using Jacobiansonly).
Module4:MultipleIntegralswithApplicationandNumericalIntegration:
4.1: Triple integration definition and evaluation (Cartesian, cylindrical and spherical 3hrs polarcoordinates). 4.2: Application to double integrals to compute Area, Mass, Volume. Application of tripleintegraltocomputevolume. 4.3: Numerical integrationDifferent type of operators such as shift, forward, 5hrs
backward difference and their relation. Interpolation, Newton iterpolation, Newton 7hrs Cotes formula(with proof). Integration by (a) Trapezoidal (b) Simpsons 1/3rd (c) Simpsons 3/8th rule (all with proof). (Scilab programming on (a) (b) (c) (d) is to be taughtduringlecturehours) RecommendedBooks: 1:AtextbookofAppliedMathematics,P.N.WartikarandJ.N.Wartikar,VolIandIIby PuneVidyarthiGraha. 2:HigherEngineeringMathematics,Dr.B.S.Grewal,KhannaPublication 3:AdvancedEngineeringMathematics,ErwinKreyszig,WileyEasternLimited,9thEd. 4:NumericalAnalysisbyS.S.Sastry,PrenticeHall 5:DifferentialEquations,SheplyRoss,WileyIndia. TheoryExamination: 1.Questionpaperwillcompriseof6questions,eachcarrying20marks. 2.Total4questionsneedtobesolved. 3:Q.1willbecompulsory,basedonentiresyllabuswhereinsubquestionsof2to3markswillbeasked. 4:Remainingquestionshouldberandomlyselectedfromallthemodules. 5:Weightageofmarksshouldbeproportionaltonumberofhoursassignedtoeachmodule.
TermWork: GeneralInstructions: (1)Batchwisetutorialsaretobeconducted.Thenumberofstudentsperbatchshouldbe asperUniversitypatternforpracticals. (2)StudentsmustbeencouragedtowriteScilabProgramsduringthetutorials.Eachstudenthastowrite atleast5Scilabtutorials(includingprintout)andatleast5classtutorialsonentiresyllabus. (3) SciLab Tutorials will be based on (1)Curve Tracing (2) from module3 on (a)Taylors series method (b)Eulers method (c) Modified Euler method (d) RungaKutta fourth order formula (4) ordinary differentialequationand(5)Trapezoidal,Simpsons1/3rdandSimpsons3/8thrule. Thedistributionofmarksfortermworkwillbeasfollows, Attendance(TheoryandTutorial) ClassTutorialsonentiresyllabus SciLabTutorials :10 :05marks :10marks
Thefinalcertificationandacceptanceoftermworkensuresthesatisfactoryperformance oflaboratoryworkandminimumpassinginthetermwork.
Subject Code FEC202
Subject Name Applied Physics - II
Teaching Scheme Theory Pract. Tut. 03 01 -
Theory 03
Credits Assigned TW/Pract Tut. 0.5 -
Total 3.5
Sub. Code
Subject Name
FEC202
Applied Physics - II
Examination Scheme Theory Internal Assessment End sem. Test 1 Test 2 Average of Test exam 1 and Test 2 15 15 15 60
Term Work
Prat.
Oral
Total
25
100
1. INTERFERENCE AND DIFFRACTION OF LIGHT
(15)
Interference in thin film - Introduction, interference due to reflected and transmitted light by thin transparent parallel film; origin of colours in thin film; Wedge shaped thin film; Newtons rings; Applications of interference - Determination of thickness of very thin wire or foil, determination of refractive index of liquid, wavelength of incident light , radius of curvature of lens, testing of surface flatness, non-reflecting films, Highly reflecting film Diffraction of Light Introduction; Fraunhoffer diffraction at single slit ; Fraunhoffer diffraction at ouble slit; diffraction due to N- slits ( Diffraction Grating), missing orders, Highest possible orders; determination of wavelength of light with a plane transmission grating; resolving power of a grating; dispersive power of a grating. 2. FIBRE OPTICS AND LASERS: (09)
Fibre optics : Introduction, total internal reflection, basic construction, optical fibre as light guide and types of optical fibre; Numerical Aperture and maximum angle of acceptance, Numerical Aperture for graded index fibre; V-number, Maximum number of possible orders; Losses in optical fibre; Merits of optical fibre; Applications. Lasers : Quantum processes as absorption, spontaneous emission and stimulated emission; metastable states, population inversion, pumping, resonance cavity, Einsteinss equations; Helium Neon laser; Nd:YAG laser; Semiconductor laser, Applications of laser- Holography (construction and reconstruction of holograms) and other applications.
3. QUANTUM MECHANICS:
(08)
Introduction, Wave particle duality, de Broglie wavelength; experimental verification of de Broglie theory; properties of matter waves; wave packet, group velocity and phase velocity; Wave function, Physical interpretation of wave function; Heisenbergs uncertainty principle; Electron diffraction experiment and Gama ray microscope experiment; Applications of uncertainty principle; Schrodingers time dependent wave equation, time independent wave equation, - Motion of free particle, Particle trapped in one dimensional infinite potential well. 4. MOTION OF CHARGED PARTICLE IN ELECTRIC AND MAGNETIC FIELDS (03)
Electrostatic focusing; Magnetostatic focusing; Cathode ray tube (CRT); Cathod ray Oscilloscope (CRO); Application of of CRO, 5. SUPERCONDUCTIVITY: (03)
Introduction, Meissner Effect; Type I and Type II superconductors; BCS Theory(concept of Cooper pair); Josephson effect; Applications of superconductors- SQUID, MAGLEV 6. NANOSCIENCE AND NANOTECHNOLOGY (07)
Introduction to nano-science and nanotechnology; Two main approaches in nanotechnology Bottom up technique and top down technique; Tools used in nanotechnology such as Scanning electron microscope, Scanning Tunneling Microscope, Atomic Force Microscope. Nano materials: Methods to produce nanomaterials; Applications of nanomaterials; Different forms of carbon nanoparticles, carbon nanotubes, properties and applications.
Books Recommended: 1. A Textbook of Engineering physics - Avadhanulu & Kshirsagar, S.Chand 2. Engineering Physics- Uma Mukherji ( third edition), Narosa 3. Engineering Physics - R.K.Gaur & S.L. Gupta, Dhanpat Rai publications 4. Modern Engineering Physics Vasudeva, S.Chand 5. Concepts of Modern Physics- Arther Beiser, Tata Mcgraw Hill 6. A textbook of Optics - N. Subramanyam and Brijlal, S.Chand 7. Optics - Ajay Ghatak, Tata Mc Graw Hill 8. Intoduction to Nanotechnology- Charles P. Poole, Jr., Frank J. Owens,Wiley India edition 9. Nano: The Essential T. Pradeep, Mcgraw-Hill Education
Suggested Experiments: (Any five) 1. Determination of radius of curvature of a lens using Newtons ring set up 2. Determination of diameter of wire/hair or thickness of paper using Wedge shape film method. 3. Determination of wavelength using Diffracion grating.(Hg/ Na source) 4. Determination of number of lines on the grating surface using Diffracion grating. 5. Determination of Numerical Aperture of an optical fibre. 6. Determination of wavelength using Diffracion grating.(Laser source) 7. Use of CRO for measurement of frequency and amplitude. 8. Use of CRO for measurement of phase angle. 9. Study of divergence of laser beam 10. Determination of width of a slit using single slit diffraction experiment(laser source)
Note: Distribution of marks for term work 1. Laboratory work (Experiments and Journal) : 15 marks 2. Assignments : 05 marks 2. Attendance (Practical and Theory): 05marks
Subject Code FEC203 SubjectName TeachingScheme Theory Applied ChemistryII 03 Pract. 01 Tut. Theory 03 CreditsAssigned TW/Pract 0.5 Tut. Total 3.5
Sub. Code SubjectName ExaminationScheme TheoryMarks InternalAssessment Test1 FEC203 Applied ChemistryII 15 Test2 15 Averageof Test1and Test2 15 Endsem. exam TW Prat Oral Total
60
25
100
Detailsofthesyllabus: Details Module1: Corrosion: Introduction:TypesofCorrosion(I)DryorChemicalCorrosioni)Duetooxygenii) duetoothergases.(II)WetorElectrochemicalCorrosion:Mechanismi)Evolutionof hydrogentypeii)Absorptionofoxygen.TypesofElectroChemicalCorrosion Galvaniccellcorrosion,Concentrationcellcorrosion(differentialaeration),pitting corrosion,Intergranularcorrosion,StressCorrosion,Polarization. Factorsaffectingtherateofcorrosion:Natureofmetal,positioningalvanicseries, potentialdifference,overvoltage,relativeareaoftheanodicandcathodicparts, purityofmetal,natureofthecorrosionproduct,temperature,moisture,influenceof PH,concentrationsoftheelectrolytes. Hrs 10
MethodstoDecreasetherateofCorrosion:Properdesigning,usingpuremetal, usingmetalalloys,Cathodicprotectioni)Sacrificialanodicprotection,ii)Impressed currentmethod,Anodicprotectionmethod,Metalliccoatings,hotdipping, galvanizing,tinning,metalcladding,metalspraying,Electroplating,Cementation, OrganicCoatings,Paintsonlyconstituentsandtheirfunctions.
Module2: Alloys: Introduction,purposeofmakingalloys,FerrousAlloys,plaincarbonsteel,heat resistingsteels,stainlesssteels(corrosionresistantsteels),effectofthealloying element,Ni,Cr,Co,Mg,Mo,W,andV. NonFerrousAlloysAlloysofAli)Duraluminii)Magnalumin.AlloysofCuBrasses i)Commercialbrassii)GermanSilver.Bronzesi)Gunmetalii)Highphosphorus bronze.Alloysofpbi)Woodsmetal.ii)Tinmanssolders.Theircomposition (Reference1byJain&Jain),properties&uses. PowderMetallurgy:Introduction,methodsofmetalpowderformation(1)(a) Mechanicalpulverization(b)Atomization(c)Chemicalreduction(d)Electrolytic process(e)Decomposition.(2)Mixing&blending(3)Sintering.(4)Compacting: Variousmethodssuchasi)coldpressing.ii)Powderinjectionmoulding.iii)Hot compaction. Applicationsofpowdermetallurgy. Manufactureofoxide&nonoxideceramicpowdersonlyi)Aluminaii)Silicon Carbide Module3: Fuels Definition,Classificationoffuelssolid,Liquid&Gaseous.Calorificvaluedef. GrossorHigherC.V.&NetorlowerC.V.unitsofheat(noconversions).Dulongs formula&numericalsforcalculationsofGross&NetC.V.Analysisofcoali) ProximateAnalysiswithnumericalsanditsimportanceii)UltimateAnalysiswith numericalsanditsimportance,Characteristicpropertiesofthegoodfuel. LiquidFuelsCrudepetroleumoil;itscomposition&classification&mining(in brief).Refiningofcrudeoili)separationofwaterii)SeparationofS&iii) Fractionaldistillationwithdiagram&compositiontable. CrackingDefinition;TypesofcrackingI)ThermalCracking(a)Liquidphase thermalcrackingb)Vapourphasethermalcracking.II)CatalyticCracking(a)Fixed bedcatalyticcracking(b)Movingbedcatalyticcracking.AdvantagesofCatalytic
09
12
Cracking. Petrol:Refiningofpetrol,unleadedpetrol(MTBEuseof catalyticconverter),poweralcohol.Knocking,Octane number(antiknockingagents),Cetanenumber Combustion:calculationsforrequirementofonlyoxygen&air(byweight&by volumeonly)forgivensolid,liquid&gaseousfuels. Biodiesel,MethodtoobtainBiodieselfromvegetableoils(Transesterification), advantagesanddisadvantagesofBiodiesel. Propellants:Definition,Characteristicsofagoodpropellant,classificationof propellants,Twoexampleseach. Module4: CompositeMaterialsandAdhesives: Introduction,Constitutioni)Matrixphaseii)Dispersedphase.Characteristic propertiesofcompositematerialsClassificationA)Particlereinforcedcomposites i)Largeparticlecompositesii)DispersionstrengthenedComposites.B)Fiber ReinforcedComposites(i)Continuousaligned(ii)Discontinuous(short)(a)aligned(b) Randomlyoriented.(C)StructuralComposites(i)Laminates(ii)SandwichPanels. Adhesives: Introduction,Adhesiveaction,PhysicalFactorsInfluencingAdhesive action,ChemicalFactorsInfluencing,Adhesiveaction,BondingProcessesby adhesives. Module5: GreenChemistry: Introduction,TwelvePrinciplesofGreenchemistry,numericalsonatomeconomy, synthesis,adipicacidandindigo. Greensolvents(ionicliquidsupercriticalCO2),andproductsfromnaturalmaterials. TheoryExamination: 1.Questionpaperwillcompriseoftotal6questions,eachof15marks. 2.Totalfourquestionsneedtobesolved. 3.Question1willbecompulsoryandbasedonentiresyllabuswhereinsubquestionsof2to3marks willbeasked. 04 10
4.Remainingquestionswillbemixedinnature(forexamplesupposeQ.2haspart(a)frommodule3 thenpart(b)willbeformanymoduleotherthanmodule3. 5.Inquestionpaperweightageofeachmodulewillbeproportionaltonumberofrespectivelecture hoursasmentionedinthesyllabus. Termwork: Termworkshallconsistofminimumfiveexperiments.Thedistributionofmarksfortermworkshallbe asfollows: LaboratoryWork(Experimentsandjournal):10marks Attendance(PracticalandTheory):05marks Assignments:10marks Total:25marks ThefinalcertificationandacceptanceofTWensuresthesatisfactoryperformanceoflaboratorywork andminimumpassingintheTW. SuggestedExperiments EstimationofZnComplexometrictitration. EstimationofNicomplexometrictitration. EstimationofAlcomplexometrictitration. CalorificvalueofsolidorliquidfuelusingBombCalorimeter. PreparationofmembranesforfilteranyoneDemon. CO2fromairbyOrsatsmethod. EstimationofFefromplainCsteel. EstimationofNibygravimetricmethod. EstimationofSniodometrically. PreparationofBiodieselfromedibleoil. Synthesisofsimplelayeredmaterialsandtheircharacterization. Preparingsimplecompositesandtheircharacterization. EstimationofCuiodometrically. Estimate%ofMoisturefromcoal. Tode4terminetheEcellofCuZnsystembypotentiometry. RecommendedBooks: 1.EngineeringChemistryJain&Jain,DhanpatRai 2.EngineeringChemistryDara&Dara,SChand 3.EngineeringChemistryWileyIndia(ISBN9788126519880) 4.ATextBookofEngineeringChemistryShashiChawla(DhanpatRai) AppliedChemistryII
Subject SubjectName Code FEC204 EngineeringDrawing
TeachingScheme Theory Pract. Tut. 03 04
CreditsAssigned Theory TW/Pract Tut. 03 02
Total 05
Sub. Code
SubjectName
FEC204 Engineering Drawing
ExaminationScheme TheoryMarks InternalAssessment Endsem. Test1 Test2 AverageofTest exam 1andTest2 15 15 15 60
Term Pract Work .
Oral
Total 150
25
50
Preamble Considering the recent practices in industries and easy availability of software this conventional drawing may be totally converted in to AutoCAD from the next revision. Objective of the course 1) Students should be able to visualize the objects. 2) They should be able to understand and read drawing. 3) They should be able to present the same. Module Details Introduction to Engineering Drawing. Types of Lines, Dimensioning Systems as per IS conventions. Engineering Curves: Basic construction of Cycloid, Involutes and Helix( of cylinder) only **Introduction to Auto CAD:- Basic Drawing and Editing Commands. Knowledge of setting up layers, Dimensioning, Hatching, plotting and Printing. Projection of Points and Lines:-Lines inclined to both the Reference Planes. (Excluding Traces). @Projection of Planes: Triangular, Square, Rectangular, Pentagonal, Hexagonal and Circular planes inclined to either HP or VP only. (Exclude composite planes) Hrs
Projection of Solids: - (Prism, Pyramid, Cylinder, Cone only) Solid projection with the axis inclined to HP and VP. (Exclude Spheres , Composite and Hollow solids).. Use change of position or Auxiliary plane method Section of solids:- section of Prism, Pyramid, Cylinder, &Cone , cut by plane perpendicular to at least one reference plane.( Exclude Curved section Plane). Use change of position or Auxiliary plane method Development of Surfaces:- Lateral surface development of Prism, Pyramid, Cylinder, Cone with section plane inclined to HP or VP only. (Exclude Reverse Development) Orthographic projections:
14
Different views of a simple machine part as per the first angle projection method recommended by I.S. Full or Half Sectional views of the Simple Machine parts.
12
**Drawing of orthographic projections using Auto CAD. Isometric Projections: Isometric projection/Drawing of blocks (plain and cylindrical excluding spheres). 5 **Drawing of Isometric projections using Auto CAD. @Reading of orthographic projections. (Only for TW) 10
*Orthographic Reading using Auto CAD. **Introduction to 3D in AutoCAD Working in 3-dimensions, Viewing 3D Objects, Basic wireframe models, Extruding, simple revolved objects. Boolean operations. Generation of orthographic projections from 3D drawing.
**Should be covered during Auto CAD practical. @ only in Term Work.(i.e:-Questions will not be asked for the examination.) Term Work: Component-1 Sheet-1: Projection of Solids (2 problems) + Section and Development of solid surfaces (2 problem) Sheet -2: Sheet -3: Sheet- 4: Orthographic projection without section (2 problems). Orthographic projection with section (2 problems). Isometric Projections (3 problems).
Component -2 One A-3 size sketch book consisting of:1) 3 problems each from Projection of Curves, Lines, Planes and Solids. 2) 3 problems from Section and Development of Solids. 3) 2 problems each from the Orthographic Projections (with Section), Reading of orthographic projections and Isometric projections. Component-3 Printouts of minimum 2 problems (preferably in A3 size sheet) each from: 1) 2) 3) 4) Simple Orthographic Projections. Orthographic Projections Section. Isometric projections. Reading of Orthographic Projections
Note:- 2 hrs /week Auto CAD Practical is essential for completing the Auto CAD Drawings and take required printouts. AutoCAD Examination: (2hrs): 1) Minimum 1 problem from 1 or 2 or 4 of component-3 and 2) Minimum 1 problem from 3 of component-3. 3) Print out of the Answers have to be taken preferably in A3 size sheets and should be assessed by External examiner. Knowledge of concepts and accuracy of drawing should be considered during evaluation.
Theory Examination: 1. Question paper will comprise of 6 questions, each carrying 15 marks. 2. Only 4 questions need to be solved. 3: Q.1 will be compulsory, based on entire syllabus. 4: Remaining question will be randomly selected from all the modules. 5: Weightage of marks should be proportional to number of hours assigned to each Module.
Text Books. 1) N.D. Bhatt, Engineering Drawing (Plane and solid geometry), Charotar Publishing House Pvt. Ltd. 2) N.D. Bhatt & V.M. Panchal, Machine Drawing, Charotar Publishing House Pvt. Ltd. References. 1) M.B Shah & B.C Rana, Engineering Drawing, Pearson Publications. 2) P.J. Shah, Engineering Graphics, S Chand Publications. 3) Dhananjay A Jolhe, Engineering Drawing Tata McGraw Hill 4) Prof. Sham Tickoo (Purdue University) & Gaurav Verma, ( CAD Soft Technologies) : Auto CAD 2012 (For engineers and Designers), Dreamtech Press NewDelhi.
Subject Code FEC205 SubjectName TeachingScheme Theory StructuredProgramming Approach 04 Pract. Tut. 02 Theory 04 CreditsAssigned TW/Pract 01 Tut. Total 05
Sub. Code SubjectName ExaminationScheme TheoryMarks InternalAssessment Test1 FEC205 Structured Programming Approach 20 Test2 20 Av.ofTest1 &Test2 20 Endsem. exam TW Prat Oral Total
80
25
25
150
Primary Objectives of this subject This subject aims to provide students with an understanding of the role computation can play in solving problems. The course will be taught using C programming language. Program Education Objectives After completing this course, students will be able to: z Understand classical problem solving strategies and use them in solving problems that can be implemented using a programming language. z Identify a problem that requires a programmed solution. z Use structured approach to describe the solution concept. z Understand concept of data types and variables using C. z Use common operators in C to solve a problem. z Implement conditional statements in C . z Implement looping constructs in C. z Implement functions in C. z Use simple and structured data types in C to solve given problem z Implement simple problems using files and pointers
Detail Syllabus Unit No 1 2 2.1 2.2 3 3.1 3.2 3.3 3.4 4 4.1 Unit Problem definition Algorithms Developing Algorithms Efficiency of Algorithms Expressing Algorithm Sequence Expressions in C; Arithmetic and Boolean expressions Use of Standard functions Assignment statement Input and output Concept of scalar Data Types scalar data types in C , Scope and life time, type conversion Expressing Algorithms Iteration Ordering a solution in a loop C- Control structures for Iteration Expressing Algorithms Selection C-Control structures for selection Decomposition of solution Defining Functions in C Functions and parameters Introduction to recursive functions Additional C data types Arrays single and multi dimensional Strings Structures Files Pointers 02 05 01 Number of Hours
03 01 01 02 04
5 5.1 5.2 6 6.1 7 7.1 7.2 7.3 8 8.1 8.2 8.3 8.3 8.4
02 06 01 02 01 02 02 02
03 02 02 02 02
Books: Text: 1. programming in C ; second edition; Pradeep Day and Manas Gosh ;Oxford University Press 2011
2. C Programming with Problem solving ; Jacqueline A. Jones & Keith Harrow Dreamtech India Scott Jones California USA
Reference 1. Introduction to Engineering programming James Paul Hollowat John Wiley ISBN 9812-53022-3 2. Introduction to programming and problem solving ; G. Michael Schneider ; Wiley India edition; Laboratory Assignments 1. Students are expected to solve and execute at least 20 programming problems based on above syllabus. 2. Journal work should comprise of writing the problem definition, solution of problem either as Algorithm or flow chart and source code in C (preferably hand written) for all the 20 problems.

Subject Code FEC206 SubjectName TeachingScheme Theory Communication Skills 02 Pract. 02 Tut. Theory 02 CreditsAssigned TW/Pract 01 Tut. Total 03
Sub. Code SubjectName ExaminationScheme Theory InternalAssessment Test1 FEC206 Communication Skills 10 Test2 10 Averageof Test1&2 10 Endsem. exam TW Prat Oral Total
40
25
75
S.No Topic No.of lectures 1. CommunicationTheory:Thecommunicationprocess,objectives,barriersto communication,methodsofcommunication,formalandinformalchannelsof communicationinabusinessorganization,techniquestoimprovecommunication (Listening,speaking,reading,writing) 2. GrammarandVocabulary:Pairsofconfusedwords,commonerrors,useofarticles, prepositions,apostrophes,agreementoftheverbwiththesubject,oneword substitution,synonymsandantonyms 3 12
3.
4. 5.
BusinessCorrespondence:Principlesofbusinesscorrespondence,partsofa businessletter,formats(Fullblock/Completeblock,Modifiedblock,Semiblock), typesofletters:Enquirylettersandrepliestoenquiry(enquiryaboutaproduct, serviceorinformation,askingforaquotation,placinganorderandrepliestothe same)lettersofClaimandAdjustment. SummarizationandComprehension:Technicalandindustryorientedpassages(not lessthan400words) Technicalwriting:Framingdefinitions,writinginstructions,languageexercises basedontypesofexpositions(descriptionofanobject,explanationofaprocess)
3 3
Note:Twotestsareprescribedforinternalassessment.Thefirsttestshouldbeconductedintheformof athreeminutepublicspeech.Thesecondtestshouldbebasedontheoryandapplicationexercises basedonthesyllabus. Termwork:25marks Assignments:20marks Attendance:05marks Listofassignments: Summarization&Comprehension Grammarpractice Communicationtheory:Applicationexercises BarrierstoCommunication PrinciplesofBusinessCorrespondence Formatsofbusinessletters Typesofletters Technicalwriting RecommendedreferencebooksforCommunicationSkills: BusinessCommunicationbyUrmilaRai&S.M.Rai,HimalayaPublishingHouse CommunicationSkillsbyMeenakshiRaman&SangeetaSharma,OxfordUniversityPress BusinessCorrespondence&ReportwritingbyR.C.Sharma&KrishnaMohan,TataMcGrawHillEducation EffectiveTechnicalCommunicationbyAshrafRizvi,TataMcGrawHill TechnicalWriting&ProfessionalCommunicationfornonnativespeakersofEnglishbyThomasN.Huckin &LeslieA.Olsen,McGrawHill MasteringCommunicationbyNickyStanton,PalgraveMasterSeries Paperpattern TotalMarks:40,Duration:2hours Distributionofmarksandweightage: The paper will comprise 6 questions of 10 marks each out of which 4 need to be attempted. The first question is compulsory and will be a combination of all modules. Students can attempt any 3 out of the remaining 5 questions. The first module (Communication theory) will carry 40 % weightage. Questions 2, 3, 4, 5 and 6 will be based on combinations of two or more modules.
Sub Code
Subject Name
Teaching Scheme Theory Pract. 04 Tut. Theory -
FEL201 Basic Workshop Practice-II
Sub. Code
Subject Name
FEL201 Basic Workshop Practice-II
Examination Scheme Theory Term Internal Assessment End sem. Work Test 1 Test 2 Average of exam Test 1 & Test 2 50
Pract.
Oral
Total
50
Detailed Syllabus is given in Basic Workshop Practice-I
Term work: Term work shall consist of respective reports and jobs of the trades selected the distribution of marks for term work shall be as follows: Laboratory work (Job and Journal) Attendance (Practical and Theory) : 40 marks : 10 marks
The final certification and acceptance of term work ensures the satisfactory performance of laboratory work.
UNIVERSITY OF MUMBAI
Bachelor of Engineering
Computer Engineering (Second Year Sem. III & IV) Revised course (REV- 2012) from Academic Year 2012 -13 Under
FACULTY OF TECHNOLOGY
(As per Semester Based Credit and Grading System)
University of Mumbai Computer Engineering ( Second Year Sem II & IV) Revised Course(R2012)
Preamble
To meet the challenge of ensuring excellence in engineering education, the issue of quality needs to be addressed, debated and taken forward in a systematic manner. Accreditation is the principal means of quality assurance in higher education.The major emphasis of accreditation process is to measure the outcomes of the program that is being accredited. In line with this Faculty of Technology of University of Mumbai has taken a lead in incorporating philosophy of outcome based education in the process of curriculum development. Faculty of Technology, University of Mumbai, in one of its meeting unanimously resolved that, each Board of Studies shall prepare some Program Educational Objectives (PEOs) and give freedom to affiliated Institutes to add few (PEOs) and course objectives and course outcomes to be clearly defined for each course, so that all faculty members in affiliated institutes understand the depth and approach of course to be taught, which will enhance learners learning process. It was also resolved that, maximum senior faculty from colleges and experts from industry to be involved while revising the curriculum. I am happy to state that, each Board of studies has adhered to the resolutions passed by Faculty of Technology, and developed curriculum accordingly. In addition to outcome based education, semester based credit and grading system is also introduced to ensure quality of engineering education. Semester based Credit and Grading system enables a much-required shift in focus from teacher-centric to learnercentric education since the workload estimated is based on the investment of time in learning and not in teaching. It also focuses on continuous evaluation which will enhance the quality of education. University of Mumbai has taken a lead in implementing the system through its affiliated Institutes and Faculty of Technology has devised a transparent credit assignment policy and adopted ten points scale to grade learners performance. Credit and grading based system was implemented for First Year of Engineering from the academic year 2012-2013. Subsequently this system will be carried forward for Second Year Engineering in the academic year 2013-2014, for Third Year and Final Year Engineering in the academic years 2014-2015 and 2015-2016 respectively.
Dr. S. K. Ukarande
Dean, Faculty of Technology, Member - Management Council, Senate, Academic Council University of Mumbai, Mumbai
Preamble: The engineering education in India in general is expanding in manifolds. Now, the challenge is to ensure its quality to the stakeholders along with the expansion. To meet this challenge, the issue of quality needs to be addressed, debated and taken forward in a systematic manner. Accreditation is the principal means of quality assurance in higher education and reflects the fact that in achieving recognition, the institution or program of study is committed and open to external review to meet certain minimum specified standards. The major emphasis of this accreditation process is to measure the outcomes of the program that is being accredited. In line with this Faculty of Technology of University of Mumbai has taken a lead in incorporating philosophy of outcome based education in the process of curriculum development. The Program Educational Objectives finalized for undergraduate program in Computer Engineering are listed below: 1. To prepare Learners with a sound foundation in the mathematical, scientific and engineering fundamentals 2. To prepare Learners to use effectively modern tools to solve real life problems 3. To equip Learner's with broad education necessary to understand the impact of computer Technology in a global and social context 4. To encourage , motivate and prepare Learners for Lifelong-learning 5. To inculcate professional and ethical attitude, good leadership qualities and commitment to social responsibilities In addition to above 2 to3 more program educational objectives of their own may be added by affiliated Institutes. The Program outcomes are the skills and ability that Learner will demonstrate upon completion of undergraduate degree program in Computer Engineering. Few may be listed as follows: 1. Ability to effectively apply knowledge of computing and mathematics to computer science problems. 2. Ability to design, implement and evaluate computer-based components, systems, processes or programs to meet desired needs and specifications. 3. Ability and skills to effectively use state-of-the-art techniques and computing tools for analysis, design, and implementation of computing systems. 4. Ability to function effectively as a member of a team assembled to undertake a common goal. 5. An understanding of professional, ethical, legal, security, and social issues and responsibilities. 6. Ability to communicate effectively to both technical and non-technical audiences. 7. The ability to successfully pursue professional development thru lifelong learning In addition to Program Educational Objectives, for each course of undergraduate program, Course Objectives and expected outcomes from learners point of view are also included in the curriculum to support the philosophy of outcome based education. In order to achieve outcome 1,2,and 3 a major emphasis is planned towards designing Laboratory courses third year onwards. I believe strongly that small step taken in right direction will definitely help in providing quality education to the stake holders. Dr. Prachi Gharpure Chairperson, Adhoc Board of Studies in Computer Engineering University of Mumbai, Mumbai
Program Structure for B.E. Computer Engineering Second Year (Computer) ( Semester III) (REV 2012)
Course Code Course Name Teaching Scheme (Contact Hours) Theory Pract Tut 4 4 4 3 4 4 23 2 2 2 2 8 1# 1 Credits Assigned Theory 4 4 4 3 4 4 23 TW/ Pract 1 1 1 1 4 Tut 1 1 Total 5 5 5 4 4 5 28
CSC301 CSC 302 CSC303 CSC304 CSC305 CSC306
Applied Mathematics III* Object Oriented Programming Methodolgy* Data Structures Digital Logic Design and Analysis Discrete Structures Electronic Circuits and Communication Fundamentals Total
Course Code
Course Name
Examination Scheme Internal Assesment Internal Assesment End Sem Exam Test 1 Test 2 Avg
CSC301 CSC302
Applied Mathematics III* Object Oriented Programming Methodolgy* Data Structures Digital Logic Design and Analysis Discrete Structures Electronic Circuits and Communication Fundamentals Total
20 20 20 20 20 20 -
20 20 20 20 20 20 -
20 20 20 20 20 20 120
80 80 80 80 80 80 480
Exam Duration ( in Hrs) 03 03 03 03 03 03 -
TW
25! 25 25 25 25 125
Pract / oral 25 25 25 75
Tot
125 150 150 125 100 150 750
CSC303 CSC304 CSC305 CSC306
* Common Subjects with IT # Tutorial to be taken class wise ! Tutorials will be evaluated as Term work
Program Structure for B.E. Computer Engineering Second Year (Computer) ( Semester IV) (REV 2012)
Course Code Course Name Teaching Scheme (Contact Hours) Theory Pract Tut 4 4 4 4 4 3 23 2 2 2 2 8 1 1 Credits Assigned Theory 4 4 4 4 4 3 23 TW/ Pract 1 1 1 1 4 1 Tut 1# Total 5 5 5 5 4 4 28
CSC401 CSC402 CSC403 CSC404 CSC405 CSC406
Applied Mathematics IV* Analysis of Algorithms Computer Organization and Architecture* Data Base Management systems Theoretical Computer Science Computer Graphics Total
Course Code
Course Name
CSC401 CSC402 CSC403
Applied Mathematics IV* Analysis of Algorithms Computer Organization and Architecture* Data Base Management systems
Examination Scheme Internal Assesment Internal Assesment End Exam Sem Duration Test 1 Test 2 Avg Exam ( in Hrs) 20 20 20 80 03 20 20 20 20 20 20 80 80 03 03
TW
25! 25 25
Prac / oral 25 25
Tot
125 150 150
CSC404
20
20
20
80
03
25
25
150
CSC405 CSC406
Theoretical Computer Science Computer Graphics
20 20
20 20 -
20 20 120
80 80 480
03 03 -
25 125
25 100
100 150 825
Total
* Common Subjects with IT # Tutorial to be taken class wise ! Tutorials will be evaluated as Term work
Course Code
CSC301
Course Name
Applied Mathaematics III
Credits
05
Objectives: 1) Complex Variable (2) Laplace Transform (3) Fourier Series (4) Discrete Structures (5) Z-transform These topics involve the study of analytic function and mapping of complex function, Laplace transform, Inverse Laplace transform and application of Laplace transform to solve differential equations, finding Fourier series, Sine and cosine Fourier integral and Z-transform. These topics help them to solve many engineering problems arising in course of their further studies and also while working in the practical life situations. Outcomes: Students in this course will apply the Procedure and methods to solve technical problems. Details of the Syllabus:Module 01 Complex Variable & mapping (10) 1.1 Functions of a complex variable, Analytic functions, Cauchy-Riemann equations in Cartesian co-ordinates, Polar co-ordinates. Harmonic functions, Analytic method and Milne Thomson methods to find f(z), Orthogonal trajectories. Conformal Mapping, Linear, Bilinear transformations, Cross ratio, fixed points and standard transformation such as rotation and magnification, invertion, translation. (10) Topics Hrs
1.2
1.3
02
Laplace Transform 2.1 Introduction, Definition of Laplace transform, Laplace transform of constant, trigonometrical, exponential functions. 2.2 Important properties of Laplace transform: First shifting theorem, Laplace transform of L{tn f(t)}, L{ f(t)/t}, , , L{f(at)} without proof.
2.2Unit step function, Heavi side function, Dirac-delta function, Periodic function and their Laplace transforms, Second shifting theorem. 2.3Inverse Laplace transform with Partial fraction and Convolution theorem (without proof). 2.4 Application to solve initial and boundary value problem involving ordinary differential equations with one dependent variable and constant coefficients.
03
Fourier series 3.1 Dirichlets conditions, Fourier series of periodic functions with period 2 and 2L. 3.2 Fourier series for even and odd functions. 3.3 Half range sine and cosine Fourier series, Parsevels identities (without proof). 3.4Orthogonal and Ortho-normal functions, Complex form of series. 3.5 Fourier Integral Representation. Fourier
(10)
04
Vector Algebra and Calculus 4.1 Vector Algebra: Scalar and vector product of three and four Vectors and their properties. 4.2 Vector Calculus: Vector differential operator , Gradient of a scalar point function, Diversions and Curl of Vector point function, (u v),
.
(10)
4.3 Vector Integration: Line integral; conservative vector field,Greens theorem in a plane (Without proof) 4.4 GaussDivergence theorem & Stokes theorem (Without proof and no problems on verification of above theorems).
05 Z transform 5.1 Z-transform of standard functions such as Z(an), Z(np). 5.2 Properties of Z-transform :Linearity, Change of scale, Shifting property, Multiplication of K, Initial and final value, Convolution theorem (all without proof) 5.3 Inverse Z transform: Binomial Expansion and Method of Partial fraction. (8)
Term work: Term work shall consist of minimum four SCILAB practicals and six tutorials. SCILAB practicals Tutorials Attendance Total : : : : 10 marks 10 marks 05 marks 25 marks
Text Books: Higher Engineering Mathematics by Grewal B. S. 38th edition, Khanna Publication 2005. Advanced Engineering Mathematics by Kreyszig E. 9th edition, John Wiley. A Text Book of Applied Mathematics Vol. I & II by P.N.Wartilar & J.N.Wartikar, Pune, Vidyarthi Griha Prakashan., Pune. Discrete and Combinational Mathematics by Ralph P. Crimaldi, B Y Ramana.
References: Advanced Engg. Mathematics by C. Ray Wylie & Louis Barrett.TMH International Edition. Mathematical Methods of Science and Engineering by Kanti B. Datta, Cengage Learning. Lapplace Treansforms by Murry R. Spieget, Schauns out line series-McGraw Hill Publication. Discrete mathematics by ERIL FOSSETT, Wiley India.
Theory Examination:
1. Question paper will comprise of total 6 questions, each of 20 Marks. 2. Only 4 questions need to be solved. 3. Question 1 will be compulsory and based on maximum part of the syllabus. 4. Remaining questions will be mixed in nature (for example suppose Q.2 has part (a) from module 3 then part (b) will be from any module other than module 3) In question paper, weightage of each module will be proportional to number of respective lecture hours as mentioned in the syllabus.
Subject Code
CSC302
Subject Name
Object Oriented Programming Methodology (OOPM)*
Credits
05
Course Objectives
1. To understand Object oriented concepts like data abstraction, encapsulation, etc. 2. To solve the real world scenarios using top down approach. 3. To understand various Java programming constructs.
Course Outcomes
1. Students will be able to solve computational problems using basic constructs like if-else, control structures, array, strings. 2. Student can understand how to model real world scenario using class diagram. 3. Students will exhibit communication between 2 objects using sequence diagram. 4. Students will be able to implement relationships between classes. 5. Students will be able to demonstrate various collection classes. 6. The students will be able to demonstrate programs on exceptions, multithreading and applets.
Sr. No
1
Topic
Programming Approach from proceduaral to Object Orientation OO methodologies: Grady Booch Methodology of OO development OO Concepts: Object, Class, Encapsulation or information hiding, Inheritance, Polymorphism, Message communication, Abstraction, Reuse, Coupling and Cohesion, Sufficiency Completeness and Primitiveness, Meta class
No of Hours
4
Object Oriented Programming: Java Evolution: History, How java differs from others Overview of Java language: Introduction, Installing and implementing Java, JVM Constants, variables and data types Operators and Expressions Revision of Branching and looping
Class Object and Method: member, method, Modifier, Selector, constructer, destructor, iterator, State of an object, Method Overloading, Inheritance, Method Overriding ,Final class, abstract class and method
Classes and Relationships : Implementation of Association and Aggegation using simple scenarios Array, String, Vector Interfaces : variables in Interfaces, Extending an Interface, Difference between an Abstarct class and an Interface Multithread programming
7 8
6 4
9 10
4 3
Grouping of classes for deployment and reuse: Built-in Packages: java.lang: wrapper classes java.util: ArrayList and LinkedList Creating and using User defined packages
Managing Error and Exception Applet programming
11 12
3 2
Suggested list of Programming Assignments /Laboratory Work

Divide laboratory work into 3 parts
A.
Basic Java structural components and Conditional and control statements: To demonstrate the use of command line argument. To demonstrate various ways of accepting data through keyboard. To understand the working of an array. To understand string class and demonstrate its various functions.
B. Perform following practical on some case study like Banking Application, Library Application etc.
Find out classes, objects and their properties. Create and display objects found in above. Add methods to classes and implement. Refine above objects by adding constructors and local variables. Show communication between the objects by calling instance of one object from another class. Find relationships like inheritance, association, aggregation, composition. Implement above relationships.
C.
To implement user defined exceptions in Java. Demonstrate the use collection classes like ArrayList/LinkedList/HashSet/TreeSet/Map.
University of Mumbai Computer Engineering ( Second Year Sem II & IV) Revised Course(R2012) 10
To illustrate Multithreading in Java. Simple programs on Applets and AWT.
TermWork:
Students will submit Term Work in the form of a journal that will include at least 15 programming assignments. Each programming assignment will consist of an algorithm or class diagram/sequence diagram (if applicable), program listing with proper documentation and snapshot of the output. Practical Examination will be based on the term work and questions will be asked to judge understanding of the assignments at the time of the examination. The final certification and acceptance of term work ensures that satisfactory performance of laboratory work and minimum passing marks in term work. Term Work: 25 Marks ( total marks ) = 15 Marks ( Experiment ) + 5 Marks ( Assignment ) + 5 (Attendance (theory+practical)) Practical Exam will based on above syllabus
Theory Examination:
Text Books:
1. Ralph Bravaco , Shai Simoson , Java Programing From the Group Up ,Tata McGraw-Hill 2. Grady Booch, Object Oriented Analysis and Design ; 3. Jaime Nino, Frederick A. Hosch, An introduction to Programming and Object Oriented Design using Java, Wiley Student Edition.
Reference Books:
1. Java: How to Program, 8/e, Dietal, Dietal, PHI 2. Grady Booch, James Rumbaugh, Ivar Jacobson, The Unified Modeling Language User Guide, Pearson Education 3. Sachin Malhotra, Saurabh Chaudhary Programming in Java, Oxford University Press, 2010
11
Subject Code CSC303
Subject Name
Credits
5
Data Structures (DS)
Course Objectives
1. 2. 3. 4. 5. 6. To teach efficient storage mechanisms of data for an easy access. To design and implementation of various basic and advanced data structures. To introduce various techniques for representation of the data in the real world. To develop application using data structures. To teach the concept of protection and management of data. To improve the logical ability
Course Outcomes
1. Student will be able to choose appropriate data structure as applied to specified problem definition. 2. Student will be able to handle operations like searching, insertion, deletion, traversing mechanism etc. on various data structures. 3. Students will be able to apply concepts learned in various domains like DBMS, compiler construction etc. 4. Students will be able to use linear and non-linear data structures like stacks , queues , linked list etc.
Module 01
Detailed content Introduction to Data Structure Types of Data Structure, Arrays, Strings, Recursion, ADT (Abstract Data type),Concept of Files,Operations with files, types of files Linear Data Structure Linked List Linked List as an ADT, Linked List Vs. Arrays, Memory Allocation & De-allocation for a Linked List, Linked List operations, Types of Linked List, Implementation of Linked List, Application of Linked Listpolynomial, sparse matrix. STACK The Stack as an ADT, Stack operation, Array Representation of Stack, Link Representation of Stack, Application of stack Recursion, Polish Notation Queues The Queue as an ADT, Queue operation, Array Representation of Queue, Linked Representation of Queue, Circular Queue, Priority Queue, & Dequeue, Application of Queues Johnsons Algorithm, Simulation
Hours
05
02
10
03
04
04
05
12
Non-linear Data Structure Trees Basic trees concept, Binary tree representation,Binary tree operation, Binary tree traversal, Binary search tree implementation, Thread Binary tree, The Huffman Algorithm, Expression tree, Introduction to Multiway search tree and its creation(AVL, B-tree, B+ tree) Graphs Basic concepts, Graph Representation, Graph traversal (DFS & BFS)
05
10
06
04
Sorting AND Searching Sorting : Sort Concept, Shell Sort, Radix sort, Insertion Sort, Quick Sort, Merge Sort,Heap Sort, Searching : List Search,Linear Index Search, Index Sequential Search Hashed List Search, Hashing Methods , Collision Resolution
07
10
Text Books:
1. Data Structures A Psedocode Approach with C, Richard F. Gilberg & Behrouz A. Forouzan, second edition, CENGAGE Learning. 2. Data Structures using C, Reema Thareja, Oxford University press. 3. Introduction to Data Structure and its Applications Jean-Paul Tremblay, P. G. Sorenson
Reference Books:
1. 2. 3. 4. 5. Data Structures Using C & C++, Rajesh K. Shukla, Wiley- India. Data Structures Using C, ISRD Group, Second Edition, Tata McGraw-Hill Data Structure Using C, Balagurusamy C & Data Structures, Prof. P.S. Deshpande, Prof. O.G. Kakde, Dreamtech press. Data Structures, Adapted by: GAV PAI, Schaums Outlines Term work should consist of at least 12 experiments. Journal must include at least 2 assignments. The final certification and acceptance of term work ensures that satisfactory performance of laboratory work and minimum passing marks in term work.
Term Work: 25 Marks ( total marks ) = 15 Marks ( Experiment ) + 5 Marks ( Assignment ) + 5 (Attendance (theory+practical)) Practical exam will be based on the above syllabus.
Termwork:
13
Theory Examination:
Suggested Experiments:
Note: Students are required to complete 12 experiments. The star (*) marks experiments are mandatory. Linked List Implementations of Linked Lists menu driven program. * Implementation of different operations on linked list copy, concatenate, split, reverse, count no. of nodes etc Representation of Sparse matrix using multilinked structure. Implementation of sparse matrix multiplication. Implementation of polynomials operations ( addition, subtraction) using Linked List. Implementations of Linked Lists menu driven program (stack and queue) Implementations of Double ended queue using Linked Lists. Implementation of Priority queue program using Linked Lis Stack Implementations of stack menu driven program Implementation of multistack in one array. * Implementations of Infix to Postfix Transformation and its evaluation program. Implementations of Infix to Prefix Transformation and its evaluation program. Simulation of recursion Queue Implementations of circular queue menu driven program * Implementations of double ended queue menu driven program Implementations of queue menu driven program Implementation of Priority queue program using array. Implementation of Johnsons Algorithm Implementation of Simulation Problem Tree
14
*Implementations of Binary Tree menu driven program Implementation of Binary Tree Traversal program. *Implementation of construction of expression tree using postfix expression. Implementations of Huffman code construction Implementations of BST program Implementation of various operations on tree like copying tree, mirroring a tree, counting the number of nodes in the tree, counting only leaf nodes in the tree. Implementations of B-tree menu driven program Implementations of B+ tree program Implementation of Preorder traversal of a threaded binary tree. Implementations of AVL Tree menu driven program Sorting *Implementations of Shell sort, Radix sort and Insertion sort menu driven program Implementations of Quick Sort, Merge sort and Heap Sort menu driven program Searching *Implementations of searching methods (Index Sequential, Interpolation Search) menu driven program Implementation of hashing functions with different collision resolution techniques Graph * Implementations of Graph menu driven program (DFS & BSF)
15
Subject Code
CSC304
Subject Name
Digital Logic Design and Analysis
Credits
4
Course Objective:
1. To provide concepts that underpins the disciplines of digital electronics and microprocessor systems. 2. To provide the concept of modeling Combinational and sequential circuits. 3. To provide basic knowledge of how digital building blocks are described in VHDL.
Course Outcomes:
1. Binary and hexadecimal calculations and conversions. 2. Designing of combinational circuits.
3. Design synchronous and asynchronous sequential circuits.
4. Translate real world problems into digital logic formulations. 5. Construct test and debug digital networks using VHDL. 6. Learners will show awareness about TTL and CMOC Logic
Module
Detailed Contents
Number Systems and Codes: Revision of Binary, Octal, Decimal and Hexadecimal number Systems and their conversion, Binary Addition and Subtraction (1s and 2s complement method), Gray Code, BCD Code, Excess-3 code, ASCII Code, Error Detection and Correction Codes. Boolean Algebra and Logic Gates: Theorems and Properties of Boolean Algebra, Standard SOP and POS form, Reduction of Boolean functions using Algebric method, K -map method (2,3,4 Variable), and QuineMcClusky Method. NAND-NOR Realization. Basic Digital Circuits: NOT,AND,OR,NAND,NOR,EX-OR,EX-NOR Gates, Logic Families: Terminologies like Propagation Delay, Power Consumption , Fan in and Fan out etc. with respect to TTL and CMOS Logic and comparison. Combinational Logic Design: Introduction, Half and Full Adder, Half and Full Subtractor, Four Bit Binary Adder, one digit BCD Adder, Four Bit Binary Subtractor ( 1s and 2s compliment method), code conversion, Multiplexers and Demultiplexers, Decoders, One bit, Two bit ,4-bit Magnitude Comparator . Sequential Logic Design: Concept of Multivibrators: Astable, Monostable and Bistable multivibrators, Flip Flops:SR, D, JK, JK
Hours
05
10
08
10
16
Master Slave and T Flip Flop, Truth Tables and Excitation Tables, Flip-flop conversion. sequential circuit analysis , construction of state diagrams. Counters: Design of Asynchronous and Synchronous Counters, Modulo Counters, UP- DOWN counter . Shift Registers: SISO, SIPO,PIPO,PISO, Bidirectional Shift Register , Universal Shift Register, Ring and Johnson Counter. Pseudorandom sequence generator. Functional Simulation , Timing Simulation, Logic synthesis, Introduction to VHDL, Framework of VHDL program( Syntax and programming to be done only during Practicals), Introduction to CPLD and FPGA
03
Text Books:
1. R. P. Jain, Modern Digital Electronics, Tata McGraw Hill. 2. Yarbrough John M. , Digital Logic Applications and Design , Cengage Learning 3. J. Bhasker. VHDL Primer, Pearson Education
Reference Books:
1. M. Morris Mano, Digital Logic and computer Design, PHI. 2. Douglas L. Perry, VHDL Programming by Example, Tata McGraw Hill. 3. Donald p Leach, Albert Paul Malvino,Digital principles and Applications,Tata McGraw Hill.
Termwork:
Term work should consist of at least 12 experiments out of which at least 2 to be VHDL based. Journal must include at least 2 assignments. The final certification and acceptance of term work ensures that satisfactory performance of laboratory work and minimum passing marks in term work. Term Work: 25 Marks ( total marks ) = 15 Marks ( Experiment ) + 05 Marks (Assignment ) + 05 (Attendance (theory+practical))
Theory Examination:
17
Subject Code
CSC305
Subject Name
Discrete Structures
Credits
4
Course Objectives
1. To assimilate discrete mathematical concepts. 2. Introducing discrete maths as basic foundation of analysis and applications like communication,
Course Outcomes
1. Ability to reason logically. 2. Ability to understand use of functions, graphs and trees in programming applications. 3. Understand use of groups and codes in Encoding-Decoding. 4. Express recursive functions of other subjects like Data Structures as recurrence relation.
Module
Set Theory 01 Logic 02
Detailed content
Sets, Venn diagrams, Operations on Sets
Hours
05 Laws of set theory, Power set and Products Partitions of sets, The Principle of Inclusion and Exclusion
Propositions and logical operations, Truth tables Equivalence, Implications 06 Laws of logic, Normal Forms Predicates and Quantifiers Mathematical Induction
Relations, Digraphs and Lattices 03 Relations, Paths and Digraphs Properties and types of binary relations Manipulation of relations, Closures, Warshalls algorithm Equivalence and partial ordered relations Posets and Hasse diagram Lattice
18
08
Functions and Pigeon Hole Principle 04 Composition, Identity and Inverse Pigeon-hole principle Definition and types of functions: Injective, Surjective and Bijective 06
Generating Functions and Recurrence Relations 05 Series and Sequences Generating functions Recurrence relations Recursive Functions: Applications of recurrence relations e,g, Factorial, Fibonacci, Binary search, Quick Sort etc. 06
Graphs and Subgraphs 06 Trees 07 Trees and weighted trees Spanning trees and minimum spanning tree Isomorphism of trees and sub trees Prefix codes 05 Definitions, Paths and circuits: Eulerian and Hamiltonian Planer graphs, Graph coloring Isomorphism of graphs Subgraphs and Subgraph isomorphism 06
Algebraic Structures Algebraic structures with one binary operation: semigroup, monoids and groups Product and quotient of algebraic structures Isomorphism, Homomorphism and Automorphism Cyclic groups, Normal subgroups Codes and group codes 06
08
19
Text Books:
1. Kenneth H. Rosen. Discrete Mathematics and its Applications, Tata McGraw-Hill. 2. Bernad Kolman, Robert Busby, Sharon Cutler Ross, Nadeem-ur-Rehman, Discrete Mathematical Structures, Pearson Education. 3. D. S. Malik and M. K. Sen, Discrete Mathematical Structures, Thompson.
References:
1. C. L. Liu, D. P. Mohapatra, Elements of Discrete Mathematics Tata McGrawHill. 2. J. P. Trembley, R. Manohar Discrete Mathematical Structures with Applications to Computer Science, Tata Mcgraw-Hill. 3. Y N Singh, Discrete Mathematical Structures, Wiley-India.
Theory Examination:
20
Subject Code
CSC306
Subject Name
Electronic Circuits and Communication Fundamentals
Credits
05
Course Objectives:
1. To develop the knowledge of semiconductor devices and circuits, and explain their use in communication applications. 2. To inculcate circuit analysis capabilities in students. 3. To make students aware of various types of integrated circuits that can be used in computer applications. 4. To make students aware that knowledge gained in electronic devices and circuits is useful in real life applications.
Course Outcomes:
1. 2. 3. 4. 5. 6. 7. 8. 9. Ability to understand and use semiconductor devices in circuits. Ability to analyze the given circuit. Ability to understand field effect devices and carry out their DC analysis. Ability to understand concept of feedback and oscillations. Ability to use oscillators in various applications. Ability to use operational amplifier in various applications. Ability to understand concept of phase lock loop and their use communication applications. Ability to understand fundamental concepts of communication. Ability to apply knowledge of electronic devices and circuits to communication applications.
Module
01
Detailed content
Electronic Circuits Field effect based devices and circuits: Junction Field Effect Transistors, JFET Characteristics, FET amplification and switching, DC load line and bias point, ate bias, self bias, voltage divider bias, coupling, bypassing and AC load lines, FET models and parameters, Common source circuit analysis principle of oscillation, FET based Hartley and Colpitts Oscillator. Crystal oscillator BJT as power amplifier ( only class A and C)
Hours
12
02
Operational Amplifier and its applications: Op-amp parameters and characteristics, Inverting and Non-inverting amplifier, Comparator, Summing Amplifier, Integrator, Differentiator, Zero Crossing Detector. Phase Lock Loop: Operating principle of PLL, Lock range and capture range.
06
21
03
Modulation Principles of Analog Communication: Elements of analog communication systems, Theory of amplitude modulation and types of AM, Generation of DSB SC using balanced modulator, Generation of SSB using phase shift method Theory of FM and PM, Generation of FM by Armstrong method
12
04
Demodulation : Principle of super heterodyne receiver. Foster seely detector for FM detection Application of PLL (IC 565) as FM detector , Frequency translator, Phase shifter, and freq synthesizer
06
05
Concept of sampling :Sampling Theorem, Types of sampling Quantization , A/D and D/A conversion concept Pulse Modulation: generation and detection of PAM, PPM, PWM, PCM, DM and ADM.Principle of TDM and FDM.
12
Text Books:
1. David Bell, Electronic Devices and Circuits, Oxford, 5th Edition. 2. Wayne Tomasi Electronic Communication Systems (fundamentals through advanced), Pearson Education, 4 th Edition. 3. Ramakant A. Gayakwad, Op-amp and linear integrated circuits, PHI, 3 rd edition. 4. G. Kennedy, B. Davis, S R M Prasanna, Electronic Communication Systems, Mc Graw Hill, 5th Edition.
References:
1. 2. 3. 4. 5. Robert Diffenderfer, Electronic Devices: Systems & Applications, Cengage Learning, India Edition. K. R. Botkar, Integrated Circuits, Khanna Publishers, 9th Edition Donald Neamen, Electronic Circuit Analysis and Design, Tata McGraw Hill,2 nd Edition. David Bell, Electronic Devices and Circuits, Oxford, 5th Edition. Wayne Tomasi Electronic Communication Systems (fundamentals through advanced), Pearson Education, 4 th Edition. 6. Ramakant A. Gayakwad, Op-amp and linear integrated circuits, PHI, 3 rd edition. 7. G. Kennedy, B. Davis, S R M Prasanna, Electronic Communication Systems, Mc Graw Hill, 5th Edition. 8. Robert Diffenderfer, Electronic Devices: Systems & Applications, Cengage Learning, India Edition. 9. K. R. Botkar, Integrated Circuits, Khanna Publishers, 9th Edition 10. Donald Neamen, Electronic Circuit Analysis and Design, Tata McGraw Hill,2 nd Edition.
22
Termwork:
Term work should consist of at least 08 experiments. Journal must include at least 2 assignments. The final certification and acceptance of term work ensures that satisfactory performance of laboratory work and minimum passing marks in term work. Term Work: 25 Marks ( total marks ) = 15 Marks ( Experiment ) + 5 Marks ( Assignment ) + 5 (Attendance (theory+practical)) Oral exam will be based on the above syllabus.
Suggested List of Experiments: 1. Study of various test and measuring instruments 2. Implementation of diode detector 3. Implementation of single stage FET amplifier 4. Implementation of oscillators 5. Implementation of IC 741 based application 6. Implementation of IC741 based active filters 7. Implementation of IC555 based application 8. Troubleshooting of given faults 9. Modulation and demodulation of AM/SSB/FM 10. Study of superheterodyne receiver 11. Generation and detection of PAM/PPM/PWM 12. Generation and detection of PCM/DM/ADM 13. Study of FDM and TDM 14. SPICE based simulations
Important Note: 50% experiments from communication and 50% experiments from electronic circuits should be taken. In theory exam the weightage for marks out of 80 : 35 for Devices and 45 for communications
Theory Examination:
Subject Code
CSC401
Subject Name
Applied Mathaematics IV *
Credits
05
Course Objectives:
This course will present matrix theory, Similar matrices and its application to find the matrics function. Present methods of computing and using eigen values and eigen vectors. Set up and directly evaluate contour integrals Cauchys integral theorem and formula in basic and extended form. Present Taylor and Laurents series to find singularities zeros and poles also presents residues theory and its applications. Present theory of probability, Bayes Theorem, Expectation and Moments and its application. Present probability distribution such as binomial, Poisson and normal distribution with their properties. Present sampling theory and its application for small and large sample. Present methods of computing optimization using simplex method.
Course Outcomes:
Students in this course will apply the method of solving complex integration and computing residues. Use residues to evaluate various contour integrals. Demonstrate ability to manipulate matrices and compute eigen values and eigenvectors.
Students in this course will apply the Procedure and methods to solve technical problems.
Module 01
Complex Integration (10) 1.1 Complex Integration Line Integral, Cauchys Integral theorem connected regions, Cauchys Integral formula(without proof) 1.2 Taylors and Laurents series ( without proof) 1.3 Zeros, poles of f(z), Residues, Cauchys Residue theorem 1.4 Applications of Residue theorem to evaluate Integrals of the type
2
for simply
f sin ,cos d , f x dx .
02
Matrices:2.1 Eigen values and eigen vectors 2.2 Cayley-Hamilton theorem(without proof) 2.3 Similar matrices, diagonalisable of matrix. 2.4 Derogatory and non-derogatory matrices ,functions of square matrix.
(08)
03
Correlation 3.1Scattered diagrams, Karl Pearsons coefficient of correlation, covariance,
(04)
24
Spearmans Rank correlation. 3.2 Regression Lines. 04 Probability 4.1 Bayes Theorem, 4.2 Random Variables:- discrete & continuous random variables, expectation, Variance, Probability Density Function & Cumulative Density Function. 4.3 Moments, Moment Generating Function. 4.4 Probability distribution: binomial distribution, Poisson & normal distribution. (For detail study) 05 Sampling theory 5.1 Test of Hypothesis, Level of significance, Critical region, One Tailed and two Tailed test, Test of significant for Large Samples:-Means of the samples and test of significant of means of two large samples. 5.2 Test of significant of small samples:- Students t- distribution for dependent and independent samples. 5.3 Chi square test:- Test of goodness of fit and independence of attributes, Contingency table. 06 Mathematical Programming 6.1 Types of solution, Standard and Canonical form of LPP, Basic and feasible solutions, simplex method. 6.2 Artificial variables, Big M method (method of penalty). 6.3 Duality, Dual simplex method. 6.4 Non Linear Programming:-Problems with equality constrains and inequality constrains (No formulation, No Graphical method). (08) (08) (10)
Term work: Term work shall consist of minimum four SCILAB practicals and six tutorials. SCILAB practicals Tutorials Attendance Total : : : : 10 marks 10 marks 05 marks 25 marks
25
Text Books:
1. Higher Engineering Mathematics by Grewal B. S. 38th edition, Khanna Publication 2005. 2. Operation Research by Hira & Gupta,S Chand. 3. A Text Book of Applied Mathematics Vol. I & II by P.N.Wartilar & 4. J.N.Wartikar, Pune, Vidyarthi Griha Prakashan., Pune.
5. Probability and Statistics for Engineering, Dr. J Ravichandran, Wiley-India.
Reference Books:
1. Probability & Statistics with reliability by Kishor s. Trivedi, Wiley India. 2. Advanced Engg. Mathematics by C. Ray Wylie & Louis Barrett.TMH International Edition. 3. Mathematical Methods of Science and Engineering by Kanti B. Datta, Cengage Learning. 4. Advanced Engineering Mathematics by Kreyszig E. 9th edition, John Wiley. 5. Operations Research by S.D. Sharma Kedar Nath, Ram Nath & Co. Meerat. 6. Engineering optimization (Theory and Practice) by Singiresu S.Rao, New Age International publication.
Theory Examination:
26
Subject Code
CSC402
Subject Name
Analysis of Algorithm
Credits
5
Prequisites : Students should be familiar with Data structure concepts , Discrete structures
Course Objectives:
1. To teach various problem solving strategies.. 2. To teach mathematical background for algorithm analysis and implementation of various strategies like divide and conquer, Greedy method, Dynamic programming , Backtracking , branch and bound 3. To teach different string matching algorithms.
Course Outcomes:
1. 2. 3. 4. 5. 6. 7. Ability to select appropriate problem solving strategies. Ability to calculate time complexity and space complexity of an algorithm. Ability to analyze different divide and conquer problems. Ability to analyze different greedy method problems. Ability to analyze different dynamic programming problems. Ability to analyze different backtracking problems. Ability to analyze different string matching algorithms.
Module
Detailed Content
Introduction to analysis of algorithm Decision and analysis fundamentals Performance analysis , space and time complexity Growth of function Big Oh ,Omega , Theta notation Mathematical background for algorithm analysis Analysis of selection sort , insertion sort Randomized algorithms Recursive algorithms The substitution method Recursion tree method - Master method Divide and Conquer General method Binary search Finding minimum and maximum Merge sort analysis Quick sort analysis Strassens matrix multiplication The problem of multiplying long integers
Hrs.
11
07
27
- constructing Tennis tournament Greedy Method General Method Knapsack problem Job sequencing with deadlines Minimum cost spanning trees-Kruskal and prims algorithm Optimal storage on tapes - Single source shortest path Dynamic Programming General Method Multistage graphs all pair shortest path single source shortest path Optimal binary search tree 0/1 knapsack Travelling salesman problem - Flow shop scheduling Backtracking General Method 8 queen problem( N-queen problem) Sum of subsets - Graph coloring String Matching Algorithms The nave string matching Algorithms The Rabin Karp algorithm String matching with finite automata The knuth-Morris-Pratt algorithm - Longest common subsequence algorithm Branch and bound General method 15 puzzle problem Travelling salesman problem
07
08
05
06
04
Text Books:
1. Ellis horowitz , sartaj Sahni , s. Rajsekaran. Fundamentals of computer algorithms University Press. 2. T.H.coreman , C.E. Leiserson,R.L. Rivest, and C. Stein, Introduction to algorithms, 2nd edition , PHI publication 2005. 3. Alfred v. Aho , John E. Hopcroft , Jeffrey D. Ullman , Data structures and Algorithm Pearson education , fourth impression 2009
Reference books:
1. Michael Gooddrich & Roberto Tammassia, Algorithm design foundation, analysis and internet examples, Second edition , wiley student edition.
28
Suggested Practicals:
Implementations Programing Language must be in C only.
Module no 1
Module name Introduction to analysis of algorithm:
Suggested Experiment list selection sort insertion sort ( for this experiment comparative analysis on the basis of comparison required to sort list is expected for large values of n ) -binary search -finding minimum and maximum -Merge sort analysis* -Quick sort analysis* ( the above two experiments marked as * should be considered as single experiment. For this experiment comparative analysis on the basis of comparisons required to sort list is expected for large values of n ) -Strassens matrix multiplication -The problem of multiplying long integers -constructing Tennis tournament* -Knapsack problem* -Job sequencing with deadlines -Minimum cost spanning trees-Kruskal and prims algorithm* -Optimal storage on tapes -Single source shortest path -Multistage graphs -all pair shortest path -single source shortest path -Optimal binary search tree* -0/1 knapsack -Travelling salesman problem* -Flow shop scheduling -8 queen problem( N-queen problem)* -Sum of subsets -Graph coloring -Knapsack problem -The nave string matching Algorithms -The Rabin Karp algorithm -String matching with finite automata -The knuth-Morris-Pratt algorithm -Longest common subsequence algorithm* -15 puzzle problem* -Travelling salesman problem
Divide and Conquer 2
Greedy Method
Dynamic Programming
Backtracking
String Matching Algorithms
Branch and bound
29
Termwork:
Total experiments to be performed are 12 = ( 9 + 3 ) 9 Experiments marked * are mandatory.
For additional 3 experiments teacher can choose experiments from suggested list. The final certification and acceptance of term work ensures that satisfactory performance of laboratory work and minimum passing marks in term work. Termwork: 25 Marks ( total marks ) = 15 Marks Experiments + 05 Marks Assignment + 5 (Attendance
(theory+practical)) Practical Exam will be based on above syllabus
Theory Examination:
30
Subject Code
CSC403
Subject Name
Computer Organization and Architecture*
Credits
05
Course Objectives:
1. To conceptualize the basics of organizational and architectural issues of a digital computer. 2. To analyze performance issues in processor and memory design of a digital computer. 3. To understand various data transfer techniques in digital computer. 4. To analyze processor performance improvement using instruction level parallelism
Course Outcomes:
1. 2. 3. 4. Ability to understand basic structure of computer. Ability to perform computer arithmetic operations. Ability to understand control unit operations. Ability to design memory organization that uses banks for different word size operations. 5. Ability to understand the concept of cache mapping techniques. 6. Ability to understand the concept of I/O organization. 7. Ability to conceptualize instruction level parallelism.
Pre-requistes: Fundamentals of Computer, Digital Logic Circuits, Programming Languages (C, C++, Java)
Module
1
Detailed Contents
Overview of Computer Architecture & Organization: Introduction of Computer Organization and Architecture. Basic organization of computer and block level description of the functional units. Evolution of Computers, Von Neumann model. Performance measure of Computer Architecture. Introduction to buses and connecting I/O devices to CPU and Memory, bus structure.
Hours
04
Data Representation and Arithmetic Algorithms: Number representation: Binary Data representation, twos complement representation and Floating-point representation. IEEE 754 floating point number representation. Integer Data computation: Addition, Subtraction. Multiplication: Signed multiplication, Booths algorithm.
10
31
Division of integers: Restoring and non-restoring division Floating point arithmetic: Addition, subtraction
Processor Organization and Architecture: CPU Architecture, Register Organization , Instruction formats, basic instruction cycle. Instruction interpretation and sequencing. Control Unit: Soft wired (Micro-programmed) and hardwired control unit design methods. Microinstruction sequencing and execution. Micro operations, concepts of nano programming. Introduction to RISC and CISC architectures and design issues. Case study on 8085 microprocessor: Features, architecture, pin configuration and addressing modes.
12
Memory Organization: Introduction to Memory and Memory parameters. Classifications of primary and secondary memories. Types of RAM and ROM, Allocation policies, Memory hierarchy and characteristics. Cache memory: Concept, architecture (L1, L2, L3), mapping techniques. Cache Coherency, Interleaved and Associative memory. Virtual Memory: Concept, Segmentation and Paging , Page replacement policies.
12
I/O Organization and Peripherals: Input/output systems, I/O modules and 8089 IO processor. Types of data transfer techniques: Programmed I/O, Interrupt driven I/O and DMA. Peripheral Devices: Introduction to peripheral devices, scanner, plotter, joysticks, touch pad.
Introduction to parallel processing systems: Introduction to parallel processing concepts Flynns classifications pipeline processing instruction pipelining, pipeline stages pipeline hazards.
32
Text Books:
1. Carl Hamacher, Zvonko Vranesic and Safwat Zaky, Computer Organization, Fifth Edition, Tata McGraw-Hill. 2. John P. Hayes, Computer Architecture and Organization, Third Edition. 3. William Stallings, Computer Organization and Architecture: Designing for Performance, Eighth Edition, Pearson. 4. B. Govindarajulu, Computer Architecture and Organization: Design Principles and Applications, Second Edition, Tata McGraw-Hill.
Reference Books:
1. Dr. M. Usha, T. S. Srikanth, Computer System Architecture and Organization,First Edition, WileyIndia. 2. Computer Organization by ISRD Group, Tata McGraw-Hill. 3. Ramesh Gaonkar, Microprocessor Architecture, Programming and Applications with the 8085, Fifth Edition,Penram.
Termwork:
Term work should consist of at least 08 experiments. Journal must include at least 2 assignments. The final certification and acceptance of term work ensures that satisfactory performance of laboratory work and minimum passing marks in term work. Term Work: 25 Marks ( total marks ) = 15 Marks ( Experiment ) + 5 Marks ( Assignment ) + 5 (Attendance (theory+practical)) oral exam will be based on the above syllabus. Note: 1. The faculty should conduct eight programming practical / experiments based on the above syllabus including two case studies on recent developments covering the above contents. All the programs should be implemented in C/C++/Java under Windows or Linux environment. Experiments can also be conducted using available open source tools. 2. 8085 microprocessor should be included only as a sample case study to visualize the concepts. No questions in University Exams / Class Tests should be asked on 8085 microprocessor.
SUGGESTED LIST OF COA PRACTICAL / EXPERIMENTS 1. To study Full Adder (7483). 2. To study ALU (74181). 3. To study MASM (Micro Assembler). 4. A program for hexadecimal addition and multiplication.
33
5. A program for binary multiplication. 6. A program for Hamming code generation , detection and correction. 7. A program for Booths multiplication 8. A program for LRU page replacement algorithm. 9. A program for FIFO page replacement algorithm. 10. A program to simulate the mapping techniques of Cache memory. 10.1 Direct Mapped cache 10.2 Associative Mapped cache 10.3 Set Associative Mapped cache 11. A program to simulate memory allocation policies. 11.1 First-fit algorithm 11.2 Best-fit algorithm 12. A program to implement serial communication (PC - PC communication). 13. A program to implement parallel communication. (PC - Printer communication). 14. A program for printer simulation. 15. A program for keyboard simulation.
Theory Examination:
34
Subject Code
CEC404
Subject Name
Database Management System
Credits
05
Course Objectives:
1. Learn and practice data modeling using the entity-relationship and developing database designs. 2. Understand the use of Structured Query Language (SQL) and learn SQL syntax. 3. Apply normalization techniques to normalize the database 4. Understand the needs of database processing and learn techniques for controlling the consequences of concurrent data access.
Course Outcomes:
1. The learner will be able: 2. To describe data models and schemas in DBMS 3. To understand the features of database management systems and Relational database. 4. To use SQL- the standard language of relational databases. 5. To understand the functional dependencies and design of the database. 6. To understand the concept of Transaction and Query processing.
Module
1
Detailed content
Introduction Database Concepts: Introduction, Characteristics of databases, File system V/s Database system, Users of Database system, Concerns when using an enterprise database, Data Independence, DBMS system architecture, Database Administrator, EntityRelationship Data Model : Introduction, Benefits of Data Modeling, Types of Models, Phases of Database Modeling, The Entity-Relationship (ER) Model, Generalization, Specialization and Aggregation, Extended Entity-Relationship (EER) Model. Relational Model and Algebra : Introduction , Mapping the ER and EER Model to the Relational Model , Data Manipulation , Data Integrity ,Advantages of the Relational Model, Relational Algebra , Relational Algebra Queries, Relational Calculus. Structured Query Language (SQL) : Overview of SQL , Data Definition Commands, Set operations , aggregate function , null values, , Data Manipulation commands, Data Control commands , Views in SQL, Nested
Hours
04
04
08
09
35
5 6 7
and complex queries . Integrity and Security in Database: Domain Constraints, Referential integrity, Assertions, Trigger, Security, and authorization in SQL RelationalDatabase Design : Design guidelines for relational schema, Function dependencies, Normal Forms- 1NF, 2 NF, 3NF, BCNF and 4NF Transactions Management and Concurrency: Transaction concept, Transaction states, ACID properties, Implementation of atomicity and durability, Concurrent Executions, Serializability, Recoverability, Implementation of isolation, Concurrency Control: Lock-based , Timestamp-based , Validation-based protocols, Deadlock handling, Recovery System: Failure Classification, Storage structure, Recovery & atomicity, Log based recovery, Shadow paging. Query Processing and Optimization: Overview ,Issues in Query Optimization ,Steps in Query Processing , System Catalog or Metadata, Query Parsing , Query Optimization, Access Paths , Query Code Generation , Query Execution , Algorithms for Computing Selection and Projection , Algorithms for Computing a Join , Computing Aggregation Functions , Cost Based Query Optimization .
04 06 08
05
Text Books:
1. 2. 3. 4. G. K. Gupta :Database Management Systems, McGraw Hill. Korth, Slberchatz,Sudarshan, :Database System Concepts, 6th Edition, McGraw Hill Elmasri and Navathe, Fundamentals of Database Systems, 5thEdition, PEARSON Education. Peter Rob and Carlos Coronel, Database Systems Design, Implementation and Management, Thomson Learning, 5th Edition.
Reference Books :
1. Dr. P.S. Deshpande, SQL and PL/SQL for Oracle 10g,Black Book, Dreamtech Press Mark L. Gillenson, Paulraj Ponniah, Introduction to Database Management,Wiley 2. Sharaman Shah ,Oracle for Professional, SPD. 3. Raghu Ramkrishnan and Johannes Gehrke, Database Management Systems,TMH 4. Debabrata Sahoo Database Management Systems Tata McGraw Hill, Schaums Outline
Termwork:
Term work should consist of at least 12 experiments. Journal must include at least 2 assignments. The final certification and acceptance of term work ensures that satisfactory performance of laboratory work and minimum passing marks in term work. Term Work: 25 Marks ( total marks ) = 15 Marks ( Experiment ) + 5 Marks ( Assignment ) + 5 (Attendance (theory+practical)) practical exam will be based on the above syllabus.
Theory Examination:
1. Question paper will comprise of total 6 questions, each of 20 Marks. 2. Only 4 questions need to be solved.
3. Question 1 will be compulsory and based on maximum part of the syllabus. 4. Remaining questions will be mixed in nature (for example suppose Q.2 has part (a) from module 3 then part (b) will be from any module other than module 3) In question paper, weightage of each module will be proportional to number of respective lecture hours as mentioned in the syllabus.
37
Subject Code
CSC405
Subject Name
Theoretical Computer Science
Credits
4
Course Objectives:
1. Conceptual understanding of fundamentals of Grammars and languages. 2. Build concepts of theoretical design of basic machine, deterministic and non deterministic machines and pushdown machines. 3. Develop understanding of different types of Turing machines and their use. 4. Understand the concept of Undecidability.
Course Outcomes:
1. Understanding of Power and Limitations of theoretical models of Computation. 2. Ability to compare different types of languages and machines. 3. Ability to match constraints of a language to power of machines.
Module
Introduction: 01
Detailed content
Alphabets, Strings and Languages
Hours
03 Chomskey hierarchy and Grammars. Finite Automata (FA) and Finite State machine (FSM).
Regular Grammar (RG): 02 Regular Grammar and Regular Expression (RE): Definition, Equivalence and Conversion from RE to RG and RG to RE. Equivalence of RG and FA, Converting RG to FA and FA to RG. Equivalence of RE and FA, Converting RE to FA and FA to RE.
04
Finite Automata: 03 Deterministic and Nondeterministic Finite Automata ( DFA and NFA ): Definitions, Languages, Transitions ( Diagrams, Functions and Tables). Eliminating epsilon-transitions from NFA. 05
38
DFA, NFA: Reductions and Equivalence. FSM with output: Moore and Mealy machines.
Regular Language (RL): 04 Decision properties: Emptiness, Finiteness and Membership. Pumping lemma for regular languages and its applications. Closure properties. Myhill-Nerode Theorem and An application: Text Search. 04
Context Free Grammars (CFG): 05 Definition, Sentential forms, Leftmost and Rightmost derivations. Context Free languages (CFL): Parsing and Ambiguity. CFLs: Simplification and Applications. Normal Forms: CNF and GNF. Pumping lemma for CFLs and its applications. Closure properties and Kleenes closure. 06
Pushdown Automata(PDA): 06 Definition, Transitions ( Diagrams, Functions and Tables), Graphical Notation and Instantaneous Descriptions. Language of PDA, Pushdown Stack Machine ( PSM ) as a machine with stack, Start and Final state of PSM. PDA/PSM as generator, decider and acceptor of CFG Deterministic PDA (DPDA) and Multi-stack DPDA. 08
Turing Machine (TM): 07 Equivalence of Single and Multi Tape TMs. Power and Limitations of TMs. Design of Single and Multi Tape TMs as a computer of simple functions: Unary, Binary ( Logical and Arithmetic ), String operations ( Length, Concat, Match, Substring Check, etc ) Definition, Transitions ( Diagrams, Functions and Tables). Design of TM as generator, decider and acceptor. Variants of TM: Multitrack, Multitape and Universal TM. 10
39
Undecidability and Recursively Enumerable Languages: 08 Recursive and Recursively Enumerable Languages. Properties of Recursive and Recursively Enumerable Languages. Decidability and Undecidability, Halting Problem, Rices Theorem, Grebachs Theorem, Post Correspondence Problem, Context Sensitivity and Linear Bound Automata. 06
Comparison of scope of languages and machines: 09 Subset and Superset relation between FSM, PSM and TM. Subset and Superset relation between RL, CFL and Context Sensitive Language. 02
Text Books:
1. Michael Sipser, Theory of Computation, Cengage learning. 2. John E. Hopcroft, Rajeev Motwani, Jeffery D. Ullman, Introduction to Automata Theory, Languages and Computation, Pearson Education
References:
1. J. C. Martin, Introduction to Languages and the Theory of Computation, Tata McGrawHill. 2. Krishnamurthy E. V., Introductory Theory of Computer Science, East-West Press. 3. Kavi Mahesh, Theory of Computation: A Problem Solving Approach, Wiley-India.
Theory Examination:
40
Subject Code
CSC406
Subject Name
Computer Graphics
Credits
04
Course Educational Objectives: 1. The main objective is to introduce to the students in the graphics mode, with the help of basic algorithms and methodologies . 2. The objective of the course is to equip students with fundamental knowledge and basic technical competence in the field of computer graphics. 3. Provide an understanding of how a computer draws the fundamental graphics primitives. 4. To learn Computer Graphics methodologies/Algorithms and techniques . 5. To learn Implementation of Computer Graphics Algorithms Course Outcomes: Upon successfully completing Fundamentals of Computer graphics course, students will have, at a minimum, the qualities listed in the expected learning outcomes below. 1. Student will have understood basic concepts of computer graphics 2. Acquire knowledge about drawing basic shapes such as lines, circle ellipse, polygon. 3. Shall be able to perform processing of basic shapes by various processing algorithms /techniques. 4. Acquire knowledge about two and three dimensional transformations. 5. Shall be able to apply the transformation algorithms to the basic shapes. 6. Shall have basic knowledge of windowing and clipping. 7. Shall be able to apply various algorithms of clipping. 8. Acquire knowledge about Visible Surface Detection methods 9. Acquire knowledge about Illumination Models and Surface Rendering 10. Acquire knowledge about Color Models Module Contents Introduction to Computer Graphics (a) What is Computer Graphics? (b) Where Computer Generated pictures are used (c) Elements of Pictures created in Computer Graphics (d) Graphics display devices (e) Graphics input primitives and Devices Introduction to openGL (a) Getting started Making pictures Hours
1.
(02)
2.
(02)
41
3.
4.
5.
6.
7.
(b) Drawing basic primitives (c) Simple interaction with mouse and keyboard (For implementation use openGL programming) Output Primitives (a) Points and Lines, Antialiasing (b) Line Drawing algorithms DDA line drawing algorithm Bresenhams drawing algorithm Parallel drawing algorithm (c) Circle and Ellipse generating algorithms Mid-point Circle algorithm Mid-point Ellipse algorithm (d) Parametric Cubic Curves Bezier curves B-Spline curves Filled Area Primitives (a) Scan line polygon fill algorithm (b) Pattern fill algorithm (c) Inside-Outside Tests (d) Boundary fill algorithms (e) Flood fill algorithms 2D Geometric Transformations (a) Basic transformations (b) Matrix representation and Homogeneous Coordinates (c) Composite transformation (d) Other transformations (e) Transformation between coordinated systems 2D Viewing (a) Window to Viewport coordinate transformation (b) Clipping operations Point clipping (c) Line clipping Cohen Sutherland line clipping Liang Barsky line clipping Midpoint subdivision (d) Polygon Clipping Sutherland Hodgeman polygon clipping Weiler Atherton polygon clipping 3D Geometric Transformations and 3D Viewing (a) 3D object representation methods B-REP , sweep representations , CSG (b) Basic transformations Translation Rotation
(06)
(02)
(04)
(04)
(06)
42
8.
9.
10.
Scaling (c) Other transformations 1. Reflection 2. Rotation about an arbitrary axis (d) Composite transformations (e) Projections Parallel and Perspective (f) 3D clipping 3D Geometric Transformations and 3D Viewing (a) Classification of Visible Surface Detection algorithm (b) Back Surface detection method (c) Depth Buffer method (d) Scan line method (e) BSP tree method (f) Area Subdivision method Illumination Models and Surface Rendering (a) Basic Illumination Models (b) Halftone and Dithering techniques (c) Polygon Rendering Constant shading , Goraud Shading , Phong Shading 11. Fractals (a) Introduction (b) Fractals and self similarity Successive refinement of curves, Koch curve, Fractional Dimension, (c) String production and peano curves (For implementation use C Programming)
(04)
(03)
(03)
The journal should consist of 12 experiments and 3 assignments. Following is the list of compulsory 10 experiments. Additional 2 experiments can be implemented relevant to the course
1. Drawing the basic primitives and sierpinsky gasket using openGL*. 2. Create a polyline using mouse interaction using openGL*. 3. Bresenhams line drawing algorithm. 4. Mid-Point ellipse drawing algorithm. 5. Implementing Bezier curve. 6. Scanline fill algorithm. 7. 2D transformations. 8. Any one Line clipping algorithm cohen-sutherland / liang barsky. 9. Polygon Clipping algorithm sutherland hodgeman. 10. Any one Fractal generation ( Koch curve / Hilbert curve / peano curves using string production )
*Implementation of experiments 1 and 2 must be in openGL. Implementation of experiments 3 to 10 must be done in C language.
43
Termwork:
The final certification and acceptance of term work ensures that satisfactory performance of laboratory work and minimum passing marks in term work. Term Work: 25 Marks ( total marks ) = 15 Marks ( Experiment ) + 5 Marks ( Assignment ) + 5 (Attendance (theory+practical)) Practical Exam will be based on above syllabus TEXT BOOKS 1. Donald D. Hearn & M. Pauline Baker, Computer Graphics-C Version, 2nd Edition, Pearson Education, 2002, ISBN 81-7808-794-4 2. F.S.Hill , Jr. , Computer Graphics using OpenGL , second edition PHI publication. 3. James D. Foley, Andries van Dam, Steven K Feiner, John F. Hughes, Computer Graphics Principles and Practice, 2 nd Edition in C, Audison Wesley, ISBN 981-235-974-5 4. William M. Newman, Roberet F. Sproull, Principles of Interactive Computer Graphics, Second Edition, Tata McGraw-Hill Edition REFERENCE BOOKS 1. Rajesh K. Maurya, Computer Graphics, 1st Edition, Wiley India Publication ISBN 978-81-265-3100-4. 2. Amarendra N Sinha, Arun D Udai, Computer Graphics ISBN 10: 0070034378, ISBN 13: 9780070634374, Tata McGraw-Hill Education, 2007. 3. Peter Shirley, Steve Marschner, A K Peters, Fundamentals of Computer Graphics, 3 rd Edition, A. K. Peters Ltd. , Natick, Massachusetts, Distributed by Shroff Publishers and Dist. Pvt. Ltd. 4. Zhigang Xiang, Roy A Plastock, Computer Graphics, second edition, Shaums Outlines, Tat McGraw Hill
5 . David F. Rogers, Procedural Elements for Computer Graphics, 2
nd
Edition, Tata McGraw-Hill
Publications, 2001, ISBN 0-07-04-7371-4.
Theory Examination:
University of Mumbai
Syllabus Structure(R-2007) At T.E. (Computer Engineering) Semester-V Scheme of Instructions Scheme of Evaluation Periods per Week Each Period of 60 Min. Theory Practical Paper TW Practical Total &Oral Hours Marks 4 2 3 100 25 50 175
Sr. Subject No.
1. 2.
3. 4. 5. 6.
Computer Network Advance database Management System Microprocessor Theory of Computer Science Web Engineering Environment Studies
4 4 4 4 2
2 2 2 2
3 3 3 3 2
100 100 100 100 50
25 25 25 25 25
50 25 25 -
175 150 125 150 75
22
10
550
150
150
850
University of Mumbai Class: T.E. Branch: Computer Semester: V Engineering Subject: Advanced Database Management System(Abbreviated as ADBMS) Periods per Week Lecture 04 (each 60 min) Practical 02 Tutorial -Hours Marks Evaluation System Theory 03 100 Practical and Oral -50 Oral ---Term Work --25 Total 03 175 Module 1 Contents Extended ER : E-R model revisited Specialization & Generalization Extended E-R Subclass super class Constraints and characteristics of specialization & Generalization Relationship types of degree Higher than two Aggregation, Union and categories EER To Relation Models Mapping Database Design Methodology: Role of information system in organization Database design and Implementation Process Advanced SQL : SQL Data types & Schemas Queries based on SQL 3 standards (outer join, multi join , left, right, a full outer join, equal join, natural join Aggregate, functions, Null values etc. EXIST and NOT EXIST, any / all, pattern matching Dynamic SQL Query Processing : Overview Measures of Query cost Selection operation Sorting Join Operations Other Operations Evaluation of Expression Hours 04
04
08
04
Query Optimization : Translations of SQL Queries into relational algebra Heuristic approach & cost base optimization Object Relational and Extended Relational Databases : Overview of SQL 3 Implementation issues for extended types, nested relations and collections, Storage and access methods Parallel and Distributed Databases and Client Server Architecture: Introduction : for parallel databases Parallel : Query Evaluation Parallelizing, individual operations; sorting, joins, etc., distributed databases, concepts, data fragmentation, Replication and allocation techniques for distributed database design. Query Processing in distributed databases, concurrency control and recovery in distributed databases, An overview of Client Server Architecture. XML and Internet Databases: Structured unstructured and semi structured data. XML hierarchical Data Model XML Document, DTD and XML Schema XML Documents & databases XML Query
04
06
10
06
TERM WORK : 1. Atleast 6 practical experiments based on above syllabus 2. A mini project is desirable to be completed by a group of three with following specifications. Problem definition EER Model Mapping to relational Model Implementation should include user interface having two data entry forms and two reports. (using any connectivity of DBMS)
NOTE: The above (mini project) would carry a weightage of 10 marks. A term work test must be conducted with a weightage of 10 marks. Attendance 05 marks. Practical Exam: Students are expected to develop a database application as a part of practical examination.
Text Books : 1. 2. Elmasri & Navathe fundamentals of Database Systems IV edition. PEARSON Education. Korth, Silberschatz sudarshan Database systems, concepts 5th edition McGraw Hill.
Reference Books : 1. 2. 3. 4. Raghu Ramkrishnan & Johannes Gehrke Database Management System Tata McGraw Hill. III edition. Stefano Ceri, Hillseppe , pelagatti Distributed Databases, Principles and Systems Tata Mc Graw Hill editions. Dr. P.S. Deshpande, SQL and PL/SQL for Oracle log, Black Books Dreamtech Press. Mark L. Gillenson, Paulraj Ponniah Fundamentals of Database Systems WILEY
University of Mumbai Class: T.E. Branch: Computer Semester: V Engineering Subject: Computer Network (Abbreviated as CN) Periods per Week Lecture 04 (each 60 min) Practical 02 Tutorial -Hours Evaluation System Theory 03 Practical and Oral -Oral --Term Work --Total 03
Marks 100 50 -25 175
Objectives of the course: This is first course in Computer Networks. Need of Communication is the fundamental expectation along with the Layered approach of Computer Network. It is expected to know the details of layers along with the functionalities like: How each layer works? and how each layer communicates with other layers? Pre-requisites: Course in Data Structures and computer organization, C/C++. Module 1 Contents Hours Introduction: Network Applications; Network Hardware: 04 Topologies, LAN, MAN, WAN, Wireless network, Home Network, Internetworks; Network Software: Protocol Hierarchies, Design Issues for the layers, Connection oriented and connectionless Services; Reference Models: Layers details of OSI, TCP/IP Models. 07 The Physical Layer Transmission Media: Guided Transmission Media: Twisted pair, Coaxial, Fiber optics; Unguided media (Wireless Transmission): Radio Waves, Microwaves, Infrared. Network Hardware Components: Connectors, Transceivers and Media converters, Network interface cards and PC cards, Repeaters, Hubs, Bridges, Switches, Routers and Gateways etc. Telephone network: Major components, Local access transport areas, Signaling, Services provided by telephone networks; Dial-up Modems; Digital subscriber line: ADSL, HDSL, SDSL,VDSL; Cable Television network: Cable TV for data transfer, BW, sharing, CM and CMTS, Data transmission schemes: DOCSIS. 06 The Data Dink Layer: Error detection and correction: Types of errors, redundancy, detection versus correction, forward error correction versus retransmission, coding; Block Coding: Error detection, Error correction, Hamming distance, minimum hamming distance; ,
Linear block codes; Cyclic codes: CRC, hardware implementation, Polynomials, Cyclic code analysis, Advantages, Other cyclic codes; Checksum; Data Link Control: Framing: Fixed size and variable size framing; Flow and Error control, Protocols for Noisy Channels: simplex protocol, Stop and wait protocol; Protocols for Noisy Channels: Concept of Sliding Window Protocol, Stop and wait ARQ, Go-backN ARQ, Selective repeat ARQ; Example of Data Link Protocols: HDLC; The Data Link Layer in the Internet: PPP. Eg.: Ethernet, Token Bus and Token Ring, FDDI, Bridge Protocols, Switching in LAN environment The Medium Access Sub-layer: The channel Allocation Problem: Static and Dynamic Channel Allocation; Random Access: ALOHA, CSMA, CSMA/CD, CSMA/CA; Controlled Access: Reservation, Polling, Token passing; Channelization: FDMA, TDMA, CDMA; Ethernet: IEEE standards; Standard Ethernet: MAC Sublayer, Physical Layer; Bridged Ethernet, Switched Internet, Full-Duplex Ethernet; Fast Ethernet: MAC Sublayer, Physical Layer; Gigabit Ethernet: MAC Sublayer, Physical Layer, Ten Gigabit Ethernet. 07 The Network Layer: Network Layer Design Issues: Store and Forward Packet switching, Service provided to the transport layer, Implementation of connectionless and connection oriented services, comparison of Virtual-Circuit and Datagram Subnets; Routing Algorithms: Shortest path routing, Flooding, Distance vector routing, Link state routing, Hierarchical routing, Broadcast routing, Multicast Routing; Congestion Control Algorithms: General Principles, Congestion prevention policies, Congestion control in virtual circuit & Datagram subnets; Quality Of Service: Requirements, Techniques for achieving good QoS; Internetworking; Introduction to IP Protocol and IP Addresses, 03 The Transport Layer: The Transport Service: Transport service primitives, Berkeley Sockets, Socket programming examples; Elements of Transport Protocols: Addressing, Connection Establishment, Connection Release, Flow control and buffering, Multiplexing; Introduction to the Internet Transport Protocols: UDP and TCP 04 Network Hardware Components: Connectors, Transceivers and Media converters, Network interface cards and PC cards, Repeaters, Hubs, Bridges, Switches, Routers and Gateways etc 03 Wireless LANs/WANs: Inroduction to Architecture and Layers of IEEE 802.11, Bluetooth, SONET; Introduction to Satellite Networks.
TOPICS FOR EXPERIMENT Programs on Error detection and correction: CRC, Hamming Code, Checksum, etc Use network simulators like NS2 to implement: a. Monitoring traffic for the given topology b. Analysis of CSMA and Ethernet protocols c. Network Routing: Shortest path routing, DVR, LSR. d. Analysis of congestion control (TCP and UDP). 3. Network Socket programming: a. TCP/UDP Client-Server program. b. Stop and Wait using sockets. c. Sliding Window Program using sockets. 4. Assignment: Case study with Windows / Linux, Prepare short note on any one advanced topic. BOOKS Text Books: 1. A. S. Tanenbaum, Computer Networks, Pearson Education, Fourth Edition. 2. B. A. Forouzan, Data Communications and Networking, TMH, Fourth Edition. References: 1. M. A. Gallo and W. M. Hancock, Computer Communications and Networking Technologies, CENGAGE Learning (Indian Edition), First Edition. 2. Peterson, and Davie, Computer Networks, Morgan Kaufmann, Second Edition. 3. Kurose, Ross, Computer Networking, Pearson Education, Third Edition. 4. S. Keshay, An Engineering Approach to Computer Networking, Addison Wesley. 5. W.R. Stevens, Unix Network Programming, Vol.1, Pearson Education. TERM WORK Term work should be based on the Lab experiments (10 Marks) ,attendance (5 Marks) and at least one term test must be conducted with a weightage of (10 Marks). PRACTICAL/ORAL EXAMINATION A Practical/Oral examination is to be conducted based on the above syllabus. 1. 2.
University of Mumbai Class: T.E. Branch: Computer Semester: V Engineering Subject: Environment Studies( Abbreviated as EVS) Periods per Week Lecture 02 (each 60 min) Practical -Tutorial 01 Hours Evaluation System Theory 02 Practical and Oral -Oral --Term Work --Total 02
Marks 50 -25 75
Objectives: Objective of this course is to create environmental awareness, of variety of environmental concerns. Module Contents Hours 1 05 Nonliving Environment Soil Origin, Classification, Soil types of India, Mineral Resources, Equitable Use of Mineral Resources Water Earths reserves, Saltwater , Freshwater, Atmospheric water & Rainfall, Hydrology, Minimum Environmental Flows Air Composition, Oxygen, Carbon dioxide, Nitrogen, Wind Solar System The Sun, Solar energy 2 05 Living Environment Biodiversity, Genes, Populations, Species, Communities, Value of Biodiversity Ecosystems Classification, Ecosystem Resilience, Productivity, Food chain, Food web Nutrient cycling Biomes Rainforests, Seasonal broadleaved forests, Conifer forests Swamps, Grasslands, Arid and Semi-arid biome, Polar biome, Oceans 3 Social Environment 08 Population Population explosion and migration, Women and Children, Pressures of population growth, Industrialization, Conflicts over land, Social conflicts Disasters, Human Rights and Value Education Food: Agriculture, Irrigation, Livestock, Fisheries, Sustainable agriculture Health: Communicable diseases, Vector borne diseases, Pandemics,
Vulnerable groups, Role of information and awareness Energy: Non-renewable Energy, Renewable Energy, Hydroelectric energy, Solar energy, Wind energy, Energy from biomass, Biodiesel Urbanization: Habitation, Communication, Recreation Waste: Solid wastes, Sewage and Wastewater, Hazardous wastes, Management of solid wastes, Land disposal and Sanitary landfills, Recycling, Medical wastes Industrial wastes, Wastewater treatment, Bioremediation of wastewater Biodegradation and Composting , Management of toxic and hazardous wastes Pollution: Air pollution, Noise pollution, Thermal pollution, Water pollution, Marine pollution, Bio-magnification, Land pollution, Control Economy :Subsistence, Markets, Global trade regimes Natural resource depletion :Deforestation, Mining, Soil erosion, Loss of wetlands, Loss of biodiversity, Desertification Invasive species :Plants, Animals, Genetically Modified Organisms Environmental Conservation :Early warning systems, Bioindicators, Tsunami & other natural disasters Disaster management Impact assessment :Inventorying, Monitoring, GIS Protected Areas :Wildlife Sanctuaries, National Parks, Biosphere Reserves Endangered species :Ex-situ conservation, Conservation breeding Economic valuation :Bio-resources, Natures services National Legislation :Constitutional provisions for safeguarding the environment, The Environmental (Protection) Act, The Air (Prevention and Control of Pollution) Act, The Water (Prevention and Control of Pollution) Act, The Wildlife (Protection) Act, Forest Act, Biodiversity Act International Conventions and Treaties :Ramsar Convention, CITES, Convention on Biological Diversity, Convention to Combat Desertification, Convention on Climate Change Global Efforts in protecting the living environment Global Biodiversity Assessment, Ecosystem services and Millennium Ecosystem Assessment Sustaining Biodiversity: The Species Approach Species Extinction, importance of wild species, causes of premature extinction of wild species, protecting wild species, wild sanctuary, legislation, Reconciliation ecology Environmental Economics, politics, and worldviews Economic Systems and Sustainability Using Economics to improve Environmental Quality Reducing poverty to improve Environmental quality and human well-being Micro loans for the poor
06
06
Theory Examination: 1. 2. 3. 4. Question paper will be comprising of total 7 questions, each of 10 marks. Only 5 questions need to be solved. Question number 1 will be compulsory and covering the all modules. Remaining questions will be mixed in nature. (e.g.- suppose Q.2 has part (a) from, module 3 then part (b) will be from any module other than module 3.) 5. In question paper weightage of each module will be proportional to number of respective lecture hours as mentioned in the syllabus. Term work: Term work shall consist of minimum Five projects (PROJECTS SHALL BE DESIGNED ON THE SAME GUIDE- LINE OF BOOK BY Jagdish Krishnawamy , R J Ranjit Daniels, Environmental Studies, Wiley India Private Ltd. New Delhi) and a written test. The distribution of marks for term work shall be as follows, Laboratory work (Tutorial/Project and Journal) : 15 marks. Test (at least one) : 10 marks. The final certification and acceptance of term-work ensures the satisfactory performance of laboratory work and minimum passing in the term-work. Recommended Books: 1. Jagdish Krishnawamy , R J Ranjit Daniels, Environmental Studies, Wiley India Private Ltd. New Delhi 2. Anindita Basak, Environmental Studies, Pearson 3. Deeksha Dave , Textbook of Environmental Studies, Cengage learning, THOMSON INDIA EDITION 4. Benny Joseph Environmental StudiesTata McGRAW HILL 5. D. L. Manjunath, Environmental Studies, Pearson 6. R.Rajgopalan, Environmental Studies, Oxford 7. Erach Bharucha, Textbook of Environmental Studies , Universities Press/Orient BlackSwan.
University of Mumbai Class: T.E. Branch: Computer Semester: V Engineering Subject: Microprocessors (Abbreviated as MP) Periods per Week Lecture 04 (each 60 min) Practical 02 Tutorial -Hours Evaluation System Theory 03 Practical and Oral -Oral --Term Work --Total 03
Marks 100 50 -25 175
Module 1
Contents Introduction to Intel 8085 Microprocessor: Basic functions of the microprocessor, System bus, Architecture, Pin Configuration and Programmers model of Intel 8085 Microprocessor. Overview of the instruction groups of 8085 and the addressing modes. (No programming based on 8085). Intel 8086 Architecture: Major features of 8086 processor, 8086/88 CPU Architecture and the pipelined operation, Programmers Model and Segmented Memory. Instruction Set of 8086 and Programming: Instruction Set of 8086 microprocessor in details, Addressing modes of 8086/88, Programming the 8086 in assembly language, Mixed mode programming with C-language and assembly. Designing the 8086 CPU module: 8086 pin description in details, Generating the 8086 System Clock and Reset Signals, 8086 Minimum and Maximum Mode CPU Modules, Minimum and Maximum Mode Timing Diagrams, Interrupt Structure, Interrupt Processing and the Predefined interrupts in 8086 Processor. Peripheral Controllers for 8086 family and System Design: Functional Block Diagram and description, Control Word Formats, Operating Modes and Applications of the Peripheral Controller namely 8255-PPI, 8253-PIT, 8259-PIC and 8237-DMAC. Interfacing of the above Peripheral Controllers. Keyword and Display Interface using 8255.
Hours 06
04
06
06
14
Memory Interfacing: SRAM, ROM and DRAM (using a typical DRAM Controller such as Intel 8203). System Design based on the Memory and Peripherals Multiprocessor Systems: Study of Multiprocessor Configurations namely Tightly Coupled System (TCS) and Loosely Coupled System (LCS), TCS with the case study of the Coprocessor, Various System Bus Arbitration Schemes in LCS, and Role of the Bus Arbiter (Intel 8289) in the LCS.
06
02 I/O Buses and Standards: The EIA RS-232C Serial Interface Standard and IEEE-488 GPIB Standard. Term work: Term work shall contain minimum 10 experiments (from the list given below) and 03 assignments and at least one term test on the above syllabus. A mini-project based on the syllabus to be taken by group of students and is desirable but not mandatory. (a) Term work and the journal: Assembly Language Programming based on TASM/MASM- 03 experiments. Assembly Language Programming using BIOS/DOS interrupts- 02 experiments. Mixed Language Programming- 02 experiments, Peripheral Interfacing and applications- 05 experiments. The journal shall also contain at least 03 assignments on the syllabus/ beyond syllabus. Maximum weightage for the certified journal = 10 Marks in the Term work. the Term work. (b) Term test: Test can be a mid-term test of 50 marks (preferably preliminary examination of 100 marks at the end of the semester). Maximum weightage for the test = 10 Marks in the Term work. (c) Attendance: Minimum 75% attendance is mandatory for the student to maintain the term. Maximum weightage for the attendance = 05 Marks in the Term work.
Practical examination: Practical examination is based on the experiments carried out in the term work and may contain the other experiments based on the concepts. Necessary data sheets/control word formats will be available to the students at the time of the practical examination
Oral examination: Oral examination is based on the entire syllabus and may not be restricted to the practical carried out in the practical examination.
List of reference books: 1) Microprocessor architecture and applications with 8085: By Ramesh Gaonkar (Penram International Publication). 2) 8086/8088 family: Design Programming and Interfacing: By John Uffenbeck (Pearson Education). 3) 8086 Microprocessor Programming and Interfacing the PC: By Kenneth Ayala 4) Microcomputer Systems: 8086/8088 family Architecture, Programming and Design: By Liu & Gibson (PHI Publication). 5) Microprocessor and Interfacing: By Douglas Hall (TMH Publication).
University of Mumbai Class: T.E. Branch: Computer Semester: V Engineering Subject: Theory of Computer Science (Abbreviated as TCS) Periods per Week Lecture 04 (each 60 min) Practical 02 Tutorial -Hours Evaluation System Theory 03 Practical and Oral -Oral --Term Work --Total 03
Marks 100 --25 125
OBJECTIVES
Objectives of the Course: This course aims to build concepts regarding the fundamental principles of Grammars, Automata Theory, Turing Machines, Push Down Automata, Undecidability and Intractable Problems
PREREQUISITES
Prerequisites: Discrete Structures and Graphs Theory (e.g. Graphs, Trees, Logic and Proof Techniques) and also familiar with common Data Structures, Recursion, and the role of major system components such as Compilers. Module Contents Hours 1 Introduction:alphabets, Strings and Languages, automata and 05 Grammars. Finite. Automata (FA) -its behavior; DFA -Formal definition, simplified notations (state transition diagram, transition table), Language of a DFA. NFA -Formal definition, Language of an NFA. An Application: Text Search, FA with epsilon-transitions, Eliminating epsilon-transitions, Equivalence of DFAs and NFAs. 2 Regular expressions (RE) -Definition, FA and RE, RE to FA, FA to 03 RE, algebraic laws for RE, applications of REs, Regular grammars and FA, FA for regular grammar, Regular grammar for FA 3 Proving languages to be non-regular - Pumping Lenma, and its 03 applications. Some closure properties of Regular languages Closure under Boolean operations, reversal, homomorphism, inverse homomorphism, etc. M hill-Nerode Theorem. 4 DFA Minimization. Some decision properties of Regular languages -emptiness, finiteness, membership, equivalence of two DF As or REs, Finite automata with output. 03
Context-free Grammars (CFGs) -Formal definition, sentential forms, 10 leftmost and rightmost derivations, the language of a CFG. Derivation tree or Parse tree-Definition, Relationship between parse trees and derivations. Parsing and ambiguity, Application of CFGs,
Ambiguity in grammars and Languages. Simplification of CFGs Removing useless symbols, epsilon-Productions, and unit productions, Normal forms -CNF and GNF. Proving that some languages are not context free -Pumping lemma for CFLs, applications. Some closure properties of CFLs -Closure under union, concatenation, Kleene closure, substitution, Inverse homomorphism, reversal, intersection with regular set, etc. Some more decision properties of CFLs, Review of some undecidable CFL problems. Pushdown Automata (PDA) -Formal definition, behavior and 06 graphical notation, Instantaneous descriptions (Ids), The language of PDA (acceptance by final state and empty stack). Equivalence of acceptance by final state and empty stack, Equivalence of PDAs and CFGs, CFG to PDA, PDA to CFG. DPDAs -Definition, DPDAs and Regular Languages, DPDAs, Multistack DPDAs & NPDAs and CFLs. Languages of DPDAs, NPDAs, and ambiguous grammars 10 Turing Machines TM -Formal definition and behavior, Transition diagrams, Language of a TM, TM as accepters deciders and generators. TM as a computer of integer functions, Design of TMs, Programming techniques for TMs -Storage in state, multiple tracks, subroutines, etc. Universal TMs, Variants of TMs -Multitape TMs, Nondeterministic TMs. TMs with semi-infinite tapes, Multistack machines, Simulating TM by computer, Simulating a Computer by a TM, Equivalence of the various variants with the basic model. Recursive and recursively enumerable languages, Properties of recursive and recursively enumerable languages, A language that is not recursively enumerable (the diagonalization language). The universal language, Undecidability of the universal language, The Halting problem, Rices Theorem, Greibach Theorem, Post's Correspondence Problem (PCP) -Definition, Undecidability of PCP. Context sensitive language and linear bounded automata. Chomsky hierarchy. Intractable Problems :The classes P and NP, An NP-complete 08 problem, A Restricted Satisfiability problem, Additional NPcomplete problems, Complements of languages in NP, Problems Solvable in polynomial space, A problem that is complete for PS, Language Classes based on randomization, The complexity of primality testing.
TEXT BOOKS 1. John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman, Introduction to Automata Theory, Languages and Computation, Pearson Education. 2. J.C.Martin, Introduction to languages and the Theory of Computation, TMH. 3. Michael Sipser, Theory of Computation,Cengage Learning. REFERENCES 1. O.G.Kakde, Theory of Computation, LP. 2. Krishnamurthy E.V. , Introductory Theory of Computer Science, East-West press. TERM WORK 1. Term Work should consists of at least 04 experiments and 08 assignments (at least one implementation on each machine and at least one assignment on each module). 2. A Term Work should consists of Term Test must be conducted with a weightage of 10 marks.
University of Mumbai Branch: Computer Semester: V Engineering Subject: Web Engineering (Abbreviated as WE) Periods per Week Lecture 04 (each 60 min) Practical 02 Tutorial -Hours Marks Evaluation System Theory 03 100 Practical and Oral -25 Oral ---Term Work --25 150 Total 03 Class: T.E.
Objectives: To understand the concepts, principles, strategies, and methodologies of Web applications and development. to apply current Web technologies to understand current Web business models, to understand and apply Web development processes. Module Contents Hours 1 03 An Introduction to Web Engineering Motivation, Categories of Web Applications, Characteristics of Web Applications, Product-related Characteristics, Usage-related Characteristics, Development-related Characteristic, Evolution of web engineering. 2 05 Requirements Engineering for Web Applications Introduction, Fundamentals, Where Do Requirements Come From? Requirements Engineering Activities RE Specifics in Web Engineering, Principles for RE of Web Applications, Adapting RE Methods to Web Application Development, Requirement Types, Notations, Tools. 3 08 Technologies for Web Applications Client-side Technologies, ActiveX Controls, Document-specific Technologies, HTML-Hypertext Markup Language, DHTML, SMIL Synchronized Multimedia Integration Language, XML-eXtensible Markup Language, XSL-eXtensible Stylesheet Language, Java Script, Server-side Technologies, Servelet, URI Handlers, Web Service, Middleware Technologies 06 4 Web Application Architectures Introduction, Fundamentals, What is an Architecture? Developing Architectures Categorizing Architectures, Specifics of Web Application Architectures, Components of a Generic Web Application Architecture, Layered Architectures, 2-Layer Architectures, N-Layer Architectures Data-aspect Architectures, Database-centric Architectures, Architectures for Web Document Management, Architectures for Multimedia Data
Modeling Web Applications Introduction, Fundamental, Modeling Specifics in Web Engineering, Levels, Aspects, Phases Customization, Modeling Requirements, Hypertext Modeling, Hypertext Structure Modeling Concepts, Access Modeling Concepts, Relation to Content Modeling, Presentation Modeling, Relation to Hypertext Modeling, Customization Modeling, Relation to Content, Hypertext, and Presentation Modeling. Web Application Design Introduction, Web Design from an Evolutionary Perspective, Information Design, Software Design: A Programming Activity, Merging Information Design and Software Design, Problems and Restrictions in Integrated Web Design, A Proposed Structural Approach, Presentation Design, Presentation of Nodes and Meshes, Device-independent Development, Approaches, Interaction Design, User Interaction User Interface Organization, Navigation Design, Designing a Link Representation, Designing Link Internals, Navigation and Orientation, Structured Dialog for Complex Activities, Interplay with Technology and Architecture,Functional Design. Testing Web Applications Introduction, Fundamentals, Terminology, Quality Characteristics, Test Objectives, Test Levels, Role of the Tester, Test Specifics in Web Engineering, Test Approaches, Conventional Approaches, Agile Approaches, Test Scheme, Three Test Dimensions, Applying the Scheme to Web Applications, Test Methods and Techniques, Link Testing, Browser Testing, Usability Testing, Load, Stress, and Continuous Testing, Testing Security, Test-driven Development, Test Automation, Benefits and Drawbacks of Automated Test, Test Tools. Web Project Management Understanding Scope, Refining Framework Activities, Building a WebE Team, Managing Risk, Developing a Schedule, Managing Quality, Managing Change, Tracking the Project.
06
08
08
04
BOOKS TEXT BOOKS 1. Gerti Kappel, Birgit Proll, Web Engineering, John Wiley and Sons Ltd, 2006 2. Roger S.Pressman, David Lowe, Web Engineering, Tata Mcgraw Hill Publication, 2007 3. Guy W. Lecky-Thompson, Web Programming, Cengage Learning, 2008 REFERENCES 1. Moller, An Introduction to XML and Web Technologies , Pearson Education New Delhi, 2009 2. Chris Bates, Web Programming : Building Internet Applications, Third Edition, Wiley India Edition, 2007 3. John Paul Mueller, Web Development with Microsoft Visual Studio 2005, Wiley Dreamtech, 2006.
TERM WORK 1. Atleast six practical experiments based on above syllabus 2. A mini project is desirable to be completed by a group of three that cover following tools. HTML DHTML XML Java Script Servelet NOTE: The above (mini project) would carry a weightage of 10 marks. A term work test must be conducted with a weightage of 10 marks. Attendance 05 marks. 3. Industrial visit: Prepare and submit the report of Industrial visit in a group. Each group contain not more than five students.
Syllabus Structure(R-2007) At S.E. (Computer Engineering) Semester-VI Sr. Subject No. Scheme of Instructions Periods per Week Each Period of 60 Min. Theory Practical 1. 2. Advance Computer Network System Programming And Complier Construction Object Oriented Software Engineering Advance Microprocessor Data Warehouse And Data Mining Seminar Scheme of Evaluation
Paper TW Hours Marks 3 100 25
Practical &Oral 50
Total
175
100
25
25
150
3.
4 4 4
2 2 2 2 12
3 3 3 3
100 100 100
25 25 25 50 175
50 25 25
175 150 150 50 850
4. 5. 6.
20
500
175
University of Mumbai Class: T.E. Branch: Computer Semester: VI Engineering Subject: Advanced Computer Network (Abbreviated as ACN) Periods per Week Lecture 04 (each 60 min) Practical 02 Tutorial -Hours Evaluation System Theory 03 Practical and Oral -Oral --Term Work --Total 03
Marks 100 50 -25 175
Objectives: This is advanced course in Computer Network. Main objectives of this course are to know details of TCP/IP along with all protocols, working of internet, applications on TCP/IP, managing TCP/IP and to prepare foundation for the future networks. Demonstration and practical should be the main approach of learning this course. Pre-requisites: Computer Network Module Contents Hours 1 Introduction: Protocols and standards, Standards Organizations, 06 Internet Standards, Internet Administration; Overview of reference models: The OSI model, TCP/IP protocol Suite, Addressing, IP versions. Connectors, Transceivers and Media converters, Network interface cards and PC cards, Repeaters, Hubs, Bridges, Switches, Routers and Gateways etc. H/W selection. 2 Optical Networking: SONET/SDH standards, Dense Wavelength 06 division multiplexing (DWDM), Performance and design Considerations. 3 ATM: The WAN Protocol: Faces of ATM, ATM Protocol operations 08 (ATM cell and Transmission) ATM Networking basics, Theory of Operations, B-ISDN reference model, PHY layer, ATM Layer (Protocol model), ATM layer and cell, Traffic Descriptor and parameters, Traffic Congestion control defined, AAL Protocol model, Traffic contract and QoS, User Plane overview, Control Plane AAL, Management Plane, Sub-DS3 ATM, ATM public services. 4 Packet Switching Protocol :X.25, theory of Operation and Network 04 Layer functions, X.75, Internetworking protocols, SMDS , Subscriber Interface and Access Protocol, Addressing and Traffic Control. 5 04 Common Protocols and interfaces in upper Layer: TCP/IP suite, Network Layer, Transport Layer, Applications Layer, Addressing and routing design, Socket programming 6 Routing in the Internet: Intra and interdomain routing; Unicast 06 Routing Protocols: RIP, OSPF, BGP; Multicast Routing Protocols:
7 8
MOSPF, DVMRP. Drawbacks of traditional routing methods, Idea of TE, TE and Different Traffic classes. IP over ATM, Multi protocol Label switching(MPLS), Storage Area Networks (SAN). Network Management and Services: SNMP: Concept, Management 04 components, SMI, MIB, SNMP format, Messages 06 Traffic Engineering and Capacity Planning: Traffic engineering basics: Requirement Definitions: Traffic sizing, characteristics, Protocols, Time Delay considerations, Connectivity, Reliability, Availability and Maintainability, Throughput calculations Quality of Service: Introduction, Application, Queue Analysis: M/M/1 as a packet processing Model, QoS Mechanisms Queue management Algorithms, Feedback, Resource reservation; Queued data and Packet switched traffic modeling. Application and QoS, Network Performance Modeling, Creating Traffic Matrix, Capacity Planning and Network vision, Design Tools Multi-Media over Internet: RTP, RSVP, IP Multicasting, Voice 06 Digitization standards, G.729 and G.723 and H.323 Enterprise Network Security: DMZ, NAT, SNAT, DNAT, Port Forwarding, Proxy, Transparent Proxy, Packet Filtering and Layer 7 Filtering. Backbone Network Design: Backbone Requirements, Network Capacities Topologies, Topologies Strategies, Tuning Networks
BOOKS
Text Books: 1. B. A. Forouzan, TCP/IP Protocol Suite, Tata McGraw Hill edition, Third Edition. 2. N. Olifer, V. Olifer, Computer Networks: Principles, Technologies and Protocols for Network design, Wiley India Edition, First edition. References: 1. W.Richard Stevens, TCP/IP Volume1, 2, 3, Addison Wesley. 2. D.E.Comer, TCP/IP Volume I and II, Pearson Education. 3. W.R. Stevens, Unix Network Programming, Vol.1, Pearson Education. 4. J.Walrand, P. Varaiya, High Performance Communication Networks, Morgan Kaufmann 5. A.S.Tanenbaum,Computer Networks, Pearson Education, Fourth Edition.
TOPICS FOR EXPERIMENT 1. Installation of Proxy-Server 2. Installation of Mail-Server 3. Installation of Web-Server 4. Installation of DNS-Server 5. Packet grab and Analysis 6. Testing and measuring networks TERM-WORK Term work shall consist of at least 10 assignments/programming assignments and one written test. Marks 1. Attendance (Theory and Practical) 2. Laboratory work (Experiments and Journal) 3. Test (at least one) 05 Marks 10 Marks 10 Marks
PRACTICAL/ORAL EXAMINATION A Practical/Oral examination is to be conducted based on the above syllabus.
University of Mumbai Branch: Computer Semester: VI Engineering Subject: Advanced Microprocessors (Abbreviated as AMP) Periods per Week Lecture 04 (each 60 min) Practical 02 Tutorial -Hours Evaluation System Theory 03 Practical and Oral -Oral --Term Work --Total 03 Class: T.E.
Marks 100 25 -25 150
Pre-requisites: Computer Network Module Contents Hours 1 10 Introduction to Pipelined Processors: Pipelining: An Overlapped Parallelism, Linear pipelining, Classification of Pipelined Processors, Principles of designing pipeline processor, Data Flow computers, Systolic architecture, Superscalar, Super pipeline and VLIW processors. 2 10 Intel 80386DX Processor: Detailed study of Block diagram, Signal interfaces, Bus cycles, Programming model, Operating modes, Address translation mechanism in protected mode, Memory management, Protection mechanism. 3 06 Intel P5 Micro architecture: Pentium Processor Block diagram, Superscalar operation, Integer pipeline stages, Floating point pipeline stages, Branch prediction logic, Cache unit. 4 06 Intel P6 Micro architectures: Introduction to Pentium-Pro Processor, Special Pentium-Pro features, Introduction to Pentium-2 Processor, Pentium-2 software changes, Pentium-3 processors. 5 04 Pentium-4 & IA-64 Architectures: Pentium-4 Net Burst Architecture, IA-64 Itanium Processor architecture 6 Sun SPARC Architecture: SPARC Processor, Data Formats, Registers, Memory model. Study of SuperSPARC and UltraSPARC architectures Study of System Buses: Features, classifications, applications of the system buses like ISA, ATA, SCSI, PCI and USB. (Study of the buses is without signals and the timing diagrams), 06
06
BOOKS 1) Computer Architecture and Parallel Procesing: By Hwang & Briggs ( McGraw Hill International edition). 2) Pentium Processor Syatem Architecture: By Tom Shanley & Don Anderson (Mindshare Publishing). 3) Intel Microprocessors: By Barry B. Brey (Pearson Education) 4) Advanced Microprocessor: By Roy & Bhurchandi (Tata McGraw Hill). 5) Advanced Microprocessors: By Daniel Tabak (McGraw Hill) 6) The SPARC Architecture Manual (Version 8). 7) Intel Manuals.
TOPICS FOR EXPERIMENT 1. At least two review assignments covering object oriented concepts. 2. Coding Assignment on Mapping models to Code 3. A full-fledged mini project in which a student will design an application using OOAD case tool covering all the workflows with UML Documentation 4. Assignments on Design Patterns. 5. Working assignments using Project Management tools 6. Study of Configuration Management tool TERM-WORK Term work: (25 Marks) Term work shall contain minimum 08 experiments based on the above syllabus and the implementation of the experiments is using any Higher Level Language. PRACTICAL & ORAL EXAMINATION Practical and Oral examination is based on the entire syllabus and may not be restricted to the practical carried out in the practical examination
University of Mumbai Class: T.E. Branch: Computer Semester: VI Engineering Subject: DATA WAREHOUSING AND MINING (Abbreviated as DWM) Periods per Week Lecture 04 (each 60 min) Practical 02 Tutorial -Hours Evaluation System Theory 03 Practical and Oral -Oral --Term Work --Total 03
Marks 100 25 -25 150
Objectives: The data warehousing part of module aims to give students a good overview of the ideas and techniques which are behind recent development in the data warehousing and online analytical processing (OLAP) fields, in terms of data models, query language, conceptual design methodologies and storage techniques. Data mining part of the model aims to motivate, define and characterize data mining &S process; to motivate, define and characterize data mining applications. Pre-requisites: DBMS Module 1 2 3 4 5 Contents Data Warehousing Overview and Concepts: Need for data warehousing, The building blocks of a Data warehouse. Architecture and Infrastructure: Data Warehouse Architecture, Infrastructure and Metadata Management Principles Of Dimension Modeling: Introduction to Dimensional Modeling, Advanced Concepts Extract Transform Load Cycle: ETL overview, Extraction, Loading, Transformation techniques. Information Access and Delivery: Matching information to classes of users, OLAP the need, Design of the OLAP database, OLAP operations: slice, dice, rollup, drill-down etc. OLAP implementations. Implementation And Maintenance: Physical design process, Aggregates and Indexing. Data Warehouse Deployment Data Mining Introduction: Basics of data mining, related concepts, Data mining techniques. The KDD process 03 04 04 04 04 Hours
04
03
10
11
Concept Description: Class Characterization and comparison, Attribute relevance analysis, Attribute oriented Induction, Mining descriptive statistical measures in large databases. Classification Algorithms: What is Classification? Supervised Learning, Classifier Accuracy, Decision Tree and Nave Bayes Classifier. Clustering: What is clustering? Types of data, Partitioning Methods (K-Means, KMedoids) Hierarchical Methods(Agglomerative , Divisive) Association rules: Motivation For Association Rule mining, Market Basket Analysis, Apriori Algorithm, FP tree Algorithm, Iceberg Queries. Advanced Association Rules (just concepts) Web Mining: Web Content Mining, Web Structure Mining, Web Usage mining BOOKS
04
04
04
04
12
03
Text Books: 1) Ralph Kimball, "The Data Warehouse Lifecycle toolkit', 2nd edition, Wiley India. 2) Han, Kamber, "Data Mining Concepts and Techniques", 2nd edition ,Elsevier 3) Reema Theraja Data warehousing, Oxford University Press. 4) Introduction to Data Mining, 1/e Pang-Ning Tan, Vipin Kumar, Michael Steinbach Pearson Education 5) M.H. Dunham, "Data Mining Introductory and Advanced Topics", Pearson Education. Reference Books : 1) Paulraj Ponniah, "Data Warehousing Fundamentals", Wiley Student edition. 2) Data mining For Business intelligence Galit Shmueli, Nitin Patel, Peter Bruce; Wiley Student Edition. 3) Data Warehousing, Data Mining & OLAP Alex berson & Stephen J Smith, Tat McGraw Hill. 4) Data Mining with SQL Server 2008 Jamie McLennan & others, Wiley Indian Edition. 5) "Mastering Data Mining, M Berry and G. Linoff, Wiley Student Edition. 6) R. KimbalI, "The Data Warehouse Toolkit', John Wiley. TERM-WORK Term work should consist of at least of the following: 1. One case study given to a group of 3 /4 students, who will start form dimensional modeling and go upto generating OLAP reports.. 2. Programming the data mining algorithms (classification, clustering and Association mining) in Java on example data sets. (Can compare with tools like WEKA). 3. Study of some BI tool like SQL SERVER or ORACLE etc. PRACTICAL & ORAL EXAMINATION Practical and Oral examination is based on the entire syllabus and may not be restricted to the practical carried out in the practical examination
University of Mumbai Class: T.E. Branch: Computer Semester: VI Engineering Subject: OBJECT ORIENTED SOFTWARE ENGINEERING (Abbreviated as OOSE) Periods per Week Lecture 04 (each 60 min) Practical 02 Tutorial -Hours Evaluation System Theory 03 Practical and Oral -Oral --Term Work --Total 03
Marks 100 50 -25 175
Pre-requisites: Computer Network Module Contents 1 1.1 Software life cycle models: Waterfall, RAD, Spiral, Open-source, Agile process 1.2 Understanding software process 1.2.1 Process metric 1.2.2 CMM levels 2 2.1 Planning & Estimation 2.1.1 Product metrics 2..1.2 Estimation- LOC, FP, COCOMO models. 2.2 Project Management 2.2.1 Planning 2.2.2 Scheduling 2.2.3 Tracking. 3 3.0 Workflow of Software life cycle 3.1 Requirement Workflow 3.1.1 Functional , Nonfunctional 3.1.2 Characteristics of Requirements 3.1.3 Requirement Elicitation Techniques 3.1.4 Requirement Documentation Use case specification, Activity Diagram 3.2 Analysis workflow 3.2.1 Static Analysis 3.2.1.1 Identifying Object Methods of identifying objects and types - Boundary, Control, Entity 3.2.1 Dynamic Analysis 3.2.1.1 Identifying Interaction Sequence and Collaboration diagrams, State chart diagram 3.3.Design Workflow 3.3.1 System Design Concept Coupling and Cohesion
Hours 4
24
3.3.2 Architectural Styles 3.3.3 Identifying Subsystems and Interfaces 3.3.4 Design Patterns 4.1 Implementation Workflow 4.1.1 Mapping models to Code 4.1.2 Mapping Object Model to Database Schema 4.2 Testing 4.2.1 FTR Walkthrough and Inspection 4.2.2 Unit Testing, Integration, System and Regression Testing 4.2.3 User Acceptance Testing 4.3 Software Quality Quality Standards , Quality Matrices Testing & SQA: FTR, unit testing, integration testing, product testing, and acceptance testing
5.1 Software Configuration Management 5.1.1 Managing and controlling Changes 5.1.2 Managing and controlling versions 6.1 Maintenance 6.1.1 Types of maintenance 6.1.2 Maintenance Log and defect reports. 6.1.3 Reverse and re-engineering
BOOKS
Text Books:
1. Bernd Bruegge, Object oriented software engineering, Second Edition, Pearson Education. 2. Stephan R. Schach, Object oriented software engineering, Tata McGraw Hill. 3. Roger Pressman, Software Engineering, sixth edition, Tata McGraw Hill.
References:
1.Timothy C. Lethbridge, Robert Laganiere Object-Oriented Software Engineering A practical software development using UML and Java, Tata McGraw-Hill, New Delhi TOPICS FOR EXPERIMENT 7. At least two review assignments covering object oriented concepts. 8. Coding Assignment on Mapping models to Code 9. A full-fledged mini project in which a student will design an application using OOAD case tool covering all the workflows with UML Documentation 10. Assignments on Design Patterns. 11. Working assignments using Project Management tools 12. Study of Configuration Management tool
TERM-WORK Term Work Term work shall consist of at least 10 assignments/programming assignments and one written test. Marks 1. Attendance (Theory and Practical) 2. Laboratory work (Experiments and Journal) 3. Test (at least one) 05 Marks 10 Marks 10 Marks
The final certification and acceptance of TW ensures the satisfactory performance of laboratory Work and Minimum Passing in the term work. PRACTICAL/ORAL EXAMINATION A Practical/Oral examination is to be conducted based on the above syllabus.
University of Mumbai Class: T.E. Branch : Computer Semester : VI Engineering Subject : System Programming And Compiler Construction (Abbreviated as SPCC) Periods per Week( Each 60 Min) Lecture Practical Tutorial Theory Oral Term Work Total 04 02 ----Hours 03 --03
Evaluation System
Marks 100 25 25 150
Prerequisites: Programming Language (C/C++/ JAVA) Objectives: This course is an introduction to design and implementation of various types of system software like assemblers, macros, loaders and linkers. The course also aims to give knowledge of the principal structure of a compiler and about the basic theories and methods used to implement the different parts of the compiler. Module 1 2 3 4 5 6 7. 8 Contents
System Software : Concept, introduction to various system programs such as assemblers, loaders , linkers ,macro processors, compilers, interpreters, operating systems, device drivers Assemblers : Basic Assembler functions , Elements of Assembly language programming, Overview of the assembly process, Design of Single pass and multi pass assemblers. Examples: SPARC Assembler. Macros & Macro processors: Macro definition and examples, Definitions and concept of parameterized macro, nested macros, conditional macro expansion, recursive macro. Design of simple macro processor Loaders and Linkers Basic loader functions, Linking and Relocation concept, Concept of linkage editors, dynamic linking loader Compilers: Introduction to Compilers, Phases of a compiler, comparison of compilers and interpreters. Lexical Analysis: Role of a Lexical analyzer, input buffering, specification and recognition of tokens, Finite Automata, Designing a lexical analyzer generator, Pattern matching based on NFAs. Syntax Analysis: Role of Parser, Top-down parsing, Recursive descent and predictive parsers (LL), Bottom-Up parsing, Operator precedence parsing, LR, SLR and LALR parsers. Syntax Directed Translation: Syntax directed definitions, construction of syntax tree, Top-down translation and Bottom-up evaluation of inherited attributes, analysis of syntax directed definitions Run Time storage: Activation record, handling recursive calls, management of variable length blocks, garbage collection and compaction, storage allocation strategies.
Hours 02 06 03 03 01 03 06 03
04
10
Intermediate Code Generation: Intermediate languages: graphical representations, DAGs, Three address code, types of three address statements, syntax directed translation into three address code, implementation of three address statements Code Generation : Semantic stacks, attributed translations, evaluation of expressions, control structures, and procedure calls. Code Optimization : Machine dependent and machine independent code optimization, Sources of optimization. Compiler-compilers : JAVA compiler environment, YACC compiler-compiler
04
11 12 13
04 04 02
Books
TEXT BOOKS
1. A.V. Aho, and J.D.Ullman: Principles of compiler construction,

Pearson Education 2 . A.V. Aho, R. Shethi and Ulman; Compilers - Principles, Techniques and Tools , Pearson Education 3 Leland Beck System Software Addision Wesley 4. D. M. Dhamdhere; Systems programming & Operating systems, Tata McGraw Hill REFERENCES 1. J.J Donovan: Systems Programming. 2. Dick Grune, Koen G.L, Henri Bal; Modern Compiler Design, Wiley Publications 3. Kenneth C. Louden; Compiler Construction, Principles and Practice, Cengage Learning
4. John R. Levine; Linkers and Loaders, Morgan Kaufman

TERM WORK
1. Design and implementation of 2 pass assemblers for X86 machine. 2. Design and Implementation of Macro Processor 3. Design a Lexical Analyser for a language whose grammar is known. 4. Design and Implementation of simple Parser using Lex Yacc. 5. Implementation of code optimization techniques. 6. Generate target code for the code optimized , considering the target machine to be X86. 7. Study of Different Debugger Tools. PRACTICAL & ORAL EXAMINATION Practical and Oral examination is based on the entire syllabus and may not be restricted to the practical carried out in the practical examination
Syllabus Structure(R-2007) At B.E. (Computer Engineering) Semester-VII Scheme of Instructions Periods per Week Each Period of 60 Min. Theory 1. 2. 3. 4. 5. 6. Digital Signal & Image Processing Robotics and AI Mobile Computing System Security Elective-I Project-I 4 4 4 4 4 Practical 2 2 2 2 2 2 12
Sr. No.
Subject
Scheme of Evaluation Paper Oral/ TW practical Hours Marks 3 3 3 3 3 -100 100 100 100 100 -500 25 25 25 25 25 25 150 25 25 25 25 25 25 150 Total 150 150 150 150 150 50 800
-20
Elective- I 1) Computer Simulation and Modeling 2) E-commerce 3) Project Management 4) Soft Computing
University of Mumbai Branch : Computer Semester : VII Engineering Subject ::DIGITAL SIGNAL & IMAGE PROCESSING(Abbreviated as DSIP) Class : B.E . Periods per Week( Each 60 Min) Lecture 04 Practical 02 Tutorial ----Hours Theory 03 Oral --Term Work --Total --DETAILED SYLLABUS Module Chapter 1 Content Discrete Time Signal and System : Introduction:Signals, Systems and Signal processing, classification of signals, system, LTI system,Freqency domain representation of DTS & Signals. Convolution , Correlation. Z-Transforms: Introduction, Z-transforms , Inverse ZTransforms, properties,System Function , Application of ZTransform, Unilateral Z-Transform Discrete Fourier Transform: Introduction , DFT and its properties, FFT algorithms direct, divide and conquer approach, radix-2 algorithm(Decimination In Time ), 2-D DFT & FFT . Lect 06 L Weit -age 10%
Evaluation System
Marks 100 25 25 150
Chapter 2
06L
10%
Chapter 3
05 L
15%
02L Chapter 4 Introduction to Digital Image Processing Systems: Introduction, Brightness adoption and discrimination , Image sampling and quantization, basic relationship between pixels. Image Transforms : Introduction to Fourier Transform, 08L properties of Walsh Transform, Hadamard Transform, Discrete Cosine Transform, Slant Transform, Optimum Transform: Karhunen- Loeve (Hotelling) Transform , Radon , Comparison of Transform. Introduction to wavelet transform
5%
Chapter 5
15%
Chapter 6
Chapter 7
Image Enhancement: Image Enhancement in the Spatial domain : Spatial domain point operation and Neighbourhood Operation , Gray-Level Transformation,Median Filter , Bit plane slicing , Histogram Processing, Arithmetic and Logic Operation, Spatial filtering: Introduction, smoothing and sharpening filters., Image Enhancement in the frequency domain: Frequency-domain filters: smoothing and sharpening filters, homomorphic filtering Image Restoration and Denoising : Introduction,Image Degradation, Types of Image Blur , Classification of image restoration Techniques , Image Restoration Model , Linear and non-Linear image restoration Technique, Blind deconvolution , Image Denoising , Classification of Noise in Image, Trimmed Average Filter, Applications of Image restoration. Image segmentation: Detections of discontinuities, edge-linking and boundary detection, thresholding, regionbased segmentation, Houghs transform Image Data Compression: Fundamentals, redundancies: coding, inter-pixel, psychovisual, fidelity criteria, image compression models, error-free compression, lossy Compression
08L
15%
5L
10%
Chapter 8
4L
10%
Chapter 9
4L
10%
BOOKS
1 2 Introduction to Digital signal processing John G. Proakis, D.G. Manolakis (Maxwell Macmillan Int.) R. C.Gonsales R.E.Woods, Digital Image Processing,Second edition, Pearson Education REFERANCE : 1 2 3 4 S.Salivahanan Digital Signal processing TMH Anil K.jain, Fundamentals of Image Processing, PHI s.Jayaraman , S Esakkirajan , T Veerakumar Digital Image Processing Mc Graw Hill. TAMAL BOSE Digital Signal and Image Processing John Wiley & Sons , Inc.
TERM WORK 1.Term work should consist of at least 10 practical experiments and two assignments covering the topics of the syllabus (15 marks) A term Work test of 10 marks must be conducted .
List of Practicals 1. 2 3 4 5 6 7 8 9 10 11 12 Write Matlab Program for generation and Manipulation of signal. Write Matlab Program for convolution and correlation. Write C/C++ Program for Discrete Fourier Transform. Write Matlab Program for Image negative , Gray level Slicing Write Matlab Program for Dynamic range compression &Bit plane slicing Write Matlab Program for Histogram Processing Write Matlab Program for Image smoothing. Write Matlab Program for Image sharpening. Write Matlab Program for Edge detection. Write Matlab Program for Trimmed Average Filter. Write Matlab Program for lossless Image Compression. Write Matlab Program for lossy Image Compression.
Robotics and AI (Abbriviated as RAI) CLASS B.E. ( COMPUTER ENGINEERING) SEMESTER VII HOURS PER LECTURES : 04 WEEK TUTORIALS : -PRACTICALS : 02 HOURS MARKS EVALUATION THEORY 3 100 SYSTEM: PRACTICAL -ORAL -25 TERM WORK -25 Prerequisite: Exposure to linear algebra and matrix operations. Exposure to programming in a high level language. Objective: The field of robotics is in a state of rapid development. Early robots were nothing more than mechanical devices. As computer technology improved, robots become more sophisticated. Computer engineer plays a very crucial role in converting such mechanical devices into intelligent machines through a branch of computer science called artificial intelligence (AI). The goal of this course is to familiarize the students with the basic concepts of robotics, artificial intelligence and intelligent machines. It will help students to understand and apply principles, methodology and techniques of intelligent systems to robotics.
Module 1
Contents
Intelligent Robotics: Automation and Robots, Robot Classification, Robot Specifications, Sensory perception, Robot control and Intelligence. Direct Kinematics: Coordinate Frames, Rotations, Homogeneous Coordinates, The arm Equation, (DK analysis of - 2 Axis and 3 Axis Planar robot, Four axis SCARA Robot, Five axis Articulated robot). Inverse Kinematics: General Properties of Solutions, Tool Configuration, (IK analysis of - 2 Axis and 3 Axis Planar robot, Four axis SCARA Robot, Five axis Articulated robot). Workspace Analysis and Trajectory Planning: Workspace analysis, Work envelope of 4-axis SCARA Robot, Work envelope of 5-axis articulated Robot, Workspace Fixtures, The pick-and-place operation, Continuous-Path Motion, Interpolated Motion, StraightLine Motion. Basic Concepts of Artificial Intelligence: Intelligence, Problem representation in Artificial Intelligence, Problem-solution Techniques used in Artificial Intelligence. Elements of Knowledge Representation: Logic, Production Systems, Semantic Networks, Expert Systems. Task Planning: Task-Level Programming, Uncertainty, Configuration Space, Gross-Motion Planning, Grasp Planning, FineMotion Planning, Task Planning Problem.
Hrs 4
12
10
6 7
6 4
Text Book 1. Robotics and AI, Andrew Staugaard, PHI 2. Fundamentals of Robotics- Analysis and Control, Robert Schilling, Pearson Education References: 1. Introduction to Robotics, J. J. Craig, Pearson Education. 2. Robotics, Fu, Gonzales and Lee, McGraw Hill. 3. Artificial Intelligence: Structures and Strategies for Complex Problem Solving, George F. Luger, Pearson Education. 4. Industrial Robotics- Technology, programming, and applications, Groover, Weiss, Nagel and Odrey, McGraw Hill 5. Elaine Rich and Kevin Knight, Artificial Intelligence, TMH List of Practicals These experiments can be performed using 1) Use of Control-X simulation Control of X-Y Position Table manually and thru Programming. 2) Use of Control-X simulation Control of Conveyor manually and thru Programming. Programming using sensors and conveyor. 3) Use of Control-X simulation Program for bottling plant experiment using Conveyer and Pneumatics 4) Use of P-Simulator design a pneumatic circuit using a double acting cylinder and 5/2 Air Spring Valve to open the main gate of a factory which can be controlled by a security personnel from the security room.
Term Work: Term work shall consist of at least 05 experiments and 03 assignments covering all topics and one written test. Distribution of marks for term work shall be as follows: 1. Laboratory work (Experiments and Journal) 15 Marks 2.Test (at least one) 10 Marks The final certification and acceptance of TW ensures the satisfactory Performance of laboratory Work and Minimum Passing in the term work.
Class : B.E .
University of Mumbai Branch : Computer Semester : VII Engineering Subject :: MOBILE COMPUTING (Abbreviated as MC) Lecture 04 Practical 02 Tutorial ----Hours Theory 03 Oral --Term Work --Total ---
Periods per Week( Each 60 Min)
Evaluation System
Marks 100 25 25 150
Objective: Recent developments in portable devices and high-bandwidth, ubiquitous wireless networks has made mobile computing a reality. Indeed, it is widely predicted that within the next few years access to Internet services will be primarily from wireless devices, with desktop browsing the exception. Such predictions are based on the huge growth in the wireless phone market and the success of wireless data services. This course will help in understanding fundamental concepts, current developments in mobile communication systems and wireless computer networks. Pre-requisites: Computer Networks. Topic to be covered 1 .
Hrs
2.
Introduction: Short history of wireless communication, Applications, Frequency for radio 05 transmission, Signals, Antennas, Signal propagation, Multiplexing, Modulation, Spread Spectrum, Cellular systems (DSSS & FHSS). Motivation for a specialized MAC: Hidden and Exposed terminals. Near and Far terminals; Multiple access with collision avoidance, Polling, Inhibit sense multiple access; CDMA: Spread Aloha multiple access Telecommunication Systems I: PCS Architecture, Cellular Telephony: Advanced 05 Mobile Phone Service(AMPS); Global System for Mobile Communication (GSM); EIA/TIA IS-136 Digital Cellular System; EIA/TIA IS-95 Digital Cellular System, Cordless Telephony and Low-Tier PCS: Cordless Telephone, Second Generation (CT2); Digital European Cordless Telephone (DECT); UMTS, Personal Handy Phone System (PHS); Personal Access Communications System (PACS) ; Unlicensed Systems, 3G Wireless systems. Mobility Management: Handoff (Inter-BS, Intersystem), Roaming Management, Handoff Management - Detection and Assignment: Strategies for Handoff Detection, Channel Assignment, Handoff Management Radio Link Transfer: Hard and Soft Handoff, Network Signaling : Signaling System No.7, Interconnection and Message Routing, Mobility Management.
3.
Telecommunication Systems II: GSM: Mobile services, System Architecture, Radio 09

interface, Protocols, Localization and Calling, Handover, Security, New data services, GSM Short Message Service, VOIP service for Mobile Networks : GSM on the Net, The iGSM Wireless VoIP Solution, The H.323 Network, iGSM Architecture, iGSM Procedures and Message Flows: Registration, Deregistration, Call Delivery to the IP Network: Implementation Issues; International Roaming for GSM, GSM Operations, Administration, & Maintenance, Mobile Number Portability. GPRS: Functional Groups, GPRS Architecture, GPRS Network Nodes:18.3.1 Mobile Station; Base Station System; GPRS Support Node; HLR and VLR, GPRS Interfaces: Um Interface; EDGE;Gb Interface; Gn and Gp Interfaces; Gs Interface; Gi Interface, GPRS Procedures. Third-Generation Systems :W-CDMA and cdma2000; Improvements on Core Network; Quality of Service in 3G, Wireless Local Loop: Wireless Local Loop Architecture; Deployment Issues; TR-45 Service Description; Wireless Local Loop Technologies. TETRA, UMTS, and IMT-2000: UMTS Basic Architecture, UTRA FDD mode, UTRA TDD mode. Satellite Systems: History, Applications, Basics: GEO, LEO, MEO; Routing, Localization, Handover, Examples. Wireless LAN: Infrared vs. Radio transmission, Infrastructure and Ad hoc Networks, IEEE 802.11: System architecture, Protocol architecture, Physical layer, Medium Access Control layer, MAC management, Future development; HIPERLAN: Protocol architecture, Physical layer, Channel access control sublayer, Medium Access Control sublayer, Information bases and Networking. Bluetooth: User Scenarios, Physical Layer, MAC layer, Networking. Security, link management, Enterprise PCS: Office Level , Local Area Wireless: An Example of WPBX, Capacity Planning for WPBX, IrDA ZigBee, RFID, Wireless Broadband (WiMax) Wireless ATM: Motivation for WATM, Wireless ATM working group, WATM services, Reference model: Example configurations, Generic reference model; Functions: Wireless mobile terminal side, Mobility supporting network side; Radio access layer: Requirements, BRAN Mobile Network and Transport Layer: Mobile IP: Goals, assumptions and requirements, Entities and Terminology, IP packet delivery, Agent advertisement and discovery, Registration, Tunneling and Encapsulation, Optimizations, Reverse tunneling, Ipv6; Dynamic host configuration protocol, Ad hoc networks MANET: Routing, Destination sequence distance vector, Dynamic source routing, Hierarchical algorithms, Alternative metrics. Mobile Transport Layer: Traditional TCP: Congestion control, Slow start, Fast retransmit/fast recovery, Implications on mobility; Indirect TCP, Snooping TCP, Mobile TCP, Fast retransmit/fast recovery, Transmission/time-out freezing, Selective retransmission, Transaction oriented TCP. Wireless Sensor Networks: Applications, Mobile Internet Connectivity, and Personal Area Network
4 5
01 08
05
7.
06
8.
Support for Mobility:

Mobile Computing Architecture: Three Tier Architecture for mobile computing, Design
considerations, Mobile Computing through Internet. File systems: Consistency, Examples; World Wide Web: Hypertext transfer protocol, Mobile File System, Mobile databases. Language Support: Hypertext markup language (XHTML)-MP, Wireless markup language; WML script,Mobile Application Languages-XML, Voice XML. Java, J2ME and JavaCard. Wireless application protocol: Architecture, Wireless datagram protocol, Wireless transport layer security, Wireless transaction protocol, Wireless session protocol, WAP UAProf and Caching , User Agent Profile , Caching Model , Wireless Bearers for WAP , WAP Developer Toolkits and application environment, Wireless telephony application, Mobile agents, Application Server, Gateways, Portals, Service Discovery, Device Management Wireless devices and their Operating System : PalmOS; Windows CE; EPOC; Symbian OS; Linux for Mobile Devices. Mobile Agents Synchronization : Synchronization Software for Mobile Devices , Synchronization Protocols, SyncML-Synchronization Language for Mobile Computing, Sync4J (Funambol) Synchronized Multimedia Markup Language (SMIL), Security, m-commerce. Threats and Security Issues in Mobile Computing:
09
Books
Text Books: 1. Jochen Schiller, "Mobile communications", Addison wisely, Pearson Education 2. Wireless and Mobile Network Architecture : Yi Bang Lin and Imrich Chlamtech (Wiley). 3. Mobile Computing by RajKamal (Oxford). References : Rappaort, "Wireless Communications Principals and Practices' YI Bing Lin, "Wireless and Mobile Network Architectures', John Wiley P. Nicopolitidis, "Wireless Networks', John Wiley K. Pahlavan, P. Krishnamurthy, "Principles of Wireless Networks" Introduction to Wireless Telecommunication System and Networks by Mullett (Cengage Learning) 6. Uwe Hansmann, Lothar Merk, Martin S. Nicklous, Thomas Stober, Principles of Mobile Computing , Springer
1. 2. 3. 4. 5.
Term work
Term work should consist of least 10 practical experiments and two assignments covering the topic of the syllabus. Suggested Laboratory Exercises of Mobile Computing: 1. Setup & Configuration of Wireless Access Point (AP) 2. Study of WLAN : Ad Hoc & Infrastructure Mode 3. Study of Bluetooth Protocol and Applications 4. GSM modem study (Nokia 30) and SMS client-server application 5. Implementation of Mobile Network using Network Simulator (NS2) 6. Mobile Internet and WML 7. J2ME Program for Mobile Node Discovery 8. Mobile protocol study using omnet++ 9. Design and Program Income Tax and Loan EMI Calculator for Mobile Phones. 10. Wireless Network Security : kismet and Netstumbler Distribution of marks for term work shall be as follows: Laboratory work (Experiments and Journal) 15 Marks Test (at least one) 10 Marks The final certification and acceptance of TW ensures the satisfactory Performance of laboratory Work and Minimum Passing in the term work.
Orals
Oral examination is to be conducted based on the above syllabus University of Mumbai Class: B.E . Branch : Computer Semester : VII Engineering Subject :: SYSTEM SECURITY (Abbreviated as SS) Periods per Week( Each 60 Min) Lecture 04 Practical 02 Tutorial ----Hours Theory 03 Oral --Term Work --Total ---
Evaluation System
Marks 100 25 25 150
Module Chapter 1 Chapter 2
Content Introduction to Information Security: Security Goals Cryptography: i. Crypto Basic, Classic Cryptography ii. Symmetric Key Cryptography: Stream Ciphers, A5/1, RC4, Block Ciphers, Feistel Cipher, DES, Triple DES, AES iii. Public Key Cryptography: Kanpsack, RSA, Defiie-Hellman, use of public key crypto- Signature and Non-repudiation, Confidentiality and Non-repudiation, Public Key Infrastructure. iv. Hash Function: The Birthday Problem, MD5, SHA-1, Tiger Hash, Use of Hash Function Access control - Authentication and Authorization: i. Authentication Methods, Passwords, Biometric, Single sign on, Authentication Protocol, Kerberos. ii. Access control Matrix, ACLs, Multiple level security model, Multilateral security, Covert channel, CAPTCHA Software security: i. Software Flaws, Buffer Overflow, Incomplete Mediation, Race conditions ii. Malware, Salami attack, Linearization Attacks, Trusting Software iii. Software reverse engineering, Digital Rights management. iv. Operating System and Security Network Security: i. Network security basics ii. TCP/IP Model and Port No., Protocol flaws iii. Enterprise wide network Design and Vulnerabilities. iv. Reconnaissance of network v. Packet sniffing, Session Hijacking, ARP Spoofing vi. Web site and web server vulnerabilities vii. Denial of Service viii. SSL and IPSec protocol ix. Firewall. Intrusion Detection System, and Honey pots Text Books
Hours 03 10
Chapter 3
08
10
Chapter 4
Chapter 5
15
1) Cryptography and Network Security by Behrouz A. Forouzan, TATA McGraw hill. 2) Security in Computing by Charles P. Pfleeger , Pearson Education
1) 2) 3) 4) 5)
Reference Books Information security Principles and Practice by Mark Stamp, Wiley publication Cryptography and Network Security, William Stalling, Prentice hall Principles of Information Security, Michael E., cengage learning Information Systems Security, Nina Godbole, Wiley Network security bible 2nd edition, Eric Cole
TERM WORK i. Term work should consist of at least 8 practical experiments and two assignments covering the topics of the syllabus. ii. A term Work test of 10 marks must be conducted. Distribution of marks for term work shall be as follows: Laboratory work (Experiments and Journal) 15 Marks Test (at least one) 10 Marks The final certification and acceptance of TW ensures the satisfactory Performance of laboratory Work and Minimum Passing in the term work.
ORAL Oral / Practical Examination must be based upon the syllabus of 25 marks.
University of Mumbai Class: B.E. Branch: Computer Semester: VII Engineering Subject: COMPUTER SIMULATION AND MODELING(Abbreviated CSM) Periods per Week Lecture 04 (each 60 min) Practical 02 Tutorial -Hours Marks Evaluation System Theory 03 100 Oral -25 Term Work -25 Total 03 150 Objectives of the course: The objective of this course is to teach students methods for modeling of systems using discrete event simulation. Emphasis of the course will be on modeling and on the use of simulation software. The students are expected to understand the importance of simulation in IT sector, manufacturing, telecommunication, and service industries etc. By the end of the course students will be able to formulate simulation model for a given problem, implement the model in software and perform simulation analysis of the system. Pre-requisites: Probability and Statistics
1. Introduction to Simulation and Modeling: Simulation introduction, appropriate and not appropriate, advantages and disadvantage, application areas, history of simulation software, an evaluation and selection technique for simulation software, general purpose simulation packages. System and system environment, components of system, type of systems, model of a system, types of models and steps in simulation study. 2. Manual Simulation of Systems: Simulation of Queuing Systems such as single channel and multi channel queue, lead time demand, inventory system, reliability problem, timeshared computer model, job-shop model. 3. Discrete Event Formalisms: Concepts of discrete event simulation, model components, a discrete event system simulation, simulation world views or formalisms, simulation of single channel queue, multi channel queue, inventory system and dump truck problem using event scheduling approach. 4. Statistical Models in Simulation: Overview of probability and statistics, useful statistical model, discrete distribution, continuous distribution, empirical distribution and Poisson process. 5. Queueing Models: Characteristics of queueing systems, queueing notations, long run measures of performance of queueing systems, Steady state behavior of Markovian models (M/G/1, M/M/1, M/M/c) overview of finite capacity and finite calling population models, Network of Queues. 6. Random Number Generation: Properties of random numbers, generation of true and pseudo random numbers, techniques for generating random numbers, hypothesis testing, various tests for uniformity (Kolmogorov-Smirnov and chi-Square) and independence (runs, autocorrelation, gap, poker). 7. Random Variate Generation: Introduction, different techniques to generate random variate:- inverse transform technique, direct transformation technique, convolution method and acceptance rejection techniques. 8. Input Modeling: Introduction, steps to build a useful model of input data, data collection, identifying the distribution with data, parameter estimation, suggested estimators, goodness of fit tests, selection input model without data, covariance and correlation, multivariate and time series input models. 9. Verification and Validation of Simulation Model: Introduction, model building, verification of simulation models, calibration and validation of models:- validation process, face validity, validation of model, validating input-output transformation, t-test, power of test, input output validation using historical data and Turing test. 10. Output Analysis: Types of simulations with respect to output analysis, stochastic nature of output data, measure of performance and their estimation, output analysis of terminating simulators, output analysis for steady state simulation. 11. Case Studies: Simulation of manufacturing systems, Simulation of Material Handling system, Simulation of computer systems, Simulation of super market, Cobweb model, and any service sectors.
Text Book: Banks J., Carson J. S., Nelson B. L., and Nicol D. M., Discrete Event System Simulation, 3rd edition, Pearson Education, 2001. Reference Books: 1. Gordon Geoffrey, System Simulation, 2nd edition, PHI, 1978. 2. Law A. M., and Kelton, W. D., Simulation Modeling and Analysis, 3rd edition, McGraw-Hill, 2000. 3. Narsing Deo, System Simulation with Digital Computer, PHI. 4. Frank L. Severance, System Modeling and Simulation 5. Trivedi K. S., Probability and Statistics with Reliability, Queueing, and Computer Science Applications, PHI, 1982. 6. Wadsworth G. P., and Bryan, J. G., Introduction to Probability and Random Variables, McGraw-Hill, 1960. 7. Donald W. Body, System Analysis and Modeling, Academic Press Harcourt India. 8. Bernard, Theory Of Modeling and Simulation 9. Levin & Ruben, Statistics for Management. 10. Aczel & Sounderpandian, Business Statistics. Term Work: Term work shall consist of at least 10 experiments covering all topics and one written test. Distribution of marks for term work shall be as follows: Laboratory work (Experiments and Journal) 15 Marks Test (at least one) 10 Marks The final certification and acceptance of TW ensures the satisfactory Performance of laboratory Work and Minimum Passing in the term work. Suggested Experiment list The experiments should be implemented using Excel, simulation language like GPSS and/or any simulation packages. Case studies from the reference book can be used for experiment. 1. Single Server System 2. Multi serve system like Able Baker 3. (M, N) - Inventory System 4. Dump Truck Problem 5. Job-Shop Model 6. Manufacturing System 7. Cafeteria 8. Telecommunication System 9. Uniformity Testing 10. Independence Testing
University of Mumbai Class: B.E. Branch : Computer Semester : VII Engineering Subject: E-Commerce (Abbreviated as e-com.) Elective-I Periods per Week (Each 60 Min) Lecture 04 Practical 02 Tutorial ----Hours Theory 03 Oral -Term Work -Total --
Evaluation System
Marks 100 25 25 150
Objectives of the course:
To understand Technical aspect of E-commerce and E-Business To describe the process of E-commerce and E-business To understand Infrastructure design issues of E-commerce Contents of the Course Part 1: E-commerce 1. Introduction: Electronic commerce and Physical Commerce, different type of ecommerce, some e-commerce scenario, Advantages of e-commerce 2. Basic technologies of Ecommerce: Client side Programming, Server Side Programming, Database connectivity, session tracking techniques. 3. Advance technologies of E-commerce: Mobile Agent, WAP, XML, Data Mining, Rich Internet Application, Web 2.0, REST Web Services, Web Mashup, Working of Search Engines, Internet Security. 4. Internet Payment System: Characteristics of payment system, SET Protocol for credit card payment, E-cash, E-check, Micropayment system 5. E-commerce strategies: Strategies for marketing, Sales and Promotions, Strategies for Purchasing and support activities, Strategies for Web Auctions, Virtual Communities, and web portals 6. E-Business -Introduction: E-Business vs E-commerce,, Characteristics of e-Business, eBusiness role and their challenges, e-business Requirements, impacts of e-business 7. E-business strategies: Strategic positioning, Levels of e-business strategies, Strategic planning process, Strategic alignment, the consequences of e-Business, Success factors for implementation of e-business strategies. Business models, Business process and collaborations
8. Integration of Application: Approaches to Middleware, RPC and RMI, Enterprise Application Integration, e-business Integration, loosely Coupled e-Business solutions for integration, Service Oriented Architecture, EAI and web Services,WS-security. 9. E-commerce Infrastructure Cluster of Servers, Virtualization Techniques, Cloud computing, Server consolidation using cloud, Introduction to Hadoop, HDFS, Google Apps engine
TEXT BOOKS: 1. E-Commerce Fundamentals and application (Henry Chan) Wiley publication 2. Electronics Commerce (Gary Schneider) Thomson Course technology 3. E-Business Organizational and technical foundation (Michael P) Wiley Publication REFERENCES: 1. 2. 3. 4. 5. E- Commerce Strategies, Technology and applications (David) Tata McGrawHill Introduction to E-commerce (jeffrey) Tata- Mcgrawhill E-Business and Commerce- Strategic Thinking and Practice (Brahm) biztantra Using Google Aps engine (Severance) Oreilly Hadoop : The Definitive Guide (White) Oreilly
Term Work Term work shall consist of at least 6 assignments/programming assignments and one written test. Marks 1. Laboratory work (Experiments and Journal) 2. Test (at least one) 15 Marks 10 Marks
The final certification and acceptance of TW ensures the satisfactory performance of laboratory Work and Minimum Passing in the term work. Suggested List of Experiments Exp 1: All experiments should be part of final e-commerce portal development 1. 2. 3. 4. 5. 6. Home page design Form validation (Ajax enabled) Catalog design and Search techniques (Web mining , and Ajax enabled) Access control mechanism (session management) Creating Web Site to integrate at least five REST web Services (Web Mashups) Server side using Web Services
Exp 2: Creating Hadoop clusters on Ubuntu Project Management (Elective-II) CLASS B.E. ( Computer Engineering) Elective SEMESTER VIII HOURS PER WEEK LECTURES : 04 TUTORIALS : -PRACTICALS : 02 HOURS MARKS EVALUATION THEORY 3 100 SYSTEM: ORAL 25 TERM WORK 25 Objectives of the course: To understand Much of the unique knowledge needed to manage projects. To understand the Life cycle and phases of project management. To understand knowledge areas and tools-techniques for efficient project management focusing IT projects. Contents of the Course 1. Introduction to Project Management 1.1 What is project 1.2 The triple constraint 1.3 What is project management 1.3.1 Stakeholders 1.3.2 Project Management Knowledge Area 1.3.3 Project Management tools and techniques 1.4 Role of a Project Manager 1.4.1 Project Manager's job description 1.4.2 Suggested Skills for Project Manager 1.4.3 Importance of people and leadership skills 2. Project Management and IT context 2.1 Organizational Structure 2.2 Project Life Cycle and Phases 2.3 Nature of IT projects 2.4 Characteristics of IT project Team members 2.5 Trends affecting IT Project Management 2.5.1 Globalization 2.5.2 Outsourcing 2.5.3 Virtual Teams 3. Project Integration Management 3.1 Project Selection 3.1 Developing Project Charter 3.3 Developing Project Management Plan
4. Project Scope Management 4.1 Collecting Requirements 4.2 Defining Scope 4.3 Creating Work Breakdown Structure 4.4 Controlling Scope 5. Project Time Management 5.1 Defining and Sequencing Project Activities and Dependencies 5.2 Developing Schedule 5.2.1 Gantt Chart 5.2.2 Critical Path Method 5.2.3 Incorporating Project Uncertainty - PERT 5.2.4 Critical Chain Method 5.3 Resource loading and Resource Leveling 5.4 Schedule Controlling 6. Project Cost Management 6.1 Estimating Techniques 6.2 Earned Value Management 7. Project Quality Management 7.1 Planning Quality 7.2 Performing Quality Assurance 7.3 Quality Control Tools and Techniques 8. Project Resource Management 8.1 Development of Human Resource Plan 8.2 Project Organizational Chart and Responsibility Assignment 8.3 Multi project Scheduling and Resource Allocation 9. Project Communication Management 9.1 Identifying Stakeholders 9.2 Planning Communication 10. Project Risk Management 10.1 Identifying Risks ;Common Sources of Risk in IT Projects 10.2 Qualitative Risk Analysis : Probability and Impact Matrix 10.3 Quantitative Risk Analysis : Decision Trees 10.4 Planning Risk Response 11. Project Procurement Management 11.1 Planning and conducting procurement TEXT BOOKS: 1. PMP Project Management Professional Study Guide, Third Edition by Joseph Phillips
2. Project Management Core Text Book ; Samuel J. Mantel et.al. With M.R. Gopalan; Wiley India Edition. 3. Project Management Handbook by Uddesh Kohli, K. K. Chitkara
Class : B.E .
University of Mumbai Branch : Computer Engineering
Semester : VII
Subject : SOFT COMPUTING (Abbreviated as SC) Periods per Week( Each Lecture 60 Min) Practical Tutorial Evaluation System Theory Oral Term Work Total
(Elective-I)
04 02 ----Hours 03 ----03
Marks 100 25 25 150
Term Work Term work shall consist of at least 6 assignments/1 project which will contain detailed documentation of each of the project management phases and one written test. Marks 1. Laboratory work (Experiments and Journal) 2. Test (at least one) 15 Marks 10 Marks
The final certification and acceptance of TW ensures the satisfactory performance of laboratory Work and Minimum Passing in the term work.
Sr. No 1.
DETAILED SYLLABUS Topics FUZZY SET THEORY: Introduction to Neuro Fuzzy and Soft Computing Fuzzy Sets Basic Definition and Terminology Set-theoretic Operations Member Function Formulation and Parameterization Fuzzy Rules and Fuzzy Reasoning Extension Principle and Fuzzy Relations Fuzzy If-Then Rules Fuzzy Reasoning Fuzzy Inference Systems Mamdani Fuzzy Models Sugeno Fuzzy Models Tsukamoto Fuzzy Models Input Space Partitioning and Fuzzy Modeling.
Hours
10
AIM : To introduce the techniques of soft computing and adaptive neuro-fuzzy inferencing systems which differ from conventional AI and computing in terms of its tolerance to imprecision and uncertainty. Objectives : To introduce the ideas of fuzzy sets, fuzzy logic and use of heuristics based on human experience To become familiar with neural networks that can learn from available examples and generalize to form appropriate rules for inferencing systems To provide the mathematical background for carrying out the optimization associated with neural network learning To familiarize with genetic algorithms and other random search procedures useful while seeking global optimum in self-learning situations To introduce case studies utilizing the above and illustrate the intelligent behavior of programs based on soft computing 2. OPTIMIZATION Derivative-based Optimization Descent Methods The Method of Steepest Descent Classical Newtons Method Step Size Determination Derivative-free Optimization Genetic Algorithms Simulated Annealing Random Search Downhill Simplex Search NEURAL NETWORKS Supervised Learning Neural Networks Perceptrons - Adaline Backpropagation Mutilayer Perceptrons Radial Basis Function Networks Unsupervised Learning Neural Networks Competitive Learning Networks Kohonen SelfOrganizing Networks Learning Vector Quantization Hebbian Learning. NEURO FUZZY MODELING Adaptive Neuro-Fuzzy Inference Systems Architecture Hybrid Learning Algorithm Learning Methods that Cross-fertilize ANFIS and RBFN Coactive Neuro Fuzzy Modeling Framework Neuron Functions for Adaptive Networks Neuro Fuzzy Spectrum.
08
3.
10
4.
09
5.
APPLICATIONS OF COMPUTATIONAL INTELLIGENCE Printed Character Recognition Inverse Kinematics Problems Automobile Fuel Efficiency Prediction Soft Computing for Color Recipe Prediction.
08
TEXT BOOK 1. J.S.R.Jang, C.T.Sun and E.Mizutani, Neuro-Fuzzy and Soft Computing, PHI, 2004, Pearson Education 2004. REFERENCES 1. Timothy J.Ross, Fuzzy Logic with Engineering Applications, McGraw-Hill, 1997. 2. Davis E.Goldberg, Genetic Algorithms: Search, Optimization and Machine Learning, Addison Wesley, N.Y., 1989. 3. S. Rajasekaran and G.A.V.Pai, Neural Networks, Fuzzy Logic and Genetic Algorithms, PHI, 2003. 4. R.Eberhart, P.Simpson and R.Dobbins, Computational Intelligence - PC Tools, AP Professional, Boston, 1996. TERM WORK iii. Term work should consist of at least 8 practical experiments and two assignments covering the topics of the syllabus. iv. A term Work test of 10 marks must be conducted. Distribution of marks for term work shall be as follows: Laboratory work (Experiments and Journal) 15 Marks Test (at least one) 10 Marks The final certification and acceptance of TW ensures the satisfactory Performance of laboratory Work and Minimum Passing in the term work. Oral Examination must be based upon the syllabus of 25 marks. PROJECT I CLASS B.E. ( COMPUTER ENGINEERING) SEMESTER VII HOURS PER LECTURES : -WEEK TUTORIALS : -PRACTICALS : 02 HOURS MARKS EVALUATION THEORY --SYSTEM: PRACTICAL --ORAL -25 TERM WORK -25 Objective: The Project work enables students to develop further skills and knowledge gained during the programme by applying them to the analysis of a specific problem or issue, via a substantial piece of work carried out over an extended period. For students to demonstrate proficiency in the design of a research project, application of appropriate research methods, collection and analysis of data and presentation of results. Guidelines:
1. Project Topic: To proceed with the project work it is very important to select a right topic. Project can be undertaken on any subject addressing IT programme. Research and development projects on problems of practical and theoretical interest should be encouraged. Project work must be carried out by the group of at least two students and maximum three and must be original. Students can certainly take ideas from anywhere, but be sure that they should evolve them in the unique way to suit their project requirements. The project work can be undertaken in a research institute or organization/company/any business establishment. Student must consult internal guide along with external guide (if any) in selection of topic. Out of the total projects 35 percent may be allowed as to be industry projects, 65 percent projects must be in house. Head of department and senior staff in the department will take decision regarding projects. Student has to submit weekly progress report to the internal guide and where as internal guide has to keep track on the progress of the project and also has to maintain attendance report. This progress report can be used for awarding term work marks. In case of industry projects, visit by internal guide will be preferred. Make sure that external project guides are BE graduates. 2. Project Report Format: At the end of semester a project report should preferably contain at least following details: Abstract Introduction Aims and objectives Literature Surveyed Existing system (if any) Problem Statement Scope Proposed System Methodology (your approach to solve the problem) Analysis Details of Hardware & Software Design details Implementation Plan for next semester 3. Term Work: Distribution of marks for term work shall be as follows: 1. Project Report 15 Marks 2. Term End Presentation (Internal) 10 Marks The final certification and acceptance of TW ensures the satisfactory performance on the above three aspects.
4. Final Assessment: Project I examination should be conducted by two examiners appointed by university. Students have to give demonstration and seminar on the Project I.
Syllabus Structure(R-2007) At B.E. (Computer Engineering) Semester-VII Scheme of Instructions Periods per Week Each Period of 60 Min. Theory 1. 2. 3. 4. 5. 6. Digital Signal & Image Processing Robotics and AI Mobile Computing System Security Elective-I Project-I 4 4 4 4 4 Practical 2 2 2 2 2 2 12
Sr. No.
Subject
Scheme of Evaluation Paper Oral/ TW practical Hours Marks 3 3 3 3 3 -100 100 100 100 100 -500 25 25 25 25 25 25 150 25 25 25 25 25 25 150 Total 150 150 150 150 150 50 800
-20
Elective- I 1) Computer Simulation and Modeling 2) E-commerce 3) Project Management 4) Soft Computing
Syllabus Structure(R-2007) At B.E. (Computer Engineering) Semester-VIII Scheme of Instructions Periods per Week Each Period of 60 Min. Theory 1. 2. 3. 4. 5. Distributed Computing Multimedia System Design Software Architecture Elective-II Project-II 4 4 4 4 -16 Practical 2 2 2 2 4 12
Sr. No.
Subject
Scheme of Evaluation Paper Oral/practi TW cal Hours Marks 3 3 3 3 -100 100 100 100 -400 25 25 25 25 50 150 25 25 25 25 50 150 Total 150 150 150 150 100 700
Elective-II 1) Human Computing Interaction 2) Advanced Internet Technology 3) Computer Vision 4) Embedded System
Syllabus Structure(R-2007) At B.E. (Computer Engineering) Semester-VIII Scheme of Instructions Periods per Week Each Period of 60 Min. Theory 1. 2. 3. 4. 5. Distributed Computing Multimedia System Design Software Architecture Elective-II Project-II 4 4 4 4 -16 Practical 2 2 2 2 4 12
Sr. No.
Subject
Scheme of Evaluation Paper Oral/practi TW cal Hours Marks 3 3 3 3 -100 100 100 100 -400 25 25 25 25 50 150 25 25 25 25 50 150 Total 150 150 150 150 100 700
Elective-II 1) Human Computing Interaction 2) Advanced Internet Technology 3) Computer Vision 4) Embedded System
University of Mumbai Branch : Computer Semester : VIII Engineering Subject :: Distributed System (Abbreviated as DS) Periods per Week( Each Lecture 04 60 Min) Practical 02 Class: B. E.
Evaluation System
Tutorial ----Hours Theory 03 Oral -Term Work -Total 03
Marks 100 25 25 150
Objective: This course aims to build concepts regarding the fundamental principles of distributed systems. The design issues and distributed system concepts are covered Pre-requites: Operating Systems and Computer network
DETAILED SYLLABUS
1. Fundamentals: Distributed computing, system model, distributed operating system, designing operating system, Introduction to DCE 2. Message Passing : Desirable features message passing system, Issues in message passing, synchronization, buffering, multidatagram messages , Encoding and decoding of message data, Process addressing, Failure handling, Group communication. 3. Remote procedure call: RPC model, Transparency of RPC, implementing RPC mechanism, Stub generation, Marshaling arguments and Results, Server Management, Parameter-passing Semantics , call Semantics, Communication protocols for RPCs, Complicated RPC Client server binding, Exception Handling , Security, special types of RPCs, RPCs in Heterogeneous Environments, Lightweight RPC, Optimizations for better performance. 4. Distributed Shared Memory: General architecture of DSM systems, Design and implementation of DSM, Granularity, structure of shared memory space, consistency models, Replacement Strategy, Thrashing, other approaches to DSM, Heterogeneous DSM, and Advantages of DSM 5. Synchronization: clock synchronization, event ordering, mutual exclusion, Deadlock, Election Algorithm 6. Resource and Process Management: Desirable Features of global Scheduling algorithm, Task assignment approach, Load balancing approach, load sharing approach, Introduction to process management, process migration, Threads
7. Distributed File Systems: Introduction, good features of DFS, File models, File Accessing models, File sharing Semantics, File-Caching Schemes, File Replication, Fault Tolerance, Atomic Transactions and design principles. 8. Naming : Introduction, Desirable features of Naming system, Fundamental concepts, System oriented Names, Object locating mechanisms, human oriented Names, Name Caches and Naming and Security
BOOKS Text Books: 1. Pradeep K Sinha Distributed Operating Systems : Concepts and design IEEE computer society press 2. A. Tanuenbaum Distributed Operating System Pearson Edition 3. PUDER, ROMER Distributed Systems Architecture : Middleware approach ELSEVIER publication References: 1. G. Coulouris, J. Dollimore and T. Kindberg Distributed Systems : Concepts and design Pearson Edition 2. M. Singhal, N. Shivaratri Advanced Concepts in Operating Systems TMH TERM WORK Term work should consist of at least 10 practical experiments and two assignments covering the topics of the syllabus Distribution of marks for term work shall be as follows: Laboratory work (Experiments and Journal) 15 Marks Test (at least one) 10 Marks The final certification and acceptance of TW ensures the satisfactory Performance of laboratory Work and Minimum Passing in the term work. ORAL EXAMINATION An oral examination is to be conducted based on the above syllabus. List of assignment ( Minimum 10 ) 1. Implementation of Election Algorithm 2. Implementation of Deadlock 3. Java socket programming. 4. Client-server implementation using RPC/RMI. 5. Client server implementation using CORBA architecture. 6. Implementation of Clock synchronization 7. Study of data centric & client centric consistency model.
8. Case study/implementation of DCOM 9. Study project on Java Beans 10. R.S. A. for Distributed System 11. Study experiment on Network operating system and Distributed operating system with example 12. Implementation name resolution 13. Study/ implementation of stateful server and stateless server
University of Mumbai Class : B.E . Branch : Computer Semester : VIII Engineering Subject :: Multimedia System Design (Abbreviated as MSD) Periods per Week( Each 60 Min) Lecture 04 Practical 02 Tutorial ----Hours Theory 03 Oral -Term Work -Total 03 Content
Evaluation System
Marks 100 25 25 150 Lect 06
Module Chapter 1
Introduction:
What is multimedia, Properties of multimedia systems: Independency, computer support, communication systems, Global structure, Multimedia system Architecture:- IMA, workstation , network architecture Evolving Technologies, Applications of multimedia
Chapter 2
Multimedia data and interactions

Data Streams:-Elements of multimedia systems, Objects of multimedia systems, Types: Traditional Vs Continuous, Medium: perception, representation, presentation, storage, transmission, information exchange Multimedia communication system Model:- Interpersonal communication, Interactive application over internet, Entertainment and application Requirements : User, network Architectural Issues Multimedia communication subsystems :- Application subsystem, Transport subsystem, QoS and resource management, basic concepts establishing and closing multimedia call ,Managing resources during multimedia transmission
06
Chapter 3
Compression & Decompression

Introduction to digitization principle -text ,image, audio, video, File formats RTF, TIFF,RIFF, Need , types of data compression , Binary (Text ) compression scheme, Packbit encoding (RLE), CCITT group 3 1D,3 21D and 4 2D compression, Color Image,JPEG methodology, JPEG 2000 standard, Performance comparison of JPEG and JPEG2000
05
Video
Chapter 4 Introduction to digital video: Types Chromasub sampling, CCIR , HDTV Computer Video format, Video compression: Based on motion compression Motion vector search technique : Sequential, 2D logarithmic, Hierarchal search, Standards used H.261,Comparison of MPEG and H.264 , MPEG 1,2,4,7 and File formats DVI
05
Chapter 5
Audio/Sound
Basic sound concepts :Computer representation of sound, Audio formatsMIDI,WAV Music: MIDI concepts, MIDI Devices, MIDI Messages, MIDI SMPTE timing standard MIDI Software:Speech, Speech Generation, Speech Analysis, Speech Transmission Audio Compression: ADPCM in speech coding, MPEG audio
05
Chapter 6
Storage Requirements
Basic technology: Video disk :Audio data rate SNR wrt VCD player , CD player, DVD, Juke box, Peripherals and databases required for multimedia Input devices :- Electronic pen, Scanner, digital camera Output devices :- Printers ( Inkjet, laser) , plotters Multimedia database system :Characteristics, Data structures Operations, Models : Object oriented, relational databases
07
Chapter 7
Distributed Multimedia Systems

Components of distributed MM system, MM object server , managing distributed objects, Distributed C.S operations, synchronization, Real time multimedia, Requirement, Designing, Streaming protocols
07
Chapter 8
Multimedia presentation and Authoring

Multimedia system design & its Issues, Authoring Systems, Design Issues Approaches, Types, User Interface Issues, Architecture, Information characteristics for presentation, Presentation design knowledge, Effective HCI
04
Chapter 9
Applications
Copyright Act for multimedia and method of licensing Applications:-Multimedia animation, Virtual Reality, Knowledge based multimedia systems
04
Textbooks :-
1) Multimedia: Computing, Communications and Applications, Steinmetz Ralf and Nahrstedt Klara, Pearson Education 2) Multimedia System design , Prabhat K. Andheigh, Kiran Thakrar 3) Multimedia Systems, Koegel Buford, Pearson Education 3) Fundamentals of Multimedia , Ze-Nian Li, Mark.S.Drew 4) Multimedia Communication Systems: Techniques, standards and networks, K.R.Rao,D.Milovanovic
References:1) 2) 3) 4) Multimedia database systems :- Subramanian,M.Kaufman Computer Networking :- J.F.Kurose , Pearson Edu Multimedia communications, Halshall, Pearson,Edu Multimedia Systems Koegel Buford, Pearson Edu.
List of Experiments ( reference ) :At least 10 experiments to clear the concepts behind multimedia system design needs to be performed. Distribution of marks for term work shall be as follows: Laboratory work (Experiments and Journal) 15 Marks Test (at least one) 10 Marks The final certification and acceptance of TW ensures the satisfactory Performance of laboratory Work and Minimum Passing in the term work. Sr.No. 1 2 3 4 5 6 7 8 9 10 11 12 13 List of Practical Experiments Study of MAYA software Study of FLASH software Creating a banner Creating a ghost (unshaped) 2D object Create animation using (expt 3,4 ) Add sound to above expt (with play button ) Create moving objects (using expt 5) Create a game using action script Create a flash based presentation (4/5 frames) with UI controls Study of VLC player, its setting, streaming and non streaming techniques. Study of streaming audio/video for distributed network Study of VRML Create a 3D object using 2D and show special effects for the same
Oral / Practical Examination must be based upon the syllabus University of Mumbai
Class: B.E.
Branch: Computer Engineering Subject: Software Architecture (Abbreviated as SA) Periods per Week Lecture (each 60 min) Practical Tutorial Evaluation System Theory Oral Term Work Total
Semester: VIII
04 02 -Hours 03 --03 Marks 100 25 25 150
Objectives of the course: Software architecture is foundational to the development of large, practical software-intensive applications. Critically, this course focuses on supporting creation of real implemented systems. Hence the course details not only modeling techniques, but design, implementation, deployment, and system adaptation -- as well as a host of other topics -- putting the elements in context and comparing and contrasting them with one another. Rather than focusing on one method, notation, tool, or process, this new course widely surveys software architecture techniques, enabling us to choose the right tool for the job at hand. Pre-requisites: Object Oriented Software Engineering
Module 1
Contents Basic Concepts 1.1 Concepts of Software Architecture 1.2 Models. 1.3 Processes. 1.4 Stakeholders. Designing Architectures 2.1 The Design Process. 2.2 Architectural Conception. 2.3 Refined Experience in Action: Styles and Architectural Patterns. 2.4 Architectural Conception in Absence of Experience. Connectors 3.1 Connectors in Action: A Motivating Example. 3.2 Connector Foundations. 3.3 Connector Roles. 3.4 Connector Types and Their Variation Dimensions. 3.5 Example Connectors. Modeling
4.1 Modeling Concepts. 4.2 Ambiguity, Accuracy, and Precision. 4.3 Complex Modeling: Mixed Content and Multiple Views. 4.4 Evaluating Modeling Techniques. 4.5 Specific Modeling Techniques. Analysis 5.1 Analysis Goals. 5.2 Scope of Analysis. 5.3 Architectural Concern being Analyzed. 5.4 Level of Formality of Architectural Models. 5.5 Type of Analysis. 5.6 Analysis Techniques. Implementation and Deployment 6.1 Concepts. 6.2 Existing Frameworks. 6.3 Software Architecture and Deployment. 6.4 Software Architecture and Mobility. Conventional Architectural styles 7.1 Pipes and Filters 7.2 Event- based, Implicit Invocation 7.3 Layered systems 7.4 Repositories 7.5 Interpreters 7.6 Process control Applied Architectures and Styles 8.1 Distributed and Networked Architectures. 8.2 Architectures for Network-Based Applications. 8.3 Decentralized Architectures. 8.4 Service-Oriented Architectures and Web Services. Designing for Non-Functional Properties 9.1 Efficiency. 9.2 Complexity. 9.3 Scalability and Heterogeneity. 9.4 Adaptability. 9.5 Dependability. Domain-Specific Software Engineering 10.1 Domain-Specific Software Engineering in a Nutshell. 10.2 Domain-Specific Software Architecture. 10.3 DSSAs, Product Lines, and Architectural Styles. TOPICS FOR EXPERIMENT Modeling using xADL Analysis Case study Visualization using xADL 2.0 Integrate software components using a middleware
08
04
05
08
04
10
04
1. 2. 3. 4.
5. 6.
Use middleware to implement connectors Wrapper to connect two applications with different architectures University of Mumbai Class : B.E . Branch : Computer Semester : VIII Engineering Subject : HUMAN COMPUTER INTERACTION (Abbreviated as HCI)
(Elective-I)
7. 8.
Creating web service Architecture for any specific domain BOOKS
Text Books:
1. 2. 3.
1. 2.
Software Architecture: Foundations, Theory, and Practice by Richard N. Taylor, Nenad Medvidovic, Eric Dashofy , ISBN: 978-0-470-16774-8 M. Shaw: Software Architecture Perspectives on an Emerging Discipline, Prentice-Hall. Len Bass, Paul Clements, Rick Kazman: Software Architecture in Practice, Pearson Pattern Oriented Software Architecture by Frank Buchnan etal, Wiley India. The Art of Software Architecture by Stephen T. Albin
References:
TERM WORK Term work should be based on the Lab experiments (15 Marks) and at least one term test must be conducted with a weightage of (10 Marks).
PRACTICAL/ORAL EXAMINATION A Practical/Oral examination is to be conducted based on the above syllabus.
Periods per Week( Each 60 Min)
Evaluation System
Lecture 04 Practical 02 Tutorial ----Hours Theory 03 Oral -Term Work --Total ---
Marks 100 25 25 150
Sr. No
DETAILED SYLLABUS Topics
Hours
Objectives To facilitate communication between students of psychology, design, and computer science on user interface development projects. To provide the future user interface designer with concepts and strategies for making design decisions. To expose the future user interface designer to tools, techniques, and ideas for interface design. To introduce the student to the literature of human-computer interaction. To stress the importance of good user interface design 1. Introduction: Importance of user Interface definition, importance of good design. Benefits of good design. A brief history of Screen design,
04
2.
The graphical user interface popularity of graphics, the concept of direct manipulation, graphical system, Characteristics, Web user Interface popularity, characteristics- Principles of user interface. Design process Human interaction with computers, importance of human characteristics human consideration, Human interaction speeds, and understanding business junctions.
06
3.
05
4.
Screen Designing:- Design goals Screen planning and purpose, organizing screen elements, ordering of screen data and content screen navigation and flow Visually pleasing composition amount of information focus and emphasis presentation information simply and meaningfully information retrieval on web statistical graphics Technological consideration in interface
10
design.
Windows New and Navigation schemes selection of window, selection of devices based and screen based controls.
04
6 7 8
Components text and messages, Icons and increases Multimedia, colors, uses problems, choosing colors. Software tools Specification methods, interface Building Tools. Interaction Devices Keyboard and function keys pointing devices speech recognition digitization and generation image and video displays drivers.
04 03 06
TEXT BOOKS : 1. The essential guide to user interface design, Wilbert O Galitz, Wiley DreamTech. 2. Designing the user interface. 3rd Edition Ben Shneidermann , Pearson Education Asia. REFERENCE BOOKS: 1. Human Computer Interaction. Alan Dix, Janet Fincay, Gre Goryd, Abowd, Russell Bealg, Pearson Education 2. Interaction Design Prece, Rogers, Sharps. Wiley Dreamtech, 3. User Interface Design, Soren Lauesen , Pearson Education. TERM WORK i. Term work should consist of at least 8 practical experiments and two assignments covering the topics of the syllabus. ii. A term Work test of 10 marks must be conducted. Distribution of marks for term work shall be as follows: Laboratory work (Experiments and Journal) 15 Marks Test (at least one) 10 Marks The final certification and acceptance of TW ensures the satisfactory Performance of laboratory Work and Minimum Passing in the term work. Oral Examination must be based upon the syllabus of 25 marks.
Advanced Internet Technology (Elective-II) Abbreviated as (AINT) Class: B.E. ( Computer Engineering) SEMESTER VIII HOURS PER WEEK LECTURES : 04 TUTORIALS : -PRACTICALS : 02 HOURS MARKS EVALUATION THEORY 3 100 SYSTEM: ORAL 25 TERM WORK 25 Objectives of the course:
To understand Technical aspect of Internet Technology To learn Advanced web programming
Contents of the Course

Section 1: Advanced Internet Protocols DNS, Working of DNS, DNS Header, Type of Records in DNS, forward and Reverse lookup, Configuration of Open Source (OS) DNS, working of DDNS - DHCP, DHCP header, Working of DHCP, Configuration of OS DHCP - FTP, Working of FTP, Configuration of OS Public FTP server and Private FTP server Understanding IPv6, CIDR, Hierarchical Routing, and Routing Protocol over internet. Multimedia over Internet, Voice over IP, Virtual Private network Section 2: Internet as a Distributed computing platform 1) Understanding Web Services technology, REST based web services (Resource Oriented Architecture) and Service oriented Architecture. 2) Introduction to cloud computing, case study and working of Google App engine and Amazon cloud. 3) Working of Peer to Peer over internet with case study of Bittorent , Section 3; Advanced Internet programming 1) HTML 5.0, Rich Internet Technology, AJAX, FLEX , Integrating PHP and AJAX, Consuming Web Service with AJAX, Resource Syndication (RSS), Working principle of search engines Section 4: Internet Security Public Key Infrastructure, Client side Vulnerabilities, Server Side Vulnerabilities, Database Vulnerabilities, Secure Payment Mechanism, Security issues in cloud
TEXT BOOKS /REFERENCE BOOKS: Section1: 1) TCP/IP Protocol Suite : By Behrouz A. Forouzan : Tata McGraw-Hill Section 2: 1) Cloud Computing : A practical Approach: By Anthony T. Velte : Tata McGraw-Hill 2) Using Google App Engine: By Charles : Oreilly Press 3) Cloud Application Architecture: By George: Oreilly Press 4) RESTful web services: By Leonard: OReilly Press 5) Web Services Essentials:By Ethan: OReilly Section 3: 1) Rich Internet Application AJAX and Beyond: B y Dana moore : Wrox press 2) Web 2.0 Programming : By Eric : Wrox Press 3) HTML 5.0: By Mark: Oreilly Press 4) Web Technologies NEW :Black Book : Dreamtech Section 4: 1) Information Security :By Mark Stamp : Wiley Publication 2) Cloud Security and Privacy: By Tim : OReilly Marks 1. Laboratory work (Mini Projects and Journal) 2. Test (at least one) 15 Marks 10 Marks
The final certification and acceptance of TW ensures the satisfactory performance of laboratory Work and Minimum Passing in the term work. Suggested List of Experiments
Students need to perform three Mini projects based on the syllabus. Time duration for each project will be three weeks. Suggested List of Mini Projects
1) 2) 3) 4) 5)
Configuration of Private cloud using open source technology Development of DMZ for the college Creating RIA web Site Working with SOA and REST based Web Services Working With Goggles APP engine (In Python)
University of Mumbai Class: B.E. Branch: Computer Engineering Subject: Computer Vision(Elective-II) Periods per Week Lecture (each 60 min) Practical Tutorial Semester: VIII
04 02 --
Hours Marks Evaluation System Theory 03 100 Oral -25 Term Work -25 Total 03 150 Objectives of the course: To introduce the student to computer vision algorithms, methods and concepts which will enable the student to implement computer vision systems with emphasis on applications and problem solving Pre-requisites: Introduction to Image Processing. Module 1 2 Contents Recognition Methodology: Conditioning, Labeling, Grouping, Extracting, Matching. Morphological Image Processing: Introduction, Dilation, Erosion, Opening, Closing,Hit-or-Miss transformation, Morphological algorithm operations on binary images, Morphological algorithm operations on gray-scale images, Thinning, Thickining , Region growing, region shrinking. Image Representation and Description: Representation schemes, Boundary descriptors, Region descriptors Binary Machine Vision: Thresholding, Segmentation, Connected component labeling, Hierarchal segmentation, Spatial clustering, Split & merge, Rule-based Segmentation, Motion-based segmentation. Area Extraction: Concepts, Data-structures, Edge, Line-Linking, Hough transform, Line fitting, Curve fitting (Least-square fitting). Region Analysis: Region properties, External points, Spatial Hours 02 04
3 4
04 06
5 6
05 05
moments, Mixed spatial gray-level moments, Boundary analysis: Signature properties, Shape numbers. Facet Model Recognition: Labeling lines, Understanding line 04 drawings, Classification of shapes by labeling of edges, Recognition of shapes, Consisting labeling problem, Back-tracking Algorithm Perspective Projective geometry, Inverse perspective 04 Projection, Photogrammetry - from 2D to 3D, Image matching : Intensity matching of ID signals, Matching of 2D image, Hierarchical image matching. Object Models And Matching: 2D representation, Global vs. Local 02 features
10
11
12 13
General Frame Works For Matching: Distance relational approach, Orderedstructural matching, View class matching, Models database organization. General Frame Works: Distance -relational approach, Ordered Structural matching, View class matching, Models database organization. Knowledge Based Vision: Knowledge representation, Controlstrategies, Information Integration. Object recognition Hough transforms and other simple object recognition methods Shape correspondence and shape matching Principal component analysis Shape priors for recognition BOOKS
03
03
03 02
Text Books: 1.Robert Haralick and Linda Shapiro, "Computer and Robot Vision", Vol I, II, AddisonWesley, 1993. 2. David A. Forsyth, Jean Ponce, "Computer Vision: A Modern Approach"
References: 3. 1. Milan Sonka,Vaclav Hlavac, Roger Boyle, "Image Processing, Analysis, and Machine Vision" Thomson Learning TERM WORK Term work should be based on the Lab experiments (15 Marks) , and at least one term test must be conducted with a weightage of (10 Marks). Elective II: EMBEDDED SYSTEMS
CLASS: B.E. (COMPUTERS) HOURS PER WEEK LECTURES TUTORIALS PRACTICALS THEORY PRACTICAL ORAL TERM WORK
SEMESTER VIII (Elective) 04 -02 Hours 03 Marks 100 25 25
EVALUATION SYSTEM
1. Introduction to Embedded Systems Review of microcontrollers and Digital Signal Processors (DSP), architecture, peripheral modules. Embedded micro controller cores (ARM, RISC, CISC, SOC), addressing modes, interrupts structure, hardware multiplier, pipelining. Hardware/Software co-design. Architecture of embedded systems. 2. Embedded Software Development Assemblers, linkers and loaders. Binary file formats for processor executable files. Typical structure of timer-interrupt driven programs. GNU-GCC compiler introduction, programming with Linux environment and gnu debugging, gnu insight with step level trace debugging, make file interaction, building and execution. 3. Design with ARM Processor Introduction to ARM instruction set, addressing modes, operating modes with ARM core, ARMTDMI modes, ADC, Timers, Interrupt structure. Byte ordering (LE, BE), Thumb mode normal mode instructions changes, Pipeline utilization with all register allocations. Compare with ARM7, ARM9, and ARM11 with new features additions. System design with ARM processor.
4. Input / Output Interfacing Interfacing with switches, keyboards, LEDs, LCDs, transistors used for digitalcontrolled current switches, digital-controlled relays, solenoids, DC, AC and stepper motors, analog interfacing and data acquisition systems. 5. Real-time Operating System Real Time Operating System Concepts, Kernel Structure, Critical Sections, Multitasking, Task Management, Time Management, Schedulers, Event Control Blocks, Priorities, Deadlocks, Synchronization, Semaphore Management, Mutual Exclusion, Message Mailbox Management, Message Queue Management, Memory Management, RTOS implementation. Examples of OSs for embedded systems - RT Linux, uC/OS.
6. Applications of Embedded Systems Database applications; Image processing, Process-control, Robotics, Automation, Security and communication.
Text Books: 1. Embedded / Real-Time Systems: Concepts, Design & Programming Dr. K. V. K. K. Prasad dreamtech Press, India. 2. An Embedded Software Primer David E. Simon Pearson Education South Asia. 3. Embedded Microcomputer Systems Real Time Interfacing - Jonathan W. Valvano Thomson Asia Pte Ltd. 4. ARM System Developers Guide Designing and Optimizing System Software Andrew N. Sloss, Dominic Sysmes and Chris Wright Elsevier Inc.
Reference Books: 1. Embedded Systems, Architecture, Programming and Design Raj Kamal Tata McGraw Hill. 2. Embedded Linux Hollabaugh, Pearson Education. 3. Embedded Realtime Systems Programming - Sriram V Iyer, Pankaj Gupta Tata McGraw Hill. 4. Fundamentals of Microcontrollers and Applications in Embedded Systems Ramesh Gaonkar Penram International Publishing (India) Pvt. Ltd. Term Work: Term work should consist of at least 8 practicals and one mini project. Objective type term work test shall be conducted with a weightage of 10 marks.
Marks: Distribution of marks for term work shall be as follows: Laboratory work (Experiments and Project) Test (at least one) 15 Marks 10 Marks
The final certification and acceptance of Term Work ensures the satisfactory performance of laboratory work and minimum passing in term work.
List of Experiments: Topic-1: Troubleshooting Tools [Any Two] 1. 2. 3. 4. In-Circuit Emulator (ICE) and In-Circuit Debugger (ICD) Logic Analyzer Spectrum Analyzer Pattern generator and Digital Storage Oscilloscope
Topic -2: ARM Processors & Interfaces [Any Two] 1. 2. 3. 4. 5. 6. 7. 8. 9. LEDs and Keyboard Interface 16x2 LCD Interface Counting external events with on chip counters DC Motor Control Relay and Buzzer Control for alarm events Unipolar and Bipolar Stepper Motor Control On chip ADC SPI / I2C / CAN Interface Blue tooth/Zig-bee interface
Topic-3: Device Driver Development [Any Two] 1. 2. 3. 4. Drivers for RS-232 Drivers for USB2.0 Drivers for Ethernet Drivers for Graphics LCD/Touch Screen
Topic-4: Real Time Operating System (RTOS) [Any Two] 1. RTLinux porting to x86 Architecture 2. uCLinux porting to ARM Architecture 3. GCC porting to RISC Architecture
PROJECT II CLASS B.E. ( COMPUTER ENGINEERING) HOURS PER LECTURES : -WEEK TUTORIALS : --
SEMESTER VIII
04 HOURS MARKS EVALUATION THEORY --SYSTEM: PRACTICAL --ORAL -50 TERM WORK -50 Objective: The primary objective is to meet the milestones formed in the overall project plan decided in Project - I. The idea presented in Project I should be implemented in Project B with results, conclusion and future work. The project will culminate in the production of a thesis by each individual student.
PRACTICALS
Guidelines: 1. Project Report Format: At the end of semester a student need to prepare a project report which should preferably contain at least following details:Abstract, Project overview, Introduction and Motivation, Problem Statement, Requirement Analysis, Project design, Implementation Details, Technologies used , Test cases, Project time line, Task Distribution, conclusion & future work, references, and Appendix consisting of user Manuals. Every student must prepare well formatted, printed and hard bound report. Along with project report a CD containing: project documentation, Implementation code, required utilities, Softwares and user Manuals need to be attached.
2. Term Work: Student has to submit weekly progress report to the internal guide and where as internal guide has to keep track on the progress of the project and also has to maintain attendance report. This progress report can be used for awarding term work marks. In case of industry projects, visit by internal guide will be preferred to get the status of project. Distribution of marks for term work shall be as follows: 1. Project Report (Hard Bound) 25 Marks 2. Term End Presentation (Internal) 25 Marks The final certification and acceptance of TW ensures the satisfactory performance on the above three aspects. 3. Final Assessment: Project II examination should be conducted by two examiners appointed by university. Students have to give demonstration and seminar on the Project II. Computer Engineering Equivalent subjects
Semester VII R 2001 i) Digital signal processing ii) Advanced Microprocessor iii) software Engineering iv)Inteligent system v)Elective I a) Mobile computing b)Computer Simulation & modeling c) Pattern Recognition d)Embeded system e) Advanced Computer Network f) Image Processing vi) Project A
Semester VII R2007 i) Digital signal processing (R2001) ii) Advanced Microprocessor(R2001 iii) Project Management ( Sem 7-R2007) iv) Inteligent system (R2001) v) Elective -I a)Mobile computing (Sem VII R2007) b) Computer simulation & modeling ( sem VII R2007) c) Pattern Recognition (R2001) d) Embeded system (R2001) e) Advanced computer network (R2001) f) Image processing (R2001) vi) Project A
Semester VIII 2001 i) System Security ii) Multimedia system iii) Distributed Computing iv) Elective II a) Data ware housing and Mining b) Computer Vision c) Software testing d)Neural network & fuzzy system e) Parallel Processing v) Project B
Semester VIII R 2007 i) System security ( Sem VII R 2007) ii) Multimedia system design (R 2007) iii) Distributed Computing (R2007) iv) Elective II a) Data ware housing and Mining (R2001) b) Computer vision (R2007) c) Software Testing (R2001) d) Neural network & fuzzy system ( R 2001) e) Parallel Processing (R2001) v) Project B

Course Description

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Course Description

Uploaded by

Copyright:

Available Formats

AC6/6/2012 ItemNo.4.

Total 05 3.5 3.5 06 05 02 02 27

125 100 100 150 150

FEC201 FEC202 FEC203 FEC204 FEC205

FEC101 Applied MathematicsI

DetailedSyllabus Sr.No 1 Topics Hrs

CircularandInverseHyperbolicfunctions.Logarithmicfunctions. 1.3: 1.4: SeparationofrealandImaginarypartsofalltypesofFunctions.

Expansion of sinn,cosn in terms of sines and cosines of 2hrs multiplesofandExpansionofsinn,cosninpowersofsin,cos

Module2:Matrices and Numerical Methods: 2.1:

Eulers Theorem on Homogeneous functions with two and three independentvariables(withproof).DeductionsfromEulersTheorem.

Thedistributionofmarksfortermworkwillbeasfollows, Attendance(TheoryandTutorial) ClassTutorialsonentiresyllabus SciLabTutorials :10 :05marks :10marks

Teaching Scheme Theory 03 Pract. 01 Tut. Theory 03

Credits Assigned TW/Pract 0.5 Tut. Total 3.5

FEC102 Applied Physics-I

FEC102 Applied Physics-I

Detailed Syllabus: 1. CRYSTAL STRUCTURE (15)

FEC103 Applied ChemistryI Sub. Code SubjectName

FEC103 Applied ChemistryI 15

FEC104 Engineering Mechanics

FEC104 Engineering Mechanics

Teaching Scheme Theory 04 Pract. 02 Tut. Theory 04

Credits Assigned TW/Pract 01 Tut. Total 05

FEC105 Basic Electrical & Electronics Engineering

FEC105 Basic Electrical & Electronics Engineering

Theory 6 Environmental studies 02

Teaching Scheme Theory Pract. 04 Tut. Theory -

Credits Assigned TW/Pract 02 Tut. Total 02

FEL101 Basic Workshop Practice - I Sub. Code Subject Name

FEL101 Basic Workshop Practice-I

Detailed Syllabus Note:

DetailedSyllabus: Sr.No. 1 Topic Hrs

Subject Code FEC202

Subject Name Applied Physics - II

Teaching Scheme Theory Pract. Tut. 03 01 -

Credits Assigned TW/Pract Tut. 0.5 -

1. INTERFERENCE AND DIFFRACTION OF LIGHT

Subject SubjectName Code FEC204 EngineeringDrawing

TeachingScheme Theory Pract. Tut. 03 04

CreditsAssigned Theory TW/Pract Tut. 03 02

FEC204 Engineering Drawing

ExaminationScheme TheoryMarks InternalAssessment Endsem. Test1 Test2 AverageofTest exam 1andTest2 15 15 15 60

Term Pract Work .

Teaching Scheme Theory Pract. 04 Tut. Theory -

Credits Assigned TW/Pract 02 Tut. Total 02

FEL201 Basic Workshop Practice-II

FEL201 Basic Workshop Practice-II

Detailed Syllabus is given in Basic Workshop Practice-I

CSC301 CSC 302 CSC303 CSC304 CSC305 CSC306

Exam Duration ( in Hrs) 03 03 03 03 03 03 -

125 150 150 125 100 150 750

CSC303 CSC304 CSC305 CSC306

CSC401 CSC402 CSC403 CSC404 CSC405 CSC406

CSC401 CSC402 CSC403

125 150 150

Theoretical Computer Science Computer Graphics

100 150 825

Suggested list of Programming Assignments /Laboratory Work

To illustrate Multithreading in Java. Simple programs on Applets and AWT.

Subject Code CSC303

Data Structures (DS)

Correlation 3.1Scattered diagrams, Karl Pearsons coefficient of correlation, covariance,

5. Probability and Statistics for Engineering, Dr. J Ravichandran, Wiley-India.

Module name Introduction to analysis of algorithm:

Divide and Conquer 2