
8/3/2019 B.tech Final Syllabus (1)
1/24
Mewar University, Chittorgarh
Teaching & Scheme of Examination for B.Tech. (Computer
Engineering)
Sem
Lecture
r
credit L T P
III
Introduct
ion of
OOPs
4 ( 3 0 2)
Data
Communi
cation
3 ( 3 0 0)
Digital
Electroni
cs
4 ( 3 0 2)
Maths3
4 ( 3 1 0)
Data Structure
and Algorithms
4 (3 0 2)
Software
Engineering
4 (3 0 2)
Creative
Arts/NSS/
Discipline/
Sports
2
Persona
lity
Develo
pment
2
6 27 18 1 8
IV
Advance
d
Software
Engg.
4 (3 0 2)
Computer
Network
4 (3 0 2)
Discrete
Mathem
atics
4 (3 1 0)
Fundam
entals of
Java
4 (3 0 2)
Microprocessors
& Microcontroller
4 (3 0 2)
Operating
System
3(3 0 0)
Creative
Arts/NSS/
Discipline/
Sports
2
Persona
lity
Develo
pment
2
6 27 18 1 8
V
Database
Manage
ment
System
4 (3 0 2)
Electronic
Devices &
Circuits
4 (3 0 2)
Compute
r
Organiza
tion
3 (3 0 0)
Compute
r
Graphics
4 (3 0 2)
Algorithm Design
4 (3 0 2)Elective1
Creative
Arts/NSS/
Discipline/
Sports
2
Persona
lity
Develo
pment
2
6 27 18 1 8
Elective1
Elective1
Slno Subject Course Branch Semester
1 Web technologies BTech Cs Fifth2 Real Time System BTech Cs
Fifth
3 Mobile Computing BTech Cs Fifth
4 Software Testing Methodologies BTech Cs Fifth

8/3/2019 B.tech Final Syllabus (1)
2/24
Object Oriented Programming using C++
Credit 4 ( 3 0 2)
Sub Code: CP221
Unit I :Introduction to computer Languages, Review
objectoriented programming, The Origins of
C++, comparison between procedural programming paradigm and
objectoriented programming
paradigm, Object Oriented Programming Principles, Namespace,
data types and Operators, Control
Statements.
Unit II : Function and Operator Overloading concepts,
Introduction to classes and objects, access
specifies: public, private, and protected, nested classes,
Inheritance, Constructors and destructors,
Friend function.
Unit III :Inline Functions, Arrays, constructor overloading,
function overriding, virtual function, pure
virtual function concepts, introduction to abstract class.
Unit IV :Exception Handling Fundamentals, Handling DerivedClass
Exceptions, throwing mechanism,
catching mechanism, rethrowing an exception ,The uncaught
exception() Function.
Unit V : Old vs. Modern C++ I/O, C++ Streams, and the File
Classes, Opening and Closing aFile, Reading and Writing Text Files,
Unformatted and Binary I/O, More get() Functions, getline(),
peek() and putback(), Detecting EOF.
Books:
1. Herbert Schildt, The Complete Reference C++, Tata Mcgraw Hill
publications.2. Robert Lafore, ObjectOriented Programming in C++,
The Waite groups, galgotia
publications Pvt. Ltd.
3. Bruce Eckel, Thinking in C++, 2nd Ed., Wall 1, Wall 2.4.
Danny Kalev, The ANSI/ISO C++ Professional programmers Handbook,
PHI 2000.5. Deital & Deital, C++ How to Programme, Prentice
Hall 5th Ed.6. John R. Hubbart, Programming with C++, Schaums
Outline Series 2nd Ed.

