0% found this document useful (0 votes)
120 views51 pages

Syllabus Cbcs III IV 27.09.19

The document outlines a scheme for a four year B.Tech degree course in computer science and engineering. It provides the course code, name, periods, evaluation scheme and credits for subjects in the second year, third semester including computer organization and architecture, digital logic and design, IT workshop, computer networks, and mathematics. It also lists the subjects and evaluation details for the second year, fourth semester.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
120 views51 pages

Syllabus Cbcs III IV 27.09.19

The document outlines a scheme for a four year B.Tech degree course in computer science and engineering. It provides the course code, name, periods, evaluation scheme and credits for subjects in the second year, third semester including computer organization and architecture, digital logic and design, IT workshop, computer networks, and mathematics. It also lists the subjects and evaluation details for the second year, fourth semester.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 51

SCHEME FOR EXAMINATION

B.TECH (FOUR YEAR) DEGREE COURSE


SECOND YEAR, COMPUTER SCIENCE AND ENGINEERING
SEMESTER -III Session 2019-20
Branch :- Computer Science & Engg. Year : II Sem- III
s.n Code no. Subject Periods Evaluation scheme Credits
o
L T P IA ESE TOTAL
1 CS03TES03 Computer
Organization 3 1 0 30 70 100 4
Architecture
2 CS03TPC01 Digital logic &
3 1 0 30 70 100 4
Design
3 CS03TPC02 IT workshop (C++
3 1 0 30 70 100 4
/python )
4 CS03TPCO3 Computer Network
3 1 0 30 70 100 4
5 CS03TBS05 Mathematics III
3 1 0 30 70 100 4
PRACTICAL
1 CS03PPC01 IT workshop
(C++ /python )
- - 4 30 20 50 2
2 CS03PPC02 Digital Logic
- - 4 30 20 50 2
& Design Lab
3 CS03PES05 Computer
Network - - 4 30 20 50 2

Total 26
Year : II Sem.- IV
s.n Code no. Subject Periods Evaluation scheme Credits
o
L T P IA ESE TOTAL
1 CS04TPC04 Discrete
3 1 - 30 70 100 4
Mathematics
2 CS04TES04 Electronic Device &
3 0 -- 30 70 100 3
Circuits
3 CS04TPC05 Operating System
3 1 -- 30 70 100 4
4 CS04TPC06 Data Structure &
3 1 -- 30 70 100 4
Algorithms
5 CS04TPC07 System Software
3 1 - 30 70 100 4
PRACTICAL
1 CS03PPC01 Data Structure & -- -- -- - --
4 2
Algorithms
2 CS03PPC02 Operating System -- -- 4 -- -- -- 2
3 CS03PES05 Electronic Device & -- -- -- -- --
4 2
Circuits
Total 25
SUBJECT CODE /NAME L T P Credit
CS03TES03/ Computer Organization Architecture 3 1 0 4

UNIT-I

Basic of Computer Organization & Architecture: Introduction, Computer Organization vs. Computer architecture,
Von Neumann Architecture vs. Harvard Architecture.

Input & Output Organization: Introduction, Simple Bus Architecture, Types of Buses, I/O Communication
Methodologies: Programmed I/O (Polling), Interrupt-driven I/O & Direct Memory Access (DMA), I/O channel & I/O
Processor, Accessing I/O device: Memory Mapped I/O, Isolated or I/O Mapped.

UNIT-II

Computer Arithmetic: Introduction, Addition & Subtraction: Addition & Subtraction with Signed-Magnitude Data,
Hardware Implementation & Algorithm, Addition & Subtraction with Signed-2’s Complement Data, Multiplication
Algorithm: Hardware Implementation for Signed-Magnitude Data, Hardware Algorithm, Booth Multiplication Algorithm,
Array Multiplier, Division Algorithms: Hardware Implementation for Signed-Magnitude Data & Algorithm , Carry Look
Ahead Adder.

UNIT-III

Memory Organization: Introduction, Types of Memory, Memory Hierarchy, Main Memory, Cache Memory, Virtual
Memory, Associative Memory.

Processor Organization: Introduction, Control Unit: Hardwired Control Unit, Micro programmed Control Unit,
Instruction Set Computer: Reduced Instruction Set Computer (RISC) vs. Complex Instruction Set Computer (CISC).

UNIT-IV

Pipelining: Introduction, Concept of Instruction Pipeline, Design Problems with Pipeline: Structural Hazard, Data
Hazard & Control Hazard, Extension in Pipeline Designed: Super Pipelining, Superscalar Processor, Very Long
Instruction Width (VLIW) Architecture.

UNIT-V

Multiprocessor System: Introduction, Shared Memory Multiprocessor, Distributed Memory Multiprocessor, Flynn’s
Classification: Single Instruction Single Data (SISD), Single Instruction Multiple Data (SIMD), Multiple Instruction
Single Data (MISD), Multiple Instruction Multiple Data (MIMD), Cache Coherence, Message Passing Model, Cluster
Computing, Distributed Computing.

Text Books:

1. Computer System Architecture, M. Morris Mano, Pearson Education India.


2. Computer Organization & Architecture, W. Stalling, Pearson Education India.
3. Computer Architecture & Organization, J. P. Hayes, McGraw-Hill India.
4. Computer System Organization, Naresh Jotwani, Mc Graw Hill, India.
5. Computer System Architecture, P. V. S. Rao, PHI India.
6. Advanced Computer Architecture, Rajiv Chopra, S. Chand India.
7. Computer Organization & Architecture, Lalit K. Arora, Anjali Arora, S. K. Kataria & Sons, India.
8. Computer Fundamentals Architecture & Organization, B Ram, Sanjay Kumar, New Age International, India.

SUBJECT CODE /NAME L T P Credit


CS03TPC01/ Digital logic & Design 3 1 0 4

UNIT-I BINARY SYSTEM


Binary Number , Number Base conversion , Octal and Hexadecimal Numbers Complements, Binary Codes
Binary Storage and Registers , Binary Logic , Integrated Circuits
BOOLEAN ALGEBRA AND LOGIC GATES:
Basic Definitions Axiomatic Definition of Boolean algebra .Basic Theorems and Properties of Boolean
algebra Boolean Functions Canonical and Standard Forms .Other Logic Operations Digital Logic Gates . IC
Digital Logic Families. NAND, NOR, EOR gates.

UNIT II BOOLEAN FUNCTIONS COMBINATION LOIGC


The map method Two and Three Variable Maps, Four Variable Map Product of sums Simplification, NAND
and NOR implementation, Don’t Care Conditions, The Tabulation Method
COMBINATIONAL LOGIC Introduction, Design procedure Adders, Sub tractors .Code Conversion, Analysis
Equivalence Functions

UNIT III COMBINATIONAL LOGIC WITH MSI AND LSI


Introduction Binary Parallel Adder, Decimal, Adder, Magnitude Comparator, Decoders, Multiplexers, Read –
Only Memory (ROM), Programmable Logic Array (PLA) Concluding Remarks

UNIT IV SEQUENTIAL LOGIC


Introduction, Flip –Flops, triggering of Flips –Flops, Analysis of Clocked Sequential Circuits, State
Reduction and Assignment. Flip –Flop Excitation Tables Design Procedure. Design of Counters, Design with
State Equations.

UNIT V REGISTERS, COUNTERS, MEMORY UNIT & FPGA PROGRAMING


Introduction, Registers, shift Registers .Ripple Counters, Synchronous Counters. Timing Sequences, The
Memory Unit Examples of Random Access Memories, FPGA: Introduction, FPGA Programming

REFERENCES:
• Digital Logic & Computer Design PH1 M Mano
• Switching Circuit & Finite automata –ZVI Kohavi (TMH)
• Fletcher W.I.: An engineering approach to Digital design PH1
SUBJECT CODE /NAME L T P Credit
CS03TPC02/ IT workshop (C++ /python ) 3 1 0 4

Unit 1 : Abstract data types and programming environment.


TC++ Environment, variables, Compilation and Linking steps, functions and parameters Object identity,
concept of Classes. arrays, control statements.C++ in different plate forms DOSBOX etc.

Unit 2 : Object-oriented programming


Programming using Class and objects, Encapsulation, Constructors, Destructors ,Copy constructor ,memory
management operators.

Unit 3: Advance concepts of Object-oriented programming


Pointers, Polymorphism operator and function overloading, Inheritance in object oriented design, Brief concepts of
Aggregation ,Generalization, Specification. Design concepts Flowchart , Decision table

Unit 4:File handling


Streaming and File input and output handling

Unit 5 : Introduction to Research tool


Introduction of Python Programming , applications of python for research ,Programming Environment,
installation , Data representation ,Forms of learning, Elementary Basic programming in python. Overview of
WEKA

Text books :
Object Oriented Programming with C++ by E Balaguruswami, TMH
Object Oriented Programming with C++ by Robert Lafore, Waite Group
Introduction to python by Bill Luboveni by O’Relly

Reference Books :
Object Oriented Programming with C++ by M P Bhave S,A. Patekar, Pearson Education
The Complete reference by Herbit Schildt,Mc Graw Hill
The C++ Programming Language,Bajanstroustrup ,Addition Wesley
C++ premier by F.B. Lippman, Addition Wesley
Machine Learning Tom M. Michell,Mc Graw Hill ,Indian addition
Applied Machine Learning by M. Gopal ,McGraw Hill Education
SUBJECT CODE /NAME L T P Credit
CS03TPCO3/ Computer Network 3 1 0 4

UNIT I OVERVIEW OF DATA COMMUNICATION AND NETWORKING:

Introduction; Data communications: components, data representation, direction of data flow(simplex,


half duplex, full duplex)
Networks: distributed processing, network criteria, physical structure (type of connection, topology),
categories of network (LAN, MAN,WAN);Internet: brief history, internet today; Protocols and standard
Reference models: OSI reference model, TCP/IP reference model, their comparative study

PHYSICAL LAYER:
Overview of data(analog & digital), signal(analog & digital), transmission (analog & digital)&
transmission media ( guided & non-guided); TDM, FDM, WDM

UNIT-II DATA LINK LAYER:

Types of errors, framing(character and bit stuffing), error detection & correction methods; Flow control;
Protocols: Stop & wait ARQ, Go-Back- N ARQ, Selective repeat ARQ
Medium access sub layer: Point to point protocol, token ring, Reservation, polling, concentration;
Multiple access protocols: Pure ALOHA, Slotted ALOHA, CSMA, CSMA/CD, FDMA, TDMA,
CDMA

UNIT III NETWORK LAYER:

Internetworking & devices: Repeaters, Hubs, Bridges, Switches, Router, Gateway; Addressing : Internet
address, classful address, subnetting
Routing : techniques, static vs. dynamic routing , routing table for classful address; Routing algorithms:
shortest path algorithm, flooding, distance vector routing, link state routing;
Protocols: ARP, RARP, IP, ICMP, IPV6

UNIT IV TRANSPORT LAYER:


Process to process delivery; UDP; TCP; Congestion control algorithm: Leaky bucket algorithm, Token
bucket algorithm, choke packets; Quality of service: techniques to improve Qos.

UNIT V APPLICATION LAYER:

DNS; SMTP, SNMP, FTP, HTTP & WWW;


Security: Cryptography, user authentication, security protocols in internet, Firewalls. Modern topics

Text Books:
1. B. A. Forouzan – “Data Communications and Networking (3rd Ed.) “ – TMH
2. S. Tanenbaum – “Computer Networks (4th Ed.)” – Pearson Education/PHI
3. W. Stallings – “Data and Computer Communications (5th Ed.)” – PHI
4. Zheng & Akhtar, Network for Computer Scientists & Engineers, OUP

Reference Books:

1. Kurose and Rose – “ Computer Networking -A top down approach featuring the internet” –
Pearson Education
2. Comer – “Internetworking with TCP/IP, vol. 1, 2, 3(4 th Ed.)” – Pearson Education/PHI

SUBJECT CODE /NAME L T P Credit


CS03TBS05/ Mathematics III (Numerical Methods) 3 1 0 4

UNIT- I Introduction of Errors and their Analysis, types of errors, numerical problems on error analysis, curve
fitting: method of least squares, fitting of exponential curves = , fitting of the curve = , fitting of
the curve = .Method of moments

UNIT- II Numerical Solution of Algebraic and Transcendental Equations: Graphical method bisection
Method, Secant Method, Regula-falsi Method, Newton Raphson Method, Solution of a system of simultaneous
linear algebraic Equations Direct methods: Gauss elimination Method, Gauss Jordan method, Iterative methods
.Jacobi Iterative Method, Gauss Seidel Iterative method.

