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.