8/3/2019 B.tech Final Syllabus (1)
3/24
Data Communications
Credit 3 ( 3 0 0)
Sub Code: CP222
Unit I: An Introduction to Data Communications:
A Communications Model, Data Communications and Data
Communications Networking,
Protocols and Protocol Architecture, Characteristics of Data
Transmission: Concepts and
Terminology, Analog and Digital Data Transmission, Transmission
Impairments
Unit II : Transmission Media:
Guided Transmission Media, Wireless Transmission Data Encoding,
Digital Data, Digital Signals,
Digital Data, Analog Signals, Analog Data, Digital Signals,
Analog Data, Analog Signals
Unit III: The Data Communication Interface:
Asynchronous and Synchronous Transmission, Line Configurations,
Interfacing. Data Link
Control Flow Control, Error Detection, Error Control, HighLevel
Data Link Control (HDLC), Other
Data Link Control Protocols.
Unit IV : Data Communications Hardware Terminals:
Introduction, Basic Terminal Components, Enhanced Terminal
Components, GeneralPurpose
Terminals, Remote Job Entry Terminals, Transaction Terminals,
Clustering of Terminal Devices.
Communications Processing Hardware Introduction, Switching
Processors, Multidrop Lines,
Multiplexers, Concentrators, FrontEnd Processors.
Unit V:Modems:
Network Attachment and Regulations, Line Conditioning and Leased
Lines, Modems and
Modem Circuits. Multiplexing: FrequencyDivision Multiplexing,
Synchronous TimeDivision
Multiplexing: Characteristics, TDM Link Control, Digital Carrier
Systems Statistical TimeDivision
Multiplexing: Characteristics.
Text Books:
1. William Stallings, Data and Computer Communications, 7th
Edition, Pearson Education Inc.,
2004
2. Mary E.S. Loomis, Data Communications, PHIN.J.,1983 (Chapter
3, Chapter 5)
3. Paul Bates, Practical Digital and Data Communications,
PHIN.J, 1987 (Chapter5)
Reference Books:
1. Behrouz A. Forouzan, Data Communications and Networking, 3rd
EditionTMH, 2004
2. William A. Shay, Understanding Data Communications &
Networks, 2nd Edition ThomsonBrooks/Cole  Vikas publishing House,
1999
3. Michale A. Miller, Data & Network Communications,
Thomson/Delmar  Vikas Publishing
House, 2000

8/3/2019 B.tech Final Syllabus (1)
4/24
Digital Electronics
Credit 4 ( 3 0 2)
Sub Code: EC223
UNIT I : Digital system and binary numbers:
Binary Arithmetic & Radix representation of different
numbers. Signed binary numbers, binary
codes, cyclic codes, error detecting and correcting codes,
hamming codes. Features of logic
algebra, postulates of Boolean algebra. Theorems of Boolean
algebra. Boolean function.
Floating point representation Gatelevel minimization: The map
method up to five variable,
dont care conditions, POS simplification, NAND and NOR
implementation, Quine McClusky
method (Tabular method).
UNIT II: Combinational Logic
Combinational circuits, analysis procedure, design procedure,
binary addersubtractor, decimal
adder, binary multiplier, magnitude comparator, Binary serial
and parallel adders. BCD adder.
Decoder: Binary to Gray decoder, BCD to decimal, BCD to
7segment decoder. multiplexer,
demultiplexer, encoder. Octal to binary, BCD to excess3
encoder. Diode switching matrix.
Design of logic circuits by multiplexers, encoders, decoders and
demultiplexers.
UNIT III: Sequential System:
Latches, flipflops, RS, D, JK, Master Slave flip flops.
Conversions of flipflops. Counters :
Asynchronous (ripple), synchronous and synchronous decade
counter, Modulus counter,
skipping state counter, counter design. Ring counter. Counter
applications. Registers: buffer
register, shift register.
UNIT IV : Memory and programmable logic
RAM, ROM, PLA, PAL. Design at the register transfer level: ASMs,
design example, design with
multiplexers.
UNIT V: Digital Logic Gate Characteristics
TTL logic gate characteristics. Theory & operation of TTL
NAND gate circuitry. Open collector
TTL. Three state output logic. TTL subfamilies. MOS & CMOS
logic families. Realization of logic
gates in RTL, DTL, ECL, CMOS & MOSFET. Interfacing logic
families to one another.
Text Book:
M. Morris Mano and M. D. Ciletti, Digital Design, 4th
Edition, Pearson Education
S.K. Kapoor, Digital Electronics Design & Fundamentals,
PHI

