IT Workshop

Download as pdf or txt
Download as pdf or txt
You are on page 1of 76

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY: KAKINADA

KAKINADA-533003, Andhra Pradesh (India)


ELECTRONICS AND COMPUTER ENGINEERING
COURSE STRUCTURE
I YEAR
I SEMISTER
S. No. Subject T P Credits
1 English – I 3 - 3
2 Mathematics - I 3+1 - 3
3 Mathematical Methods 3+1 - 3
4 Engineering Physics 3+1 - 3
5 Ethical & Moral Sciences 3 - 3
6 Engineering Drawing 1+3 - 3
7 English - Communication Skills Lab -1 - 3 2
8 Engineering Physics Laboratory - 3 2
9 Engineering Workshop& IT Workshop - 3 2
Total 24

I YEAR
II SEMISTER
S. No. Subject T P Credits
1 English – II 3 - 3
2 Mathematics – II 3+1 - 3
3 Engineering Chemistry 3 - 3
4 Engineering Mechanics 3+1 - 3
5 Computer Programming 3 - 3
6 Network Analysis 3+1 - 3
7 Engineering Chemistry Laboratory - 3 2
8 English - Communication Skills Lab -2 - 3 2
9 Computer Programming Lab - 3 2
Total 24

1
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY: KAKINADA
KAKINADA-533003, Andhra Pradesh (India)
ELECTRONICS AND COMPUTER ENGINEERING
COURSE STRUCTURE

II Year I Semester
S.NO Subjects T P Credits

1 Mathematical Foundations of
3+1 - 3
Computer Science and Engineering
2 Electronic Devices and Circuits 3+1 - 3
3 Environmental Studies 3 - 3
4 Signals and Systems 3+1 - 3
5 Managerial Economics and Financial
3+1 - 3
Analysis
6 Data Structures 3+1 - 3
7 Electronic Devices and Circuits Lab 3 2
8 3 2
Data structures Lab
Total credits 22

II Year II Semester

S.NO Subjects T P Credits

1 Switching Theory and Logic Design 3+1 - 3


2 Principles of Communication 3+1 - 3
3 Software Engineering 3+1 - 3
4 Pulse and Digital Circuits 3+1 - 3
5 Computer Organization 3+1 - 3
6 Object Oriented Programming 3+1 - 3
7 Pulse and Digital Circuits &
- 3 2
Communication LAB
8
OOPS LAB - 3 2

Total credits 22

2
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY: KAKINADA
KAKINADA-533003, Andhra Pradesh (India)

ELECTRONICS AND COMPUTER ENGINEERING


COURSE STRUCTURE

III Year I Semester

S.NO Subjects T P Credits

1 Linear Integrated Circuit Applications 3+1 - 3


2 Digital IC Applications 3+1 - 3
3 Computer Graphics 3+1 - 3
4 Management Science 3+1 - 3
5 Design & Analysis of Algorithms 3+1 - 3
6 IC Applications Lab 3 2
7 Computer graphics Lab - 3 2
8 Algorithms Lab
3 2

9 IPR &PATENTS
3 2

Total credits 23

III Year II Semester

S.NO Subjects T P Credits

1 Computer Networks 3+1 - 3


2 Open Elective 3+1 - 3
3 VLSI Design 3+1 - 3
4 Data Base Management Systems 3+1 - 3
5 Micro Processors & Micro Controllers 3+1 - 3
6 Operating Systems - 3 2
7 Micro Processors & Micro Controllers Lab - 3 2
8
Electronic Computer Aided Design Lab 3 2

9
SEMINAR 2 1

Total credits 22

3
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY: KAKINADA
KAKINADA-533003, Andhra Pradesh (India)

ELECTRONICS AND COMPUTER ENGINEERING


COURSE STRUCTURE
IV Year I Semester
S.NO Subjects T P Credits

1 Systems Programming 3+1 - 3


2 Digital Signal Processing 3+1 - 3
3 Digital Image Processing 3+1 - 3
4 UNIX Programming 3+1 - 3
5 Elective I
1. Artificial Intelligence
3+1 - 3
2. Advanced Computer Architecture
3. Data Communication
6 Elective II
1. Web Design
3+1 - 3
2. Fuzzy Logic and Neural Networks
3. Structured Digital Design
7 Computer Networks and Operating Systems Lab - 3 2
8 UNIX Programming Lab
- 3 2

Total credits 22

IV Year II Semester
S.NO Subjects T P Credits

1 Embedded Systems 3+1 3


2 Automata Theory & Compiler Design 3+1 3
3 Elective III 3+1 3
1. High Performance Computing
2. EMI/EMC
3. Data Ware Housing & Data
Mining
4 Elective IV 3+1 3
1.Wireless Sensor Networks
2.Real Time Operating Systems
3. Network Security & Cryptography
5 Project 9
Total credits 21

Total course credits = 48+ 44 + 45 + 43 = 180


Open Electives:
4
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
III Year B. Tech. Electronics and Computer Engineering – I Sem.
LINEAR IC APPLICATIONS
OBJECTIVES
The student will
 Study characteristics, realize circuits, design for signal analysis using Op-amp ICs.
 Study the linear and non-linear applications of operational amplifiers.
 Study IC 555 timer, PLL and VCO with their applications.
 Study and understand different types of ADCs and DACs
 Acquire skills required for designing and testing integrated circuits
UNIT I
INTEGRATED CIRCUITS: Differential Amplifier- DC and AC analysis of Dual input
Balanced output Configuration, Properties of other differential amplifier configuration (Dual
Input Unbalanced Output, Single Ended Input – Balanced/ Unbalanced Output), DC
Coupling and Cascade Differential Amplifier Stages, Level translator.
UNIT II
Characteristics of OP-Amps, Integrated circuits-Types, Classification, Package Types and
Temperature ranges, Power supplies, Op-amp Block Diagram, ideal and practical Op-amp
Specifications, DC and AC characteristics, 741 op-amp & its features, FET input. Op-Amps,
Op-Amp parameters & Measurement, Input & Out put Off set voltages & currents, slew
rates, CMRR, PSRR, drift, Frequency Compensation technique.
UNIT III
LINEAR and NON-LINEAR APPLICATIONS OF OP- AMPS: Inverting and Non-
inverting amplifier, Integrator and differentiator, Difference amplifier, Instrumentation
amplifier, AC amplifier, V to I, I to V converters, Buffers. Non- Linear function generation,
Comparators, Multivibrators, Triangular and Square wave generators, Log and Anti log
Amplifiers, Precision rectifiers.
UNIT IV
ACTIVE FILTERS, ANALOG MULTIPLIERS AND MODULATORS:
Introduction, Butter worth filters – 1st order, 2nd order LPF, HPF filters. Band pass, Band
reject and All pass filters.
Four Quadrant multiplier, balanced modulator, IC1496,Applications of analog switches and
Multiplexers, Sample & Hold amplifiers.
5
UNIT V
TIMERS & PHASE LOCKED LOOPS: Introduction to 555 timer, functional diagram,
Monostable and Astable operations and applications, Schmitt Trigger. PLL - introduction,
block schematic, principles and description of individual blocks, 565 PLL, Applications of
PLL – frequency multiplication, frequency translation, AM, FM & FSK demodulators.
Applications of VCO (566).
UNIT VI
DIGITAL TO ANALOG AND ANALOG TO DIGITAL CONVERTERS: Introduction,
basic DAC techniques, weighted resistor DAC, R-2R ladder DAC, inverted R-2R DAC, and
IC 1408 DAC, Different types of ADCs – parallel Comparator type ADC, counter type ADC,
successive approximation ADC and dual slope ADC.DAC and ADC Specifications,
Specifications AD 574 (12 bit ADC).
TEXT BOOKS :
1. Linear Integrated Circuits – D. Roy Chowdhury, New Age International (p) Ltd, 2nd
Edition,2003.
2. Op-Amps & Linear ICs - Ramakanth A. Gayakwad, PHI,1987.
REFERENCES :
1. Design with Operational Amplifiers & Analog Integrated Circuits - Sergio Franco,
McGraw Hill, 1988.
2. OP AMPS and Linear Integrated Circuits concepts and Applications, James M Fiore,
Cenage Learning India Ltd.
3. Operational Amplifiers & Linear Integrated Circuits–R.F.Coughlin & Fredrick Driscoll,
PHI, 6th Edition.
4. Operational Amplifiers – C.G. Clayton, Butterworth & Company Publ.Ltd./ Elsevier,
1971.
5. Operational Amplifiers & Linear ICs – David A Bell, Oxford Uni. Press, 3rd Edition
OUTCOMES
After going through this course the student will be able to
 Design circuits using operational amplifiers for various applications.
 Analyze and design amplifiers and active filters using Op-amp.
 Acquire skills required for designing and testing integrated circuits
 Understand the gain-bandwidth concept and frequency response of the three basic
amplifiers. Understand thoroughly the operational amplifiers with linear integrated
circuits.
 Design combinational logic circuits for different applications.

6
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
III Year B. Tech. Electronics and Computer Engineering – I Sem.
DIGITAL IC APPLICATIONS
UNIT I
CMOS LOGIC: Introduction to logic families, CMOS logic, CMOS steady state electrical
behaviour, CMOS dynamic electrical behaviour, CMOS logic families.
UNIT II
BIPOLAR LOGIC AND INTERFACING: Diode Logic, Bipolar logic, Transistor logic,
TTL families, CMOS/TTL interfacing, low voltage CMOS logic and interfacing, Emitter
coupled logic, Comparison of logic families, Familiarity with standard 74XX and CMOS
40XX series-ICs – Specifications.
UNIT III
COMBINATIONAL LOGIC DESIGN: Design and Analysis procedures,Decoders,
encoders, three state devices, multiplexers and demultiplexers, EX-OR gates and parity
circuits, comparators, Ripple Adder, Look Ahead Carry Generator, ALUs, Combinational
multipliers, Barrel Shifter, Simple Floating-Point Encoder, Cascading Comparators,
DualPriority Encoder, Design considerations of the above combinational logic circuits with
relevant Digital ICs.
UNIT IV
SEQUENTIAL LOGIC DESIGN: Introduction to bistable elements, Counters, Design of
Counters using Digital ICs, Counter applications, Synchronous design methodology,
Impediments to synchronous design, MSI Registers, Shift Registers, Modes of Operation of
Shift Registers, Universal Shift Registers, MSI Shift Registers, Ring Counter, Johnson
Counter, Basic sequential logic Design steps, Design of Modulus N Synchronous Counters,
Design considerations of the above sequential logic circuits with relevant Digital ICs.
UNIT V
PROGRAMMABLE LOGIC DEVICES (PLDs): Introduction, Programmable Read Only
Memory, Programmable Logic Array, Programmable Array Logic Devices, Comparison
between PROM, PLA and PAL. Design considerations of PLDs with relevant Digital ICs.
UNIT-VI
MEMORIES: ROM: Internal structure, 2D-Decoding, Commercial ROM types, timing and
applications,. Static RAM: Internal structure, SRAM timing, standard SRAMS, synchronous

7
SRAMS, Dynamic RAM: Internal structure, timing, synchronous DRAMs, Familiarity with
Component Data Sheets-Cypress CY6116, CY7C1006, Specifications.
TEXT BOOKS:
1. Digital Design Principles & Practices By John F. Wakerly, PHI Publications,Third
Edition.,
2005.
2. Digital IC Applications By Atul P.Godse and Deepali A.Godse, Technical Publications,
Pune,
2005.
REFERENCES :
1. Digital Integrated Circuits-A Design Perspective By Jan M.Rabaey, Anantha
Chandrakasan, Borivoje Nikolic, Pearson Education, 2005.
2. Introduction to Logic Design – Alan B. Marcovitz,TMH, 2nd Edition,2005.
3. Digital Logic and Computer Design By Mano, Pearson Education.

8
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
III Year B. Tech. Electronics and Computer Engineering – I Sem.
COMPUTER GRAPHICS

UNIT I :
Introduction, Application areas of Computer Graphics, overview of graphics systems, video-
display devices, raster-scan systems, random scan systems, graphics monitors and work
stations and input devices (p.nos 22-90 of text book-1).
UNIT II :
Output primitives : Points and lines, line drawing algorithms, mid-point circle and ellipse
algorithms.Filled area primitives: Scan line polygon fill algorithm, boundary-fill and flood-
fill algorithms (p.nos 103-123,137- 145,147-150,164-171 of text book-1, p.nos. 72-99 of text
book-2).
UNIT III :
2-D geometrical transforms : Translation, scaling, rotation, reflection and shear
transformations, matrix representations and homogeneous coordinates, composite transforms,
transformations between coordinate systems. (p.nos 204-227 of text book-1).
2-D viewing : The viewing pipeline, viewing coordinate reference frame, window to view-
port coordinate transformation, viewing functions, Cohen-Sutherland and Cyrus-beck line
clipping algorithms, Sutherland –Hodgeman polygon clipping algorithm(p.nos 237-249,257-
261 of text book -1, p.nos. 111-126 of text book-2).
UNIT IV :
3-D object representation : Polygon surfaces, quadric surfaces, spline representation, Hermite
curve, Bezier curve and B-Spline curves, Bezier and B-Spline surfaces. Basic illumination
models, polygon rendering methods. (p.nos 324-331,340-342, 347-364, 516-531, 542-546 of
text book-1, p.nos 473-529,721-739 of text book-2).
UNIT V :
3-D Geometric transformations : Translation, rotation, scaling, reflection and shear
transformations, composite transformations.
3-D viewing : Viewing pipeline, viewing coordinates, view volume and general projection
transforms and clipping (p.nos 427-443, 452-481 of text book -1).

9
UNIT VI :
Computer animation : Design of animation sequence, general computer animation
functions, raster animation, computer animation languages, key frame systems, motion
specifications. ( p.nos 604-616 of text book -1, chapter 21 of text book-2).

TEXT BOOKS :
1. “Computer Graphics C version”, Donald Hearn and M.Pauline Baker, Pearson Education.
2. “Computer Graphics Principles & practice”, second edition in C, Foley, VanDam, Feiner
and Hughes, Pearson Education.

REFERENCES :
1. “Computer Graphics”, second Edition, Donald Hearn and M.Pauline Baker, PHI/Pearson
Education.
2. “Computer Graphics Second edition”, Zhigand xiang, Roy Plastock, Schaum’s outlines,
Tata Mc- Graw hill edition.
3. Procedural elements for Computer Graphics, David F Rogers, Tata Mc Graw hill, 2nd
edition.
4. “Principles of Interactive Computer Graphics”, Neuman and Sproul, TMH.
5. Principles of Computer Graphics, Shalini Govil, Pai, 2005, Springer.
6. Computer Graphics, Steven Harrington, TMH

