VEERMATA JIJABAI TECHNOLOGICAL INSTITUTE

(VJTI)
MATUNGA, MUMBAI 400 019

(Autonomous Institute affiliated to University of Mumbai)

Curriculum
(Scheme of Instruction & Evaluation and Course contents)
(Revision 2016)

For
Third Year
of
Four Year Undergraduate Programmes Leading to
Bachelor of Technology (B Tech) Degree in Information Technology

Implemented from the batch admitted in Academic Year 2016-17

 VEERMATA JIJABAI TECHNOLOGICAL INSTITUTE

(Autonomous Institute affiliated to University of Mumbai)

Curriculum
(Scheme of Instruction & Evaluation and Course contents)

For
Third Year
of
Four Year Undergraduate Programme Leading to
Bachelor of Technology (B Tech)
In

° 108 Information Technology

VJTI [Link]. – Information Technology– 2016-17|P a g e 2

 [Link]. Information Technology

Program Educational Objectives (PEOs)

1. To provide students with sound foundations in Basic Sciences and fundamentals in

Engineering Sciences.

2. To inculcate strong problem solving skills through the courses of CSE.

3. To provide students with hands on experience in implementing various software

development concepts.

4. Train the students in project based assignments.

5. To impress upon students the importance of good ethical practices, right professional
conduct and responsible team leadership.

Program Outcomes (POs)

After the completion of the [Link]. Information Technology programme, the graduates of the
department will have the

1. Ability to apply knowledge of computing, mathematics, science and engineering

fundamentals to the solution of complex engineering problems.

2. Ability to formulate and analyze a problem, and define the computing requirements
appropriate to its solution using basic principles of mathematics, science and
computer engineering.

3. Ability to design, implement, and evaluate a computer based system, process,

component, or software to meet the desired needs.

4. Ability to design and conduct research based experiments, perform analysis and
interpretation of data and provide valid conclusions.

5. Ability to use current techniques, skills, and tools necessary for computing practice.

6. Understanding of legal, health, security, cultural and social issues,and thereby ones
responsibility in their application in Professional Engineering practice.

7. Understanding of the impact of professional engineering solutions on environmental

context and the need for sustainable development.

8. Understanding and commitment towards the professional and ethical responsibilities

of an engineer.

9. Ability to function effectively as an individual, and as a team member / leader in

accomplishing a common goal.

VJTI [Link]. – Information Technology– 2016-17|P a g e 3

 Veermata Jijabai Technological Institute

[Link]. Information Technology

Scheme of Instruction and evaluation

SEMESTER V

Scheme of Instruction Scheme of Evaluation

S. Course Course Title L-T-P Credits TA IST ESE ESE
No code (Hours hours
/ week)
1. MA3001S Statistics and 3-1-0 4 10 30 60 3
Optimization
2. IT3002S Intelligent System 3-1-0 4 10 30 60 3
3. IT3003_T Computer Networks 3-0-0 3 10 30 60 3
IT3003_P Computer Networks Lab 0-0-2 1 100 % CIE -
4. IT3004_T Software Analysis and 3-0-0 3 10 30 60 3
Design
IT3004_P Software Analysis and 0-0-2 1 100 % CIE -
Design Lab
5. IT3005S Graphics & Processing 3-1-0 4 10 30 60 3
6. IT3006_T Operating System 3-0-0 3 10 30 60 3
IT3006_P Operating System Lab 0-0-2 1 100 % CIE -

Total 24

Abbreviations: L: Lecture, T: Tutorial, P: Practical, TA: Teacher Assessment / Term work

Assessment,IST: In Semester Tests (comprise of average of twoIn semester tests),ESE: End
Semester Written Examination, CIE: Continuous In-semester Evaluation

VJTI [Link]. – Information Technology– 2016-17|P a g e 4

 [Link]. Information Technology

Scheme of Instruction and evaluation

SEMESTER VI

Scheme of Instruction Scheme of Evaluation

S. Course Course Title L-T-P Credits TA IST ESE ESE
No code (Hours hours
/ week)
1. IT3008S Software Architecture & 3-1-0 4 10 30 60 3
Design Patterns
2. IT3009S Machine Learning 3-1-0 4 10 30 60 3
3. IT3010_T Advance Architecture 3-0-0 3 10 30 60 3
IT3010_P Advance Architecture Lab 0-0-2 1 100 % CIE -
4. IT3011_T Wireless network 3-0-0 3 10 30 60 3
IT3011_P Wireless network Lab 0-0-2 1 100 % CIE -
5. Elective-I 3-1-0 4 10 30 60 3
6. IT3012_T Information Security 3-0-0 3 10 30 60 3
IT3012_P Information Security Lab 0-0-2 1 100 % CIE -
Web Technology Lab
Total 24

Abbreviations: L: Lecture, T: Tutorial, P: Practical, TA: Teacher Assessment / Term work

Assessment,IST: In Semester Tests (comprise of average of twoIn semester tests),ESE: End
Semester Written Examination, CIE: Continuous In-semester Evaluation

Semester VI List of Electives:

S. No Course code Course Title

1. IT3101S Bio-informatics
2. IT3102S Compiler Design
3. IT3103S Graph Theory

VJTI [Link]. – Information Technology– 2016-17|P a g e 5

Programme Bachelor of Technology in Semester – V
Name Information Technology
Course Code MA3001S
Course Title Statistics and Optimization
Prerequisites Mathematics

COURSE OUTCOMES
1. Ability to solve problems by using least square analysis. Understand Correlation and
Regression
2. Identify different types of test of Hypotheses
3. Identify different types of optimization problems and optimization technique
4. Ability to solve various multivariable optimization problems
5. Ability to solve optimization using software tools.

Course Contents
Probability
Baye’s theorem. Discrete and continuous random variables. Probability mass function and
density function. Expected value. (Expectation) Moments and moments generating functions.
Relation between Raw moments and Central moments.

Statistics
Review of measures of central tendency, measures of variation and probability. Discrete and
continuous Random variable. Binomial, Poisson and Normal distribution. Random sampling,
sampling distribution, standard error, Central limit theorem. Estimation of parameters, point
estimation, interval Estimation, confidence internal. Testing of Hypothesis, large sample and
small sample, tests‘t’ test and ‘F’ test, Chi-square test. Correlation and regression.
Coefficient of correlation and Rank correlation Regression analysis, curve fitting, method of
least square, Statistical quality control and control charts. Analysis of variance (One way &
Two way).

Linear Optimization
Vector Spaces: bases, echelon forms, rank and determinants. Gauss elimination and its
complexity, Inner products, Gram- Schmidt orthogonalization. Linear transformations.
Optimization: Modelling and formulation of optimization problems.

Linear costs and convex domains. Mean-square (distance) minimizations. Linear

programming and the Simplex algorithm. Duality and the primal dual method. Examples
from combinatorial optimization. Shortest paths, network flows and matchings.

VJTI [Link]. – Information Technology– 2016-17|P a g e 6

Approximation and randomized algorithms. Matrix Games.

