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.
by Rishi | Mar 21, 2020 | Jntuk lecture notes
CRYPTOGRAPHY AND NETWORK SECURITY
OBJECTIVES:
• On this course the next ideas and follow of cryptography and community safety
are coated:
• Classical methods, symmetric block ciphers (DES, AES, different up to date symmetric
ciphers)
• Public-key cryptography (RSA, discrete logarithms),
• Algorithms for factoring and discrete logarithms, cryptographic protocols, hash features,
authentication, key administration, key change, signature schemes,
• E mail and net safety, viruses, firewalls, digital proper administration, and different subjects.
UNIT- I:
Primary Ideas
Safety Objectives, Cryptographic Assaults, Providers and Mechanisms, Arithmetic of Cryptography
UNIT- II:
Symmetric Encryption
Arithmetic of Symmetric Key Cryptography, Introduction to Fashionable Symmetric Key Ciphers,
Information Encryption Normal, Superior Encryption Normal.
UNIT- III:
Uneven Encryption
Arithmetic of Uneven Key Cryptography, Uneven Key Cryptography
UNIT- IV:
Information Integrity, Digital Signature Schemes & Key Administration
Message Integrity and Message Authentication, Cryptographic Hash Capabilities, Digital
Signature, Key Administration.
UNIT -V:
Community Safety-I
Safety at software layer: PGP and S/MIME, Safety on the Transport Layer: SSL and TLS
UNIT -VI:
Community Safety-II
Safety on the Community Layer: IPSec, System Safety
IV Yr – I Semester
L T P C
Four zero zero 3
OUTCOMES:
• To be familiarity with data safety consciousness and a transparent understanding of
its significance.
• To grasp fundamentals of secret and public cryptography
• To grasp protocols for safety companies
• To be acquainted with community safety threats and countermeasures
• To be acquainted with community safety designs utilizing accessible safe options (such
asPGP,
• SSL, IPSec, and many others)
TEXT BOOKS:
1) Cryptography and Community Safety, Behrouz A Forouzan, DebdeepMukhopadhyay, (3e)
Mc Graw Hill.
2) Cryptography and Community Safety, William Stallings, (6e) Pearson.
3) On a regular basis Cryptography, Keith M.Martin, Oxford.
REFERENCE BOOKS:
1) Community Safety and Cryptography, Bernard Meneges, Cengage Studying.
by Rishi | Mar 21, 2020 | Jntuk lecture notes
EMBEDDED SYSTEMS
(Open Elective) OBJECTIVES:
• Expertise capabilities and limitations of the {hardware}, software program parts
• Strategies to guage design tradeoffs between completely different know-how selections.
• Design Methodologies
UNIT-I:
Introduction to Embedded methods:
What’s an embedded system Vs. Normal computing system, historical past, classification, main software areas, and goal of embedded methods. Core of embedded system, reminiscence, sensors and actuators, communication interface, embedded firmware, different system parts, PCB and passive parts.
UNIT-II:
8—bit microcontrollers structure: Traits, high quality attributes software particular, area particular, embedded methods. Elements to be thought-about in choosing a controller, 8051 structure, reminiscence group, registers, oscillator unit, ports, supply present, sinking present, design examples.
UNIT-III:
RTOS and Scheduling, Working fundamentals, sorts, RTOS, duties, course of and threads, multiprocessing and multitasking, forms of multitasking, non preemptive, preemptive scheduling. UNIT-IV: Process communication of RTOS, Shared reminiscence, pipes, reminiscence mapped objects, message passing, message queue, mailbox, signaling, RPC and sockets, job communication/synchronization points, racing, impasse, stay lock, the eating thinker’s downside.
UNIT-V:
The producer-consumer downside, Reader writers downside, Precedence Inversion, Precedence ceiling, Process Synchronization methods, busy ready, sleep and wakery, semaphore, mutex, vital part objects, occasions, machine, machine drivers, the best way to clause an RTOS, Integration and testing of embedded {hardware} and hearth ware.
UNIT-VI:
Simulators, emulators, Debuggers, Embedded Product Growth life cycle (EDLC), Tendencies in embedded Trade, Introduction to ARM household of processor.
OUTCOMES:
Perceive the fundamentals of an embedded system
• Program an embedded system
• Design, implement and check an embedded system. Determine the distinctive traits of real-time methods
• Clarify the overall construction of a real-time system • Outline the distinctive design issues and challenges of real-time methods
TEXT BOOK:
1. Introduction to embedded methods Shibu. Ok.V, TMH, 2009.
REFERENCE BOOKS:
1. Ayala &Gadre: The 8051 Microcontroller & Embedded Methods utilizing Meeting and C, CENGAGE
2. Embedded Methods, Rajkamal, TMH, 2009.
3. Embedded Software program Primer, David Simon, Pearson.
4. The 8051 Microcontroller and Embedded Methods, Mazidi, Mazidi, Pearson,.