8/3/2019 B.tech Final Syllabus (1)
5/24
Mathematics III
Credit 4 ( 3 1 0)
Sub Code: MA210
UNIT I: Language of Logic:
Proposition, Compound Proposition, Conjunction, Disjunction,
Implication, Converse, Inverse
& Contrpositive, Biconditional Statements, tautology,
Contradiction & Contingency, Logical
Equivalences, Quantifiers, Arguments.
UNIT II: Proof Methods:
Vacuous, Trivial, Direct, Indirect by Contra positive and
Contradiction, Constructive & Non
constructive proof, Counterexample. The Division Algorithm,
Divisibility Properties (Prime
Numbers & Composite Numbers), Principle of Mathematical
Induction, The Second Principle ofMathematical Induction,
Fundamental Theorem of Arithmetic.
Algorithm Correctness:
Partial Correctness, Loop Invariant. Testing the partial
correctness of linear & binary search,
bubble & selection sorting.
UNIT III: Graph Theory:
Graphs Directed, Undirected, Simple,. Adjacency & Incidence,
Degre of Vertex, Subgraph,
Complete graph, Cycle & Wheel Graph, Bipartite &
Complete Bipartite Graph, Weighed Graph,
Union of Simple Graphs. Complete Graphs. Isomorphic Graphs,
Path, Cycles & Circuits Euclerian
& Hamiltonian Graphs.Planar Graph: Kuratowskis Two Graphs,
Eulers Formula, Kuratowskis Theorem.
Trees: Spanning trees Kruskals Algo, Finding Spanning Tree
using Depth First Search, Breadth
First Search, Complexity of Graph, Minimal Spanning Tree.
UNIT IV:
Sets: Definition and types, Set operations, Partition of set,
Cardinality (InclusionExclusion &
Addition Principles), Recursive definition of set.
Functions: Concept, Some Special Functions (Polynomial,
Exponential & Logarithmic, Abslute
Value, Floor & Ceiling, Mod & Div Functions), Properties
of Functions, Cardinality of Infinite Set,
Countable & Uncountable Sets, The Pigeonhole &
Generalized Pigeonhole Principles,Composition of Functions.
UNIT V: Relations: Boolean Matrices, Binary Relation, Adjacency
Matrix of Relation, Properties
of Relations, Operations on Relations, The Connectivity
Relations, Transitive ClosureWarshalls
Algorithm, Equivalence relations Congruence Relations,
Equivalence Class, Number of
Partitions of a Finite Set, Partial & Total Orderings

8/3/2019 B.tech Final Syllabus (1)
6/24
Data Structure and Algorithm
Credit 4 (3 0 2)
Sub Code: CP223
UNIT I: Algorithm complexity and Big O notation, recursion and
its importance, Tower of Hanoi
problem, Dynamic Memory Allocation concepts and functions
(malloc, calloc, realloc).
UNIT II: Linked List: concepts, basic operations on single
linked list, double linked list basics and
operations, array and dynamic representation linked lists.
Queue : Sequential representation, operations, priority queues,
and array implementation.
UNIT III: Stack: Concept, operations and representation,
application to evaluation of postfix
expressions, conversion from infix to postfix
representation.
Trees: definition, array and dynamic representations,
operations, threaded binary trees, AVL trees,heaps, B tree,Red
Black tree.
UNIT IV: Graphs: Representation of graphs, breadthfirst search,
depthfirst search, applications of
graphs.
Searching: Sequential searching, binary search.
UNIT V: Sorting: Bubble sort,Insertion sorting, Quick sort,
Selection sort.
Randomized Algorithms, Point location problem, convex hulls and
Voronoi diagrams,
Books:
1. Schaums Outlines Data structure Seymour Lipschutz Tata McGraw
Hill.2. Horowitz and Sahani, Fundamentals of data Structures,
Galgotia Publication Pvt. Ltd.,
New Delhi.
3. A. M. Tenenbaum, Data Structures using C & C++,
PrenticeHall of India Pvt. Ltd., NewDelhi.
4. Motwani and Raghavan "Randomized Algorithms", Cambridge
University Press.5. Mehlhorn "Data Structures and Algorithms: 1,
Searching and Sorting", Springer Verlag
EATCP Monograph on Theoretical Computer Science.

8/3/2019 B.tech Final Syllabus (1)
7/24
Subject: Software Engineering
Credit 4 (3 0 2)
Sub Code: CP224
UNIT I
System Analysis: Characteristics, System Development Life cycle
(SDLC) , Problems in
system Development.S/W Engineering Paradigm Introduction, life
cycle models (water fall,incremental, spiral, WINWIN spiral,
evolutionary, prototyping, object oriented)  system
engineering computer based system verification validation life
cycle process
development processsystem Engineering hierarchy.
UNIT II
SOFTWARE REQUIREMENTS :Functional and nonfunctional  user
systemrequirement
engineering process feasibility studies requirements elicitation
validation and
managementsoftware prototyping prototyping in the software
process rapid prototyping
techniques user interface prototyping S/W document. Analysis
and modeling data,
functional and behavioral models structured analysisDFD,CFD and
data dictionary.
UnitIII
Software Design: Design fundamentals, system design,detailed
design, Effective modular
design, Data architectural and procedural design, design
documentation, Coding
Programming style, Program quality, quantifying program quality,
User interface design, design
level matrics.
Unit IV
Software quality : software quality metrics and
reliability,Software Quality Assurance
Object Oriented Design: Class and object relationships, object
modularization, introduction toE R diagram,Introduction to Unified
Modeling Language.
UNIT V
TESTING :
Taxonomy of software testing levels test activities types of s/w
test black box testing
testing boundary conditions structural testing test coverage
criteria based on data flow
mechanisms regression testing testing in the large. S/W testing
strategies strategic
approach and issues  unit testing integration testing
validation testing system testing and
debugging.
SOFTWARE PROJECT MANAGEMENT :Measures and measurements S/W
complexity andscience measure size measure data and logic structure
measure
TEXT BOOK
1. Roger S.Pressman, Software engineering A practitioners
Approach, McGrawHill
International Edition, 5th edition, 2001.
REFERENCES
1. Ian Sommerville, Software engineering, Pearson education
Asia, 6th edition, 2000.
2. Pankaj Jalote An Integrated Approach to Software
Engineering, Springer Verlag, 1997.
3. James F Peters and Witold Pedryez, Software Engineering An
Engineering Approach, John
Wiley and Sons, New Delhi, 2000.