UNIT- III The Calculus of Finite Differences: Finite differences, Difference formula, operators and relation
between operators. Inverse Operator, Interpolation with equal intervals: - Newton’s forward and backward
interpolation formula. Interpolation with Unequal intervals: - Lagrange’s interpolation Newton’s
differenceformula, inverse interpolation.

UNIT- IV Numerical Differentiation and Integration: - Numerical Differentiation Newton’s forward and
Backward difference interpolation formula. Maxima and Minima of aTabulated function, Numerical
Integration :-Trapezoidol rule, simpson’s (1/3) rd and (3/8) th rule, Boole’s rule, weddle rule.
Difference Equations: Definition ,order and degree of a difference equation, Linear difference equations,
Difference equations reducible to Linear form, simultaneous difference equations with constant coefficients.

UNIT- V Numerical solution of ordinary differential equation : Taylor series method, Euler’s method,
Modified Euler method Runge’s method Runge-Kutta method, numerical method for solution of partial
differential equations. General linear partial differential equation.Laplace equation and Poisson equation.

Books Recommended :

1. JAIN & IYNGAR Numerical Methods for Scientific and Engineering Computations.
2. RAO G.S. Numerical Anlysis.
3. Grewal B S Numerical Methods In Engineering and Science.
4. Das K K Advance Engineering Methods.
5. Rajaraman V Computer Oriented Numerical Methods
6. P. Kandasamy K. Thilagavathy, K. Gunavathi, Numerical Methods, S. Chand & Company,
2nd Edition, Reprint 2012.
7. S. S. Sastry, Introduction methods of Numerical Analysis, PHI, 4th Edition, 2005.
8. Erwin Kreyszig, Advanced Engineering Mathematics, 9th Edition, John Wiley & Sons,
2006.
SUBJECT CODE /NAME L T P Credit
CS04TPC04/ Discrete Mathematics 3 1 0 4

Module 1:
Sets, Relation and Function: Operations and Laws of Sets, Cartesian Products, Binary Relation, Partial
Ordering Relation, Equivalence Relation, Image of a Set, Bijective functions, Inverse and Composite Function,
Size of a Set, Finite and infinite Sets, Countable and uncountable Sets, Cantor's diagonal argument and The
Power Set theorem, Schroeder-Bernstein theorem.
Module 2:
Basic counting techniques-inclusion and exclusion, pigeon-hole principle, permutation and combination.
Principle of Mathematical Induction, The Well-Ordering Principle, Recursive definition, The Division
algorithm: Prime Numbers, The Greatest Common Divisor, Euclidean Algorithm, The Fundamental Theorem
of Arithmetic.
Module 3:
Propositional Logic: Basic Connectives and Truth Tables, Logical Equivalence, The Laws of Logic, Logical
Implication, Rules of Inference, The use of Quantifiers.
Proof Techniques: Some Terminology, Proof Methods and Strategies, Forward Proof, Proof by Contradiction,
Proof by Contraposition, Proof of Necessity and Sufficiency.
Module 4:
Algebraic Structures and Morphism: Algebraic Structures with one Binary Operation, Semi Groups,
Monoids, Groups, Congruence Relation and Quotient Structures, Free and Cyclic Monoids and Groups,
Permutation Groups, Substructures, Normal Subgroups, Algebraic Structures with two Binary Operation,
Rings, Integral Domain and Fields. Boolean Algebra and Boolean Ring, Identities of Boolean Algebra, Duality,
Representation of Boolean Function, Disjunctive and Conjunctive Normal Form
Module 5:
Graphs and Trees: Graphs and their properties, Degree, Connectivity, Path, Cycle, Sub Graph, Isomorphism,
Eulerian and Hamiltonian Walks, Graph Colouring, Colouring maps and Planar Graphs, Four colour
conjecture, trees and rooted trees, binary trees.
Suggested books :
1. Kenneth H. Rosen, Discrete Mathematics and its Applications, Tata McGraw – Hill
2. Susanna S. Epp, Discrete Mathematics with Applications,4th edition, Wadsworth Publishing Co. Inc.
3. C L Liu and D P Mohapatra, Elements of Discrete Mathematics A Computer Oriented Approach, 3rd Edition
by, Tata McGraw – Hill.

Suggested reference books:


1. J.P. Tremblay and R. Manohar, Discrete Mathematical Structure and It’s Application to Computer Science”,
TMG
Edition, TataMcgraw-Hill
2. Norman L. Biggs, Discrete Mathematics, 2nd Edition, Oxford University Press. Schaum’s Outlines Series,
Seymour
Lipschutz, Marc Lipson,
3. Discrete Mathematics, Tata McGraw - Hill
SUBJECT CODE /NAME L T P Credit
CS04TES04/ Electronic Device & Circuits 3 0 0 3

UNIT –I JUNCTION DIODE AND ITS APPLICATION:

Properties of P-N Junction, Open Circuited P-N Junction, Current component of PN Diode, V-I Characteristics,
Temperature dependence of V-I Characteristics, Diode resistance, Diode as a rectifier-Half wave & Full wave
rectifier, Clipper, Clamper.

UNIT –II BIPOLAR JUNCTION TRANSISTOR AND FET:

Introduction to Bipolar Junction Transistor, Transistor current components. Transistor as an amplifier,


Transistor construction, Transistor Circuit Configuration (Common Base , Common Emitter, Common
Collector) and Characteristics CE current gain, Analytical expression for transistor characteristics. Introduction
to JFET, MOSFET, V-I and Transfer characteristics of JFET.

UNIT – III LOW FREQUENCY TRANSISTOR AMPLIFIER:

Graphical Analysis of CE amplifier, h-parameter Models, Transistor hybrid model, Analysis of Transistor
amplifier using H-Parameter for CB, CE, CC configurations, Comparison of Transistor Amplifier
Configuration, Darlington Pair.

HIGH FREQUENCY: CE hybrid-pi model: Validity and parameter Variation, Current Gain with Resistive
load, frequency response of a single stage CE Amplifier, Gain-Bandwidth product.

UNIT-IV FEEDBACK AMPLIFIER:

Classification of feedback amplifier, Feedback concept, Properties of feedback amplifier, Effect of feedback on
gain and impedance, Emitter and Source follower.

OSCILLATOR: Barkhausen criteria, Wien bridge, Tuned, Hartley, Colpitt and RC Phase shift oscillators.

UNIT –V OPERATIONAL AMPLIFIERS:

OPAMP Symbol and terminal characteristics, Block Schematic of OPAMP, Ideal OPAMP Characteristics,
Practical OPAMP Characteristics, Inverting Amplifier, Non-Inverting Amplifier, Voltage Follower, Adder,
Substractor, Comparator, Integrator, Differentiator, IC Timer-555, Introduction to Multivibrators, Monostable,
Bistable, Astable Multivibrator.

SUGGESTED BOOKS & REFERENCE:-

• Integrated Electronics: Analog & Digital Circuit Systems – Jacob Millman & Halkias, TMH.
• Electronic Devices and Circuit Theory – Boylestad & Nashelsky, 8th Ed. PHI.
• Electronic Devices & Circuits – Allen Mottershead, PHI
SUBJECT CODE /NAME L T P Credit
CS04TPC05/ Operating System 3 1 - 4

UNIT I

Introduction to Operating System objective and function . system components system services , system
structure ,batch interactive , time –Sharing and real time operating system ,Protection. The introduction of
window NT,DOS, Window 07, Unix ,Linux (Red hat)

UNIT II
Concurrent Process : Process concepts , principal of concurrency . the producer consumer problem , the critical
section problem , semaphore, classical problem in concurrency , inter process communication , process
generation , process scheduling .

UNIT III
CPU Scheduling : scheduling concepts , performance criteria scheduling algorithms. algorithm evaluation ,
multiprocessor scheduling .

I/O management and Disk scheduling I/O devices and organization of the I/O functions. I/O buffering disk I/O
operating system design issues .

UNIT IV
Dead Locks system models , deadlock characterization , prevention , avoidance and detection recovery from
deadlock , combined approach.

UNIT V
Memory Management : Base machine , Residence monitor , multiprogramming with fixed partition ,
multiprogramming with variable partitions, multiple base register , paging , segmentation , paging
segmentation, virtual memory concepts , demand paging performance , page replacement algorithms ,
allocation of frames, thrashing , cache memory organization impact on performance .

Reference Books

Milenkovic M. , “Operating System concepts “, MGH

Tanenbaubm A. S. “Operating System design and implementation “, PHI

Silberschartz A.and Patterson J.I. , “ Operating system concepts “, Wisley.

Stilling William “ Operating System “, Maxwell McMillan International Edition 1992.

Dectel H.N. , “An introduction to operating system “, Addision Wisley.


SUBJECT CODE /NAME L T P Credit
CS04TPC06/ Data Structure & Algorithms 3 1 - 4

UNIT I: String algorithms, pattern search and editing, Arrays algorithms, development simple examples of
algorithm development, complexity, Divided & conquer, binary search, selection sort, insertion sort, merge
sort, quick sort complexity of sorting.

UNIT II: Linear list: Stacks, application of Stacks, arithmetic notations, recursion, queues and circular queues,
Linked list definition, insertion and deletion of nodes, circular and doubly linked list, Header nodes.

UNIT III: Trees, AVL trees, Threaded trees, Heap sort, B-tress.

UNIT IV: Graph and representation: graph algorithms, optimization and Greedy methods, minimum spanning
tree, shortest path, DFS, BFS search, examples of backtracking sets UNION and FIND operations tables and
information retrievals, hashing.

UNIT V: Files: File organization, sequential file, direct file organization, index sequential file organization,
Data storage and management.

REFERENCE BOOKS: •

Data Structures and Algorithm Analysis in C++, 2/e by Mark Allen Weiss, Pearson Education • Wirth Niclaus ,
"Algorithm + Data Structure = Programs " PHI • Horwitz E. and Sahani S. "Fundamentals and Data Structure
", Computer Science Press. • Knuth D. "Threat of Computer Programming ", Vol 1-2 Addision - Wesley • Aho
A.V.Hopcraft and Ullman J.E. "Data Structure and Algorithms" addsion Wesley ". • Tanonbaum , A. M. and
Augenstein , M.J. "Data Structure with Pascal" PHI. • Trambley and Sorenson "Data Structure using Pascal",
MGH. • Stubbs D. "Data Structure with Abstract Data Type and Modula 2", Brooks & Cole Publication Comp.
SUBJECT CODE /NAME L T P Credit
CS04TPC07/ System Software 3 1 - 4

UNIT I
Machine architecture, CPU Machine Architecture, Simplified Instruction Computer(SIC),SIC/XE, Traditional
CISC Machines, VAX Architecture, Pentium Pro Machine Architecture, RISC Architecture, instruction set,
addressing modes, Type of addressing modes with example Programming review of syntax of C with emphasis
on features like pointers, bit operations.

UNIT II
DOS: Introduction to interrupts, software interrupts, Hardware interrupt, internal structure of DOS, COM &
EXE program's BIOS memory resident programs, Running batch files.

UNIT III
Assemblers, Types of Assembler, PASS-I Assembler, PASS-II Assembler, Cross assemblers, two assembler
design data structure and algorithms.

UNIT IV
Macro processors: Definitions, nested macro definitions, macro expansion and conditional macro expansion.

UNIT V
Introduction of Linker, Loader, Types of Loader, loading and relocation, static and dynamic linking, Editors,
Types of Editors, Debuggers, Programming environments.

Reference Books

• System Software : An Introduction to Systems Programming, 3/e by Leland L. Beck, Pearson


Education
• Donovan J. J. "System Programming ", TMH
• Dhamdhare D.M. " Introduction to system software's" ,TMH 1986
• Michael Tischer , " PC System Programming ", Abacus.
• Cooper Mullish, " The Sprit of C, An Introduction to modern programming ", Jaico publication New
Delhi 1987.
• Dhamdhare " System Programming And Operating System ", TMH
• Gottfried , " Programming with C, Schaum Series ", TMGH.
GURU GHASIDAS VISHWAVIDYALAYA,BILASPUR
SCHEME OF TEACHING B.TECH.VTH SEMESTER ,ENGINEERING
W.E.F. SESSION 2019-2020
Branch :- Computer Science & Engg. Year : III Sem- V

s. Code no. Subject Periods Evaluation scheme Credits