Text Books
1. [Link] and K. Steiglitz, “Combinatiorial Optimization”, Prentice-Hall India,
1996.
2. Gilbert Strang, “Linear Algebra and its Applications”, Harcourt Brace Jovanovitch,
1988.

Reference Books
1. V. Chvatal, “Linear Programming and Applications”, 1982.
2. K. Hoffman and R. Kunze, “Linear Algebra”, Prentice-Hall India, 1971.
3. E.D. Nering and [Link], “Linear Programs and Related Problems”, Academic Press,
1993

VJTI [Link]. – Information Technology– 2016-17|P a g e 7

Programme Bachelor of Technology in Semester – V
Name Information Technology
Course Code IT3002S
Course Title Intelligent System
Prerequisites Mathematics

COURSE OUTCOMES

1. Describe the key aspects of intelligent agents

2. Apply artificial intelligence techniques, including search heuristics, knowledge
representation, planning and reasoning

3. Solve problems by applying a suitable search method

4. Compare minimax search and alpha-beta pruning in game playing

5. Differentiate the key aspects of evolutionary computation, including genetic algorithms

and genetic programming

Course Contents
Introduction
Overview and historical perspective, turing test, physical symbol systems and the scope of
symbolic AI, Agents.
State Space Search
Depth First Search, Breadth first Search, DFID.
Heuristic Search
Best First Search, Hill Climbing, Beam Search, Tabu Search.
Randomized Search
Simulated annealing, Genetic Algorithms, Ant colony optimization.
Finding Optimal Paths
Branch and Bound, A*, IDA*, Divide and Conquer approaches, Beam Stack Search.
Problem Decomposition
Goal Trees, AO*, Rule Based Systems, Rete Net.
Game Playing
Minimax Algorithm, AlphaBeta Algorithm,SSS*.
Planning and Constraint Satisfaction
Domains, Forward and Backward Search, Goal Stack Planning, Plan Space Planning,
Constraint Propagation.
Logic and Inferences
Propositional Logic, First Order Logic, Soundness and Completeness, Forward and
Backward chaining,

VJTI [Link]. – Information Technology– 2016-17|P a g e 8

Text Books
1. Deepak Khemani,”A First Course in Artificial Intelligence”, McGraw Hill
Education(India), 2013.
2. Stuart Russell, Peter Norvig,“Artificial Intelligence A Modern Approach”, Prentice Hall,
3rd Edition,2009.

Reference Books
1. Stefan EdelKamp and Stefan Schroedl, “Heuristic Search: Theory and Application”,
Morgan Kaufmann, 2011.

2. Zbigniew Michalewicz and David B. Fogel, “ How to Solve it: Modern Heuristics”,
Springer, 2nd Edition, 2004.

VJTI [Link]. – Information Technology– 2016-17|P a g e 9

Programme Bachelor of Technology in Semester – V
Name Information Technology
Course Code IT3003_T
Course Title Computer Networks
Prerequisites Data Communication

COURSE OUTCOMES
1. Students will obtain insight about basic network theory and layered communication
architectures
2. Students will be able to analyze, design and document computer network
specifications to meet client needs, use proper computer system and networking
terminology
3. Students will able to implement local area networks using both static and dynamic
addressing techniques including sub netting, install and configure domain-based local
area networks
4. Students will be able to understand conceptual design of MAC, IP, and Transport
layer protocols and solve problems in MAC, IP, and Transport layers.
Course Contents
Introduction
Network Applications. Network Hardware. Network Software. OSI and TCP/IP Model.

Network Layer
Introduction,Switching, Packet Switching at Network Layer, Network Layer Services, Other Network
Layer Issues.

IPv4
Introduction, CLASSFUL ADDRESSING, CLASSLESS ADDRESSING, SPECIAL ADDRESSES,
NAT, Delivery and Forwarding of IP Packets:- Delivery, Forwarding ,Structure of Router.

PROTOCOLS
IP- Introduction, DATAGRAMS, FRAGMENTATION, OPTIONS, CHECKSUM, ARP-ADDRESS
MAPPING, ARP PROTOCOL, ICMP- INTRODUCTION, MESSAGES, DEBUGGING TOOLS

ROUTING
Introduction, INTRA & INTER Domain Routing RIP,L ink State Routing, OSPF, Path Vector Routing,
BGP.

The Transport Layer

Transport Layer SERVICES, Transport Layer Protocols, UDP :- Introduction, USER DATAGRAM,

VJTI [Link]. – Information Technology– 2016-17|P a g e 1 0

UDP SERVICES, TCP:- TCP rvices, TCP Features, SEGMENT, TCP Connection, State Transition
Diagram, WINDOWS IN TCP, FLOW CONTROL, ERROR CONTROL,CONGESTION CONTROL,
TCP TIMERS, OPTIONS.

The Application Layer

Intoduction - CLIENT SERVER Paradigm, Peer-to-peer paradigm, PROTOCOLS - DHCP, DNS,
REMOTE OGIN-TELNET,SSH, FTP, TFTP, WWW, HTTP , EMAIL-
SMTP,POP,IMAP,MIME,SNMP.

Text Books
1. Forouzan, Behrouz A,”TCP/IP protocol suite”,4th ed.
2. Andrew S. Tanenbaum, “Computer Networks”, Pearson Education,5th Edition.
3. J.F. Kurose and K. W. Ross, “Computer Networking: A Top-Down Approach Featuring
the Internet”, Pearson, 2nd Edition, 2003.

Reference Books
1. Larry L Peterson and B S Davie, “Computer Networks: A Systems Approach”,
Elsevier,2012
2. B. A. Forouzan, “Data Communications and Networking”, McGraw Hill, 4th Edition
,2010.
3. Wesley. D. E. Comer, Computer Networks And Internets, Prentice Hall
4. Alberto Leon Garcia and Indra Widjaja, “Communication Networks, Fundamental
Concepts and Key Architectures”, McGraw-Hill, 2nd Edition, 2004.
5. W. Richard Stevens,” TCP/IP”, Volume1, 2, 3, Addison

VJTI [Link]. – Information Technology– 2016-17|P a g e 1 1

Programme Bachelor of Technology in Semester – V
Name Information Technology
Course Code IT3003_P
Course Title Computer Networks Lab
Prerequisites Data Communication

COURSE OUTCOMES
1. To analyse the internal details of data packet.
2. To build different network topologies using networking devices.
3. Implement and analyse various network services.

Experiment List
Sr. Title
No.
1 To study basic networking commands.

2 To study different Networking Devices.

3 Study of packet sniffer tools (Wireshark)

4 Study of Physical Layer, MAC Layer, Network Layer, Transport Layer Parameter Using
Wireshark.

5 Introduction to Packet Tracer

6 Study of functionality of Hub, switches routers using Packet Tracer.

7 Study of Implementation Internet Services by telnet, ssh, ftp, scp utilities.

8 Implementation of CRC and Hamming code using C++/Java

9 Implementation and analysis of different layer protocols

VJTI [Link]. – Information Technology– 2016-17|P a g e 1 2

