VJTI SYLLABUS

Veermata Jijabai Technological Institute
1

VEERMATA JIJABAI TECHNOLOGICAL INSTITUTE
[ Autonomous Institute affiliated to University of Mumbai ]

SYLLABUS
FOR
S.Y. B. TECH.
(Computer Engineering)

VEERMATA JIJABAI TECHNOLOGICAL INSTITUTE,
[V.J.T.I.]
MATUNGA, MUMBAI 400 019.

[ YEAR 2010-2011 ]

2

Scheme of Teaching and Evaluation
S Y B Tech (Computer Engineering)
(Semester III)

Theory Courses
Course
Code
Course Name Hr/Week Credits
Examination Scheme
(Evaluation in % Weightage)
L T P TA IST ESE Total
ESE
(W)
(hrs)
MA0205 Engineering Mathematics - I 3 1 - 4 10 30 60 100 3
CO0201
Information Theory &
Coding
3 - - 3 10 30 60 100 3
CO0202 Computer Programming - II 3 1 - 4 10 30 60 100 3
CO0203
Discrete Structures &
Applications
3 1 - 4 10 30 60 100 3
CO0204 Operating Systems 3 - - 3 10 30 60 100 3
CE0221 Environmental Studies 3 - - 3 10 30 60 100 3
Total 18 3 - 21

Laboratory Courses
Course
Code
Course Name Hr/Week Credits
Examination Scheme
L T P TA
ESE (O / P)

Total
ESE (P)
(hrs)
CO1201
Information Theory &
Coding Lab
- - 3 1.5 50 50 100
CO1202
Computer Programming -
II Lab
- - 3 1.5 50 50 100
CO1203 Operating Systems Lab - - 3 1.5 50 50 100
HM1221
Industrial Economics &
Mgmt Lab
- 3 1.5 50 50 100
Total - - 12 6

Co-curricular Activities
Course
Code
Course Name Hr/Week
L T P
CC4231
Industry-Academia
Interaction
- - 2 A/NA
Total - - 2 -

Total for
Semester
L T P Total Hours Credits
18 3 14 35 27
Abbreviations:
L: Lectures, T: Tutorial, P: Practical, TA: Teacher Assessment, ESE (P): End Semester Practical Examination, ESE (O):
End Semester Oral Examination, IST: In Semester Test/s, ESE (W): End Semester Written Examination, ESE (W) (hrs):
End Semester Written Examination duration, ESE (O) (hrs): End Semester Practical Examination (duration), A/NA:
Attended/Not Attended
Notes:
TA for Theory and Laboratory courses shall carry 25 marks.
IST: One mid semester test (40 marks of two hour duration) and two surprise Tests/Quizzes (5% weightage each). ESE (W)
shall be of 100 marks of 3 hours, ESE (P) and ESE (O) shall be decided as per course requirement. ESE (O) and ESE (P)
shall together carry 25 marks.
Industry - Academia Interaction: Wednesday afternoon slot will be used. Module or broad subject outline will be decided
by the course coordinator. Lectures as per module in the defined areas of eminent personalities from industry or academia
will be arranged. Assessment will be done on the attendance of the students for the module. More than 60%: Attended,
otherwise: Not Attended.


3

Scheme of Teaching and Evaluation
S Y B Tech (Computer Engineering)
(Semester IV)

Theory Courses
Course
Code
Course Name Hr/Week Credits Examination Scheme
L T P TA IST ESE Total ESE (W)
(hrs)
MA0206 Engineering Mathematics -
II
3 1 - 4 10 30 60 100 3
CO0205 Electronics &
Communication Systems
3 - - 3 10 30 60 100 3
CO0206 Computer Organization,
Assembly & Maintenance
3 1 - 4 10 30 60 100 3
CO0207 TCP/IP Suit 3 1 - 4 10 30 60 100 3
CO0208 Data Structures &
Algorithms
3 - - 3 10 30 60 100 3

Total 15 3 - 18

Laboratory Courses
Course
Code
Course Name Hr/Week Credits Examination Scheme
L T P TA ESE (O / P)

Total ESE
(P)
(hrs)
CO1204 Hardware and Maintenance
Lab
- - 3 1.5 50 50 100
CO1205 Open Source Tools and
Technologies Lab
- - 3 1.5 50 50 100
CO1206 Computer Networking Lab - - 3 1.5 50 50 100
CO1207 Data Structures & Algorithms
Lab
- - 3 1.5 50 50 100
Total - - 12 6

Co-curricular Activities
Course
Code
Course Name Hr/Week
L T P
CC4241 Industry-Academia Interaction - - 2 A/NA
CC4232 E-Library/ Internet - - 3 -
Total - - 5 -

Total for
Semester
L T P Total Hours Credits
15 3 14 35 24
Abbreviations:
L: Lectures, T: Tutorial, P: Practical, TA: Teacher Assessment, ESE (P): End Semester Practical Examination, ESE (O): End
Semester Oral Examination, IST: In Semester Test/s, ESE (W): End Semester Written Examination, ESE (W) (hrs): End Semester
Written Examination duration, ESE (O) (hrs): End Semester Practical Examination (duration), A/NA: Attended/Not Attended
Notes:
TA for Theory and Laboratory courses shall carry 25 marks.
IST: One mid semester test (40 marks of two hour duration) and two surprise Tests/Quizzes (5% weightage each). ESE (W) shall
be of 100 marks of 3 hours, ESE (P) and ESE (O) shall be decided as per course requirement. ESE (O) and ESE (P) shall together
carry 25 marks.
Industry - Academia Interaction: Wednesday afternoon slot will be used. Module or broad subject outline will be decided by the
course coordinator. Lectures as per module in the defined areas of eminent personalities from industry or academia will be
arranged. Assessment will be done on the attendance of the students for the module. More than 60%: Attended, otherwise: Not
Attended.
E- Library/ Internet: Every theory course must have at least one assignment or case-study which requires exhaustive internet
search/support.


4