n
L T P IA ESE TOTAL
1 CS05TES05 Microprocessor 3 1 0 30 70 100 4
2 CS05TPC08 Data Base
Management 3 1 4 30 70 100 4
System
3 CS05TPC09 Formal Language
and Automata 3 1 0 30 70 100 4
Theory
4 CS05TPC010 Parallel
3 1 4 30 70 100 4
Computing
5 Professional
3 1 0 30 70 100 4
Elective 1
6 CS05TMCO2 Constitution of
3 0 0 0 0 0 0
India
Practical
1 CS05PPC03 Data Base
Management 4 2
System
2 CS05PPC04 Parallel
4 2
Computing
Total 24

Professional Elective subject V Sem.


s.no. Subject code Subject Credits
1 CS05TPE01 Software Engineering 4
2 CS05TPE02 Information Theory & coding 4
3 CS05TPE03 Mobile Communication 4
4 CS05TPE04 Multimedia System Design 4
GURU GHASIDAS VISHWAVIDYALAYA,BILASPUR

SCHEME OF TEACHING B.TECH.VITH SEMESTER ,ENGINEERING

W.E.F. SESSION 2019-2020

Branch :- Computer Science & Engg. Year : III Sem- VI

s.no Code no. Subject Periods Evaluation scheme Credits

L T P IA ESE TOTAL

1 CS06TPC011 Design and


Analysis of 3 1 0 30 70 100 4
Algorithms
2 CS06TPC012 Compiler
3 1 0 30 70 100 4
Design
3 Professional
3 1 0 30 70 100 4
Elective 1
4 Professional
3 1 0 30 70 100 4
Elective 2
5 CS06THS03 MIS
3 1 0 30 70 100 4
6 CS06TPOE01 Open Elective 1
3 0 0 30 70 100 3
Practical

1 CS06PPC05 Design and


Analysis of 4 2
Algorithms

2 CS07PPR02 Compiler
4 2
Design
CS06PPR01 Minor Project 6 3

Total 30

Professional Elective subject VI Sem. Open Elective subject VI Sem.


S.No Subject code Subject Credits S.No. Subject code Subject Credits
1 CS06TPE07 Digital Image 4 1 CS06TPOE01 Computer Graphics 3
Processing
2 CS06TPE08 Robotics 4 2 CS06TPOE02 Geo-Informatics & 3
Gis Applications
3 CS06TPE09 Artificial Intelligence 4 3 CS06TPOE03 Cloud Computing 3
4 CS06TPE10 Advance Operating 4 4 CS06TPOE04 Distributed system 3
System
SUBJECT CODE /NAME L T P Credit
CS05TES05/ Microprocessor 3 1 - 4

UNIT I

Microprocessor Architecture -8086, Register organization of 8086, Signal descriptions of 8086 chip, Physical
Memory organization, Introduction to Maximum and Minimum mode operation, Processor 8088.
UNIT II

Instruction formats, Addressing modes, Instruction Set of 8086 : Data transfer instructions, Arithmetic
instructions, Logical instructions, Branch instructions, Shift and rotate instructions, String Manipulation
instructions, Machine Control Instruction, Flag Manipulation Instruction, Assembler Directive and Operators
Programming with an Assembler, Programming examples.

UNIT III
Introduction to Stack, Stack Structure of 8086, Interrupt, Interrupt and Interrupt Service Routines, Non
Maskable Interrupt, Maskable Interrupt. Subroutine, MACROS: Defining a MACRO, Passing Parameters to
MACRO.
UNIT IV
Memory Interfacing, Interfacing I/O Ports, Programmable Interval Timer 8253: Architecture and Signal
Description, Operating modes, Programming and Interfacing 8253, DMA Controller 8257: Architecture and
Signal Description, Keyboard/Display Controller 8279: Architecture and Signal Description, Mode of
Operation, Floppy Disk Controller 8272: Architecture and Signal Description, Commands.
UNIT V
Multimicroprocessor System: Numeric Processor 8087, IO Processor 8089.
80386: Features, Architecture and Signal Description, Register Organization, Real Mode, Protected Mode,
Virtual Mode, Paging, Segmentation.
Reference Books
1. Advanced Microprocessors and Peripherals - Architecture, Processing and Interfacing : A.K.Ray,
K.M. Bhurchandi

2. Microcomputer System 8086/8088 Family – Architecture Programming and design : Y Liu and G. A. Gibson
: Prentice Hall

3.80386 Microprocessor Handbook C.H. Pappas and W. H. Murray :

Osborne McGraw Hill

4.Microprocessor Architecture Programming and Application : R.C. Gaonkar : Wiley Eastern.


5.Microprocessor 8086 , 80386 & Pentium , Barry B. Brey
SUBJECT CODE /NAME L T P Credit
CS05TPC08/ Data Base Management System 3 1 - 4

UNIT- I

INTRODUCTION An overview of database management system, database system Vs file system, Database
system concepts and architecture, data models schema and instances, data independence and data base language
and interfaces, Data definitions language, DML, Overall Database Structure. Data Modeling using the Entity
Relationship Model: ER model concepts, notation for ER diagram, mapping constraints, keys, Concepts of
Super Key, candidate key, primary key, Generalization, aggregation, reduction of an ER diagrams to tables,
extended ER model, relationships of higher degree.

UNIT- II RELATIONAL DATA MODEL AND LANGUAGE: Relational data model concepts, integrity
constraints: entity integrity, referential integrity, Keys constraints, Domain constraints, relational algebra,
relational calculus, tuple and domain calculus, Introduction to SQL: Characteristics of SQL. Advantage of
SQL. SQL data types and literals. Types of SQL commands. SQL operators and their procedure. Tables, views
and indexes. Queries and sub queries. Aggregate functions. Insert, update and delete operations. Joins, Unions,
Intersection, Minus, Cursors in SQL.

UNIT- III DATA BASE DESIGN & NORMALIZATION: Functional dependencies, normal forms, first,
second, third normal forms, BCNF, inclusion dependences, loss less join decompositions, normalization using
FD, MVD, and JDs, alternative approaches to database design.

UNIT- IV TRANSACTION PROCESSING CONCEPTS: Transaction system, Testing of serializability,


Serializability of schedules, conflict & view serializable schedule, recoverability, Recovery from transaction
failures, log based recovery, checkpoints, deadlock handling.

UNIT- V CONCURRENCY CONTROL TECHNIQUES: Concurrency control, locking Techniques for


concurrency control, Time stamping protocols for concurrency control, validation based protocol, multiple
granularity, Multi version schemes, Recovery with concurrent transaction.

Text Books

1. Date C J, “An Introduction To Database System”, Addision Wesley


2. Korth, Silbertz, Sudarshan, “Database Concepts”, McGraw Hill
3. Elmasri, Navathe, “Fundamentals Of Database Systems”, Addision Wesley
4. Leon & Leon, “Database Management System”, Vikas Publishing House.
References
1. Bipin C. Desai, “An introduction to Database Systems”, Galgotia Publication
2. Majumdar & Bhattacharya, “Database Management System”, TMH
3. Ramakrishnan, Gehrke, “Database Management System”, McGraw Hill
4. Kroenke, “Database Processing: Fundamentals, Design and Implementation”, Pearson Education. 5.
Maheshwari Jain, “DBMS: Complete Practical Approach”, Firewall Media, New Delhi

SUBJECT CODE /NAME L T P Credit


CS05TPC09/ Formal Language and Automata Theory 3 1 - 4

UNIT I

Deterministic and Non-deterministic Finite automata , Regular Expression , Two way finite automata ,
Finite automata with output , Properties of regular set , Pumping lemma , Closure properties.

UNIT II

Context Free Grammars (CFG), Derivation trees, Simplification of normal forms, CNF, GNF, Regular
Grammars, Unrestricted Grammars and Relations between Classes of languages.

UNIT III

Push Down Automata: Definitions relationship between PDA and Context Free Languages, properties of
CGL’s, Decision Algorithms.

UNIT IV

Turing Machine: The Turing machine model, Computable languages and functions, Modification of
Turing machines, Church's Hypothesis.

UNIT V

Properties of recursive and recursive enumerable languages, Universal Turing machine, Undesirability
Post correspondence problem, Introduction to Recursive function theory.

Reference Books:

Hopcroft and Ullman “Introduction to Automata Theory Languages and Computation ", Narosa.
Mishra and Chandrashekharan, “Theory of Computer Science ", PH.
Kohan “Theory of Computer Science".
Korral “Theory of Computer Science".
SUBJECT CODE /NAME L T P Credit
CS05TPC010/ Parallel Computing 3 1 - 4

UNIT I INTRODUCTION OF PARALLELISM


Introduction -parallelism in Uniprocessor systems, Principles of Scalable Performance, architectural
classification schemes, SISD, SIMD, MISD, MIMD architectures, multiprocessor and multicomputer, UMA,
NUMA, COMA, NORMA model

UNIT II PARALLEL MODELS & INTERCONNECTION NETWORK

System Interconnect architecture – static, dynamic, multistage interconnection networks, design considerations
throughputs, delay, blocking and non-blocking properties interconnected memory organization - C-Access, S-
Access, C-S access.

UNIT III PIPELINE & VECTOR PROCESSING

Principal of Pipelining - Over lapped parallelism, principal of Liner pipelining processor, General pipelining
and reservation tables, arithmetic pipelining, Design of pipeline Instruction units, arithmetic pipelining design
example, hazard detection and resolution, JOB sequencing and collision prevention, vector processing
function organization of instructions in IBM 360/91.

UNIT IV ADVANCED PROCESSOR AND PARALLELISM

Advanced processor technology – RISC & CISC computers, super scalar architecture, principles of
multithreading, multithreaded architectures of MP systems.

Context switching policies, shared variables, locks, semaphores, monitor, multitasking and Cray
multiprocessor.

UNIT VMULTIPROCESSOR ARCHITECTURE AND PROGRAMMING

CPU parallelism, GPU parallelism- program, Exploiting parallelism in programme-multidimensional arrays,


directed acyclic graphs, distance and direction vectors, data flow computer and data flow graphs.

TEXT BOOKS:

1. Computer Architecture & Parallel processing - Kai Hwang 7 Briggs.(MGH).


2. Advanced Computer Architecture with Parallel Programming", K. Hwang, MGH.
REFERENCE BOOKS:

1. Parallel Computers: Arch.& Prog., Rajaraman & Siva Ram Murthy, PHI.
2. Parallel computing- Theory and practice - Michael J Quinn- Mc Graw Hill
SUBJECT CODE /NAME L T P Credit
CS05TPE01/ Software Engineering 3 1 - 4

UNIT I

Software Engineering –What is software, Evolution of Software, Characteristics of software, Types of


Software, Applications of software, Layered Technology ,

Software Process Models - Linear Sequential model, Prototype model, RAD model, Incremental model, Spiral
Model ,Component Based Development Model.

UNIT-2

MANAGING SOFTWARE PROJECT

The Management Spectrum-People, Product, Process, Project. Software Process and Project Metrics –
Measures and Metrics , Software Measurement-Size Oriented Metrics, Function Oriented Metrics,

Metrics for Quality-Overview, Measuring Quality, DRE. Software Requirement Specification-Problem


Analysis, Requirement Specification. Validation and verification, The Make /Buy Decision.

UNIT-3

System Design -:Introduction, design principles, Problem partitioning, abstraction, top-down and bottom-up
design, Low level Design:-Modularization, Structure Chart, Flow chart, Functional versus Object oriented
approach, design specification, Design verification, monitoring and control.

UNIT-4

Coding: Top–down and bottom-up structured programming, information hiding, programming style, internal
documentation, verification, monitoring and control.

Software testing – Software Testing fundamentals, white box testing, Basis path testing, Cyclomatic
Complexity, A strategic Issues, Unit testing , Integration testing, validation testing, System Testing.

UNIT 5

Software Project Management - Cost estimation, project scheduling, Software configuration management,
Quality assurance, Project Monitoring, Risk management.

Reference Books:

1. Software Engg Pressmen


2. Software Engg Pankaj Jalote
3. Software Engg Shaum’s Outline Series

4. Software Engg Bharat bhushan agrawal,Sumit Prakash Tayal,


SUBJECT CODE /NAME L T P Credit
CS05TPE02/ Information Theory & Coding 3 1 - 4

UNIT-I
Introduction:
Uncertainty, properties of information, Measures of information, Entropy: properties of entropy, information
rate, conditional Entropy, Mutual Information.
UNIT-II
Channel Capacity:
Introduction, Shannon’s Theorem, Continuous Channel, Capacity of Gaussian Channel: Shannon Hartley
Theorem Bandwidth and S/N Trade-off.

UNIT-III
Channel Coding:
Introduction, Shannon-Fano Coding, Huffman Coding, Block Codes, Tree Codes, Cyclic Code, Hamming
Codes, Convolutional Code.

