0% found this document useful (0 votes)
63 views24 pages

Detailed Syllabus M. Tech (CS)

Bbau b.tech syllabus

Uploaded by

xmvwjuf
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
63 views24 pages

Detailed Syllabus M. Tech (CS)

Bbau b.tech syllabus

Uploaded by

xmvwjuf
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 24

ANNEXURE-F'

Detailed Syllabus
M. Tech.(Computer Science)
W.e.f. 2019-2020
ISemester
Credit: 04
Architecture 2-1-0)
MTCS-101: Advanced Computer
hardware designing of
of basic architecture and
the knowledge
Objective: To provide
computers.
Unit-I
Parallel computer models: Multiprocessors and
Classification of paralel computers,
The state of computing,
and SIMD computers.
multicomputers, Multivector
software
Program and network properties: and resource Dependences, Hardware and
Data Program flow
Conditions of parallelism,
and scheduling, Grain Size and latency,
Demand driven
parallelism, Program partitioning Data flow Architecture,
versus data flow,
mechanisms, Control flow
of flow mechanisms
mechanisms, Comparisons

Unit-II
System Interconnect Architectures: interconnection
Static interconnection Networks,
Dynamic
Network properties and routing, Hierarchical bus systems,
Crossbar switch
Interconnects,
Networks, Multiprocessor system
and combining network.
and multiport memory, Multistage
RISC
Advanced processors: CISC Scalar Processors,
Instruction-set Architectures,
technology,
Advanced processor Architectures, Vector and Symbolic
Processors, VLIW
Scalar Processors, Superscalar
processors

Unit-I1I

Pipelining: Instruction pipeline Design,


pipeline processor,
nonlinear
Linear pipeline processor, Branch Handling
Mechanisms for instruction pipelining,
Dynamic instruction scheduling,
arithmetic principles,
Arithmetic Pipeline Design, Computer
techniques, branch prediction,
Multifunctional arithmetic pipelines
Static Arithmetic pipeline,
Memory Hierarchy Design: multilevel cache
Cache basics & cache performance,
reducing miss rate and miss penalty,
of memory hierarchies.
hierarchies,main memory organizations, design

S h a l
Unit-1V
Multiprocessor architectures:
Symmetric shared memory architectures, distributed shared memory architectures, models of
memory consistency, cache coherence protocols (MSI, MESI, MOES). scalable cache
coherence, overview of directory based approaches, design challenges of directory protocols,
memory based directory protocols, cache based directory protocols, protocol design
tradeofls, synchronization,
Enterprise Memory subsystem Architecture:
Enterprise RAS Feature set: Machine check, hot add/remove, domain partitioning. memory
mirroring/migration. patrol scrubbing, fault tolerant system.

Text Books:
1. Kai Hwang. "Advanced computer architecture": TMH 2000
2D. A. Patterson and J. L. Hennessey, "Computer organization and design Morgan
Kaufmann. 2nd Ed. 2002

Reference Books:
MGH. 1998
I.J.P.Hayes, "computer Architecture and organization": 1998
Narosa Publication.
2. Harvey G.Cragon,"Memory System and Pipelined processors":;
PHI. 2002
3. V.Rajaranam & C.S.R.Murthy, "Parallel computer":
"Foundation of Parallel Processing' Narosa
4 R.K.Ghose, Rajan Moona & Phalguni Gupta,
Publications, 2003
Architecture", MGH. 2001
Kai Hwang and Zu, "Scalable Parallel Computers
PHI. 2000
6. Stalling W, "Computer Organisation & Architecture", Architecture-A Design
D.Sima, T.Fountain, P.Kasuk. "Advanced Computer space
1997.
Approach,"Addison Wesley, and Parallel Processor Design"; Narosa
8. M.J Flynn, "Computer Architecture, Pipelined
Publishing. 1998
:A quantitative approach": Morgan
9. D.A.Patterson, J.L.Hennessy. "Computer Architecture
Kauffmann feb,2002.
and Parallel Processing"; MGH. 1999
Briggs, Computer Architecture
"

10. Hwan and


Credit 04
Foundations of Computer Science (2-1-0)
MTCS-102 Mathematical for
to students to make their
foundations
To provide the mathematical knowledge
Objective:
research.
further learning and

Unit Vector space.


Linear Algebra Introduction: Matrices and solving system of linear equations.
Linear dependence and independence of vectors, Bases
Subspace., Linear combination of vectors,
Transformation
and dimensions, Linear

Unit I values and Eigen vectors,


vectors and dual vectors, Eigen
Inner product spaces, Orthogonal
singular value decomposition.

C
Unit Il1:
Probability and Statistics; Frequency distribution and measures of central tendency mean,
median, mode,quartiles, measures of dispersions and skewness, standard deviation, mean
deviation, coetlicient of variation, moments. Probability definitions, Distribution: discrete and
continuous, Chi-square test, t-test, f-test z-test.

Unit IV
Algebraic tormulation of linear programming problems, Graphical, simplex, dual simplex, Big-
M and 2 phase method, integer and quadratic programming, Transportation and assignment
problems.

References:
1. K. Hoffman. R. Kunze, "Linear Algebra", Pearson
2. M. Mood. A. Graybill. c. Boes, "Introduetion to the theory of Statistics", Wiley.
3. William Feller. "An Introduction to Probability Theory and its Application" Tata
McGraw-Hill.
4. H.A. Taha, "Operation Research: An Introduction", Pearson.

MTCS-103 Analysis & Design of Algorithm 2-1-0) Credit 04


Objective: To provide the knowledge to learn and make algorithms and their analysis.

Unit 1
Role of algorithms in computing, Performance analysis of algorithm and Recurrences- Time and
space complexity, Asymptotic Notation, Recurrence Relation, Basic introduction to algorithmic
paradigms like Dynamic Programming, divide and conquer, Backtracking, Greedy Algorithms
and branch and bound etc.

Unit 2
Elementary review of basic and advance data structures like Hash Tables, Binary Search Trees.
Red-Black Trees, AVL Tree, Fibonacci Heap, Splay Tree.
Sortingin Polynomial Time: Insertion Sort, Selection Sort and Quick Sort; Sorting in Linear
Time: Radix Sort, and Bucket Sort

