C o mp u t e r E n g i n e e r i n g Pa g e 1 9 1

1 Program: B. Tech (Computer Engineering) 1 ~ e r n e s i t

1 Code :BTCOO7001
Evaluation Scheme
1 Theory I Internal Continuous
Lecture Practical Assessment (ICA)
--
3 2
I
Pre-requisite: Operating systems(BTC004003), Database Management
~stem(BTC003006), Computer Networks(BTC004004)
0bjectives:
Thiscourseisan introduction to thefield of Computer Security.
The course covers the various aspects of cornputer security such as program
security, operating system security, network security and databasesecurity.
This course also covers risk management, BCP and legal and ethical issues
related to com~ut ersecuritv
Outcomes:
After successful completion of thiscourse, studentswill beabl eto
I
Understand thefundamentalsof computer security wi t h theapplication of
knowledgeof operating systems and databasesystems.
1
Understand thevariousthreatsto cornputer system and conduct experiments
to implement the different techniques to overcome thesethreats.
Demonstratethe understanding of the contents of this course and relatew ith
thecurrent research being carried out i n theseareas.
Detailed Syllabus:
-
Uni t
1
Description
Introduction:
Duration
3
4
Basic Components of Computer security(CIA), vulnerabilities,
threats Attacks and controls ,goals of security, Computer
criminals, Internet Sandardsand RFC.
various Security attacks, method of defense, Design Principles.
security policies
Cryptography basics, transposition ciphers, substitution ciphers,
DES, Public key cryptography, streams and block ciphers, Key
-
4
Management, Digital Sgnature.
Program Security:
Secure programs, Non malicious Program Errors, Virusesand
--
-- -
--
--
4
/ Comput er En g i n e e r i n g Page( 9 2
othermaliciouscode,typesofviruses,attackmechanismof
I - ?
viruses,TargetedMaliciousCode,ControlsAgainstProgram
Threats.
OperatingSystemSecurity:Protectedobjectsandmdhodsof
protection,Memoryaddressprotection,Controlofaccessto
generalobjects,Fileprotectionmechanism --
Database Security: Security requirements, Reliability tand 3 4
integrity,Sensitivedata,inference.~ul t i l ev el database,Proposals
for multilevelsecurity
Network Security: threats i n
controls
--
Authentication:
Authentication basics, Password, Challenge response, SSO,
Biometries
AazssControl:, Accesscontrol pri ncses, ACL,DAC,MAC, and
RolebasedAccessControl,Accesscontrol models,Kerberos
~p
Firewall, Kinds of Firewalls, Filtering Services, DMZ,
Implementingpolicies (Default allow, Default Deny) on proxy,
IDS,typesofI DS
Risk ManagementandBusinessContinuityplanning:
Risk analysis, various terminologies associated wi t h risk
management, Risk assessment techniques, managing risk, steps
for risk management, Bu s i n s impact analysis, various
terminologiesassociated wi th BIA,Different types of continuity
planning,testingandrevisingtheplan
Laws,investigationsandEthicv.
Introduction, types of computer crimes, modus operandi,(
computerforensics,ethicalissuesincomputersecurity
1
Total I
TextBooks:
1. M. Bishop,S.S. Venkatramanayya,"IntroductiontoComputerSecurity",
PearsonEducation,2009
2. M.Whitman,H.Mattford, "PrinciplesofInformationSecurity",Cengage
Learning,2ndedition,2009.
3. C.Pfleeger,S. Pfleeger,"Securityi nComputing",PearsonEducation,4Ih
edition,2008.
ReferenceBooks:
1. B. Schneier," Applied Cryptography:Protocols,Algorithmsand Sourcecodein
C",Znd Ed.,Wiley ,2004
1 2. A. Kahate,"Cryptography& Network --Security",TMH,Zndedition,2009.
-
C o mp u t e r E n g i n e e r i n g Pa g e 193
3. Dr.%an Smith," TheCraftofasternSecurity",11 e , PearsonEducation.
4. M. Merkow, J. Breithaupt," Information Security Principles and Practices",
PearsonEducation,2007.
5. C. Kaufman, R. Perlman, M. Speciner "Network Security Private
Communication inaPublicWorld",PearsonEducation,200
AlfredBasta,WolfHal ton,"Computer SecurityConcepts,Issuesand
Implementation",CengageLearning,1" Edition,CourseTechnologyl cengage
Learning(2009)
TermWork:
1. Minimumt woAssignments.
2. Twoclasstests.
3. Minimum10practicalexperimentscoveringallthetopics.
I
1
C o m p u t e r En g i n e e r i n g Page194
Program: B.Tech.(Computer Engineering) 1 Semester:VII
Course: IntelligentSystems 1 Code:BTC007002
TeachingScheme EvaluationScheme
Theory InternalContinuous
Lecture Practical Tutorial Credit
(3Hrs,
Assessment(ICA)
100 Marks) As perInsti tuteNorms
3 2 0 4 50 50
Pre-requisite:Advanced ProgrammingConceptsandDataStructures
0bjectives:
Theaim ofthecoursei stoimpartknowledgeofthecurrenttheories, methodsand
techniques i n the field of Artificial Intelligence like heuristic search techniques,
knowledge technology, gaming, learning techniques etc. this subject also make
student capable to apply this knowledge to analyze, design and develop Al -
systems.They canformulatescientificquestionsand i sabletosolveproblemswi t h
theaidofabstractionandmodeling.
0utcomes:
Aftersuccessfullycompletionofthiscourse,studentsshouldbeableto
1.Applyknowledgeofmathematics,science,andengineeringi ni tsHeuristicsearch
techniques.
2. Designan Expertsystemor can implementAl techniqueswith multidisciplinary
facultiesandwi l l beabletoconduct experiments, aswell asanalyzeand interpret
data.
Ex:MedicalDiagnosissystemMYCIN.
3.Studentscanexplorenew researchareasinthefieldofAI techniques.
DetailedSyllabus:
Uni t Description 1 Duration
1. Introductiont oAr t i f i aal Intelligence: 5
Definition, the Al problems, physical symbol system, physical
symbol system hypothesis, Intelligent agents: agents and
environment,agent types,desirablepropertiesof knowledge,AI
techniques,differentAl techniques.
Problems,problemspacesandsearch:
Need of asystem tosolvea problem,problem asa statespace
search, requirement of a formal description of a problem,
production system, control strategy & itsrequirement, breadth
firstsearch&depthfirst search,
Heuristicsearchtechniaue:
Heuristic technique, problems of heuristic technique wi t h real
world. different weak methods such as aenerate and test. hill
---
Comput er E n g i n e e r ~ n g Page195
and steepest ascent hi l l climbing,
problemwi th hillclimbingsuch aslocal maxima,plateau,ridge,
simulated annealing,best first search,ORgraphs,A' algorithm, /
-- agendadrivensearch.AND-ORGraphs.AObalgorithm.
-
Knowledge~e~r esent at i on 1 10 l ogi candrules:
I
Predicate l ogi c facts, r epr at at i onof f ad, mapping between
facts and representation, properties and issues of knowledge
representation system, prepositional logic & predicate logic,
Instancerelationship,lsa,gt& Itpredicate,resolution,conversion
to clause form: necessity Herbrand's theorem, resolution in
proportionallogic,unificationalgorithm,resolution in predicate
logic, different strategies t o speed up resolution procedure,.
questionanswering,naturaldeduction.
Rules: proceduralversusdeclarativeknowledge,forwardversus
backward reasoning,forward & backwardchaining rul esystem,
combining backward reasoning, matching: indexing, matching
with variable, complex & appropriate matching conflict
resolution,controlknowledge, --
Weak SlotB f i l l erstructure: usefulnessof slot& filler structure, 4
semantic net, intersection search, representing non binary
predicates by semantic net, partitioned semantic net, frames,
framesassets& instance,differentwaysof relatingclasses,slots
asfull-fledgedobjects,slotsvaluesasobject,inheritance ---- revisited.
Gameplaying:
Domainof agame, different waysto improvesearchstrategies,
plausible move generate, static evaluation function, different
1 static evaluation functions, minimax search procedure, adding
alpha-beta cutoff, search efficiency of alpha-beta procedure,
futility cutoff, additional refinements such as waiting for
quiescence, secondary search, using book move, iterative
deepening,advantageofdepthfirstiterativedeepening -A-Ap---
General concept about learning, different learning techniques
such as rotelearning,learningby taking advice, learningi nthe
problems solving, learning with macro-operators, learning by
chunking, utilitiesproblem, learning from examples, winston's
,learning program, version spaces, candidate elimination
algorithm,decisiontree,explanationbasedlearning.
Definition, model, characteristic, architecture, development
process, limitations, criteria for knowledge representation,
knowledgerepresentationschemes, classification model,general
)rul es used in classification model. black board model.
Comput er En g i n e e r i n g Page196
facilities, causal model,explanation
classification, rationalization, its limitations, knowledge
acquisition, different techniques, expert system tools l i ke
language,shells,narrow EStools,LISPmachine,largehybridES
tools,PCbasedexpertsystem,knowledgeacquisitiontools.
1 TextBooks:(Preferably1or2)
I
1. ElaineRich,KevinKnight,Artificial Intelligence,2nd edition,TataMcGraw Hi l l ,
3rdedition.l999.
1
2. StuartRusseland Peter Norvig,Artificial Intelligence:A ModernApproach,
2ndedition.2000.
ReferenceBooks:
1. Patric H. Winston, Artificial Intelligence, 2nd edition, Addison Wesley, 3rd
edition,1981.
2. Ni l sJNilson,PrinciplesofArtificialIntelligence,NarosaPublication.1997.
3. Robert J Schalkolf,Artificial Inteilligence: an Engineering approach, McGraw
Hi l l ,2002.
4. GeorgeF. Luger,Artificial IntelligenceStructures and Strategiesfor Complex
ProblemSolving,41e.2002,PearsonEducation.
5, Ivan Brakto, Prolog Programming for Artificial Intelligence, 31 e, Addison
Wedey,2000.
6. M. Sasikumar, S. Ramani,S. Muthuraman;RulebaseExpert System:Practical
Introduction(NAROS4).
7. David W. Rolston, Principles of Artificial Intelligence and Expert System
Development,McGraw Hi l l , 1988.
8. DanW.Patterson,IntroductiontoArtificial IntelligenceandExpertSystem,PHI,
2009.
9. Giarratano and Riley, Expert System principlesand programming,3 6 edition,
PWSpublishingcompany,1998,4thedition.
TermWork:
EvaluationofTermWorkshouldbebasedontheQuizIMi ni proj ecsl Case
studies1 SeminarIPresentations1Onlinequizzesduringtheterm.
1 AsperInternalContinuousAssement (ICA)normsoftheinstitute
-- --A
Co mp u t e r En g i n e e r i n g Page 197
Pre-requisite: Database Management System(BTC003006)
---I
--
Program: B. Tech. (Computer Engineering ) 1 Semester :VII
Course : Data Warehousing & Mi ni ng I Code :BTC007003
Teaching Scheme Evaluation Scheme
I
0bjectives.
The objective of the course i s to learn the fundamentals and concepts of data
warehouse.
To learn data extraction, transformation and loading.
Lecture
3
Various Data mining algorithms to discover useful patterns from large
databases.
Ability to conduct statistical analysis using different data mining tools to
solvereal problemsin businessand commerce
Outcomes:
After successfully completion of thiscourse, studentsshould beabl eto
Understand theneed for data warehouseand data mining
Apply different algorithms to largedatabasesto solve problems ,also for
strategic business decisions
Practical
2
Theory Internal Continuous
Tutorial Credit (3 HE, Assessment (ICA)
--
Design a data warehouse to support a business problem
Detailed Syllabus:
, Uni t
1.
--
Description m a =
Introduction:
Need for data warehousing, Basic dements of DW and trends i n
requirements
---
Architecture and Infrastructure & Data Representation:
Architectural components, Infrastructureand metadata.
Prinuplesof dimensional modeling, Dimensional modeling
advanced topics, dataextraction, transformation and loading,
data quality.
4
3.
DW, Project Planning and Management, coHecting the
--
Information Accessand Delivery:
Matching information to classes of users, OLAP i n data
warehouse, Data warehousing and the web. Physical design
process, data warehousedeployment, growth and maintenance.
--
C o m p u t e r En g i n e e r i n g Page( 98
toDataMining:
Basicsofdatamining,relatedconcepts,Dataminingtechniques.
AlgorithmsforClassification,ClusteringandAssociation rules,
KDDProcess
5.
Classification:
5
Issuesi nClassification,statisticalbased,Distancebased,Decision
based,NeuralNetworkbasedandRulebasedalgorithms
I
andAssodationRules:
Hierarchical and Partitional Algorithms , Clustering Large
Databases,BasicAssociationRuleAlgorithms
spatial Mining and Temporal
I
Applicationand rendsi n ~ a t a Mining:
Applications. %stems products and research prototypes,
I "
,
1 Additionalthemesindatamining,Trendsindatamining
1 Total
TextBooks:
1) JaweiHan,MichelineKamber,"DataMi ni ngConceptsandTechniques",
MorganKaufmann;3edition( Ll y 6,2011),
2) MargaretH. Dunham,"DataMiningIntroductoryandAdvancedTopics",
d PrenticeHal,lnc,2003.
I RefererimBooks:
1) PaulrajPonniah,"DataWarehousing FundamentalSforI TProfessionals",
Wiley;2edition(May24,2010)
----4
TermWork:
AsperInternalContinuousAssessment(ICA)normsoftheinstitute
C o m p u t e r E n g i n e e r i n g P a g e 199
I Semester :VI I
1 Code :BTC007004
Evaluation Scheme
Theory 1 Internal Continuous 1
Lecture Practical Tutorial Credit (3 Hrs, Assessment (ICA)
--
0 8 0 4
Pre-requisite: Knowledge of any programming language. Software
I . .
Eng1neer1ng(BTC005002), DBMS(BTC003006),UML Diagrams
I
Objectives: This course prepares students to develop self learning attitude and 1
working skills through software project development.
Development of the document preparation skills using standard practices
Outcomes: By the end of t hi s course the student wi l l be able t o
I
studentswill be ableto work cooperatively i n asmall group environment
I
1
studentswill beable to analyzequalitativeand quantitativedata, and explain I
how evi dencegat h~edsupportsor refutesan initial hypothesis
I
(
.
studentswill be able to ask questionsmncerning language usagewith
I
mnfidenceand seek effective help from referencesources.
I
I Detailed Svllabus:
A group of 34studentsselects the problem definition for the project work
discussed and finalized wi th the help of faculty mentor. They are required to
develop aproject based on t hree tier (Front end, logicdevelopment, Database)
architecture.
Evaluation:
Each group isexpected to maintain the log book. Thelog book needsto be
evaluated by thementor every week asthepart of continuousevaluation. Each
group must demonstratetheworking project, submit the report and do t heppt
presentation at theend of thesemester asthe part of semester end exam. Theexam
can betaken by t wo examiners: oneinternal and oneexternal examiner.
Project Report must contain:
1. Problem Definition
2. Originality of t heworkl Plagiarism declaration
3. Project description
4. Detailsof development -Methods/ Techniques1 Data/ Charts1
Diagrams
5. Database design
Co mp u t e r En g i n e e r i n g P a g e 1100
Applications-Advantagesand Limitations.
ProjedCode&Snapshots1Output
1
References.
Term Work:Asper InternalContinuousAssessment(ICA)normsoftheinstitute
Comput er En g i n e e r i n g Page1101
-Program: 6. Tech.(ComputerEngineering) II . . :V Semester
Course: lnformationStorageandManagement
(Elective1I) 1 Code:BTC007005
TeachingScheme EvaluationScheme
Theory InternalContinuous
Lecture Practical Tutorial Credit
(3Hrs,
Assessment(ICA)
'
100 Marks) As perInstituteNorms
3 2 0 4 50 50
Pre-requisite:OperatingSjstem(BTC004003),ComputerNetworks(BTC004004)
ObjectivesThecourseprovidesdetailed knowledge,practicaltraining,and insight
intotheimplementation and management of various storagetechnologies wi t h a
focustowardsapplyingthesetechnologiesinaninformationlifecycleparadigm.
Outcomes:
Aftersuccessfullycompletionofthiscourse,studentsshouldbeableto
1. Gain the basic knowledge of Sorage domain leading towards cloud
environment
2. Appearfor InternationallyacceptedcertificationexamE20-001.
'r
3. Understand the Sorage networks and i ts monitoring, management,
Securityissues.
ledSyllabus:
Uni t Description Duration
Introductiont oStorageTechnology: Dataproliferation and the
varying valueof datawi th time& usage, Sourcesof data and
statesofdatacreation,Datacenterrequirementsandevolutionto
accommodate storage needs, Overview of basic storage
management skillsand activities,Thefivepillars'of technology,
Overview of storage infrastructure components, Evolution of
storage, lnformation Lifecycle Management concept, Data
categorizationwithinanenterprise,StorageandRegulations
Storage Systems Architecture: lntdligent disk subsystems
overview, Contrastof integratedvs. modulararrays, Component
architecture of intelligent disk subsystems, Disk physical
structure components, properties, performance, and
specifications, Logical partitioning of disks, RAID & parity
algorithms, hot sparing, Physical vs. logical disk organization,
protection, and back end management,Array caching properties
and algorithms, Front end connectivity and queuing properties,
Frontendtohoststorageprovisioning,mapping,and operation,
--
- -
C o mp u t e r En g i n e e r i n g Page1102
T t e r a c t i o n of file systems wi th storage, Storage system 1 1
connectivityprotocols
Introductiont oNetworkedStorage:SOD, DAS,S4N,NAS,&
CASevolution, Direct Attached sorage (DAS) environments:
elements, connectivity, & management, StorageArea Networks
(S4N): elements & connectivity, Fibre Channel principales,
standards, & network management principales, S4N
management principles, Network Attached Storage (NAS):
elements, connectivity options, connectivity protocols (NFS,
CIFS,ftp),& managementprinciples,I PS4Nelements,standards
(iSC.9. FCIP, iFCP), connectivity principles, security, and
management principles, Content Addressable Storage (CAS):
elements, connectivity options, standards, and management
1
principles, Hybrid Storage solutions overview including
t echn~~o~i esl i kevi rt ual i zat i on & appliances
, Introduction to Information Availability: Business Continuity
and Disaster Recovery Basics, Local business continuity
techniques, Remote business continuity techniques, Disaster
Recoveryprinciples&techniques
Managing8 Monitoring:Managementphilosophies(holisticvs.
system & component), Industry managementstandards( WMP, I
SMI-S, CIM), Standard framework applications,
management metrics (thresholds,availability,capacity, security, Key 1
performance), Metric analysis methodologies & trend analysis,
Reactiveandpro-activemanagementbest practices,Provisioning
& configuration change planning, Problem reporting,
prioritization, and handling techniques, Management tools
overview
---- ---
Security 8 Virtualization: Storage Security (Importance of 1%
Information security, elements and attributes of security),
Developing a storage security model (Restricting Access Path,
Vulnerability Management, Understanding Vulnerabilities),
Securing Data Storage (Storage Security domains,
assessment Methodology, Security elements, threats against
Risk ~
applications, Controlling user access to data, threats again
backup,recoveryandarchive)
Virtualization (Define virtualization, types of virtualization),
Storage Virtualization (Storage functionality, Virtual storage,
Comparisonof virtualization architectures,challengesof storage
virtualization),Blocklevelvirtualization,Filelevel
CloudComputing: Cloud enabling technologies,
of cloud computing,Benefitsof cloud computing,Cloud service
models laas. PaaS. &as.. Cloud de~l ovment models: Public.I
C o m p u t e r E n g i n e e r i n g P a g e ) 103
7~-7-
pr~vate, Hybrid cloud, Cloud computing infrastructure, Cloud
challenges,Cloudadaptationconsiderations.
45
I
TextBooks:
1. SomasundaramGanasundaram,AlokShrivastava,"InformationStorageand
Management".EMCEducationservices,Wiley IndiaPublisher,secondEdition,
2012.
/ ReferenasBooks
1. Somasundaram Gana sundaram, Alok Shrivastava.
"Information Storage and Management", EMC Education Services,
Wiley IndiaPublisher,FirstEdition,2009.
2. MarcFarleyOsborne,"BuildingStorageNetworks",2nd edition,
TataMcGrawHi l l , 2001.
3. Robert*aiding,"StorageNetworks:TheCompleteReference",1
TataM&raw Hi l l , 2003.
TermWork:
1. Practicalbasedon 10Experiment.s
2. Twoclasstests.
t
Comput er En g i n e e r i n g Page 1104
Program: B. Tech. -Computer)Semester:VII 7
~ n ~ i n e e r i n ~
ICourse: Embedded System (Elective - 1 Code:BTC0070@3
I
11)
Teaching Scheme
I
I Prerequisite: Operating %.stem (BTC004003), Computer Network (BTC004004).
I I
Evaluation Scheme
Marks)
0bjective:
1. Thiscoursegivesbasic knowledgeof Design and development of embedded
system.
2. Thiswould be helpful in understanding the programming wi th
I microcontroller.
I
Theory Internal Continuous
, Lecture I Practical 1 Tutorial I Credit 1 I 3Hr s 100 Aseament (ICA)
3
1 Outcome:
I
1
4
1 After successfully completion of thiscourse, studentsshould beable to
Theknowledgeof design and development of embedded system
50 2 0
-
real-timeoperating system architecture, selecting architecture.' 1
1ntroduction to Real-TimeOperating Svstem Concept :Tasks 1 5 I
1
Understanding theprogramming with microcontroller
Detailed Syllabus:
- -
1 and task states, semaphores, Mutex, Mailboxes, ' ~essage1 1
'
Process of Embedded
Development process, Design, Implementation, Integration
and Testing.
Survey of Software
robin wi th interrupts, function queuescheduling architecture. I
I
I
Unit
I
1
2
3
Description
lntroduction to Embedded System :Em bedded system
,Categories, Specialties, Application areas, Recent Trends
Architecture of Embedded System: Hardwara Architecture,
Software Architecture, Application Software, Process of
Generating Executable Image, Development 1 Testing Tools.
Processes:
Threads,
Duratio
n
4
I
Comput er Engi neer i ng Page ( 105
F ( Q u e u e s , Pipes, Signals, Timers, ~ e m o 7 Management, I
I Priority Inversion Problem.
7 / Basic Design Using a Real-Time Operating System:
I I
Overvie*, principl&, An ~ x a m~ l e .Encapsulating 1
1
Semaphores and Queues, Hard Real-Time Scheduling
8
1 Text Books:
I
Considerations, Saving Memory $$ace, Saving Power.
Embedded System Programming-l :
Programming, Operations On Bits, Introduction to Embedded
9.
1. Dr. K.V.K.K. Prasad (2005), "Embedded I Real-Time Systems:
Concepts, Design and Programming (Black Book) " DreamTech Press,
2. George Couloris, (2008) "Distributed System: Concept and Design",
Pearson Education.
3. Raj Kamal(2009) 'Embedded Systems Architecture, Programming 8
DesignnTMH.
I Systems, Embedded System Boards, First Embedded System
/ ReferenceBooks:
I
Cogram, Blinking LEDS.
--
Embedded System Programming4I: EEPROM
Programming, Flash Programming, Programming With
Sznsors, Interrupts &Timers, Serial Communication, Serial
Communication Using lnterrupts, Building Interactive
Embedded Systems, Working With RTC
-- -
Total
-
pp
6
45
I
Minimum three assignments
1. David E.Simon,(2008)"An Embedded Software Primer" Pearson Educat~on.
(2009y Go Embeddededed , BPB, ,.
, Term work wnsistsof thefollowing:
/ . Minimum ten experimentsbasedon theabovesyllabus 1
,
Comput er En g i n e e r i n g Page I 106
Pre-requisite: Digital
+
Program: B.Tech.(ComputerEngineering)
Course : Advanced Image Processing
(Elective1I)
Signal
--
Semester:VII I
Code :BTC007007
Processing
0bjectives:
The objective of the course isto
provide comprehensive coverage of image processing tools and techniques,
enable the students to use these techniques for advance real l i fe applications
Teaching Scheme
such as biometrics for security and identification, satellite imaging for earth
resourcesand medical diagnosis.
Outcomes:
After successfully completion of thiscourse, studentsshould beableto
to use these techniquesfor advance real Iifeapplicationssuch as
1. Biometricsfor security and identification,
2. Satelliteimaging for earth resourcesand
1 3 Medical diagnogs.
Detailed Svllabus:
Evaluation Scheme
Theory
Lecture
3
Internal Continuous
I Duration
Practical
2
Basics of Image Processing
~cqui si ti on-sampl i ngand quantization, lmage representation,
storagegray and color images, image preprocessing, point
processing techniques, low-pass and high pass, mask processing
1
04
techniques, lmagehistogram.
Image Perception
Light, Luminance. Brightness and contrast color images, Addi ti ve
and Subtractive color models. RGB color scheme, CMYK, YCbCr,
LUV, HSI and other Color spaces and their relationship to RGB.
Colorization of grayscale images using exhaustive and Kekre's
fast search algorithms.
Image Analysis
aat i al feature extraction, Edge detection, Boundary
Representation, moment representation, Morphological
operations: Dilation, Erosion, Opening and closing.
Morphological operationson Binary and grayscaleirnages. Image
Seamentaton.
Tutorial
0
06
06
Credit (3 Hrs, Assessment (ICA)
4 50
Comput er E n g ~ n e e r i n gPage 1107
4. Image Compression
1 Redundancy i n images, Inter-pixel redundancy, coding
redundancy, and psycho-visual redundancy. Various Lossy and
I
1 losslesstechniques to minimizetheseredundancies.
I 5. 1 Imaae Transforms
1 Wavelets.
6. ) Imageas Random Variable
I
Modeling of lmage as Random Variable. Mean Variance, Co-
Variance matrix and i ts properties, Eigen vector, K-L Hotelling
Transform, --Auto-Correlation, Power Density Spectrum.
Advanced Topics
lmage Restoration, Vector Quantization (LBG), lmage Mosaicing,
lmage Fusion, Digital Watermarking, Seganography and
j1 Information Hiding, Principle Component Analysis and i ts
1 Applications t o Finger Print and Face Recognition, lmage
"
Kronecker product of matrices and development of Fast
Algorithm. Application of Kronecker product algorithm to
Hadamard, Walsh, and Haar Transforms. Smilar Fast
Algorithms for DFT, DCT, DST, Slant and Kekre Transform.
--
Total
-
45
' Text Books:
1. R.C. Gonsalez. R.E.Woods(2012)" Digital Image Processing : .NTUU"Parson
India
I
-~
I
Reference Books:
1. R.C. Gonsalez, R.E. Woods, Seven Eddins (2010) "Digital lmage Processing
using Matlab", TM H
2. Anil K. Jain (2011), " Fundamentalsof imageProcessingn,PHI.
3. William Pratt (2011), "Digital lmage Processing", h h n Willey.
4. M. A. hshi (2011), "Digital Image Processing:An AlgorithmicApproach", PHI.
Term Work:
At Least threeassignment
At least ten experimentsbased on thevariousmethods in thesyllabus.
, Two class tests
Comput er Engi neer i ng Page I I08
1 Pre-requisite: Software Engineering (BTCOOSOOL)
~
Program: B. Tech. (Computer Engineering) I Semester :VI I
-
Course : SoftwareArchitecture 1 Code :BTC007008
0bjectives:
The objectiveof thecourse is to provide the students w ith technical exposure
to theBasicconcepts, principles, methodsin softwarearchitecture.
This enables students to learn different architectural styles, patterns and
presenting the description of the same using some Architectural description
language(ADL).
This course also helps them to think about large and complex systems in
software and svstem architectural terms
Teaching Scheme
Lecture
3
valuation Scheme
Detailed Syllabus:
Unit I Desxiption I Duration
1. / BasicConcepts 03 1
Theory
(3 Hrs,
Marks)
50
I
Internal Continuous
Assessment (ICA)
As per Institute Norms
50
1 Practical
2
Outcomes:
After successfully completion of thiscourse, studentsshould be able to
Architectural concernsand approach for familiesof productsfor their design
problems
Evaluating the recent trendsin softwarearchitecture research
Good Paradigmsfor designing new systems.
Tutorial
0
02
1.1 Conceptsof SoftwareArchitecture
' 12 Models.
Credit
4
2.4 Architectural Conception in Absence of Experience.
L
2.
1.3Processes.
1.4 Stakeholders.
DesigningArchitectures
2.1 The Design Process.
2.2Architectural Conception.
2.3 Refined Experiencein Action: Stylesand Architectural
Patterns.
I
Co mp u t e r En g i n e e r i n g Pa g e / 109
3.
4.
5.
k.
7.
t
8.
Connectors
3.1 ConnectorsinAction:A MotivatingExample.
3.2 ConnectorFoundations.
3.3 Connector Roles.
3.4ConnectorTypesandTheirVariation Dimensions.
3.5ExampleConnectors.
Model i ng
4.1 ModelingConcepts.
4.2Ambiguity,Accuracy,and Precision.
4.3ComplexModeling:MixedContentandMul ti pl eVi ews.
4.4EvaluatingModelingTechniques.
4.593ecificModelingTechniques.
Analysis
5.1AnalysisGoals.
5.2ScopeofAnalysis.
5.3ArchitecturalConcernbeingAnalyzed.
1
5.4Levelof FormalityofArchitectural Models.
5.5TypeofAnalysis.
5.6AnalysisTechniques.
ImplementationandDeployment
~.
6. 1~~once~t s.
6.2 ExistingFrameworks.
6.3SoftwareArchitectureand Deployment
. ~
1 6.4SoftwareArchitectureandMobility.
1 ConventionalArchitecturalstyles
7.1PipesandFilters
7.2Event-based,ImplicitInvocation
7.3Layeredsystems
7.4Repositories
7.5l nt er~ret ers
7.6Processcontrol
CaseStudiesonArchitecturalStyles
8.1 Keywordincontext
8.2InstrumentationSoftware
8.3MobileRobotics
8.4CruiseControl
8.5A layered Designwi t hDifferentstyles
8.6Interpreterusingdifferentldiomsforcomponents
8.7A bladtboardgloballyrecastasaninterpreter
ArchitecturesandStyles
8.1DistributedandNetworkedArchitectures.
1 8.2ArchitecturesforNetwork-BasedApplications.
1 04
04
I
C o m p u t e r E n g i n e e r i n g P a y e 1110
Text Books: (Preferably 1or 2)
1. Richard N. Taylor, Nenad Medvidovic, Eric Dashofy , "Software
Architecture: Foundations, Theory, and Practice" Wiley, Edition 1, January
2009.
2. Mary Shaw , David Garlan "Software Architecture Perspectiveson an
Emerging Discipline", PrenticeHall Apri l 12,1996
3. Len Bass, Paul Clements, Rick Kazman: SoftwareArchitecture in Practice,
Second edition, Addison -Wesley Profe~sional;2~d edition(Apri1 19,2003)
10.
Frank Buschmann, RegineMeunier , HansRohnert , Peter
Sommerlad, Michael 3al , "Pattern Oriented Software Architecture" Wiley;
Volume 1 edition (August 8, 1996).
3ephen T. AIbin "The Art of Software Architecture: Design Methodsand
Techniques" Wiley; 1 edition (March 28,2003)
8.3 Decentralized Architectures.
8.4 Serviceoriented Architecturesand Web Services.
Designing f or Non-Functional Properties
9.1 Efficiency.
9.2 Complexity.
9.3 Scalability and Heterogeneity.
Term Work:
At Least threeassignment
At least 6 experiments based on thevariousmethods i n thesyllabus.
Twoclasstests
9.4Adaptability.
9.5 Dependability.
Dornai ndpeaf i c Software Engineering
10.1 Domain-aecific Software Engineering i n a Nutshell.
10.2 Domain-SpecificSoftware Architecture.
10.3 DSSAs, Product Lines, and
I
Co mp u t e r En g i n e e r i n g Page1 Ill
Program: B.Tech.(Computer
Course: E-Commerce
TeachingScheme
I I Theory
Pre-requisite:ComputerNetworks(BTC004004),Security.
+
Objectives:
Thecentralgoal ofthiscoursei stodevelop an integrativeknowledgeofthedigital
economy. I t focuseson theinformationsuperhighway asthetechnological enabler
that hasdramatically changedtheway i nwhichcompaniesorchestratetheir value
creation. This course, wi t h a strategic perspective i n mind, looks into the
knowledgeenabledenterprisesandtheinfluenceofelectroniccommerceinshaping
therulesof modernbusinessenvironments.Fromamanagerial point of view,the
coursewilldelineatetheskillsandknowledgerequiredi nthedigitalworl d.Finally,
thiscoursealsooffersatechnology perspectivethattouchesupontheunderlyingI T
electroniccommerce
I
I
Outcomes:
Uponcompletionofthesubject,studentswillbeableto:
a. Comprehendtheunderlyingeconomic mechanismsand dri vi ngforcesof E-
Cornrnerce;
b. Appraisetheopportunitiesand potentialtoapplyandsynthesizeavarietyof
E-Commerce concepts and solutions to create business value for
orqanizations,customers,andbusiness~art ners:
-
c. Undertake planning, organizing, and implementing of E-Commerce
initiativestoeffectivelyrespondtoofdynamicmarkgtenvironments.
-
;tai l " Syllabus:
Uni t Description I Duration
Introduction:Electroniccornmerceand PhysicalCommerce, 05
1 differenttypeofecommerce,sorneecomrnercescenario,
Basictechnologiesof Emmer ce: ClientsideProgramming,
ServerSide
Programming.Databaseconnectivity,session
3. AdvancetechnologiesofE-commerce:
XML,DataMi ni ng,RichInternetApplication,Web2.0, REST
WebServices,WebMashup,Working
C o mp u t e r E n g i n e e r i n g Pa g e I l l 2
05
05
Promotions,Strategiesfor Purchasingandsupportactivities,
StrategiesforWebAuctions,VirtualCommunities,andweb
05
Characteristicsof eBusiness,eBusinessroleandtheirchallenges,1
-
ebusinessRequ~rements, impaclsofe-business
7. E-businessstrategies:Sraregicpositioning Levesof e-business
- .
strategies,Strategicplanningprocess,Strategicalignment,the
consequencesofeBusiness,Sucoessfactorsforimplementationof
ebusinessstrategies.Businessmodels,Businessprocessand
collaborations
8. IntegrationofApplication:Approachesto Middleware,RPCand
RMI,EnterpriseApplicationIntegration,e-businessIntegration,
05
looselyCoupledeBusinesssolutionsforintegration,Service
,
OrientedArchitecture, EAIandwebServices,WSsecurity
9. E-commerceInfrastructureClusterofServers,Virtualization
Techniques,Cloudcomputing,Serverconsolidationusingdoud, 05
IntroductiontoHadoop,HDFS,GoogleAppsengine
Total 45
)
TextBooks:
1. "E-CommerceFundamentalsandapplication",ElizabethChang,Henry
Chan,RaymondLee,TharamDillon,Wileypublication,11e,2007
2. "E-Commerce:Strategy,Technology andImplementation",Schneider,
CengageLearning,91e,2012.
3. "E-BusinessOraanizationalandtechnicalfoundati8nn.MichaelP.Wilev
Publication,l/eY2006
ReferenceBooks: ~ ~~
1. "E-CommerceStrategy:TechnologiesandApplications", DavidWhiteley,
TataMcGraw HilI,21 e,2008.
2. "E-Commerce,A ManagerialPerspective",E.Turban,DavidKing,h e Lee,
DennisViehIand,PearsonEducation,41e,2010
Internet~ e f e r e ~ m - AssuggestedbyFaculty
Term Work: Term work shall consist of at least 6 assignments/programming
assignmentsandt wowrittentest.
C o mp u t e r E n g ~ n e e r i n gPa g e 1 113
Proaram: B. Tech. (Cornouter Enaineerina) I Semester :VII
~.,~~
- ~ \ ~ ~ ,~~ ~-~ - u~
u r
~ ~
Course: Advanced Computer Architecture I Code :BTC007010
Theory
L T r e 1 PraTcaI 1 T u t y a l ~ Cr : t 1 (3f 1
Internal Continuous
Assessment (ICA)
As per Insti tute Norms
Marks)
50
Teaching Scheme
Prerequisite: Operating 9/stem(BTCOM003), Computer Networks(BTCOMOM),
Digital Communication(BTCOM006)
Evaluation Scheme
Objectives:
The objective of this course i s to learn the fundamental aspects of computer
architecturedesign and analysis.
The course focuses on processor design, pipelining, superscalar, out-of-order
execution, caches (memory hierarchies), virtual memory, storage systems,
and simulation techniques
0utcomes:
After successfully completion of thiscourse, studentsshould beabl eto
Understand theadvanced conceptsof computer architecture.
Exposing the major differentials of RlSC and ClSC architectural
charaderistics.
Investigating modern design structures of Pipelined and Multiprocessors
svstems.
2 ~~~ -
Detailed Syllabus:
Uni t Description I Duration
1
2
3
Performance, Parallel computer models - Multiprocessors and
Multicomputers, Multivector and SlMD Computers. Static
interconnection networks, Dynamic interconnection Networks:
Bus %stems, Crossbar %itch, Multipart Memory, Multistage
and Combining Networks.
Data and resource dependenm, data hazards, Hardware and
software parallelism, Program partitioning and scheduling, Grain
size and latency, Control flow, data flow and Demand driven
mechanisms, Instruction Level parallelism: basic compilers
exposing ILP.
lnstruction set architecture, ClSC Scalar Processors, RlSC Scalar
Processors, Memory Hierarchy, Inclusion, Coherence and
4
4
6
Comput er En g i n e e r i n g Page1114
Locality. Memory capacity planning. Interleaved memory
organization- memory interleaving, pipelined memory access,
Bandwidth and Fault Tolerance. Backplane Bus
System:Backplane bus specification, Addressing and timing
protocols,Arbitrationtransactionandinterrupt.
Linear pipeline processor, Nonlinear pipeline processor,
Instruction pipeline design, Mechanisms for instruction
pipelining, pipeline hazards, Dynamic instruction scheduling -
score boarding and Tomosulo's algorithm, Branch handling
techniques,ArithmeticPipelineDesign,Staticarithmeticpipeline,,
Multifunctionalarithmeticpipelines.%perscaler pipelinedesign,
%per pipelineprocessordesign.
Cache coherence, Snoopy protocols, Directory based prot ocox
Message routing schemes in multicomputer network,deadlock
and virtual channel. Vector Processing Principles, Vector
instruction types, Vector-access memory schemes. Vector
s ~~er c or n~ut ~~ar c hi t ec t ur e,
SMD organization: distributed memory model and sharedb
-
memory model Performance of symmetric shared memory
multiprocessor, Principles of Multithreading: Multithreading
IssuesandSolutions.Multiple-ContextProcessors
7 Parallel ProgrammingModels,Shared-VariableModel,Message-
PassingModel,Data-ParallelModel,Object-Oriented Model
8 MULTI-COREARCHITECTURES
Softwareandhardwaremultithreading-3vl Tand CMP
architectures- Designissues-casestudies-Intel Multi-core
I
architecture-SUN CMParchitecture-heterogenousmult~-core
processors-casestudy: IBMCellProcessor.
I 1
Total
I
TextBooks:
1. KaiHwang,"Advancedcomputerarchitecture",TMH, 2001.
2. JP.Hayes,"computerArchitectureand organization";MGH, 1998
ReferenceBooks:
1. V.Rajaranam& C.SR.Murthy,"Parallelcomputer";PHILearning,2004.
2. Kain,"AdvanceComputerArchitecture:- A SystemDesignApproach",PHI
Learning,1996.
3. M.JFlynn,"ComputerArchitecture,Pipelinedand ParallelProcessor
Design";NarosaPublishing.1998,
4. Hwangand Briggs,"ComputerArchitectureand ParallelProcessing";MGH,
Comput er En g i n e e r i n g Pa g e 1 I 15
2000.
5. David E. Callav & Aswinder Pal Sngh MargeKaufmann2'Advance
Computer Architecture
6. h h n L Hennessey and David, "Computer Architecture, A Quantitative
Approach" 4th edition, Elsevier, 2007.
1
I
Term Work:
At Least threeassignment
At least 8experiments based on thevarious methodsi n the syllabus.
I Twoclasstests
- -
-- -- - -
----- -
Comput er Engineering PageI l l 6
(ComputerEngineering) ~ e m e s t e r : ~ l l 7
Course: Advanced DatabaseManagement 1 Code:BTC007011 1
EvaluationScheme 1
InternalContinuous
1 100
Marks) 1
Assessment(IcA)
i
-I
ASperlnstitute~ o r m s
50 50
Pre-requisite:DatabaseManagementSjstem(BTC003006)
t-
1 Objectives:Expandontheknowledgegained inDatabaseManagementSjstemsin
severaldirectionsl i keNon-Relationaldatamodels,deductive(Intel1igent) database
systems,webbasedsystemsandobjectoriented
Ou t me s :
After successfullycompletionofthiscourse,thestudentsmustbeableto
1.Designdatabaseusingextendedconceptof ElRmodel.
2. Thestudents must beabletowritefunctions and procedures using concept of
PLISQL.
3.Theymustbeawareofdifferenttypesofdatabasemanagementsystemslikeobject
oriented, parallel and distributed and advance databases l i ke active database,
t em~or al databaseetc.
to -- managedatabaseusingconceptsofdatabaseadministration.
I Duration
The Extended Entity Relationship Model and Object Model:1 5
TheERmodel revisited,Motivationfor complexdatatypes,User )
I 1
defined abstract data types and structured types, subclasses,1
1
1 super classes, lnheritance, Specialization and 'Generalization, 1
1 1 Constraints and charaderisitics of specialization and 1
generalization,relationshiptypesofdegreehigherthantwo.
2. Procedural Query ( P L I s Q L ) : I 7 1 L a n g ~ e l ~ t r u c t u r e d language
~ -
1
1 SQL and advantags1 Introductionto PLI &L. ~ i s a d v a n t a ~ s b f
of PLISQL, PLISQL block structure, block data types, block
variable declaration, exception handling. Cursors, types of
cursors.functions,procedures,tuggers
3 object-nted Databases: Overvlew of object orlentedl 5
identity,objedstructureand typeknstructions,
Encapsulation of operations, Method and persistence, Type
hierarchiesand Inheritance,Typeextentsand queries, Complex
objects; Databaseschemadesign for OODBMS; OQL, Persistent
language; OODBMS architecture and
----
/ ,/'
Comput er E n g i n e e r ~ n g Page1 I17
- - T s s F Transaction and Concurrency control, example of
ODBMS.
4. ObjectRelationalandExtendedRelationalDatabases.Database 4
designfor anORDBMS,Nestedrelationsand collections, storage
and access methods, Query processing and optimization, An
overview of SQL3, lmolementation issues of extended tvoe: i
t
1 Systemcomparisonof RDBMS,OODBMS,andORDBMS.
5(~arallel and Distributed Databases and Client-Sewer
Architecture: Architectures for parallel database, Parallel query
evaluation, Parallelizing individual operations, Sorting, bi ns,
DistributedDatabaseConcepts,DataFragmentation,Replication,
and allocationtechniquesfor distributeddatabasedesign;Query
processing in distributed databases; Concurrency control and
I Recovery indistributed databases.Anoverview of Client-Server 1
interfacesoftheweb.Overview ofXML;dataXML applications;
Thesemi structured datamodel,Implementationissues,Indexes
Enhanced data models f or Advanced applications: Active
databaseconcepts,Temporaldatabaseconcepts,aat i al databaseI
I concepts and architecture. Deductive databases and Querv 1
processing,Mobiledat abas, Geographicinformationsystems.
Database Administration: Managing a database instance,
Maintaining an Online Redo Log files, Managing table spaces
and data files, Managing undo data, Managing users and
privileges,Managingrolesandauditing.
Total
--
TextBooks:
l.Elmarsi,Navathe,Fundamentalsof DatabaseSystems,51hedition,Addison
Weslev.2006
I ReferenceBooks:
1. Stefano Ceri and Giuseppe Pelagatti, Distributed DatabasesPrinciplesand
Systems.McGraw Hi l l , 1985.
I
2. R.Ramakrishnan, DatabaseManagement Systems,3 d edition,McGraw Hi l l ,
2002
I
3. Hennery Korth, Abraham Slberschatz, Database System Concepts, 5th
edition,McGrawHi l l , 2005.
4. BipinDesai,AnIntroductiontoDatabase%stem, Galgotia.
5. C.J Date,An IntroductiontoDatabaseSystem,8thedition,AddisonWesley.
2003
/' C o mp u t e r E n g i n e e r i n g Pa g e 1118
astern,ACM Press,AddisonWesley,1995.
7. GeorgeKoch,Oracle8i-Thecomplete Reference,TataMcGraw Hi l l , 2001
8. IvanBayross,OracleDeveloper2000,BPB.
1
TermWork:Asper InternalContinuousAssesment (ICA)normsoftheinstitute
NoofPracticals:15
NoofAssignments:020rmore