Download 3rd year Syllabus [Autonomous] - Vasavi College of Engineering

VASAVICOLLEGEOFENGINEERING(AUTONOMOUS)
Ibrahimbagh,Hyderabad‐31
ApprovedbyA.I.C.T.E.,NewDelhiand
AffiliatedtoOsmaniaUniversity,Hyderabad‐07
Sponsoredby
VASAVIACADEMYOFEDUCATION
Hyderabad
STUDENTHANDBOOK2016–2017
AcademicRegulations(Autonomous)andSyllabiof
THIRDYEARB.E(IT)
DEPARTMENTOFINFORMATIONTECHNOLOGY
+91‐40‐23146050,23146051
Fax:+91‐40‐23146090
Website:www.vce.ac.in
1
DEPARTMENT MISSION
DEPARTMENT VISION
E‐JOURNALS&E‐BOOKSSUBSCRIBED
ASCE
ASME
IEEEASPP
ACMDigitalLibrary
SpringerMechanical
TotalGISTE‐Journals
DELNETCONSORTIUM(IESTCE‐Journals‐2016)
DELNETE‐Journals
Totale‐journals
DELNETMEMBERSHIPE‐Books
JournalsandmagazinesPrintversion
2
35
27
155
1138
49
1405
1152
817
3374
335
106
ABOUTTHECOLLEGE
Established in 1981 by Vasavi
VISION
Academy of Education under the
Striving for a symbiosis of
stewardship of Late Sri Pendekanti
technological excellence and
Venkata Subbaiah, a veteran
statesman of independent India and
human values
by a few eminent people from
different walks of life Vasavi College of Engineering represents a rich
tradition of excellence in technology based education in a stimulating
environment. From a modest beginning with just three undergraduate
programs,viz.,B.E.degreeprogramsinCivil,MechanicalandElectronics
&CommunicationEngineering,withdedicatedeffortsforover33years,
it has now grown into a mighty center of learning with excellent and
well‐developed infrastructural facilities, offering 6 undergraduate
programs, viz., B.E. in Civil, Mechanical, Electrical & Electronics,
Electronics & Communication Engineering, Computer Science &
Engineering, and Information Technology, in addition to a3‐year
postgraduate program in Computer Applications (MCA), and 2‐Year
PostgraduateProgrammesinCSE,ECE,EEEandMechanicalEngineering.
All the undergraduate (B.E)
MISSION
programs were accredited by
To arm the young brains with
National Board of Accreditation
competitive technology and nurture
(NBA) for the academic years
the holistic development of the
2013‐2015. The college sought
individuals for a better tomorrow.
fresh
approval
for
NBA
accreditation for two eligible PG
programs and MCA program. The college has been recognized under
12(B)and2(f)sectionsoftheUniversityGrantsCommission(UGC).
The college has been granted autonomy by the University Grants
Commission, New Delhi and Osmania University, Hyderabad for all the
programsitoffersforaperiodofsixyearswitheffectfrom2014‐15.
3
The College has 185 highly qualified and experienced faculty members
consisting of Professors, Associate Professors and Assistant Professors
andaround158technicalandsupportingstaff.Thecollegehasverygood
infrastructural facilities which go beyond the curriculum requirements.
The college offers value‐added courses in GIS, CAD/CAM, DSP, VLSI,
Networking, J2EE and communication skills to bridge the gap between
the curriculum and the requirements of the Industry. Finishing school
has been made part of curriculum from the second year onwards to
improvetheskillsofthestudents.
A Research & Development (R&D) Cell
QUALITY POLICY
is established by personnel from
Education without quality is
industry / research organization to
like a flower without
encourage the faculty and the students
fragrance. It is our earnest
in acquiring additional qualifications
resolve to strive towards high
andknowledge.
standards
of
teaching,
training
and
developing
This Cell also facilitates the faculty for
human resources.
interaction with industry/research
organizations in getting sponsored
researchprojects.Inaddition,thecollegeextendsconsultancyinvarious
fields of engineering and technology. The Center for Counseling and
PlacementatVasaviCollegeofEngineeringprovidespersonalandcareer‐
relatedsupporttoitsstudents.Theeducationalexperienceatthecollege
is enlivened and enriched by an array of extra‐curricular activities to
fulfilltheculturalandemotionalneedsofstudents.
A good number of ranks in university examinations are secured by our
studentseveryyear.Theall‐rounddevelopmentofastudentisachieved
by exposing him/her to the outside world in a systematic and well
plannedmanner.Justnotmarksandranks,butalsoethicsandmoralsare
incorporated into psyche of a student at Vasavi in a cautious way. This
unificationoftraditionandtechnologymakesVasaviaplaceforparadise
oflearning.
4
ACADEMICRULESANDREGULATIONS
FORFOURYEARB.EDEGREECOURSE
w.e.f2016‐17AcademicYear
1. RULESOFPROMOTION
ATTENDANCE:TheminimumaggregateattendancepercentageforBE
programis75%.Onmedicalgrounds65%attendancewithvalidmedical
certificatewillbeconsidered.Acandidatewhodidnotmeetabove
attendancerequirementsisnoteligibletoappearforthesemester
examinations.
Astudentisallowedtousemedicalcondonationfacilityonly4(four)
times in the entire period of 8 semesters in the span of 4 years B.E
program.
2. ASSESSMENTANDEVALUATIONSYSTEM:
There will be continuous and comprehensive evaluation of students. The
distribution of sessional (internal) and semester examination marks for
B.Eprogrammearegivenbelow:
SESSIONALSEXAMS(internals)
Theory:30Marks
 20Markseachfortwointernalexaminationsinasemesterand10marks
forassignmentsandquizzesetctogether.
 Averageoftwotestswillbeconsideredforcalculatinginternalexams
markstowhichassignment/quizmarkswillbeaddedforobtainingtotal
CIEmarks.
 Everystudentshouldsecureaminimumof40%aggregatemarksin
theinternalexams.
Lab:25Marks
15 marks for day‐to‐day laboratory class work which will be awarded
basedontheaverageofallexperiments.
• 10marksfortheinternalexamination.
5
SEMESTEREXAMS
 Semester theory examinations will be conducted for 70 marks. A
student should secure a minimum of 40% marks in each subject for a
pass.
Semester laboratory examinations will be conducted for 50 marks. A
studentshouldsecureaminimumof50%marksforapass.
Inaddition,astudentshallsecureaminimumof40%marksinatheory
subject and 50% marks in lab from sessional exams and semester
examinationsputtogetherforapass.