Programme Name : S.Y. B. Tech. (Computer Engineering) SEMESTER III
Course Code :
MA0205
Course Title : ENGINEERING MATHEMATICS - I

Course Contents

Module 1 Complex Variables

1.1 Function of complex variable. Analytic function, Necessary and sufficient conditions
for f(Z) to be analytic Cauchy-Riemann equations in polar coordinates.

1.2 Milne-Thomson method to determine analytic function f(Z) when its real or imaginary
part or its combination is given.

1.3 Harmonic function, orthogonal trajectories. Transformations

1.4 Conformal mapping, linear bilinear mapping with geometrical interpretation. Cross
ratio

1.5 Fixed points and standard transformations such as Rotation and magnification
translation, inversion.

Module 2 Laplace Transforms

2.1 Functions of bounded variation

2.2 Laplace transforms of standard functions such as

t erf at at at e t
at n
, sinh , cos , sin , , , 1

2.3 Linear property of Laplace transforms.

2.4 First shifting theorem, Second shifting theorem

t f
dt
d
L du u f L
t
t f
L t f L t f t L
n
n
t
n
, , , ,
0

2.5 Change of scale property: Unit step functions, Heaviside, Dirac delta functions,
Periodic functions and their Laplace transforms.

2.6 Inverse Laplace transform using linear property, theorems, partial fractions and
convolution theorem.

2.7 Application to solve ordinary differential equations with one dependent variable.
Module 3 Fourier Series

3.1 Orthogonal orthonormal sets, Expressions of a function in Series of orthogonal
functions.


5

3.2 Dirchlets conditions.

3.3 Fourier series of periodic function with period l 2 , 2

3.4 Dirchlets theorem, even and odd functions.

3.5 Half range expansions, Parsevals relations.

3.6 Complex form of Fourier series.

3.7 Fourier integral and Fourier transform.

Module 4 Matrices

4.1 Types of matrices

4.2 Adjoint (Adjugate) of a matrix.

4.3 Elementary transformations of matrix

4.4 Linear dependent and independent of rows/columns over a field

4.5 Rank of a matrix.

4.6 Reduction to a normal form.

4.7 Partitioning of matrix: System of homogeneous and non-homogeneous equations,
their consistency and solution.
Text Books

1. Advance Engineering Mathematics: H K Dass, S Chand & Co. 3
rd
edition
2. Complex Variables & Applications: Churchil, Mc Graw Hill, 2003, 7
th
Edition

Reference Books

1. Theory of functions of complex variables, Shanti Narayan, S chand & Co, 2006.
2. Applied Mathematics - III, G. V. Kumbhojkar- Jamnadas & Co. 7
th
Edition-2009.


6

Course Code : CO0201
Course Title : INFORMATION THEORY & CODING

UNIT 1 : INFORMATION THEORY
Entropy and Uncertainty; Entropy and Mutual Information, Differential Entropy, Information Content;
Rate of a language; Redundancy; Complexity Theory: Computational complexity; Number Theory;
Modular Arithmetic: Fermat's Little Theorem; Chinese Remainder Theorem; Prime Number Generation

UNIT 2 : CRYPTOGRAPHIC TECHNIQUES
Keys and Keys Management; Public Key Management; Public Key Cryptography; Principles of Public
key Cryptosystems, The RSA Algorithms, Diffie Hellman Key Exchange, Public Key Algorithms;
Encrypting data for storage/communication; Data Encryption Standard ( DES), AES ,Triple DES, MD5
Message Digest Algorithm, Secure Hash Algorithms, Digital Signatures.
UNIT 3: COMPRESSION ALGORITHMS
Optimal Compression; Compression Algorithms; Huffman Coding; Adaptive Huffman Compression;
Statistical Modeling; Dictionary Based Compression; Sliding Window Compression; Speech
Compression; LZW, RLE; Lossy Compression schemes; JPEG , MPEG
UNIT 4 : CODING THEORY
Source Coding: A logarithmic Measure of Information, Coding for Discrete Sources, The Lempel-Ziv
algorithm, Coding for Analog Sources and optimum quantization, Coding Techniques for Analog
Sources
UNIT 5 :COMMUNICATION SYSTEMS
Random Number Generation; Random Variate Generation, Inverse Transform Technique, Acceptance
Rejection Technique, Discrete Probability.
Characterization of Communication Signals and Systems: Element of Digital Communication
System, Communication Channels and their Characteristics, Representation of Bandpass Signals and
System, Signal Space Representation, Representation of Digitally modulated signals, Spectral
Characteristics of Digitally Modulated Signals, Comparison of Digitally Modulated Methods.
UNIT 6: ERROR CONTROL CODING
Coding for reliable digital transmission and storage; Types of codes; Error Checking codes; Error
Correcting Codes; Block Convolution codes, Coding Schemes; Linear Block Codes; Cyclic Codes; Error
Trapping; Decoding for cyclic codes; Convolution codes.
Text Books
1. Abramson Norman, Information Theory Coding & Cryptography TMH.
2. Adam Drozdek, Elements of Data Compression, Thomson Learning.
Reference Books

7

1. John G. Proakis, Digital Communications, McGRAW-HILL International Editions.
2. Bose Ranjan, Information Theory, Coding & Cryptography TMH.
3. Bruce Schneier, Applied Cryptography: Protocols, Algorithms and source code in C, John
Wiley and Sons,1994.
4. Richard Wells, Applied coding and information theory for engineers, Pearson Education.
5. Rao, Kethe, Information Theory TMH.
6. Vera Pless, "Introduction to the theory of error correcting codes", John Wiley and Sons
7. William Stallings Cryptography & Network Security: Principles and Practice Second Edition
Pearson Educations.
8. Jerry Banks, John S Carson, Barry Nelson, David Nicol, Discrete Event System Simulations
Fourth Edition, PHI.


8

Course Title : COMPUTER PROGRAMMING II