Unit 3
Graph Algorithms: BFS, DFS. Shortest Path, Maximum Flow, Minimum Spanning Tree-
Prim's and Kruskal Algorithm.
Greedy Algorithms: Huf+man coding, Fractional Knapsack problem, priority queue heap sort.
Dynamic programming: Elements of dynamic programming, Matrix-chain multiplication,
Longest common subsequence, Floyd's all pair shortest path algorithm.
Branch and bound: Job assignment problem and Travelling Sales man problem.
Unit 4
Randomizcd Algorithms, Nafve
Algorithm, Rabin K.arp Algorithm, Comple &
Algorithms-Polynomial time, Polynomial-1ime verification, Approximate
NP-complcte & approximation NP-umpletenes
and
reducibility.
vatisfiubility, 3 CNF Satissiability,problemsClique
The vertex-cover
problem, Vertez-cover problem, formula
problem
Text and References
Introduction to Algørithms", Thomas H.
Clifford Stein, Third Fdition, PHI Cormen, Charles E. Ikiservn, Ronald L. Rívest,
2. "Data Structures and Publication.
Algoríthms in C+", M.T. Goodrich, R. Tamassia ard D.Mount, Wiley
India.
3. Fundamentals of Computer Algorithms, EJlis Horowitz, Sartaj Sahni, Sanguhevar Rajasekaran,
Second Fdition, Galgotía Publicatíon
4. Data structures with C+, J. Hubbard, Schaum's
5.
outlines, TMH
Data structures and Algorithm
Analysis in C++, 3rd edition, M. A. Weis, Pearson.

Elective-
MTCS-104 (A): Advanced Software Engineering (2-1-0) Credit 04
Objective: To provide the knowledge of software development and various techniques to
maintain software reliability.

Unit-I

Introduction:
Software Crisis, Software Processes & Characteristics, Software life cycle models, Waterfall,
Prototype, Evolutionary and Spiral Models, Overview of Quality Standards like ISO 9001, SEI -
CMM. Software Requirements analysis & specifications: Requirement engineering.
requirement
elicitation techniques like FAST, QFD & Use case approach, requirements analysis using DFD,
Data dictionaries & ER Diagrams, Requirements documentation, Nature of SRS, Characteristics
& organization of SRS.

Unit-II

Software Project Planning:


Size Estimation like lines of Code & Function Count, Cost Estimation Models, Static single &
Multivariable Models, cOCOMO, COCOMO-I1, Putnam resource allocation model, Risk
Management. Software Design: Cohesion & Coupling, Classification of Cohesiveness &
Coupling, Function Oriented Design, Object Oriented Design, User Interface Design.
Unit-III

Software Metrics:
Software measurements: What & Why, Token Count, Halstead Software Science Measures
Design Metrics, Data Structure Metrics, Information Flow Metrics. Software Testing: Testing
process, Design of test cases, functional testing: Boundary value analysis, Equivalence class
testing, Decision table testing, Cause effect graphing, Structural testing, Path Testing, Data flow

Srole
and mutation
testing, Unit
Testing, Regression Testing,Testing,
Testing
Integration and System Testing, Debugging, Alpha & Beta
Tools &Standards.
Unit-IV
Software Reliability:
Importance, Hardware Reliability & Software Reliability, Failure and
Basic Model, Logarithmic Poisson Faults, Reliability Models,
Model, Calender time Component.
Software Maintenance:
Management of Maintenance, Maintenance Process, Maintenance Models, Reverse
Software Re-engineering, Engineering,
Configuration Management, Documentation.
Test Books:
1. K. K. Aggarwal &
Yogesh Singh, "Software Engineering", New Age International, 2001.
2. R. S. Pressman, "Software
Engineering A practitioner's approach", 5th Ed., McGraw Hill
-

Int. Ed., 2001.

Reference Books:
1. R. Fairley, "Software
Engineering Concepts", Tata McGraw Hill, 1997.
2.P. Jalote,"AnIntegrated approach to Software Engineering", Narosa, 1991.
3. Stephen R. Schach, "Classical & Object Oriented Software Engineering", IRWIN, 1996.
4. James Peter W. Pedrycz, "Software Engineering", John Wiley & Sons., 1999
5. I. Sommerville, "Software Engineering", Addison. Wesley, 1999

MTCS-104 (B): Advanced Database Management Systems (2-1-0) Credit 04


Objective: To provide the knowledge of advance concepts for efficient data storage and
handling mechanismns.

Unit I

Relational Databases:
Integrity Constraints revisited, Extended ER diagram, Relational Algebra & Calculus,
Functional, Muiltivalued and Join Dependency, Normal Forms, Rules about functional
dependencies.
Unit II

Query Processing and Optimization:


Valuation of Relational Operations, Transformation of Relational Expressions, Indexing and
Query Optimization, Limitations of Relational Data Model, Null Values and Partial Information.
Deductive Databases:
Datalog and Recursion, Evaluation of Datalog program, Recursive queries with negation.
Objected Oriented and Object Relational Databases:
Modeling Complex Data Semantics, Specialization, Generalization, Aggregation and
Association, Objects, Object ldentity, Equality and Object Reference, Architecture of Object
Oriented and Object Relational Databases

Srale
Parallel and Distributed Databases:
Distributed
Distributed
Data Storage Fragmentation & Replication, Location and Fragment Transparency
Query Processing and Optimization,
concurrency Control, Distributed Deadlock, Commit Distributed Transaction Modeling and
Parallel Query Evaluation. Protocols, Design of Parallel Databases,

Unit III
Advanced Transaction Processing
Nested and Multilevel Transactions, Compensating Transactions and
Saga, Long Duration
Transactions, Weak Levels of Consistency, Transaction Work Flows, Transaction
Monitors. Processing
Active Database and Real Time Databases:
Triggers in SQL, Event Constraint and Action: ECA Rules, Query Processing and Concurrency
Control, Compensation and Databases Recovery
Image and Multimedia Databases:
Modeling and Storage of Image and Multimedia Data, Data Structures R-tree, k-d tree, Quad
trees, Content Based Retrieval: Color Histograms, Textures, etc., Image Features, Spatial and
Topological Relationships, Multimedia Data Formats, Video Data Model, Audio & Handwriten
Data, Geographic Information Systems (GIS)
WEB Database: Accessing Databases through WEB, WEB Servers., XML Databases.
Commercial Systems.

Unit IV
Data Mining:
Knowledge Representation Using Rules, Association and Classification Rules, Sequential
Patterns, Algorithms for Rule Discovery
Data Warehousing:
Data Warehousing Architecture, Multidimensional Data Model, Update Propagation OLAP
Queries Case Study: Oracle Xi

Text Books:
. Elmarsi, Navathe, Somayajulu, Gupta, "Fundamentals of Database Systems", 4
Edition, Pearson Education, 2007
Garcia, Ullman, Widom, "Database Systems, The complete book", Pearson
Education, 2007
3. R. Ramakrishnan, "Database Management Systems", McGraw Hill International
Editions, 1998