UNIT-IV
Compression:
Introduction, Types of Compression, Lossless and Lossy Compression, Binary Image Compression Schemes:
Runlength Encoding, CCITT Groups, Video Compression.

UNIT-V
Cryptography:
Introduction, Types of Cryptosystem: Secret-key cryptosystem, Public-key cryptosystem, Encryption,
Decryption, Ciphers and Secret Message, Cryptanalysis.

Text Books:

1. “Information Theory, Coding and Cryptography” by Ranjan Bose, Tata McGraw-Hill Education.
2. “Communication System” by R. P. Singh, S. D. Sapre, Tata McGraw-Hill.
3. “Information Theory and Coding Techniques” by J.S. Chitode and P.G. Chilveri, Technical
Publication.
SUBJECT CODE /NAME L T P Credit
CS05TPE03/ Mobile Communication 3 1 - 4

UNIT – I

Introduction, issues in mobile computing, overview of wireless telephony: cellular concept, GSM: air interface,
channel structure, location management: HLR-VLR, Hierarchical, handoffs, and channel allocation in cellular
systems, CDMA, GPRS.

UNIT –II

Wireless Networking, Wireless LAN Overview: MAC issues, IEEE 802.11, Bluetooth, Wireless multiple
access protocols, TCP over wireless, Wireless applications, data broadcasting, Mobile IP, WAP: Architecture,
protocol stack, application environment, applications.

UNIT –III

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

UNIT –IV

Mobile Agents computing, security and fault tolerance, transaction processing in mobile computing
environment.

UNIT –V

Ad Hoc networks, localization, MAC issues, Routing protocols, global state routing (GSR), Destination
sequenced distance vector routing (DSDV), Dynamic source routing (DSR), Ad Hoc on demand distance vector
routing (AODV), Temporary ordered routing algorithm (TORA), QoS in Ad Hoc Networks, applications.

SUGGESTED BOOKS & REFERENCE:-

1. J. Schiller, Mobile Communications, Addison Wesley.

2. A. Mehrotra , GSM System Engineering.

3. M. V. D. Heijden, M. Taylor, Understanding WAP, Artech House.

4. Charles Perkins, Mobile IP, Addison Wesley.

5. Charles Perkins, Ad hoc Networks, Addison Wesley.


SUBJECT CODE /NAME L T P Credit
CS05TPE04/ Multimedia System Design 3 1 - 4

UNIT I:

An introduction, Multimedia elements, Multimedia Applications, Multimedia System Architecture, Evolving


Technologies for Multimedia Systems, Defining Objects for Multimedia systems, Multimedia Data Interface
Standard, The need for data Compression, Multimedia databases.

UNIT II:

Compression and Decompression, Types of compression, Binary Image Compression schemes, Color, Gray
Scale, Still-video image Compression, Video Image Compression, Audio Compression, Fractal Compression.

UNIT III:

Data and Format Standards, Rich-text Format, TIFF File Format, Resource Interchange File Format (RIFF),
MIDI File Format, JPEG DIB File Format for still and Motion Images, MPEG standards Pen Input, Video and
Image Display systems, Print Output Technologies, Image Scanners, Digital Voice and Audio, Digital Camera,
Video Images and Animation, Full-Motion Video.

UNIT IV:

Storage and Retrieval Technologies, Magnetic Media Technology, Optical Media, Hierarchical Storage
Management, Cache management for storage systems, Multimedia Application Design, Multimedia application
classes, Types of multimedia systems, Components of multimedia systems, Organizing multimedia databases,

UNIT V:

Unified Communication, video conferencing and Chat, Multimedia Authoring and User Interface, Multimedia
authoring system, Hypermedia application design consideration, User interface design, Object display/playback
issues, Multimedia Operating Systems Introduction, real time, Resource management, process management,
file systems.

List of Books:

1. Prabhat K.Andleigh & Kiran Thakrar, multimedia system design, Prentice PTR, NJ.

2. Ralf Steinmetz and Klara Nahrstedt multimedia computing communications and applications, innovating
technology series by Pearson Edu. Asia.

3. Jerry D.Gibson, multimedia communications directions & innovations, Harcourt India Pvt.Ltd.

4. Borko, Handbook of multimedia computing,CRC Press.


5. Mark J.Bunzel Sandra K.Morris, multimedia applications development McGraw Hill.

6. Ze-Nian Li, Mark S.Drew, fundamentals of multimedia, by Pearson Edu. Asia

SUBJECT CODE /NAME L T P Credit


CS05TMC02/ Constitution of India 3 0 0 0

UNIT-I

Introduction: Constitution – meaning of the term, Sources and constitutional theory, Features, Citizenship, Preamble

UNIT-II

Fundamental Rights and Duties: Fundamental Rights, Fundamental Duties, Directive Principles of State Policy

UNIT-III

Union Government: Structure of Indian Union: Federalism, Centre-State relationship, President: Role, power and
position, Prime Minister and council of ministers, Cabinet and Central Secretariat, Lok Sabha, Rajya Sabha

UNIT-IV

State Government: Governor: Role and position, Chief Minister and council of ministers, State Secretariat

UNIT-V

Relationship between Centre and States: Distribution of Legisltive Powers, Administrative Relations, Coordination
between States

Text Books:

1.Constitution of India, V.N. Shukla


2.The Constitutional Law of India, J.N. Pandey
3.Indian Constitutional Law, M.P. Jain
SUBJECT CODE /NAME L T P Credit
CS06TPC011/ Design and Analysis of Algorithms 3 1 - 4

UNIT I ALGORITHMS ANALYSIS

Space and Time Complexity, Asymptotic Notations,mathematical foundations: growth functions,complexity analysis of
algorithms, Recursive algorithms, analysis of no-recursive and recursive algorithms, Recurrencesequation and their
solution. Master method, recursive tree and backward substitution method.

UNIT II DIVIDE &CONQUER ANDGREEDY METHOD


Divide and conquer-Finding Maxima and Minima Binary search, Merge Sort, Quick Sort, and selection sort. Stassen’s
Matrix multiplication.

Greedy method-introduction, Knapsack problem, traveling sales man problem, Minimum Spanning trees- kruskal's
algorithm, prim's algorithm, Single source shortest path-Dijkstra’s algorithm, Huffman codes.

UNIT IIIDYNAMIC PROGRAMMING ANDSEARCH TECHNIQUES

Dynamic Programming: Introduction, Matrix chain multiplication, Single source shortest path-Bellman-Ford, all pairs
shortest path, optimal binary search tree, o/1 knapsack problem, traveling sales man problem,longest common
subsequences Search techniques: Techniques for binary trees, techniques for graphs –DES and BFS, connected
components, Bi-connected components, and Strongly-connected components,Topological sorting.

Heap Data Structure: Min and Max Heap, Fibonacci Heap, Binomial heap, Amortized Analysis,Heap sort.

UNIT IV BACK TRACKING AND BRANCH AND BOUND


Backtracking: Back tracking and Recursive back tracking, applications of back tracking paradigm,the 8-queen problem,
graph coloring, Hamiltonian cycles.

Branch and bound: introduction, 0/1 knapsack problem, traveling sales person problem, Least Cost (LC) search – the
15-puzzle problem.

UNIT V PATTERN MATCHING NP HARD AND NP COMPLETE PROBLEM


Basic concept of patternreorganizationand algorithms.

problem classes, P, NP, NP hard, NP complete problem, deterministic and non-deterministic polynomial time algorithm,
Cook’s theorem,Approximation algorithms for some NP-hard problems, sum of subsets, cliqueproblem, vertex cover,

TEXT BOOK:

1. T.H.Cormen, C.E.Leiserson, R.L.Rivest, C. Stein, Introduction to Algorithms, 2nd edition, Prentice-Hall India,
2001.
REFERENCE BOOK:

J. Kleinberg and E. Tardos, Algorithm Design, Pearson International Edition, 2005.


REFERENCES:[1] http://www.iitb.ac.in/asc/Courses

[2] http://iitbhu.ac.in

SUBJECT CODE /NAME L T P Credit


CS06TPC012/ Compiler Design 3 1 - 4

UNIT I
Overview of translation process. , Definition, Phases of Compiler, Lexical analysis: Introduction, Functions of
lexical Analysis, automatic generation of lexical analysers.

UNIT II
Parsing theory: Introduction, Difference between Top Down and bottom up parses. Different Types of Parsers :
Predictive Parser, Shift-Reduce Parser, LR Parsers( SLR, CLR, LALR), Operator Precedence Parser Automatic
generation of parsers.

UNIT III
Intermediate code generation: Different intermediate forms: Syntax tree , TAC , Quadruples, Triples, .
Indirect Triples, Syntax directed translation mechanism and attributed definition.

Code Optimization: Global data flow analyses, A few selected optimizations like command sub expression
removal, loop invariant code motion, strength reduction etc.

UNIT IV
Code generation: DAG , Machine model, order of evaluation, registers allocation and code selection, Code
generation algorithm.

UNIT V
Run time theory management: static memory allocation and stack based memory allocation schemes. Symbol
table management.

TEXTS/REFERENCES:

1. A.V.Aho, Ravi Sethi, J.D.Ullman, Compilers tools and Techniques, Addison Wesley, 1987.
2. D.M.Dhamdhere, Compiler Construction-Principles and practice Macmillan, India, 1981.
3. Tremblay J.P. and Sorenson, P.G. the theory and practice of compiler writing, Mc Graw Hil, 1984.
4. Waite W.N. and Goos G., Compiler construction’ springer verlag, 1983.
5. Gulshan Goyal, Compiler Design , sun India publication.
6. Anamika Jain, compiler Design.
SUBJECT CODE /NAME L T P Credit
CS06TPE07/ Digital Image Processing 3 1 - 4

UNIT I
INTRODUCTION: digital image representation, elements of digital image processing systems, elements of
visiual perception structure of human eye, simpleimage model, sampling and quantization, basic relationship
between pixels, imaging geometry, photographic films.

UNIT II
STATISTICAL PROPERTIES: Histogram means, standard deviation, profile different distributions. IMAGE
TRANSFORM: One and two dimentional DFT the discrete cosine transform, hadamand transform, haar
transform, slant transform.

UNIT III
IMAGE ENHANCEMENT: Spatial and frequency domain methods points operations ,contrast stretching, bit
extraction, range compression, histogram equalization, modification local enhancement, image smoothing
spatial operations, filtering multispectral, color image processing, Pseudo-color image enhancement.

UNIT IV
IMAGE RESTORATION: degradetion model, Restoration in spatial domain geometric transformation spatial
transformation, approach to restoration, Inverse & Wiener filtering, image compression: basic of image
compression, models, elements of information theory, error free compression, lossy compression, image
segmentation, line detection, edge detection, edge linking and boundary detection, thresholding & region
oriented segmentation.

UNIT V
IMAGE ANALYSIS: boundary extraction, boundary representation, region representation structure shape
feature, texture, scene matching & detection. APPLICATION OF IMAGE PROCESSING: Charector
recognisation, diagram understanding , medical imaging, scientific analysis, military guidance &
reconnaissance remote sensing, telecommunication.

REFERENCE BOOKS:
1. Gonzawlez & woods, digital image prcessing addison wesley, 1992.
2. Pratt, digital image image processing wiley int. 1991.
3. Sid ahmed digital image prcessing McGraw Hill, 1995.
SUBJECT CODE /NAME L T P Credit
CS06TPE08/Robotics 3 1 - 4

UNIT – I Introduction to Robotics Evolution of robots and robotics, progressiveadvancement in robots,


definitions and classifications, laws of robotics, robot anatomy and related attributes, human arm
characteristics, robot control system,manipulation and control, sensors in robotics, robots programming, the
future prospects.

UNIT – II 10 Coordinate Frames, Mapping and Transforms Robot specification and notations, Coordinate
frames, description of objects in space, transformation of vectors, inverting ahomogeneous transform,
fundamental rotation matrices, yaw pitch and roll, yaw pitch and roll transformation, equivalent angle.

UNIT – III Symbolic Modelling of Robots – Direct Kinematic Model Mechanical structure and notations,
description of links and joints, kinematic modelling of the manipulator, Denavit – Hartenberg notation,
kinematic relationship between adjacent links,manipulator, transformation matrix, introduction to inverse
kinematic model, Artificial Intelligence in robotics.

UNIT – IV Robotic Sensors and Vision The meaning of sensing, sensors in robotics, kinds of sensors used in
robotics, robotic vision,industrial applications of vision-controlled robotic systems, process of imaging,
architecture ofrobotic vision systems, image acquisition, description of other components of vision system,
imagerepresentation, image processing.