UNIT 1 : INTRODUCTION TO JAVA
Fundamentals of Object-oriented Programming, Evolution of Java, Overview of Java Language: Data
types in Java, Operators and expressions.
Decision Making And Branching: Control Statements such as if .. else, Do statement, For statement ,
the Else if ladder, Jumps in loops , labeled loops, while repetition statement, switch statement, break
and continue statement.
Arrays, Strings and Vectors: Creating one dimensional and multidimensional arrays , Strings, Vectors
, Wrapper classes , Enumerated types, Annotations.
UNIT 2 : OBJECT ORIENTED PROGRAMMING
Classes , Objects And Methods: Defining class , methods, creating objects , Accessing Class
members, Static Methods , Finalizer Methods, Visibility Control, Method overloading , Method
Overriding, Recursion. Interfaces, Constructors and finalizers Methods
UNIT 3 : PACKAGES AND APPLET PROGRAMMING
Java API Packages, Using System Packages, Naming conventions , Creating Packages and Jar Files,
Accessing and using a package, Hiding Classes. Applet Programming
UNIT 4: MULTITHREADING
Creating threads, Extending Thread Class, Stopping and Blocking a thread , Life cycle of a thread ,
Using thread method, Thread exceptions, Implementing the Runnable interface, Inter-thread
communication.
Managing Errors and Exceptions: Types of errors, Exceptions, Syntax of exception handling code,
multiple catch statements, throwing your own exception, using exceptions for debugging.
UNIT 5: GRAPHICS PROGRAMMING
The Graphics class, Lines and Rectangles, Circles , arc and ellipses, Polygons , Drawing Bar charts,
AWT Package and Swings .
UNIT 6: MANAGING FILES & I/O HANDLING
Files and Streams, Stream classes, Byte Stream Classes , Character Stream Classes, Using Streams,
Reading / writing bytes and characters , Interactive Input and Output, Other Stream classes.
Text Books

1. E Balagurusamy ,Programming with Java A Primer , Forth Edition, Tata Mcgraw-Hill
Publication, 2010, ISBN: 978-0-07-014169
2. Steven Holzner etal . Java 2 Programming, Black Book , Dreamtech Press, 2009

reference books

1. H.M. Deitel, P.J. Deitel , Java - How to Program ,Fifth Edition, PHI Publication , 2003,
ISBN:81-203-2371-8
2. Bruce Eckel Thinking in Java, PHI Publication
3. Patric Naughton ,Michael Morrsison , The Java Handbook McGraw Hill Publication
4. Tim Lindholm,Frank Yellin,Bill Joy,Kathi Walrath, The Java Virtual Machine
SpecificationAddison Wesley Publication

9

Course Title : DISCRETE STRUCTURES AND APPLICATIONS

UNIT 1 : THE FOUNDATIONS
Logics and Proofs
Propositional Logic , Propositional Equivalences, Propositional Algebra, Basic logical operations, De
Morgans laws, Predicates and quantifiers, Nested quantifiers, Rules of Inference, Proof Methods and
strategy.
Applications Of Logic: Translating English statements into propositions, Boolean Searches in web
pages, Logic puzzles, bit operations,
Sets Theory And Its Applications
Sets, Set operations, Universal and Empty sets, Classes of sets , Power sets, Partitions ,Multisets,
Finite Infinite Sets and Counting principles, Principle of inclusion and exclusion, Algebra of sets and
duality.
Applications of sets: Problems on set operations and principle of inclusion- exclusion.

UNIT 2: INDUCTION, SEQUENCES AND SUMMATIONS
Induction and Recursion
Mathematical Induction, Strong induction and structural induction, recursive definitions and structural
induction, recursive algorithms, Structural and Generalized induction.
Applications: Proofs using mathematical induction, Program correctness, Application of Strong in
Computational Geometry, Well-formed formulae
Functions, Sequences and Summations
One-to-one, Onto and Invertible Functions, Mathematical Functions, Exponential and Logarithmic
Functions, Recursively defined functions, Discrete Numeric functions and Generating functions,
Applications Of Functions, Sequences And Summations: Job scheduling Problem, countability of
rational numbers using Cantor Diagonalization argument.

UNIT 3: BASIC COUNTING PRINCIPLES
Permutations, Combinations, Binomial coefficients. Generalizing permutations and combinations,
Combinations and permutations with repetition, Generating Permutations and combinations,
Recurrence Relation, Linear Recurrence Relations With constant Coefficients, Discrete Probability
theory, Conditional Probability, Bayes Theorem,
Applications of Counting Principles: Telephone Numbering plan, Counting Internet Addresses,
Tower of Hanoi, Codeword enumeration, Catalan Numbers, Merge Sort, Fast Multiplication of Integers,
Power series
Pigeonhole Principle and Its Applications: Pigeonhole Principle, Generalized Pigeonhole Principle,
Ramsey theory.

UNIT 4 : RELATIONS
Properties of Binary Relations, Closure of relations, Warshalls algorithm, Equivalence Relations and
partitions, Partial ordering relations and lattices, Chains and Anti chains
Application of Relations: Electronic Circuit Design, n-Ary Relations and their Applications, Databases

10

and relations and SQL.

UNIT 5 :GRAPH THEORY
Basic terminology, multi graphs and weighted graphs, paths and circuits, shortest path in
Weighted graph, Hamiltonian and Euler paths and circuits, factors of a graph, planer graph, Shortest
path algorithm, Travelling salesman problem, Transport Networks, Matching Problem.
Special types of Graphs & applications: Job Assignment, LANs, Interconnection networks for parallel
Computation, mesh networks.
Graph coloring and Applications - scheduling exams, TV Frequency assignment, Compiler
Optimization using Index Registers effectively.

UNIT 6: GROUPS AND APPLICATIONS OF GROUPS
Algebraic Systems, Groups, Semi Groups, Monoid, Subgroups, Permutation Groups, Codes and Group
codes, Isomorphism and Automorphisms, Homomorphism and Normal Subgroups, Fermats Little
Theorem.
Rings and applications of Rings: Integral Domain, Field, Ring Homomorphism, Polynomial Rings and
Cyclic Codes, Groups and coding.