8/3/2019 B.tech Final Syllabus (1)
8/24
B.Tech. 3 Year 5 Semester

8/3/2019 B.tech Final Syllabus (1)
9/24
DATA BASE MANAGEMENT SYSTEMS
UNIT I :
Data base System Applications, data base System VS file System
View of Data Data
AbstractionInstances and Schemas data Models the ER Model
Relational Model OtherModels Database Languages DDL DML database
Access for applications Programs data
base Users and Administrator
Conceptual Design for Large enterprises.
UNIT II :
Introduction to the Relational Model Integrity Constraint Over
relations Enforcing Integrity
constraints Querying relational data Logical data base Design
Introduction to Views
Destroying /altering Tables and Views.
Relational Algebra Selection and projection set operations
renaming Joins Division
Examples of Algebra overviews Relational calculus Tuple
relational Calculus Domain
relational calculus Expressive Power of Algebra and
calculus.
UNIT III :
Form of Basic SQL Query Examples of Basic SQL Queries
Introduction to Nested Queries
Correlated Nested Queries Set Comparison Operators Aggregative
Operators NULL values
Comparison using Null valuesLogical connectivitys AND, OR and
NOT Impact on SQL
Constructs Outer Joins Disallowing NULL values Complex Integrity
Constraints in SQL
Triggers and Active Data bases.
UNIT IV :
Normalization, Transaction Concept Transaction State
Implementation of Atomicity and
Durability Concurrent Executions Serializability Recoverability
Implementation of
Isolation Testing for serializability LockBased Protocols
Timestamp Based Protocols
Validation Based Protocols Multiple Granularity.
UNIT V :
Recovery and Atomicity Log Based Recovery Recovery with
Concurrent Transactions
Buffer Management Failure with loss of nonvolatile
storageAdvance Recovery systems
Remote Backup systems.
File Organization and Indexing Cluster Indexes, Primary and
Secondary Indexes Index data
Structures Hash Based Indexing Tree base Indexing.
TEXT BOOKS :
1. Data base Management Systems, Raghurama Krishnan, Johannes
Gehrke, TATA McGrawHill
3rd Edition2. Data base System Concepts, Silberschatz, Korth,
McGraw hill, V edition.

8/3/2019 B.tech Final Syllabus (1)
10/24
REFERENCES :
1. Data base Systems design, Implementation, and Management,
Peter Rob & Carlos Coronel
7th Edition.
2. Fundamentals of Database Systems, Elmasri Navrate Pearson
Education
3. Introduction to Database Systems, C.J.Date Pearson
Education