UNIT – V Robot Applications Industrial applications, material handling, processing applications, assembly
applications, inspection, application, principles for robot application and application planning, justification of
robots, robotsafety, non-industrial applications, robotic application for sustainable development & social issues.

Text Books:

1. Robotics & Control – R.K. Mittal & I.J. Nagrath – TMH Publications

2. Robotics for engineers - Yoram Korean- McGrew Hill Co.

3. Industrial Robotics Technology programming and Applications - M.P.Groover, M.Weiss,

4. Robotics Control Sensing, Vision and Intelligence - K.S.Fu, R.C.Gonzalex, C.S.G.Lee- McGrew Hill Book
co.

5. Kinematics and Synthesis of linkages - Hartenberg and Denavit - McGrew Hill Book Co

6. Kinematics and Linkage Design - A.S. Hall - Prentice Hall

7. Kinematics and Dynamics of Machinary - J.Hirchhorn - McGrew HillBook Company


SUBJECT CODE /NAME L T P Credit
CS06TPE09 / Artificial Intelligence 3 1 - 4

UNIT-I

Introduction of Artificial Intelligence(AI), Difference between Intelligence and Artificial Intelligence, Definitions of AI,
Strong AI and Weak AI, Application areas of AI, Comparison of Conventional and AI Computing, History of AI, Turing
Test, Branches of AI, Intelligent Agents, State Space Representation, Production System, Heuristic Search, Search
Methods (Uninformed Search and Informed Search), Breadth First Search, Depth First Search, Difference between
Breadth First Search and Depth First Search, Hill Climbing, Best First Search.

Unit-II

Role of Knowledge Representation in AI, Types of Knowledge, Properties of Knowledge Representation System,
Categories of Knowledge Representation Scheme, First Order Predicate Calculus, Well Formed Formula in Predicate Logic,
Conversion to Clausal Form, Resolution in Predicate Logic, Semantic Nets, Properties of Semantic Nets, Frames, Scripts,
Advantages and Disadvantages of Scripts.

Unit-III

Introduction of Expert System, Comparison between Human Expert and Expert System, Comparison between Expert
System and Software System, Difference between Knowledgebase and Database, Basic Components of an Expert System,
Characteristics of Expert System, Life Cycle Development of Expert System, Advantages of Expert System, Limitation of
Expert System, Expert System Tools, Existing Expert Systems (DENDRAL and MYCIN).

Unit-IV

Introduction to LISP : Syntax and Numeric Functions, Working with GNU CLISP, Basic Data Objects in GNU CLISP, Basic
List Manipulation Functions in GNU CLISP (setq, car, cdr, cons, list, append, last, member, reverse), User Defined
Functions in GNU CLISP, Predicates (atom, equal, evenp, numberp, oddp, zerop, >=, <=, listp, null) and Conditionals (cond and
if) in GNU CLISP, Logical Functions (not, or, and) in GNU CLISP, Input / Output and Local Variables (read, print,
princ, terpri, format, let, prog) in GNU CLISP, Recursion and Iteration(do) in GNU CLISP, Arrays in GNU CLISP.

Unit-V

Introduction to PROLOG, Term, Ground Term, Function, Predicate, Features of PROLOG, Program Clause, Unit Clause,
Logic Program, Goal Clause, Empty Clause, Simple Query, Conjunctive Query, Structure of PROLOG Program, Working
with SWI-Prolog General Syntax of PROLOG, Execution of a Query in Logic Program (Ground Query and Non-Ground Query),
Law of Universal modus ponen, Ground Reduction, PROLOG Control Strategy, Search Tree and Proof Tree, Relational and
Arithmetic Operators, Recursion in PROLOG, Lists manipulation in PROLOG, Iterative programming in PROLOG.

Recommended books: Text Book:

1. E. Rich and K. Knight, Artificial Intelligence, Forty Sixth Edition, Tata McGrawHill,

2007.

D.W. Patterson, Introduction to Artificial Intelligence and Expert Systems, Tenth

Edition, Prentice Hall of India, 2001.

3. S. Kaushik, Logic and Prolog Programming, New Age International Limited, 2006.
Other Reference:
1. www.wikipedia.org
2. www.tutorialspoint.com

SUBJECT CODE /NAME L T P Credit


CS06TPE10 / Advance Operating System 3 1 - 4

UNIT I GENERAL OVERVIEW OF THE SYSTEM: Introduction to Multi user System, History of UNIX,
features & Benefits, Variants, UNIX Commands - who, pwd, cd, mkdir, rm, rmdir, ls, mv, ln, chmod, cp, grep,
tr, etc. Vi Editor: Command & edit Mode, Invoking Vi, deleting & inserting Line, Deleting & Replacing
Character, Searching for Strings, Introduction to sed. Bourne Shell, C Shell, Shell Variables, Scripts, Meta
Characters, If & CASE Statements, For, While and Until loops. AWK Pattern Scanning and Processing, AWK
Arithmetic and Variables, built in functions and Operators, Arrays, Strings.

UNIT II DESIGN OF OPERATING SYSTEM: System Structure, User Perspective, Operating System Services
Assumption about Hardware, the Kernel and Buffer Cache Architecture of UNIX Operating System, System
Concepts, Buffer Headers, Structure of the Buffer Pool, Scenarios for Retrieval of the Buffer, Reading and
Writing Disk Blocks, Advantages and Disadvantages of Buffer Cache.

UNIT III INTERNAL REPRESENTATION OF FILES: Overview of File system, System Calls for the File
System, INODES, Structure of Regular File, Directories, Conversions of a Path, name to an INODE, Super
Block, INODE Assignment to a New File, Allocation of Disk Blocks. Open, Read, Write, File and Record
Close, File Creation.

UNIT IV STRUCTURES OF PROCESSES AND PROCESS CONTROL: Process States and Transitions
Layout of System Memory, The Context of a Process, Manipulation of the Process Address Space, Sleep
Process Creation/Termination, The User ID of a Process, Changing the Size of a Process.

UNIT V DISTRIBUTED OPERATING SYSTEM: Design of distributed OS, Resource sharing, Distributed OS
architectures, software layers, Architectural Model, The Operating System Layer, Protection, Processes and
Threads, Communication and invocation, Distributed File System: File Service Architecture, Sun Network File
System, the Andrew File System, and Recent Advances.

List of Books: 1. The Design of Unix Operating System,Maurice J. Bach, Pearson Education

2. Advance UNIX, a Programmer’s Guide, S. Prata, BPB Publications, New Delhi.

3. Shell Programming, Yashvant Kanitkar, BPB Publications, New Delhi.

4. UNIX Concepts and Applications, Sumitabh Das. 5. Distributed OS, A.S Tanenbaum, PHI.
SUBJECT CODE /NAME L T P Credit
CS06THS03 / Management Information System 3 1 - 4

UNIT I

Introduction of Information System, Fundamentals of Information System, Strategic Role of Information in


Organization and Management, Three dimensions of Information System, Information System and
Organization, Business Process Re-Engineering, Traditional and Computer based information system.

UNIT II

Integration of Information, Types of Decision making in Organization, Decision Making Process, Models and
Decision Support, Decision in business Areas, Strategic Analysis.

UNIT III

Information System Planning, Types of Controlling Information System, Development of MIS Methodology
and Tools/Techniques for Systematic Identification, Evaluation, Modification of MIS, Information System
Success and Failure Implementation.

UNIT IV

Information System for Business Operations: Cross Functional Information System, A study of major
Financial, Production, Human Resource Information System and Marketing Information System.

UNIT V

Management of Information System and End - User Computing, Security and Ethical issues of Information
System, Major issues in Information System, Auditing of Information System.

Reference Books

Management Information System: Solving Business Problems with Information Technology by Gerald V,. Post
and David L. Anderson [Tata McGraw - Hill Edition]

Management Information System: Managing Information Technology in the Internet worked Enterprise by
James A. O'Brien [Tata McGraw -Hill Edition, Fourth Edition]

Management Information System: A Contemporary Perspective by Kenneth C. Laudon and Jane Price Loudon
[Maxwell Macmillan International Editions]
SUBJECT CODE /NAME L T P Credit
CS06TPOE01/ Computer Graphics 3 0 - 3

UNIT I
Line Generation Points, lines, Plaines Vector, pixels and frame buffers, Vector and character generation. Graphics
Primitives, Display devices , Primitive operation , Display- file structure , Display control text.

UNIT II
Polygons: Polygons representation, Entering polygons, Filling Polygons.
Transformation: Matrices Transformation, transformation routines Display procedures.

UNIT III
Segments: Segments table, Creating Deleting and renaming a segment Visibility, Image transformation.

Windowing and Clipping : Viewing transforming, Clipping, Generalized clipping , multiple windowing.

UNIT IV
Three Dimensions: 3-D Geometry Primitives, Transformation, Projection, Clipping, Hidden line and Surfaces Back-
face Removal Algorithms, Hidden line methods.

UNIT V
Rendering and Illumination:Introduction to curve generation. Bezier. Hermit and B-spline algorithms and their
comparisons.

Reference book:
Hearn Baker, “Computer Graphics”, PHI.

Rogers , “Procedural Elements of Computer Graphics “, McGraw- Hill.

Newman & Sproulle , “Principles of Interacive Computer Graphics”, MGH 1987.

Harringtons S. , “Computer Graphics , “ A Programming Approach Second Edition MGH 1987.

Rogers & Adams ,” Mathematical Elements of Computers Graphics”, Second Edition MGH.

Henary Baper , “Computer Graphics”


SUBJECT CODE /NAME L T P Credit
CS06TPOE02/ Geo-Informatics & Gis Applications 3 0 - 3

Unit-1

Introduction to Data base systems - Data base system levels of abstraction in DBMS principles of data base.
Model of real world. Introduction to data organization, information management system preliminary study of
INGRES, ORACLE, RDBMS and DBASE. Introduction to Geographical Information Systems: Introduction
maps and spatial information. Computer assisted mapping and map analysis. Geographic Information Systems.
The components of geographical Information System. Future directions and trends in GIS.

Unit-2
Data structures for

Unit-3
Data Quality, Errors and Natural Variation: Sources of error, Errors resulting from natural variation of from
original measurements. Errors arising through processing, problem; and errors arising from overlay and
boundary intersections. Errors resulting rrom rasterizing a vector map. Errors associated with overlaying two or
more polygon networks. The nature of boundaries. The statistical nature of boundaries. Combining attributes
from overlaid maps.

Unit-4

Classification methods: Classification, Multivariate analysis and classification, allocating individuals to


existing classes. Expert systems for Geographical Information Systems. Classification methods in geographical
information systems.

Unit-5 Methods of Spatial interpolation. The available methods for interpolation, global methods of
interpolation, location interpolators, optimal interpolation methods using spatial auto covariance. Extensions of
crigging to large areas. Comparing crigging with other interpolation techniques. Choosing a Geographic
Information System. Designing the needs for GIS. The procedure to following when setting up a geographical
information system. Tools for Map analysis: Single maps, Map reclassification, operations and attribute tables,
spatial topological and geometric modeling and operations on spatial Neighborhood. Tools for map Analysis:
Map pairs, map overlay and map modeling correlation between two maps. Tools for map analysis: Multiple
maps, types of models, Boolean logic models, Index overlay models, Fuzzy logic methods.

List of Text books

1. Principles of Geographical Information System for Land Resource Assessment, P.A. Burrough,
Clarendon Press, Oxford, 1986.
2. Geographic Information Systems, T.R. Smith & Piqent, London Press, 1985. Principles of data base
systems, J.D. Ullman, Computer Science Press.
SUBJECT CODE /NAME L T P Credit
CS06TPOE03/ Cloud Computing 3 0 - 3
UNIT I
Introduction:
Introduction to Cloud Computing, Evolution of Cloud, Cloud Computing Characteristics, Benefits and
Challenges of Cloud Computing, Emergence of Cloud Computing, Cloud Based Service Offerings, Cloud
Computing Application.
UNIT II
Cloud Models:
Introduction to Cloud Models, Cloud Models: Public Cloud, Private Cloud, Hybrid Cloud, Community Cloud.

UNIT III
Standard & Security:
Introduction to Cloud Standards, Cloud Security Challenges, Cloud Data Security, Network Security, Host
Security, Database Management.

UNIT IV
Cloud Services:
Introduction to Service, Infrastructure as a Service (IAAS), Platform as a Service (PAAS), Software as a
Service (SAAS), Storage as a Service (StaaS), Database as a Service (DaaS), Process as a Service (PraaS),
Security as a Service (SecaaS), Different Security issues of Cloud Computing.