10
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
III Year B. Tech. Electronics and Computer Engineering – I Sem.
MANAGEMENT SCIENCE

Unit I
Introduction to Management: Concept –nature and importance of Management – Functions
of Management – Evaluation of Management thought- Theories of Motivation – Decision
making process-Designing organization structure- Principles of organization - Types of
organization structure

Unit II
Operations Management: Principles and Types of Management – Work study- Statistical
Quality Control- Control charts (P-chart, R-chart, and C chart) Simple problems- Material
Management: Need for Inventory control- EOQ, ABC analysis (simple problems) and Types
of ABC analysis (HML, SDE, VED, and FSN analysis)

Unit III
Functional Management: Concept of HRM, HRD and PMIR- Functions of HR Manager-
Wage payment plans(Simple Problems) – Job Evaluation and Merit Rating - Marketing
Management- Functions of Marketing – Marketing strategies based on product Life Cycle,
Channels of distributions.

Unit IV
Project Management: (PERT/CPM): Development of Network – Difference between PERT
and CPM Identifying Critical Path- Probability- Project Crashing (Simple Problems)

Unit V
Strategic Management: Vision, Mission, Goals, Strategy – Elements of Corporate Planning
Process – Environmental Scanning – SWOT analysis- Steps in Strategy Formulation and
Implementation, Generic Strategy alternatives

Unit VI
Contemporary Management Practice: Basic concepts of MIS, MRP, Justin- Time(JIT)
system, Total Quality Management(TQM), Six sigma and Capability Maturity Model(CMM)
Levies, Supply Chain Management , Enterprise Resource Planning (ERP), Business Process
outsourcing (BPO), Business process Re-engineering and Bench Marking, Balanced Score
Card.

Text Books
1. Dr. P. Vijaya Kumar & Dr. N. Appa Rao, ‘Management Science’ Cengage, Delhi, 2012.
2. Dr. A. R. Aryasri, Management Science’ TMH 2011.

References
1. Koontz & Weihrich: ‘Essentials of management’ TMH 2011
2. Seth & Rastogi: Global Management Systems, Cengage learning , Delhi, 2011
3. Robbins: Organizational Behaviour, Pearson publications, 2011

11
4. Kanishka Bedi: Production & Operations Management, Oxford Publications, 2011
5. Philip Kotler & Armstrong: Principles of Marketing, Pearson publications
6. Biswajit Patnaik: Human Resource Management, PHI, 2011
7. Hitt and Vijaya Kumar: Starategic Management, Cengage learning

Objective: To familiarize with the process of management and to provide basic insights into
select contemporary management practices.

Codes/ Tables: Normal Distribution Function Tables need to be permitted


into the examination Halls

12
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY: KAKINADA
III Year B. Tech. Electronics and Computer Engineering - I Sem.
Design and Analysis of Algorithms

Course Objectives:

Upon completion of this course, students will be able to do the following:

 Analyze the asymptotic performance of algorithms.


 Write rigorous correctness proofs for algorithms.
 Demonstrate a familiarity with major algorithms and data structures.
 Apply important algorithmic design paradigms and methods of analysis.
 Synthesize efficient algorithms in common engineering design situations.

Course Outcomes:

Students who complete the course will have demonstrated the ability to do the following:

 Analyze worst-case running times of algorithms using asymptotic analysis.


 Describe the divide-and-conquer paradigm and explain when an algorithmic design
situation calls for it.
 Describe the dynamic-programming paradigm and explain when an algorithmic
design situation calls for it.
 Describe the greedy paradigm and explain when an algorithmic design situation calls
for it.
 Explain the major graph algorithms and their analyses. Employ graphs to model
engineering problems, when appropriate. Synthesize new graph algorithms and
algorithms that employ graph computations as key components, and analyze them.
 Explain the different ways to analyze randomized algorithms (expected running time,
probability of error). Recite algorithms that employ randomization. Explain the
difference between a randomized algorithm and an algorithm with probabilistic
inputs.
 Analyze randomized algorithms. Employ indicator random variables and linearity of
expectation to perform the analyses. Recite analyses of algorithms that employ this
method of analysis.

Syllabus:

UNIT-I:
Introduction: Algorithm, Psuedo code for expressing algorithms, performance Analysis-
Space complexity, Time complexity, Asymptotic Notation- Big oh notation, Omega
notation, Theta notation and Little oh notation, probabilistic analysis, Amortized analysis.

UNIT-II:
Divide and conquer: General method, applications-Binary search, Quick sort, Merge sort

13
UNIT-III:
Greedy method: General method, applications-Job sequencing with deadlines, knapsack
problem, spanning trees, Minimum cost spanning trees, Single source shortest path problem.

UNIT-IV:
Dynamic Programming: General method, applications-Matrix chain multiplication, Optimal
binary search trees, 0/1 knapsack problem, All pairs shortest path problem, Travelling sales
person problem, Reliability design.

UNIT-V:
Backtracking: General method, applications-n-queen problem, sum of subsets problem,
graph coloring, Hamiltonian cycles.

UNIT-VI:
Branch and Bound: General method, applications - Travelling sales person problem,0/1
knapsack problem- LC Branch and Bound solution, FIFO Branch and Bound solution.

TEXT BOOKS:
1. Fundamentals of Computer Algorithms, Ellis Horowitz, Satraj Sahni and
Rajasekharam, Universities Press.
2. Design and Analysis of Algorithms , S Sridhar, Oxford
3. Design and Analysis of Algorithms, Parag Himanshu Dave, Himansu
BAlachandra Dave, 2ed,Pearson Education.

REFERENCE BOOKS:
1. Design and Analysis of algorithms, Aho, Ullman and Hopcroft,Pearson education.
2. Introduction to the Design and Analysis of Algorithms, Anany Levitin, PEA
3. Introduction to Algorithms, second edition, T.H.Cormen, C.E.Leiserson, R.L.Rivest
and C.Stein,PHI Pvt. Ltd.
4. Algorithm Design, Foundation, Analysis and internet Examples, Michel T Goodrich,
Roberto Tamassia, Wiley

14
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY: KAKINADA
III Year B. Tech. Electronics and Computer Engineering - I Sem.
IC APPLICATIONS LAB

Minimum Six Experiments to be conducted( Each Part) :


Part I
1. Study of ICs – IC 741, IC 555, IC 565, IC 566, IC 1496 – functioning, parameters and
Specifications.

2. OP AMP Applications – Adder, Subtractor, Comparator Circuits.


3. Integrator and Differentiator Circuits using IC 741.
4. Active Filter Applications – LPF, HPF (first order)
5. IC 741 Oscillator Circuits – Phase Shift and Wien Bridge Oscillators.
6. Function Generator using OP AMPs.
7. IC 555 Timer – Monostable and Astable Operation Circuist.
8. Schmitt Trigger Circuits – using IC 741 and IC 555.
9. IC 565 – PLL Applications.
10. IC 566 – VCO Applications.
11. Voltage Regulator using IC 723, Three Terminal Voltage Regulators – 7805, 7809, 7912.

Part-II

Digital IC Applications

1. 3-8 decoder using 74138


2. 4-bit comparator using 7485.
3. 8*1 Multiplexer using 74151 and 2*4 Demultiplexer using 74155.
4. D, JK Flip Flops using 7474, 7483.
5. Decade counter using 7490.
6. UP/DOWN counter using 74163
7. Universal shift registers using 74194/195.
8. RAM (16*4) using 74189 (Read and Write operations).

15
Equipment required for Laboratories:

1. RPS
2. CRO (20 MHz/ 40 MHz/60 MHz )
3. Function Generator (Sine, Square, Triangular and TTL)
4. Multi Meters
5. IC Trainer Kits
6. Bread Boards
7. Components:- IC741, IC555, IC565, IC1496, IC723, 7805, 7809, 7912 and other
essential components.
8. Analog and Digital IC Testers

***

16
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY: KAKINADA
III Year B. Tech. Electronics and Computer Engineering - I Sem.
COMPUTER GRAPHICS LAB

1. Write a program for 2D line drawing as Raster Graphics Display.


2. Write a program for circle drawing as Raster Graphics Display.
3. Write a program to draw an ellipse using Mid Point Algorithm.
4. Write a program to draw a circle using Midpoint algorithm. Modify the same for
drawing an arc and sector.
5. Write a program to rotate a triangle about origin.
6. Write a program to scale the triangle.
7. Write a program to translate a triangle.
8. Write a program to reflect a triangle.
9. Write a program for polygon filling as Raster Graphics Display
10. Write a program for line clipping.
11. Write a program for polygon clipping.
12. Write a program for displaying 3D objects as 2D display using perspective
transformation.
13. Write a program for rotation of a 3D object about arbitrary axis.

17
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY: KAKINADA
III Year B. Tech. Electronics and Computer Engineering - I Sem.
ALGORITHMS LAB

1. To implement functions of Dictionary using Hashing (division method, Multiplication


method, Universal hashing)

2. To perform various operations i.e, insertions and deletions on AVL trees

3. To perform various operations i.e., insertions and deletions on 2-3 trees.

4. To implement operations on binary heap.

5. To implement operations on graphs

i) vertex insertion

ii) Vertex deletion

iii) finding vertex

iv)Edge addition and deletion

6. To implement Depth First Search for a graph nonrecursively.

7. To implement Breadth First Search for a graph nonrecursively.

8. To implement Prim’s algorithm to generate a min-cost spanning tree.

9. To implement Krushkal’s algorithm to generate a min-cost spanning tree.

10. To implement Dijkstra’s algorithm to find shortest path in the graph.

11. To implement pattern matching using Boyer-Moore algorithm.

12. To implement Knuth-Morris-Pratt algorithm for pattern matching.

18
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY: KAKINADA
III Year B. Tech. Electronics and Computer Engineering - I Sem.
IPR & Patents
Unit I

Introduction to Intellectual Property Law – Evolutionary past – Intellectual Property Law


Basics - Types of Intellectual Property - Innovations and Inventions of Trade related
Intellectual Property Rights – Agencies Responsible for Intellectual Property Registration –
Infringement - Regulatory – Over use or Misuse of Intellectual Property Rights - Compliance
and Liability Issues.

Unit II

Introduction to Copyrights – Principles of Copyright – Subject Matters of Copyright – Rights


Afforded by Copyright Law –Copyright Ownership – Transfer and Duration – Right to
Prepare Derivative Works –Rights of Distribution – Rights of performers – Copyright
Formalities and Registration – Limitations – Infringement of Copyright – International
Copyright Law- Semiconductor Chip Protection Act.

Unit III

Introduction to Patent Law – Rights and Limitations – Rights under Patent Law – Patent
Requirements – Ownership and Transfer – Patent Application Process and Granting of Patent
– Patent Infringement and Litigation – International Patent Law – Double Patenting – Patent
Searching – Patent Cooperation Treaty – New developments in Patent Law- Invention
Developers and Promoters.

Unit IV

Introduction to Trade Mark – Trade Mark Registration Process – Post registration procedures
– Trade Mark maintenance – Transfer of rights – Inter parties Proceedings – Infringement –
Dilution of Ownership of Trade Mark – Likelihood of confusion – Trade Mark claims –
Trade Marks Litigation – International Trade Mark Law

Unit V

Introduction to Trade Secrets – Maintaining Trade Secret – Physical Security – Employee


Access Limitation – Employee Confidentiality Agreement – Trade Secret Law – Unfair
Competition – Trade Secret Litigation – Breach of Contract – Applying State Law.

Unit VI

Introduction to Cyber Law – Information Technology Act - Cyber Crime and E-commerce –
Data Security – Confidentiality – Privacy - International aspects of Computer and Online
Crime.

19
REFERENCE BOOKS:

1. Deborah E.Bouchoux: “Intellectual Property”. Cengage learning , New Delhi


2. Kompal Bansal & Parishit Bansal "Fundamentals of IPR for Engineers", BS Publications
(Press)
3. Cyber Law. Texts & Cases, South-Western’s Special Topics Collections
4. Prabhuddha Ganguli: ‘ Intellectual Property Rights” Tata Mc-Graw – Hill, New Delhi
5. Richard Stim: "Intellectual Property", Cengage Learning, New Delhi.
6. R. Radha Krishnan, S. Balasubramanian: "Intellectual Property Rights",
Excel Books. New Delhi.
7. M.Ashok Kumar and Mohd.Iqbal Ali: “Intellectual Property Right” Serials Pub.

20
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
III Year B. Tech. Electronics and Computer Engineering – II Sem.
COMPUTER NETWORKS

Objectives
The aim of this course is to introduce key concepts and principles of computer networks. The
course will use a top-down approach to study the Internet and its protocol stack. Architecture,
protocol, application-examples will include email, web and media-streaming. We will cover
communications services (e.g., TCP/IP) required to support such network applications. The
implementation and deployment of communications services in practical networks: including
wired and wireless LAN environments, will be followed by a discussion of issues of network-
security and network-management. Internet’s architecture and protocols will be used as the
primary examples to illustrate the fundamental principles of computer networking.

UNIT I
INTRODUCTION
OSI, TCP/IP and other networks models, Examples of Networks: Novell Networks, Arpanet,
Internet, Network Topologies WAN, LAN, MAN.

UNIT II
PHYSICAL LAYER
Transmission media copper, twisted pair wireless, switching and encoding asynchronous
communications; Narrow band, broad band ISDN and ATM.

UNIT III
DATA LINK LAYER
Design issues, framing, error detection and correction, CRC, Elementary Protocol-stop and
wait, Sliding Window. Medium Access Sub Layer: ALOHA, MAC addresses, Carrier sense
multiple access, IEEE 802.X Standard Ethernet, wireless LANS, Bridges.

UNIT IV
NETWORK LAYER
Virtual circuit and Datagram subnets-Routing algorithm shortest path routing, Flooding,
Hierarchical routing, Broad cast, Multi cast, distance vector routing. DYNAMIC
ROUTING: Broadcast routing. Rotary for mobility, Congestion, Control Algorithms –
General Principles of Congestion prevention policies. Internetworking: The Network layer in
the internet and in the ATM Networks.

UNIT V
TRANSPORT LAYER
Transport Services, Connection management, TCP and UDP protocols; ATM AAL Layer
Protocol.

21
UNIT VI
APPLICATION LAYER
Network Security, Domain name system, SNMP, Electronic Mail; the World WEB, Multi
Media.

TEXT BOOKS
1. Computer Networks — Andrew S Tanenbaum, 4th Edition. Pearson Education/PHI
2. Data Communications and Networking – Behrouz A. Forouzan.Third Edition TMH.