8/3/2019 B.tech Final Syllabus (1)
11/24
COMPUTER ORGANIZATION
UNIT I :
BASIC STRUCTURE OF COMPUTERS : Computer Types, Functional unit,
Basic OPERATIONALconcepts, Bus structures, Software, Performance,
multiprocessors and multi computers. Data
Representation. Fixed Point Representation. Floating Point
Representation. Error Detection
codes.
UNIT II :
REGISTER TRANSFER LANGUAGE AND MICROOPERATIONS : Register
Transfer language.Register
Transfer Bus and memory transfers, Arithmetic Mircrooperatiaons,
logic micro operations, shift
micro operations, Arithmetic logic shift unit. Instruction
codes. Computer Registers Computer
instructions Instruction cycle.
Memory Reference Instructions. Input Output and Interrupt. STACK
organization.
Instruction formats. Addressing modes. DATA Transfer and
manipulation. Program control.
Reduced Instruction set computer.
UNIT III :
MICRO PROGRAMMED CONTROL : Control memory, Address sequencing,
microprogram
example, design of control unit Hard wired control.
Microprogrammed control.
COMPUTER ARITHMETIC : Addition and subtraction, multiplication
Algorithms, Division
Algorithms, Floating point Arithmetic operations. Decimal
Arithmetic unit Decimal Arithmetic
operations.
UNIT IV :
THE MEMORY SYSTEM : Basic concepts semiconductor RAM memories.
Readonly memories
Cache memories performance considerations, Virtual memories
secondary storage.
INPUTOUTPUT ORGANIZATION : Peripheral Devices, InputOutput
Interface, Asynchronous
data transfer Modes of Transfer, Priority Interrupt Direct
memory Access, InputOutput
Processor (IOP) Serial communication; Introduction to peripheral
component, Interconnect
(PCI) bus. Introduction to standard serial communication
protocols like RS232, USB, IEEE1394.
UNIT V :
PIPELINE AND VECTOR PROCESSING : Parallel Processing,
Pipelining, Arithmetic Pipeline,
Instruction Pipeline, RISC Pipeline Vector Processing, Array
Processors.
MULTI PROCESSORS : Characteristics or Multiprocessors,
Interconnection Structures,
Interprocessor Arbitration. InterProcessor Communication and
Synchronization Cache
Coherance.
TEXT BOOKS :

8/3/2019 B.tech Final Syllabus (1)
12/24
1. Computer Organization Carl Hamacher, Zvonks Vranesic,
SafeaZaky, Vth Edition, McGraw
Hill.
2. Computer Systems Architecture M.Moris Mano, IIIrd Edition,
Pearson/PHI
REFERENCES :
1. Computer Organization and Architecture William Stallings
Sixth Edition, Pearson/PHI
2. Structured Computer Organization Andrew S. Tanenbaum, 4th
Edition PHI/Pearson
3. Fundamentals or Computer Organization and Design,  Sivaraama
Dandamudi Springer Int.
Edition.
4. Computer Architecture a quantitative approach, John L.
Hennessy and David A. Patterson,
Fourth Edition Elsevier
5.Computer Architecture: Fundamentals and principles of Computer
Design, Joseph D. Dumas
II, BS Publication.

8/3/2019 B.tech Final Syllabus (1)
13/24
COMPUTER GRAPHICS
UNIT I :
Introduction, Application areas of Computer Graphics, overview
of graphics systems, video
display devices, rasterscan systems, random scan systems,
graphics monitors and workstations and input devices, Output
primitives : Points and lines, line drawing algorithms, mid
point circle and ellipse algorithms.Filled area primitives: Scan
line polygon fill algorithm,
boundaryfill and floodfill algorithms
UNIT II :
2D geometrical transforms : Translation, scaling, rotation,
reflection and shear
transformations, matrix representations and homogeneous
coordinates, composite transforms,
transformations between coordinate systems.
UNIT III :
2D viewing : The viewing pipeline, viewing coordinate reference
frame, window to viewport
coordinate transformation, viewing functions, CohenSutherland
and Cyrusbeck line clipping
algorithms, SutherlandHodgeman polygon clipping algorithm
UNIT IV :
3D object representation : Polygon surfaces, quadric surfaces,
spline representation, Hermite
curve, Bezier curve and BSpline curves, Bezier and BSpline
surfaces. Basic illumination models,
polygon rendering methods.
UNIT V :
3D Geometric transformations : Translation, rotation, scaling,
reflection and shear
transformations, composite transformations. 3D viewing :
Viewing pipeline, viewing
coordinates, view volume and general projection transforms and
clipping.
Computer animation : Design of animation sequence, general
computer animation functions,
raster animation, computer animation languages, key frame
systems, motion specifications.
TEXT BOOKS :
1. Computer Graphics C version, Donald Hearn and M.Pauline
Baker, Pearson Education.
2. Computer Graphics Principles & practice, second edition
in C, Foley, VanDam, Feiner and
Hughes, Pearson Education.
REFERENCES :
1. Computer Graphics, second Edition, Donald Hearn and M.Pauline
Baker, PHI/Pearson
Education.
2. Computer Graphics Second edition, Zhigand xiang, Roy
Plastock, Schaums outlines, TataMc Graw hill edition.