Reference Books:
1. Date, Kannan, Swaminathan, "An Introduction to Database Systems", 8" Edition
Pearson Education, 2007
2 Singh S.K., "Database System Concepts, design and application", Pearson
Education, 2006.
. Silberscatz, Korth, Sudarshan, "Database System Concepts", Mcgraw Hill, 6"
Edition, 2006
w. Kim, "Modern Database Systems", 1995, ACM Press, Addision - Wesley

J
5. D. Maier, "The
Theory of Relationl Databases", 1993, Computer Science Press,
Rokville, Maryland
6. Ulman, J. D., "Principals of
Xi Reference Manual
database systems", Galgotia publications, 19997. Oracle

MTCS-104 (C): Artificial Intelligence (2-1-0) Credit 04

Objective: The primary objective of this course is to introduce the basic principles, techniques,
and applications of Artificial
Intelligence
UNIT-I

Introduction: Overview of Artificial intelligence- Problems of Al, Al technique, Tic- Tac - Toe
problem. Intelligent. Overview, Growth, Turing Test and Its Significance Branches of Al and
Applications
Agents: Agents & environment, nature of environment, structure of agents, goal based agents.
utility based agents, learning agents.
Problem Solving: Problems, Problem Space & search: Defining the problem as state space
search. production system, problem characteristics, Issues in the design of search programs.

UNIT-II
State Searching: Informed and Uninformed (blind) Searches-DFS, BFS, Best First Search etc.
AND-OR Graph, Algorithms A*, Properties of A*, A0* and Related Algorithms, Game Playing
Strategies, Mini Max Procedure and Applications.

UNIT-II
Knowledge Representation: Propositional Logic, First Order Predicate, Semantic Net
Partitioned Semantic Net, Frames and Scripts, Conceptual Dependency (CD), Reasoning
Process,Uncertainty Considerations.
Introduction to Expert Systems: System Feasibility Considerations, Architecture. Tools
Overview of Rule Based and Other Types of ES Design.

UNIT-IV
Natural Language Processing: Grammar for Natural Languages, Parsing, Transition Nets (TN).
ATN and RTN Parser, Lexicon, Sentence Generation, Syntactic Processing, Semantic Analysis.
Discourse & Pragmatic Processing.
Introduction to: Patten Recognition, Planning, Machine Translation, Genetic learning. Neural
Nets, Machine Learning and Fuzzy Logic.

Suggested Readings
1. Stuart Russell, Peter Norvig, "Artificial Intelligence", Pearson
2. Lugar J, "AI-Structure & Strategies for Complex Problem Solving", Pearson Publication
3. Elaine, Rich & K. Knight, Artificial Intelligence, TMH
4. N.J. Nilson, Principles of Artificial Intelligence, Narosa Publication

Sra
S. Peter Jackson, Introduetion to Experts System, Addison Wesley
6. E.Charniak & D. Me Dermott, Introduction to Al, Addison Wesley

Credit 04
MTCS-105: Programming Lab-I (2-1-0)
Lab based on Paper MTCS-103

Credit 04
MTCSOE-101: Introduction to Computer Network (2-1-0)
networks.
Objective: To provide the knowledge about the basic concept of computer

Unit I Network: Use Of


Definition Of A Computer Network; What Is A Network? Components Of A Computer
Network
Networks For People, Social Issues,
Computer Networks; Networks For Companies, Area Networks,
Local Area Networks, Metropolitan
Classification; Types Of Transmission Technology, To The
Issues For The Layers, Types Of Service
Wide Area Networks, Wireless Networks, Design
Layers, Osi Model.

Unit II
Of The
Guided Transmission Media, Wireless Transmission, Structure
Physical Layer:
Telephone System. Services Provided To
Data Link Layer Design Issues:
Data Link Layer (Logical Link Layer):
Correction Data Link Protocols: Stop-And-Wait
The Network Layer, Error Detection And
Protocol, Sliding Window Protocols.

Unit IlI
Channel Allocation Problem: Static Channel Allocation And
Medium Access Control Sub Layer:
Access Protocols
-
Multiple Access
Aloha, Carrier Sense
Dynamic Channel Allocation. Multiple
Hubs, Bridges, Switches, Routers And Gateways.
Protocols, Ethernet, Bluetooth, Repeaters,
Control.
Shortest Path Routing. Flooding, Congestion
Routing Algorithms.

Unit IV
Elements Of Transport Protocols, Application Layer:
Transport Layer: Transport Service,
Domain Name System. Electronic Mail,
World Wide Web, And Multimedia.
DNS-The

Reference books:

Edition". Phi
1. A.S. Tanenbaum. "Computer Networks, 4
Communication". Macmillan Press
2. W. Stallings, "Data And Computer
Phi
3. Comer, "Computer Networks & Internet",
Phi
4. Comer, "Internetworking With Tep/lp",
And Networking", Tmh
5. Forouzan, "Data Communication

J
IISemester
MTCS-201: Advanced Computer Networks (2-1-0) Credit 04

Objective: To provide the knowledge about advance concepts to analyze and design of computer
network.
Unit-1
Introduction:
Introduction to Network models-IS0-0SI, SNA, Appletalk and TCP/IP models. Review of
Physical layer and Data link layers, Review of LAN (EEE 802.3, 802.5, 802.1 1b/alg. FDD) and
WAN (Frame Relay. ATM, ISDN) standards.

Unit-I1
Network layer:
ARP, RARP, Internet architecture and addressing, internetworking. IPv4, overview of IPv6.
ICMP, Routing Protocols- RIP, OSPF, BGP, IP over ATM.

Unit-IlI
Transport layer:
Connection management, Transmission Control Protocol (TCP). User Datagram
Design issues,
Protocol (UDP), Finite state machine model.

Unit-IV
Application layer:
www.DNS, e-mail, SNMP, RMON
Secure Socket Layer (SSL) and Virtual Private
Network Security: Cryptography, Firewalls,
Networks (VPN).
Case study
Study of various network simulators, Network performance analysis using
NS2

Text Books:
2000.
1. Behrouz A. Forouzan, "TCP/IP Protocol Suit", TMH,
1999.
2. Tananbaum A. S., "Computer Networks", 3 Ed., PHI,