REFERENCES
1. An Engineering Approach to Computer Networks-S.Keshav, 2nd Edition,Pearson
Education
2. Understanding communications and Networks, 3rd Edition, W.A. Shay, Thomson

Outcomes:
The student will be able to
Analyze a communication system by separating out the different functions provided by the
network; and some example networks

Understand various network topologies required for communication

Understand that there are fundamental limits to any communications system;

Understand the general principles behind addressing, routing, reliable transmission and
other stateful protocols as well as specific examples of each;

Have an informed view of both the internal workings of the Internet and of a number of
common Internet applications and protocols

22
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
III Year B. Tech. Electronics and Computer Engineering – II Sem.
VLSI DESIGN
OBJECTIVES
The student will be introduced to
 Use mathematical methods and circuit analysis models in analysis of CMOS
digital electronics circuits, including logic components and their interconnects.
 Learn the various fabrication steps of IC and come across basic electrical properties of
MOSFET.
 Apply CMOS technology-specific layout rules in the placement and
routing of transistors and interconnect and to verify the functionality, timing,
power and parasitic effects.
 The concepts and techniques of modern integrated circuit design and
testing (CMOS VLSI).
 Design static CMOS combinational and sequential logic at the tran sistor level,
including mask layout.
Unit-I:
Introduction : Introduction to IC Technology, MOS and related VLSI Technology, Basic
MOS Transistors, Enhancement and Depletion modes of transistor action, IC production
process, MOS and CMOS Fabrication processes, BiCMOS Technology, Comparison between
CMOS and Bipolar technologies.
Basic Electrical Properties Of MOS and Bi-CMOS Circuits: Ids versus Vds Relationships,
Aspects of MOS transistor Threshold Voltage, MOS transistor Trans, Output Conductance
and Figure of Merit. The Pass transistor, NMOS Inverter, Pull-up to Pull-down Ratio for
NMOS inverter driven by another NMOS inverter. Alternative forms of pull-up, The CMOS
Inverter, MOS transistor circuit model, Bi-CMOS Inverter, Latch-up in CMOS circuits and
BiCMOS Latch-up Susceptibility.

Unit-II:
MOS and Bi-CMOS Circuit Design Processes: MOS Layers, Stick Diagrams, Design
Rules and Layout, General observations on the Design rules, 2µm Double Metal, Double
Poly, CMOS/BiCMOS rules, 1.2µm Double Metal, Double Poly CMOS rules, Layout
Diagrams of NAND and NOR gates and CMOS inverter, Symbolic Diagrams-Translation to
Mask Form.

Unit-III:
Basic Circuit Concepts: Sheet Resistance, Sheet Resistance concept applied to MOS
transistors and Inverters, Area Capacitance of Layers, Standard unit of capacitance, The
Delay Unit, Inverter Delays, Propagation Delays, Wiring Capacitances, Fan-in and fan-out
23
characteristics, Choice of layers, Transistor switches, Realization of gates using NMOS,
PMOS and CMOS technologies.
Scaling Of MOS Circuits: Scaling models, Scaling factors for device parameters, Limits due
to sub threshold currents, current density limits on logic levels and supply voltage due to
noise.

Unit-IV:
Subsystem Design: Architectural issues, switch logic, Gate logic, examples of structured
design, clocked sequential circuits, system considerations, general considerations of
subsystem design processes, an illustration of design processes.

Unit-V:
VlSI Design Issues: VLSI Design issues and design trends, design process, design for
testability, technology options, power calculations, package selection, clock mechanisms,
mixed signal design, ASIC design flow, FPGA design flow, introduction to SoC design.

Unit-VI:
FPGA Design: Basic FPGA architecture, , FPGA configuration, configuration modes, FPGA
design process- FPGA design flow, FPGA families, FPGA design examples-stack, queue and
shift register implementation using VHDL, step-by-step approach of FPGA design process on
Xilinx environment.

Text Books:

1. Essentials of VLSI Circuits and Systems By Kamran Eshraghian, Douglas and A.


Pucknell and Sholeh Eshraghian, Prentice-Hall of India Private Limited,2005 Edition.
2. VLSI Design-Black Book By Dr. K.V.K.K. Prasad, Kattula Shyamala, Kogent
Learning Solutions Inc.2012 Edition.

References:

1. VLSI Design By A.Albert Raj & T.Latha,PHI Learning Private Limited,2010.


2. VLSI Design-A.Shanthi and A.Kavita, New Age International Private Limited, 2006
First Edition.

OUTCOMES
After going through this course the student will be able to
 Apply the Concept of design rules during the layout of a circuit.
 Model and simulate digital VLSI systems using hardware design language.
 Synthesize digital VLSI systems from register-transfer or higher level descriptions
 Understand current trends in semiconductor technology, and how it impacts scaling
and performance.
.*******

24
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
III Year B. Tech. Electronics and Computer Engineering – II Sem.
Database Management Systems

Course Objectives:
Provides students with theoretical knowledge and practical skills in the use of databases and
database management systems in information technology applications. The logical design,
physical design and implementation of relational databases are covered.

Course Outcomes:
 define a Database Management System
 give a description of the Database Management structure
 understand the applications of Databases
 know the advantages and disadvantages of the different models
 compare relational model with the Structured Query Language (SQL)
 know the constraints and controversies associated with relational database
model.
 know the rules guiding transaction ACID
 understand the concept of data planning and Database design
 identify the various functions of Database Administrator

Syllabus:

Unit – I: INTRODUCTION
Database system, Characteristics (Database Vs File System), Database Users(Actors on
Scene, Workers behind the scene), Advantages of Data base systems, Database applications.
Brief introduction of different Data Models; Concepts of Schema, Instance and data
independence; Three tier schema architecture for data independence; Database system
structure, environment, Centralized and Client Server architecture for the database.

Unit – II:
RELATIONAL MODEL : Introduction to relational model, concepts of domain, attribute,
tuple, relation, importance of null values, constraints (Domain, Key constraints, integrity
constraints) and their importance
BASIC SQL : Simple Database schema, data types, table definitions (create, alter), different
DML operations (insert, delete, update), basic SQL querying (select and project) using where
clause, arithmetic & logical operations, SQL functions(Date and Time, Numeric, String
conversion).

Unit – III:
Entity Relationship Model: Introduction, Representation of entities, attributes, entity set,
relationship, relationship set, constraints, sub classes, super class, inheritance, specialization,
generalization using ER Diagrams.

25
SQL : Creating tables with relationship, implementation of key and integrity constraints,
nested queries, sub queries, grouping, aggregation, ordering, implementation of different
types of joins, view(updatable and non-updatable), relational set operations.

Unit – IV:
SCHEMA REFINEMENT (NORMALIZATION) : Purpose of Normalization or schema
refinement, concept of functional dependency, normal forms based on functional
dependency(1NF, 2NF and 3 NF), concept of surrogate key, Boyce-codd normal
form(BCNF), Lossless join and dependency preserving decomposition, Fourth normal
form(4NF).

Unit – V:
TRANSACTION MANAGEMENT AND CONCURRENCY CONTROL : Transaction,
properties of transactions, transaction log, and transaction management with SQL using
commit rollback and savepoint.
Concurrency control for lost updates, uncommitted data, inconsistent retrievals and the
Scheduler. Concurrency control with locking methods : lock granularity, lock types, two
phase locking for ensuring serializability, deadlocks, Concurrency control with time stamp
ordering : Wait/Die and Wound/Wait Schemes, Database Recovery management :
Transaction recovery.
SQL constructs that grant access or revoke access from user or user groups. Basic PL/SQL
procedures, functions and triggers.

UNIT – VI:
STORAGE AND INDEXING : Database file organization, file organization on disk, heap
files and sorted files, hashing, single and multi-level indexes, dynamic multilevel indexing
using B-Tree and B+ tree, index on multiple keys.

Text Books :
1. Database Management Systems, 3/e Raghuram Krishnan, Johannes Gehrke, TMH
2. Database Management System, 6/e Ramez Elmasri, Shamkant B. Navathe, PEA
3. Database Principles Fundamentals of Design Implementation and Management,
Corlos Coronel, Steven Morris, Peter Robb, Cengage Learning.

Reference Books :
1. Database System Concepts. 5/e Silberschatz, Korth, TMH
2. Introduction to Database Systems, 8/e C J Date, PEA
3. The Database book principles & practice using Oracle/MySql Narain Gehani,
University Press.

26
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
III Year B. Tech. Electronics and Computer Engineering – II Sem.
MICRO PROCESSORS AND MICRO CONTROLLERS
OBJECTIVES : The student will
 learn concepts of microprocessor, different addressing modes and programming of
8086.
 understand interfacing of 8086, with memory and other peripherals.
 learn concept of DMA, USART RS-232 and PIC controller.
 study the features of advanced processors and Pentium processors.
 study the features of 8051 Microcontroller, its instruction set and also other
controllers.
UNIT-I: 8086/8088 MICROPROCESSORS
Register organization of 8086, Architecture, signal description of 8086, physical memory
organization, general bus operation, I/O addressing capability, special purpose activities,
Minimum mode, maximum mode of 8086 system and timings, the processor 8088, machine
language instruction formats, addressing mode of 8086, instruction set off 8086,assembler
directives and operators.
UNIT-II: PROGRAMMING WITH 8086 MICROPROCESSOR
Machine level programs, programming with an assembler, Assembly language programs,
introduction to stack, stack structure of 8086/8088, interrupts and interrupt service routines,
interrupt cycle of 8086, non-mask able interrupt and mask able interrupts, interrupt
programming.
UNIT-III: BASIC ANDSPECIAL PURPOSE PROGRAMMABLE PERIPHERALS
AND THEIR INTERFACING WITH 8086/88
Semiconductor memory interfacing, dynamic RAM interfacing, interfacing i/o ports, PIO
8255 modes of operation of 8255,interfacing to D/A and A/D converters, stepper motor
interfacing, control of high power devices using 8255.Programmable interrupt controller
8259A, the keyboard /display controller8279, programmable communication interface 8251
USART, DMA Controller 8257.
UNIT-IV: ADVANCED MICRO PROCESSORS
Salient features of 0386DX, architecture and signal description of 80386, register
organization of 80386 and addressing modes, data types of 80386, real address mode of
80386, protected mode of 80386, segmentation and Paging, virtual 8086 mode and enhanced
mode. Instruction set of 80386.The coprocessor 80387.
UNIT-V: 8051 MICROCONTROLLER
Introduction to microcontrollers, 8051Microcontrollers, 8051pin description, connections,
I/O ports and memory organization, MCS51addressing modes and instructions, assembly
language programming tools.

27
UNIT-VI: PIC MICROCONTROLLERSAND ARM 32-BIT MICROCONTROLLER
Overview and features, PIC16Cx/7X instructions, interrupts in PIC 16C61/71, PIC 16F8XX
Flash controllers, I/O ports and timers. Introduction to 16/32 Bit processors, ARM
architecture and organization, ARM / Thumb programming model, ARM / Thumb instruction
set.
TEXT BOOKS:
1. A.K.Ray, K.M.Bhurchandi ,”Advanced Microprocessors and Peripherals”, Tata
McGraw Hill Publications,2000.
2. N.Sentil Kumar, M.Saravanan, S.Jeevananthan, “Microprocessors and
Microcontrollers”, Oxford University Press,2010.
REFERENCES:
1. Ajay V Deshmukh, ”Microcontrollers”, TATA McGraw Hill publications,2012.
2. Krishna Kant, “Microprocessors and Microcontrollers”, PHI Publications, 2010.

OUTCOMES
After going through this course the student will be able to
 develop programs for different addressing modes.
 perform 8086 interfacing with different peripherals and implement programs
 describe the key features of serial and parallel communication and able to
 Design a microcontroller for simple applications.

28
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
III Year B. Tech. Electronics and Computer Engineering – II Sem.
OPERATING SYSTEMS

Course Objectives:
To gain knowledge about the Operating Systems concepts such as process, main memory
management, secondary memory management, CPU and disk scheduling etc

Course Outcomes:
By the end of the course student will be able to
 describe the general architecture of computers
 describe, contrast and compare differing structures for operating Systems
 understand and analyse theory and implementation of: processes, resource
control (concurrency etc.), physical and virtual memory, scheduling, I/O
and files

Syllabus:

UNIT-I:
Computer System and Operating System Overview: Overview of computer operating
systems, operating systems functions, protection and security, distributed systems, special
purpose systems, operating systems structures and systems calls, operating systems
generation.

UNIT-II:
Process Management – Process concept- process scheduling, operations, Inter process
communication. Multi Thread programming models. Process scheduling criteria and
algorithms, and their evaluation.

UNIT-III:
Concurrency: Process synchronization, the critical- section problem, Peterson’s Solution,
synchronization Hardware, semaphores, classic problems of synchronization, monitors,
Synchronization examples

UNIT-IV:
Memory Management: Swapping, contiguous memory allocation, paging, structure of the
page table, segmentation
Virtual Memory Management:
virtual memory, demand paging, page-Replacement, algorithms, Allocation of Frames,
Thrashing

UNIT-V:
Principles of deadlock – system model, deadlock characterization, deadlock prevention,
detection and avoidance, recovery form deadlock,

29
UNIT-VI:
File system Interface- the concept of a file, Access Methods, Directory structure, File
system mounting, file sharing, protection.
File System implementation- File system structure, allocation methods, free-space
management
Mass-storage structure overview of Mass-storage structure, Disk structure, disk attachment,
disk scheduling

TEXT BOOKS:
1. Operating System Concepts- Abraham Silberchatz, Peter B. Galvin, Greg Gagne 7th
Edition, John Wiley.
2. Operating Systems’ – Internal and Design Principles Stallings, Sixth Edition–2005,
Pearson education

REFERENCE BOOKS:
1. http://nptel.iitm.ac.in/courses/Webcourse-contents/IISc-BANG/
Operating%20Systems/New_index1.html
2. Operating systems- A Concept based Approach-D.M.Dhamdhere, 2nd Edition, TMH
3. Operating System A Design Approach-Crowley, TMH.
4. Modern Operating Systems, Andrew S Tanenbaum 3rd edition PHI.

30
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
III Year B. Tech. Electronics and Computer Engineering – II Sem.
MICROPROCESSORS AND MICROCONTROLLERS LAB

The students are required to develop the necessary Algorithm, Flowchart and Assembly
Language Program Source Code for executing the following functions using MASM/TASM
software and to verify the results with necessary Hardware Kits.

PART-I: MICROPROCESSOR 8086


