by Rishi | Mar 23, 2020 | Jntuk lecture notes
VLSI DESIGN
Targets:
The primary goals of this course are:
• Primary traits of MOS transistor and examines varied prospects for configuring inverter circuits
and facets of latch-up are thought of.
• Design processes are aided by easy ideas resembling stick and symbolic diagrams however the important thing factor is a
set of design guidelines, that are defined clearly.
• Primary circuit ideas are launched for MOS processes we are able to set out approximate circuit parameters
which drastically ease the design course of.
Outcomes:
On the finish of this course the scholar can capable of:
• Perceive the properties of MOS energetic gadgets and easy circuits configured when utilizing them and the
cause for such encumbrances as ratio guidelines by which circuits will be interconnected in silicon.
• Know three units of design guidelines with which nMOS and CMOS designs could also be fabricated.
• Perceive the scaling components figuring out the traits and efficiency of MOS circuits in silicon.
Syllabus:
UNIT-I:
Introduction and Primary Electrical Properties of MOS Circuits: Introduction to IC know-how, Fabrication
course of: nMOS, pMOS and CMOS. Ids versus Vds Relationships, Points of MOS transistor Threshold Voltage,
MOS transistor Trans, Output Conductance and Determine of Advantage. nMOS Inverter, Pull-up to Pull-down Ratio for
nMOS inverter pushed by one other nMOS inverter, and thru a number of cross transistors. Various types of
pull-up, The CMOS Inverter, Latch-up in CMOS circuits, Bi-CMOS Inverter, Comparability between CMOS and
BiCMOS know-how.
(Textual content Guide-1)
UNIT-II:
MOS and Bi-CMOS Circuit Design Processes: MOS Layers, Stick Diagrams, Design Guidelines and Structure, Basic
observations on the Design guidelines, 2µm Double Steel, Double Poly, CMOS/BiCMOS guidelines, 1.2µm Double Steel,
Double Poly CMOS guidelines, Structure Diagrams of NAND and NOR gates and CMOS inverter, Symbolic DiagramsTranslation to Masks Type.
(Textual content Guide-1)
UNIT-III:
Primary Circuit Ideas: Sheet Resistance, Sheet Resistance idea utilized to MOS transistors and Inverters, Space
Capacitance of Layers, Customary unit of capacitance, Some space Capacitance Calculations, The Delay Unit, Inverter
Delays, Driving massive capacitive masses, Propagation Delays, Wiring Capacitances, Selection of layers.
Scaling of MOS Circuits: Scaling fashions and scaling components, Scaling components for gadget parameters, Limitations of
scaling, Limits on account of sub threshold currents, Limits on logic ranges and provide voltage on account of noise and present
density. Swap logic, Gate logic.
(Textual content Guide-1)
UNIT-IV:
Chip Enter and Output circuits: ESD Safety, Enter Circuits, Output Circuits and L(di/dt) Noise, On-Chip
clock Technology and Distribution.
Design for Testability: Fault varieties and Fashions, Controllability and Observability, Advert Hoc Testable Design
Methods, Scan Primarily based Methods and Constructed-In Self Take a look at strategies.
(Textual content Guide-2)
UNIT-V:
FPGA Design: FPGA design movement, Primary FPGA structure, FPGA Applied sciences, FPGA families- Altera Flex
8000FPGA, Altera Flex 10FPGA, Xilinx XC4000 collection FPGA, Xilinx Spartan XL FPGA, Xilinx Spartan II
FPGAs, Xilinx Vertex FPGA. Case research: FPGA Implementation of Half adder and full adder.
Introduction to synthesis: Logic synthesis, RTL synthesis, Excessive stage Synthesis.
(Reference Textual content Guide-1)
UNIT-VI:
Introduction to Low Energy VLSI Design: Introduction to Deep submicron digital IC design, Low Energy CMOS
Logic Circuits: Over view of energy consumption, Low –energy design by way of voltage scaling, Estimation and
optimisation of switching exercise, Discount of switching capacitance. Interconnect Design, Energy Grid and Clock
Design.
(Textual content Guide-2)
Textual content Books:
1. Necessities of VLSI Circuits and Programs – Kamran Eshraghian, Douglas and A. Pucknell and Sholeh
Eshraghian, Prentice-Corridor of India Non-public Restricted, 2005 Version.
2. CMOS Digital Built-in Circuits Evaluation and Design- Sung-Mo Kang, Yusuf Leblebici, Tata McGrawHill Schooling, 2003.
References:
1. Superior Digital Design with the Verilog HDL, Michael D.Ciletti, Xilinx Design Collection, Pearson Schooling
2. Evaluation and Design of Digital Built-in Circuits in Deep submicron Expertise, 3’rd version, David
Hodges.
by Rishi | Mar 23, 2020 | Jntuk lecture notes
DESIGN AND ANALYSIS OF ALGORITHMS
OBJECTIVES:
Upon completion of this course, college students will have the ability to do the next:
• Analyze the asymptotic efficiency of algorithms.
• Write rigorous correctness proofs for algorithms.
• Exhibit a familiarity with main algorithms and information constructions.
• Apply necessary algorithmic design paradigms and strategies of research.
• Synthesize environment friendly algorithms in frequent engineering design conditions
UNIT-I:
Introduction: What’s an Algorithm, Algorithm Specification, Pseudocode Conventions
Recursive Algorithm, Efficiency Evaluation, Area Complexity, Time Complexity, Amortized
Complexity, Amortized Complexity, Asymptotic Notation, Sensible Complexities, Efficiency
Measurement.
UNIT-II:
Dived and Conquer: Common Technique, Faulty Chessboard, Binary Search, Discovering the
Most and Minimal, Merge Kind, Fast Kind, Efficiency Measurement, Randomized
Sorting Algorithms.
UNIT-III:
The Grasping Technique: The Common Technique, Knapsack Downside, Job Sequencing with Deadlines,
Minimal-cost Spanning Timber, Prim’s Algorithm, Kruskal’s Algorithms, An Optimum
Randomized Algorithm, Optimum Merge Patterns, Single Supply Shortest Paths.
UNIT-IV:
Dynamic Programming: All – Pairs Shortest Paths, Single – Supply Shortest paths Common
Weights, String Version, 0/1 Knapsack, Reliability Design,
UNIT-V:
Backtracking: The Common Technique, The 8-Queens Downside, Sum of Subsets, Graph Coloring ,
Hamiltonian Cycles.
UNIT-VI:
Department and Certain: The Technique, Least value (LC) Search, The 15-Puzzle: an Instance, Management
Abstraction for LC-Search, Bounding, FIFO Department-and-Certain, LC Department and Certain, 0/1
Knapsack Downside, LC Department-and Certain Answer, FIFO Department-and-Certain Answer,
Touring Salesperson.
OUTCOMES:
College students who full the course could have demonstrated the power to do the next:
III 12 months – II Semester
L T P C
four Zero Zero 3
• Argue the correctness of algorithms utilizing inductive proofs and invariants.
• Analyze worst-case operating instances of algorithms utilizing asymptotic evaluation.
• Describe the divide-and-conquer paradigm and clarify when an algorithmic design
state of affairs requires it. Recite algorithms that make use of this paradigm. Synthesize divide-andconquer algorithms. Derive and resolve recurrences describing the efficiency of divideand-conquer algorithms.
• Describe the dynamic-programming paradigm and clarify when an algorithmic design
state of affairs requires it. Recite algorithms that make use of this paradigm. Synthesize dynamicprogramming algorithms, and analyze them.
• Describe the grasping paradigm and clarify when an algorithmic design state of affairs requires
it. Recite algorithms that make use of this paradigm. Synthesize grasping algorithms, and
analyze them.
TEXT BOOKS:
1. Fundamentals of pc algorithms E. Horowitz S. Sahni, College Press
2. Introduction to AlgorithmsThomas H. Cormen, PHI Studying
REFERENCE BOOKS
1. The Design and Evaluation of Pc Algorithms, Alfred V. Aho, John E. Hopcroft, Jeffrey D.
Ullman
2. Algorithm Design, Jon Kleinberg, Pearson.
by Rishi | Mar 23, 2020 | Jntuk lecture notes
COMPUTER NETWORKS
OBJECTIVES:
• Perceive state-of-the-art in community protocols, architectures, and purposes.
• Technique of networking analysis
• Constraints and thought processes for networking analysis
• Drawback Formulation—Method—Evaluation—
UNIT – I:
Introduction: Community Topologies WAN, LAN, MAN. Reference models- The OSI Reference
Mannequin- the TCP/IP Reference Mannequin – A Comparability of the OSI and TCP/IP Reference Fashions
UNIT – II:
Bodily Layer – Fourier Evaluation – Bandwidth Restricted Alerts – The Most Information Price of
a Channel – Guided Transmission Media, Digital Modulation and Multiplexing: Frequency
Division Multiplexing, Time Division Multiplexing, Code Division Multiplexing
Information Hyperlink Layer Design Points, Error Detection and Correction, Elementary Information Hyperlink
Protocols, Sliding Window Protocols
UNIT – III:
The Information Hyperlink Layer – Providers Supplied to the Community Layer – Framing – Error Management –
Movement Management, Error Detection and Correction – Error-Correcting Codes – Error Detecting
Codes, Elementary Information Hyperlink Protocols- A Utopian Simplex Protocol-A Simplex Cease and Wait
Protocol for an Error free channel-A Simplex Cease and Wait Protocol for a Noisy Channel,
Sliding Window Protocols-A One Bit Sliding Window Protocol-A Protocol Utilizing Go-Again-NA Protocol Utilizing Selective Repeat
UNIT – IV:
The Medium Entry Management Sublayer-The Channel Allocation Drawback-Static Channel
Allocation-Assumptions for Dynamic Channel Allocation, A number of Entry Protocols-AlohaCarrier Sense A number of Entry Protocols-Collision-Free Protocols-Restricted Rivalry ProtocolsWireless LAN Protocols, Ethernet-Traditional Ethernet Bodily Layer-Traditional Ethernet MAC
Sublayer Protocol-Ethernet Efficiency-Quick Ethernet Gigabit Ethernet-10-Gigabit EthernetRetrospective on Ethernet, Wi-fi Lans-The 802.11 Structure and Protocol Stack-The
802.11 Bodily Layer-The802.11 MAC Sublayer Protocol-The 805.11 Body Construction-Providers
UNIT – V:
Design Points-The Community Layer Design Points – Retailer and Ahead Packet Switching-Providers
Supplied to the Transport layer- Implementation of Connectionless Service-Implementation of
Connection Oriented Service-Comparability of Digital Circuit and Datagram Networks, Routing
Algorithms-The Optimality principle-Shortest path Algorithm, Congestion Management AlgorithmsApproaches to Congestion Management-Visitors Conscious Routing-Admission Management-Visitors
Throttling-Load Shedding.
III Yr – II Semester
L T P C
four 2 zero 3
UNIT – VI:
Transport Layer – The Web Transport Protocols: Udp, the Web Transport Protocols: Tcp
Utility Layer –The Area Title System: The DNS Title House, Useful resource Information,
Title Servers, Digital Mail: Structure and Providers, The Consumer Agent, Message Codecs,
Message Switch, Ultimate Supply
OUTCOMES:
• Perceive OSI and TCP/IP fashions
• Analyze MAC layer protocols and LAN applied sciences
• Design purposes utilizing web protocols
• Perceive routing and congestion management algorithms
• Perceive how web works
TEXT BOOKS:
1. Tanenbaum and David J Wetherall, Pc Networks, fifth Version, Pearson Edu, 2010
2. Pc Networks: A Prime Down Method, Behrouz A. Forouzan, FirouzMosharraf,
McGraw Hill Training
REFERENCE BOOKS:
1. Larry L. Peterson and Bruce S. Davie, “Pc Networks – A Methods Method” (fifth
ed), Morgan Kaufmann/ Elsevier, 2011
by Rishi | Mar 23, 2020 | Jntuk lecture notes
DATA WARE HOUSING AND DATA MINING
OBJECTIVES:
• College students will likely be enabled to know and implement classical fashions and algorithms in
information warehousing and information mining.
• They’ll learn to analyze the info, establish the issues, and select the related
fashions and algorithms to use.
• They’ll additional have the ability to assess the strengths and weaknesses of varied strategies and
algorithms and to research their conduct.
UNIT –I:
Introduction:Why Knowledge Mining? What Is Knowledge Mining?1.Three What Sorts of Knowledge Can Be
Mined?1.Four What Sorts of Patterns Can Be Mined?Which Applied sciences Are Used?Which Varieties
of Purposes Are Focused?Main Points in Knowledge Mining.Knowledge Objects and Attribute
Sorts,Primary Statistical Descriptions of Knowledge,Knowledge Visualization, Measuring Knowledge Similarity and
Dissimilarity
UNIT –II:
Knowledge Pre-processing: Knowledge Preprocessing: An Overview,Knowledge Cleansing,Knowledge Integration,Knowledge
Discount,Knowledge Transformation and Knowledge Discretization
UNIT –III:
Classification: Primary Ideas, Normal Strategy to fixing a classification downside, Resolution
Tree Induction: Working of Resolution Tree, constructing a choice tree, strategies for expressing an
attribute check situations, measures for choosing the right break up, Algorithm for determination tree
induction.
UNIT –IV:
Classification: Alterative Methods, Bayes’ Theorem, Naïve Bayesian Classification,
Bayesian Perception Networks
UNIT –V
Affiliation Evaluation: Primary Ideas and Algorithms: Drawback Defecation, Frequent Merchandise
Set era, Rule era, compact illustration of frequent merchandise units, FP-Progress
Algorithm. (Tan &Vipin)
UNIT –VI
Cluster Evaluation: Primary Ideas and Algorithms:Overview: What Is Cluster Evaluation?
Completely different Kinds of Clustering, Completely different Kinds of Clusters; Ok-means: The Primary Ok-means
Algorithm, Ok-means Further Points, Bisecting Ok-means, Strengths and Weaknesses;
Agglomerative Hierarchical Clustering: Primary Agglomerative Hierarchical Clustering Algorithm
DBSCAN: Conventional Density Middle-Based mostly Strategy, DBSCAN Algorithm, Strengths and
Weaknesses. (Tan &Vipin)
III 12 months – II Semester
L T P C
Four zero zero 3
OUTCOMES:
• Perceive phases in constructing a Knowledge Warehouse
• Perceive the necessity and significance of preprocessing strategies
• Perceive the necessity and significance of Similarity and dissimilarity strategies
• Analyze and consider efficiency of algorithms for Affiliation Guidelines.
• Analyze Classification and Clustering algorithms
TEXT BOOKS:
1. Introduction to Knowledge Mining: Pang-Ning Tan & Michael Steinbach, Vipin Kumar, Pearson.
2. Knowledge Mining ideas and Methods, 3/e, Jiawei Han, Michel Kamber, Elsevier.
REFERENCE BOOKS:
1. Knowledge Mining Methods and Purposes: An Introduction, Hongbo Du, Cengage
Studying.
2. Knowledge Mining : VikramPudi and P. Radha Krishna, Oxford.
3. Knowledge Mining and Evaluation – Basic Ideas and Algorithms; Mohammed J. Zaki,
Wagner Meira, Jr, Oxford
4. Knowledge Warehousing Knowledge Mining & OLAP, Alex Berson, Stephen Smith, TMH.
[content-egg module=Amazon]
by Rishi | Mar 23, 2020 | Jntuk lecture notes
Data Structures through C++
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.
by Rishi | Mar 23, 2020 | Jntuk lecture notes
POWER SYSTEM ANALYSIS
POWER SYSTEM ANALYSIS
Preamble:
The course is designed to provide college students the required information for the design and
evaluation {of electrical} energy grids. Calculation of energy stream in an influence system community
utilizing numerous strategies, formation of Zbus and its significance are lined on this course. It
additionally offers with brief circuit evaluation and evaluation of energy system for regular state and
transient stability.
Studying Targets:
• To growth the impedance diagram (p.u) and formation of Ybus
• To review the totally different load stream strategies.
• To review the idea of the Zbusbuilding algorithm.
• To review brief circuit calculation for symmetrical faults
• To review the impact of unsymmetrical faults and their results.
• To review the rotor angle stability of energy programs.
UNIT –I:
Per Unit Illustration & Topology
Per Unit Portions–Single line diagram– Impedance diagram of an influence system–Graph
concept definition – Formation of aspect node incidence and bus incidence matrices –
Primitive community illustration – Formation of Y–bus matrix by singular transformation
and direct inspection strategies.
UNIT –II:
Energy Circulate Research
Necessity of energy stream research – Derivation of static energy stream equations – Energy stream
answer utilizing Gauss-Seidel Methodology – Newton Raphson Methodology (Rectangular and polar
coordinates kind) –Decoupled and Quick Decoupled strategies – Algorithmic strategy –
Issues on 3–bus system solely.
UNIT –III:
Z–Bus formulation
Formation of Z–Bus: Partial community– Algorithm for the Modification of Zbus Matrix for
addition aspect for the next circumstances: Addition of aspect from a brand new bus to reference–
Addition of aspect from a brand new bus to an outdated bus– Addition of aspect between an outdated bus
to reference and Addition of aspect between two outdated busses (Derivations and Numerical
Issues).– Modification of Z–Bus for the adjustments in community ( Issues).
UNIT – IV:
Symmetrical Fault Evaluation
Transients on a Transmission line-Brief circuit of synchronous machine(on no-load) – 3–
Part brief circuit currents and reactances of synchronous machine–Brief circuit MVA
calculations –Sequence reactors – number of reactors.
UNIT –V:
Symmetrical Elements & Fault evaluation
Definition of symmetrical elements – symmetrical elements of unbalanced three section
programs – Energy in symmetrical elements – Sequence impedances – Synchronous
generator – Transmission line and transformers – Sequence networks –Varied varieties of faults
LG– LL– LLG and LLL on unloaded alternator–unsymmetrical faults on energy system.
UNIT – VI:
Energy System Stability Evaluation
Elementary ideas of Regular state– Dynamic and Transient Stabilities– Description of
Regular State Stability Energy Restrict–Switch Reactance–Synchronizing Energy Coefficient –
Energy Angle Curve and Dedication of Regular State Stability –Derivation of Swing
Equation–Dedication of Transient Stability by Equal Space Criterion–Purposes of
Equal Space Criterion–Strategies to enhance regular state and transient stability.
`Studying Outcomes:
• Ready to attract impedance diagram for an influence system community and to grasp per
unit portions.
• Capable of kind aYbusand Zbusfor an influence system networks.
• Capable of perceive the load stream answer of an influence system utilizing totally different strategies.
• Capable of finding the fault currents for all sorts faults to supply information for the design of
protecting units.
• Capable of findthe sequence elements of currents for unbalanced energy system
community.
• Capable of analyze the regular state, transient and dynamic stability ideas of an influence
system.
Textual content Books:
1. Energy System Evaluation by Grainger and Stevenson, Tata McGraw Hill.
2. Fashionable Energy system Evaluation – by I.J.Nagrath&D.P.Kothari: Tata
McGraw–Hill Publishing Firm, 2nd version.
Reference Books:
1. Energy System Evaluation – by A.R.Bergen, Prentice Corridor, Inc.
2. Energy System Evaluation by HadiSaadat – TMH Version.
3. Energy System Evaluation by B.R.Gupta, Wheeler Publications.
4. Energy System Evaluation and Design by J.Duncan Glover, M.S.Sarma, T.J.Overbye
– CengageLearning publications.