Reference Books:
Standards and Interfaces", PHI, 1996.
. Black U, "Computer Networks-Protocols,
6" Ed., PHI, 2002.
2. Stallings W., "Data and Computer Communications",
3. Stallings W.. "SNMP, SNMPv2, SNMPv3, RMON 1 & 2". 3 Ed.. Addison Wesley.
1999.
"Introduction to Cisco Router Configuration". Techmedia. 1999.
4. Laurra Chappell (Ed),
Electives
MTCS-202 (A): Advanced
To provide the Computer Gruphlen (2-1-0))
Objective: redit 94
Unit 1 knowledge of advance concepts
to create and manipulate the inay
Line Drawing and
transformation: Busic raster graphical algorithm for 2)
drawing algorithm, 2D and 3D transformation primitives, Iine

Unit 1
Clipping: Window, Viewport, Clipping algorithm, Curves and
Surfacen Circle drawin
Algorithm, Ellipse drawing algorithm, Beziercurve, b-spline curve, surfaces, Solid modelling
Unit I1I
Projection:
Parallel projection, Perspective projection,
Computation of vanishing poit.
Visible surface determination:
Z-buffer algorithm, Scan line algorithm, Area subdivision
algorithm, Raytracing algorithm
Unit IV:
Shading:
TIllumination mode, Specular reflection model, Shading models for curve surfaces, Radiosity
method, Rendering, Recursive ray tracing, Texture mapping
Advanced Modelling Techniques
Procedural Models, Fractal Models, Grammar based models, particle systems.
Animation: 3D animation, morphing, simulation of key frames

Text Books:
1. Foley Computer Graphics Principles & Practice, 2 ed. Pearson Fducation., 2000
2. Hearn& Baker Computer Graphics C version, 2 ed. Pearson Education., 1986

Reference Books:
1. Roger and Adams - Mathematical Element for Computer Graphics, 2 ed., Tata McGraw
Hill, 19899
2 David F. Rogers, "Procedural Element for computer graphics", McGraw Hill Book
Company, 1985.

MTCS-202 (B): Cloud Computing (2-1-0) Credit 04


Objective: To provide the knowledge about the concepts of computing over the cloud
environment.
UnitI
Introduction to Cloud Computing, Definition, Characteristics, Components, Cloud provider,
SAAS, PAAS, IAAS and Others, Organizational scenarios of clouds, Administering &
Monitoring cloud services, benefits and limitations, Deploy application over cloud, Comparison
among SAAS, PAAS, IAAS Cloud computing platforms: Infrastructure as service: Amazon
EC2,Platform as Service: Google App Engine, Microsoft Azure, Utility Computing, Elastic
Computing
Unit II
Introduction to Cloud Technologies, Study
Hypervisors Compare SOAP and REST
of
Webservices, AJAX and mashups-Web services: SOAP and REST, SOAP versus REST, AJAX:
asynchronous rich' interfaces, Mashups: user interface services Virtualization Technology
Virtual machine technology, virtualization applications in enterprises, Pitfalls of virtualization
Multitenant software: Multi-entity support, Multi-schema approach, Multi-tenance using cloud
data stores, Data access control for enterprise applications,

Unit IlI
Issues in cloud computing, Issues in Intercloud environments, QOS Issues in Cloud,
Dependability, data migration, streaming in Cloud. Quality of Service (QoS) monitoring in a
Cloud computing environment. Cloud Middleware. Mobile Cloud Computing. Inter Cloud
issues. A grid of clouds, Sky computing, load balancing, resource optimization, resource
dynamic reconfiguration, Monitoring in Cloud

Unit IV
Cloud security fundamentals, Vulnerability assessment tool for cloud, Privacy and Security in
cloud, Cloud computing security architecture: Architectural Considerations- General Issues,
Trusted. Cloud computing, Secure Execution Environments and Communications, Micro
architectures; Identity Management and Access control-Identity management, Acess control,
Autonomic Security Cloud computing security challenges: Virtualization security management-
virtual threats, VM Security Recommendations, VM-Specific Security techniques, Secure
Execution Environments and Communications in cloud.

Reference
Text Book:
1. Cloud Computing for Dummies by Judith Hurwitz, R.Bloor, M.Kanfman, F.Halper (Wiley India
Edition)
2. Enterprise Cloud Computing by Gautam Shroff,Cambridge
3. Cloud Security by Ronald Krutz and Russell Dean Vines, Wiley-India