UNIT V
Virtualization:
Introduction, Virtualization Architecture, Types of Virtualization, Pros and Cons of Virtualization, Virtual
Machine, Types of Virtual Machine.

Text Book:

1. “Cloud Computing: Principles and Paradigms” by Rajkumar Buyya,James Broberg, Andrzej M.


Goscinski, Wiley.
2. “Cloud Computing” by M. N. Rao, PHI.
3. “Cloud Computing: A Practical Approach” by Toby Velte, Anthony Vote and Robert Elsenpeter,
McGraw Hill.
SUBJECT CODE /NAME L T P Credit
CS06TPOE04/ Distributed system 3 0 - 3

UNIT-I
Fundamentals of Distributed Computing

Evolution of Distributed Computing Systems, System models, issues in design of Distributed Systems,
Distributed computing environment, web based distributed model, computer networks related to distributed
systems and web based protocols.
UNIT-II

Message Passing for communication

Inter process Communication, Desirable Features of Good Message-Passing Systems, Issues in IPC by
Message,Synchronization, Buffering, Multidatagram Messages, Encoding and Decoding of Message Data,
Process Addressing, Failure Handling, Group Communication.
UNIT-III

Remote Procedure Calls


The RPC Model, Transparency of RPC, Implementing RPC Mechanism, Stub Generation, RPC Messages,
Marshaling Arguments and Results, Server Management, Communication Protocols for RPCs, Complicated
RPCs, Client-Server Binding, Exception Handling, Security, Some Special Types of RPCs,Lightweight RPC,
Optimization for Better Performance
UNIT-IV

Distributed Shared Memory


Design and Implementation issues of DSM, Granularity,Structure of Shared memory Space, Consistency
Models,replacement Strategy, Thrashing, Other Approaches to DSM,Advantages of DSM.
UNIT-V

Synchronization and Distributed File Systems


Clock Synchronization, Event Ordering, Mutual Exclusion,Election Algorithms. Desirable Features of a good
Distributed File Systems, File Models, File Accessing Models, File-shearing Semantics, Filecaching
Schemes, File Replication, Fault Tolerance, Design Principles, Sun’s network file system, Andrews file
system,comparison of NFS and AFS.

References:
1. Distributed OS by Pradeep K. Sinha (PHI)
2. Tanenbaum S.: Distributed Operating Systems, Pearson
Education
3. Tanenbaum S. Maarten V.S.: Distributed Systems Principles
and Paradigms, (Pearson Education)
4. George Coulouris, Jean Dollimore. Tim Kindberg: Distributed
Systems concepts and design.
GURU GHASIDAS VISHWAVIDYALAYA,BILASPUR
SCHEME OF TEACHING B.TECH.VIITH SEMESTER ,ENGINEERING
W.E.F. SESSION 2019-2020
Branch :- Computer Science & Engg. Year : IV Sem- VII

S.N. Code No. Subject Periods Evaluation scheme Credits


L T P IA ESE TOTAL
1 Professional
3 1 - 30 70 100 4
Elective 1
2 Professional
Elective 2
3 1 - 30 70 100 4
3 Open Elective 1 3 1 - 30 70 100 4
4 CS07TBS0 Web Science &
6 3 1 - 30 70 100 4
Technology
5 CS07TPPR Project II
02
Practical
1 CS07PPE0 Network Security 4 2
1
2 CS07PPR0 Major Project 12 6
2
TOTAL 24

Professional Elective subject VII Sem. Open Elective subject VII Sem.
S.No Subject code Subject Credits S.No. Subject code Subject Credits
1 CS07TPE11 TCP/IP 4 1 CS07TPOE05 Soft Computing 4
2 CS07TPE12 Pattern Recognition 4 2 CS07TPOE06 Real Time System 4

3 CS07TPE13 Network Security 4 3 CS07TPOE07 JAVA 4


4 CS07TPE14 Digital Signal 4 4 CS07TPOE08 VB.Net 4
Processing
GURU GHASIDAS VISHWAVIDYALAYA,BILASPUR
SCHEME OF TEACHING B.TECH.VIIITH SEMESTER ,ENGINEERING
W.E.F. SESSION 2019-20
Branch :- Computer Science & Eng. Year : IV Sem- VIII

S.N Code no. Subject Periods Evaluation scheme Credits


L T P IA ESE TOTAL
1 Professional 3 1 30 70 100 4
Elective 1
2 Open Elective 1 3 1 30 70 100 4
3 Open Elective 2 3 1 30 70 100 4
4 CS08PPR03 Project III 12 6

Practical
1 CS08PPE02 Data Mining 4 2
2 CS08PPR03 Project 12 6
Total 26

Professional Elective subject VIII Sem. Open Elective subject VIII Sem.
S.No Subject code Subject Credits S.No. Subject code Subject Credits
1 CS08TPE15 Data Mining CS08TPOE09 Enterprise
4 1 Resource 4
Management
2 CS08TPE16 Grid computing CS08TPOE10 Principle of
4 2 4
Management
3 CS08TPE17 Multimedia system CS07TPOE11 Wireless Sensor
4 3 Network 4
Design
4 CS08TPE18 Cyber Crime & CS07TPOE12 Nanotechnology
4 4 4
Security
SUBJECT CODE /NAME L T P Credit
CS07TPE11/ TCP/IP 3 1 4

UNIT –I INTRODUCTION
Introduction to internetworking, Overview of OSI Model TCP/IP protocol suite, Basics of switching
technologies and switches, Comparisons of different models, Gateways.

UNIT – II INTERNET PROTOCOL


Purpose of Internet Protocol, Internet datagram, Options, Checksum, ARP and RARP
Routing Methods: Routing Table, ICMP, IGMP.
IP Addresses: Introduction, Address Classification, A sample internet with classful addressing, Subnetting ,
Supernetting, Classless addressing, Security at the IP Layer, IPSec, IPv4 and IPv6 packet formats.

UNIT –III ROUTING PROTOCOLS


Unicast Routing Protocols: Interior and Exterior routing, RIP, OSPF, BGP,
Multicasting: Introduction, Multicast Routing, Multicast Routing Protocols, Multicast Trees, DVMRP,
MOSPF, CBT,PIM, MBONE.

UNIT –IV TRANSPORT CONTROL PROTOCOL


TCP:TCP operation, Segment, Sliding window, Silly window, Options, TCP state machine, Karn’s Algorithm,
Congestion control- Leaky bucket and Token bucket algorithms.
UDP: User Datagram, UDP operations, Checksum calculation.

UNIT-V TCP/IP OVER ATM NETWORKS


ISDN and B-ISDN, ATM reference model, ATM Switch, Interconnection Network, Virtual circuit in ATM,
Paths, Circuits and identifiers, ATM cell transport and adaptation layers, packet type and multiplexing, IP
Address binding in an ATM Network, Logical Subnet Concept and Connection Management.

Name of The Text Book:


1. Internetworking with TCP/IP by Comer (Vol. 1)(PHI Pub.)
2. TCP/IP Protocol suite by Behrouz A. Forouzan.(TMH Pub.)
Name of the Reference Book:
1. Computer Networking by James F. Kurose, Keith W. Ross (Pearson Education)
2. TCP/IP Illustrated By Wright and Stevens (Vol.2) (Pearson Education)
3. An Introduction to Computer Networks by Kenneth C. Mansfield Jr. James L.
SUBJECT CODE /NAME L T P Credit
CS07TPE12 Pattern Recognition 3 1 - 4

UNIT I

Introduction; Probability- Probability of events, Random Variables, Joint distributions and density ,

Moments of Random Variables, estimation, Minimum Risk Estimator.; Matrix Algebra – Eigen values

& Eigen Vectors.

UNIT II

Statistical Decision Making- Bayes’ Theorem, Multiple features, Conditional independent features,

Decision boundaries, Unequal cost of errors, Leaving- one-out technique, Characteristics curves

Nonparametric Decision making- Histograms, Kernel & window estimation, Nearest neighbor

classification technique, Adaptive Decision boundaries & Discriminate Function, choosing a decision

making Technique; Clustering.

UNIT III

Artificial Neural Networks- Introduction, Nets without hidden layers, Nets with hidden layers, The

Back-Propagation Algorithm, Hopfield Nets, Classifying Sex from facial Images.

Pattern recognition using SAS.

UNIT IV

Processing of Waveforms and Images- Introduction, Gray level scaling Transformation, Equalization,

Interpolation, Edge detection, Line detection & Template Matching, The Statistical Significance of

Image Features.

UNIT V
Image Analysis- Scene segmentation & labeling, Counting Objects, Perimeter measurement,
Representing boundaries, Projection, Hough transformation, shapes of regions, texture, color,
system design, the classification of white blood cell, Image Sequence

TEXT BOOKS
1. PATTERN RECOGNITION AND IMAGE ANALYSIS by Earl Gose ; Prentice- Hall of India
2. M. I. Schlesinger, V. Hlavác, Ten Lectures on Statistical and Structural Pattern Recognition,
Kluwer Academic Publishers, 2002.
REFERENCES
1. S. Theodoridis, K. Koutroumbas, Pattern recognition, Academic Press, 1999
2. J. Sklanski and G.N. Wassel, Pattern Classifiers and Trainable Machines, Springer, New York
3 Foryth , Computer Vision, PHI

SUBJECT CODE /NAME L T P Credit


CS07TPE13 / Network Security 3 1 - 4

UNIT I

Services , Mechanisms ,and Attacks , The OSI Security Architecture , A Model for Network Security ,
symmetric cipher model , substitution techniques Transposition techniques, Steganography .
UNIT II

Block ciphers and the data encryption standard , Simplified DES , Block cipher principles , The data
Encryption Standard ,The Strength of DES. Differential and Linear Cryptanalysis ,Block Cipher Design
principles ,Block Cipher Modes of Operation , Evaluation Criteria for AES The AES cipher , Triple DES ,
blowfish , RC5, Rc4 Stream Cipher ,

UNIT –III

Principles of public –Key Cryptosystems , Public –Key cryptosystems , Applications for public –Key
Cryptosystems , Requirements for public –Key Cryptosystems , Public –Key Cryptosystems , The RSA
Algorithm , Computational Aspects , The Security of RSA , Key management , Distribution of public keys ,
Public –Key Distribution of Secret Keys , Differ –Hellmann Key Exchange,

UNIT-IV

Web Security :Web Security Threats , Web Traffic Security Approaches , SSL Architecture , SSL Record
Protocol , Change Cipher Spec Protocol ,Alert Protocol , Handshake Protocol , Cryptographic Computations
,Transport Layer Security , Secure Electronic Transaction .

UNIT V

Intruders : Intrusion Techniques ,Intrusion Detection , Audit Records , Statistical Anomaly Detection ,Rule –
Based Intrusion Detection ,The Base –Rate Fallacy , Distributed Intrusion Detection , Honeypots , Intrusion
Detection Exchange Format Firewall Design principles , Firewall Characteristics , Types of Firewalls ,
Firewall Configurations .

Books :

Cryptography and Network Security , Principles and Practice, William Stallings .


SUBJECT CODE /NAME L T P Credit
CS07TPE14/ Digital Signal Processing 3 1 - 4

UNIT I
Classification of Signals and systems Introduction, Classification of signals, Singularity Functions. Amplitude
and Phase Spectra, Classification of System, Simple Manipulations of Discrete-time Signals, Representation of
Systems, Analog-to-Digital Conversion of Signals. z-Transforms -Introduction, Defination of the z-transform,
Properties of z-transform, Evaluation of the Inverse z-transform.

UNIT II
linear time invarient systems Introduction, Properties of a DSP System, Difference Equation and its
Relationship with System Function, Impulse Response and Frequency Response, Frequency Response.

UNIT III
discrete and fast fourier transforms.Introduction, Discrete Convolution, Discrete-Time Fourier Transform
(DTFT), Fast Fourier Transform (FFT). Computing of Inverse DFT by Direct DFT, Composite-radix FFT, Fast
(sectioned) Convolution. Correlation.

UNIT IV
finite impulse response (fir) filters Introduction, magnitude response and phase response of digital filters.
Frequency response of Linear phase FIR filters, design techniques for FIR filters, design of optimal linear phase
FIR filters.
infinite impulse response (iir) filters Introduction, IIR filter designed by approximation of derivatives, IIR filter
design by impluse invariant method, IIR filter design by the bilinear transformation, butter worth filters
Chebyshev filters, Inverse Chebyshev filters, Elliptic filters, Frequency Transformation.