1. Introduction to MASM/TASM.
2. Arithmetic operation- Multi byte Addition and Subtraction, Multiplication and Division-
Signed and unsigned Arithmetic operation, ASCII- Arithmetic operation.
3. Logic operations-Shift and rotate- Converting packed BCD to unpacked BCD, BCD to
ASCII conversion.
4. By using string operation and Instruction prefix: Move Block, Reverse string, Sorting,
Inserting, Deleting, Length of the string, String comparison.
5. DOS/BIOS programming: Reading keyboard (Buffered with and without echo)- Display
characters, Strings.

PART-II: INTERFACING WITH MICROPROCESSOR


1. 8259 – Interrupt Controller-Generate an interrupt using 8259 timer.
2. 8279 – Keyboard Display- Write a program to display a string of characters.
3. 8255 – PPI-Write ALP to generate sinusoidal wave using PPI.
4. 8251 – USART-Write a program in ALP to establish Communication between two
processors.

PART-III: MICROCONTROLLER 8051


1. Reading and Writing on a parallel port.
2. Timer in different modes.
3. Serial communication implementation.

PART-IV: INTERFACING WITH MICROCONTROLLER


Write C programs to interface 8051 chip to Interfacing modules to Develop single chip
solutions.
1. Simple Calculator using 6 digit seven segment display and Hex Keyboard interface to
8051.
2. Alphanumeric LCD panel and Hex keypad input interface to 8051.
3. External ADC and Temperature control interface to 8051.
4. Generate different waveforms Sine, Square, Triangular, and Rampetc. using DAC
interface to 8051; change the frequency and Amplitude.

31
EQUIPMENT REQUIRED FOR LABORATORY
1. MASM/TASM software 2. 8086 Microprocessor Kits
1. 8051 Micro Controller kits
2. Interfaces/peripheral subsystems
i) 8259 PIC
ii) 8279-KB/Display
iii) 8255 PPI
iv) 8251 USART
5. A/D and D/AC Interface

32
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
III Year B. Tech. Electronics and Computer Engineering – II Sem.
ELECTRONIC COMPUTER AIDED DESIGN LABORATORY

The students are required to Design and draw the internal structure of the following Digital
Integrated Circuits and to develop VHDL Source code, Perform Simulation using relevant
Simulator and analyze the obtained simulation results using necessary Synthesizer. Further, it
is required to verify the logical operations of the Digital ICs (Hardware) in the Laboratory.

1. Realization of Logic Gates


2. 3 to 8 Decoder -74138
3. 8 x 1 Multiplexer-74151 and 2x 4 De-multiplexer-74155
4. 4- Bit comparator-7485
5. D Flip-Flop-7474
6. Decade counter -7490
7. 4 Bit counter-7493
8. Shift registers-7495
9. Universal shift registers-74194/ 195
10. RAM (16 x 4)-74189 (Read and Write operations)
11. Stack and Queue implementation using RAM
12. ALU Design

EQUIPMENT REQUIRED FOR LABORATORY


1. Xilinx ISE Software.
2. Digital ICs.
3. Personal Computers.
4. Necessary Hardware Kits.

33
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
IV Year B. Tech. Electronics and Computer Engineering – I Sem.
Systems Programming
UNIT I: Language Processors:
Programming Languages and Language Processors, Language processing activities,
Fundamentals of Language processing (Text book 1)

UNIT II: Machine Structure, Machine Language and Assembly language:


General machine structure, Machine Language, Assembly Language (Text book 2)

UNIT III: Assemblers:


General design procedure, Design of Assembler- Problem statement, data structure,
databases, Algorithm (Text book 2)

UNIT IV: Macro Language and Macro Processor:


Macro instructions, Features of a Macro facility- Macro instruction arguments, Conditional
Macro expansion, Macro calls within Macros, Macro instructions defining Macros (Text
book 2)

UNIT V: Loaders:
Loader Schemes, Design of an absolute loader, Design of a direct linking loader (Text book
2)

UNIT VI: Interpreters & Editors:


Interpreters- Benefits of interpretation, overview of interpretation, The Java Language
environment (Text book 1)
Editors: Screen editors, word processors, Structure editors, Design of an editor.
(Text book 1)

Text books:
1. System Programming & Operating System, Dhamdhere, - TMH
2. System Programming, John J. Donovan - TMH
Refernce Books:
1. System Software, Beck & Manjula, - Pearson Education - 3rd Ed
2. System Programming and Compiler Construction, R.K. Maurya, - Wiley-dreamtech

34
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
IV Year B. Tech. Electronics and Computer Engineering – I Sem.
DIGITAL SIGNAL PROCESSING
OBJECTIVES
The student will be able to
 Define and use Discrete Fourier Transforms (DFTs)
 Use Z - transforms and discrete time Fourier transforms to analyze a digital system.
 Understand simple finite impulse response filters
 Learn the design procedures used for filter bank
 Learn to program a DSP processor to filter signals
UNIT I
INTRODUCTION: Introduction to Digital Signal Processing: Discrete time signals &
sequences, linear shift invariant systems, stability, and causality. Linear constant coefficient
difference equations. Frequency domain representation of discrete time signals and systems.
UNIT II
DISCRETE FOURIER SERIES& FOURIER TRANSFORMS: Properties of discrete
Fourier series, DFS representation of periodic sequences, Discrete Fourier transforms:
Properties of DFT, linear convolution of sequences using DFT,Computation of DFT, Fast
Fourier transforms (FFT) - Radix-2 decimation in time and decimation in frequency FFT
Algorithms, Inverse FFT.
UNIT III
REALIZATION OF DIGITAL FILTERS: Review of Z-transforms, Applications of Z –
transforms, solution of difference equations - digital filters, Block diagram representation of
linear constant-coefficient difference equations, Basic structures of IIR systems, Transposed
forms, Basic structures of FIR systems, System function,
UNIT IV
IIR & FIR DIGITAL FILTERS: Analog filter approximations – Butter worth and
Chebyshev, Design of IIR Digital filters from analog filters, Design Examples: Analog-
Digital transformations Characteristics of FIR Digital Filters, frequency response. Design
of FIR Digital Filters using Window Techniques, Frequency Sampling technique,
Comparison of IIR & FIR filters.

35
UNIT V
MULTIRATE DIGITAL SIGNAL PROCESSING: Decimation, interpolation, sampling
rate conversion, Implementation of sampling rate conversion.

UNIT VI
INTRODUCTION TO DSP PROCESSORS: Introduction to programmable DSPs:
Multiplier and Multiplier Accumulator (MAC), Modified Bus Structures and Memory Access
schemes in DSPs Multiple access memory ,multiport memory, VLSI architecture, Pipelining,
Special addressing modes, On-Chip Peripherals. Architecture of TMS 320C5X- Introduction,
Bus Structure, Central Arithmetic Logic Unit, Auxiliary Register, Index Register, Block
Move Address Register, Parallel Logic Unit, Memory mapped registers, program controller,
Some flags in the status registers, On- chip registers, On-chip peripherals
TEXT BOOKS:
1. Digital Signal Processing, Principles, Algorithms, and Applications: John G. Proakis,
Dimitris G.Manolakis,Pearson Education / PHI, 2007.
2. Discrete Time Signal Processing – A.V.Oppenheim and R.W. Schaffer, PHI
3. Digital Signal Processors – Architecture, Programming and Applications,,
B.Venkataramani, M.Bhaskar, TATA McGraw Hill, 2002
4. Digital Signal Processing – K Raja Rajeswari, I.K. International Publishing House
Reference Books:
1. Digital Signal Processing: Andreas Antoniou, TATA McGraw Hill , 2006
2. Digital Signal Processing: MH Hayes, Schaum’s Outlines, TATA Mc-Graw Hill, 2007.
3. DSP Primer - C. Britton Rorabaugh, Tata McGraw Hill, 2005.
4. Fundamentals of Digital Signal Processing using Matlab – Robert J. Schilling, Sandra
L. Harris,Thomson, 2007.
5. Digital Signal Processing – Alan V. Oppenheim, Ronald W. Schafer, PHI Ed., 2006
OUTCOMES
After going through this course the student will be able to

 Estimate the spectra of signals that are to be processed by a discrete time filter, and to
verify the performance of a variety of modern and classical spectrum estimation
techniques.
 Design and simulate a digital filter
 Design new digital signal processing systems.
 Design and realize FIR, IIR filters
 Program a DSP processor to filter signals

36
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
IV Year B. Tech. Electronics and Computer Engineering – I Sem.
DIGITAL IMAGE PROCESSING
OBJECTIVES

The student will


 Learn the fundamental concepts and applications of Digital Image Processing.
 Learn the concepts of and how to perform Intensity transformations and spatial
filtering.
 Understand the relationship between Filtering in spatial and frequency domains,
 Understand the concepts of and how to perform Image restoration and reconstruction.
 Understand the concepts of different color models and Color image processing.
 Learn the concepts of Wavelets and multi-resolution processing, Image compression
and Watermarking, Morphological image processing, Image segmentation,
Representation and description.
UNIT-1
Introduction: Origins of digital image processing, uses digital image processing,
fundamental steps in digital image processing, components of an image processing system,
digital image fundamentals, Elements of visual perception, light and electromagnetic
spectrum, imaging sensing and acquisition, image sampling and quantization. Some basic
relationships between pixels, an introduction to the mathematical tools used in digital image
processing
Image Transforms: Need for image transforms, Spatial Frequencies in image processing,
introduction to Fourier transform, discrete Fourier transform, fast Fourier transform and its
algorithm, properties of Fourier transform. Discrete sine transforms. Walsh Transform.
Hadamard transform, Haar Transform. Slant transforms, SVD and KL Transforms or
Hotelling Transform
UNIT-2
Intensity Transformations and Spatial Filtering: Background, Some basic intensity
transformation functions, histogram processing, fundamentals of spatial filtering, smoothing
spatial filters , sharpening spatial filters, Combining spatial enhancement methods, using
fuzzy techniques for intensity transformations and spatial filtering
Filtering in the frequency domain: Preliminary concepts, Sampling and the Fourier
transform of sampled functions, the discrete Fourier transform (DFT) of one variable,
Extension to functions of two variables, some properties of the 2-D Discrete Fourier
transform. The Basic of filtering in the frequency domain, image smoothing using frequency
domain filters, Selective filtering, Implementation
UNIT-3
Image restoration and Reconstruction: A model of the image degradation / Restoration
process, Noise models, restoration in the presence of noise only-Spatial Filtering, Periodic
Noise Reduction by frequency domain filtering, Linear, Position –Invariant Degradations,
Estimation the degradation function, Inverse filtering, Minimum mean square error(Wiener)
37
filtering ,constrained least squares filtering ,geometric mean filtering ,image reconstruction
from projections.
Unit-4
Color image processing: color fundamentals, color models, pseudo color image processing,
basic of full color image processing, color transformations, smoothing and sharpening. Image
segmentation based on color, noise in color images, color image compression
Unit-5
Wavelets and Multi-resolution Processing: image pyramids, sub band coding & Haar
transforms multi resolution expressions, wavelet transforms in one dimensions. The fast
wavelets transform, wavelet transforms in two dimensions, wavelet packets.
Image compression: Fundamentals, various compression methods-coding techniques, digital
image water marking
Unit-6
Morphological image processing: preliminaries Erosion and dilation, opening and closing,
the Hit-or-miss transformation, some Basic Morphological algorithms, grey –scale
morphology
Image segmentation: Fundamentals, point, line, edge detection thresholding, region –based
segmentation, segmentation using Morphological watersheds, the use of motion in
segmentation
Text Books
1. R. C. Gonzalez and R. E. Woods, Digital Image Processing, 3rd edition, Prentice Hall ,
2008.
2. R. C. Gonzalez, R. E. Woods and Steven L. Eddins , Digital Image Processing Using
MATLAB , 2rd edition, Prentice Hall, 2009.
3. Anil K.Jain, “Fundamentals of Digital Image Processing”, Prentice Hall of India, 9th
Edition, Indian Reprint, 2002
4. Jayaraman, S. Esakkirajan, and T. Veerakumar, Digital Image Processing, Tata McGraw-
Hill Education, 2011

OUTCOMES
After going through this course the student will be able to
 Perform different transforms on image useful for image processing applications
 Perform spatial and frequency domain filtering on image and can implement all
smoothing and sharpening operations on images
 Perform image restoration operations/techniques on images
 Operate effectively on color images and different color conversions on images and
can code images to achieve good compression
 Do wavelet based image processing and image compression using wavelets
 Perform all morphological operations on images and can be able to do image
segmentation also.
 Develop simple algorithms for image processing and use the various techniques
involved in Bio Medical applications, etc.

38
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
IV Year B. Tech. Electronics and Computer Engineering – I Sem.
UNIX Programming

UNIT-I:
Introduction to Unix file system, vi editor, file handling utilities, security and file
permissions, process utilities, disk utilities, networking commands, cp, mv, ln, rm, unlink,
mkdir, rmdir, du, df, mount, umount, find, unmask, ulimit, ps, who, w, finger, arp, ftp, telnet,
rlogin, text processing utilities and backup utilities, detailed commands to be covered are cat,
tail, head, sort, nl, uniq, grep, egrep, fgrep, cut, paste, join, tee, pg, comm, cmp, diff, tr, awk,
tar, cpio.

UNIT-II:
Working with the Bourne shell: what is a shell, shell responsibilities, pipes and input
Redirection, output redirection, here documents, the shell as a programming language, shell
meta characters, shell variables, shell commands, the environment, control structures, shell
script examples.

UNIT-III:
Unix file structure, directories, files and devices, System calls, library
functions, low level file access, usage of open, creat, read, write, close, lseek, stat, fstat, octl,
umask, dup, dup2. The standard I/O (fopen, fclose, fflush, fseek, fgetc, getc, getchar, fputc,
putc, putchar,fgets, gets ) file and directory maintenance (chmod, chown, unlink, link,
symlink, mkdir, rmdir, chdir, getcwd),Directory handling system calls (opendir, readdir,
closedir,rewinddir, seekdir, telldir)

UNIT-IV:
Unix Process: What is process, process structure, starting new process, waiting for a process,
zombie process, process control, process identifiers, system call interface for process
management-fork, vfork, exit, wait, waitpid, exec, system.

UNIT-V:
Signals- Signal functions, unreliable signals, interrupted system calls, kill and raise functions,
alarm, pause functions, abort, sleep functions.

UNIT-VI:
Interprocess Communication Overview: Introduction to IPC-IPC between processes on a
single computer system, IPC between processes on different systems, pipes, FIFOs, streams
and messages, namespaces

39
TEXT BOOKS:

1. Unix Network Programming, W.R.Stevens Pearson/PHI.