3. PROMOTIONRULESTONEXTHIGHERCLASS
SNo
1
Semester/Class
From1/4BE,I‐SEM
to1/4BE,II‐SEM
Conditionstobefulfilledfor
Regularcourseofstudyof1/4B.E,I‐SEMand
40%aggregatesessionalmarksinI‐SEM
2
From1/4BE,II‐SEM
to2/4BE,ISEM
3
From2/4BE,I‐SEM
to2/4BE,II‐SEM
From2/4BE,II‐SEM
to3/4BE,ISEM
(a)Regularcourseofstudyof1/4B.E‐IISEM
and
(b)Musthavesecuredatleast50%oftotal
creditsprescribedfor1/4B.E.
Regularcourseofstudyof2/4BE,I‐SEMand
40%aggregatesessionalmarksinII‐SEM
(a)Regularcourseofstudyof2/4BEIISEM
(b)Musthavesecuredatleast50%oftotal
creditsprescribedfor2/4B.Eandpassed
inallthesubjects1/4B.E.
Regularcourseofstudyof3/4B.E,I‐SEM,
and40%aggregatesessionalmarksinI‐SEM
4
5
From3/4BE,I‐SEM
to3/4BE,II‐SEM
6
From3/4BE,II‐SEM
to4/4BE,ISEM
7
From4/4BE,I‐SEM
to4/4BE,II‐SEM
(a)Regularcourseofstudyof3/4B.E,II‐SEM
(b)Musthavesecuredatleast50%oftotal
creditsprescribedfor3/4B.Eandpassed
inallthesubjects2/4B.E.
(a) Regularcourseofstudyof4/4B.E,I‐
SEMand40%aggregatesessionalmarks
inII‐SEM
6
VASAVICOLLEGEOFENGINEERING(AUTONOMOUS)
SCHEMEOFINSTRUCTIONANDEXAMINATIONw.e.f2016‐17
B.E.IIIYEAR‐I‐Semester
Schemeof
SchemeofExamination
Instruction
MaximumMarks
Periodsperweek
Subject
Durationin
SEM
Sessio
Hrs
L
T D P
Exam
nals
S
No
Code
1
2
3
4
5
6
7
8
9
IT3010
IT3020
IT3030
IT3040
IT3050
IT3060
IT3170
HS3110
HS3140
DataBaseManagementSystems
DigitalSignalProcessing
SoftwareEngineering
OperatingSystems
TheoryofAutomata
WebTechnologies
FinishingSchool:Technicalskills
FinishingSchoolIII:SoftSkills
HumanValuesandProfessionalEthics‐II
10
11
12
IT3071
IT3081
IT3095
DBMSLab
OperatingSystemsLab
MiniProject‐III
Total
3
3
3
3
3
3
2
2
2
Practicals
24
GrandTotal
7
1
2
1
1
1
1
7
40
3
3
3
9
Credits
DEPARTMENTOFINFORMATIONTECHNOLOGY
3
3
3
3
3
3
1½
1½
1½
70
70
70
70
70
70
35
35
35
30
30
30
30
30
30
15
15
15
3
4
3
3
3
3
1
1
1
3
3
‐
50
50
‐
625
25
25
25
300
2
2
1
27
27
925
WitheffectfromtheA.Y2016‐17
DEPARTMENTOFINFORMATIONTECHNOLOGY
SYLLABUSFOR3/4B.EI‐SEMESTER
DATABASEMANAGEMENTSYSTEMS
Instruction:3+1Periods/week
Credits:3
Sem.ExamMarks:70
SessionalMarks:30
SubjectRef.Code:IT3010
DurationofSem.Exam:3Hrs
CourseObjectives
CourseOutcomes
Thecoursewillenablethestudentsto:
Attheendofthecoursestudentwillbe
ableto:
1. Identify the purpose of different
databaselanguagesanddatamodels.
2. Explain the operations of relational
modelusingSQL.
3. Design the normalized data base using
differentnormalforms.
4. Illustratedifferentindexingandhashing
techniques.
5. Describe the concurrency control
,recoverytechniquesandNoSQL.
The objective of the course is to explain the
need of database for storing, accessing and
updating the data, eliminate the redundant
data, allow multiple users to be active at one
time and protect the data from unauthorized
access.
UNIT–I
Introduction: Overview, File System vs DBMS, Advantages of DBMS, Database
System Applications, Relational Databases, Object – Based and Semi‐structured
Databases, Data Storage and Querying, Database Architecture, Database Users and
jAdministrators.
Database Design and the E‐R Model: Overviewof the Design Process, The E‐R
Model,Constraints,E‐RDiagrams,E–RDesignIssues,WeakEntitySets,ExtendedE‐R
Features,ReductiontoRelationalSchemas,OtherAspectsofDatabaseDesign.
UNIT–II
Relational Model: Structure of Relational Databases, Fundamental Relational‐
AlgebraOperations,AdditionalRelational–AlgebraOperations,ExtendedRelational‐
AlgebraOperations,NullValues,ModificationoftheDatabases.
Structured Query Language: Data Definition, Basic Structure of SQL Queries, Set
Operations, Aggregate Functions, Null Values, Nested Sub queries, ComplexQueries,
Views,ModificationoftheDatabase,JoinedRelations.
UNIT–III
Advanced SQL and PLSQL: SQL Data Types and Schemas, Integrity Constraints,
Authorization, Embedded SQL, Dynamic SQL, ODBC and JDBC, Functions and
ProceduralConstructs,RecursiveQueries,Cursors,TriggersandActivedatabase.
Schema Refinement: Features of Good Relational Design, Functional‐Dependency
Theory,DecompositionUsingFunctionalDependencies,Normalization,First,Second,
Third Normal Forms, Dependency Preservation – Boyce/Codd Normal FormMulti‐
8
valuedDependenciesandFourthNormalForm–JoinDependenciesandFifthNormal
Form.
UNIT‐IV
IndexingandHashing:BasicConcepts,OrderedIndices,B+‐TreeIndexFiles,B‐Tree
Index Files, Multiple‐Key Access, Static Hashing, Dynamic Hashing, Comparison of
OrderedIndexingandHashing,BitmapIndices,IndexDefinitioninSQL.
Transactions:TransactionConcepts,TransactionState,ImplementationofAtomicity
andDurability,ConcurrentExecutions,Serializability,Recoverability,Implementation
ofIsolation,TestingforSerializability.
UNIT–V
Concurrency Control: Lock‐Based Protocols, Timestamp‐Based Protocols,
Validation‐Based Protocols, Multiple Granularity, Multiversion Schemes, Deadlock
Handling,InsertandDeleteOperations,WeakLevelsofConsistency,Concurrencyof
IndexStructures.
RecoverySystem:FailureClassification,StorageStructure,RecoveryandAtomicity,
Aries, Log‐Based Recovery, Recovery with Concurrent Transactions, Buffer
Management,FailurewithLossofNon‐volatileStorage.IntroductiontoNoSQL.
SuggestedReading:
1. AbrahamSilberschatz,HenryFKorth,S.Sudarshan,DatabaseSystemConcepts,
SixthEdition,McGrah‐HillInternationalEdition,2010.
2. Ramakrishnan, Gehrke, Database Management Systems, Third Edition, McGrah‐
HillInternationalEdition,2003.
3. ElmasriNavathe,Somayajulu,FundamentalsofDatabaseSystem,FourthEdition,
PearsonEducation,2006.
4. Patric O’Neil, Elizabeth O’Neil, Database‐‐principles, programming, and
performance,MorganKaufmannPublishers,2001.
5.GettingStartedwithNoSQL‐GauravVaish
9
WitheffectfromtheA.Y2016‐17
DEPARTMENTOFINFORMATIONTECHNOLOGY
SYLLABUSFOR3/4B.EI‐SEMESTER
DIGITALSIGNALPROCESSING
Instruction:3+2Periods/week
Credits:4
Sem.ExamMarks:70
SessionalMarks:30
SubjectRef.Code:IT3020
DurationofSem.Exam:3Hrs
CourseObjectives
CourseOutcomes
Thecoursewillenablethestudentsto:
Understand various concepts of digital
signal processing, design digital filters and
analyse
digital
signal
processor
architectures.
Attheendofthecoursestudentwillbeableto:
1. Analyze the discrete time signals and
systemsusingtheconceptsofZtransform
andFourierTransform.
2. Design and implement digital Finite
ImpulseResponse(FIR)filters.
3. Design and implement digital Infinite
ImpulseResponse(IIR)filters.
4. Analyze various architectural features of
DigitalSignalProcessors.
5. Understand digital signal processors
applications.
UNIT‐I
BasicElementsandadvantagesofDSP,Discretetimesignalsandsystems,Analysisof
discrete time LTI systems, Discrete time system described by difference equation.
ReviewofZ‐transforms,Frequencydomainsampling,PropertiesofDFT,Overlap‐save
method, overlap‐add method, Efficient computation of DFT: FFT Algorithm, Direct
computationofDFT,Radix‐2FFTAlgorithm,MATLABprogramforFFTCalculation.
UNIT‐II
DesignofFIRfilters,characteristicsofpracticalfrequencyselectivefilters,symmetric
andantisymmetricFIRfilters.DesignoflinearfaceFIRfiltersusingwindows.Design
ofoptimumequi‐ripplelinearfaceFIRfilters.Structurefortherealizationofdiscrete
timesystems:structureforFIRsystems,directformandcascadeformstructures.
UNIT‐III
Design of IIR filters from analog filters. IIR filter design by impulse invariance,
bilinear transformation. Butterworth filters, Chebyshev filters. Frequency
transformationinanaloganddigitaldomains.
StructuresforIIRsystems:directform,cascadeform,parallelform.Representationof
numbers,Roundoffeffectindigitalfilters.
10
UNIT‐IV
Architectures for Programmable DSP devices: Introduction, basic architectural
features, DSP computational Building Blocks (Multiplier, Shifter, MAC Unit & ALU).
BusArchitecture&Memory:On‐chipmemory,organizationofon‐chipmemory,Data
Addressing capabilities: Immediate addressing mode, register addressing mode,
direct addressing mode, indirect addressing mode and Special addressing modes.
Address generation Unit, Programmability & Program execution: Program Control,
Program Sequence. Speed issues: Hardware architecture, parallelism, pipelining.
Introduction to TMS320C54xx DSP processor, Bus structure, CPU, Data Addressing
modes,Memoryspace.
UNIT‐V
Applications of Programmable DSP devices, DSP based Bio‐telemetry receiver, A
speech Processing System and its implementation of TMS320C54xx processor, An
Image Processing System: JPEG Algorithm, Encoding & Decoding Using
TMS320C54xx.
SuggestedReading:
1. Proakis John G, Dimitris G. Manolakis, Digital Signal Processing, Third
Edition,PHI2005.(Units1,2&3).
2. Avtar Singh, S.Srinivasan, Digital Signal Processing Implementations Using
DSP Microprocessors with Examples from TMS320C54xx, THOMSON
BROOKS/COLE,2004.(Units4&5)
3. Jonathan (Y) Stein, Digital Signal Processing A Computer Science
Perspective,WILEY‐INDIA,2000.
4. Vinay K. Ingle, John G. Proakis, Digital Signal Processing using MATLAB,
THOMSONBROOKS/COLE,2004.
5. Phil Lapsley, Jeff Bier, Amit Shoham, Edward Lee, DSP Processor
Fundamentals:Architectures&Features,WILEY‐INDIA,1996.
11
WitheffectfromtheA.Y2016‐17
DEPARTMENTOFINFORMATIONTECHNOLOGY
SYLLABUSFOR3/4B.EI‐SEMESTER
SOFTWAREENGINEERING
Instruction:3+1Periods/week
Credits:3
Sem.ExamMarks:70
SessionalMarks:30
CourseObjectives
Thecoursewillenablethe
studentsto:
Understand the various SDLC
models and stages in SDLC
lifecycle.
SubjectRef.Code:IT3030
DurationofSem.Exam:3Hours
CourseOutcomes
Attheendofthecoursestudentwillbeableto:
1.
2.
3.
4.
5.
Selectthemostsuitablesoftwareprocessmodeloutof
several, for the development of a given software
project.
Develop the ability to elicit, analyze and specify
software requirements through a productive working
relationshipwithvariousstakeholdersoftheproject.
Learn the software design principles and understand
howtoapplythemtowardsimplementation.
Compare different ways and techniques of ensuring
software quality and apply various test processes and
techniquesonconventionalapplications.
Use various estimation methods to estimate the effort
requiredforagivenproject,developanunderstanding
ofrisksinherenttosoftwaredevelopment,andprovide
continuousqualityimprovement
UNITI
IntroductiontoSoftwareEngineering:SoftwareEngineering,ProcessFramework,
Process Patterns, Process Assessment, Personal and Team Process Models, Process
Technology,ProductandProcess.
ProcessModels:PrescriptiveModels,WaterfallModel,IncrementalProcessModels,
EvolutionaryProcessModels,SpecializedProcessModels,TheUnifiedProcess.
An Agile view of Process: What is Agility. What is an Agile Process, Agile Process
Models.
UNITII
Understanding requirements: Requirement Analysis, Data Modeling Concepts,
Scenario‐Based Modeling, Flow‐Oriented Modeling, Class‐Oriented Modeling,
CreatingaBehavioralModeling
Design Engineering: Design within the context of SE, Design Process, Design
Concepts,TheDesignModel.
12
UNITIII
Architectural Design: Software Architecture, Architecture Genres, Architecture
Styles,ArchitecturalDesign.
ComponentlevelDesign:WhatisaComponent,DesigningClass‐BasedComponents,
Conducting Component‐Level Design, Object Constraint Language, Designing
Traditional Components, and Component‐Based Development. Performing User
Interface Design : The Golden rules, User Interface Analysis and Design, Interface
DesignSteps,DesignEvaluation.
UNITIV
Software Testing Strategies: A Strategic Approach to Software Testing, Strategic
Issues,ValidationTesting,SystemTesting,TheArtofDebugging.
Testing Tactics: Software testing fundamentals, Black‐box and White‐box testing,
Basispathtesting,ControlStructuretesting.
SoftwareQualityAssurance(SQA):SoftwareConfigurationManagement,CMMI,ISO
9000 Quality Standards, Software Quality, Elements of Software Quality Assurance,
SQATasks,GoalsandMetrics,SQAPlan.
UNITV
Product Metrics: A Framework for Product Metrics, Metrics for the Requirements
Model,MetricsfortheDesignModel,MetricsforTesting,MetricsforMaintenance.
Estimation & Risk Management: Software Project Estimation, Decomposition
Techniques, Empirical Estimation Models, Specialized Estimation Techniques,
SoftwareRisks,ReactiveVsProactiveRiskStrategies,RiskMitigation,Monitoringand
management,theRMMMPlan.
SuggestedReading:
1. Roger S.Pressman, Software Engineering: A Practitioners Approach,
SeventhEdition,McGraHill,2009.
2. Pankaj Jalote “An Integrated Approach to Software Engineering, Third
Edition,
NarosaPublishinghouse,2008.
3. James F.Peters, Witold Pedrycz, Software Engineering‐An engineering
Approach,John
WileyInc.,2000.
4. AliBehforozandFredericJ.Hadson,SoftwareEngineeringFundamentals,
OxfordUniversityPress,1997.
13
WitheffectfromtheA.Y2016‐17
DEPARTMENTOFINFORMATIONTECHNOLOGY
SYLLABUSFOR3/4B.EI‐SEMESTER
OPERATINGSYSTEMS
Instruction:3+1Periods/week
Credits:3
Sem.ExamMarks:70
SessionalMarks:30
SubjectRef.Code:IT3040
DurationofSem.Exam:3Hrs
CourseObjectives
CourseOutcomes
Thecoursewillenablethestudentsto:
This course gives an introduction to
operating systems along with its major
functionalities such as process
management, memory management,
storage, I/O management , protection
andsecurity.
Attheendofthecoursestudentwillbeableto:
1. Gain knowledge about structure and
functionalities of operating systems along
withanintroductiontoprocessandthreads.
2. Compare different scheduling algorithms
with respect to their turnaround time,
responsetimeandwaitingtime.
3. Compute the number of page faults for
differentpagereplacementalgorithms.
4. Calculate the number of head movements
usingdifferentdiskschedulingalgorithms.
5. Understand the goals of protection, various
means of incorporating security along with
differentthreats.
UNIT‐I
Introduction: Operating System Functionalities, Computer Architecture support
to Operating Systems. System Structures: User Operating System Interface,
System calls. Operating System Generation, System Boot. Process Concept:
Overview,Inter‐ProcessCommunication,Threads.
UNIT‐II
ProcessManagement:ProcessScheduling‐Uniprocessorschedulingalgorithms,
Multiprocessor and Real‐time scheduling algorithms, Process Synchronization ‐
Peterson's Solution, Bakery Algorithm, Hardware Support to Process
Synchronization, Semaphores, Critical Section, Monitors. Deadlocks: Deadlock
prevention,DeadlockavoidanceandDeadlockDetectionandRecovery‐Bankers
Algorithm.
UNIT‐III
Memory Management: Background, Swapping, Contiguous Memory Allocation,
Paging,Segmentation.
VirtualMemoryManagement:Background,DemandPaging,Copy‐on‐Write,Page
replacementalgorithms,Analysisofpageallocationpolicies‐WorkingSetModel,
Thrashing,AllocatingKernelMemory.
14
UNIT‐IV
Storage and I/O Management: Introduction to File System, File System
Structure, File System Mounting, Directory Structure. Allocation Methods:
Contiguous, Sequential and Indexed Allocation, Free Space Management.I/O
Management:Disk Structure, RAID Structure, Disk Scheduling, I/O Hardware,
Application I/O Interface, Transforming I/O Request to Hardware Operations,
Streams.
UNIT‐V
Protection & Security: Goals of Protection, Principles of Protection, Domain of
Protection, Access Matrix, Capability Based Systems. Security Problem, Program
Threats, System and System Network Threats, Cryptography as a security tool,
User Authentication, Implementing Security Defences, Firewalling to Protect
SystemsandNetworks.
SuggestedReading:
1. Operating System Concepts ‐ Operating System Concepts, Sixth Edition,
AbrahamSilberschatz,PeterBaerGalvin,GregGagne,JohnWiley&SonsInc.
References:
1. ModernOperatingSystems‐AndrewSTanenbaum,PrenticeHall
2. OperatingSystems‐OperatingSystem:InternalsandDesignPrinciples(4th
edition),WilliamStallings
3. OperatingSystems‐SystemProgrammingandOperatingSystmesDM
Dhamdhere,tataMcGrawHill
4. OperatingSystems‐OperatingSystems:AModernPerspective,2/E,Gary
Nutt,AddisonWesley
5. OperatingSystems‐OperatingSystems,AchyutSGodbole,TataMcGrawHill
6. DesignoftheUnixOperatingSystem‐MauriceBach,PrenticeHall.
15
WitheffectfromtheA.Y2016‐17
DEPARTMENTOFINFORMATIONTECHNOLOGY
SYLLABUSFOR3/4B.EI‐SEMESTER
THEORYOFAUTOMATA
Instruction:3+1Periods/week
Credits:3
Sem.ExamMarks:70
SessionalMarks:30
SubjectRef.Code:IT3050
DurationofSem.Exam:3Hrs
CourseObjective:
CourseOutcomes:
Thecoursewillenablethestudentsto:
Introduce central concepts in theory of
computation and to design grammars
and recognizers for different formal
languages, and also to determine the
decidability and intractability of
computationalproblems.
Attheendofthecoursestudentwillbeableto:
1. Define basic concepts in formal language
theory, automata theory, and able to design
finiteautomata,RE’sforagivenlanguage.
2. DefinepropertiesofRL’s,Designgrammars,
minimize FA and also apply the concept of
pumping lemma to prove that certain
languagesarenotregular.
3. Design PDA’s for various CFG’s and CFL’s,
simplify the CFG’s, define properties of
CFL’s.
4. Define programming techniques of Turing
machines and design Turing machines for
decidableproblems
5. Apply mathematical and formal techniques
for solving problems in computer science
and also define concepts of computability
theory,andcomplexitytheory.
UNITI
Finite Automata: Introduction to Finite Automata, Central Concepts of Automata
Theory, Deterministic Finite Automata, Nondeterministic Finite Automata, NFA to
DFAConversion,FiniteAutomatawithEpsilonTransitions,EquivalencebetweenNFA
withandwithoutEpsilonTransitions.
Regular Expressions: Regular Expressions, Identity Rules for Regular Expressions,
Algebraic Laws for Regular Expressions, Equivalence between Finite Automata and
RegularExpressions,ApplicationsofFiniteAutomataandRegularExpressions.
UNITII
PropertiesofRegularLanguages:PumpingLemmaforRegularLanguages,Closure
Properties of Regular Languages, Decision Properties of Regular Languages,
EquivalencebetweentwoFSM’s,MinimizationofFiniteAutomata.
Context Free Grammars and Languages: Chomsky Hierarchy of Languages,
Grammars and Languages Generated, Context‐Free Grammars, Derivations, Parse
Trees,AmbiguityinGrammarsandLanguages.
16
UNITIII
Pushdown Automata: Introduction, Formal Definition and Behavior of PDA,
Language of PDA, Design of PDA, Equivalence of PDA’s and CFG’s, Introduction to
DCFLandDPDA.
Properties of Context Free Languages: Simplification of CFG’s, Normal Forms for
Context‐FreeGrammars:CNFandGNF,PumpingLemmaforContextFreeLanguages,
Closure Properties of Context Free Languages, Decision Properties of Context Free
Languages.
UNITIV
Turing Machines: Introduction, Formal Definition and Behavior of TM,TM as
AcceptorandI/Odevice,LanguageofaTM,DesignofTM’s,ProgrammingTechniques
forTuringMachines,ExtensionstotheTuringMachines,RestrictedTuringMachines.
UNITV
Undecidability: Recursive and Recursively Enumerable Languages, Properties of
Recursive and Recursively Enumerable Languages, The Church‐Turing Thesis, A
Language that is not Recursively Enumerable, An Undecidable Problem that is RE,
UndecidableProblemsaboutTuringMachines,PCPandMPCP.
IntractableProblems:TheclassesPandNP,AnNPcompleteProblem,ARestricted
SatisfiabilityProblem.
SuggestedReading:
1. JohnE.Hopcroft,RajeevMotwani,JefferyDUlman,IntroductiontoAutomata
TheoryLanguagesAndComputation,Thirdedition,PearsonEducation.
2. TheoryofComputerScience‐Automatalanguagesandcomputation–Mishra
andChandrashekaran,Thirdedition,PHI
3. K.Krithivasan and R.Rama; Introduction to Formal Languages, Automata
TheoryandComputation;PearsonEducation,2009.
4. JohnC.Martin,IntroductiontoLanguagesandTheTheoryofcomputation,
Thirdedition,TataMcGrawHill,2003.
5. CohenDanielI.E,IntroductiontoComputerTheory,Secondedition,2007.
6. Bemard Moret, The Theory of computation, Pearson Education, 2002.
17
WitheffectfromtheA.Y2016‐17
DEPARTMENTOFINFORMATIONTECHNOLOGY
SYLLABUSFOR3/4B.EI‐SEMESTER
WEBTECHNOLOGIES
Instruction:3+1Periods/week
Credits:3
Sem.ExamMarks:70
SessionalMarks:30
SubjectRef.Code:IT3060
DurationofSem.Exam:3Hrs
CourseObjectives
CourseOutcomes
Thecoursewillenablethestudentsto:
Attheendofthecoursestudentwillbeableto:
Understandthewaysofdevelopingweb 1. Design webpages using HTML, CSS and
sitesusingdifferenttechnologies.
JavaScript.
2. Understand zurb foundation, Backbone.js
andexpress.js.
3. Develop the programs using Python
programming.
4. Develop the server side applications using
ServletsandJSP.
5. Understand the concepts in PHP, access the
databasethroughweb.
UNIT‐I:
Introduction to Internet, World Wide Web, Web Browsers, Web Servers, Uniform
ResourceLocators,HTTP,IntroductiontoXHTML:OriginsandEvolutionofHTMLand
XHTML,StandardXHTMLdocumentstructure,BasicTextMarkup,Images,Hypertext
Links, Lists, Tables, Frames. Cascading Style Sheets: Text Styles, Types of Style
Classes, Block Styles, page layout with CSS. Basics of JavaScript: HTML forms ‐
Overview of Java Script‐Primitives, Operations and Expressions‐Control Statements,
Arrays,Functions,DOM,ElementaccessinJavaScript,Eventsandeventhandling.
UNIT‐II:
TwitterBootstrap:TheGridSystem,Layoutcomponents,ZurbFoundation:TheGrid,
Global styles, basic controls, Backbone.js: Models, Views, Collections, express.js,
ApplicationDevelopment.
UNIT‐III:
Python: Basics of python, Variables and types, Lists, Operators, Strings formatting,
String operations, conditions, loops, functions, objects and classes, dictionaries,
modulesandpackages.
Advanced python: generators, list comprehensions, multiple function arguments,
regular expressions, exception handling, sets, serialization using JSON and pickle,
partial functions, code introspection, compression, encoding and decoding
,decorators,frameworks.
UNIT‐IV:
JavaServlets:JavaServletsandCGIProgramming,BenefitsofJavaServlet,Lifecycle
of Java Servlet, Reading data from client, HTTP Request header, HTTP Response
header, working with cookies, Tracking Sessions. Java Server Pages: Introduction to
18
JSP, JSP Tags, Variables and Objects, Methods, Control Statements, Loops, Request
String,UserSessions,SessionObject,Cookies.
UNIT‐V:
IntroductiontoPHP:OverviewofPHP,GeneralSyntacticCharacteristics,Primitives,
Operations, Expressions, Control Statements, Arrays, Functions, Pattern matching,
Form handling, Files, Cookies, Session Tracking. Database access Through Web:
ArchitecturesforDatabaseAccess‐DatabaseaccesswithPerl‐Databaseaccesswith
PHP‐DatabaseaccesswithPDO.
SuggestedReading:
1. RobertW.Sebesta,Programmingtheworldwideweb,FourthEdition,
PearsonEducation,2008.
2. LearningZurbFoundationbyKevinHorek,2014
3. LearningPython,5thEdition,O’reilly
4. JimKeogh,TheCompleteReferenceJ2EE,Tata‐McGraw‐Hill,2002.
19
WitheffectfromtheA.Y2016‐17
DEPARTMENTOFINFORMATIONTECHNOLOGY
SYLLABUSFOR3/4B.EI‐SEMESTER
FINISHINFSCHOOL‐III:TECHNICALSKILLS(C,C++,JAVA,DS)
Instruction:2Periods/week
Credits:1
Sem.ExamMarks:35
SessionalMarks:15
SubjectRef.Code:IT3170
DurationofSem.Exam:1.5Hrs
CourseObjectives
CourseOutcomes
Thecoursewillenablethestudentsto:
Attheendofthecoursestudentwillbeableto:
The objective of the course is to Possess
necessaryskillstoimplementsolutionin
C and Object Oriented Concepts for a
given problem and efficient storage
mechanisms for an easy access and
design and implement various data
structuresandimprovelogicalability.
1.
2.
3.
4.
5.
To select appropriate concept in C
programming
language
to
develop
programs(knowledge&analysis)
Demonstrate the principles of the object
orientedprogramming.
Create packages. Handle errors using
ExceptionHandling,andcreatethreadsusing
MultithreadedProgrammingconcepts.
Applytheconceptsofclassespresentin
lang,IOpackage.
Demonstrate the applications of Data
Structures.
UNIT–I
Review of C Programming Language: Identifiers, Types, Variables, Evaluating
Expressions, Type Conversion, Statements, Selection, Repetition, Functions, Arrays,
Pointers:,Strings,Structure.
UNIT‐II
Introduction to C++: Programming paradigms, Object oriented programming
concepts, Advantages and Applications of OOPs. Functions, Inheritance, Exception
handling. Object Oriented System Development: Understanding Object Oriented
Development, Understanding Object Concepts, Benefits of Object Oriented
Development.JavaProgrammingFundamentals:Introduction,OverviewofJava,Data
types, Variables and Arrays, Operators, Control statements, Classes, Methods,
Inheritance
UNIT‐III
PackagesandInterfaces,ExceptionHandling,MultithreadedProgramming,
I/O basics, Reading console input and output, Reading and Writing Files, String
Handling.
UNIT‐IV
ExploringJavaLanguage,Util,I/O,Awt,Applets,Swings
20
UNIT–V
ReviewofDataStructures:StacksandQueues,LinkedLists,Trees,Graphs
SuggestedReading:
1. TestyourCSkillsYashavantP.Kanetkar
2. YashwantKanetkartestyourc++skills
3. YashwantKanetkartestyourjavaskills
4. HerbertSchildt,TheCompleteReferenceJava,7thEd,TataMcGrawHill,2006.
5. DatastructurethroughC++yashwantkanetkar
6. EffectiveC++andMoreEffectiveC++byScottMeyers
WitheffectfromtheA.Y2016‐17
DEPARTMENTOFINFORMATIONTECHNOLOGY
SYLLABUSFOR3/4B.EI‐SEMESTER
FINISHINFSCHOOL‐III:SOFTSKILLS
Instruction:2Periods/week
Credits:1
Sem.ExamMarks:35
SessionalMarks:15
SubjectRef.Code:HS3110
DurationofSem.Exam:1.5Hrs.
CourseObjective:
CourseOutcomes
This is a foundation course and aims at enhancing
employability skills in students. Students will be
introduced to higher order thinking skills and
problemsolvingonthefollowingareas‐Arithmetic
ability, Numerical ability and General reasoning.
Studentswillbetrainedtoworksystematicallywith
speedandaccuracywhileproblemsolving.
Thethreemajorareascoveredinthiscourseinclude
1. NumericalAbility
2. ArithmeticAbility
3. Generalreasoning
Attheendofthecoursestudents
willbeableto:

Solve questions on the above
mentioned areas using short
cutsandsmartmethods

Understand the fundamentals
conceptsofAptitudeskills

Perform calculations with
speedandaccuracy
UNIT–I:QUANTITATIVEAPTITUDE‐NUMERICALABILITY

NumericalAbility

Introductiontohigherorderthinkingskills

SpeedMaths

Numbersystems

LCM&HCF
UNIT–II:QUANTITATIVEAPTITUDE‐ARITHMETICABILITYFOUNDATION
 ArithmeticAbility
 Percentage
 Profitlossanddiscounts
 RatioproportionsAllegationsandmixtures
 Averages
UNIT–III:QUANTITATIVEAPTITUDE‐ARITHMETICABILITYADVANCED

ArithmeticAbility
21



Timespeedanddistance
Timeandwork
Interestcalculations
UNIT–IV:REASONINGABILITY–GENERALREASONINGPART1

GeneralReasoning

Codingdecoding

Directions

Seriescompletions
UNIT–V:REASONINGABILITY‐GENERALREASONINGPART2

GeneralReasoning

Analogies

Classification

Alphabettest

Mathematicaloperations
WitheffectfromtheA.Y2016‐17
DEPARTMENTOFINFORMATIONTECHNOLOGY
SYLLABUSFORB.E.3/4FIRSTSEMESTER
HUMANVALUESANDPROFESSIONALETHICS‐II
Instruction:2Periods/week
Credits:1
SemExamMarks‐70
SessionalMarks‐30
SubjectReferenceCode:HS3140
DurationofSemExam:3Hours