Text Books
1. Kenneth H Rosen, Discrete mathematics & its Applications, 6th edition, Tata McGraw Hill
Publication, 2007, ISBN: 978-0-07-064824-1
2. B. Kolman, R. Busby and S. Ross, Discrete Mathematical Structures, 4th Edition, Pearson
Education, 2002, ISBN 81-7808-556-9

Reference Books
1. N. Biggs, Discrete Mathematics, 3rd Edition, Oxford University Press, ISBN 0 19 850717 - 8
2. E.Goodaire and M. Parmenter, Discrete Mathematics with Graph Theory, 2nd edition,Pearson
Education, 2003 ISBN 81 7808 827 4
3. Semyour Lipschutz & Marc Lipson, Discrete Mathematics, McGraw-Hill, 3
rd
Special Indian
Edition, ISBN-13 : 978-0-07-060174-1
4. N. Deo, Graph Theory with application to Engineering and Computer Science, Prentice Hall of
India, 1990, 0 87692 145 4
5. C. L. Liu and D. P. Mohapatra, Elements of Discrete Mathematics, SiE Edition, TataMcGraw-
Hill, 2008, ISBN 10:0-07-066913-9
6. R. Johnsonbaugh, Discrete Mathematics, 5th Edition, Pearson Education, 2001, ISBN 81
7808 279 - 9


11

Course Title : OPERATING SYSTEMS

UNIT 1:
Structures of Processes: Process States and Transitions, Layout of System Memory, The Context of
a process, Saving the context of a process, Manipulation of the process address space
Process Control: Process Creation, Signals, Process Termination, Awaiting Process Termination,
Invoking other programs, The User ID of a process, Changing the size of a process, The shell, System
boot and the init process,
Process Scheduling and Time: Process Scheduling, System calls for time & clock

UNIT 2: PROTECTION AND SECURITY
Protection: Goals of protection, domain of protection, Access matrix, Implementation of Access matrix,
Revocation of access rights
OS Security: Security problem, User authentication, program threats, system threats, securing system
and facilities, Intrusion detection and cryptography

UNIT 3: RESOURCE MANAGEMENT
Internal Representation of Files: Inodes, Structure of a regular file, Directories, Conversion of a path
name to an Inode, Super Block, Inode assignment to a new file, Allocation of Disk Blocks, Other file
types
Memory Management Policies: Swapping, Demand Paging, a hybrid system with swapping and
demand paging
I/O Subsystem: Driver interfaces, Disk drivers, Terminal drivers, Streams

UNIT 4:INTER-PROCESS COMMUNICATION
Process Synchronization
Background, Critical section problem, semaphores, classic problems of synchronizations, critical
regions, monitors, OS synchronization
Deadlocks: System model, deadlock characterization, methods for handling deadlocks, deadlocks
detection, prevention, avoidance, recovery

UNIT V : LINUX
Introduction to Linux Operating System
Architecture of Linux , Linux Versions , Shell Commands, Shell Scripting, Time Based Shell Script
Execution
Memory Management in Linux :Shell commands: du, df, swapon,mkswap, rc, vmstat, mpstat Memory
Addresses, Segmentation in Hardware, Paging and Segmentation in Linux,
Process Scheduling in Linux :Shell Commands : nice, ps, top, kill,pstree, proc, pgrep, atop, Process
Address Space, Processes, Lightweight Processes, and Threads , Process Descriptor , Process Switch
, Creating and Destroying Processes
File Management :Shell commands: cp, mv, ln, stat, rm, rmdir , touch , Linux File system, The Virtual
Filesystem, Signals, Asynchronous I/O , Swapping , Accessing Files
Process Communication: Shell commands: mkfifo, ipcs, ipcrm, Inter-Process Communication using

12

Pipes and Semaphores, Linux Network Programming.
I/O Architecture and Device Drivers :Shell Commands : iostat ,mount ,lsusb, lspci, I/O Architecture,
The Device Driver Model , Character and Block Device Drivers ,Boot Loader Configuration , RAID ,
LVM .

UNIT 6
Local System Administration :Creating and managing users, Creating groups, Quota Management.
Network Administration:Installation and Configuration of Samba, NFS, DNS, DHCP, FTP, HTTP,
SMTP Servers.

Text Books
1. Silberschatz, Galvin, Gagnes , Operating System Concepts, Sixth Edition , John Wiley & Sons,
ISBN-9971-51-388-9
2. Daniel P. Bovet, Marco Cesati, "Understanding the Linux Kernel Internals", Third edition,
O'Reilly Publication, 2005, ISBN: 0-596-00565-2

Reference Books
1. Dhamdhare D. M., Operating Systems A Concept-Based Approach, Tata McGraw Hill
Publications, 2
nd
Edition-2006
2. Andrew S. Tanenbaum, Modern Operating Systems, 2/e, Prentice Hall India, ISBN-81-203-
2063-8
3. Maurice J. Bach, The design of the UNIX Operating System, Prentice Hall India, ISBN-81-203-
0516-7
4. Alessandro Rubini. ,"Linux Device Drivers", O'Reilly & Associates, 1998, ISBN: 1-56592-292-1
5. William Stallings, Operating System-Internals and Design Principles , 5/e, Prentice Hall India,
ISBN-81-297-01094-3


13

Course Code : CE0221
Course Title : ENVIORNMENTAL STUDIES

Course Contents
Unit 1: The Multidisciplinary nature of environmental studies
Definition, scope and importance, Need for public awareness.
Unit 2: Natural Resources

Renewable and non renewable resources:
a) Natural resources and associated problems
Forest resources: Use and over-exploitation, deforestation, case studies,
Timber extraction, mining, dams and their effects on forests and tribal
people.
Water resources: Use and over-utilization of surface and ground water,
floods, drought, conflicts over water, dams benefits and problems.
Mineral Resources: Use and exploitation, environmental effects of
extracting and using mineral resources, case studies.
Food Resources: World food problems, changes caused by agriculture and
over grazing, effects of modern agriculture, fertilizers- pesticides problems,
water logging, salinity, case studies.
Energy Resources: Growing energy needs, renewable and non-renewable
energy sources, use of alternate energy sources, case studies
Land Resources: Land as a resource, land degradation, man induces land
slides, soil erosion, and desertification.
b) Role of individual in conservation of natural resources.
c) Equitable use of resources for sustainable life styles.
Unit 3: Eco Systems