8/3/2019 B.tech Final Syllabus (1)
14/24
3. Procedural elements for Computer Graphics, David F Rogers,
Tata Mc Graw hill, 2nd edition.
4. Principles of Interactive Computer Graphics, Neuman and
Sproul, TMH.
5. Principles of Computer Graphics, Shalini Govil, Pai, 2005,
Springer.
6. Computer Graphics, Steven Harrington, TMH

8/3/2019 B.tech Final Syllabus (1)
15/24
ALGORITHMS DESIGN
UNIT I :
Introduction: Algorithm,Psuedo code for expressing
algorithms,Performance AnalysisSpace
complexity, Time complexity, Asymptotic Notation Big oh
notation, Omega notation, Theta
notation and Little oh notation,Probabilistic analysis,
Amortized analysis.
UNIT II:
Algorithm Design Techniques: Greedy algorithm, dynamic
programming, divide and conquer,
backtracking, branch and bound.
Greedy Algorithms: Knapsack problem. Dynamic Programming:
Chained matrix multiplication,
longest common subsequence.
UNIT III
Divide and Conquer: Order Statistics finding the median,
exponentiation, matrix
multiplication.
Graph Algorithms: Shortest path algorithms, minimum spanning
tree algorithm, network flow,
matching, coverings, applications of DFS: biconnectivity, Euler
circuits, strongly connected
components, topological sort, and articulation point.
UNIT IV
Approximate Algorithm: Travelling Salesman Problem, vertexcover
problem.
Set algorithms: Disjoint set operations. Matrix inversion LUP
decomposition.
Construction of codes: Shannon Fano and Huffman codes.
UNIT V
Backtracking: General method, applicationsnqueen problem, sum
of subsets problem, graph
coloring, Hamiltonian cycles.
NPHard and NPComplete problems: Basic concepts, non
deterministic algorithms, NP  Hard
and NPComplete classes, Cooks theorem.
TEXT BOOKS :
1. Fundamentals of Computer Algorithms, Ellis Horowitz,Satraj
Sahni and
Rajasekharam,Galgotia publications pvt. Ltd.
2. Algorithm Design: Foundations, Analysis and Internet
examples, M.T.Goodrich and
R.Tomassia,John wiley and sons.

8/3/2019 B.tech Final Syllabus (1)
16/24
REFERENCES :
1. Introduction to Algorithms,
secondedition,T.H.Cormen,C.E.Leiserson, R.L.Rivest,and
C.Stein,PHI Pvt. Ltd./ Pearson Education
2. Introduction to Design and Analysis of Algorithms A strategic
approach, R.C.T.Lee, S.S.Tseng,
R.C.Chang and T.Tsai, Mc Graw Hill.
3. Data structures and Algorithm Analysis in C++, Allen Weiss,
Second edition, Pearson
education.
4. Design and Analysis of algorithms, Aho, Ullman and
Hopcroft,Pearson education.
5. Algorithms Richard Johnson baugh and Marcus Schaefer, Pearson
Education

8/3/2019 B.tech Final Syllabus (1)
17/24
WEB TECHNOLOGIES
(Elective  I)
UNITI:
HTML Common tags List, Tables, images, forms, Frames; Cascading
Style sheets; Introduction
to Java Scripts, Objects in Java Script, Dynamic HTML with Java
Script
UNITII:
XML: Document type definition, XML Schemas, Document Object
model, Presenting XML, Using
XML Processors: DOM and SAX, Java Beans: Introduction to Java
Beans, Advantages of Java
Beans, BDK Introspection, Using Bound properties, Bean Info
Interface, Constrained properties
Persistence, Customizes, Java Beans API, Introduction to
EJBs
UNITIII:
Web Servers and Servlets: Tomcat web server, Introduction to
Servelets: Lifecycle of a
Serverlet, JSDK, The Servelet API, The javax.servelet Package,
Reading Servelet parameters,
Reading Initialization parameters. The javax.servelet HTTP
package, Handling Http Request &
Responses, Using CookiesSession Tracking, Security Issues,
UNITIV:
Introduction to JSP: The Problem with Servelet. The Anatomy of a
JSP Page, JSP Processing. JSPApplication Design with MVC Setting Up
and JSP Environment: Installing the Java Software
Development Kit, Tomcat Server & Testing Tomcat.
Database Access : Database Programming using JDBC, Studying
Javax.sql.* package,Accessing a
Database from a JSP Page, Application Specific Database
Actions,Deploying JAVA Beans in a
JSP Page, Introduction to struts framework..
UNITV:
JSP Application Development: Generating Dynamic Content, Using
Scripting Elements ImplicitJSP Objects, Conditional Processing
Displaying Values Using an Expression to Set an Attribute,
Declaring Variables and Methods Error Handling and Debugging
Sharing Data Between JSP
pages, Requests, and Users Passing Control and Date between
Pages Sharing Session and
Application Data Memory Usage Considerations
TEXT BOOKS:
1. Web Programming, building internet applications, Chris Bates
2nd edition,
WILEY Dreamtech (UNIT s 1,2 ,3)
2. The complete Reference Java 2 Fifth Edition by Patrick
Naughton and Herbert Schildt. TMH(Chapters: 25) (UNIT 4)