UNIT V
realisatiion of digital linear systems Introduction, basic realisation block diagram, singal-flow graph, basic
structures for IIR systems, basic structures for FIR systems applications of digital signal processing ;
Introduction, voice processing, application of radar, applications to image processing , Introduction to
Wavelets.

RECOMMENDED BOOKS:
1. Digital signal processing- S. Salivahanan, A. Vallavraj, C. Gnanapriya;TMH
2. Discrete time signal processing- A.V. Oppenheim, Schaffer.
SUBJECT CODE /NAME L T P Credit
CS07TPOE05/ Soft Computing 3 1 - 4

UNIT I

Introduction to ANS technology: Elementary Neurophysiology, models of a neuron, neural networks viewed as
directed graphs, feedback from neurons to ANS, artificial intelligence and neural networks.

UNIT-II

Learning & Training: Hebbian memory based, competitive, error-correction. Learning Credit Assignment
Problem: supervised and unsupervised learning, memory models, recall and adaptation, network architecture,
single layered feed forward networks, multilayered feed forward networks, recurrent networks, topologies.

UNIT-III

Activation and Synaptic dynamics, stability and convergence. A suevey of neutral network models: Single
layered perception, least mean square algorithm, multi-layered perceptrons, back propagation algorithm XOR-
problem, the generalized delta rule, BPN applications, Adalines and Madalines- Algorithm and applications.

UNIT-IV

Applications: The traveling salesperson problem, talking network and phonetic typewriter: Speech generation
and Speech recognition, character recognition and retrieval, handwritten digital recognition.

UNIT-V

Adaptive fuzzy systems: Introduction to Fuzzy sets, and operations, Examples of Fuzzy logic, Fuzzy
Associative memories, fuzziness in neural networks, comparison of fuzzy and neural Truck-Backer upper
control systems.

Books Recommended:

1. Artificial Neural Networks by B. Yagna Narayan


2. Neural Networks by James A. Freeman and David M.Strapetus
3. Neural Networks- A comprehensive foundation by Simon Hay kin (LPE)
SUBJECT CODE /NAME L T P Credit
CS07TPOE06 / Real Time System 3 1 - 4

UNIT I
TYPICAL REAL TIME: Application Digital control High-level control, signal processing,Other Real time
Application hard verses soft real time system jobs and processors, release times, deadlines, and timing
constraints,hard and soft timing constraints, hard real time system, soft real time systems.
UNIT II
A REFERENCE MODEL OF REAL TIME SYSTEMS
Processors and resources, temporal parameters of real-time workload, periodic task model, precedence
constraints and data dependency, other type of dependencies, functional parameters, resourse parameters of
jobs and parameters of resources, scheduling heirarchy commonly used approaches to real-time scheduling
Clock-driven approach, weighted round robin approach, priority driven, approach, dynamic versus static
system, effective release times and deadlines. Optimative of the EDF and LST algorithms, nonoptimality of
theEDF and the LST algorithms, challenges in validating timing constraints, in priority-driven systrm Off-line
versus On-Line Scheduling.
UNIT III
CLOCK-DRIVEN SCHEDULING: Notations and assummptions, static, timer-driven scheduler, general
structure of cyclic schedules, cyclic executives, improving the average response time of a periodic jobs,
practical considerations and generalizations, aigorithm for constructing static schedules, prons and cons of
clock-driven scheduling priority-driven scheduling of periodic tasks static assumption, fixed priority versus
dynamic priority algorithm maximum schedulable uutilization, optimality of the RM and DM algorithms. A
schedulabilty test for fixed priority tasks, with short response times sufficient schedulability condition for the
RM and DM algorithm.

UNIT IV
SCHEDULING APERIODIC AND SPORADIC JOBS IN PRIORITY-DRIVEN SYSTEMS: Assumption
and approches, deferrable server, sporadic server, constant utilisation. Total bandwidth, and weighted, fair-
queuing server slackstealing in deadline driven system? Slack stealing in fixed-priorty system. Scheduling of
sporadic jobs, real-time performence for jobs withsoft timing constraints, A two-level scheme for intergrated
scheduling resources and resourse access control assumptions on resources and their usage, effect of resourse
contention and resourse access control, nonpremptive critical sections, basic priority inheritance protocol, basic
priority ceiling protocol, stack based, priority ceiling (ceiling priority) protocol, use of pririty ceiling protocol in
dynamic priority system, preemption ceiling protocol, controlling accesses to multiple unit resourses,
controlling concurrent accesses to data objects.
UNIT V:
TIPROCESSOR SCHEDULING, RESOURCE ACCESS CONTROL, AND SYNCHRONIZATION:
Model of multiprocessor and distributed system, task assignment, multiprocessor priority ceiling protocol,
foment of scheduling algorithm for end-to-end periodic task, schedulabilityof fixed priority end-to-end
periodic task, end-to-end task in heterogeneous system, predictability and validation of dynamic multiprocessor
system scheduling flexible computations and tasks with temporal distance constraints.
flexible applications, tasks with temporal distance constraints REAL-TIME communications model of real-time
communication. Priority-based service disciplines for switched networks, weighted round-robin service
disciplines, medium access control protocol of broad-cast networks, internet and resourse reservation protocols,
real-time protocol, communication in multicomputer system.
OPERATING SYSTEM Overview ,time services and scheduling mechanisms, other basic operating system
fuctions, processor reserves and resources kernal, open system architecture, capabilities of commercial real-
time operating system
REFERENCE BOOKS:
1. Jane W.S.Liu.pearson education India.

SUBJECT CODE /NAME L T P Credit


CS07TPOE07 / JAVA 3 1 - 4
UNIT-I
Object Oriented Paradigm, Basic Concepts of Object-Oriented Programming, Benefits of OOP, Applications of
OOP, Java History, Java Features, How Java Differs from C and C++, Java and Internet, Java and World Wide
Web, Web Browsers, Hardware and Software Requirements, Java Support Systems, Java Environment, Java
Program Structure, Java Tokens, Java Statements, Installing and Configuring Java, Implementing a Java
Program, Java Virtual Machine, Command Line Arguments, Programming Style.

Unit-II
Constants, Variables and Data Types, Declaration of Variables, Giving values to variables, Scope of Variables,
Symbolic Constants, Type Casting, Getting Values of Variables, Standard Default Values, Java Operators,
Arithmetic Expression, Evaluation of Expressions, Precedence of Arithmetic Operators, Operator Precedence
and Associativity, Mathematical Functions, Control Statements (if statement, switch statement and Conditional
operator statement), Decision Making and Looping (while construct, do construct, for construct), Jumps in
Loops, Labelled Loops.

Unit-III
Introduction of Class, Defining a Class, Fields Declaration, Creating Objects, Accessing Class Members,
Constructors, Methods Overloading, Static Members, Nesting of Methods, Inheritance:Extending a Class,
Overriding Methods, Final Variables and Methods, Final Classes, Abstract Methods and Classes, Visibility
Control, Introduction of Array, One Dimensional Array, Creating an array, Two-Dimensional arrays, Strings,
Wrapper Classes. Defining Interfaces, Extending Interfaces, Implementing Interfaces, Accessing Interface
Variables, Java API Packages, Using System Packages, Naming Conventions, Creating Packages, Accessing a
Package, Using a Package, Adding a Class to a Package, Hiding Classes, Static Import.
Unit-IV
Introduction to Multithreaded Programming, Difference between Multithreading and Multitasking, Creating
threads, Extending the thread class, Stopping and Blocking a thread, Life Cycle of a thread, Using thread
Methods, Thread Exception, Thread Priority, Synchronization, Implementing the Runnable Interface, Inter-
thread Communication, Types of Errors, Exceptions, Syntax of Exception Handling Code, Multiple Catch
Statements, Using Finally Statement, Throwing our own Exceptions.
Unit-V
Introduction of Applet Programming, How Applets Differ from Applications, Preparing to Write Applets,
Building Applet Code, Applet Life Cycle, Creating an Executable Applet, Designing a Web Page, Applet Tag,
Adding Applet to HTML file, Running the Applet, Attributes of Applet tag, Passing Parameters to Applets,
Aligning the Display, Displaying Numeric values, Getting input from the user, Event handling, Introduction of
Graphics Programming, Using Graphics class to draw Lines, Rectangles, Circles, Ellipses, Arcs, Polygons,
Line Graphs, Bar Charts, Using Control Loops in Applets, Introduction to AWT package, Concept of Streams,
Stream Classes, Byte Stream Classes, Character Stream Classes, Other useful I/O classes, Using the file class,
Input/Output exceptions.
Text Book:
1. E.Balagurusamy, Programming with Java A Primer, Fourth Edition, McGrawHill, 2010.
Other Reference:
1. H.Schildt, JavaTM 2: The Complete Reference, Fourth Edition, Tata McGrawHill, 2001.
2. K. A. Mughal and R. W. Rasmussen, A Programmer’s Guide to JavaTM SCJP Certification A
Comprehensive Primer, Third Edition, Addison Wesley, 2008.
SUBJECT CODE /NAME L T P Credit
CS07TPOE08 /VB.Net 3 1 - 4

UNIT–I
Introduction to .NET, .NET Framework features & architecture, CLR, Common Type System, MSIL,
Assemblies and class libraries. Introduction to visual studio, Project basics, types of project in .Net, IDE of
VB.NET- Menu bar, Toolbar, Solution Explorer, Toolbox, Properties Window, Form Designer, Output
Window, Object Browser.
UNIT–II
The VB.NET Language- Variables -Declaring variables, Data Type of variables, Forcing variables declarations,
Scope & lifetime of a variable, Constants, Arrays, types of array, control array, Collections, Subroutines,
Functions.
Control flow statements: conditional statement, loop statement. Msgbox & Inputbox.
UNIT – III
Working with Forms : Loading, showing and hiding forms, controlling One form within another.
GUI Programming with Windows Form: Textbox, Label, Button, Listbox, Combobox, Checkbox, PictureBox,
RadioButton, Panel, scroll bar, Timer.There Properties, Methods and events. OpenFileDilog, SaveFileDialog,
FontDialog, ColorDialog, PrintDialog. Link Label.
Designing menues : ContextMenu, access & shorcut keys.
UNIT–IV
Object oriented Programming: Classes & objects, fields Properties, Methods & Events, constructor, inheritance.
Access Specifiers: Public Private, Projected. Overloading, My Base & My class keywords.
Accessing the WIN32 API from VB.NET & Interfacing with office97, COM technology, advantages of COM+,
COM & .NET, Create User control, register User Control, access com components in .net application.

UNIT–V
Database programming with ADO.NET – Overview of ADO, from ADO to ADO.NET, Accessing Data using
Server Explorer. Creating Connection, Command, Data Adapter and Data Set with OLEDB and SQLDB.
Display Data on data bound controls, display data on data grid.
Generate Reports Using CrystalReportViwer.

TEXT & REFERENCE BOOKS :


VB.NET Programming Black Book by steven holzner –dreamtech publications
1.Mastering VB.NET by Evangelos petroutsos- BPB publications
2.Introduction to .NET framework-Worx publication
3.msdn.microsoft.com/net/
4.www.gotdotnet.com
SUBJECT CODE /NAME L T P Credit
CS08TPE15 / Data Mining 3 1 - 4

UNIT-1
Data Ware Housing :- Introduction, Multidimensional data model, OLAP Operation, Warehouse schema, Data
Ware Housing Architecture, Warehouse Server, Metadata, OLAP, engine.

Data Mining:- Introduction, KDD Vs Data mining, DBMS Vs DM , DM Techniques , Other mining problem,
Issues & Challenges in DM,DM Application Areas.

UNIT-II
Association rules : -Introduction, Methods to discover association rules, A Priori Algorithm ,Partition
Algorithm, Pincer –Search algorithm , Dynamic Item set counting algorithm , FP-tree Growth algorithm ,
Incremental algorithm, Border algorithm.

UNIT-III
Clustering Techniques :- Introduction, Clustering paradigms, Partitioning algorithms, k-Medoid Algorithm,
CLARA ,CLARANS , Hierarchical clustering , DBSCAN , BIRCH, CURE, Categorical clustering algorithms
, STIRR, ROCK , CACTUS.

UNIT -IV
Decision Trees:-Introduction, Tree construction principal, Best spilt splitting indices, Splitting criteria,
Decision tree construction algorithm, CART, ID3,C4.5 , CHAID , Decision tree construction with presorting ,
Rainforest , CLOUDS, BOAT.

UNIT-V
Web Mining: - Web mining, Web content mining, Web structure mining, Web usage mining, Text mining,
Episode rule discovery for texts, Hierarchy of categories, Text clustering.