Programme Bachelor of Technology in Semester – V
Name Information Technology
Course Code IT3003_T
Course Title Software Analysis and Design
Prerequisites

COURSE OUTCOMES
1. Students will be able to comprehend software development life cycle.
2. Students will be able to prepare SRS document for a project.
3. Students will be capable of applying software design and development techniques.
4. Students will be able to identify verification and validation methods in a software
engineering project.
5. Students will be able to implement testing methods at different phases of SDLC.

Course Contents
Introduction
Introduction to Software Engineering, Software Product, Software Myths, Software Process,
Software Process Models: Waterfall Model, Prototyping Model, RAD Model, Evolutionary
Software Process Models.

Software Project Management

Project Management Concepts, Software Process and Project Metrics,Software Project
Planning, Risk Analysis and Management, Project Scheduling and Tracking, Software
Quality Assurance, Software Configuration Management.

Software Analysis
Analysis Concepts and Principles: Requirement Analysis, Requirement elicitation for
software, Analysis principles, Software prototyping, Specification.
Analysis Modeling: Elements of analysis model, Data modeling, Functional modeling and
information flow, Behavioral modeling, Mechanics of structured analysis, Data dictionary

Software Design
Design Concepts and Principles: Software design and software engineering, Design process,
Design principles, Design concepts, Effective modular design, Design heuristics for effective
modularity, Design model, Design documentation.
Architectural Design: Software architecture, Data design, Architectural styles, Analyzing
alternative architectural designs, Mapping requirements into a software architecture,
Transform mapping, Transaction mapping, Refining architectural design.

VJTI [Link]. – Information Technology– 2016-17|P a g e 1 3

User Interface Design: The golden rules, User interface design, Task analysis and modeling,
Interface design activities, Implementation tools, Design evaluation. Component-Level
Design: Structured programming, Comparison of design notation.

Software Testing
Software Testing Techniques: Software testing fundamentals, Test case design, White-box
testing, Basis path testing, Control structure testing, Black-box testing, Testing for
specialized environments, architectures and applications.
Software Testing Strategies: Strategic approach to software testing, Strategic issues, Unit
testing, Integration testing, Validation testing, System testing, Art of debugging.

Text Books
1. Roger Pressman, “Software Engineering”, McGraw Hill, Fifth Edition.
2. James Peter, “Software Engineering An Engineering Approach”, John Wiley
3. Ian Sommerville, “Software Engineering”, Pearson Education.

Reference Books
1. W.S. Jawadekar, “Software Engineering”, TMH.
2. Pankaj Jalote, “An Integrated Approach To Software Engineering “, Narosa.
3. R. Mall, “Fundamentals of Software Engineering”, Prentice Hall of India
4. Behferooz & F. J. Hudson, “Software Engineering Fundamentals”, Oxford University
Press
5. S. L. Pfleeger, “Software Engineering Theory and Practice”, Pearson Education

VJTI [Link]. – Information Technology– 2016-17|P a g e 1 4

Programme Bachelor of Technology in Semester – V
Name Information Technology
Course Code IT3003_P
Course Title Software Analysis and Design Lab
Prerequisites

COURSE OUTCOMES
1. Students will be able to comprehend software development life cycle.
2. Students will be able to prepare SRS document for a project.
3. Students will be capable of applying software design and development techniques.
4. Students will be able to identify verification and validation methods in a software
engineering project.
5. Students will be able to implement testing methods at different phases of SDLC.

Course Contents
Experiment Detail
For the given case study
1.1 Give detailed Problem Statement
1.2 Estimate required Resources
1.3 Perform Software Estimation using LOC and FP Methods
1.4 Perform Risk Analysis and Management:
1.5 Carry out Project Scheduling and Tracking
1.6 Prepare Project Plan
1.7 Prepare Software Quality Assurance Plan (SQA plan)
1.8 Carry out Requirement Analysis Modeling
1.9 Carry out Design
1.10 Perform Software Testing

VJTI [Link]. – Information Technology– 2016-17|P a g e 1 5

Programme Bachelor of Technology in Semester – V
Name Information Technology
Course Code IT3005S

Course Title Graphics & Processing

Prerequisites

COURSE OUTCOMES
1. Able to create interactive graphics application in C++ using one or more graphics
application programming interfaces.
2. Able to write program that demonstrate geometrical transformation and understand
the use of object hierarchy in graphics application.
3. Able to write program functions to implement visibility detection.
4. Able to write programs that demonstrate computer graphics animation and 2D image
processing techniques.

Course Contents
Graphics System and Models
Applications of Computer Graphics, A Graphics System, Images: Physical and Synthetic,
Imaging Systems, The Synthetic-Camera Model, The Programmer’s Interface, Graphics
Architectures, Programmable Pipelines, Performance Characteristics

Graphics Programming
The Sierpinski Gasket, Programming Two-Dimensional Applications, The OpenGL
Application Programming Interface, Primitives and Attributes, Color, Viewing, Control
Functions, The Gasket Program, Polygons and Recursion, The Three-Dimensional Gasket,
Adding Interaction, Menus

Geometric objects and Transformations

Scalars, Points, and Vectors, Three-Dimensional Primitives, Frames in OpenGL, Matrix and
Vector Classes, Modeling a Colored Cube, Affine Transformations, Translation, Rotation,
and Scaling, Transformations in Homogeneous Coordinates, Concatenation of
Transformations, Transformation Matrices in OpenGL, Spinning of the Cube, Interfaces to
Three-Dimensional Applications, Quaternions,

Viewing

VJTI [Link]. – Information Technology– 2016-17|P a g e 1 6

Classical and Computer Viewing, Viewing with a Computer, Positioning of the Camera,
Parallel Projections, Perspective Projections, Perspective Projections with OpenGL
Perspective-Projection Matrices, Hidden-Surface Removal, Displaying Meshes, Projections
and Shadows

Ligthing and Shading

Light and Matter, Light Sources, The Phong Reflection Model, Computation of Vectors,
Polygonal Shading, Approximation of a Sphere by Recursive Subdivision, Specifying
Lighting Parameters, Implementing a Lighting Model, Shading of the Sphere Model, Per-
Fragment Lighting, Global Illumination

From Vertices to Framents

Basic Implementation Strategies, Four Major Tasks, Clipping, Line-Segment Clipping,
Polygon Clipping, Clipping of Other Primitives, Clipping in Three Dimensions,
Rasterization, Bresenham’s Algorithm, Polygon Rasterization, Hidden-Surface Removal,
Antialiasing, Display Considerations

Discrete Techniques
Buffers, Digital Images, Writing into Buffers, Mapping Methods, Texture Mapping, Texture
Mapping in OpenGL, Texture Generation, Environment Maps, Reflection Map, Bump
Mapping, Compositing Techniques, Sampling and Aliasing.

Modeling and Hierarchy

Symbols and Instances, Hierarchical Models, A Robot Arm, Trees and Traversal, Animation,
Graphical Objects, Scene Graphs, Open Scene Graph, Graphics and the Internet, Other Tree
Structures