COURSEOBJECTIVES
Studentsshouldbeableto
Getaholisticperspectiveofvalue‐based
education.
Graspthemeaningofbasichumanaspirations
vis‐a‐vistheprofessionalaspirations.
Understandprofessionalisminharmonywith
selfandsociety.
Developethicalhumanconductand
professionalcompetence.
Enrichtheirinteractionswiththeworld
around,bothprofessionalandpersonal.




COURSEOUTCOMES
Studentswillbeableto
Gainaworldviewoftheself,the
societyandtheprofession.
Makeinformeddecisions.
Startexploringthemselvesinrelation
toothersandtheirwork–constantly
evolvingintobetterhumanbeingsand
professionals
InculcateHumanvaluesintotheir
profession.
1. Distinctionbetweenneedandgreed:Exercisingthewisdomtodistinguishneed
fromgreed
2. Rights and Responsibilities‐Educating an individual about rights and
responsibilities –Safeguards‐Stimulants‐Social Justice‐The three catalysts for
decidingrightsandresponsibilities.
22
3. Imbibing and inculcating Civic Sense and Civic‐Virtues, The true meaning of
Integrity ‐Honesty, Humility, Openness, Transparency, Dedication, Reliability,
Confidentiality, accountability, Collegiality, Sympathy, Trustworthiness, Co‐
operation,Courage.
a. ThemoraldilemmaoftheModernworld,RespectforSelf,OthersandWork.
b. Respectforwomenatalltimesespeciallyattheworkplace.
4. Ideal self‐Real self‐ How to define the ideal‐idealism at various levels‐ is it
possibletoreachidealism–Manasapilgrimonajourneytoidealism
5. Managing Failure‐Identifying causes for failure and learning lessons‐Using
failuretoscoresuccess‐Roleofself‐confidenceandpersonalethicsincopingwith
failure.
 Anger/Depression
 Cruelty
 Fear
 Jealousy
 Agitation
 Desire
 Failure
 Cheating
 Lethargy
 Pride
 Dishonesty
 Greed
 Lying