8/3/2019 B.tech Final Syllabus (1)
18/24
3. Java Server PagesHans Bergsten, SPD OReilly (UNITs
5,6,7,8)
REFERENCE BOOKS:
1. Programming world wide webSebesta,Pearson2. Core SERVLETS
ANDJAVASERVER PAGES VOLUME 1: CORE TECHNOLOGIES By Marty Hall
and Larry Brown Pearson3. Internet and World Wide Web How to
program by Dietel and Nieto PHI/Pearson
Education Asia.
4. Jakarta Struts Cookbook , Bill Siggelkow, S P D OReilly for
chap 8.5. Murachs beginning JAVA JDK 5, Murach, SPD6. An
Introduction to web Design and ProgrammingWangThomson7. Web
Applications Technologies ConceptsKnuckles,John Wiley8.
Programming world wide webSebesta,Pearson

8/3/2019 B.tech Final Syllabus (1)
19/24
REAL TIME SYSTEMS
(Elective  I)
UNITI: Introduction
Definition, Typical Real Time Applications: Digital Control,
High Level
Controls, Signal Processing etc., Release Times, Deadlines, and
Timing Constraints,
Hard Real Time Systems and Soft Real Time Systems, Reference
Models for Real Time
Systems: Processors and Resources, Temporal Parameters of Real
Time Workload,
Periodic Task Model, Precedence Constraints and Data
Dependency.
UNITII: Real Time Scheduling
Common Approaches to Real Time Scheduling: Clock Driven
Approach,
Weighted Round Robin Approach, Priority Driven Approach, Dynamic
Versus Static
Systems, Optimality of EffectiveDeadlineFirst (EDF) and
LeastSlackTimeFirst
(LST) Algorithms, Offline Versus Online Scheduling, Scheduling
Aperiodic and
Sporadic jobs in Priority Driven and Clock Driven Systems.
UNITIII: Resources Access Control
Effect of Resource Contention and Resource Access Control (RAC),
Nonpreemptive
Critical Sections, Basic PriorityInheritance and
PriorityCeiling Protocols,
Stack Based PriorityCeiling Protocol, Use of PriorityCeiling
Protocol in Dynamic
Priority Systems, Preemption Ceiling Protocol, Access Control in
MultipleUnit
Resources, Controlling Concurrent Accesses to Data Objects.
UNITIV: Multiprocessor System Environment
Multiprocessor and Distributed System Model, Multiprocessor
PriorityCeiling
Protocol, Schedulability of FixedPriority EndtoEnd Periodic
Tasks, Scheduling
Algorithms for EndtoEnd Periodic Tasks, EndtoEnd Tasks in
Heterogeneous Systems,
Predictability and Validation of Dynamic Multiprocessor Systems,
Scheduling of Taskswith Temporal Distance Constraints.
UNITV: Real Time Communication
Model of Real Time Communication, PriorityBased Service and
Weighted
RoundRobin Service Disciplines for Switched Networks, Medium
Access Control
Protocols for Broadcast Networks, Internet and Resource
Reservation Protocols, Real
Time Protocols, Communication in Multicomputer System, An
Overview of Real Time
Operating Systems.

8/3/2019 B.tech Final Syllabus (1)
20/24
Books:
1. Real Time Systems by Jane W. S. Liu, Pearson Education
Publication.
2. RealTime Systems: Scheduling, Analysis, and Verification by
Prof. Albert M. K.
Cheng, John Wiley and Sons Publications.