Procedural Methods
Algorithmic Models, Physically Based Models and Particle Systems, Newtonian Particles,
Solving Particle Systems, Constraints, A Simple Particle System, Language-Based Models,
Recursive Methods and Fractals, Procedural Noise.

Curves and Surfaces

Representation of Curves and Surfaces, Design Criteria, Parametric Cubic Polynomial
Curves, Interpolation, Hermite Curves and Surfaces, Bezier Curves and Surfaces, Cubic B-
Splines, General B-Splines, Rendering Curves and Surfaces, The Utah Teapot, Algebraic
Surfaces, Subdivision Curves and Surfaces, Mesh Generation from Data,

VJTI [Link]. – Information Technology– 2016-17|P a g e 1 7

Advanced Rendering
Going Beyond Pipeline Rendering, Ray Tracing, Building a Simple Ray Tracer, The
Rendering Equation, Radiosity, RenderMan, Parallel Rendering, Volume Rendering,
Isosurfaces and Marching Cubes, Mesh Simplification, Direct Volume Rendering, Image-
Based Rendering

Text Books
1. Edward Angel, “Interactive Computer Graphics A topdown approach using OpenGL”,
Pearson Education Low Price Indian Edition, 5th ed., 2008.
2. F. S. Hill Jr. and S. M. Kelley, “Computer Graphics using open GL”, Pearson Education
Low Price Indian Edition, 3rd ed., 2006.

Reference Books
1. D. D. Hearn and M. P. Baker, “Computer Graphics with OpenGL”, Pearson Education
Low Price Indian Edition, 3rd ed., 2003.
2. Peter Shirley, A K Peters, “Fundamentals of Computer Graphics”, 3rd ed., 2009.

VJTI [Link]. – Information Technology– 2016-17|P a g e 1 8

Programme Bachelor of Technology in Semester – V
Name Information Technology
Course Code IT3006_T
Course Title Operating System
Prerequisites C and C++ programming

COURSE OUTCOMES
1. Understand various process management concepts including scheduling, synchronization,
deadlocks.
2. Will be familiar with multithreading.
3. Understand the memory management and system resource sharing.
4. Understands the issues related to file system.

Course Contents
Introduction
Computers and Software, General System software, Resource abstraction & Sharing,
Operating system strategies (Batch, Timesharing, real time, embedded etc)Concept of
Multiprogramming Operating system organization, Basic functions-Implementation
considerations, Computer organization, bootstrapping the machine, Mobile computers,
Multiprocessors and parallel computers, Device Management-Device controllers & Device
drivers – I/O strategies (direct I/O with polling, Interrupt driven I/O, DMA ), Buffering, Disk
scheduling strategies

Process and Threads Management

Process & Threads- Implementing process & Threads – Process address space- process state
transition diagram- Process manager responsibilities- concept of Linux process & thread
descriptors-Process scheduler organization- different scheduling strategies(non preemptive &
preemptive)- Process synchronization- critical section- semaphore & its implementation –
classical synchronization problems and its solutions (Producer-consumer, readers-writers,
dining philosopher)- Deadlock-prevention-avoidance-bankers algorithm-detection-reduced
resource allocation graph- Inter process communication(Pipes, message passing etc)-concept
of process management in Linux and widows NT.

Memory Management
Memory management- address space abstraction-address binding-memory allocation-
Fixed partition & variable partition memory strategies-dynamic address binding-
swapping-paging-virtual memory address translation-dynamic paging-static paging
algorithms-dynamic paging algorithm-working set algorithm-segmentation-
implementation-memory mapped files-concept of memory management in Linux &
Windows NT/XP.

VJTI [Link]. – Information Technology– 2016-17|P a g e 1 9

 File Management
File Management – Low level files and Structured files- Low level file implementation
– different approaches to Block management- Structured sequential file-Indexed
sequential file-different directory structures-file systems-Mounting file systems-
Protection and Security-security and Policy – Authentication , authorization and
cryptography- Kerberos authentication- General protection model- Access matrix-
Access control list – Capability list – Concept of File management in Linux and
Windows NT.

I/O Management
II/O Devices , Organization of the I/O Function , Operating System Design Issues , Buffering

Architecture of the UNIX

Introduction to system concepts, Kernel data structures, system administration.

Buffer Cache
Structure of the buffer pool, Advantages and disadvantages of the buffer cache.
Internal representation of files: I-nodes. Structure of a regular file. Directories –
Conversion of a path name to an I-node. Super block. Other file types.

Text Books
1. Silberschatz & Galvin, “Operating system concepts”, Addison Wesley ,7th edition.
2. Tanenbaum A.S, “Modern Operating Systems”, Pearson Education 3rd edition, 2008 .
3. William Stallings, Operating Systems: Internals and Design Principles, Prentice Hall,
2008.

Refernce Books
1. Gary Nutt, Nebendu Chaki, and Sarmistha Neogy, “Operating Systems”, Pearson
Education, 3rd edition, 2009
2. Jerry D. Peek, Grace Todino, John Strang, “Learning the Unix Operating System”,
O'Reilly & Associates Publication, 5th edition, 2002
3. Crowley C., “Operating Systems – A Design oriented Approach”, TMH

VJTI [Link]. – Information Technology– 2016-17|P a g e 2 0

Programme Bachelor of Technology in Semester – V
Name Information Technology
Course Code IT3006_P
Course Title Operating System Lab
Prerequisites C and C++ programming

COURSE OUTCOMES
1. Students will be able to implement deadlock avoidance, and detection algorithms
2. Students will be able to compare the performance of various CPU Scheduling
Algorithm
3. Students will critically analyze the performance of the various page replacement
algorithms.
4. Students will be able to create processes and implement IPC
Experiment List
1. Basics of UNIX commands.
2. Shell Programming.
3. Implement the following CPU scheduling algorithms
Round Robin
SJF
FCFS
Priority
4. Implement all file allocation strategies
Sequential
Indexed
Linked
5. Implement Semaphores
6. Implement all File Organization Techniques
Single level directory
Two level
Hierarchical
DAG
7. Implement Bankers Algorithm for Dead Lock Avoidance
8. Implement an Algorithm for Dead Lock Detection
9. Implement e all page replacement algorithms
FIFO
LRU
LFU
10. Implement Shared memory and IPC
11. Implement Paging Technique of memory management.
12. Implement Threading & Synchronization Applications

VJTI [Link]. – Information Technology– 2016-17|P a g e 2 1

Programme Bachelor of Technology in Semester – VI
Name Information Technology
Course Code IT3008S
Course Title Software Architecture & Design Patterns
Prerequisites

COURSE OUTCOMES
1. Students will be able to comprehend software development life cycle.
2. Students will be able to implement testing methods at different phases of SDLC.
3. Students will be capable of analyzing and applying object modeling for the problem.
4. Students will be able to identify verification and validation methods in a software
engineering project.

Course Contents
Introduction
Overview Of OOL; Object Classes; Meta Types. Object Oriented Methodologies;
The Unified Approach Modeling; Why Modeling? Static And Dynamic Models;
Functional Models.

