by Rishi | Jun 4, 2019 | Jntuk lecture notes
Digital I C Applications
OBJECTIVES
The main objectives of this course are:
• Introduction of digital logic families and interfacing ideas for digital style is taken into account. • VHDL fundamentals were mentioned to modeling the digital system style blocks. • VHDL compilers, simulators and synthesis tools ar delineated , that ar accustomed verify digital systems during a technology-independent fashion. • style and implementation of combinatory and successive digital logic circuits is explained.
Outcomes:
At the tip of this course the coed will ready to:
• perceive the structure of commercially on the market digital computer circuit families.
• Learn the IEEE commonplace 1076 Hardware Description Language (VHDL).
• Model advanced digital systems at many levels of abstractions, behavioral, structural, simulation, synthesis and speedy system prototyping.
• Analyze and style basic digital circuits with combinatorial and successive logic circuits exploitation VHDL.
Syllabus:
UNIT-I
Digital Logic Families and Interfacing: Introduction to logic families, CMOS logic, CMOS steady state and dynamic electrical behavior, CMOS logic families. Bipolar logic, transistor-transistor logic, TTL families, CMOS/TTL interfacing, low voltage CMOS logic and interfacing, electrode coupled logic. (Text book-1)
UNIT-II
Introduction to VHDL: style flow, program structure, levels of abstraction, components of VHDL: information sorts, information objects, operators and identifiers. Packages, Libraries and Bindings, Subprograms. VHDL Programming exploitation structural and information flow modeling. (Text book-2)
UNIT-III
activity Modeling: method statement, variable assignment statement, signal assignment statement, wait statement , if statement, case statement ,null statement, loop statement, exit statement, next statement ,assertion statement, a lot of on signal assignment statement ,Inertial Delay Model, Transport Delay Model ,Creating Signal Waveforms, Signal Drivers , alternative successive Statements , Multiple Processes. Logic Synthesis, within a logic Synthesizer. (Text book-2)
III Year – I Semester
L T P C
4 0 0 3
DIGITAL IC APPLICATIONS
UNIT-IV
combinatory Logic Design: Binary Adder-Subtractor, Ripple Adder, Look Ahead Carry Generator, ALU, Decoders, encoders, multiplexers and demultiplexers, parity circuits, comparators, Barrel Shifter, straightforward FloatingPoint Encoder, twin Priority Encoder, style concerns of the higher than combinatory logic circuits with relevant Digital ICs, modeling of higher than ICs exploitation VHDL. (Text book-1)
UNIT-V
successive Logic Design: SSI Latches and flip flops, Ring Counter, Johnson Counter, style of Modulus N Synchronous Counters, Shift Registers, Universal Shift Registers, style concerns of the higher than successive logic circuits with relevant Digital ICs, modeling of higher than ICs exploitation VHDL. (Text book-1)
UNIT-VI:
Synchronous and Asynchronous successive Circuits: Basic style steps: State diagram, state table, state assignment, alternative of flip flops and derivation of next state and output expressions, temporal order diagram. State assignment problem: One hot secret writing. gritty and Moore sort FSM for serial adder, VHDL code for the serial adder. Analysis of Asynchronous circuits, State Reduction, State Assignment. an entire style example: The slot machine controller. (Reference text book- 1)
Text Books:
- Digital style Principles & Practices – John F. Wakerly, PHI/ Pearson Education Asia, 3rd Ed., 2005.
- VHDL Primer – J. Bhasker, Pearson Education/ letter of the alphabet, third Edition.
References:
- Fundamentals of Digital Logic with VHDL Design- author Brown, ZvonkoVranesic, McGrawHill, third Edition.
by Rishi | Jun 4, 2019 | Jntuk lecture notes
DIGITAL CONTROL SYSTEMS
Preamble:
In recent times digital controllers have change into common because of their functionality of
precisely performing advanced computations at excessive speeds and flexibility in main
nonlinear management methods. On this context, this course focuses on the evaluation and design of
digital management methods.
Studying aims:
• To grasp the ideas of digital management methods and assemble numerous
elements related to it. Benefits in comparison with the analog sort.
• The idea of z–transformations and utility for the mathematical evaluation of
digital management methods.
• To characterize the discrete–time methods in state–house mannequin and analysis of state
transition matrix.
• To look at the soundness of the system utilizing completely different assessments.
• To review the traditional technique of analyzing digital management methods within the w–aircraft.
• To review the design of state suggestions management by “the pole placement technique.”
UNIT – I:
Introduction and sign processing
Introduction to analog and digital management methods – Benefits of digital methods – Typical
examples – Alerts and processing – Pattern and maintain units – Sampling theorem and knowledge
reconstruction – Frequency area traits of zero order maintain.
UNIT–II:
z–transformations
z–Transforms – Theorems – Discovering inverse z–transforms – Formulation of distinction
equations and fixing – Block diagram illustration – Pulse switch features and discovering
open loop and closed loop responses.
UNIT–III:
State house evaluation and the ideas of Controllability and observability
State house illustration of discrete time methods – State transition matrix and strategies of
analysis – Discretization of steady – Time state equations – Ideas of controllability
and observability – Exams(with out proof).
UNIT – IV:
Stability evaluation
Mapping between the s–Aircraft and the z–Aircraft – Main strips and Complementary strips –
Stability criterion – Modified Routh’s stability criterion and Jury’s stability take a look at.
UNIT – V:
Design of discrete–time management methods by standard strategies
Transient and regular state specs – Design utilizing frequency response within the w–aircraft
for lag and lead compensators – Root locus approach within the z–aircraft.
UNIT – VI:
State suggestions controllers:
Design of state suggestions controller by way of pole placement – Crucial and ample
situations – Ackerman’s components.
Studying outcomes:
• The scholars study the benefits of discrete time management methods and the “know
how” of varied related equipment.
• The learner perceive z–transformations and their function within the mathematical evaluation
of various methods(like Laplace transforms in analog methods).
• The steadiness criterion for digital methods and strategies adopted for testing the identical
are defined.
• Lastly, the traditional and state house strategies of design are additionally launched.
Textual content E-book:
1. Discrete–Time Management methods – Ok. Ogata, Pearson Training/PHI, 2nd
Version.
2. Digital Management and State Variable Strategies by M.Gopal, TMH, 4th Version.
Reference Books:
1. Digital Management Techniques, Kuo, Oxford College Press, 2nd Version, 2003.
by Rishi | Jun 4, 2019 | Jntuk lecture notes
by Rishi | Jun 4, 2019 | Jntuk lecture notes
Digital Communications
UNIT I
PULSE DIGITAL MODULATION: components of electronic communication systems, blessings of electronic communication systems, components of PCM: Sampling, quantisation , quantisation error, Companding in PCM systems. Differential PCM systems (DPCM). Delta modulation, its draw backs, adaptive delta modulation, comparison of PCM and DM systems, noise in PCM and DM systems.
UNIT II
DIGITAL MODULATION TECHNIQUES: Introduction, ASK, FSK, PSK, DPSK, DEPSK, QPSK, M-ary PSK, ASK, FSK, similarity of BFSK and BPSK.
UNIT III
information TRANSMISSION : Base band signal receiver, likelihood of error, the optimum filter, matched filter, likelihood of error victimisation matched filter, coherent reception, non-coherent detection of FSK, calculation of error likelihood of raise, BPSK, BFSK,QPSK.
UNIT IV
info THEORY: separate messages, idea of quantity of data and its properties. Average info, Entropy and its properties. info rate, Mutual info and its properties.
UNIT V
supply CODING: Introductions, Advantages, Shannon’s theorem, Shanon-Fano committal to writing, Huffman committal to writing, potency calculations, data rate of separate and analog Channels, capability of a mathematician channel, information measure –S/N trade off.
UNIT VI
LINEAR BLOCK CODES: Introduction, Matrix description of Linear Block codes, Error detection and error correction capabilities of Linear block codes, playing codes, Binary cyclic codes, algebraical structure, encoding, syndrome calculation, BCH Codes. CONVOLUTION CODES: Introduction, cryptography of convolution codes, time domain approach, rework domain approach. Graphical approach: state, tree and trellis diagram cryptography victimisation Viterbi rule.
TEXT BOOKS:
- Digital communications – Simon Haykin, John Wiley, 2005
- Principles of Communication Systems – H. Taub and D. Schilling, TMH, 2003
REFERENCES: - Digital and Analog Communication Systems – surface-to-air missile Shanmugam, John Wiley, 2005.
- Digital Communications – John Proakis, TMH, 1983. Communication Systems Analog & Digital – Singh & Sapre, TMH, 2004. 3. trendy Analog and electronic communication – B.P.Lathi, Oxford reprint, third edition, 2004.
III Year – I Semester
L T P C
4 0 0 3
DIGITAL COMMUNICATIONS
Students undergoing this course ar expected to:
Course Objectives:
1.Understand totally different pulse digital modulation techniques and their comparision a pair of.Familiarize numerous digital modulation techniques and calculation of their error possibilities three. perceive the idea of entropy and totally different supply committal to writing techniques four. Familirize with block codes, cyclic codes and convolutional codes
Course Outcomes:
once undergoing the course students are going to be ready to:
one. confirm the performance of various wave form committal to writing techniques for the generation and digital illustration of the signals.
2. confirm the likelihood of error for numerous digital modulation schemes
three. Analyze totally different supply committal to writing techniques
four. reckon and analyze totally different error management committal to writing schemes for the reliable transmission of digital info over the channel.
by Rishi | Jun 4, 2019 | Jntuk lecture notes
Design of Machine Members -I
Course Objectives:
- the coed shall gain appreciation and understanding of the planning perform in applied science, the steps concerned in coming up with and therefore the relation of style activity with producing activity a pair of. choice of correct materials to completely different machine parts supported their physical and mechanical properties. 3. Learn and understanding of the various kinds of failure modes and criteria. 4. Procedure for the various machine parts like fasteners, shafts, couplings, keys, axially loaded joints etc.
UNIT – I
INTRODUCTION: General issues within the style of Engineering Materials and their properties – choice –Manufacturing thought in style, tolerances and fits –BIS codes of steels.
STRESSES IN MACHINE MEMBERS: easy stresses – combined stresses – torsional and bending stresses – impact stresses – stress strain relation – numerous theories of failure – issue of safety – style for strength and rigidity – most popular numbers. the idea of stiffness in tension, bending, torsion and combined things – static strength style supported fracture toughness.
UNIT – II
STRENGTH OF MACHINE ELEMENTS: Stress concentration – theoretical stress concentration issue – fatigue stress concentration issue notch sensitivity – style for unsteady stresses – endurance limit – estimation of endurance strength – Goodman’s line – Soderberg’s line – changed Goodman’s line.
UNIT – III
Riveted and welded joints – style of joints with initial stresses – eccentric loading.
Bolted joints – style of bolts with pre-stresses – style of joints below eccentric loading – protection devices – each of uniform strength, completely different seals.
UNIT – IV
KEYS, COTTERS AND KNUCKLE JOINTS: style of keys-stresses in keys-cotter joints-spigot and socket, sleeve and cotter, jib and cotter joints- knuckle joints.
SHAFTS: style of solid and hollow shafts for strength and rigidity – style of shafts for combined bending and axial hundreds – shaft sizes – BIS code. Use of internal and external circlips, gaskets and seals (stationary & rotary).
UNIT – V
SHAFT COUPLING: Rigid couplings – muff, split muff and rim couplings, versatile couplings – rim coupling (modified).
II Year – II Semester
L T P C
4 0 0 3
DESIGN OF MACHINE MEMBERS – I
UNIT – VI
MECHANICAL SPRINGS:
Stresses and deflections of whorled springs – extension -compression springs – springs for fatigue loading, energy storage capability – whorled torsion springs – co-axial springs, leaf springs.
Note: style knowledge book isn’t allowable for examination
Text Books:
- Machine Design/V.Bandari/ TMH Publishers a pair of. Machine style / Old North State Pandya Shah/Charotar publishing firm Pvt. restricted three. style knowledge book of Engineers-
References:
- style of Machine parts / V.M. Faires/McMillan
- Machine style / Schaum Series/McGrawHill skilled
- Machine Design/ Shigley, J.E/McGraw Hill.
- style knowledge handbook/ K.Mahadevan & K. Balaveera Reddy/ CBS publishers.
- style of machine elements-Spotts/Pearson Publications half-dozen. Machine style –Norton/ Pearson publishers
Course outcomes:
Upon thriving completion of this course student ought to be ready to:
- Apply the planning procedure to engineering issues, together with the thought of technical and producing constraints.
- choose appropriate materials and significance of tolerances and fits in vital style applications.
- Utilize style knowledge hand book and style the weather for strength, stiffness and fatigue.
- determine the masses, the machine members subjected and calculate static and dynamic stresses to confirm safe style.
by Rishi | Jun 4, 2019 | Jntuk lecture notes
Database Management Systems
OBJECTIVES
• to find out the principles of consistently planning and mistreatment massive scale info
Management Systems for varied applications.
UNIT-I:
an summary of management, Introduction- what’s info System- what’s knowledgebase-Why Database- Data Independence- Relation Systems and Others- outline, info system design, Introduction- The 3 Levels of design-The External Level- the abstract Level- the interior Level- Mapping- the info Administrator-The management Systems- Client/Server Architecture.
UNIT-II:
The E/R Models, The relative Model, relative Calculus, Introduction to info style, info style and Er Diagrams-Entities Attributes, and Entity Sets-Relationship and Relationship Sets-Conceptual style With the Er Models, The relative Model Integrity Constraints Over Relations- Key Constraints –Foreign Key Constraints-General Constraints, relative pure mathematics and Calculus, relative Algebra- choice and Projection- Set Operation, Renaming – Joins- Division- a lot of samples of Queries, relative Calculus, Tuple relative Calculus- Domain relative Calculus.
UNIT-III:
Queries, Constraints, Triggers: the shape of Basic SQL question, Union, Intersect, and Except, Nested Queries, combination Operators, Null Values, complicated Integrity Constraints in SQL, Triggers and Active info.
UNIT-IV:
Schema Refinement (Normalization) : Purpose of normalisation or schema refinement, construct of practical dependency, traditional forms supported practical dependency(1NF, 2NF and three NF), construct of surrogate key, Boyce-codd traditional form(BCNF), lossless be a part of and dependency conserving decomposition, Fourth traditional form(4NF).
III Year – I Semester
L T P C
4 0 0 3
UNIT-V:
dealing Management and Concurrency Control:
Transaction, properties of transactions, dealing log, and dealing management with SQL mistreatment commit rollback and save purpose.
Concurrency management for lost updates, uncommitted knowledge, inconsistent retrievals and therefore the hardware. Concurrency management with protection ways : lock graininess, lock types, 2 section protection for making certain serializability, deadlocks, Concurrency management with time stamp ordering : Wait/Die and Wound/Wait Schemes, info Recovery management : dealing recovery.
UNIT-VI:
summary of Storages and assortment, knowledge on External Storage- File Organization and assortment – Clustered assortment – Primary and Secondary Indexes, Index knowledge Structures, Hash-Based assortment – Tree-Based assortment, Comparison of File Organization
OUTCOMES
• Describe a on-line database and electronic database.
• Create, maintain and manipulate a {relational info|electronic database|on-line database|computer database|electronic information service} mistreatment SQL
• Describe ER model and normalisation for database style.
• Examine problems in knowledge storage and question process and might formulate applicable solutions.
• perceive the role and problems in management of knowledge like potency, privacy, security, moral responsibility, and strategic advantage. • style and build info system for a given universe drawback
TEXT BOOKS:
one. Introduction to info Systems, CJ Date, Pearson
2. knowledge base Management Systems, Raghurama Krishnan, Johannes Gehrke, TATA John McGraw Hill third Edition
three. info Systems – the entire Book, H G Molina, J D Ullman, J Widom Pearson
REFERENCES BOOKS:
one. knowledge base Systems style, Implementation, and Management, Peter Rob Coronel seventh Edition.
2. Fundamentals of info Systems, Elmasri Navrate Pearson Education three. Introduction to info Systems, C.J.Date Pearson Education
[content-egg module=Amazon template=list]
by Rishi | Jun 4, 2019 | Jntuk lecture notes
Data Structures
OBJECTIVES:
• To be accustomed to basic techniques handling issues with knowledge structures • Solve issues exploitation knowledge structures like linear lists, stacks, queues, hash tables
UNIT-I:
ARRAYS Abstract knowledge sort, The Array as associate Abstract knowledge sort, The Polynomial Abstract knowledge type-Polynomial Representation- Polynomial Addition. Spares Matrices, Introduction- distributed Matrix Representation- Transposing a Matrix- matrix operation, illustration of Arrays.
UNIT-II:
STACKS AND QUEUES The Stack Abstract knowledge sort, The Queue Abstract knowledge sort, analysis of Expressions, Expression- ending Notation- Infix to ending.
UNIT-III:
joined LISTS Single joined List and Chains, Circular Lists, on the market area Lists, joined Stacks and Queues, Polynomials, Polynomial illustration- Adding Polynomials- Circular List Representation of Polynomials, Equivalence categories, distributed Matrices, distributed Matrix Representation- distributed Matrix Input- Deleting a distributed Matrix, Doubly joined Lists, Generalized Lists, illustration of Generalized Lists- algorithmic Algorithms for Lists- Reference Counts, Shared and algorithmic Lists
UNIT-IV:
TREES illustration of Trees, Binary Trees, The Abstract knowledge sort, Properties of Binary coiffure, Binary Tree Representations, Binary Tree Traversal, Introduction, Inorder Traversal Preorder Traversal, Postorder Traversal, Thread Binary Trees, Threads, Inorder Traversal of a rib Binary Tree, Inserting a Node into a rib Binary Tree, Heaps, Priority Queues, Definition of a liquid ecstasy Heap, Insertion into a liquid ecstasy Heap, Deletion from a liquid ecstasy Heap, Binary Search Trees, Definition, looking a Binary Search Tree, Insertion into a Binary Search Tree, Deletion from a Binary Search Tree, Height of Binary Search Tree.
UNIT-V:
GRAPHS The Graph Abstract knowledge sort, Introduction, Definition, Graph illustration, Elementary Graph Operation, Depth 1st Search, Breadth 1st Search, Connected elements, Spanning Trees, Biconnected elements, Minimum value Spanning Trees, Kruskal S algorithmic program, Prim s algorithmic program, Sollin’s algorithmic program, Shortest ways and transitive Closure, Single Source/All Destination: plus Edge value, Single Source/All Destination: General Weights, All-Pairs Shortest Path, transitive Closure.
I Year – II Semester
L T P C
4 0 0 3
DATA STRUCTURES
UNIT-VI:
SORTING Insertion type, Quick Sort, Merge type Merging, reiterative Merge type, algorithmic Merge type, Heap Sort, outline of Internal Sorting
OUTCOMES:
• Apply advanced organisation ways for exploring complicated knowledge structures.
• Compare and distinction numerous knowledge structures and style techniques within the space Of Performance.
• Implement all knowledge structures like stacks, queues, trees, lists and graphs and compare their Performance and trade offs
Text Books:
- knowledge structures, Algorithms and Applications in C++, S.Sahni, University Press (India) Pvt.Ltd, second edition, Universities Press Orient Longman Pvt. Ltd.
- knowledge structures and algorithmic program Analysis in C++, Mark Allen Weiss, Pearson Education. Ltd., Second Edition.
- knowledge structures and algorithms in C++, third Edition, Adam Drozdek, Thomson
Reference Books:
- knowledge structures and algorithmic program Analysis in C++, Mark Allen Weiss, Pearson Education. Ltd., Second Edition.
- knowledge structures exploitation C and C++, Langsam, Augenstein and Tanenbaum, PHI.
- downside finding with C++, The OOP, Fourth edition, W.Savitch, Pearson education.
[content-egg module=Amazon template=list]
by Rishi | Jun 4, 2019 | Jntuk lecture notes
Control Systems
JntukMaterials is paid lecture notes provider for students.Here you can download any material of different branches.
Here You can Download Control Systems for EEE Jntuk R16 Students of 2-2.
by Rishi | Jun 4, 2019 | Jntuk lecture notes
Control Systems
JntukMaterials is a paid lecture notes provider for Jntuk R16 Students. You can download material you want ,here you can download Control Systems 2-2 ece
by Rishi | Jun 4, 2019 | Jntuk lecture notes
Computer Organization
OBJECTIVES:
• perceive the design of a contemporary pc with its numerous process units. conjointly the Performance measuring of the pc system. • additionally to the current the memory management system of pc.
UNIT -I:
Basic Structure Of Computers: useful unit, Basic Operational ideas, Bus structures, System software package, Performance, The history of pc development.
UNIT -II:
Machine Instruction and Programs: Instruction and Instruction Sequencing: Register Transfer Notation, programing language Notation, Basic Instruction sorts, Addressing Modes, Basic Input/output Operations, The role of Stacks and Queues in computer programing equation. element of directions: Logic Instructions, shift and Rotate directions
UNIT -III:
variety of directions: Arithmetic and Logic Instructions, Branch directions, Addressing Modes, Input/output Operations
UNIT -IV:
INPUT/OUTPUT ORGANIZATION: Accessing I/O Devices, Interrupts: Interrupt Hardware, enabling and Disabling Interrupts, Handling Multiple Devices, Direct access, Buses: Synchronous Bus, Asynchronous Bus, Interface Circuits, commonplace I/O Interface: Peripheral element Interconnect (PCI) Bus, Universal Serial Bus (USB)
UNIT -V:
The MEMORY SYSTEMS: Basic memory circuits, Memory System thought, ReadOnly Memory: store, PROM, EPROM, EEPROM, non-volatile storage, Cache Memories: Mapping Functions, INTERLEAVING Secondary Storage: Magnetic onerous Disks, Optical Disks,
II Year – II Semester
L T P C
4 0 0 3
UNIT -VI:
process Unit: elementary Concepts: Register Transfers, playacting associate degree Arithmetic Or operation, attractive A Word From Memory, Execution of Complete Instruction, Hardwired management, small programmed Control: Microinstructions, small program Sequencing, Wide Branch Addressing Microinstructions with next –Address Field
OUTCOMES:
• Students will perceive the design of recent pc.
• they’ll analyze the Performance of a pc exploitation performance equation
• Understanding of various instruction sorts.
• Students will calculate the effective address of associate degree quantity by addressing modes
• they’ll perceive however pc stores positive and negative numbers.
• Understanding of however a pc performs operation of positive and negative numbers.
TEXT BOOKS:
1. pc Organization, Carl Hamacher, Zvonks Vranesic, Safea Zaky, fifth Edition, baseball player Hill. 2. pc design and Organization, John P. Hayes, third Edition, baseball player Hill.
REFERENCE BOOKS:
1. pc Organization and design – William Stallings Sixth Edition, Pearson/PHI
2. Structured pc Organization – Andrew S. Tanenbaum, fourth Edition PHI/Pearson
3. Fundamentals or pc Organization and style, – Sivaraama Dandamudi Springer Int. Edition.
4. “Computer Organization and Design: The Hardware/Software Interface” by David A. Patterson and John L. Hennessy.
5. J .P. Hayes, “Computer design and Organization”, McGraw-Hill, 1998.