2. Unix the ultimate guide, 3rd Edition, Sumitabha Das, TMH.
3. Unix and Shell Programming Behrouz A. ForouZan, Richard F Gilberg, CENGAGE

REFERENCE BOOKS:

1. http://nptel.iitm.ac.in/courses/Webcourse-contents/IISc-
BANG/Operating%20Systems/pdf/Lecture_Notes/Mod%2013_LN.pdf
2. Advanced UNIX Programming, N B Venkateswarlu, BS publications.2e.

40
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
IV Year B. Tech. Electronics and Computer Engineering – I Sem.
Artificial Intelligence
( Elective I )

Course Objectives:
1. To have a basic proficiency in a traditional AI language including an ability to write
simple to intermediate programs and an ability to understand code written in that
language.
2. To have an understanding of the basic issues of knowledge representation and blind
and heuristic search, as well as an understanding of other topics such as minimax,
resolution, etc. that play an important role in AI programs.
3. To have a basic understanding of some of the more advanced topics of AI such as
learning, natural language processing, agents and robotics, expert systems, and
planning

Course Outcomes:
After completing this course, students should be able to:
1. Identify problems that are amenable to solution by AI methods, and which AI
methods may be suited to solving a given problem.
2. Formalize a given problem in the language/framework of different AI methods (e.g.,
as a search problem, as a constraint satisfaction problem, as a planning problem, as a
Markov decision process, etc).
3. Implement basic AI algorithms (e.g., standard search algorithms or dynamic
programming).
4. Design and carry out an empirical evaluation of different algorithms on a problem
formalization, and state the conclusions that the evaluation supports.

Syllabus:

UNIT-I:
Introduction to artificial intelligence: Introduction ,history, intelligent systems, foundations
of AI, applications, tic-tac-tie game playing, development of ai languages, current trends in
AI

UNIT-II:
Problem solving: state-space search and control strategies : Introduction, general problem
solving, characteristics of problem, exhaustive searches, heuristic search techniques,
iterative-deepening a*, constraint satisfaction
Problem reduction and game playing: Introduction, problem reduction, game playing,
alpha-beta pruning, two-player perfect information games
41
UNIT-III:
Logic concepts: Introduction, propositional calculus, proportional logic, natural deduction
system, axiomatic system, semantic tableau system in proportional logic, resolution refutation
in proportional logic, predicate logic

UNIT-IV:
Knowledge representation: Introduction, approaches to knowledge representation,
knowledge representation using semantic network, extended semantic networks for KR,
knowledge representation using frames advanced knowledge representation techniques:
Introduction, conceptual dependency theory, script structure, cyc theory, case grammars,
semantic web

UNIT-V:
Expert system and applications: Introduction phases in building expert systems, expert
system versus traditional systems, rule-based expert systems blackboard systems truth
maintenance systems, application of expert systems, list of shells and tools

UNIT-VI:
Uncertainty measure: probability theory: Introduction, probability theory, Bayesian belief
networks, certainty factor theory, dempster-shafer theory
Fuzzy sets and fuzzy logic: Introduction, fuzzy sets, fuzzy set operations, types of
membership functions, multi valued logic, fuzzy logic, linguistic variables and hedges, fuzzy
propositions, inference rules for fuzzy propositions, fuzzy systems.

TEXT BOOKS:
1. Artificial Intelligence- Saroj Kaushik, CENGAGE Learning,
2. Artificial intelligence, A modern Approach , 2nd ed, Stuart Russel, Peter Norvig, PEA
3. Artificial Intelligence- Rich, Kevin Knight, Shiv Shankar B Nair, 3rd ed, TMH
4. Introduction to Artificial Intelligence, Patterson, PHI

REFERNCE BOOKS:
1. Atificial intelligence, structures and Strategies for Complex problem solving, -George
F Lugar, 5th ed, PEA
2. Introduction to Artificial Intelligence, Ertel, Wolf Gang, Springer
3. Artificial Intelligence, A new Synthesis, Nils J Nilsson, Elsevier

42
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
IV Year B. Tech. Electronics and Computer Engineering – I Sem.
ADVANCED COMPUTER ARCHITECTURE
( Elective I )

UNIT -I:
Fundamentals of Computer Design:
Fundamentals of Computer design, Changing faces of computing and task of computer
designer, Technology trends, Cost price and their trends, Measuring and reporting
performance, Quantitative principles of computer design, Amdahl’s law.
Instruction set principles and examples- Introduction, Classifying instruction set- MEmory
addressing- type and size of operands, Operations in the instruction set.

UNIT –II:
Pipelines:
Introduction, Basic RISC instruction set, Simple implementation of RISC instruction set,
Classic five stage pipe lined RISC processor, Basic performance issues in pipelining, Pipeline
hazards, Reducing pipeline branch penalties.
Memory Hierarchy Design:
Introduction, Review of ABC of cache, Cache performance, Reducing cache miss penalty,
Virtual memory.

UNIT -III:
Instruction Level Parallelism the Hardware Approach:
Instruction-Level parallelism, Dynamic scheduling, Dynamic scheduling using Tomasulo’s
approach, Branch prediction, high performance instruction delivery- hardware based
speculation.

UNIT-IV
ILP Software Approach
Basic compiler level techniques, Static branch prediction, VLIW approach, Exploiting ILP,
Parallelism at compile time, Cross cutting issues -Hardware verses Software.

UNIT –V:
Multi Processors and Thread Level Parallelism:
Multi Processors and Thread level Parallelism- Introduction, Characteristics of application
domain, Systematic shared memory architecture, Distributed shared – memory architecture,
Synchronization.

43
UNIT –VI: Inter Connection and Networks:
Introduction, Interconnection network media, Practical issues in interconnecting networks,
Examples of inter connection, Cluster, Designing of clusters.
Intel Architecture: Intel IA-64 ILP in embedded and mobile markets Fallacies and pit falls.
TEXT BOOKS:
1. John L. Hennessy, David A. Patterson - Computer Architecture: A Quantitative
Approach, 3rd Edition, An Imprint of Elsevier.
REFERENCE BOOKS:
1. John P. Shen and Miikko H. Lipasti - Modern Processor Design : Fundamentals of
Super Scalar Processors
2. Computer Architecture and Parallel Processing - Kai Hwang, Faye A.Brigs., MC Graw
Hill.
3. Advanced Computer Architecture - A Design Space Approach - Dezso Sima, Terence
Fountain, Peter Kacsuk , Pearson Ed.

44
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
IV Year B. Tech. Electronics and Computer Engineering – I Sem.
DATA COMMUNICATION
( Elective I )

UNIT I
DIGITAL MODULATION TECHNIQUES: FSK , MSK , BPSK , QPSK , 8-PSK , 16-PSK ,
8- QAM , 16- QAM , Band width efficiency carrier recovery DPSK , clock recovery ,
Probability of error and bit error rate.

UNIT II
DATA COMMUNICATIONS: Serial, Parallel configuration, Topology, Transmission
modes, codes, Error Control, Synchronization, LCU. Serial and Parallel Interfaces, Telephone
Networks and Circuits, Data modems.

UNIT III
Data Communication Protocols , Character and block Mode ,Asynchronous and
Synchronous Protocols, public Data Networks , ISDN. LOCAL AREA NETWORKS: token
ring, Ethernet, Traditional, Fast and GIGA bit
Ethernet, FDDI

UNIT IV
DIGITAL MULTIPLEXING : TDM , T1 carrier , CCITT , CODECS, COMBO CHIPS ,
North American Hierarchy , Line Encoding , T-carrier , Frame Synchronization Inter Leaving
Statistical TDM FDM , Hierarchy ,Wave Division Multiplexing .

UNIT V
WIRELESS LANS : IEEE 802.11 Architecture Layers, Addressing, Blue Tooth Architecture
Layers, l2 Cap, Other Upper Layers .

UNIT VI
MULTI MEDIA: Digitalizing Video and Audio Compression Streaming Stored and Live
Video and Audio , Real Time Interactive Video and Audio , VOIP

TEXT BOOKS
1. Electronic communication systems, fundamentals through advanced - W. TOMASI,
Pearson 4th Edition.
2. Data communication and networking - B.A. Forouzen

45
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
IV Year B. Tech. Electronics and Computer Engineering – I Sem.
WEB DESIGN
( Elective II )

UNIT I: Review of HTML4 : Common tags ,HTML Tables and formatting internal
linking, Complex HTML forms.
Introduction to Scripting Languages: Java Scripts, Control structures, functions, arrays &
objects, DHTML, CSS, event model, filters & transitions.

UNIT II: Review of Applets, Class, Event Handling, AWT Programming:


Introduction to Swing: Japplet, Handling Swing Controls like Icons, Buttons, Text
Boxes, Combo Boxes, Tabbed Pains, Scroll Pains, Trees, Tables, Differences between
AWT Controls & Swing Controls, Developing a Home page using Applets & Swing.

UNIT III :Java Beans: Introduction to Java Beans, Advantages of Java Beans, BDK,
Introspection, Using Bound properties, Bean Info Interface, Constrained properties,
Persistence, Customizers, Java Beans API.

UNIT IV: Introduction to Servelets: Lifecycle of a Servlet, JSDK, The Servlet API,
The javax.servlet Package, Reading Servlet parameters, Reading Initialization
Parameters, The javax.servlet.HTTP package, Handling, Http Request & responses,
Using Cookies, Session Tracking, Security Issues.

UNIT V : Introduction to JSP: The Problem with Servelets, The Anatomy of a JSP
Page, JSP Processing, JSP Application Design with MVC.
Setting Up the JSP Environment: Installing the Java Software Development Kit,
Tomcat Server & Testing Tomcat.
JSP Application Development: Generating Dynamic Content, Using Scripting
Elements, Implicit JSP Objects, Conditional Processing – Displaying Values, Using an
Expression to Set an Attribute, Declaring Variables and Methods, Error Handling and
Debugging, Sharing Data Between JSP Pages, Requests, and Users, Passing Control and
Data Between Pages – Sharing Session and Application Data Memory Usage
Considerations.

UNIT VI: Database Access: Database Programming using JDBC, Studying Javax.sql.*
package. Accessing a Database from a JSP Page, Application – Specific Database Actions
Deploying JAVA Beans in a JSP Page.

TEXT BOOKS:
1. Internet and World Wide Web: How to program,6/e, Dietel, Dietel , Pearson.
2. The Complete Reference Java2, 8/e, Patrick Naughton, Herbert Schildt, TMH.
3. Java Server Faces, Hans Bergstan, O’reilly.

REFERENCE BOOKS:

46
4. Web Programming, building internet applications, 2/e, Chris Bates, Wiley
Dreamtech
5. Programming world wide web, Sebesta, PEA
6. Web Tehnologies, 2/e, Godbole, kahate, TMH
7. An Introduction to web Design , Programming ,Wang,Thomson

47
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
IV Year B. Tech. Electronics and Computer Engineering – I Sem.
FUZZY LOGIC AND NEURAL NETWORKS
(Elective-II)
OBJECTIVE:
This course introduces the basics of Neural Networks and essentials of Artificial Neural
Networks with Single Layer and Multilayer Feed Forward Networks. Also deals with
Associate Memories and introduces Fuzzy sets and Fuzzy Logic system components. The
Neural Network and Fuzzy Network system application to Electrical Engineering is also
presented. This subject is very important and useful for doing Project Work.

1. Introduction to Neural Networks

Introduction, Humans and Computers, Organization of the Brain, Biological Neuron,


Biological and Artificial Neuron Models, Hodgkin-Huxley Neuron Model, Integrate-and-Fire
Neuron Model, Spiking Neuron Model, Characteristics of ANN, McCulloch-Pitts Model,
Potential Applications of ANN.

Essentials of Artificial Neural Networks


Artificial Neuron Model, Operations of Artificial Neuron, Types of Neuron Activation
Function, ANN Architectures, Classification Taxonomy of ANN-Connectivity, Neural
Dynamics (Activation and Synaptic), Learning Strategy (Supervised, Unsupervised,
Reinforcement), Learning Rules, Types of Application.

2. Feed Forward Neural Networks


Introduction, Perceptron Models: Discrete, Continuous and Multi-Category, Training
Algorithms: Discrete and Continuous Perceptron Networks, Perceptron Convergence
theorem, Limitations of the Perceptron Model, Applications. Multilayer Feed Forward Neural
Networks Credit Assignment Problem, Generalized Delta Rule, Derivation of Back-propagation
(BP) Training, Summary of Back-propagation Algorithm, Kolmogorov Theorem,
LearningDifficulties and Improvements.

3. Associative Memories
Paradigms of Associative Memory, Pattern Mathematics, Hebbian Learning, General
Concepts of Associative Memory Associative Matrix, Association Rules, Hamming Distance,
The Linear Associator, Matrix Memories, Content Addressable Memory, Bidirectional
Associative Memory (BAM) Architecture, BAM Training Algorithms: Storage and Recall
Algorithm, BAM Energy Function, Proof of BAM Stability Theorem. Architecture of Hopfield
Network: Discrete and Continuous versions, Storage and Recall Algorithm, Stability Analysis,
Capacity of the Hopfield Network.
4. Self-Organizing Maps (SOM) and Adaptive Resonance Theory (ART)
Introduction, Competitive Learning, Vector Quantization, Self-Organized Learning
Networks, Kohonen Networks, Training Algorithms, Linear Vector Quantization,

48
Stability- Plasticity Dilemma, Feed forward competition, Feedback Competition, Instar,
Outstar, ART1, ART2, Applications.

5. Classical & Fuzzy Sets


Introduction to classical sets – properties, Operations and relations; Fuzzy sets, Membership,
Uncertainty, Operations, Properties, fuzzy relations, cardinalities, membership functions.

6. Fuzzy Logic System Components


Fuzzification, Membership Value assignment, development of rule base and decision making
system, Defuzzification to crisp sets, Defuzzification methods.
Applications
Neural network applications: Process identification, Fraction Approximation, Control and
Process Monitoring, Fault diagnosis and Load forecasting.
Fuzzy logic applications: Fuzzy logic control and Fuzzy classification.

Text Books:
1. Neural Netwroks, Fuzy logic , Gnenetic algorithms: synthesis and applications by
Rajasekharan and Rai- PHI Publication.
2. Introduction to Artificial Neural Systems- Jacek M.Zurada, Jaico Publishing House,
1997.

Reference Books:
1. Neural and Fuzzy Systems: Foundation, Architectures and Applications, - N. Yadaiah
and S. Bapi Raju, Pearson Education
2. Neural Netwroks – James A Freeman and Davis Skapura, Pearson, 2002
3. Neural Netwroks – Simon Hakins, Pearson Education.
4. Neural Engineering by C. Eliasmith and CH. Anderson, PHI.
Neural Netwroks and Fuzzy Logic System by Brok Kosko, PHI Publications