Object Modeling
Object. Links. Association. Inheritance. Grouping Constructs; Problems On Object
Modeling; Advantages Of Object Modeling.

Analysis
Problem Analysis. Problem Domain Classes. Identify Classes And Objects Of Real World
Problems. Using Use Case Analysis; Recording Analysis.

Basic Object Modeling

Multiplicity. Constraints. Aggregation. Component.

Sequence Diagram
Modeling Scenarios. Mapping Events To Object. Interfaces. Discovering Attributes.
Modeling Simple Collaboration Modeling. Logical Database Schema. Activity Diagram.
Modeling Workflow.

Class Diagram

VJTI [Link]. – Information Technology– 2016-17|P a g e 2 2

Test Scenarios. Interfaces. Classes. Methods. Stress Testing. System Testing. Scalability
Testing. Regression Testing. Behavioral Modeling. State Chart Diagram.

Design
Architectural Design. Refining The Model. Refactoring. Coupling And Cohesion . Who
Should Own The Attribute? Who Should Own The Operations? Process And Threads.

Design Classes
Classes Visibility; User Interface. Subsystem Interface.

Deponent Diagram
Modeling Source Codes. Physical Databases.

Deployment Diagram
Modeling In A C/S System. Distributed System And Embedded Systems.

Text Books
1. Ali Bahrami, “Object Oriented System Development “, McGraw Hill.
2. Grady Booch, J. Rambaugh, Ivar Jacobson, ”The UML Users guide”, Pearson Education.
3. J. Rambaugh, etal,, “Object Oriented Modeling and Design”
4. Andrew Haigh, “Object Oriented Analysis and Design”, Tata McGrawHill

Reference Books
1. Simon Benett, Steve McRobb, Ray Farmer, “Object Oriented System Analysis
and Design Using UML”, McGrawHill.
2. Timothy C. Lethbridge, Robert Laganiere, “Object Oriented Software
Engineering”, McGrawHill.

VJTI [Link]. – Information Technology– 2016-17|P a g e 2 3

Programme Bachelor of Technology in Semester – VI
Name Information Technology
Course Code IT3009S
Course Title Machine Learning
Prerequisites Linear Algebra, Probability, Statistics

COURSE OUTCOMES
1. Student will be able to analyze and appreciate the applications which can use Machine
Learning Techniques.
2. Student will be able to understand regression, classification, clustering methods.
3. Student will be able to understand the difference between supervised and unsupervised
learning methods.
4. Student will be able to appreciate Dimensionality reduction techniques.
5. Student will be able to understand the working of Reinforcement learning.

Course Contents
Introduction
Learning Problems – Perspectives and Issues – Concept Learning – Version Spaces
and Candidate Eliminations – Inductive bias – Decision Tree learning –
Representation – Algorithm – Heuristic Space Search.

Instant Based Learning

K- Nearest Neighbour Learning – Locally weighted Regression – Radial Bases
Functions – Case Based Learning.
Association Rule Learning: Apriori, FP Growth
Clustering: Centroid based – K-means, Distribution based – EM, Density based –
DBScan
Regression: Linear Regression, Interpolation & Extrapolation, Nonlinear regression
Artificial Neural Networks: Network Function, Cost, Learning Paradigms, Gradient
Descent ,SVM: Classifier, Kernel, Parameter Selection.

Bayesian And Computational Learning

Bayes Theorem – Concept Learning – Maximum Likelihood – Minimum Description
Length Principle – Bayes Optimal Classifier – Gibbs Algorithm – Naïve Bayes
Classifier – Bayesian Belief Network – EM Algorithm – Probability Learning –
Sample Complexity – Finite and Infinite Hypothesis Spaces – Mistake Bound Model.

Neural Networks And Genetic Algorithms

Neural Network Representation – Problems – Perceptrons – Multilayer Networks and

VJTI [Link]. – Information Technology– 2016-17|P a g e 2 4

Back Propagation Algorithms – Advanced Topics – Genetic Algorithms – Hypothesis
Space Search – Genetic Programming – Models of Evaluation and Learning

Softmax Function – One Hot Encoding – Cross Entropy – Stochastic Gradient

Descent – Learning Rate Decay – Parameter Hyperspace – ReLU - Regularization –
Dropout

Deep NN Architectures – Back propogation, CNN, RNN, LSTM, Deep Boltzmann

Machine

Advanced Learning
Learning Sets of Rules – Sequential Covering Algorithm – Learning Rule Set – First
Order Rules – Sets of First Order Rules – Induction on Inverted Deduction – Inverting
Resolution – Analytical Learning – Perfect Domain Theories – Explanation Base
Learning – FOCL Algorithm –Reinforcement Learning – Task – Q-Learning –
Temporal Difference Learning

Text Books
1. Tom M. Mitchell, Machine Learning, McGraw-Hill, 1st edition, 1997 Ethem Alpaydin,
2. Introduction to Machine Learning (Adaptive Computation & Machine Learning ), The
MIT Press 2004
3. Foundations of Machine Learning, Mehryar Mohri, Afshin Rostamizadeh, Ameet
Talwalkar
4. Davis [Link], “Genetic Algorithms: Search, Optimization and Machine Learning”,
Addison Wesley, N.Y., 1989.

Reference Books
1. Hastie. T, Tibshirani. R, Friedman. J. H, The Elements of Statistical Learning,
Springer,1st edition, 2001
2. William [Link], “Machine Learning Methods in the Environmental Sciences”,
Cambridge
3. Han Kamber, “Data Mining Concepts and Techniques”, Morgann Kaufmann Publishers

VJTI [Link]. – Information Technology– 2016-17|P a g e 2 5

 Programme Bachelor of Technology in Semester – VI
Name Information Technology
Course Code IT3010_T
Course Title Advance Architectures
Prerequisites

COURSE OUTCOMES
1. Student will be able to analyze and appreciate the applications which can use parallel
computing, distributing processing.
2. Student will be able to understand pipeline processing methods.
3. Student will be able to understand the interconnection network, multi-core/ many-core
architecture.

Course Contents
Introduction
Parallel Computing, Parallel Architectures: Architecture classification scheme, Many core
GPGPU architectures, Performance matrices of processors, Parallel Programming model,
Parallel Algorithms, Distributed processing.

Pipeline Processing
Pipeline performance, Arithmetic pipeline, Mathematic pipeline, Pipeline instruction
processing, Pipeline stage design, Hazards, Dynamic instruction scheduling, memory
system used in pipeline processors, Pipeline scheduling, Theory, Branch Prediction.

Interconnection Network
Introduction to permutation, Elementary permutation used in Interconnection Network,
Network classification, complete processors, commonly used interconnection network.

Multi-core/many-core architecture
Basics of parallel architecture. Inter-process communication, Synchronization, Mutual
exclusion, Introduction to multi-core/many-core architecture Introduction to multi-
core/many-core programming, AMD/ATI GPU architectures, GPU Hardware: Streaming
Multiprocessors, Kernel, Thread Blocks, Threads, GPU Memory Model: Synchronization,
Barrier, Memory access, Coalesce, Atomics,