8/3/2019 B.tech Final Syllabus (1)
21/24
MOBILE COMPUTING
(Elective  I)
UNIT  IIntroduction to Mobile Communications and Computing :
Mobile Computing (MC) :
Introduction to MC, novel applications, limitations, and
architecture.
GSM : Mobile services, System architecture, Radio interface,
Protocols, Localization and calling,
Handover, Security, and New data services.
UNIT  II
(Wireless) Medium Access Control : Motivation for a specialized
MAC (Hidden and exposed
terminals, Near and far terminals), SDMA, FDMA, TDMA, CDMA.
Mobile Network Layer : Mobile IP (Goals, assumptions, entities
and terminology, IP packet
delivery, agent advertisement and discovery, registration,
tunneling and encapsulation,
optimizations), Dynamic
Host Configuration Protocol (DHCP).
UNIT  III
Mobile Transport Layer : Traditional TCP, Indirect TCP, Snooping
TCP, Mobile TCP, Fast
retransmit/fast recovery, Transmission /timeout freezing,
Selective retransmission, Transaction
oriented TCP.Database Issues : Hoarding techniques, caching
invalidation mechanisms, client
server computing with adaptation, poweraware and contextaware
computing, transactional
models, query processing, recovery, and quality of service
issues.
UNIT  IV
Data Dissemination: Communications asymmetry, classification of
new data delivery
mechanisms, pushbased mechanisms, pullbased mechanisms, hybrid
mechanisms, selective
tuning (indexing) techniques.
Mobile Ad hoc Networks (MANETs): Overview, Properties of a
MANET, spectrum of MANET
applications, routing and various routing algorithms, security
in MANETs.
UNIT  V
Protocols and Tools : Wireless Application ProtocolWAP.
(Introduction, protocol architecture,
and treatment of protocols of all layers), Bluetooth (User
scenarios, physical layer, MAC layer,
networking, security, link management) and J2ME.
TEXT BOOKS :
1. Jochen Schiller,Mobile Communications,AddisonWesley.
(Chapters 4,7,9,10,11),second
edition, 2004.2. Stojmenovic and Cacute, Handbook of Wireless
Networks and Mobile Computing, Wiley,

8/3/2019 B.tech Final Syllabus (1)
22/24
2002, ISBN 0471419028. (Chapters 11, 15, 17, 26 and 27)
REFERENCES :
1. Reza Behravanfar, Mobile Computing Principles: Designing and
Developing Mobile
Applications with UML and XML, ISBN: 0521817331, Cambridge
University Press, October
2004,
2. Adelstein, Frank, Gupta, Sandeep KS, Richard III, Golden ,
Schwiebert, Loren, Fundamentals
of Mobile and Pervasive Computing, ISBN: 0071412379, McGrawHill
Professional, 2005.
3. Hansmann, Merk, Nicklous, Stober, Principles of Mobile
Computing, Springer, second
edition, 2003.
4. Martyn Mallick, Mobile and Wireless Design Essentials, Wiley
DreamTech, 2003.

8/3/2019 B.tech Final Syllabus (1)
23/24
SOFTWARE TESTING METHODOLOGIES
(Elective  I)
UNIT I :
Introduction : Purpose of testing, Dichotomies, model for
testing, consequences of bugs,
taxonomy of bugs
UNIT II :
Flow graphs and Path testing : Basics concepts of path testing,
predicates, path predicates and
achievable paths, path sensitizing, path instrumentation,
application of path testing.
UNIT III :
Transaction Flow Testing : Transaction flows, transaction flow
testing techniques. Dataflow
testing:Basics of dataflow testing, strategies in dataflow
testing, application of dataflow
testing.
UNIT IV :
Domain Testing:domains and paths, Nice & ugly domains,
domain testing, domains and
interfaces testing, domain and interface testing, domains and
testability.
Paths, Path products and Regular expressions : Path products
& path expression, reduction
procedure, applications, regular expressions & flow anomaly
detection.
Logic Based Testing : Overview, decision tables, path
expressions, kv charts, specifications.
UNIT V:
State, State Graphs and Transition testing : State graphs, good
& bad state graphs, state testing,
Testability tips.
Graph Matrices and Application : Motivational overview, matrix
of graph, relations, power of a
matrix, node reduction algorithm, building tools.
Usage of JMeter and Winrunner tools for functional / Regression
testing, creation of test script
for unattended testing, synchronization of test case, Rapid
testing, Performance testing of a
data base application and HTTP connection for website
access.
TEXT BOOKS :
1. Software Testing techniques  Baris Beizer, Dreamtech, second
edition.
2. Software Testing Tools Dr.K.V.K.K.Prasad, Dreamtech.
REFERENCES :

8/3/2019 B.tech Final Syllabus (1)
24/24
1. The craft of software testing  Brian Marick, Pearson
Education.
2. Software Testing Techniques SPD(Oreille)
3. Software Testing in the Real World Edward Kit, Pearson.
4. Effective methods of Software Testing, Perry, John Wiley.
5. Art of Software Testing Meyers, John Wiley.