Concept of an eco system
Structure and function of an eco system.
Producers, consumers, decomposers.
Energy flow in the eco systems.
Ecological succession.
Food chains, food webs and ecological pyramids.
Introduction, types, characteristic features, structure and function of the following eco
systems:-

14

Forest ecosystem
Grass land ecosystem
Desert ecosystem.
Aquatic eco systems(ponds, streams, lakes, rivers, oceans, estuaries)
UNIT 4: Biodiversity and its Conservation

Introduction-Definition: genetics, species and ecosystem diversity.
Biogeographically classification of India.
Value of biodiversity: consumptive use, productive use, social, ethical, aesthetic and
option values
Biodiversity at global, national and local level.
India as a mega diversity nation.
Hot-spots of biodiversity.
Threats to biodiversity: habitats loss, poaching of wild life, man wildlife conflicts.
Endangered and endemic spaces of India.
Conservation of biodiversity: in-situ and ex-situ conservation of biodiversity.
UNIT 5: Environmental Pollution

Definition Causes, effects and control measures of:-
a. Air pollution
b. Water pollution
c. Soil pollution
d. Marine pollution
e. Noise pollution
f. Thermal pollution
g. Nuclear hazards
Solid waste Management: Causes, effects and control measures of urban and industrial
wastes
Role of an individual in prevention of pollution
Pollution case studies
Disaster management: Floods, earth quake, cyclone and land slides
Unit 6: Social issues and the Environment

Form unsustainable to sustainable development
Urban problems related to energy
Water conservation, rain water harvesting, water shed management

15

Resettlement and rehabilitation of people; its problems and concerns, case studies
Environmental ethics: issues and possible solutions
Climate change, global warming, acid rain , ozone layer depletion, nuclear
accidents and holocaust, case studies.
Wasteland reclamation
Consumerism and waste products
Environment protection Act
Air(prevention and control of pollution)Act
Water((prevention and control of pollution)Act
Wildlife protection act
Forest conservation act
Issues involved in enforcement of environmental legislations
Public awareness
Unit 7: Human population and the environment

Population growth and variation among nations
Population explosion- family welfare programme
Environment and human health
Human rights
Value education
HIV/AIDS
Women and child welfare
Role of information technology in environment and human health
Case studies
Unit 8: Field work

Visit to a local area to document environment assets river/ forest/ grassland/ hill/mountain.
Visit to a local polluted site-urban/rural/industrial/agricultural. Study of common plants,
insects, birds. Study of simple ecosystems-pond, river, hills lopes, etc(field work equal to 5
lecture works)
Text Books
1. Textbook of Environmental studies, Erach Bharucha, UGC 2005
2. Fundamental concepts in Environmental Studies, D D Mishra, S Chand & Co Ltd 2010

16

Course Title : INFORMATION THEORY AND CODING LAB

1 Data Compression Techniques: Run Length Coding & Decoding
2 Cryptography: Encryption & decryption with DES
3 Cryptography: Encryption & decryption with AES
4 Cryptography: Public Key Encryption with RSA
5 Cryptography: Stream cipher Techniques RC4
6 Random number generation
7 Huffman coding
8 Cyclic Codings & convolution codes.
Reference Books
1. John G. Proakis, Digital Communications, McGRAW-HILL International Editions.
2. Bose Ranjan, Information Theory, Coding & Cryptography TMH.
3. Bruce Schneier, Applied Cryptography: Protocols, Algorithms and source code in C, John
Wiley and Sons,1994.
4. Richard Wells, Applied coding and information theory for engineers, Pearson Education.
5. Rao, Kethe, Information Theory TMH.
6. Vera Pless, "Introduction to the theory of error correcting codes", John Wiley and Sons
7. William Stallings Cryptography & Network Security: Principles and Practice Second Edition
Pearson Educations.
8. Jerry Banks, John S Carson, Barry Nelson, David Nicol, Discrete Event System Simulations
Fourth Edition, PHI.


17

Course Title : COMPUTER PROGRAMMING - II LAB

1 Study and implement basics of string concatenation and automatic conversion of numbers for
printing to console.
2 Write a program to implement default and parameterized constructors.
3 Write a program to demonstrate the use of implementing interfaces.
4 Write a program to implement multithreaded a client-server based application
5 Write a program to demonstrate interaction between Java Application and Database Server using
JDBC.
6 To develop a program to display a table using swings.
7 To develop a program to demonstrate the communication between client and server using socket
programming.
8 Write a program to demonstrate Exception handling
Reference Books
1. Steven Holzner etal . Java 2 Programming, Black Book , Dreamtech Press
2. H.M. Deitel, P.J. Deitel , Java - How to Program ,Fifth Edition, PHI Publication , 2003,
ISBN:81-203-2371-8


18

Course Title : OPERATING SYSTEMS LAB

1 Setting up of a Print server in Linux
2 Using Linux basic commands and working with linux file system.
3 Automating system tasks using shell scripts
4 Study of process handling commands and implementing process scheduling algorithms
using 1) FCFS 2) Round Robin Scheduling
5 Study of memory management in Linux and implementing page replacement policy
6 Setting up of a Print server in Linux
7 Installation of Samba file server
Reference Books
1 Red Hat Linux Bible Adison Wiley Publication
2 Beginning Linux Programming by Neil Mathew , Richard Stones Wrox


19

Course Code : HM1221
Course Title : INDUSTRIAL ECONOMICS & MANAGEMENT LAB

Concepts
Demand, supply, markets and elasticity of demand, Market failure,
Price control by the Govt.
Central banking, RBI and monetary policy
Government Budget and fiscal policy
Foreign exchange
SWOT analysis
Decision making
Leadership
Motivation
Performance appraisal
Negotiation skills
Professional ethics