Reference Book:
1. Google Apps by Scott Granneman,Pearson
2. Cloud Security & Privacy by Tim Malhar, S.Kumaraswammy, S.Latif (SPD,O'REILLY)
T et.al McGraw Hill,
3. Cloud Computing: A Practical Approach, Antohy Velte,
India
4. Cloud Computing Bible by Barrie Sosinsky, Wiley
2010 TEEE 3rd International Conference on Cloud
5. Stefano Ferretti et.al.,1QoS-aware Clouds",
Computing

Shal
Credit 04
MTCS-202 (C): Digital Image Processing (2-1-0)

Objective: To provide the knowledge of image formation, manipulation. information


retrieval and image analysis.

Unit-I Introduction
Structure of human eye, Image formation in the human eye, Digital Image Representation.
in Image Processing. Elements of
Brightness adaptation and discrimination. Fundamental steps Aliasing.
Digital Image Processing Image Acquisition, Storage. Sampling. quantization.
-

Basic relationships between pixels -Pixel


Zooming and Shrinking. A simple image model.
connectivity, Adjacency, Paths and Distances.
used in Image Processing
Unit-Il Introduction of Some Mathematical Transforms
and 2- D DET, Properties of 2-D
Fourier Transform (FT), Discrete Fourier Transform (DFT) Transform.
Fourier Transform (IFFT). Walsh
DFT, Fast Fourier Transform (FFT). Inverse Fast Transform (WT). Discrete
Wavelet
Hadamard transform, Discrete Cosine Transform (DCT). Wavelet Packet
Transform (WPT). Discrete
Wavelet Transform (DWT). Wavelet Packet
Transform (DWPT). Houge Transform and its applications in Image Processing.

Frequency Domain
Unit-IlI Image Enhancement in Spatial & Transforms. Histogram Processing: Histogram
Image Negatives, Log and Power Log
transformation, Image subtraction and Image averaging.
equalization, Histogram matching, Pixel between
and High pass (Sharpening) Filters, Correspondence
Filtering: Low pass (Smoothing) filter, Butterworth
domains. Low pass filters- Ideal Low pass
filtering in spatial and frequency filters- Ideal High pass filter, Butterwoth and
Gaussian
and Gaussian Low pass filters. High pass
filtering and implementations.
high pass filters. Unsharp Masking, Homomorphic
UNIT-IV Image compression & segmentation:
Models -Loss Less And Lossy. Loss Less-
Algorithms Feature Redundancy And Compression
Bit-Plane Coding, Loss Less Predictive Coding.
Variable-Length. Huffman, Arithmetic Coding
-

LossyTransform (DCT) Based Coding, JPEG Standard - Sub Band Coding. Image Segmentation:
Curve Detection Edge Linking And Boundary Extraction.
Edge Detection Line Detection -
-

And Segmentation, Morphology-Dilation.


Boundary Representation, Region Representation
Miss Analysis
Erosion, Opening And Closing. Hit And

Suggested Readings:
Second Edition. Pearson
1. R.C.Gonsales, R.E.Woods, "Digital Image Processing",
Education.
PHI.
2. Anil K.Jain, "Fundamentals of Image Processing",
3. R.C.Gonsales Woods and Steven L. Eddins, "Digital
R.E. Image processing Using Matlab"
Pearson Education

.
Sro
J
Electives III
MTCS-203 (A): Mobile Computing (2-1-0) Credit 04
Objective: To provide the knowledge about the concepts of mobility management for mobile
devices.
Unit - I
Introduction, issues in mobile computing, overview of wireless telephony: cellular concept,
GSM: air-interface, channel structure, location management: HLR-VLR, hierarchical, handotts,
channel allocation in cellular systems, CDMA, GPRS.

Unit -II 802.11, Blue Tooth,


Wireless Networking, Wireless LAN Overview: MAC issues. IEEE
Wireless multiple access protocols, TCP over wireless, Wireless applications, data broadcasting.
Mobile IP, application environment, applications.

Unit III for mobile


Data management issues, data replication for mobile computers, adaptive clustering
wireless networks, File system.

Unit - IV
processing in mobile
and fault tolerance, transaction
Mobile Agents computing, security state routing
computing environment, localization. MAC issues, Routing protocols, global
(GSR). QoS and its applications.

References:
1.J. Schiller, Mobile Communications, Addison Wesley.
2. Charles Perkins, Mobile IP, Addison Wesley.
3. Charles Perkins, Ad hoc Networks, Addison Wesley
4. Upadhyaya, "Mobile Computing", Springer
Credit 04
MTCS-203 (B): Object Oriented Software Engineering (2-1-0)
software
of development.
Objective: To provide the knowledge of advance techniques
Unit I
Introduction to Software Engineering:
Life Cycle Models, Standards for developing life cycle
Software Engineering Development, Software
models.
Elicitation:
Object Methodology & Requirement Overview of Requirements Elicitation, Requirements
Introduction to Object Oriented Methodology, Elicitation
Requirements Elicitation Activities, Managing Requirements
Model-Action & Use cases,

Unit II
Architecture:
Model, Test
Model Architecture, Requirements Model, Analysis Model, Design Model, Implementation
Model
Modeling with UML:
Model of UML, Basic Structural Modeling, UML
Basic Building Blocks of UML, A Conceptual
Diagrams

Shol.
Unit IlI
System Analysis:
Analysis Model, Dynamic Modelling & Testing
System Design:
Design concepts & activities, Design models, Block design, Testing

Unit IV
Testing Object Oriented Systems:
Introduction, Testing Activities & Techniques, The Testing Process, Managing Testing, State Based
testing and Data flow testing for Classes. Component Based Computing
Fundamentals: Definition and nature of components, components and interfaces, Interfaces as contracts.
the benefits of components.
Basic Techniques: component design and assembly, Relationship withthe client-server model and with
patterns. Use of objects and object lifecycle services, use of object brokers

Text Books:
1. Ivar Jacobson "Object Oriented Software Engineering: A Use Case Driven Approach", Addison-
Wesley, 2002
Grady Booch "Object-Oriented Analysis and Design with Applications", 2/E, Addison-Wesley
Professional, 2005
Reference Books:
Engineering" 7/E Tata McGraw Hill,
1. Stephen R. Scach, "Object Oriented and Classical Software
1999
Booch. Rumbaugh & Jacobson "The Unified Modeling Language User Guide", Addison-Wesley
2 2005
Bernd Bruegge, Allen H. Dutoit "Object Oriented Software Engineering: Using UML, Patterns
3
and Java" 2/E Pearson Education.
Software Engineering: Practical
4. Timothy C. Lethbridge, Robert Laganiere "Object oriented
Software development using UML and Java" McGraw Hill
Edwards Yourdon, Carl Argila "Case Studies in Object Oriented Analysis and Design" Prentice

Hall.

MTCS-203 (C): Neural Network (2-1-0) Credit 04


of machine learning through artificial neurons.
Objective: To provide the knowledge
UnitI
Architecture classification, Neural Models. Learning Paradigm and Rule,
Biological analogy,
single unit mapping and the perception.

Unit II
back propagation, variation on
Feed forward networks Review of optimization methods,
-

of FFANN's Generalization.
Backpropagation, FFANN mapping capability, properties

Unit 111
PCA, SOM, LVQ, Adaptive Resonance Networks.
RBF Networks.
Hopfield Networks, Associative Memories,

Shal
Unit IV
Applications of Artificial Neural Networks: Regression, applications to function approximation,
Classification, Blind Source Separation.
Text Book:
.
Haykin S., Neural Networks-A Comprehensive Foundations", Prentice-Hall
International, New Jersey, 1999.

References:
. Anderson J.A., "An lIntroduction to Neural Networks", PHI, 1999.
Hertz J, Krogh A, R.G. Palmer, "Introduction to the Theory of Neural Computation",
Addison-Wesley, California, 1991.
Hertz J. Krogh A. R.G. Palmer, "Introduction to the Theory of Neural Computation",
Addison-Wesley, California, 1991.
5. Freeman J.A. D.M. Skapura, "Neural Networks: Algorithms, Applications and
Programming Techniques", Addison-Wesley, Reading, Mass, (1992).

MTCS-204: Seminar* Credit 04


(2-1-0)
Seminar topic shalll be selected from the emerging from the technical / research areas; internal
evaluation shall be done on the basis of review of literature, content quality, understanding of the

and the presentation. End term evaluation will be done on the basis of report submitted by
topic
the students along with viva-voice.

MTCS-205: Programming Lab-Il (2-1-0) Credit 04


Lab based on Paper MTCS-203

MTCSOE-201: Object Oriented Concepts with C++ (2-1-0) Credit 04


To provide the knowledge of implementation of object oriented programming
Objective:
concepts through C++
UNIT I

benefits of OOP, applications of OOP


Principles of 0OP: Programming paradigms, basic concepts,
basic data types, type casting, type modifiers,
Introduction to C++: History of C++, structure of C++,
structures, input and output statements
in C++. Classes and objects: class
operators and control
resolution operator, access qualifiers, instance
specification, member function specification, scope
creation.

UNIT-II
function components, passing parameters, call by reference,
Functions: Function prototyping,
default arguments, overloaded function. Pointers: Array of
returm by reference, inline functions,
objects. pointers to objects,this dynamic allocation operators, dynamic objects.
pointer,

S h a l
UNIT III
Constructors: Constructors, parameterized constructors, overloaded constructors, constructors
with default arguments, copy constructors, static class members and static objects. Operator
friend
overloading: Overloading unary and binary operator, overloading the operator using
function, stream operator overloading and data conversion.

UNIT IV
with private inheritance,
Inheritance: Defining derived classes, single inheritance. protected data
inheritance, hybrid inheritance, multi
multiple inheritance, multi-level inheritance, hierarchical abstract classes, virtual function and
base class,
path inheritance, constructors in derived and
dynamic polymorphism, virtual destructor.

Suggested Reading India Professional


1. Complete Reference of C++ by Herbert Schilde,
C++ By E.Balagunuswamy, TMH
2. Object Oriented Programming with
Pearson
3. Object Oriented Turbo C Plus Plus by Robert Lafore,
Plus Plus by D.RaviChandra, India Higher Education
4. Programming with C

IIISemester
Credit 06
MTCS-301 Theory of Computation (3-1-0)
of expressions and design machines
Objective: To provide the knowledge of understanding

Unit-I Finite Union,


automata,
finite
and Automata: Regular languages,
Regular expressions Finite automata, Kleene's theorem. Regular &
Non deterministic
Intersections & complements. Pumping lemma,
minimal Finite Automata,
Criterion for regularity,
Non regular languages:
Decision problems, languages
& computers.

Unit-II
CFG for algebraic
Derivation Trees & Ambiguity. An Unambiguous
Context-free grammars: Deterministic
forms and normal forms. Pushdown Automata: Definition,
expressions, simplified to a given context-free grammar, context-free
A PDA corresponding
pushdown automata,
to a given PDA. parsing.
grammar corresponding
Unit-III
The pumping lemma for context-free languages,
Context-free and
Non-Context-free languages: context-
decision problems involving
Intersections & complements
of context-free languages,
free languages.
Turing Thesis.

Text books
1. Introduction to languages & the theory of computation by John C Martin. Tata Mc itaw Hill
publication Co. Ltd., 3rd edition, 2004.
Engineering & Computer Science
2. Narsingh Deo -

Graph Theory with Applications to


Prentice Hall of India.
3. K.S. Trivedi Probability and Statistics with
-
Reliability and Queuing and Computer Science
Applications, Prentice Hall of India.
Reference Books and
I. John E Hopcroft and Jefrey DUllman Introduction to Automatatheory. Languages
-

Computation Narosa Publication House, 2004.

Elective-IV
Credit 06
MTCS-302 (A) Advanced Operating System (3-1-0)

Objective: CPU
Define. explain, and systems concepts: process management.
apply operating
file system, and the like.
scheduling. synchronization, memory management.,

UNIT-I time-shared.
Structures Simple Batch. Multi programmed.
Operating System Introduction, Real-Time Systems, OS for multiprocessor
Personal Computer, Parallel, Distributed Systems,
services. System Calls, Virtual Machines.
machines ,System components, Operating-System
System Design and Implementation
Classification of Memory Management. Static and Dynamic
Memory Management
-

Objectives, in Each
& Segmentation. Address Translation. Fragmentation
Memory, Compaction, Paging
Case, Performance and Comparison.

UNIT-II Faults and


Methods of Implementation. Demand Paging. Page
Virtual Memories-Aims and
Algorithms, Prepaging. Comparisons.
System Performance, Page Replacement
and File System. File System
Characteristics. Access and
Information Management, Files
Disk scheduling VO.
Allocation Methods, Disk Management.

UNIT-III Processor and Concurrent Process.


Process States, State Diagram.
Process Management
-

Conditions, Prevention. Avoidance.


Scheduler, Scheduling Algorithms, Deadlock Necessary - Section and Its S W.
Synchronization of Process, Concurrency. Critical
Detection and Recovery, and Protection
and Semaphore Solution. Classical Examples on Semaphore. Security
H/W
Issues.
M
S r a l e
UNIT-IV
Editor-vi, Shell Bourne, Korn.c
UNIX Case Study: UNIX System Architecture, Commands, of security
UNIX-C Interface, Ilustrations
shell and Bash shel1. Shell scripts, Utilities, The
model of UNIX and other OSs

Suggested Readings: System Concepts,


Fifth Edition,
1.Abraham Siberschatz and Peter Bacr Galvin,
"Operating
Addision-Wesley. Graw-Hill
and Design", Mc
2.Milan Milankovic, "Operating System, Concepts
Addision-Wesley.
3.Harvey M Deital, "0perating System", Referece", Osborne Mc Graw-Hil
4.Richard Peterson, "Linux: The Complete
Guide", BPB
5.Parata, "Advanced Unix Programming
6.Yashwant Kanitkar, "Unix Shell
Programming", BPB 1986.
System" Prentice Hall of India.
7. M. J. Bach "Design of the Unix Operating ,

Graw-Hill.
Applications", Mc
8.Sumitabha Das, "UNIX Concepts and

Credit 06
MTCS-302 (B) Soft Computing (3-1-0)
and fuzzy logic
the knowledge of neural network, genetics algorithm
Objective: It provide

UnitI
ANN
Neural Networks: Mathematical Models of Neurons,
of biological Neuro-system, and reinforcement
History, overview Paradigms-Supervised, Unsupervised
architecture, Learning rules, Learning rules, Delta, Back Propagation
Algorithms-perceptions, Training
Learning, ANN training Networks, Associative
Memories,
Perceptron Model. Hopfield
Algorithm, Multilayer
Artificial Neural Networks.
Applications of

Unit II
Fuzzy Logic: of Classical Sets, Membership
Introduction to Fuzzy Logic,
Fuzzy Sets: Overview
Classical and Unions,
Sets, Compliment, Intersections,
rule generation, Operations on Fuzzy Numbers,
Function, Fuzzy Arithmetic, Fuzzy
Aggregation Operations, Fuzzy
Combinations of Operations,
on Intervals &
Numbers, Lattice of Fuzzy Numbers,
Arithmetic Operations
Linguistic Variables,
Fuzzy Equations.

Unit III
Classical Logic:
Multivalued Logics, Fuzzy Propositions,
Fuzzy Qualifiers, Linguistic Hedges. of
Nonspecificity Fuzzy & Crisp
based Information, Information & Uncertainty, Architecture of Neuro
Uncertainty Introduction of Neuro-Fuzzy Systems,
Sets,
Sets, Fuzziness of Fuzzy Medicine, Economics etc.
Networks, Application of Fuzzy Logic,
Fuzzy

M
Shal
Unit IV
Genetic Algorithm: (iA
Implementation of
An Overview,
GA in problem solving.

Text Books:
Networks", Anderson
J.A., PHI, 1999, R.G. Palmer,
"An Introduction to
Neural Hertz J. Krogh,
. ofl Neural Computation",
"Introduction to the Theory
Addison-Wesley, Calilornia, 199 PHI, 1995.
Logic", G.J. Klir & B, Yuan, 1998.
"Fuzzy Sets & Fuzzy Mclanie Mitchell,
Algorithm",
PHI,
Introduction to Genetic
"An

International, New
Reference Books: Prentice-Hall
Foundutions",
Comprehensive
"Neural Networks-A
Freeman
Jersey, 1999. Techniques",
and Programming
Algorithms, Applications
"Neural Networks: Mass, (1992).
Addison Wesley, Reading,
J.A. & D.M. Skapura,
Credit: 06
Steganography (3-1-0)
and
MTCS-302 (C) Cryptography

stegnography
Objective Cryptography and
understand the Advances of
To help students

techniques,
UNIT 1 mechanism, Symmetric Encryption
attacks, services and of DES, Advanced
Encryption
security
Introduction to
and Linear Cryptanalysis
DES, Strength of DES, Differential
Block Cipher Modes of operation.
and RC4,Block Cipher Principles,
Standard, Stream Cipher
Implementing RSA, Attacks
UNIT 2
Key Cryptosystem, RSA System, Public
Cryptography: Public :Distribution of Public Keys,
Public Key Key Management
Curve Cryptography,
on RSA, Elliptic Diflie-Hellamn Key Exchange.
Key distribution of secret keys,
Theorem, Primality Testing,
UNIT 3 Fermat's & Euler's
Euler's Totient Function, Authentication Application:
Number Theory: Arithmetic. Hash Function and
and Field, Modular Decure Hash Algorithm,
SHA-1, SHA-512,
Group, Ring of Hash function, MD5,
Hash Functions, Security
Whirlpool. Kerberos and
UNIT 4 Authentication Protocols,
Standard,
Signature
Digital Signature. Digital
Electronic Mail security,
IP security, Web security.
X.509.Steganography,

UNIT 5 Steganography, Notation And


Introduction to
Forensics, System Security, Cachin's Definition of
Concept of Computer methods, Steganalysis,
Practical steganographic of
Terminology. and Testing Steganographic Systems, Applications
Evaluating
Steganographic Security,
Steganography.

M
Shal
Suggested readings
1. William
Stallings, *

2. Behrouz A ForouzanCryptography and Network Sceurity", Fifth Edition, Pearson Education.


"Cryptography & Network Security", Special Edition,2007,TMH
3. Ingemar J.Cox, Matthew
,

L. Miller,
Jeffrey A.Bloom, Jessica Fridrich and Ton Kalker,
Digital Watermarking and Steganography", Secon Edition Morgon Kaufmann.

Elective-V
MTCS-303 (A) Big Data Analyties (2-1-0) Credit 04

Objective:
Understand the Big Data Platform and its Use cases
Provide an overview of Apache Hadoop
Understand Map Reduce Jobs

NIT I: INTRODUCTION TO BIG DATA AND HADOOP


Types of Digital Data, Introduction to Big Data, Big Data Analytics, History of Hadoop, Apache
Hadoop. Analysing Data with Unix tools, Analysing Data with Hadoop. Hadoop Streaming,
Hadoop Echo System. IBM Big Data Strategy, Introduction to Infosphere Biglnsights and Big
Sheets.
UNIT II: HDFS(Hadoop Distributed File System)
The Design of HDFS, HDFS Concepts, Command Line Interface, Hadoop file system interfaces,
Data flow, Data Ingest with Flume and Scoop and Hadoop archives, Hadoop 1/0: Compression,
Serialization, Avro and File-Based Data structures.
UNIT III: Map Reduce
Shuffle and Sort, Task Execution.
Anatomy of a Map Reduce Job Run, Failures, Job Scheduling.
Features.
Map Reduce Types and Formats, Map Reduce
Unit IV: Hadoop Eco System
Modes of Pig. Comparison of Pig with Databases. Grunt,
Pig Introduction to PIG, Execution
Data Processing operators. Hive Hive Shell, Hive Services,
Pig Latin, User Defined Functions, Traditional Databases, HiveQL, Tables, Querying Data and
Hive Metastore, Comparison with
User Defined Functions.

Suggested Readings 2012.


1. Tom White
"
Hadoop: The Definitive Guide" Third Edit on, O'reily Media,
2015.
2. Seema Acharya, Subhasini Chellappan, "Big Data Analytics" Wiley
Data Springer, 2007.
Analysis",
3. Michael Berthold. David J. Hand, "Intelligent
Analytics" Auerbach Publications, CRC press
Liebowitz. "Big Data and Business
4 Jay
(2013) Data
Mark Hornick, "Using R to Unlock the Value of Big Data: Big
Tom Plunkett,
and Oracle R Connector for Hadoop", McGraw
5.
Analytics with Oracle R Enterprise
Oracle press.
Hil/Osborne Media (2013),
Massive Datasets'", Cambridge
David Ulman, "Mining of
6. Anand Rajaraman and Jef rey
University Press, 2012.
J n

S
Shal
MTCS-303 (B) Internet of Things (2-1-0) Credit 04

Objective:
To help student understand the basic concept of loT
Analyze basic protocols in wireless sensor network
Unit 1
of loT, Logical design
Introduction to loT Defining loT, Characteristics of loT, Physical design
& APls. loT & M2M Machine to
of loT, Functional blocks of loT, Communication models
define Network
Machine, Difference between IoT and M2M, Software
Unit 2
medium access issues, MAC protocol survey,
Network & Communication aspects Wireless &
& Node discovery, Data aggregation
Survey routing protocols, Sensor deployment Security
dissemination. in loT Design challenges, Development challenges,
Challenges
challenges, Other challenges
Unit 3 Surveillance
Domain specific applications of loT Home automation, Industry applications,
applications, Other loT applications
Unit 4 loT tools, Developing
Introduction to different
Developing loTs Introduction to Python, embedded system
sensor based application through
applications through loT tools, Developing
with python
platform, Implementing loT concepts

Suggested Readings
"Internet of Things: A Hands-On Approach
1. Vijay Madisetti, Arshdeep Bahga, Sensor Networks:
Poellabauer, "Fundamentals of Wireless
2. Waltenegus Dargie,Christian
Theory and Practice"

Credit 04
MTCS-303 (C) Machine Learning (2-1-0)
and
To formulate machine learning problems
corresponding to different applications
Objective: impacts the accuracy of a system.
to assess how the choice of a machine-learning algorithm
Unit I: and Statistics, Overview of target
Introduction of Machine Learning, Basics of Linear Algebra
representations; Supervised and unsupervised
learning
function
Unit I1: K-Means,
Mean Square and Recursive Least Square Algorithms; Clustering:
Regression-Least and
Hierarchical, and Density-based Clustering,
Spectral Clustering. Decision Tree, Overfitting
Kernel; Noise, bias-variance trade-
Pruning, Logistic regression,Support Vector Machine and
off, under-fitting and over-fitting concepts.
Unit III: Functional
Neural Network, Multilayer Perceptron, Back Propagation Learning,
Single Layer Recurrent Neural
and Radial Basis Function Network,
Link Artificial Neural Network,
Convolutional Neural Networks.
Networks, Deep Learning,

S S h a l ..
Unit IV
Genetie Algorithm, Schemata
Ant Colony Optimization, Theorem, Differential Evolution, Particle Swarm Optimization,
Text and References: Convergence Analysis.
. Tom Mitchell, "Machine
Shalev-Shwartz, andLearning",
2. Shai Latest Edition, Mc-Graw Hill.
Shai Ben-David,
Cambridge University Press, 2017 "Understanding Machine Learning"
3. Haykin S., Neural Networks and
Learning Machines, Third Edition, Prentice Hall, 2008
MTCS-304 Dissertation*
*
Dissertation shall be done under the Credit 08
shall pursue the dissertation supervision of guide allotted by the Department. Students
work by reviewing the relevant
research arcas. Evaluation shall be literature of his / her interest and
done based on
understanding/ formulation of
presentation covering future action plans. Topic of research
submission of report and ideas,
dissertation shall be finalized. final semester,

Ivih Semester
MTCS-401: Presentation of
Progress Report* Credit 04
MTCS402: Dissertation **
Credit 20
*A mid term presentation will be held to discuss the progress of each student.
**Two copies of dissertation report shall be submitted in the
in pdf format.
department along with its soft copy

Sol
DEPARTMENT OF COMPUTER SCIENCE
DETAILED SYLLABUS
OPEN ELECTIVE (M. Tech.
(Computer Science))
SEMESTER I

MTCSOE-101 INTRODUCTION TO COMPUTER NETWORKS CREDIT: 04 (2-1-0)


Objective
To provide the knowledge about the basic concept of computer networks,
Unit 1

Definition Of A Computer Network; What ls A Network? Components Of A Computer Network: Use Of Computer
Networks; Networks For Companies, Networks For People, Social Issues, Network Classification; Types Of
Transmission Technology, Local Area Networks, Metropolitan Arca Networks, Wide Area Networks, Wireless Networks,
Design Issues For The Layers, Types Of Service To The Layers, OSI Model.

Unit I1
The Telephone System. Data Link
Physical Layer: Guided Transmission Media, Wireless Transmission, Structure Of
Provided To The Network Layer, Error Detection
Layer (Logical Link Layer): Data Link Layer Design Issues: Services
And Correction Data Link Protocols: Stop-And-Wait Protocol, Sliding Window Protocols.

Unit II
Problem: Statie Channel Allocation And Dynamic Channel
Medium Access Control Sub Layer: Channel Allocation
Carrier Sense Multiple Access Protocols, Ethernet, Bluetooth, Repeaters,
Allocation, Multiple Access Protocols Aloha,
Algorithms, Shortest Path Routing, Flooding, Congestion
Hubs, Bridges, Switches, Routers And Gateways. Routing
Control.

Unit IV
DNS-The Domain Name
Of Transport Protocols, Application Layer:
Transport Layer: Transport Service, Elements
World Wide Web, And Multimedia.
System, Electronic Mail,

Suggested Reading
Networks, 4 th Edition", PHI
1. A.S. Tanenbaum, "Computer
Communication", Macmillan Press
"Data And Computer
2. W. Stallings,
Networks & Internet", PHI
3. Comer, "Computer
With Tep/lp", PHI
4. Comer, "Internetworking
Communication And Networking", TMH
5. Forouzan, "Data

Sal
eESTER IND

CsOE-201 OBJECT ORIENTED CONCEPTS WITH C+ CREDIT: 04 (2-1-0)


Course objective:

To understand basic concepts and syntax of C++ programming Language


UNIT- I

Principles of OOP: Programming paradigms, basic concepts, benefits of oOP, applications of OOP Introduction to C++
History of C+-, structure of C+, basic data types, type casting, type modifiers, operators and control structures, input
and output statements in C++. Classes and objects: class specification, member function specification, scope resolution
operator, access qualifiers, instance creation.

UNIT-II

Functions: Function prototyping, function components, passing parameters, call by reference, retun by reference, inline
functions, default arguments, overloaded function. Pointers: Array of objects, pointers to objects, this pointer, dynamic
allocation operators, dynamic objects.
UNIT - III

Constructors: Constructors, parameterized constructors, overloaded constructors, constructors with default arguments,

copy constructors, static class members


and static objects. Operator overloading: Overloading unary and binary operator,
and data conversion.
overloading the operator using friend function, stream operator overloading
UNIT -IV
inheritance,
Inheritance: Defining classes, single inheritance, protected data with private inheritance, multiple
derived
multi path inheritance, constructors in derived and
multi-level inheritance, hierarchical inheritance, hybrid inheritance,
function and dynamic polymorphism, virtual destructor.
base class, abstract classes, virtual

Suggested Reading
Herbert Schilde, India Professional
1. Complete Reference of C++ by
with C+t By E.Balaguruswamy, TMH
2. Object Oriented Programming
Robert Lafore, Pearson
3. Object Oriented Turbo C Plus Plus by
Plus Plus by D.RaviChandra, India Higher Education
4. Programming with C

Shale

You might also like