49
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
IV Year B. Tech. Electronics and Computer Engineering – I Sem.
STRUCTURED DIGITAL DESIGN
(Elective-II)

UNIT-I: INTRODUCTION TO HDL


Design Concepts: The Design process, Design of Digital Hardware, Introduction to Logic
Circuits, Introduction to CAD Tools, Introduction to VHDL, Introduction to Digital Design
Methodology, Design methodology, Introduction to Verilog.

UNIT-II: DIGITAL LOGIC DESIGN USING VHDL


Introduction, designing with VHDL, design entry methods, logic synthesis , entities ,
architecture , packages and configurations, types of models: dataflow , behavioral , structural,
signals vs. variables, generics, data types, concurrent vs. sequential statements , loops and
program controls.

UNIT-III: COMBINATIONAL LOGIC CIRCUIT DESIGN USING VHDL


Combinational circuits building blocks: Multiplexers, Decoders , Encoders , Code converters
, Arithmetic comparison circuits , VHDL for combinational circuits , Adders-Half Adder,
Full Adder, Ripple-Carry Adder, Carry Look-Ahead Adder, Subtraction, Multiplication.

SEQUENTIAL LOGIC CIRCUIT DESIGN USING VHDL


Flip-flops, registers & counters, synchronous sequential circuits: Basic design steps, Mealy
State model, Design of FSM using CAD tools, Serial Adder Example, State Minimization,
Design of Counter using sequential Circuit approach.

UNIT-IV: DIGITAL LOGIC CIRCUIT DESIGN USING VERILOG


Verilog Data types and Operators, Binary data manipulation, Combinational and Sequential
logic design, Structural Models of Combinational Logic, Logic Simulation, Design
Verification and Test Methodology, Propagation Delay, Truth Table models of combinational
and sequential logic using Verilog, Verilog for combinational circuits.

UNIT-V: DIGITAL LOGIC CIRCUIT DESIGN EXAMPLES USING VERILOG


Behavioral modeling , Data types, Boolean-Equation-Based behavioral models of
combinational logics , Propagation delay and continuous assignments , latches and level-
sensitive circuits in Verilog, Cyclic behavioral models of flip-flops and latches and Edge
detection, comparison of styles for behavioral model; Behavioral model, Multiplexers,
Encoders and Decoders, Counters, Shift Registers, Register files, Dataflow models of a linear
feedback shift register, Machines with multi cycle operations, ASM and ASMD charts for
behavioral modeling, Design examples, Keypad scanner and encoder.

UNIT-VI: SYNTHESIS OF DIGITAL LOGIC CIRCUIT DESIGN


Introduction to Synthesis, Synthesis of combinational logic, Synthesis of sequential logic
with latches and flip-flops, Synthesis of Explicit and Implicit State Machines, Registers and
counters.

50
TESTING OF DIGITAL LOGIC CIRCUITS AND CAD TOOLS
Testing of logic circuits, fault model, complexity of a test set, path-sensitization, circuits with
tree structure, random tests , testing of sequential circuits, built in self test, printed circuit
boards, computer aided design tools, synthesis, physical design.

TEXT BOOKS:
1. Stephen Brown & Zvonko Vranesic, ”Fundamentals of Digital logic design with
VHDL”, Tata McGraw Hill,2nd edition.
2. Michael D. Ciletti, “Advanced digital design with the Verilog HDL”, Eastern
economy edition, PHI.
REFERENCES:
1. Ian Grout, “Digital systems design with FPGAs and CPLDs”, Elsevier Publications.
2. Stephen Brown & Zvonko Vranesic, ”Fundamentals of Digital logic with Verilog
design”, Tata McGraw Hill,2nd edition.
3. Bhaskar, ”VHDL Primer”,3rd Edition, PHI Publications.
***

51
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
IV Year B. Tech. Electronics and Computer Engineering – I Sem.
COMPUTER NETWORKS & OPERATING SYSTEMS LAB

Operating Systems Lab: Lab Experiments:


1. Simulate the following CPU scheduling algorithms
a) Round Robin b) SJF c) FCFS d) Priority
2. Loading executable programs into memory and execute System Call implementation-
read(), write(), open () and close()
3. . Multiprogramming-Memory management- Implementation of Fork(), Wait(), Exec() and
Exit() System calls
4. Simulate all File allocation strategies
a) Sequenced b) Indexed c) Linked
5. Simulate MVT and MFT
6. Simulate all File Organization Techniques
a) Single level directory b) Two level c) Hierarchical d) DAG
7. Simulate Bankers Algorithm for Dead Lock Avoidance
8. Simulate Bankers Algorithm for Dead Lock Prevention.
9. Simulate all page replacement algorithms.
a) FIFO b) LRU c) LFU etc….
10. Simulate Paging Technique of memory management.

Computer Networks Lab: Lab Experiments:


1. Implement the data link layer framing methods such as character stuffing and bit
stuffing.
2. Implement on a data set of characters the three CRC polynomials – CRC 12, CRC 16
and CRC CCIP.
3. Implement Dijkstra‘s algorithm to compute the Shortest path through a graph.
4. Take an example subnet graph with weights indicating delay between nodes. Now
obtain Routing table art each node using distance vector routing algorithm
5. Take an example subnet of hosts. Obtain broadcast tree for it.
6. Simulate Link State routing protocol using NS2.
7. Simulate Distance Vector routing protocol using NS2.
8. Simulate TCP and UDP packets using NS2.
9. Write a tcl script to create fixed wireless nodes.
10. Write a tcl script to generate graph taking more than two parameter files as input.

52
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
IV Year B. Tech. Electronics and Computer Engineering – I Sem.
UNIX Programming Lab
Objectives:
 To teach students various unix utilities and shell scripting
Programs:
1.
Session-1
a)Log into the system
b)Use vi editor to create a file called myfile.txt which contains some text.
c)correct typing errors during creation.
d)Save the file
e)logout of the system

Session-2
a)Log into the system
b)open the file created in session 1
c)Add some text
d)Change some text
e)Delete some text
f)Save the Changes
g)Logout of the system

2.
a)Log into the system
b)Use the cat command to create a file containing the following data. Call it mytable use tabs
to separate the fields.

1425 Ravi 15.65


4320 Ramu 26.27
6830 Sita 36.15
1450 Raju 21.86
c)Use the cat command to display the file, mytable.
d)Use the vi command to correct any errors in the file, mytable.
e)Use the sort command to sort the file mytable according to the first field. Call the sorted file
my table (same name)
f)Print the file mytable
g)Use the cut and paste commands to swap fields 2 and 3 of mytable. Call it my table (same
name)
h)Print the new file, mytable
i)Logout of the system.

3.
1) a)Login to the system
b)Use the appropriate command to determine your login shell
c)Use the /etc/passwd file to verify the result of step b.
53
d)Use the who command and redirect the result to a file called myfile1. Use the more
command to see the contents of myfile1.
e)Use the date and who commands in sequence (in one line) such that the output of
date will display on the screen and the output of who will be redirected to a file called
myfile2. Use the more command to check the contents of myfile2.
2) a)Write a sed command that deletes the first character in each line in a
file.
b)Write a sed command that deletes the character before the last character in each line
in a file.
c)Write a sed command that swaps the first and second words in each line in a file.

4. a)Pipe your /etc/passwd file to awk, and print out the home directory of each user.
b)Develop an interactive grep script that asks for a word and a file name and then tells how
many lines contain that word.
c)Repeat
d)Part using awk

5. a)Write a shell script that takes a command –line argument and reports on whether it is
directory, a file, or something else.
b)Write a shell script that accepts one or more file name as arguments and converts all of
them to uppercase, provided they exist in the current directory.
c)Write a shell script that determines the period for which a specified user is working on the
system.

6. a)Write a shell script that accepts a file name starting and ending line numbers as
arguments and displays all the lines between the given line numbers.
b)Write a shell script that deletes all lines containing a specified word in one or more files
supplied as arguments to it.

7. a)Write a shell script that computes the gross salary of a employee according to the
following rules:
i)If basic salary is < 1500 then HRA =10% of the basic and DA =90% of the basic.
ii)If basic salary is >=1500 then HRA =Rs500 and DA=98% of the basic
The basic salary is entered interactively through the key board.
b)Write a shell script that accepts two integers as its arguments and computers the value of
first number raised to the power of the second number.

8. a)Write an interactive file-handling shell program. Let it offer the user the choice of
copying, removing, renaming, or linking files. Once the user has made a choice, have the
program ask the user for the necessary information, such as the file name, new name and so
on.
b)Write shell script that takes a login name as command – line argument and reports when
that person logs in
c)Write a shell script which receives two file names as arguments. It should check whether
the two file contents are same or not. If they are same then second file should be deleted.

9. a)Write a shell script that displays a list of all the files in the current directory to which the
user has read, write and execute permissions.
b)Develop an interactive script that ask for a word and a file name and then tells how many
times that word occurred in the file.
c)Write a shell script to perform the following string operations:
i)To extract a sub-string from a given string.
ii)To find the length of a given string.

54
10 .Write a C program that takes one or more file or directory names as command line input
and reports the following information on the file:
i)File type ii)Number of links iii)Read, write and execute permissions
iv)Time of last access
(Note : Use stat/fstat system calls)

11. Write C programs that simulate the following unix commands:


a)mv b)cp (Use system calls)

12. Write a C program that simulates ls Command


(Use system calls / directory API)

13. Do the following Shell programs also


1) Write a shell script to check whether a particular user has logged in or not. If he has logged
in, also check whether he has eligibility to receive a message or not

2) Write a shell script to accept the name of the file from standard input and perform the
following tests on it

a) File executable b) File readable c) File writable d) Both readable & writable
3) Write a shell script which will display the username and terminal name who login recently
in to the unix system.

4) Write a shell script to find no. of files in a directory

5) Write a shell script to check whether a given number is perfect or not

6) Write a menu driven shell script to copy, edit, rename and delete a file

7) Write a shell script for concatenation of two strings

3) Write a shell script which will display Fibonacci series up to a given number of argument
9) Write a shell script to accept student number, name, marks in 5 subjects. Find total,
average and grade. Display the result of student and store in a file called stu.dat
Rules: avg>=80 then grade A
Avg<80&&Avg>=70 then grade B
Avg<70&&Avg>=60 then grade C
Avg<60&&Avg>=50 then grade D
Avg<50&&Avg>=40 then grade E
Else grade F
10) Write a shell script to accept empno,empname,basic. Find DA,HRA,TA,PF using
following rules. Display empno, empname, basic, DA,HRA,PF,TA,GROSS SAL and
NETSAL. Also store all details in a file called emp.dat

Rules: HRA is 18% of basic if basic > 5000 otherwise 550


DA is 35% of basic
PF is 13% of basic
IT is 14% of basic
TA is 10% of basic
11) Write a shell script to demonstrate break and continue statements

55
12) Write a shell script to satisfy the following menu options

a. Display current directory path b. Display todays date


c. Display users who are connected to the unix system d. Quit

13) Write a shell script to delete all files whose size is zero bytes from current directory

14) Write a shell script to display string palindrome from given arguments

15) Write a shell script which will display Armstrong numbers from given arguments

16) Write a shell script to display reverse numbers from given argument list

17) Write a shell script to display factorial value from given argument list

18) Write a shell script which will find maximum file size in the given argument list

19) Write a shell script which will greet you “Good Morning”, ”Good Afternoon”, “Good
Evening’ and “Good Night” according to current time

20) Write a shell script to sort the elements in a array using bubble sort technique

56
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
IV Year B. Tech. Electronics and Computer Engineering – II Sem.
EMBEDDED SYSTEMS
(ELECTIVE – III)

OBJECTIVES
After going through this course the student will be able to
 Understand the building blocks of typical embedded system and different memory
technology and memory types.
 Learn the characteristics of an embedded system, quality attributes of embedded
systems, application specific and domain specific embedded system,
 Learn about communication devices and basics about VLSI and integrated circuit
design and learn concept of firmware design approaches, ISR concept. Interrupt
sources, interrupt servicing mechanism, multiple interrupts,
 Understand the concepts of c versus embedded c and compiler versus cross-compiler.
 Learn about the integrated development environment, software utility tool. Also learn
about quality assurance and testing of the design, testing on host machine, simulators.
Unit-I:
Introduction: Embedded System-Definition, History, Classification, application areas and
purpose of embedded systems, The typical embedded system-Core of the embedded system,
Memory, Sensors and Actuators, Communication Interface, Embedded firmware, PCB and
passive components. Characteristics, Quality attributes of an Embedded systems,
Application-specific and Domain-Specific examples of an embedded system.

Unit-II:
Embedded Hardware Design: Analog and digital electronic components, I/O types and
examples, Serial communication devices, Parallel device ports, Wireless devices, Timer and
counting devices, Watchdog timer, Real time clock.

Unit-III:
Embedded Firmware Design: Embedded Firmware design approaches, Embedded
Firmware development languages, ISR concept, Interrupt sources, Interrupt servicing
mechanism, Multiple interrupts, DMA, Device driver programming, Concepts of C versus
Embedded C and Compiler versus Cross-compiler.

Unit-IV:
Real Time Operating System: Operating system basics, Types of operating systems, Tasks,
Process and Threads, Multiprocessing and Multitasking, Threads, Processes and Scheduling,
Task Scheduling, Communication, Synchronization, Device Drivers, How to choose an
RTOS.
57
Hardware Software Co-Design: Fundamental Issues in Hardware Software Co-Design,
Computational models in embedded design, Hardware software Trade-offs, Integration of
Hardware and Firmware, ICE.

Unit-V:
Embedded System Development: The integrated development environment, Types of files
generated on cross-compilation, Deassembler/Decompiler, Simulators, Emulators and
Debugging, Target hardware debugging, Boundary Scan, Embedded Software development
process and tools.

Unit-VI:
Embedded System Implementation And Testing: The main software utility tool, CAD and
the hardware, Translation tools-Pre-processors, Interpreters, Compilers and Linkers,
Debugging tools, Quality assurance and testing of the design, Testing on host machine,
Simulators, Laboratory Tools.

Text Books:

1. Embedded Systems Architecture By Tammy Noergaard, Elsevier Publications, 2005


2. Embedded System Design, Frank Vahid, Tony Givargis, John Wiley Publications.

References:

1. Embedded Systems, Raj Kamal-Tata McGraw Hill Education Private Limited,


Second Edition, 2008
2. Embedding system building blocks By Labrosse, CMP publishers.