Practicals
Class room assignments on the above topics will be in the form of
Case studies
Role plays
Group discussions
Experiential exercises
Seminar presentation

Reference Books
1. Essentials of Management: Koontz and ODonnell, Tata McGraw Hill
2. Survey of Economics : Irwin. B. Tucker, Thomson


20

Programme Name : S.Y. B. Tech. (Computer Engineering) SEMESTER IV
Course Code : MA0206
Course Title : ENGINEERING MATHEMATICS - II

Course Contents

Module 1 Vector Calculus and Analysis

1.1. Scalar and vector point functions, Directional derivative, Curl and Divergence,
Conservative, Irrotational and Solenoid field.
1.2. Line integral, Greens theorem for plane regions and Properties of Line integral.
1.3. Stokes theorem, Gausss divergence theorem(without proof) related identities
and deductions
Module 2 Matrices

Brief revision of vectors over a real field, inner product, norm linear independence
and orthogonality of vectors.
Characteristic polynomial, characteristic equation, characteristic roots and
characteristic vectors of a square matrix, properties of characteristic roots and vectors of
different types of matrices such as orthogonal matrix, Hermitian matrix, Skew-
Hermitian matrix, diagonable matrix, Similar matrices. Cayley Hamiltons theorem
(without proof), Functions of a square matrix, Minimal polynomial and Derogatory matrix.
Quadratic forms, congruent and orthogonal reduction of quadratic form, rank, index,
signature and class value of quadratic form.

Module 3 Complex Variables

3.1 Line integral of a function of complex variable, Cauchys theorem for analytic
function. Cauchys Goursat theorem(without proof), properties of line integral,
Cauchys integral formula and deductions
3.2 Singularities and poles: Taylors and Laurents development (without proof),
Residue at isolated singularity and its evaluation.
3.3 Residue theorem application to evaluate real integrals of type

dx x f d f , , sin , cos
2
0

Text Books

1. Complex variables and applications: Churchil, Mc Graw Hill- 2003, 7
th
Edition
2. Advanced Engineering Mathematics. H.K.Dass S.Chand & Co. Ltd- 3
rd
Edition

Reference Books

1 Theory of functions of complex variables, Shanti Narayan, S Chand & Co
2. Engineering Mathematics- T. Veerarrajan Tata McGraw-Hill- IInd Edition
3. Elements of applied Mathematics, P.N. Wartikar, PVG Prakashan,2
nd
Edition Poona 1964.


21

Course Title : ELECTRONICS & COMMUNICATION SYSTEMS

UNIT 1: TRANSISTORS: BJT AND FET
Bipolar Junction Transistors (BJT) principle, Biasing, Simple remodel, Voltage and Current
amplification. CE, CB, CC amplifier configurations, Frequency Response of BJT, Field Effect
Transistor(FET) principle, Biasing, FET amplifier configurations, Comparison of BJT and FET.
UNIT 2: DIFFERENTIAL & OPERATIONAL AMPLIFIER AND ITS PPLICATIONS
Differential Amplifier - Introduction, Circuit configurations, DC and AC analysis, Operational Amplifier-
Block diagram representation, Ideal op-amp, Virtual Short and Virtual Ground Concepts, Equivalent
circuit, Op-amp with negative feedback, Open-loop configurations, Op-Amp Parameters, Basic op-amp
applications.
UNIT 3: DIGITAL LOGIC DESIGN
Boolean Algebra: Binary logic functions, Boolean laws, Truth tables, Associative and distributive
properties, DeMorgans Theorems, Realization of switching functions using logic gates.
Digital Circuits and Combinational Logic:
Canonical logic forms, Sum of product & Product of sums, K-maps, two, three and four variable
Karnaugh maps, Multiplexer and Demultiplexers, Decoders and Encoders , Code conversion, Priority
encoder, Multiplexers as function generators, Binary adder, Subtractor, BCD adder(IC 7483), BCD
Subtractor, Binary comparator, Arithmetic and logic units.
UNIT 4: SEQUENTIAL LOGIC DESIGN
Sequential circuits, Flip-flops, Clocked and edge triggered flip-flops ,timing specifications, Race-around
Condition, Flip-flops conversion, Application of Flip-flops as asynchronous(Ripple) and synchronous
Counters, Counter design with state equations registers, Shift registers, Study of different Couter ICs
(IC 7490, 7493).
UNIT 5: PRINCIPLES OF COMMUNICATION
Block Diagram of Communication Systems, Baseband Communication, Introductions to signals,
Analysis and transmission of signals,
Analog Communication: Amplitude Modulation, Frequency Modulation, Phase Modulation,
Superheterodyne Receiver
Digital Communication: Sampling Theorem, Delta modulation , Adaptive Delta modulation , and Pulse
Code Modulation
UNIT 6: APPLICATIONS OF COMMUNICATION SYSTEMS
Cellular Telephony, Modem, TDMA CDMA & FDMA, Braodcast FM Stereo and AM, Modems, Dual
Tone Multifrequency (DTMF) Dialing, Television.
Text Books
1. Robert L. Boylestad and Louis Nashelsky "Electronic Devices and Circuit Theory", Eighth
Edition, Pearson Education Asia.

22

2. R.P. Jain Modern Digital Electronics, Second Edition, Tata McGraw Hill.
Reference Books
1. Martin Roden , Gordon L. Carpenter, William Wieserman Electronic Design Concept to
Reality, Fourth Edition , Discovery Press, Indian Edition by Shroff Publishers and Distributors
Pvt. Ltd.
2. Ramakant A. Gaikwad, "OP-Amps and Linear Integrated Circuits", PHI Publishers.
3. Sergio Franco, "Operational Amplifiers and Analog Integrated Circuits", McGraw Hill
International Edition
4. Martin Roden, Analog and Digital Communication Systems, Fifth Edition, Discovery Press.
5. Joseph Waltson, John Miller Transistor Circuit Design, Texas Instrument INC.
6. John M. Yarbrough, "Digital logic", Thomson Learning.
7. D. P. Leach, A. P. Malvino, "Digital Principles and Applications", TMH.
8. M. Morris Mano, "Digital Logic and Computer Design", PHI.
9. John P. Uyemura, Brookes, "Digital Systems Design", Cole publishing Co.
10. B.P. Lathi; Modern digital and analog communication systems, Oxford university press.
11. Taub. Schilling Principles of communication systems, TMH.
12. Denis Roddy and John Coolean, Electronic Communication, Prentice Hall of. India Pvt. Ltd.