6. Stress Management‐ Identifying sources and levels of stress –Tackling
stress and its associated negativity‐Positive aspect of coping with stress‐
Sometechniquestomanagestress.
7.DevelopingEmotionalIntelligence
Self‐Awareness HandlingEmotions
Motivation
Empathy
Socialskills

Validatetheiraspirationsthroughrightunderstandingofhuman
relationshipandseetheco‐relationbetweenthehumanvaluesand
prevailingproblems.

Strikeabalancebetweenphysical,mental,emotionalandspiritualparts
theirbeing.

Obtainaholisticvisionaboutvalue‐basededucationandprofessionalethics.
LearningResources
1. B.L Bajpai, 2004, Indian Ethos and Modern Management, New Royal Book
Co.,Lucknow.Reprinted2008.
2. A.NTripathy,2003Humanvalues,NewAgeInternationalPublishers.
3. EG Seebauer & Robert L. Berry,2000,Fundamentals of Ethics for Scientists
andEngineers,OxfordUniversityPress.
4. MikeMartinandRonaldSchinzinger"EthicsinEngineering"McGrawHill
5. CharlesEHaris,MichealJRabins,"EngineeringEthics"CengageLearning
6. CarolinewhitbackEthicsinEngineeringPracticeandResearch,Cambridge
UniversityPress
7. GeorgsReynolds,EthicsinInformationTechnology",CengageLearning
8. CharlesD.Fleddermann,"EngineeringEthics",PearsonEducation/Prentice
Hall,NewJersey,2004(IndianReprint)
23
WitheffectfromtheA.Y2016‐17
DEPARTMENTOFINFORMATIONTECHNOLOGY
SYLLABUSFOR3/4B.EI‐SEMESTER
DBMSLAB
Instruction:3Periods/week
Credits:2
Sem.ExamMarks:50
SessionalMarks:25
SubjectRef.Code:IT3071
DurationofSem.Exam:3Hrs
CourseObjective:
Course Outcomes:
Thecoursewillenablestudentsto:
The object of the course is to create database
to educate students with fundamental
concepts of Data Base Design, Data Models,
DifferentDatabaseLanguages(SQL/Oracle)
Attheendofthecoursestudentwillbeable
to:
1. Write and execute simple, complex
queriesusingSQLandPLSQL.
2. Create
triggers
and
stored
procedures.
3. Create forms, reports and security
features.
1.
SQL







2.
3.
CreatingDatabase(ExercisingCommandslikeDDL,DML,DCL)
ExercisingalltypesofJoins.
Creatingtablesin1stNormalForm,2ndNormalForm,3rdNormal
FormandBCNF
CreatingTablesusingcombinationofconstraints.
ExercisingSimpletoComplexQueries.
Usageofstoredfunctions.
UsageofTablelockingfacilitiesinapplications.
PL/SQL

DemonstrationofBlocks,Cursors,Procedures.

DemonstratingExceptionHandling.

Usage of Triggers to perform operation on single and multiple
tables.

PL/SQLproceduresfordatavalidation.
FORMS

Creation of forms for college information system, library
informationsystemandRecruitmentcell
24
4.
REPORTS

Creationofreportsbasedondifferentqueries.

Creationofsmallfullpledgeddatabaseapplicationspreadingover
to3sessions.
SuggestedReading:
1. NileshShah,DatabaseSystemUsingOracle,PHI,2007.
2. Rick F Vander Lans, Introduction to SQL, Fourth edition, Pearson
Education,2007.
3. Benjamin Rosenzweig, Elena Silvestrova, Oracle PL/SQL by Example, Third
edition,PearsonEducation,2004.
4. AlbertLulushi,OracleFormsDeveloper’sHandbook,PearsonEducation,2006.
WitheffectfromtheA.Y2016‐17
DEPARTMENTOFINFORMATIONTECHNOLOGY
SYLLABUSFOR3/4B.EI‐SEMESTER
OPERATINGSYSTEMSLAB
Instruction:3Periods/week
Credits:2
Sem.ExamMarks:50
SessionalMarks:25
SubjectRef.Code:IT3081
DurationofSem.Exam:3Hrs
CourseObjective:
CourseOutcomes:
Thecoursewillenablestudentsto:
The objective of this course is to gain
practical experience with designing and
implementing concepts of operating
systems such as system calls, CPU
scheduling,processmanagement,memory
management, file systems and deadlock
handling using C language in Linux
environment.
Attheendofthecoursestudentwillbeableto:
1. Understand and implement basic
services and functionalities of the
operating system using system calls,
Usingmodernoperatingsystemcalls.
2. Understand the benefits of Process
Synchronization
and
deadlock
management.
3. Analyze and simulate CPU Scheduling
Algorithms & Memory Management
Schemes.
1.
2.
3.
4.
WriteprogramsusingthefollowingsystemcallsofUNIXoperatingsystem:fork,
exec,getpid,exit,wait,close,stat,opendir,readdir
Write programs using the I/O system calls of UNIX operating system (open,
read,write,etc)
WriteCprogramstosimulateUNIXcommandslikels,grep,etc.
Giventhelistofprocesses,theirCPUbursttimesandarrivaltimes,display/print
the Gantt chart for FCFS and SJF. For each of the scheduling policies, compute
andprinttheaveragewaitingtimeandaverageturnaroundtime.
25
5.
6.
7.
8.
9.
10.
11.
12.
Giventhelistofprocesses,theirCPUbursttimesandarrivaltimes,display/print
theGanttchartforPriorityandRoundrobin.Foreachoftheschedulingpolicies,
computeandprinttheaveragewaitingtimeandaverageturnaroundtime.
Write a C program to simulate Bankers algorithm for the purpose of deadlock
avoidance.
Developing Application using Inter Process communication (using shared
memory,pipesormessagequeues)
ImplementProcessSynchronizationproblemsusingMonitorsandSemaphores.
ImplementtheProducer–Consumerproblemusingsemaphores(Threads).
ImplementsomeMemorymanagementschemeslikePagingandSegmentation.
Implementanyfileallocationtechniques(Contiguous,LinkedorIndexed)
Write a C program to simulate the following contiguous memory allocation
techniquesa)Worst‐fitb)Best‐fitc)First‐fit.
SuggestedReading:
1. W.RichardStevens,UnixNetworkProgramming,PrenticeHall/Pearson
Education,2009.
26
WitheffectfromtheA.Y2016‐17
DEPARTMENTOFINFORMATIONTECHNOLOGY
SYLLABUSFOR3/4B.EI‐SEMESTER
MINIPROJECT‐III
Instruction:3Periods/week
Credits:1
SessionalMarks:25
SubjectRef.Code:IT3095
CourseObjective:
Thecoursewillenablestudentsto:
Develop and implement a project using any
of the programming languages/simulation
tools/electroniccomponents.
CourseOutcomes:
Attheendofthecoursestudentwillbeable
to:
1. Develop solutions to various computing
problems by applying the theoretical
knowledgegained.
2. Implement projects and demonstrate
them using presentations and technical
reports