OUTCOMES
After going through this course the student will be able to
 Know basics of embedded system, classification, memories, different communication
interface and what embedded firmware is and its role in embedded system, different
system components.
 Distinguish all communication devices in embedded system, other peripheral device.
 Distinguish concepts of C versus embedded C and compiler versus cross-compiler.
 Choose an operating system, and learn how to choose an RTOS

*******

58
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
IV Year B. Tech. Electronics and Computer Engineering – II Sem.
AUTOMATA THEORY & COMPILER DESIGN

UNIT I:
Formal Language and Regular Expressions:
Languages, operations on languages, regular expressions (re), languages associated with (re),
operations on (re), Identity rules for (re), Finite Automata: DFA, NFA, Conversion of regular
expression to NFA, NFA to DFA. Applications of Finite Automata to lexical analysis, lex
tools.

UNIT II:
Context Free grammars and parsing:
Context free Grammars, Leftmost Derivations, Rightmost Derivations, Parse Trees,
Ambiguity Grammars,
Top-Down Parsing, Recursive Descent Parsers: LL(K) Parsers and LL(1) Parsers.

UNIT III:
Bottom up parsing:
Rightmost Parsers: Shift Reduce Parser, Handles, Handle pruning, Creating LR (0) Parser,
SLR (1) Parser, LR (1) & LALR (1) Parsers, Parser Hierarchy, Ambiguous Grammars, Yacc
Programming Specifications.

UNIT IV:
Syntax Directed Translation:
Definitions, construction of Syntax Trees, S-attributed and L-attributed grammars,
Intermediate code generation, abstract syntax tree, translation of simple statements and
control flow statements.
Semantic Analysis:
Semantic Errors, Chomsky hierarchy of languages and recognizers, Type checking, type
conversions, equivalence of type expressions, Polymorphic functions, overloading of
functions and operators.

UNIT V:
Storage Organization:
Storage language Issues, Storage Allocation, Storage Allocation Strategies, Scope, Access to
Nonlocal Names, Parameter Passing, Dynamics Storage Allocation Techniques.

UNIT VI:
Code Optimization:
Issues in the design of code optimization, Principal sources of optimization, optimization of
basic blocks, Loop optimization, peephole optimization, flow graphs, Data flow analysis of
flow graphs.
Code Generation:

59
Issues in the design of code Generation, Machine Dependent Code Generation, object code
forms, generic code generation algorithm, Register allocation and assignment, DAG
representation of basic Blocks, Generating code from DAGs.

TEXT BOOKS:

1. Introduction to Automata Theory Languages & Computation, 3/e, Hopcroft, Ullman,


PEA
2. Compilers Principles, Techniques and Tools, Aho, Ullman, Ravi Sethi, PEA

REFERENCE BOOKS:

1. Principles of Compiler Design, A.V. Aho. J.D.Ullman; PEA


2. Theory of Computer Science, Automata languages and computation , 2/e, Mishra,
Chandra Shekaran, PHI
3. Elements of Compiler Design, A.Meduna, Auerbach Publications, Taylor and Francis
Group.

60
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
IV Year B. Tech. Electronics and Computer Engineering – II Sem.
HIGH PERFORMANCE COMPUTING

Course Objectives:
This course covers the design of advanced modern computing systems. In particular, the
design of modern microprocessors, characteristics of the memory hierarchy, and issues
involved in multi-threading and multi-processing are discussed. The main objective of this
course is to provide students with an understanding and appreciation of the fundamental
issues and tradeoffs involved in the design and evaluation of modern computers

Course Outcomes:

1. Understand the concepts and terminology of high performance computing.


2. Can write and analyze the behavior of high performance parallel programs for
distributed memory architectures (using MPI).
3. Can write and analyze the behavior of high performance parallel programs for shared
memory architectures (using Pthreads and OpenMP).
4. Can write simple programs for the GPU.
5. Can independently study, learn about, and present some aspect of high performance
computing.

Syllabus:

UNIT I:
Introduction to Parallel hardware and software, need for high performance systems and
Parallel Programming, SISD, SIMD, MISD, MIMD models, Performance issues.

UNIT II:
Processors, PThreads, Thread Creation, Passing arguments to Thread function, Simple matrix
multiplication using Pthreads, critical sections, mutexes, semaphores, barriers and conditional
variables, locks, thread safety, simple programming assignments.

UNIT III:
OpenMP Programming: introduction, reduction clause, parallel for-loop scheduling, atomic
directive, critical sections and locks, private directive, Programming assignments, n body
solvers using openMP.

UNIT IV:
Introduction to MPI programming: MPI primitives such as MPI_Send, MPI-Recv, MPI_Init,
MPI-Finalize, etc., Application of MPI to Trepizoidal rule, Collective Communication
primitives in MPI, MPI derived datatypes, Performance evaluation of MPI programs, Parallel
sorting algorithms, Tree search solved using MPI, Programming Assignments.

61
UNIT V:
Introduction to GPU computing, Graphics pipelines, GPGPU, Data Parallelism and CUDA C
Programming, CUDA Threads Organization, Simple Matrix multiplication using CUDA,
CUDA memories.

UNIT VI:
Bench Marking and Tools for High Performance Computing Environments, Numerical
Linear Algebra Routines BLAS for Parallel Systems evaluation.

Text Books:
1. An Introduction to Parallel Programming, Peter S Pacheco, Elsevier, 2011
2. Programming Massively Parallel Processors, Kirk & Hwu, Elsevier, 2012

Reference Books:
1. CUDA by example: An introduction to General Purpose GPU Programming, Jason,
Sanders, Edward Kandrit, Perason, 2011
2. CUDA Programming, Shame Cook, Elsevier
3. High Performance Heterogeneous Computing, Jack Dongarra, Alexey & Lastovetsky
, Wiley
4. Parallel computing theory and practice, Michel J.Quinn, TMH

62
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
IV Year B. Tech. Electronics and Computer Engineering – II Sem.
EMI / EMC
( Elective I II)

Objectives:

 Student shall be able to understand the root causes for Electromagnetic Noise (EMI), its
sources.

 Shall be able to understand the effects of EMI and the required precautions to be taken/to
be discussed with his peer group.

 Shall be able to understand the different measurement techniques of EMI (for conducted
and normal) and their influences in detail.

 Shall be able to understand different compatibility techniques (EMC) to reduce/suppress


EMI.

 Shall be able to understand different standards being followed across the world in the
fields of EMI/EMC.

UNIT-I:Natural and Nuclear sources of EMI / EMC : Introduction, Electromagnetic


environment, History, Concepts, Practical experiences and concerns, frequency spectrum
conservations. An overview of EMI / EMC, Natural and Nuclear sources of EMI.
UNIT-II:EMI from apparatus, circuits and open area test sites : Electromagnetic
emissions, noise from relays and switches, non-linearities in circuits, passive inter
modulation, cross talk in transmission lines, transients in power supply lines, electromagnetic
interference (EMI). Open area test sites and measurements.
UNIT-III: Radiated and conducted interference measurements: Anechoic chamber,
TEM cell, GH TEM Cell, characterization of conduction currents / voltages, conducted EM
noise on power lines, conducted EMI from equipment, Immunity to conducted EMI detectors
and measurements.
UNIT-IV:ESD, Grounding, shielding, bonding and EMI filters : Principles and types of
grounding, shielding and bonding, characterization of filters, power lines filter design. ESD,
Electrical fast transients / bursts, electrical surges.
UNIT-V:Cables, connectors, components: Introduction, EMI suppression cables, EMC
connectors, EMC gaskets, Isolation transformers, opto-isolators, Transient and Surge
Suppression Devices.
UNIT-VI: EMC standards- National / International .: Introduction, Standards for EMI
and EMC, MIL-Standards, IEEE/ANSI standards, CISPR/IEC standards, FCC regulations,
Euro norms, British Standards, EMI/EMC standards in JAPAN, Conclusions.

63
Text Books :

1. Engineering Electromagnetic Compatibility by Dr. V.P. Kodali, IEEE Publication,


Printed in India by S. Chand & Co. Ltd., New Delhi, 2000.

2. Electromagnetic Interference and Compatibility IMPACT series, IIT – Delhi,

Modules 1 – 9.

References :

1. Introduction to Electromagnetic Compatibility, NY, John Wiley, 1992, by C.R.


Pal.

Outcomes-

At the end of this Course,

o Students shall be able to distinguish effects of EMI and counter measures by


EMC-techniques.

o Students shall apply the knowledge gained in selecting proper


gadget/device/appliance/system, as per EMC- norms specified by regulating
authorities.

o Students shall choose career in the fields of EMI/EMC as an


Engineer/Researcher/Entrepreneur in India/abroad.

64
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
IV Year B. Tech. Electronics and Computer Engineering – II Sem.
Data Ware housing and Mining
( Elective III )

Course Objectives:
Students will be enabled to understand and implement classical models and algorithms in
data warehousing and data mining. They will learn how to analyze the data, identify the
problems, and choose the relevant models and algorithms to apply. They will further be able
to assess the strengths and weaknesses of various methods and algorithms and to analyze
their behavior.

Course Outcomes:
a) understand why there is a need for data warehouse in addition to traditional
operational database systems;
b) identify components in typical data warehouse architectures;
c) design a data warehouse and understand the process required to construct
one;
d) understand why there is a need for data mining and in what ways it is
different from traditional statistical techniques;
e) understand the details of different algorithms made available by popular
commercial data mining software;
f) solve real data mining problems by using the right tools to find interesting
patterns

Syllabus:

UNIT –I:
Introduction : What Motivated Data Mining? Why Is It Important, Data Mining—On What
Kind of Data, Data Mining Functionalities—What Kinds of Patterns Can Be Mined? Are All
of the Patterns Interesting? Classification of Data Mining Systems, Data Mining Task
Primitives, Integration of a Data Mining System with a Database or Data Warehouse System,
Major Issues in Data Mining. (Han & Kamber)

UNIT –II:
Data Pre-processing : Why Pre-process the Data? Descriptive Data Summarization, Data
Cleaning, Data Integration and Transformation, Data Reduction, Data Discretization and
Concept Hierarchy Generation. (Han & Kamber)

UNIT –III:
Data Warehouse and OLAP Technology: An Overview : What Is a Data Warehouse? A
Multidimensional Data Model, Data Warehouse Architecture, Data
Warehouse Implementation, From Data Warehousing to Data Mining. (Han & Kamber)

65
UNIT –IV:
Classification : Basic Concepts, General Approach to solving a classification problem,
Decision Tree Induction: Working of Decision Tree, building a decision tree, methods for
expressing an attribute test conditions, measures for selecting the best split, Algorithm for
decision tree induction.
Model Over fitting: Due to presence of noise, due to lack of representation samples,
evaluating the performance of classifier: holdout method, random sub sampling, cross-
validation, bootstrap. (Tan & Vipin)

UNIT –V
Association Analysis: Basic Concepts and Algorithms : Introduction, Frequent Item Set
generation, Rule generation, compact representation of frequent item sets, FP-Growth
Algorithm. (Tan & Vipin)

UNIT –VI
Cluster Analysis: Basic Concepts and Algorithms : What Is Cluster Analysis? Different
Types of Clustering, Different Types of Clusters, K-means, The Basic K-means Algorithm,
K-means: Additional Issues, Bisecting K-means, K-means and Different Types of Clusters,
Strengths and Weaknesses, K-means as an Optimization Problem, Agglomerative
Hierarchical Clustering, Basic Agglomerative Hierarchical Clustering Algorithm, Specific
Techniques, DBSCAN, Traditional Density: Center-Based Approach, The DBSCAN
Algorithm, Strengths and Weaknesses. (Tan & Vipin)

Text Books :
1. Introduction to Data Mining : Pang-Ning Tan & Michael Steinbach, Vipin Kumar,
Pearson.
2. Data Mining concepts and Techniques, 3/e, Jiawei Han, Michel Kamber, Elsevier.

Reference Books :
1. Data Mining Techniques and Applications: An Introduction, Hongbo Du, Cengage
Learning.
2. Data Mining : Introductory and Advanced topics : Dunham, Pearson.
3. Data Warehousing Data Mining & OLAP, Alex Berson, Stephen Smith, TMH.
4. Data Mining Techniques, Arun K Pujari, Universities Press.

66
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
IV Year B. Tech. Electronics and Computer Engineering – II Sem.
WIRELESS SENSOR NETWORKS
(ELECTIVE - IV)

UNIT I
OVERVIEW OF WIRELESS SENSOR NETWORKS:
Key definitions of sensor networks, Advantages of sensor Networks, Unique constraints an
challenges, Driving Applications, Enabling Technologies for Wireless Sensor Networks.
ARCHITECTURES:
Single-Node Architecture - Hardware Components, Energy Consumption of Sensor Nodes,
Operating Systems and Execution Environments, Network Architecture -Sensor Network
Scenarios, Optimization Goals and Figures of Merit, Gateway Concepts.

UNIT II
NETWORKING Technologies:
Physical Layer and Transceiver Design Considerations, Personal area networks (PANs),
hidden node and exposed node problem, Topologies of PANs, MANETs, WANETs.

UNIT-III
MAC Protocols for Wireless Sensor Networks:
Issues in Designing a MAC protocol for Ad Hoc Wireless Networks, Design goals of a MAC
Protocol for Ad Hoc Wireless Networks, Classifications of MAC Protocols, Contention -
Based Protocols, Contention - Based Protocols with reservation Mechanisms, Contention –
Based MAC Protocols with Scheduling Mechanisms, MAC Protocols that use Directional
Antennas, Other MAC Protocols.

UNIT-IV
ROUTING PROTOCOLS:
Introduction, Issues in Designing a Routing Protocol for Ad Hoc Wireless Networks,
Classification of Routing Protocols, Table –Driven Routing Protocols, On – Demand Routing
Protocols, Hybrid Routing Protocols, Routing Protocols with Efficient Flooding Mechanisms,
Hierarchical Routing Protocols, Power – Aware Routing Protocols, Proactive Routing

UNIT-V
TRANSPORT LAYER AND SECURITY PROTOCOLS:
Introduction, Issues in Designing a Transport Layer Protocol for Ad Hoc Wireless Networks,
Design Goals of a Transport Layer Protocol for Ad Hoc Wireless Networks, Classification of
Transport Layer Solutions, TCP Over Ad Hoc Wireless Networks, Other Transport Layer
Protocol for Ad Hoc Wireless Networks,

UNIT- VI
SECURITY IN WSNs:

67
Security in Ad Hoc Wireless Networks, Network Security Requirements, Issues and
Challenges in Security Provisioning, Network Security Attacks, Key Management, Secure
Routing in Ad Hoc Wireless Networks.
SENSOR NETWORK PLATFORMS AND TOOLS:
Sensor Node Hardware – Berkeley Motes, Programming Challenges, Node-level software
platforms, Node-level Simulators, State-centric programming.
APPLICATIONS of WSN:
S Ultra wide band radio communication, Wireless fidelity systems. Future directions, Home
automation, smart metering Applications

TEXT BOOKS:
1. Ad Hoc Wireless Networks: Architectures and Protocols - C. Siva Ram Murthy and
B.S.Manoj, 2004, PHI
2. Wireless Ad- hoc and Sensor Networks: Protocols, Performance and Control –
Jagannathan Sarangapani, CRC Press
3. Holger Karl & Andreas Willig, “Protocols And Architectures for Wireless Sensor
Networks", John Wiley, 2005.

REFERENCES:
1. . Kazem Sohraby, Daniel Minoli, & Taieb Znati, “Wireless Sensor Networks-
Technology, Protocols, and Applications”, John Wiley, 2007.
2. Feng Zhao & Leonidas J. Guibas, “Wireless Sensor Networks- An Information
Processing Approach", Elsevier, 2007.
3. Ad- Hoc Mobile Wireless Networks: Protocols & Systems, C.K. Toh ,1 ed. Pearson
Education.
4. Wireless Sensor Networks - C. S. Raghavendra, Krishna M. Sivalingam, 2004,
Springer
5. Wireless Sensor Networks – S Anandamurugan , Lakshmi Publications
***

68
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
IV Year B. Tech. Electronics and Computer Engineering – II Sem.
REAL TIME OPERATING SYSTEMS
(Elective-IV)

UNIT-I: INTRODUCTION TO REAL-TIME OPERATING SYSTEM


OS Services, Process Management, Timer Functions, Event Functions, Memory
Management, Device, File and IO Systems Management, Interrupt Routines in RTOS
Environment and Handling of Interrupt Source Calls, Real-Time Operating Systems, Basic
Design Using an RTOS, RTOS Task Scheduling Models, Interrupt Latency and Response of
the Tasks as Performance Metrics, OS Security Issues.

UNIT-II: REAL-TIME OPERATING SYSTEM PROGRAMMING


Basic Functions and Types of RTOS for Embedded Systems, RTOS mCOS-II, RTOS Vx
Works, Programming concepts of above RTOS with relevant Examples.

Programming concepts of RTOS Windows CE, RTOS OSEK, RTOS Linux 2.6.x and RTOS
RT Linux.

UNIT-III: DESIGN EXAMPLES AND CASE STUDIES OF PROGRAM MODELING


WITH RTOS-I
Case study of embedded system design and coding for an Automatic Chocolate Vending
Machine (ACVM) Using Mucos RTOS, case study of digital camera hardware and software
architecture, case study of coding for sending application layer byte streams on a TCP/IP
Network Using RTOS Vx Works.

UNIT-IV: DESIGN EXAMPLES AND CASE STUDIES OF PROGRAM MODELING


WITH RTOS-II
Case Study of Communication, Orchestra, Robots, Embedded System in Automobile, Case
Study of Embedded System for an Adaptive Cruise Control (ACC) System in Car, Case
Study of Embedded System for a Smart Card, Case Study of Embedded System of Mobile
Phone Software for Key Inputs.

UNIT-V: TARGET IMAGE CREATION


Off-The-Shelf Operating Systems, Operating System Software, Target Image Creation for
Window XP Embedded, Porting RTOS on a Micro Controller based Development Board.

UNIT-VI: PROGRAMMING IN LINUX


Overview and programming concepts of Unix/Linux Programming, Shell Programming,
System Programming.

PROGRAMMING IN RTLINUX
Overview of RT Linux, Core RT Linux API, Program to display a message periodically,
semaphore management, Mutex, Management, Case Study of Appliance Control by RT
Linux System.

69
TEXT BOOKS:
1. Dr. K.V.K.K. Prasad: “Embedded/Real-Time Systems” Dream Tech Publications,
Black pad book.
2. Rajkamal: “Embedded Systems-Architecture, Programming and Design”, Tata
McGraw Hill Publications, Second Edition, 2008.
REFERENCES:
1. Labrosse, “Embedding system building blocks “, CMP publishers.
1. Rob Williams,” Real time Systems Development”, Butterworth Heinemann
Publications.

***

70
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
IV Year B. Tech. Electronics and Computer Engineering – II Sem.
NETWORK SECURITY & CRYPTOGRAPHY
(Elective-IV)

Course objectives:
The main objective of this course is to teach students to understand and how to address
various software security problems in a secure and controlled environment. During this
course the students will gain knowledge (both theoretical and practical) in various kinds of
software security problems, and techniques that could be used to protect the software from
security threats. The students will also learn to understand the “modus operandi” of
adversaries; which could be used for increasing software dependability.
Course outcomes:
1. be able to individually reason about software security problems and protection
techniques on both an abstract and a more technically advanced level.
2. be able to individually explain how software exploitation techniques, used by
adversaries, function and how to protect against them.

Syllabus:

UNIT I : Classical Encryption Techniques


Objectives: The Objectives of this unit is to present an overview of the main concepts of
cryptography, understand the threats & attacks, understand ethical hacking.

Introduction: Security attacks, services & mechanisms, Symmetric Cipher Model,


Substitution Techniques, Transportation Techniques, Cyber threats and their defense( Phishing
Defensive measures, web based attacks, SQL injection & Defense techniques)(TEXT BOOK 2),
Buffer overflow & format string vulnerabilities, TCP session hijacking(ARP attacks, route
table modification) UDP hijacking ( man-in-the-middle attacks)(TEXT BOOK 3).

UNIT II: Block Ciphers & Symmetric Key Cryptography


Objectives: The Objectives of this unit is to understand the difference between stream
ciphers & block ciphers, present an overview of the Feistel Cipher and explain the
encryption and decryption, present an overview of DES, Triple DES, Blowfish, IDEA.

Traditional Block Cipher Structure, DES, Block Cipher Design Principles, AES-Structure,
Transformation functions, Key Expansion, Blowfish, CAST-128, IDEA, Block Cipher
Modes of Operations

UNIT III: Number Theory & Asymmetric Key Cryptography


Objectives: Presents the basic principles of public key cryptography, Distinct uses of public
key cryptosystems

71
Number Theory: Prime and Relatively Prime Numbers, Modular Arithmetic, Fermat’s and
Euler’s Theorems, The Chinese Remainder theorem, Discrete logarithms.

Public Key Cryptography: Principles, p u b l i c k e y c r y p t o g r a p h y a l g o r i t h m s ,


RSA Algorithms, Diffie Hellman Key Exchange, Elgamal encryption & decryption,
Elliptic Curve Cryptography.

UNIT IV : Cryptographic Hash Functions & Digital Signatures


Objectives: Present overview of the basic structure of cryptographic functions, Message
Authentication Codes, Understand the operation of SHA-512, HMAC, Digital Signature

Application of Cryptographic hash Functions, Requirements & Security, Secure Hash


Algorithm, Message Authentication Functions, Requirements & Security, HMAC &
CMAC. Digital Signatures, NIST Digital Signature Algorithm. Key management &
distribution.

UNIT V: User Authentication, Transport Layer Security & Email Security


Objectives: Present an overview of techniques for remote user authentication, Kerberos,
Summarize Web Security threats and Web traffic security approaches, overview of SSL &
TLS. Present an overview of electronic mail security.

User Authentication: Remote user authentication principles, Kerberos


Transport Level Security: Web Security Requirements, Secure Socket Layer (SSL) and
Transport Layer Security (TLS), Secure Shell(SSH)
Electronic Mail Security: Pretty Good Privacy (PGP) and S/MIME.

UNIT VI: IP Security & Intrusion Detection Systems


Objectives: Provide an overview of IP Security, concept of security association, Intrusion
Detection Techniques

IP Security: IP Security Overview, IP Security Architecture, Authentication Header,


Encapsulating Security Payload, Combining Security Associations and Key Management.
Intrusion detection: Overview, Approaches for IDS/IPS, Signature based IDS, Host based
IDS/IPS. (TEXT BOOK 2)

TEXT BOOKS:
1. Cryptography & Network Security: Principles and Practices, William Stallings, PEA,
Sixth edition.
2. Introduction to Computer Networks & Cyber Security, Chwan Hwa Wu, J.David
Irwin, CRC press
3. Hack Proofing your Network, Russell, Kaminsky, Forest Puppy, Wiley Dreamtech.

REFERENCE BOOKS:
1.Everyday Cryptography, Fundamental Principles & Applications, Keith Martin,
Oxford
2. Network Security & Cryptography, Bernard Menezes, Cengage,2010

72
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
III Year B. Tech. Electronics and Computer Engineering – II Sem.
COMPUTER ARCHITECTURE AND ORGANIZATION
( Open Elective )
Not for ECM

Objectives
The student will

 Understand the fundamentals of different instruction set architectures and their


relationship to the CPU design.
 Understand the principles and the implementation of computer arithmetic and ALU.
 Understand the memory system, I/O organization
 Understand the operation of modern CPUs including interfacing, pipelining, memory
systems and busses.
 Understand the principles of operation of multiprocessor systems

UNIT-I
BASIC STRUCTURE OF COMPUTERS: Computer Types, Functional units, Basic
operational concepts, Bus structures, Software, Performance, multiprocessors and multi
computers. Data types, Complements, Data Representation. Fixed Point Representation.
Floating – Point Representation. Error Detection codes.
COMPUTER ARITHMETIC: Addition and subtraction, multiplication Algorithms,
Division Algorithms, Floating point Arithmetic operations. Decimal Arithmetic unit, Decimal
Arithmetic operations.

UNIT-II
REGISTER TRANSFER LANGUAGE AND MICRO-OPERATIONS: Register Transfer
language. Register Transfer, Bus and memory transfer, Arithmetic Micro-operations, logic
micro operations, shift micro-operations, Arithmetic logic shift unit. Instruction codes.
Computer Registers Computer instructions –Instruction cycle. Memory Reference
Instructions. Input Onput and Interrupt. CENTRAL PROCESSING UNIT - Stack
organization. Instruction formats. Addressing modes. DATA Transfer and manipulation.
Program control. Reduced Instruction set computer

UNIT-III
MICRO PROGRAMMED CONTROL: Control memory, Address sequencing, micro
program example, Design of control unit-Hard wired control. Micro programmed control

UNIT-IV
THE MEMORY SYSTEM: Memory Hierarchy, Main memory, Auxiliary memory,
Associative memory, Cache memory, Virtual memory, Memory management hardware

UNIT-V
INPUT-OUTPUT ORGANIZATION : Peripheral Devices, Input-Output Interface,
Asynchronous data transfer Modes of Transfer, Priority Interrupt, Direct memory Access,
Input –Output Processor (IOP), Serial communication;
73
UNIT-VI
PIPELINE AND VECTOR PROCESSING: Parallel Processing, Pipelining, Arithmetic
Pipeline, Instruction Pipeline, RISC Pipeline Vector Processing, Array Processors. Multi
processors: Characteristics of Multiprocessors, Interconnection Structures, Interprocessor
Arbitration. Interprocessor Communication and Synchronization, Cache Coherence.

TEXT BOOKS:
1. Computer System Architecture – M.Moris Mano, IIIrd Edition, PHI / Pearson, 2006.
2. Computer Organization – Car Hamacher, ZvonksVranesic, SafwatZaky, V Edition,
McGraw Hill, 2002.
REFERENCE:
1. Computer Organization and Architecture – William Stallings Seventh Edition,
PHI/Pearson, 2006.
2. Computer Architecture and Organization – John P. Hayes, Mc Graw Hill International
editions, 1998.

Objectives

 Understand the fundamentals of different instruction set architectures and their


relationship to the CPU design.
 Understand the principles and the implementation of computer arithmetic and ALU.
 Understand the memory system, I/O organization
 Understand the operation of modern CPUs including interfacing, pipelining, memory
systems and busses.
 Understand the principles of operation of multiprocessor systems.
 Demonstrate the relationship between the software and the hardware and focuses on
the foundational concepts that are the basis for current computer design.

74
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
III Year B. Tech. Electronics and Computer Engineering – II Sem.
OBJECT ORIENTED PROGRAMMING & OPERATING SYSTEM
( Open Elective )
Not for ECM

Course Objectives:

By the end of the course student will


 Describe the general architecture of computers
 Describe object oriented concepts
 Describe, contrast and compare differing structures for operating Systems
 Understand and analyze theory and implementation of: processes, resource
control (concurrency etc.), physical and virtual memory, scheduling, I/O
and files

UNIT-I:
Introduction to OOP
Introduction, Need of Object Oriented Programming, Principles of Object Oriented
Languages, Procedural languages Vs OOP, Applications of OOP

UNIT-II:
Computer System and Operating System Overview: Overview of computer operating
systems, operating systems functions, protection and security, distributed systems, special
purpose systems, operating systems structures and systems calls, operating systems
generation.

UNIT-III:
Process Management – Process concept- process scheduling, operations, Inter process
communication. Multi Thread programming models. Process scheduling criteria and
algorithms, and their evaluation.

UNIT-IV:
Memory Management: Swapping, contiguous memory allocation, paging, structure of the
page table, segmentation

UNIT-V:
Virtual Memory Management:
virtual memory, demand paging, page-Replacement, algorithms, Allocation of Frames,
Thrashing

UNIT-VI:
File system Interface- the concept of a file, Access Methods, Directory structure, File
system mounting, file sharing, protection.

75
TEXT BOOKS:
1. The Complete Reference Java, 8ed, Herbert Schildt, TMH
2. Operating System Concepts- Abraham Silberchatz, Peter B. Galvin, Greg Gagne 7th
Edition, John Wiley.
3. Operating Systems’ – Internal and Design Principles Stallings, Sixth Edition–2005,
Pearson education

REFERENCE BOOKS:
1.http://nptel.iitm.ac.in/courses/Webcourse-contents/IISc-BANG/
Operating%20Systems/New_index1.html
2. Operating systems- A Concept based Approach-D.M.Dhamdhere, 2nd Edition, TMH
3. Operating System A Design Approach-Crowley, TMH.
4. Modern Operating Systems, Andrew S Tanenbaum 3rd edition PHI.

Course Outcomes:
By the end of the course student will be able to
 describe the general architecture of computers
 describe object oriented concepts
 describe, contrast and compare differing structures for operating Systems
 understand and analyze theory and implementation of: processes, resource
control (concurrency etc.), physical and virtual memory, scheduling, I/O
and files

76

You might also like