23

Course Title : COMPUTER ORGANIZATION, ASSEMBLY & MAINTENANCE

UNIT 1: THE CENTRAL PROCESSING UNIT
Machine Instruction characteristics, types of operands, types of operations, Instruction formats, ALUs,
Fixed Point Arithmetic.
The Control Unit : Hardwired Control , Microprogrammed Control, Microporgrammed Computers.

UNIT 2: MEMORY ORGANIZATION
Characteristics of memory systems, Cache Memory, Organization and Mapping Techniques,
Replacement Algorithms, Virtual Memory: Main Memory allocation, Segmentation, Paging, Address
Translation.
System Organization : Communication, Bus Control, Input Output Systems Programmed I/O, DMA
and interrupts, I/O Processors.

UNIT 3 PARALLEL ORGANIZATIONS
Types of Parallel Processors, Pipeline Processors, Vector Supercomputers, Superscalar Processors,
Multiprocessors, Symmetric Multiprocessors, Clusters

UNIT 4: PC HARDWARE
Memory: Internal and External Memory, Types of memories: ROM: PROM, EPROM, EPROM, RAM:
SRAM, DRAM, SDRAM, RDRAM.
Secondary Storage: Magnetic Disk, Tape, DAT, RAID, Optical memory, CDROM, DVD
Motherboard: Motherboard Logic, Support Chips in Motherboard, Motherboard Circuits,
I/O Control: Printer Controller, Floppy Disk Controller, Hard Disk Controller, Display Adapter,
Keyboard interface, Parallel Interface, DMA Channels, I/O Data Transfer.

UNIT 5: INSTALLATION AND PREVENTIVE MAINTENANCE
Pre-installation planning, Installation Practices, Routine checks, Memory and Hard disk Upgradation,
Preventive maintenance.
UNIT 6: TROUBLESHOOTING
Computer Faults, Nature and Types of Faults, Diagnostic tools, Fault Elimination Process, Systematic
Troubleshooting, Fault Diagnosis, Fault Rectification, Layman Checks, I/O Slot checks, Troubleshooting
Hints, Problem Diagnosis: Case Studies.

Text Books
1. J. Hays, Computer Architecture and Organization, 2nd Edition, McGraw-Hill,
1988 ISBN 0 07 100479 3
2. B. Govindrajalu,IBM PC and Clones, TMH Publication, 1991, ISBN: 0-07-460136-9

Reference Books
1. W. Stallings William, Computer Organization and Architecture: principles of structure and

24

function, 2nd Ed, Maxwell Macmillan Editions, 1990 ISBN 0 02 -946297 5 (Chapter:
2,3,4,5,7,8,9,10,11,12,13,14).
2. A. Tanenbaum, Structured Computer Organization, 4th Ed, Prentice Hall of India, 1991
ISBN 81 203 1553 7 (Chapter: 1,4,5,6,8).
3. G. George, Computer Organization: Hardware and Software, 2nd Edition, Prentice Hall of
India, 1986 (Chapter: 3,4,5).
4. D. Paterson, J. Hennesy, Computer Organization and Design: The Hardware Software
Interface, 2nd Edition, Morgan Kauffman, 2000 ISBN 981 4033 588
5. Robert Bruce Thompson, Barbara Fritchman Thompson, PC Hardware in a Nutshell, Third
Edition, O'Reilly Media, 2003


25

Course Title : TCP/IP SUIT

UNIT 1: NETWORKING FUNDAMENTALS
Introduction to OSI Model and TCP/IP Protocol Suite,
Technologies involved. IP addresses, Subnetting and classless Addresses

UNIT 2: NETWORK DESIGN
Network Topologies, Connecting devices, Bridges, Routers and switches, Routing ,Network
management, Ethernet technology, FDDI, Token ring, High speed Serial link

UNIT 3: APPLICATION LAYER PROTOCOLS
DNS, NFS, DHCP, BOOTP, FTP, TFTP, HTTP, SMTP,SNMP

UNIT 4: TRANSPORT LAYER
UDP: User Datagram, Checksum, UDP Operation, UDP Package;
TCP: TCP Services, Flow Control, Silly Window Syndrome, Error Control, Congestion Control, TCP
Operation and TCP Package.

UNIT 5: NETWORK LAYER
IP Layer Protocols, IPV4 and IPV6 Internet Protocol (IP),DataGram and IP Package ,ARP, RARP,
ICMP, IGMP.

UNIT 6: INTERNET ROUTING
Routing fundamentals, IP Routing Protocols - RIP, OSPF, BGP
Real Time Traffic over the Internet: RTP, RTCP, Virtual Private Network (VPN) and Network Address
Translation (NAT)

Text Books
1. Behrouz Forouzan, TCP/IP Protocol suite, Tata McGraw-Hill Edition
2. Charles M. Kozierok TCP/IP Guide, Shroff Publication Pvt .Ltd.

Reference Books
1. TCP/IP Network Administration, Craig Hunt, Or eilly Publication, 2004
2. Douglas Comer, Internetworking with TCP/IP, Principles, Protocols and
3. Architecture, Volume 1 and volume2, volume3, Pearson Education Asia


26

Course Title : DATA STRUCTURES & ALGORITHMS

UNIT 1: STACK AND QUEUE
Stack: The stack as an ADT, Representation, Stack operation, Application.
Queue: The Queue as an ADT, Representation, Queue operation, Circular and Priority queue,
Applications.

UNIT 2: LINKED LIST
Linked list: Linked list as an ADT, Operation on linked list, Linked stacks and Queues, Array
implementation of Linked List, Linked list using Dynamic Variable, Doubly, circular linked list.