Parallel Programming Models

Parallel programming with message passing using MPI, Directives based parallel
programming models, OpenMP, OpenACC, Thread-level parallelism, GPU architectures
and the programming model for GPGPU (CUDA). Communication Patterns: Map, Gather,

VJTI [Link]. – Information Technology– 2016-17|P a g e 2 6

Scatter, Stencil, Transpose, Strategies for efficient CUDA programming

Principles of Parallel Algorithm Design

Pure parallel algorithms and data dependencies, Decomposition Techniques,
Characteristics of task and interactions, Mapping technique for load balancing, Method for
containing Interaction overhead, Parallel algorithm model.

Analytical modeling and parallel program

Basic performance measures, measures of data communication, Multiplication factors,
effect of software, cognitive system, benchmarking, defining and measuring cost,
scalability of parallel system.

Numerical and Non-numerical algorithms

Sorting, graphs, dynamic programming, dense matrix algorithms, sparse matrix algorithms

Supercomputing
Introduction to Grid, Cluster, GPGPUs architectures, Job Management Systems, File
Systems: Shared File Systems (e.g. NFS), Parallel File Systems (e.g. GPFS, PVFS,
Lustre), interconnection networks for supercomputers. Case studies on Supercomputers.

Text Books
1. Hawang Kai and Briggs F. A., “Computer Architecture and Parallel Processing”,
McGraw Hill, 1984.
2. T. J. Fountain, “Parallel Computing: Principles and Practice”, Cambridge University
Press, 2006.
3. Ananth Grama, “An Introduction to Parallel Computing: Design and Analysis of
Algorithms”, Pearson publication, 2009.

Reference Books
1. Bhujade Moreshwar R., “Parallel Computing”, New Age International Pvt. Ltd., 2008.

2. Jorden H. F. and Alaghaband G., “Fundamentals of Parallel Processing”.

3. M.J. Quinn, “Parallel Programming”, Tata McGraw Hill.

4. Shasikumar M., “Introduction to Parallel Processing”, PHI Publication.

VJTI [Link]. – Information Technology– 2016-17|P a g e 2 7

Programme Bachelor of Technology in Semester – VI
Name Information Technology
Course Code IT3010_P
Course Title Advance Architecture Lab
Prerequisites

COURSE OUTCOMES
1. Student will be able to analyze and appreciate the applications which can use parallel
computing, distributing processing.
2. Student will be able to understand pipeline processing methods.
3. Student will be able to understand the interconnection network, multi-core/ many-core
architecture.

Experiment List
1. Install and configure MPI & OpenMPI
2. Install and Configure CUDA/OpenCL, OpenACC
3. Write a parallel program to print input message supplied by user.
4. Write a parallel program to add two matrices of order n * n.
5. Write a parallel program to multiply a matrix of order n x n by a vector of size n.
6. Write a parallel program to find the largest element of n elements.
7. Write a parallel program to sort n elements, using any sorting technique
8. Write a parallel program to count no. of characters, words and lines in a file.
9. Write a parallel program to perform Matrix operations, like Transpose, Inverse, etc.
10. Write a parallel program to solve a set of linear equations using gauss elimination
method.
11. Write a parallel program to find roots of an equation using N-R method.
12. Write a parallel program to find minimal path (minimal cost) in an undirected graph
13. Install and configure 5 node cluster with parallel file system, job management system,
and suitable interconnect.
14. Develop any application which can take large volume of data to run on cluster built
(exp.12).

Text Books
1. Fayez Gebali, “Algorithms and Parallel Computing”, Wiley, 2011
2. Karl Kopper, “The Linux Enterprise Cluster: Build a Highly Available Cluster with
Linux”
3. Thomas Sterling, et al, How to Build a Beowulf: A Guide to the Implementation and
Application of PC Clusters, Scientific and Engineering Computation Series

VJTI [Link]. – Information Technology– 2016-17|P a g e 2 8

Programme Bachelor of Technology in Semester – VI
Name Information Technology
Course Code IT3011_T
Course Title Wireless Networks
Prerequisites Computer Networks

COURSE OUTCOMES
1. To demonstrate the fundamentals of wireless technology.
2. To demonstrate knowledge of the adhoc network.
3. To demonstrate working knowledge of wireless protocols.
4. To demonstrate the knowledge of wireless networks.

Course Contents
Introduction
History of wireless communication , Frequency spectrum, Applications

Wireless Transmission
Frequency for radio transmission, Signals, Antennas, Signal propagation, Spread
spectrum, Cellular systems.

Medium Access Control

Motivation for a specialized MAC: Hidden and Exposed terminals. Near and Far
terminals

Wireless LAN
Infrared vs. Radio transmission, Infrastructure and Ad hoc Networks, IEEE 802.11:
System architecture, Protocol architecture, Physical layer, Medium access control layer,
MAC management, Future development; HIPERLAN: Brief Overview; Bluetooth: Brief
Overview; IEE 802.15.

Mobile Network Layer

Mobile IP: Goals, assumptions and requirements, Entities and Terminology, IP packet
delivery, Agent advertisement and discovery, Registration, Tunneling and Encapsulation
, Optimizations, Reverse tunneling, Ipv6; Dynamic host configuration protocol, Ad hoc
networks: Routing, Destination sequence distance vector, Dynamic source routing,
Hierarchical algorithms, Alternative metrics

VJTI [Link]. – Information Technology– 2016-17|P a g e 2 9

 Mobile Transport Layer
Traditional TCP: Congestion control, Slow start, Fast retransmit/fast recovery,
Implications on mobility; Indirect TCP, Snooping TCP, Mobile TCP, Fast retransmit/fast
recovery, Transmission/time-out freezing, Selective retransmission, Transaction oriented
TCP

Support for Mobility

File system , World Wide Web, Wireless application protocol .

Study of Wireless networks

WSN: Introduction, Applications, Study of physical, MAC, Network layer of WSN.
Study of cellular networks: GSM , CDMA.
Study of WiMax

Text Books
1. Jochen Schiller, “Mobile communications”, Addison wesley, Pearson education, 2 nd
Edition, 2002.

Reference Books
1. Wiiliam Stallings, “Wireless Communications and Networks” Prentice Hall, 2 nd
edition ,2005
2. Rappaort, “Wireless Communications Principals and Practices” , 2 nd Edition,
Pearson Education Pvt. Ltd, 2003

VJTI [Link]. – Information Technology– 2016-17|P a g e 3 0

Programme Bachelor of Technology in Semester – VI
Name Information Technology
Course Code IT3011_P
Course Title Wireless Networks Lab
Prerequisites Computer Network

COURSE OUTCOMES
1. Build the topology for wireless networks.
2. Test the working behaviour of protocols in wireless networks.
3. Analysis of protocols in wireless networks.

Experiment List
Sr. Title
No
1 Study of Simulators for wireless networks.

2 Build and configure Ad-hoc networks for various topologies.

3 Study of working Physical MAC, Network, Transport Layer parameters.

4 Study and Analysis of protocols at different layers.