The students are required to implement a project (hardware / software
related) from project exercises given in the suggested readings and
referencebooksofthetheorysubjects.
During the implementation of the projects, Personnel Software Process
(PSP)hastobefollowed.
Review(s)willbeconducted.
Reportoftheprojectworkhastobesubmittedforevaluation.
27
VASAVICOLLEGEOFENGINEERING(AUTONOMOUS)
DEPARTMENTOFINFORMATIONTECHNOLOGY
SCHEMEOFINSTRUCTIONANDEXAMINATIONW.E.F2016‐17
B.E.IIIYEAR‐II‐Semester
Code
Subject
L
1
2
3
4
5
6
7
HS3010
IT3100
IT3110
IT3120
IT3130
IT3180
HS3210
ManagerialEconomics&Accountancy
CompilerConstruction
ComputerNetworks
DataWarehousing&DataMining
ObjectOrientedSystemDevelopment
FinishingSchool– IV: Technicalskills
FinishingSchool– IV:SoftSkills‐II
8
9
10
IT3141
IT3151
IT3165
NetworkProgramming
OOSD&CCLab
MiniProject‐IV
4
3
3
3
3
2
2
Practicals
2
0
Total
GrandTotal
28
T
D
34
Duration
inHrs
MaximumMarks
3
3
3
3
3
1½
1½
Sem
Exam
70
70
70
70
70
35
35
Sessi‐
onals
30
30
30
30
30
15
15
3
3
3
3
3
‐
50
50
‐
25
25
25
9
520
255
P
1
1
2
1
5
SchemeofExamination
775
Credits
S
No
Schemeof
Instruction
Periodsper
week
3
3
3
4
3
1
1
2
1
2
23
WitheffectfromtheA.Y2016‐17
DEPARTMENTOFINFORMATIONTECHNOLOGY
SYLLABUSFOR3/4B.EII‐SEMESTER
MANAGERIALECONOMICS&ACCOUNTANCY
Instruction:4Periods/week
Credits:3
Sem.ExamMarks:70
SessionalMarks:30
SubjectRef.Code:HS3010
DurationofSem.Exam:3Hrs
CourseObjectives
CourseOutcomes
TheCoursewillenablethelearnersto:
Attheendofthecoursethelearnersshouldbe
ableto:
1. Make decisions in solving the economic
problemsoftheorganization
2. Makebettersaleoftheproductwithcustomer
centeredproductsandservices
3. Make economical production by identifying
theoptimumcombinationofinputsandprice
themappropriatelyforbetterprofits
4. Understand the process of making long term
investmentdecisionsinvolvinghugeoutlay
5. Analyse the past performance of the
companyandmakedecisionsforfuture
6. Competenttosetupownenterprise.
1. Create an awareness about the
significance of economics in day to
day life and its impact of policies of
organizations’.
2. Helps in engineering the products
accordingtothesocietalneeds
3. Helps in leaning the investment
decisionmaking
4. Understand the economical ways of
production and pricing the products
basedonthemarketstructures
5. Analyse the performance of
companies
UNIT‐I
Meaning andNature of Managerial Economics: Branchesofeconomics– micro
and macro, Managerial Economics – nature, scope, importance, relation with other
sciences and its usefulness to Engineers, Fundamental Concepts of Managerial
Economics‐Scarcity,Marginalism,Equi‐marginalism,opportunitycosts,Discounting,
TimePerspective,RiskandUncertainty,Profits,Casestudymethod.
UNIT‐II
Consumer Behaviour: Demand – concept, Determinants, Law of demand,
relationship between total revenue, marginal revenue and demand, Elasticity of
Demand (Price, Income Cross‐Elasticity and advertising elasticity); Demand
forecasting, Law of Supply, concept of Equilibrium. (Theory questions and small
numericalproblemsonmeasurementofarcandpointelasticitycanbeasked).
UNIT‐III
Theory of Production and Markets: Production Function, Law of Variable
Proportion,Isoquants,EconomiesofScale,Costanalysis‐costconcepts,Cost‐Output
relationship,
Optimization of employment of inputs, Break‐Even Analysis, market structures –
types,Price‐OutputdeterminationunderPerfectCompetitionandMonopoly(theory
andproblemscanbeaskedonbreakevenpoint).
29
UNIT‐IV
Capital Management: Significance, Introduction to capital budgeting, traditional
methods and discounted cash flow methods, determination and estimation of
working capital requirements, sources of capital, (Theory questions and numerical
problems on estimating working capital requirements and evaluation of capital
budgetingopportunitiescanbeasked).
UNIT‐V
Book‐Keeping: Principles of Double entry system of Book keeping, Journal, Three
columncashbookandpettycashbook,Bankreconciliationstatement,TrialBalance,
PreparationofFinalAccountswithsimpleadjustments,Analysisandinterpretationof
FinancialStatementsthroughRatios(liquidity,solvencyandprofitabilityratios).
(theory questions and numerical problems on preparation of final accounts, cash
book,pettycashbook,bankreconciliationstatement,calculationofsomeratiosand
analysis).
LEARNINGRESOURCES:
TextBooks:
1. MehtaP.L.,“ManagerialEconomics–Analysis,ProblemsandCases”,Sulthan
Chand&Son’sEducationalpublishers,2011.
2. MaheswariS.N.“IntroductiontoAccountancy”,VikasPublishingHouse,
2005.
3. FinancialManagementbyKhan&Jain.Mc.GrawHillEducation
4. W.Chrislewis&CraigHPetersen“Managerialeconomics”.
5. ModernAccountingbyA.Mukherjee&M.Hanif
ReferenceBooks:
1. MicroEconomicsbyM.L.Seth.
2. FinancialAccountingbyJain&Narang.
3. PandayI.M.“FinancialManagement”VikasPublishingHouse,2009.
30
WitheffectfromtheA.Y2016‐17
DEPARTMENTOFINFORMATIONTECHNOLOGY
SYLLABUSFOR3/4B.EII‐SEMESTER
COMPILERCONSTRUCTION
Instruction:3+1Periods/week
Credits:3
Sem.ExamMarks:70
SessionalMarks:30
SubjectRef.Code:IT3100
DurationofSem.Exam:3Hrs
CourseObjective:
CourseOutcomes:
Thecoursewillenablethestudentsto:
Introduce the major concept areas of
language translation, and to enrich the
knowledge in various phases of compiler
anditsuse.
Attheendofthecoursestudentwillbeableto:
1.
Define the purpose and implementation
approach of each phase, in particular, the
lexical analysis, syntax, and semantic
analysis, code generation and optimization
phases of compilation, and also apply the
knowledge of LEX tool to develop a
Scanner.
2.
Identify the similarities and differences
among various parsing techniques and
grammar transformation techniques, and
implement various techniques to parse
sourcecode,andalsoapplytheknowledge
ofYACCtooltodevelopaParser.
3.
Implement semantic rules and use formal
attributed grammars for specifying the
syntax and semantics of programming
languages, and also transform an AST to
intermediaterepresentation.
4.
Apply various optimization techniques on
theIntermediateRepresentation.
5.
Generate target code from Intermediate
Representation.
UNIT‐I
Introduction to Compilers: Introduction, Language Processors, The Structure of a
Compiler‐ Analysis and Synthesis Phases, Lexical Analysis – The Role of Lexical
Analyzer, Input Buffering, Specification of Tokens using Regular Expressions,
RecognitionofTokensusingFiniteAutomaton,TheLexical‐AnalyzerGenerator‐LEX.
UNIT‐II
Syntax Analysis: Introduction, Context‐Free Grammars, Top‐Down Parsing:
RecursiveDescentParsing,PredictiveParsing,LL(1)Grammars,Bottom‐UpParsing:
Shift‐ReduceParsing,OperatorPrecedenceParsing,IntroductiontoLRParsing‐SLR,
MorePowerful LRParsers‐ CLRandLALR,UsingAmbiguousGrammars,TheParser
Generator‐YACC.
31
UNIT‐III
Syntax Directed Translation: Introduction, Syntax Directed Definitions, Evaluation
OrdersforSDD’s,ApplicationsofSyntaxDirectedTranslation.
Intermediate Code Generation: Variants of Syntax Trees, Three‐Address Code,
TypesandDeclarations,TranslationofExpressions,TypeChecking.
UNIT‐IV
Run‐TimeEnvironments:StorageOrganization,StackAllocationofSpace,Accessto
Non‐localDataontheStack,HeapManagement,IntroductiontoGarbageCollection.
Code Optimization: Introduction, Basic Blocks and Flow Graphs, Optimization of
Basic Blocks, Machine Independent Optimizations – The Principal Sources of
Optimizations,DAGRepresentationofBasicBlocks.
UNIT‐V
CodeGeneration:Introduction,IssuesintheDesignofaCodeGenerator,TheTarget
Machine, A Simple Code Generator, Peephole Optimization, Register Allocation and
Assignment,DAGforRegisterAllocation.
SuggestedReading:
1) Alfred V Aho, Monica S Lam, Ravi Sethi, Jeffrey D Ullman – Compilers:
Principles,Techniques&Tools–PearsonEducation,SecondEdition,2007
2) Leland L Bech, System Software: An Introduction to Systems Programming,
PearsonEducationAsia,1997.
3) Kenneth C. Louden, Compiler Construction: Principles and Practice,
ThompsonLearning,2003.
4) J.P. Bennet, Introduction to Compiler Techniques, Second Edition, Tata
McGraw‐Hill,2003.
5) Keith D Cooper and Linda Torczon, “Engineering a Compiler”, Morgan
KaufmannPublishersElsevierScience,2004.
32
WitheffectfromtheA.Y2016‐17
DEPARTMENTOFINFORMATIONTECHNOLOGY
SYLLABUSFOR3/4B.EII‐SEMESTER
COMPUTERNETWORKS
Instruction:3+1Periods/week
Credits:3
Sem.ExamMarks:70
SessionalMarks:30
SubjectRef.Code:IT3110
DurationofSem.Exam:3Hrs
CourseObjectives
CourseOutcomes
Thecoursewillenablethestudentsto:
Understand the fundamental concepts of
computer
networks
and
Socket
programming, know the role of various
layers and protocols for computer
networks and introduce internet services
andsecuritypolicies.
Attheendofthecoursestudentwillbeableto:
1. Identify the different types of network
topologies and protocols, networking
devices, reference models and network
programmingconcepts.
2. Understand the routing algorithm,
congestioncontrolalgorithmandtransport
layerconcepts.
3. Understandthenetworklayerprotocolsin
internet.
4. Develop solutions for Application layer
concepts
5. Understand the cryptographic methods
andalgorithms.
UNIT‐I
Introduction: Uses of Computer Networks, Network Hardware, Network Software:
ReferenceModels(ISO‐OSI,TCP/IP).
Network Programming: Socket Interface: Sockets, Socket Address, Elementary
Sockets, Advanced Sockets, Socket Options, Out of Band Data, Daemon process and
InternetSuperServer.
RemoteProcedureCalls:Introduction,TransparencyIssuesandSunRPC.
UNIT‐II
Network Layer: Network Layer Design Issues, Routing Algorithms, Congestion
ControlAlgorithms,QualityofService.
Internetworking: Concatenated virtual circuits, Connectionless Internetworking,
Tunneling,Internetworkrouting,Fragmentation.
UNIT‐III
NetworklayerintheInternet:InternetProtocol,IPv4,IPv6,InteroperabilityofIPv4
andIPv6,IPaddresses,InternetControlprotocols,OSPF,BGP,InternetMulticasting,
MobileIP.
Transport Layer: The Transport Service, Elements of Transport Protocols, The
InternetTransportProtocols:UDP,InternetTransportProtocols‐TCP.
33
UNIT‐IV
Application Layer: Domain Name System: DNS Name Space, Resource Records,
NameServers.
Electronic Mail: Architecture and Services, User Agent, Message Formats, Message
transferandFinalDelivery.
World Wide Web: Architectural Overview, Static Web Documents, Dynamic Web
Documents,HTTP,WirelessWeb.
Multimedia:DigitalAudio,StreamingAudio,VoiceoverIP,VideoonDemand.
UNIT‐V
NetworkSecurity:Cryptography,SymmetricKeyAlgorithms,PublicKeyAlgorithms,
Digital Signatures, Management of Public Keys, Communication Security,
AuthenticationProtocols,E‐mailSecurity,WebSecurity.
LearningResources:
1. AndrewS.Tanenbaum,DavidJ.Wetherall,ComputerNetworks,5thEdition,
Pearson,2012
2. W. Richard Stevens, “Unix Network Programming” Prentice Hall/Pearson
Education,2009.
3. James F. Kurose and Keith W. Ross, Computer Networking: A Top‐Down
ApproachFeaturingtheInternet,5thEdition,Addison‐Wesley,2012
4. William Stallings, “Computer Networking with Internet Protocols and
Technology”,PearsonEducation,2004.
5. Chwan‐Hwa(John)Wu,J.DavidIrwin,IntroductiontoComputerNetworks
andCyberSecurity,CRCPress,2013
6. W. Richard Stevens, Andrew M Rudoff, Bill Fenner, Unix Network
Programming:Networking APIs: Sockets and XTI (Volume1) 3rd Edition,
PHI
34
WitheffectfromtheA.Y2016‐17
DEPARTMENTOFINFORMATIONTECHNOLOGY
SYLLABUSFOR3/4B.EII‐SEMESTER
DATAWAREHOUSING&DATAMINING
Instruction:3+2Periods/week
Credits:4
Sem.ExamMarks:70
SessionalMarks:30
SubjectRef.Code:IT3120
DurationofSem.Exam:3Hrs
CourseObjectives
CourseOutcomes
Thecoursewillenablethestudentsto:
Explain the need of Data Mining
conceptsandtechniquesforuncovering
interestingdatapatternshiddeninlarge
datasets.
Attheendofthecoursestudentwillbeableto:
1. Preprocess the data summarize the
data,integrate the data,transform the data
usingthedataminingfunctions.
2. Perform various kinds of association rules
andminethedatausingtheserules.
3. Classifythedataandpredicttheoccuranceof
datausingdecisiontrees.
4. Do the cluster analysis by using the density
andgridbasedmethods.
5. Do the mining of multimedia text and word
wideweb.
Unit–I
Introduction:WhatisDataMining,DataMiningFunctionalities,ClassificationofData
MiningSystems,MajorIssuesinDataMining.
DataPreprocessing:Preprocessing,DescriptiveDataSummarization,DataCleaning,
Data Integration and Transformation, Data Reduction, Data Discretization and
ConceptHierarchyGeneration.
Unit–II
Data Warehouse and OLAP Technology: What is Data Warehouse, A
Multidimensional Data Model, Data Warehouse Architecture and Implementation,
fromDataWarehousingtoDataMining.
Mining Frequent Patterns, Associations Rules: Basic Concepts, Efficient and
Scalable Frequent Item Set Mining Methods, Mining Various kinds of Association
Rules.
Unit–III
Classification and Prediction: Introduction, Issues Regarding Classification and
Prediction, Classification by Decision Tree Induction, Bayesian Classification, Rule
based Classification, Classification by Back Propagation, Associative classification,
Prediction,EvaluatingtheAccuracyofaClassifierorPredictor.
Unit–IV
ClusterAnalysis:Introduction,TypesofDatainClusterAnalysis,ACategorizationof
Major Clustering Methods, Partitioning Methods, Hierarchical Methods, Density‐
Based Methods, Grid Based Methods, Model Based Clustering Methods, Outlier
Analysis.
35
Unit–V
Mining Object, Spatial, Multimedia, Text, and Web Data: Spatial Data Mining,
MultimediaDataMining,TextMining,MiningtheWorldWideWeb.
Mining Streams, Time‐Series, and Sequence Data: Mining Data Streams, Mining
Time‐Series Data, and Mining Sequence Patterns in Transactional Databases and
BiologicalData:
SuggestedReading:
1. HanJ&KamberM,DataMining:ConceptsandTechniques,ThirdEdition,Elsiver,
2011.
2. Pang‐Ning Tan, Michael Steinback, Vipin Kumar, Introduction to Data Mining,
PearsonEducation,2008.
3. ArunKPujari,DataminingTechniques,SecondEdition,UniversityPress,2001.
4. MargaretHDunham,S.Sridhar,Datamining:IntroductoryandAdvancedTopics,
PearsonEducation,2008.
5. Humphires, Hawkins, Dy, Data Warehousing: Architecture and Implementation,
PearsonEducation,2009.
6. Anahory,Murray,DataWarehousingintheRealWorld,PearsonEducation,2008.
7. Kargupta, Joshi,etc., Data Mining: Next Generation Challenges and Future
Directions,PrenticeHallofIndiaPvtLtd,2007.
36
WitheffectfromtheA.Y2016‐17
DEPARTMENTOFINFORMATIONTECHNOLOGY
SYLLABUSFOR3/4B.EII‐SEMESTER
OBJECTORIENTEDSYSTEMDEVELOPMENT
Instruction:3+1Periods/week
Credits:3
Sem.ExamMarks:70
SessionalMarks:30
SubjectRef.Code:IT3130
DurationofSem.Exam:3Hrs
CourseObjective:
CourseOutcomes:
Thecoursewillenablethestudentsto
Highlighting the importance of objectoriented system and development, showing
how we apply the process of object-oriented
analysis
and
design
to
software
development, gain necessary knowledge
and skills in using object-oriented CASE
tools
Attheendofthecoursestudentwillbeableto:
1. List the features of Unified process and
formaldesignprocesses.
2. Take part in differentphases of Object‐
OrientedAnalysisandDesign
3. Apply unified modeling language constructs
for developing structural design of a given
project.
4. Explain the object behavior modeling
principles and apply them towards
implementation
5. Develop architecture models using various
mechanismsofunifiedmodelinglanguage.
UNIT‐I
UMLIntroduction:WhyweModel,IntroducingtheUML,ElementsofUML.
BasicStructuralModeling:Classes,Relationships,CommonMechanisms,Diagrams,
ClassDiagrams.
Advanced Structural Modeling: Advanced Classes, Advanced Relationships,
Interfaces,TypesandRoles,Packages,Instances,ObjectDiagrams,Components.
UNIT‐II
BasicBehavioralModeling:Interactions,UseCases,UseCaseDiagrams,Interaction
diagrams,Activitydiagrams.
AdvancedBehavioralModeling:EventsandSignals,StateMachines,Processesand
Threads,Timeandspace,StateChartDiagrams.
UNIT‐III
ArchitecturalModeling:Artifacts,DeploymentCollaborations,PatternsandFrame‐
works,ArtifactDiagrams,DeploymentDiagrams,SystemsandModels.
UNIT‐IV
Unified Software DevelopmentProcess:TheUnifiedProcess,TheFourPs,AUse‐
Case‐DrivenProcess,AnArchitecture‐CentricProcesses,AnIterativeandIncremental
Process.
37
UNIT‐V
Core Workflows: Requirements Capture, Capturing Requirements as Use Cases,
Analysis,Design,Implementation,Test.
SuggestedReading:
1. Grady Booch, James Rumbaugh, Ivor Jacobson, The Unified Modeling
Language‐User Guide(Covering UML 2.0), Second Edition, Pearson
Education,India,2007.
2. Ivor Jacobson, Grady Booch, James Rumbaugh, The Unified Software
DevelopmentProcess,PearsonEducation,India,2008.
38
WitheffectfromtheA.Y2016‐17
DEPARTMENTOFINFORMATIONTECHNOLOGY
SYLLABUSFOR3/4B.EII‐SEMESTER
FINISHINGSCHOOL‐IV:TECHNICALSKILLS
Instruction:2Periods/week
Credits:1
Sem.ExamMarks:35
SessionalMarks:15
SubjectRef.Code:IT3180
DurationofSem.Exam:1½Hrs
CourseObjectives
CourseOutcomes
Thecoursewillenablethestudentsto:
Attheendofthecoursestudentwillbeableto:
This Course is intended for System
Architectcandidateswhowanttocreate
Pega7Case‐Managementsolutions.
1.
2.
3.
4.
5.
Use PRPC tools and technology to rapidly
prototype
a
simple
case‐management
application.
Create case stages and steps, implement
processes, define properties, create a user
interface, and create business rules and
processes.
UseandcreateDeclareExpressionRulesanduse
DeclarativeRulesInspector.
Implementbusinesspolicieswithdecisionrules.
Define best practices and design patterns for
implementingcase‐basedbusinessapplications.
PRPC:SystemArchitectEssentials–I
UNITI
BPMandCaseManagementOverview,StartBuildinganApplication,Defining
theProcess.
UNITII
(Modules being considered from BAE 7.1 Pega Academy Course)Pega
Overview, Application Planning, (Modules being considered from DCO
Essentials 7.1 course)Getting from Vision to Reality, Conducting a DCO
Session,(SAE–ICourseResumes)DefiningtheDataElements,Enhancingthe
UserInterface.
UNITIII
Accessing Data in the Application, Automating Business Policies, Advanced
CaseProcessing,DocumentingtheApplication.
39
PRPC:SystemArchitectEssentials–II
UNITIV
SAEII‐Orientation,EffectiveApplicationDevelopmentwithPRPC,Designing
Enterprise Applications Using Case Management, Creating an Effective Data
Model,IntegratingwithExternalDataSources.
UNITV
Creating Engaging User Experiences, Enforcing Business Policies, Process
Visibility through Business Reporting, Best Practices for Preparing an
ApplicationforTestingDeployment.
Reference:
1. https://pdn.pega.com/
WitheffectfromtheA.Y2016‐17
DEPARTMENTOFINFORMATIONTECHNOLOGY
SYLLABUSFOR3/4B.EII‐SEMESTER
FINISHINGSCHOOL–IV:SOFTSKILLS
Instruction:2Periodsperweek
Credits:01
Sessionals:15Marks
SEMExamDuration:3Hrs
SEMExamMarks:30Marks
SubjectRefCode:HS3210
CourseObjective:
CourseOutcomes
Thiscourseaimsatenhancingtheemployability
skills.Studentswillbetrainedinhigherorder
thinkingskillsincludinganalyticalskills,problem
solvingskillsandcritical&logicalreasoningskills.
Studentswillbetrainedtoworksystematicallyand
developlogicalandanalyticalthinking.
Studentswillbetrainedinthefollowingareas
1. CriticalandNonverbalreasoning
2. PureMaths
3. Verbalability
4. Logicalreasoning
5. DataInterpretationandAnalysis
At the end of the course students will
beableto:
 Understandthefundamentals