Books &references:-
1. Data Mining techniques – Arun K Pujari Universities press
2. Data Mining concepts & techniques – Jiawei han , Micheline kamber Morgan Kaufmann publisher
Elsevier India
3. data Mining methods for knowledge Discovery –Cios , Pedrycz , swiniarski Kluwer academic
publishers London
SUBJECT CODE /NAME L T P Credit
CS08TPE16/ Grid Computing 3 1 - 4
Unit - I
Cluster Computing
Basic concept of distributed and parallel computing,shared memory,Scheduling Concept,
Cluster computing-Introduction, Grid server and practical uses: Cluster and cluster Grids, cluster Vs Grid.
UNIT-II
Grid Computing
Grid Computing:History of grid computing,Basic concept, benefits of grid computing , Grid vs. other Related
Technologies, Grid Architecture, various kinds of Grids, and different topologies of the Grid ,Grid
Applications, Grid Components.
UNIT – III
Scheduling
High performance Gid,HPC Grids; Data Grids; Alternatives to Data Grid – Data Grid architecture. Grid
scheduler and a local resource scheduler, Grid Scheduling: Job Schedulling , Resource Schedulling, Various
factors of Scheduling, Scheduling Procedure. Challenges in Grid Scheduling.
UNIT – IV
Implementation:
Grid Simulation tool kit
The open Grid services Architecture –– Overview – implementing OGSA based Grids – Creating and
Managing services – Services and the Grid – Service Discovery – Tools and Toolkits . Installation of Pre-
requisites and Necessary Component,Installation of GridSim Toolkit,Salient Feature of GridSim , GridSim
Architecture
UNIT - V
Application integration- Application classification – Grid requirements – Integrating applications with
Middleware platforms – Grid enabling Network services –Managing Grid environments –Managing Grids –
Management reporting – Different application areas of Grid computing.
Text Books
1. Ahmar Abbas, “Grid Computing, A Practical Guide to Technology and Applications”, Firewall Media.
2. Joshy Joseph and Craig Fellenstein, “Grid Computing”, Pearson Education.
Reference Books
1. Ian Foster and Carl Kesselman, “Grid Blue Print for New Computing Infrastructure”, Morgan
Kaufmann.
2. Fran Berman, Geoffrey Fox and Anthony J. G. Hey, “Grid Computing: Making the Global
Infrastructure a Reality”, Willy Publisher.
SUBJECT CODE /NAME L T P Credit
CS08TPE17/ Multimedia System Design 3 1 - 4

UNIT I:

An introduction, Multimedia elements, Multimedia Applications, Multimedia System Architecture, Evolving


Technologies for Multimedia Systems, Defining Objects for Multimedia systems, Multimedia Data Interface
Standard, The need for data Compression, Multimedia databases.

UNIT II:

Compression and Decompression, Types of compression, Binary Image Compression schemes, Color, Gray
Scale, Still-video image Compression, Video Image Compression, Audio Compression, Fractal Compression.

UNIT III:

Data and Format Standards, Rich-text Format, TIFF File Format, Resource Interchange File Format (RIFF),
MIDI File Format, JPEG DIB File Format for still and Motion Images, MPEG standards Pen Input, Video and
Image Display systems, Print Output Technologies, Image Scanners, Digital Voice and Audio, Digital Camera,
Video Images and Animation, Full-Motion Video.

UNIT IV:

Storage and Retrieval Technologies, Magnetic Media Technology, Optical Media, Hierarchical Storage
Management, Cache management for storage systems, Multimedia Application Design, Multimedia application
classes, Types of multimedia systems, Components of multimedia systems, Organizing multimedia databases,

UNIT V:

Unified Communication, video conferencing and Chat, Multimedia Authoring and User Interface, Multimedia
authoring system, Hypermedia application design consideration, User interface design, Object display/playback
issues, Multimedia Operating Systems Introduction, real time, Resource management, process management,
file systems.

List of Books:

1. Prabhat K.Andleigh & Kiran Thakrar, multimedia system design, Prentice PTR, NJ.

2. Ralf Steinmetz and Klara Nahrstedt multimedia computing communications and applications, innovating
technology series by Pearson Edu. Asia.

3. Jerry D.Gibson, multimedia communications directions & innovations, Harcourt India Pvt.Ltd.

4. Borko, Handbook of multimedia computing,CRC Press.

5. Mark J.Bunzel Sandra K.Morris, multimedia applications development McGraw Hill.

6. Ze-Nian Li, Mark S.Drew, fundamentals of multimedia, by Pearson Edu. Asia


SUBJECT CODE /NAME L T P Credit
CS08TPE18/ Cyber Crime and Security 3 1 - 4

Unit I
Introduction to Cyber Law Evolution of Computer Technology, emergence of Cyber space. Cyber
Jurisprudence, Jurisprudence and law, Doctrinal approach, Consensual approach, Real Approach,
Cyber Ethics, Cyber Jurisdiction, Hierarchy of courts, Civil and criminal jurisdictions, Cyberspace-
Web space, Web hosting and web Development agreement, Legal and Technological Significance of
domain Names, Internet as a tool for global access.
Unit II
Information technology Act Overview of IT Act, 2000, Amendments and Limitations of IT Act, Digital
Signatures, Cryptographic Algorithm, Public Cryptography, Private Cryptography, Electronic
Governance, Legal Recognition of Electronic Records, Legal Recognition of Digital Signature,
Certifying Authorities, Cyber Crime and Offences, Network Service Providers Liability, Cyber
Regulations Appellate Tribunal, Penalties and Adjudication.
Unit III
Cyber law and related Legislation Patent Law, Trademark Law, Copyright, Software – Copyright or
Patented, Domain Names and Copyright disputes, Electronic Data Base and its Protection, IT Act and
Civil Procedure Code, IT Act and Criminal Procedural Code, Relevant Sections of Indian Evidence
Act, Relevant Sections of Bankers Book Evidence Act, Relevant Sections of Indian Penal Code,
Relevant Sections of Reserve Bank of India Act, Law Relating To Employees And Internet, Alternative
Dispute Resolution , Online Dispute Resolution (ODR).
Unit IV
Electronic Business and legal issues: Evolution and development in E-commerce, paper vs paper
less contracts E-Commerce models- B2B, B2C,E security.
Unit V
Application area : business, taxation, electronic payments, supply chain, EDI, E-markets,
Emerging Trends

Text Book
1 Cyber Laws: Intellectual property & E Commerce, Security- Kumar K, dominant Publisher
2 Information Security policy &implementation Issues, NIIT, PHI
Reference books
1 Cyber CRIME notorious Aspects of the Humans & net Criminals activity in Cyber World
Barna Y Dayal D P Dominant Publisher
2 Cyber Crime Impact in the new millennium, Marine R.C. Auther press
3 Spam Attack, Cyber Stalking & abuse, Barna Y, Dayal D P Dominant publisher
4 Frauds & Financial criouses in Cyber space, Barna Y, Dayal D P , Dominant publisher
5 Information Security , NIIT: PHI
SUBJECT CODE /NAME L T P Credit
CS08TPOE09/ Enterprise Resource Management 3 1 - 4

UNIT I

Function of Business Organizations : Personnel management, Financial management, marketing


management, Sales order Processing , Manufacturing managements , Human Resource Management etc , data
and information , Operation of functional areas. Integrated view of ERP

UNIT II

Technologies of ERP : knowledge based system , Decision support system , Executive information
system , Electronic commerce, , Databases system , Business Engineering , Business process Engineering ,
Networking , 3 tier and 2 tier architecture.

UNIT III

Management information system : MIS ,data & information . levels of Management , information
requirement , objectives of information channels, information strategies

UNIT IV

Information and planning : Resource management benefit of management planning process objective
and its characteristic , policy and procedures ,forecasting and its varies aspects . Scheduling , MRP , MRP-II

UNIT V

ERP implement issues : software development life cycle , pre Evaluation schemes , post implement
issues case studies .

Book :

Management Information Systems : Louden & Louden

ERP by Garg and Ravichandran

Information System and MIS : J Kanter

Management Information System : Jawardekar


SUBJECT CODE /NAME L T P Credit
CS08TPOE10 / Principle of Management 3 1 - 4

UNIT – I Management concepts, Nature, Scope, Significance, Function and Principle of Management
Concepts. Evolution of Management: Early Contribution, Taylor and Scientific management, Fayol´s
administrative management, Bureaucracy, Hawthrone Experiments and Human Relations.

UNIT – II Planning- Concepts, Objectives, Goals, Components and Steps involved in planning process, MBO,
Decision making process, Individual and Group Decision Making.

UNIT – III Organizing- principles, Organization theories, Line & Staff Authority, Centralization,
Decentralization, Delegation, Employee´s empowerment, Span of control, Departmentation, Authority and
Responsibility.

UNIT – IV Staffing: Recruitment & Selection, Training & Development, Performance Appraisal Directing:
Concept, Direction and Supervision, Co-ordination.

UNIT – V Communication: Communication Process, Importance of Communication, Barriers to


Communication, Controlling: nature, scope, functions, steps and process, control techniques. SUGGESTED

BOOKS & REFERENCE:

1. Management, Stoner & Freeman, PHI

2. Principles of Management, Koontz, O´Donnell Wechrich, McGraw Hill

3. The Practice of Management, P F Drucker, Allied Pub

4. Essentials of Management, Massie, AITBS

5. Principles of Management, Terry and Franklin, AITBS

6. Organization and Management, R D Agarwal, TMH

7. Management, H Koontz, McGraw Hill

8. Fundamentals of Management, Robbins & Dinzo, Pearson India


SUBJECT CODE /NAME L T P Credit
CS07TPOE11/ Wireless Sensor Network 3 1 - 4

UNIT- I

Wireless Sensor Network: Introduction, Architecture, Hardware and Software used in Wireless Sensor
Network.

UNIT- II

Sensor network application: Motion monitoring, Environmental monitoring, Generic Architecture, Sensor
network Evolution.

UNIT- III

Wireless Sensor Network : Design , Goals and Issues , Sensor deployment, Scheduling and coverage issues,
self-configuration and topology control, Querying, data collection and processing, Collaborative information
processing and group connectivity.

UNIT- IV

Wireless Sensor Routing Protocols: Data Centric, Hierarchical, Location based, Energy efficient routing

UNIT- V

Sensor Network Challenges- Miniaturization, power management, scalability, remote management, usability,
standardization and security, System Challenges- Tiny OS, Network Sensor Platforms.

SUGGESTED BOOKS & REFERENCE:-

1. Building Wireless Sensor Networks by Robert Faludi Binding: Paperback Publisher: O'reilly Released: 2011

2. Wireless Sensor Networksby Zhao Feng, Guibas Leonidas Binding: Paperback Publisher: Elsevier India
Released: 2004

3. Wireless Sensor Networks by C. S Raghavendra, Krishna M. Sivalingam, Taieb Znati Binding: Paperback
Publisher: Springer/bsp Books Released: Rpt.2010
SUBJECT CODE /NAME L T P Credit
CS07TPOE12 / Nanotechnology 3 1 - 4

UNIT-1

Introduction to Nanotechnology: Essence of Nanotechnology, Nano in daily life, Brief account of nano
applications, Properties of nano materials, Properties at nanoscale (optical, electronic and magnetic), Metal
nano clusters, Semiconductor nano particles.

UNIT-2

Nano Materials-Metal and Semiconductor Nanomaterials, Quantum Dots, Wells and Wires, Molecule to bulk
transitions.

UNIT-3

Carbon Nano Structures :Introduction, Carbon molecules, Carbon clusters, Carbon nanotubes, Applications of
carbon nanotubes.

UNIT-4

Synthesis Of Nanomaterials :Top-down (Nanolithography, CVD), Bottom-up (Sol-get processing, chemical


synthesis). Wet Depositiontechniques, Self-assembly (Supramolecular approach), Molecular design and
modeling.

UNIT-5

Application: Solar energy conversion and catalysis, Molecular electronics and printed electronics
Nanoelectronics, Polymers with a special architecture, Liquid crystalline systems,Linear and nonlinear optical
and electrooptical properties, Applications in displays and other devices, Advanced organic materials for data
storage, Photonics, Plasmonics, Chemical and biosensors, Nano medicine and Nano biotechnology.

SUGGESTED BOOKS & REFERENCE:-

1. Nanotechnology by Richard Booker, Earl Boysen, Wiley Publishing Inc., 2006.

2. Introduction to Nanotechnology by Charles P. Poole Jr., Frank J. Owens, John Wiley & Sons Publications,
2003.

3. Hari Singh Nalwa, “Nanostructured Materials and Nanotechnology”, Academic Press, 2002

You might also like