5 To Build and Study Star topology for wireless sensor network.

6 To Build and Study Multi-hop topology for wireless sensor network.

7 Study and analysis of protocols for wireless sensor network

8 To study and Implementation Cellular Network.

VJTI [Link]. – Information Technology– 2016-17|P a g e 3 1

Programme Bachelor of Technology in Semester – VI
Name Information Technology
Course Code IT3011_T
Course Title Information Security
Prerequisites Computer Network, Operating System, DBMS

COURSE OUTCOMES
1. Understand concept of threats, vulnerability and control.
2. Students will be able to code: security in programs, including applications, operating
systems, database management systems and networks.
3. Understand the fundamental concept of web security.
4. Understand security law, privacy and ethics: non-technical approaches by which society
controls computer security risk.

Course Contents
Introduction

Security Attacks, Types of Attacks, Active and Passive Attacks, Services and Mechanisms ,
Classical cryptosystems , Substitution and Transposition Ciphers ,Cryptanalysis , Stream and
Block Ciphers , Shannon’s Theory of Confusion and Diffusion.

Mathematical Foundations

Basic Number Theory , Congruences ,Chinese Remainder theorem ,Modular exponentiation

,Fermat and Euler's theorem , Finite fields, Discrete Logarithms.

Symmetric key Ciphers

Modern Block Ciphers - DES, AES, Modes of Operation of Block Ciphers, Differential
Cryptanalysis ,Triple DES , Stream Ciphers , Pseudorandom Functions

Asymmetric key Cryptography

RSA Cryptosystem , El Gamal Cryptosystem, Elliptic Curve based Cryptography, Diffie
Hellman Key Exchange.

VJTI [Link]. – Information Technology– 2016-17|P a g e 3 2

Crptographic Hash Functions
Merkle Damgard Construction , Applications of Cryptographic Hash Functions, Secure Hash
Algorithm, Message Authentication Code- Message Authentication Requirements and
Functions, ,HMAC, Digital Signature Schemes

Network Security Applications

Authentication Applications, Needham Shroeder Protocol , Kerberos , X.509 Certificates,
Public Key Infrastructure

Network Security
Threats in Networks , IP Spoofing, SYN Flooding , Denial of Service Attacks , Smurf
Attacks ,ARP Spoofing, Transport Layer Security ,Secure Socket Layer Protocol , IP Layer
Security , IPsec, IKE protocol Email security – Pretty Good Privacy PGP, S/MIME

System security
Intruders , Malicious software , Viruses,Worms and Trojans, Firewalls , Features of Firewall,
Types of Firewalls ,Placement of Firewalls , Configuration of Firewalls , Intrusion Detection
System – Types of IDS, Intrusion Prevention System

Text Books
1. Behrouz Forouzan and Debdeep Mukhopadhyay, Cryptography and Network Security,
Tata McGraw Hill ,3rd edition.
2. Bernard Menezes, “Network security and cryptography” Cengage learning publications.
3. William Stallings, Cryptography and Network Security, 6th Edition, Pearson Education,
March 2013

Reference Books
1. Charles Pfleeger,Security in Computing, 4th Edition, Prentice Hall of India, 2006.

2. Atul Kahate, Cryptography and Network Security,3rd edition, Tata McGraw Hill,2013

VJTI [Link]. – Information Technology– 2016-17|P a g e 3 3

Programme Bachelor of Technology in Semester – VI
Name Information Technology
Course Code IT3011_P
Course Title Information Security Lab
Prerequisites Computer Network, Operating System, DBMS

COURSE OUTCOMES
1. Understand concept of threats, vulnerability and control.
2. Students will be able to code: security in programs, including applications, operating
systems, database management systems and networks.
3. Understand the fundamental concept of web security.
4. Understand security law, privacy and ethics: non-technical approaches by which society
controls computer security risk.

Experiment Lists
1. Program Security: For the given case study apply secure software life cycle.
2. System Security: Information system security management, Study of Windows, UNIX
and Linux security.
3. Database Security: Data management, security management, performance monitoring,
backup and recovery using oracle.
4. Web security: Web Browser and Client security, Web security, Electronic Mail Security,
Server Security.
5. Network Security: Network monitoring, host monitoring, Network scanning, Network
attack and Defense mechanism, tools, firewalls, IDS
6. Study of Network Monitoring and Analysis Tools: Wireshark, PacketTracer, Network
Miner, ntopng, Vulnerability scanning: Nessus, Nikto, WebInspect, etc
7. Digital Forensic Analysis: Case study on forensic analysis and documentation, Integrated
Cyber Security, Forensic tools and Antiforensic tools.

VJTI [Link]. – Information Technology– 2016-17|P a g e 3 4

Programme Bachelor of Technology in Semester – VI
Name Information Technology
Course Code IT3101S
Course Title Bio-informatics
Prerequisites

COURSE OUTCOMES
1. Student will be able to analyze and appreciate the applications which can use bio-
informatics.
2. Student will be able to understand sequence data banks, sequence analysis secondary
structure prediction.

Course Contents
Introduction
Introduction to Genomic data and Data Organization

Sequence Data Banks

Introduction to sequence date banks - protein sequence data bank. NBFR-PIR,
SWISSPROT, Signal peptide data bank, Nucleic acid sequence data bank - GenBank,
EMBL nucleotide sequence data bank, AIDS virus sequence data bank. RRNA data bank,
structural data banks - protein Data Bank (PDB), The Cambridge Structural Database
(CSD) : Genome data bank - Metabolic pathway data :Microbial and Cellular Data Banks.

Introduction to MSDN(Microbial Strain Data Network)

Numerical Coding Systems of Microbes, Hibridoma Data Bank Structure, Virus
Information System Cell line information system; other important Data banks in the area
of Biotechnology/life sciences/biodiversity.

Sequence Analysis
Analysis Tools for Sequence Data Banks; Pair wise alignment -NEEDLEMAN and
Wunsch algorithm, Smith Waterman, BLAST, FASTA algorithms to analyze sequence
data: Sequence patterns motifs and profiles.

Secondary Structure predictions

Prediction algorithms; Chao-Fasman algorithm, Hidden-Markov model, Neural
Networking. Tertiary Structure predictions; prediction algorithms; Chao-Fasman
algorithm, Hidden-Markov model, Neural Networking

Applications in Biotechnology

VJTI [Link]. – Information Technology– 2016-17|P a g e 3 5

Protein classifications, Fold libraries, Protein structure prediction: Fold recognition
(threading), Protein structure predictions: Comparative modeling (Homology), Advanced
topics: Protein folding, Protein-lig and interactions, Molecular Modeling & Dynamics,
Drug Designing.

Text Books
1. Atwood,”Introduction to Bioinformatics”, Pearson Education ,1st edition, 2002
2. Baxevanis, A.D., Quellette, B.F.F., “Bioinformatics: A practical Guide to the Analysis of
Genes and Proteins”, John Wiely & Sons., 2005