conceptsofAptitudeandverbalskills
 Solvequestionsusingshortcutsand
smartmethods
 Performcalculationswithspeedand
accuracy
 Develop Analytical thinking and
problemsolvingskills
UNIT1






VERBALABILITY
Findingerrors
Vocabulary
Synonyms
Antonyms
IdiomsandPhrases
FillintheblanksandsentenceJumbles
40

Readingcomprehension
UNIT2LOGICALREASONING

LogicalReasoning

Assignments

Puzzles

Bloodrelations

Syllogisms
UNIT3CRITICALANDNONVERBALREASONING

CriticalReasoning

Nonverbalreasoning

Figureseriesandcompletions
UNIT4QUANTITATIVEAPTITUDE‐PUREMATHS

Puremaths

Algebra

Probability

Permutationsandcombinations
UNIT5DATAINTERPRETATIONANDANALYSIS

DataInterpretation

Linegraph

Piechart
BarGraph


Tabulation
41
WitheffectfromtheA.Y2016‐17
DEPARTMENTOFINFORMATIONTECHNOLOGY
SYLLABUSFOR3/4B.EII‐SEMESTER
NETWORKPROGRAMMINGLAB
Instruction:3Periods/week
Credits:2
Sem.ExamMarks:50
SessionalMarks:25
SubjectRef.Code:IT3141
DurationofSem.Exam:3Hrs
CourseObjective:
CourseOutcomes:
Thecoursewillenablestudentsto:
Attheendofthecoursestudentwillbeableto:
understand the use of client/server
architecture
in
application
development, use elementary socket
system calls, advanced socket system
calls and Java Socket API, how to use
TCP and UDP based sockets and to
implementnetworkroutingalgorithms,
application layer protocols and
encryptionalgorithms.
1.
2.
3.
Use network programming concepts to develop
and implement distributed applications.
Develop and implement next generation protocols
required for emerging applications.
Implementation of Public Key Algorithm.
1.
Understandingandusingofcommandslikeifconfig,netstat,ping,arp,telnet,ftp,
finger, traceroute, whoisetc. Usage of elementary socket system calls (socket(),
bind(),listen(),accept(),connect(),send(),recv(),sendto(),recvfrom()).
2. ImplementationofConnectionorientedconcurrent&iterativeservice(TCP).
3. ImplementationofConnectionlessconcurrent&Iterativeservice(UDP).
4. Demonstratetheuseofadvancedsocketsystemcalls.
5. Implementationofremotecommandexecutionusingsocketsystemcalls.
6. ImplementationofDistanceVectorRoutingAlgorithm.
7. ImplementationofSMTP.
8. ImplementationofFTP.
9. ImplementationofHTTP.
10. ImplementationofRSAalgorithm.
Note:Implementprograms2to5inCand8to10inJava.
SuggestedReading:
1. W. Richard Stevens, “Unix Network Programming”, Prentice Hall, Pearson
Education,2009.
2. Douglas E.Comer, “Hands‐on Networking with Internet Technologies”, Pearson
Education.
42
WitheffectfromtheA.Y2016‐17
DEPARTMENTOFINFORMATIONTECHNOLOGY
SYLLABUSFOR3/4B.EII‐SEMESTER
OOSD&CCLAB
Instruction:3Periods/week
Credits:2
Sem.ExamMarks:50
SessionalMarks:25
SubjectRef.Code:IT3151
DurationofSem.Exam:3Hrs
CourseObjectives
CourseOutcomes
Thecoursewillenablethestudentsto:
Apply
unified
modeling
language
constructsfordevelopingstructuraldesign
and various test cases of a project,
implementpowerfulCompilerConstruction
tools and to implement front end of the
compiler by means of generating
Intermediatecodesandtoimplementcode
optimization techniques, code generation
techniques.
Attheendofthecoursestudentwillbeableto:
1. Apply the knowledge of LEX tool & YACC
tooltodevelopascanner&parser.
2. Develop programs for solving problems
relatedtoparsers.
3. Create programs for intermediate code
generationandoptimization.
4. Create visual specification of all work
products required in various phases of
softwaresystemdevelopment.
5. Generate and run test cases for various
levels of testing by applying different
testingmethods.
CCLAB:Exercisesmustbetakenfrom1to7
OOSDLAB:Exercisesmustbetakenfrom8to14
1.
2.
3.
4.
5.
6.
7.
8.
9.
StandalonelexicalanalyzerprogramusingC
ScannerprogramusingLEXtool
Implementationofpredectiveparser
ImplementationofSLRparser
ParserGenerationusingYACC
ProgramonCodeGeneration
ProgramonCodeOptimization
SystemDefinition
a) RequirementsManagement
b) DataModeling
DesignModeling
a) UsecaseDiagram
b) ClassDiagram
c) SequenceDiagram
d) CollaborationDiagram
e) StateChartDiagram
f) ActivityDiagram
g) ComponentDiagram
h) DeploymentDiagram
43
10. SoftwareDevelopment
a) Application&Webmodeling
b) ConfigurationManagement
c) UnitTesting
11. ContentManagement
12. SystemTesting
a) FunctionalTesting
b) ReliabilityTesting
c) PerformanceTesting
d) Defect&ChangeTracking
13. ChangeManagement
a) ConfigurationManagement
b) RequirementManagement
c) SystemDocumentation
14. ProjectManagement
WitheffectfromtheA.Y2016‐17
DEPARTMENTOFINFORMATIONTECHNOLOGY
SYLLABUSFOR3/4B.EII‐SEMESTER
MINIPROJECT‐IV
Instruction:3Periods/week
Credits:1
SubjectRef.Code:IT3165
SessionalMarks:25
CourseObjective:
CourseOutcomes:
Thecoursewillenablestudentsto:
Develop and implement a project using
any
of
the
programming
languages/simulation tools / electronic
components.
Attheendofthecoursestudentwillbeableto:
1. Develop solutions to various computing
problems by applying the theoretical
knowledgegained.
2. Implement projects and demonstrate them
usingpresentationsandtechnicalreports




The students are required to implement a project (hardware / software
related) from project exercises given in the suggested readings and
referencebooksofthetheorysubjects.
During the implementation of the projects, Personnel Software Process
(PSP)hastobefollowed.
Review(s)willbeconducted.
Reportoftheprojectworkhastobesubmittedforevaluation.
44