UNIT 3: TREES
Basic tree concept, Binary tree operations and application, Binary tree representation, Binary tree
traversals, Threaded binary tree, Binary tree implementation, Expression
tree, Multiway tree (B-tree, B+ tree, AVL tree)
Graphs: Graphs as an ADT, Graphs representation, Graphs traversal (DFS & BFS), Shortest path
algorithms.

UNIT 4: ALGORITHM DESIGN
Introduction: Basic Concerns, Relationship between Algorithms and other aspects of software, The
Evolution of Algorithm.
Iterative Algorithm Design Issues: Introduction, Use of loops, Efficiency of Algorithms, Estimating and
specifying execution Times, Order Notation, Algorithm strategies.
Computation Models and Design by Refinement: Introduction, Functional Model, Imperative Model
Design by Proof Rules: A fresh look at proof Rules, Designing Correct Programs, Design of a loop, A
simple Design Procedure for loops based on proof-Rules, Example- Selection sort, Design Using
Recursion: Execution Trace, Another look at iteration and Recursion.

UNIT 5: ALGORITHMS
Divide-and Conquer, Greedy Methods, Dynamics Programming, Backtracking.

UNIT 6: ALGORITHM ANALYSIS
Efficiency of Algorithms : Polynomial Time and Non polynomial Time Algorithms, Worst and average
case Behavior, Time Analysis of Algorithms, Efficiency of Recursion, Complexity. Example of
Complexity Calculation: Example from the sorting world, Summary of complexity and characteristics
of sorting algorithms, Complexity of set operations and mappings,
Amortized analysis.
Text Books
1. Y. Langsam, M. J.Augenstein and A. M. Taneubaum Data structures using Java, Pearson
Education.
2. T. H. Cormen, C. E. Leiserson, R. L.Rivest and C. Stein, Introduction to Algorithms,,
Second Edition, MIT Press/McGraw Hill.


27

Reference Books
1. R. F. Gilberg and Behrouz A. Forouzan Data Structure, Thomson Edition.
2. Parag Himanshu Dave, Himanshu B. Dave, Design and Analysis of Algorithms , Pearson
Education.


28

Course Title : HARDWARE AND MAINTENANCE LAB

1 Study and Design of Logic Gate , RS and JK Flip Flops
2 Study of PAM (Pulse Amplitude Modulation), PWM (Pulse Width Modulation), PPM(Pulse
Position Modulation)
3 Study and design of Hardwired Control Unit and Micro Programmed Control Unit
4 Design & implementation of Virtual Memory & Cache Memory Systems
5 Inspection & study of the Physical Architecture of PC
6 Study of BIOS, POST (Power on self test), BOOT sequence
7 Study of different faults with Hardware Components of a PC such as RAM problems,
Display Adapter Problems, Monitor Problems, HDC Problems
8 Use of different diagnostic tools such as CPU Info, Hardware Lister, Hard drive inspector,
Memtest 86+
Reference Books
1. R.P Jain Modern Digital Electronics , Second Edition, TMH.
2. Taub .Schilling Principles of Communication Systems
3. John P. Hayes, "Computer Architecture and Organization", Mc-Graw Hill, Third Edition.
4. B. Govindrajalu ,IBM PC and Clones, TMH Publication.


29

Course Title : OPEN SOURCE TOOLS AND TECHNOLOGIES LAB

1 Installation and configuration of Linux System on System
2 Understand office productivity suit : Open office & GIMP image editor, editors : vi, gedit;
report writing tool: LATEX, educational tool: Moodle.
3 Installation and configuration of Suns Java Programming Language & environment with
Scripting Languages like Java Script, TCL/TK, java editors, eclipse & netbeans.
4 Installation and configuration JSQL for database.
5 Installation and configuration of Apache Web server.
6 Installation and configuration of Wireshark network packet sniffer and analyzer.
7 Install & configure Open Source tools such as Open NMS, Nagios for Network
management & authoring tools : CVS , Subversion, GNU Compiler Collection.

Reference Books
1. A practical guide to Ubutnu Linux(R),Mark Sobell
2. Ubuntu 7.0 Unleashed, Sam's Publications


30

Course Title : COMPUTER NETWORKING LAB

1 Study of various Components such as Routers, Switches and Connecting Networking
devices
2 Network Designing using Networking Devices
3 Study and experimentation using Packet Analyzers such as wireshark, nmap
4 Study and experimentation on Network Simulator such as NS-2
5 Implementation of a Firewall
6 Installation and study of Intrusion Detection System (IDS) such as Snort
7 Design VLAN for an Enterprise Network

Reference Books

1. CCNA Study Guide by Todd Lammle , Sybex Inc; 2nd edition (June 2000) , ISBN 978-
0782126471.
2. Open Source Intrusion Detection System http://www.snort.org/
3. Network Simulator http://www.isi.edu/nsnam/ns/
4. Packet Analysers http://www.wireshark.org , http://nmap.org/


31

Course Title :
DATA STRUCTURES & ALGORITHMS LAB

1 Write a Program to implement Stack and its operations. And its application
2 Write a program to implement Queue and operation and its applications
3 Write a program to implement a Linked List and its applications
4 Write a program to implement Quick Sort
5 Write a program to implement Binary Search and its applications
6 Design of algorithms
7 Analysis of Algorithms

Reference Books
1. Y. Langsam, M. J. Augenstein and A. M. Taneubaum Data structures using Java Pearson
Education.

VJTI SYLLABUS

Hochgeladen von

Dokumentinformationen

Originaltitel

Copyright

Verfügbare Formate

Dieses Dokument teilen

Dokument teilen oder einbetten

Freigabeoptionen

Stufen Sie dieses Dokument als nützlich ein?

Sind diese Inhalte unangemessen?

Copyright:

Verfügbare Formate

VJTI SYLLABUS

Hochgeladen von

Copyright:

Verfügbare Formate

Veermata Jijabai Technological Institute

Das könnte Ihnen auch gefallen