Reference Books
1. Cynthia Gibas and Per Jambeck, “Developing Bioinformatics Computer Skills”, 2001
SPD
2. Smith, D.W.,”Biocomputing: Informatics and Genome Project”, Academic Press, NY,
1994

VJTI [Link]. – Information Technology– 2016-17|P a g e 3 6

Programme Bachelor of Technology in Semester – VI
Name Information Technology
Course Code IT3102S
Course Title Compiler Design
Prerequisites Theory of Computation

COURSE OUTCOMES
1. Students will be able to apply the knowledge of Lex tool & Yacc tool to devleop a
scanner & parser.
2. Students will be able to understand and design code generator.
3. Students will be able to learn the new code optimization techniques to improve the
performance of a program in terms of speed & space.

Course Contents
Language Processors
Translators - Compilers and Interpreters,The Phases of Compilers,Errors in different
phases, Analysis and Synthesis phases, Compiler Construction Tools.

Lexical Analysis
Role of Lexical Analyzer, , Input buffering, Expressing Tokens by Regular Expressions ,
Converting regular expressions to DFA, Minimization of DFA, LEX tool, Design of
Lexical Analyzer for a sample Language.

Syntax Analysis
Role of the Parser, Context Free Grammars ,Top-down parsing, Recursive descent and
predictive parsers LL(1) parser, Bottom-Up parsing, Operator precedence parsing, LR,
SLR and LALR Parser, Error Handling and Recovery in Syntax Analyzer,YACC tool,
Design of a Syntax Analyzer for a Sample Language .

Syntax Directed Translation

Syntax directed Definitions, Construction of Syntax Tree, Top-down translation and
Bottom-up evaluation of inherited attributes, Design of predictive translator ,Type
Systems,Specification of a simple type checker, Equivalence of Type Expressions,Type
Conversions.

Run Time Environments

Storage Organization, Activation Trees, Activation Records, Stack Allocation of
activation records,Parameter passing mechanisms

Intermediate Code Generation

Intermediate languages: graphical representations, data flow analysis, DAGs, Three
address code, Types of three address statements, Syntax directed translation into three

VJTI [Link]. – Information Technology– 2016-17|P a g e 3 7

address codes, Implementation of three address statements.

Code Optimization
Machine dependent and machine independent code optimization, Sources of
Optimization, Early Optimizations: Constant-Expression Evaluation (Constant Folding,
Algebraic Simplifications and Reassociation, Value numbering, Copy Propagation.
Redundancy Elimination: Common-Subexpression Elimination, Loop-Invariant Code
Motion, Partial-Redundancy Elimination, Redundancy Elimination and Reassociation,
Code Hoisting. Loop Optimizations: Induction-Variable optimizations, Unnecessary
Bounds Checking Elimination.

Code Generation: Issues in the design of a code generator, The target machine, Run-
time storage Management, Basic blocks and flow graphs, Next-use information, A simple
code generator.

Text Books
1. Alfred V. Aho, Monica S. Lam, Ravi Sethi, and Jeffrey D. Ullman, “Compilers:
Principles, Techniques and Tools”, Pearson ,2nd edition

Reference Books
1. Leland Beck , “System Software”, Addision Wesley
2. Kenneth C. Louden; “Compiler Construction, Principles and Practice”, Cengage
Learning.
3. [Link] , System programming and Operating System, McGraw Hill, 2nd
revised edition,1999.

VJTI [Link]. – Information Technology– 2016-17|P a g e 3 8

Programme Bachelor of Technology in Semester – VI
Name Information Technology
Course Code IT3103S
Course Title Graph Theory
Prerequisites

COURSE OUTCOMES
1. Students will be able to apply the knowledge of Vertex cover, matching theorem.
2. Students will be able to understand connectivity and coloring of the graph.
3. Students will be able to learn the new special classes of graph, network flow, probabilistic
method and minor theory of graph.

Course Contents
Covering Problem

Vertex Cover, Matchings theorem and applications, Pathcover theorem and applications

Connectivity

2-connected and 3- connected graphs, Hamiltonicity, k-linkedness

Coloring

Vertex Coloring, Edge Coloring, List Coloring, Chromatic Polynomial, k-critics graphs,
Acyclic coloring, Other Coloring Problems

Special classes of graphs

Perfect graphs, Weak Perfect Graph Theorem, Planar graphs, Other special classes of
graphs.

Network flow
Network flows, Circulation and tensions, Chapter 6: Random Graphs and Probabilistic
Methods

Random Graph and Probabilistic Methods

Random Graph, Probabilistic Methods, Markov, Chebishey Inequalities, Lovasz Local
Lemma

VJTI [Link]. – Information Technology– 2016-17|P a g e 3 9

Minor Theory
Introduction to minor theory, tree decomposions

Text Books
1. R. Diestel, "Graph Theory", Springer-Verlag, 3nd edition, 2006.

Reference Books
1. R. Balakrishanan and K Ranganathan, "Graph Theory", Springer-Verlag, 2nd edition,
2012.

VJTI [Link]. – Information Technology– 2016-17|P a g e 4 0

Programme Bachelor of Technology in Semester – VI
Name Information Technology
Course Code
Course Title Web Technology Lab
Prerequisites Awareness about internet, client and server side scripting languages

COURSE OUTCOMES
Student should be able to design interactiveweb sites as per the requirements of applications.

Course Contents
INTRODUCTION:
Basic tools of internet access, email, ftp, news, www, introduction to internet
programming, Electronic Mail, File Transfer protocol, domain Name, client
server application
WEB PAGE DESIGNING:
Standard use for www documents on internet, HTTP, MIME, SGML,DTD,
MTNL, URL, URL, Static andDynamic Web sites ,Creation of web pages:
HTML tags, special characters, images, tables, forms, the hyperlinks, Frames ,
style sheets
SCRIPTING:
JAVA SCRIPT Introduction to JavaScript, Basic Syntax, Control Structures,
Writing Functions, The Document Object Model, Events Handling.
XML:
XML basics, understanding markup languages, structures and syntax, valid vs.
well-formed XML, DTD(document type Definitions) [Link] XML,
XML processor, parent child relationship, XML as a data, data type in XML,
XML namespaces,
[Link] Fundamentals:
HTTP and HTML, [Link] Controls, Data Validation Controls, Working with
Images, CSS
WEBSITE DESIGN USING [Link]:
Designing sample application in [Link], GET & POST Requests in forms
INTRODUCTION:
Basic tools of internet access, email, ftp, news, www, introduction to internet
programming, Electronic Mail, File Transfer protocol, domain Name, client
server application
Text Books
1. Web Technologies: Achyut S. Godbole&AtulKahate, 2nd edition Tata McGraw
Hill publication.

2. Internet and World Wide Web – How to program by Dietel and Nieto PHI/Pearson
Education Asia

VJTI [Link]. – Information Technology– 2016-17|P a g e 4 1

Reference Books
1. [Link] 3.5 Unleashed, By Stephan Walther
2. Sams Teach Yourself JavaScript in 24 Hours, By Michael Moncur.

VJTI [Link]. – Information Technology– 2016-17|P a g e 4 2