9 views

Uploaded by Sarika Nanguluri

save

- B. TECH.(Computer Engineering) Part -III(Semester v & VI) (Batch 2010)
- Parser Generation in Perl - An Overview and Available Tools
- Let’s build a compiler
- Audio Level Meter
- POSTER L&C
- An Arificial Neural Network Based Software Re-Engineering Tool for Extracting Objects
- iPad App - Issue #88 Attachment
- 6th sem
- cse syllabus_R07
- Crafting an Interpreter Part 2 - The Calc0 Toy Language - VROSNET - CodeProject
- lexpcfgs
- MCA 5th Semester (2)
- Soe and Syllabus Et Engg 3-8 Semester
- Learning Outcome Compiler
- pjhe_dsn2016
- Power Amps 5
- Lab 2 IOR and C
- The xparse package. Generic document command parser
- AD5260_5262
- Data cleansing lecture
- EE305
- AB 03 Charakterystyki Tranzystora CB PNP
- Cs1352 Compiler Design
- EEE312EXP16
- An Exact Expression for the Thermal Variation of the Emitter Base Voltage of Bipolar Transistors
- top down parser
- sensores sensore
- Ice Complete Syllabus All 8 Sems (1)
- STATA y la VARIABLES
- 2017-18 M.sc. Electronics Part-I
- R10 B.tech. I Year Course Structure & Syllabus
- Sockets
- Certificate
- R10 B.tech. I Year Course Structure & Syllabus

You are on page 1of 27

com

w.e.f.2010

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY, KAKINADA II B.Tech. (IT) I.Sem. & II Sem. (Common with II B.Tech. I.Sem. (CSE)) P C II Year II Sem P

4

**II Year I Sem S.No. 1 2 Subject
**

Managerial Economics and Financial Analysis Probability & Statistics Mathematical Foundations of

P P

4 4

C C

C

4

S.No. 1

Subject

Data Communication

4 4

4 4

2

Principles of Programming Languages

4

4 4

Object Oriented Programming through Java 4

3

Computer Science and Engineering

3

4 4 4 3 3 2 4 4 4 2 2 0 Computer Organization & Architecture Data Base Management Systems Automata Theory & Compiler Design 4 4 4 3 3 2 4 4 4 2 2 2

4 5 6 7 8 9

Digital Logic Design Electronic Engineering Data Structures Electronic Engineering Lab Data Structures Lab Professional Communicational skills

4 5 6 7 8 9

Total Credits

J

T N

W U

28

R O

Object Oriented Programming Lab Data Base Management Systems Lab Professional Communicational skills

D L

Total Credits

30

www.jntuworld.com

www.jntuworld.com

w.e.f.2010

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY, KAKINADA II B.Tech. (IT) I.Sem. & II Sem. (Common with II B.Tech. I.Sem. (CSE)) 2.1.1Managerial Economics and Financial Analysis

Unit I Introduction to Managerial Economics: Introduction to Managerial Economics & Demand Analysis: Definition of Managerial Economics, Characteristics and Scope – Managerial Economics and its relation with other subjects- Basic economic tools in Managerial Economics Demand Analysis: Meaning- Demand distinctions- Demand determinants- Law of Demand and its exceptions. Unit-II Elasticity of Demand & Demand Forecasting: Definition -Types of Elasticity of demand - Measurement of price elasticity of demand: Total outlay method, Point method and Arc method- Significance of Elasticity of Demand. Demand Forecasting: Meaning - Factors governing demand forecasting - Methods of demand forecasting (survey of buyers’ Intentions, Delphi method, Collective opinion, Analysis of Time series and Trend projections, Economic Indicators, Controlled experiments and Judgmental approach) - Forecasting demand for new products- Criteria of a good forecasting method. Unit-III Theory of Production and Cost Analysis: Production Function- Isoquants and Isocosts, MRTS, Law of variable proportions- Law of returns to scale- Least Cost Combination of Inputs, Cobb-Douglas Production function - Economies of Scale. Cost Analysis: Cost concepts, Opportunity cost, Fixed Vs Variable costs, Explicit costs Vs. Implicit costs, Out of pocket costs vs. Imputed costs.-Determination of Break-Even Point (simple problems) - Managerial Significance and limitations of BEP. UNIT-IV Introduction to Markets, Managerial Theories of the Firm & Pricing Policies: Market structures: Types of competition, Features of Perfect Competition, Monopoly and Monopolistic Competition. PriceOutput Determination under Perfect Competition, Monopoly, Monopolistic Competition and Oligopoly Managerial theories of the firm - Marris and Williamson’s models. Pricing Policies: Methods of Pricing-Marginal Cost Pricing, Limit Pricing, Market Skimming Pricing, Penetration Pricing, Bundling Pricing, and Peak Load Pricing. Internet Pricing Models: Flat rate pricing, Usage sensitive pricing, Transaction based pricing, Priority pricing, charging on the basis of social cost, Precedence model, Smart market mechanism model.

J

T N

W U

R O

D L

www.jntuworld.com

Unit VIII Capital and Capital Budgeting: Meaning of capital budgeting. S. Vijaya Kumar: ‘Managerial Economics and Financial Analysis’.Limitations of Financial Statements. Oxford 2011 3.e. New Delhi. State/Public Enterprises and their types.Methods of Capital Budgeting: Payback Method.Features of business cycles.S.jntuworld. Profitability ratios and solvency ratios – Preparation of changes in working capital statement and fund flow statement. 2011 References: 1. Appa Rao. (IT) I. Unit VII Interpretation and analysis of Financial Statement: Ratio Analysis – Liquidity ratios.Prabhakar Rao: Managerial Economics and Financial Analysis. N. TMH 2011 2. *** J T N W U R O D L www. New Age International Publishers. Maruthi Publications. Ledger. I. Trial Balance.Sem. KAKINADA II B. IRR and Net Present Value Method (simple problems) Text Books: 1. Siddiqui.Tech. & II Sem.com . Journal.com w. Joint Stock Company.Final Accounts (with simple adjustments).jntuworld. 2011.Tech. Partnership.Sem. J.2010 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY. (CSE)) Unit V Types of Industrial Organization & Introduction to business cycles: Characteristic features of Industrial organization. Suma damodaran. Features and evaluation of Sole Proprietorship. 2011 2.Managerial Economics.A. Unit VI Introduction to Financial Accounting: Introduction to Double-entry system. Cengage Publications. Mangerial Economice and Financial Analysis. Siddiqui & A. & P. (Common with II B.V.www.f.Managerial Economics and Financial Analysis. Introduction to business cycles: Meaning-Phases of business cycles. Accounting Rate of Return (ARR). Need for capital budgeting – Capital budgeting decisions (Examples of capital budgeting) . A R Aryasri .

& II Sem. Freund. I. Tata Mc. UNIT-VI Tests of hypothesis using Student’s t-test. T.Conditional probability – Baye’s theorem. UNIT-IV Population and samples. Statistics and Queuing theory applications for Computer Sciences 2 ed. variances. Point and interval estimators for means.com w.Distribution function..Tech. 2.e. UNIT-V Statistical Hypothesis – Errors of Type I and Type II errors and calculation. p. (Common with II B. . variances.1. K.jntuworld. F-test and χ 2 test.2 PROBABILITY AND STATISTICS UNIT-I Probability: Sample space and events – Probability – The axioms of probability – Some Elementary theorems .Sem. UNIT-VII Statistical Quality Control methods – Methods for preparing control charts – Problems using x-bar.com . Miller and John E. proportion. Guru Swamy. Probability.Tech. Murugeson & P. 2.f. One tail. UNIT-III Binomial. Veerrajan.1. India.Graw Hill. proportions and their differences using Z-test. Test of independence of attributes . D. Sampling distribution of mean (with known and unknown variance). Testing hypothesis concerning means.Sem. Prentice Hall of India. Statistics and Random processes. Moment generating function. KAKINADA II B. 2. John Wiley. Probability and Statistics for Engineers.3 MATHEMATICAL FOUNDATIONS FOR COMPUTER SCIENCE & ENGINEERING J T N W U R O D L www. Moments of standard distributions – properties.jntuworld. Probability. UNIT-VIII Queuing Theory: Pure Birth and Death Process M/M/1 Model and Simple Problems. normal distribution – related properties. Poisson. (IT) I. (CSE)) 2.ANOVA for one-way and two-way classified data. two-tail tests.2010 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY. UNIT-II Random variables – Discrete and continuous distributions . Probability and Statistics.Sampling distribution of sums and differences. Trivedi. R charts and attribute charts – Simple Correlation and Regression. Anuradha Publishers. proportions. TEXT BOOK 1. REFERENCE 1.www.

Principle of Inclusion and Exclusion Relations: Properties of Binary Relations.Sem. Normal Forms. Partition and Covering. Tautologies. Lattices as Algebraic Systems. UNIT VIII: Recurrence Relation: Generating Function of Sequences. & II Sem. Connectives. The Principles of Inclusion – Exclusion. Derangements. Graph Colouring and Covering. Binomial Theorem. Transitive Closure. Eulerian and Hamiltonian Graphs. Equivalence. Paths and Circuits. Equivalence of Formulas. Euclidean Algorithm. Directed trees. The Greatest Common Divisor.Sem. Restricted Combinations. Circular Permutations.e.jntuworld.Tech. Isomorphic Graphs. (Problems and Theorems without proofs) UNIT V:Graph Theory II: Planar Graphs. Sub graphs. Chromatic Number. Permutation Functions. Permutations. Binomial and Multinomial Coefficients. Permutations with Repetition of Objects. UNIT VI: Algebraic Structures: Lattice: Properties.Tech. Decision Trees. Statement Functions. Inference theory for predicate calculus. Theory of Inference for Statement Calculus. Operations on Binary Sets. Restricted Permutations. Relation Matrix and Digraph. Groups: Abelian Group. Consistency of Premises. Inverse Functions. The Fundamental Theorem of Arithmetic. Duality law. Semi groups and Monoids: Homomorphism of Semi groups and Monoids. Generating Functions of Permutations and Combinations.( Problems and Theorems without proofs) Trees.com w.2010 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY. Algorithms for Spanning trees and Minimum Spanning Tree. Modular Arithmetic ( Fermat’s Theorem and Euler ‘s Theorem) Mathematical Induction: Principle of Mathematical Induction. Euler’s Formula.jntuworld. Tautological Implications. Indirect Method of Proof. Hasse Diagrams.f. Division Theorem. Binary Trees.exercises UNIT III:Set Theory: Introduction. (IT) I.com . I. Functions: Bijective Functions. Pigeonhole Principle and its Application. Variables and Quantifiers. Truth Tables. UNIT II :Number Theory & Induction: Properties of integers. Compatibility and Partial Ordering Relations. Spanning Trees: Properties. Properties of Binary operations. Testing for Prime Numbers. Least Common Multiple. Algebraic Systems with one Binary Operation. Recursive Functions UNIT IV:Graph Theory: Basic Concepts of Graphs. Free & Bound Variables. (Common with II B.www. Calculating Coefficient of Generating Functions www. KAKINADA II B. Subgroups ( Definitions and Examples of all Structures) Algebraic Systems with two Binary Operations: Rings J T N W U R O D L UNIT VII: Combinatorics: Basic of Counting. Combinations. (CSE)) UNIT I:Mathematical Logic : Propositional Calculus: Statements and Notations. Multigraphs. Incidence Matrices. Partial Fractions. Predicate calculus: Predicative Logic. Cosets. Matrix Representation of Graphs: Adjacency Matrices. Operations on Relations. Composition of Functions.

(CSE)) Recurrence Relations. Manohar. Kandel.Macmillan J T N W U R O D L www. (IT) I. Thomas Koshy. Discrete Mathematical Structures with Applications to Computer Science.jntuworld. PHI REFERENCE BOOKS: 1. & II Sem. Mott.jntuworld. Formulation as Recurrence Relations.com . I. Solving Inhomogeneous Recurrence Relations TEXT BOOKS : 1.2/e. Discrete Mathematics with Applications. S. Discrete Mathematics for Computer Scientists & Mathematicians.com w. 2/e.e. Tremblay.f. KAKINADA II B. Discrete Mathematics. generating functions and The Method of Characteristic Roots. Elsevier 3. Solving linear homogeneous recurrence Relations by substitution. TMH 2.Tech.www. Cengage 2.Sem. JK Sharma . Baker.Tech.2010 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY.Sem. (Common with II B.Santha. Discrete Mathematics.

Multiplexers. I. Truth Tables and Excitation Tables.Level Minimization: Karnaugh Map Method (K-Map): Minimization Of Boolean Functions Using 4 Variable . Binary Multiplier. Bidirectional Shift Registers. AND. Programming Tables of PLA. PAL and PROM. Ripple Adders and Subtractors. UNIT VII: Introduction to Sequential Logic Circuits: Classification. T and D Flip Flops. Synchronous Counters and Variable Modulus Counters. Ring Counter. Ripple Adder/Subtractor Using Ones and Twos Complement Method. Control Buffer Registers. (CSE)) 2. TEXT BOOKS : 1. Fundamentals of Logic Design. JK. Conversion of Flip Flops. Roth. Universal Gates. OR. PAL. Signed Binary Numbers.4 DIGITAL LOGIC DESIGN UNIT I : Number Systems: Binary. Introduction to Verilog HDL and Verilog programming for minimized logic functions. (IT) I. Complement. Full Adder. Full Subtractor. Design of Ripple Counters.POS. Buffer Register. Weighted and Non-weighted codes UNIT II: Logic Gates and Boolean Algebra: Basic Gates: NOT. Decimal. Verilog Programming for above Circuits. Realization of Switching Functions Using PROM.Latch using NAND and NOR Gates and their Truth Tables.com . Parity Checking. 5/e. Verilog Programming for above Circuits.e. Hexadecimal Number Systems. Encoders. Michael D Ciletti. Verilog Programming for above Circuits. Digital Design . UNIT VIII:Registers and Counters: Design of Registers.Tech. Realization Of Boolean Functions Using Decoders and Multiplexers. Duality principal. Problems.com w.jntuworld. Serial Adder. Multilevel Realization Of Logic Functions using Universal Gates. r’s Complement and (r-1)’s Complement Subtraction Of Unsigned Numbers. Johnson Counter. UNIT V: Combinational Logic Circuits: Design of Decoders. Comparison of PLA.www. Magnitude Comparator. Generating Circuits. POS and SOP Simplifications with Don’t Care Conditions using K-Map. Basic Sequential Logic Circuits: Latch and Flip-Flop. & II Sem. Higher Order Demultiplexers and Multiplexers. Boolean Theorems.4/e. PAL and PROM. M. KAKINADA II B.jntuworld. Universal Shift Register. UNIT IV: Combinational Arithmetic Logic Circuits: Design Of Half Adder. PROM. Ex-OR and ExNOR Gates.f. Demultiplexers.Tech. Half Subtractor.Sem. Cengage J T N W U R O D L www. PAL and PLA. Verilog Programs for Simplified Expressions.1. Octal. SOP. RS. Conversion Of Numbers from One Radix to another Radix . RS. Carry Look Ahead Adder. UNIT VI:Programmable Logic Devices: PLA. Verilog Programming for above Circuits. Priority Encoders. PEA 2.Morris Mano. Flip Flops With Asynchronous Inputs (Preset and Clear). Minimizations Of Logic Functions using Boolean Theorems.2010 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY. Code Converters. UNIT III: Gate .Sem. (Common with II B. 5 and 6 Variable Maps.

Cambridge.Sem. Jha.2010 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY.com w. (IT) I. (CSE)) REFERENCE BOOKS: 1. Malvino. Jaya Bhaskar. I.3/e.Kohavi. Verilog HDL primer.Tech. Saha. Leach. PEA J T N W U R O D L www.Sem. (Common with II B.com .TMH 3. & II Sem. KAKINADA II B.f.jntuworld.jntuworld. 2.Tech. Digital Logic Design.www. Switching and Finite Automata Theory.e.

Mobility and Conductivity.Tech.com w. Bias Compensation. Higher order harmonic Distortion. and Metals classification using Energy Band Diagrams. PIN Diode. Biasing the FET J T N W U R O D L UNIT VI:Feedback Amplifiers and Oscillators: Classification of Amplifiers. cascaded transistor amplifiers FET small signal model. Stabilization factors. Harmonic components in a rectifier circuit. Comparison of Transistor Amplifier configurations. Forward and Reverse Bias. Wein bridge oscillator UNIT VII:Power Amplifiers: Class A large signal Amplifiers. Low frequency common source and common drain amplifiers.jntuworld. Transistor as an amplifier. Diode Equation.www. Effect of Feedback on input and output Resistances..Sem. Current components in PN Diode. Inductor filter.Tech. I. Typical transistor junction voltage values FET Characteristics: JFET characteristics (Qualitative discussion). VoltAmpere Characteristic (Qualitative treatment only). Extrinsic Semi Conductor. UNIT II: Special Diodes : Special Diodes: Avalanche and Zener Break Down. Symbols of MOSFET. full wave rectifier(with and without transformer). Common emitter amplifier with emitter resistance.f. & II Sem.1.jntuworld. Miller’s Theorem Simplified Common Emitter hybrid model. Diffusion Capacitance and Diode Resistance (Static and Dynamic). Efficiency. and current shunt feedback amplifiers with discrete components circuits (Analysis is not required) Conditions for oscillations. Step Graded Junction. Stabilization against variations in VBE. Analysis of a Transistor Amplifier circuit using h.2010 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY. Class AB operation. Second harmonic Distortions. Energy Band Diagram of PN Diode. Emitter follower.parameters. Zener Characteristics. Temperature Dependence on V – I characteristic. Simple circuit of a regulator using zener diode. Feedback concept.e. Photo Diode Rectifiers and Filters : Half wave rectifier. (CSE)) 2. Electrons and holes in Intrinsic Semi conductors. (Common with II B. (IT) I. Characteristics of Transistor in Common Base and Common Emitter Configurations. FET as Voltage Variable Resistor. General characteristics of negative feedback amplifiers. and β for the self bias circuit. Introduction to SCR and UJT and their characteristics UNIT IV: Biasing and Thermal Stabilization : Transistor Biasing and Thermal Stabilization: Operating point. Transistor Hybrid model. RC-phase shift oscillator with Transistor and FET. Transistor current components. Self Bias. Transfer Gain with feedback. ripple factor. current series. Ico. Capacitor filter. Compensation against variation in VBE. Collector to Base Bias. MOSFET characteristics (Enhancement and depletion mode). Efficiency of Class B Amplifier www. Thermistor and Sensitor compensation. Characteristics. Push-pull amplifiers. Varactor Diode. Class B Amplifiers. Transformer Coupled Audio power amplifier. ELECTRONIC ENGINEERING UNIT I:Review of P & N type semiconductors: Insulators.5. LED. (P and N Type semiconductor) Junction Diode Characteristics and Special Diodes: Open circuited P N Junction. Photo Transistor. voltage shunt. Small signal model of JFET. Thermal runaway. Determination of h-parameters from characteristics. Voltage series. Hartley and Colpitts oscillators.Sem.. UNIT III:Transistor Characteristics: Junction transistor. Semi conductors.com . Basic Stability. KAKINADA II B. Thermal stability UNIT V:Small signal low frequency Transistor models & Single stage amplifiers: Two port devices and the Hybrid model. Tunnel Diode.

J. Electronic Devices and Circuits . Double Tuned Amplifiers.Suressh Kumar. (IT) I. A.Sem.2010 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY.C. I. Capacitance single tuned amplifier. Staggered tuned amplifiers TEXT BOOKS : 1.www.e.Tech. Halkias. 2009. TMH J T N W U R O D L www. TMH 2. Vallavaraj. N. KAKINADA II B. Jacob Millman. (Common with II B. Integrated Electronics . Halkies.jntuworld.com w. Electronic Devices and Circuits . TMH 2.Tech. VGS REFERENCE BOOKS: 1.2/e.jntuworld. Salivahanan. Electronic Devices and Circuits. Chritos C.com . Q-Factor.f. Small Signal Tuned Amplifier . Millman. K Satya Prasad. & II Sem. C. (CSE)) UNIT VIII:Tuned Amplifiers: Introduction.Sem.

Binary Trees: Properties. UNIT IV: Linked Lists: Introduction. Model for an Abstract Data Type. Towers of Hanoi. I. Double linked list UNIT V:Trees: Basic tree concepts. Representation of Binary Trees using arrays and linked lists. Representation of a Queue using array. Representation of Sets using Linked list.Sem. Graph algorithms Graph Traversals (BFS & DFS). Reversing a single linked list. m-way search trees operations: insertion . GCD computation.e.f.deletion. merging two single linked lists into one list. Algorithm analysis and complexity. Operations on a single linked list. Threaded Binary Trees. balanced binary trees AVL Search Trees basic concepts .1.Recursion: Definition.jntuworld.com w. www. Priority Queues. Representation of a Stack using Arrays. application of setsInformation storage using bit strings Abstract Data Type Introduction to abstraction.www. Binary Tree Traversals. Creation of binary tree from in-order and pre(post)order traversals. Linear and binary recursion. Sorting by : insertion (Insertion sort).com . Queues: Basic Queues Operations. BST operations:insertion. Unit VIII: Sets: Definition. applications of single linked list to represent polynomial expressions and sparse matrix manipulation. Evaluating Arithmetic Expressions. UNIT VI: Advanced concepts of Trees: Binary search tree. Dequeue.Sem. Circular linked list. Binary Search. Transitive closure. ADT Operations. operations on a Binary tree . B Trees.deletion. Analyzing search algorithms. operations of sets using linked lists. ADT Implementation of array. Circular Queues. ADT Data Structure. representation of a linked list in memory. applications: Dijkstra’s shortest path. Advantages and disadvantages of single linked list.Tech. exchange (bubble sort. KAKINADA II B. DATA STRUCTURES UNIT I: Recursion and Linear Search: Preliminaries of algorithm. Linked list and stack. Tail recursion List Searches using Linear Search.to postfix Transformation. UNIT III:Stacks and Queues: Basic Stack Operations. operations:insertion . UNIT II: Sorting Techniques: Basic concepts. Implementation of Queue Operations using Stack. quick sort). Applications of Queues-Round robin Algorithm. & II Sem. warshall’s Algorithm. deletion J T N W U R O D L UNIT VII:Graphs: Basic concepts.Tech. operations: insertion . single linked list. Fibonacci sequence. Stack Applications: Reversing list. Factorial Calculation. Design Methodology and Implementation of recursive algorithms. Minimum Spanning Tree using Prim’s Algorithm. deletion. Enqueue. recursive algorithms for factorial function. In-fix.2010 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY. (IT) I. Basic concepts.6. (CSE)) 2. selection (heap sort). distribution (radix sort ) and merging (merge sort ) Algorithms. Fibonacci Search.jntuworld. Tree Travels using stack. Representations of Graphs: using Linked list and adjacency matrix. (Common with II B.

Tech.2009 3. Fundamentals of Data Structure in C. Anderson Freed. Data Structures. & II Sem.2010 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY. (IT) I. Seymour Lipschutz. (CSE)) TEXT BOOKS: 1. Forouzan. TMH REFERENCE BOOKS: 1.V. Cengage 2.jntuworld. Debasis .Sem. 2008.Pai.University Prees J T N W U R O D L www.jntuworld.A.com w.Sahni. I. TMH 2. G. Horowitz.Samanta. 2/e.f. Richard F. Classic Data Structures.Sem. (Common with II B.PHI. 2/e. Data Structure with C.com . KAKINADA II B.e. Data Structures and Algorithms. 2/e.www.Tech. Gilberg .

RC Phase Shift Oscillator using Transistors 14. Identification. I. RC Phase Shift Oscillator PART C: Equipment required for Laboratories: 1. 0-50µA. KAKINADA II B.diodes. Study and operation of • Multimeters (Analog and Digital) • Function Generator • Regulated Power Supplies . Forward bias B.7 Electronic Engineering Lab PART A : (Only for viva voce Examination) ELECTRONIC WORKSHOP PRACTICE ( in 6 lab sessions) : 1. 2. BJTs. (Common with II B. Zener diode characteristics and Zener as a regulator 3. UJT. Identification.2010 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY. Potentiometers. FET characteristics 8. 3. Electronic Components . 0-100µA. Lowpower JFETs. UJT Charectristics 10. Testing of R. & II Sem. SCR Charecteristics 9. Single stage R-C coupled Amplifier.com w.1. 12.Sem.( cut-in voltage & Resistance calculations) 2.transistors J T N W U R O D L www. Voltmeters (Analog or Digital) 0-50V.SCRs. (IT) I. PART B : (For Laboratory examination – Minimum of 10 experiments) 1. Study and Operation of CRO. Decade Capacitance Boxes 7.Tech. Transistor CE characteristics (Input and Output) & h Parameter calculations 5.Sem.www. Decade Resitance Boxes/Rheostats 6. Transistor CB characteristics (Input and Output) & h Parameter calculations 4. Linear and Digital ICs. CE Amplifier 11.jntuworld. PN Junction diode characteristics A. Gang Condensers. (CSE)) 2. LEDs. Wien Bridge Oscillator 16. CROs 0-20M Hz. 0-250V 9. 13. BJTs. L. Coils. Soldering practice – Simple Circuits using active and passive components. LEDs. C Components (Colour Codes). SCR. MOSFETs. 3. Reverse bias.jntuworld. Specifications. Relays. Bread Boards.f. Rectifier without filters (Full wave & Half wave) 6. UJTs. 4.e.Tech. Rectifier with filters (Full wave & Half wave) 7. CC Amplifier (Emitter Follower). LCDs.Resistors. Micro Ammeters (Analog or Digital) 0-20 µA. FETs. Specifications and Testing of Active Devices. Regulated Power supplies (RPS) 0-30v 2. LCDs. Class A Power Amplifier (Transformer less) 15.com . 0-200µA 8. 4. Capacitors. Diodes. 0-100V. Multimeters 5. Function Generators 0-1 M Hz.

m) c) Write recursive C programe for Towers of Hanoi : N disks are to be transferred from peg S to peg D with Peg I as the intermediate peg. to sort a given list of integers in ascending order c) Write C programs that implement Insertion sort. Exercise 4: a) Write C programs that implement Bubble sort. & II Sem. J T N W U R O D L www. for appropriate values of n.Tech.com . Exercise 2: Write recursive programme for the following a) Write recursive C programe for calculation of Factorial of an integer b) Write recursive C programe for calculation of GCD (n.e. (Common with II B. (CSE)) 2. to sort a given list of integers in ascending order e) Write C programs that implement merge sort.Sem.jntuworld. c) Write C programs that use both recursive and non recursive functions to perform Fibonacci search for a Key value in a given list.f. to sort a given list of integers in ascending order b) Write C programs that implement Quick sort. I.Sem.1.com w.Tech. (IT) I. to sort a given list of integers in ascending order Exercise 6: a) Write C programs that implement stack (its operations) using arrays b) Write C programs that implement stack (its operations) using Linked list Exercise 7: a) Write a C program that uses Stack operations to Convert infix expression into postfix expression a) Write C programs that implement Queue (its operations) using arrays. Analyze behavior of the programme Obtain the frequency count of the statement for various values of n. KAKINADA II B.8 DATA STRUCTURES LAB Exercise 1: Write recursive programme which computes the nth Fibonacci number.2010 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY. to sort a given list of integers in ascending order d) Write C programs that implement radix sort.jntuworld. Exercise 3: a) Write C programs that use both recursive and non recursive functions to perform Linear search for a Key value in a given list.to sort a given list of integers in ascending order Exercise 5: Write C programs that implement heap sort.www. b) Write C programs that use both recursive and non recursive functions to perform Binary search for a Key value in a given list.

for Traversing a binary tree in preorder. Write a non recursive C program.jntuworld.www.e.com .jntuworld.com w. (CSE)) b) Write C programs that implement Queue (its operations) using linked lists Exercise 8: a) Write a C program that uses functions to create a singly linked list b) Write a C program that uses functions to perform insertion operation on a singly linked list c) Write a C program that uses functions to perform deletion operation on a singly linked list Exercise 9: d) e) f) g) h) Adding two large integers which are represented in linked list fashion. Write a C programme to representation the given Sparse matrix using linked list Exercise10: a) b) c) d) Write a C program to Create a Binary Tree of integers Write a recursive C program. Write a C programme to reverse elements of a single linked list. KAKINADA II B. Exercise 12: a) Write a C programme b) Write a C programme J T N W U R O D L to compute the shortest path of a graph using Dijkstra’s algorithm to find the minimum spanning tree using Warshall’s Algorithm www.Tech. (IT) I. Program to check balance property of a tree. (Common with II B.Sem.Sem. Exercise 11: a) Write a C program to Create a BST b) Write a C programme to insert a note into a BST. inorder and postorder. c) Write a C programme to delete a note from a BST. I.2010 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY. Write a C programme to store a polynomial expression in memory using linked list Write a C programme to representation the given Sparse matrix using arrays.Tech. inorder and postorder. for Traversing a binary tree in preorder.f. & II Sem.

Free-Space Path Loss. Metallic Transmission Line Types. Optical Fiber construction. Multiplexing and Carriers : Time. standards organizations for Data Communication. Companding. Analog Modulation Systems. Optical Properties of Radio Waves. Open Systems Interconnection. Digital Line Encoding. PCM Line Speed. Frame Synchronization.Division Multiplexing. (IT) I. Terrestrial Propagation of Electromagnetic Waves. UNIT V : Telephone Instruments And Signals: The Subscriber Loop. Information Capacity.Sem.Division Multiplexing.com .1 DATA COMMUNICATIONS UNIT I : Fundamentals Of Data Communication: Data Communication Network Architecture. Paging systems. UNIT VI : Cellular Telephone Concepts And Systems: J T N W U R O D L www. Metallic Transmission Line losses . Skip Distance. Frequency. Caller ID. THE TELEPHONE CIRCUIT: The Local Subscriber Loop. Layered Network Architecture. (CSE)) 2. Satellite Communications Systems. Rays and Wave fronts. Wave Attenuation and Absorption. Cordless Telephones. Electronic Telephones. Transverse Electromagnetic Waves.f. Signal Voltage–to-Quantization Noise Voltage Ratio.2010 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY. Standard Telephone Set. Data Communication circuits.Tech. I. Wave Propagation on Metallic Transmission Lines. Transmission Line Classifications. Baud.e. Wavelength.2. Electromagnetic spectrum. Telephone Message-Channel Noise and Noise Weighting. and M-ary Encoding.jntuworld. Microwave Communications Systems. Basic Telephone Call Procedures. Bits. Crosstalk.Tech. Losses in Optical Fiber Cables. UNIT III : Digital Transmission : Pulse Modulation. Statistical Time – Division Multiplexing. Propagation of Light Through an Optical fiber Cable.Division Multiplexing.www. T Carrier systems. Electrical Noise and Signal-to-Noise Ratio. MODULATION. (Common with II B. Delta Modulation PCM Differential PCM. Units of Powers Measurement.Sem. Data communications Circuit Arrangements. UNIT IV : Wirless Communications Systems : Electromagnetic Polarization. Optical Fiber Communications System Block Diagram. OPTICAL FIBER TRANSMISSION MEDIA : Advantages and Disadvantages of Optical Fiber Cables. Characteristics of Electromagnetic Waves. Electromagnetic Radiation. Call Progress Tones and Signals. T1 Digital Carrier System. & II Sem. Spherical Wave front and the Inverse Square Law. Linear Versus Nonlinear PCM Codes. Optical Fiber Modes and Classifications.com w. Protocols and standards. Serial and parallel Data Transmission. Optical Fiber Comparison. KAKINADA II B. Bit Rate. Pulse code Modulation. AND DEMODULATION : Signal Analysis. Data communications Networks. SIGNALS. Digital Modulation. The Physics of Light. Velocity of Propagation.jntuworld. UNIT II : Metallic Cable Transmission Media : Metallic Transmission Lines. NOISE. Transmission Parameters and Private-Line Circuits .

PHI. Call Processing. Introduction to Data Communications and Networking. Cellular System Topology. (CSE)) Mobile Telephone service. REFERENCE BOOKS: 1. Global System for Mobile Communications.Sem. Voice-Band Data Communication Modems. Error Control. Cellular Telephone. (IT) I. Sectoring. (Common with II B. Data and computer Communications.f. Voice-Band Modern Block Diagram. William Stallings. TMH.com w. 2.Tech. 4/e. Behrouz A Forouzan. First Generation Analog Cellular Telephone. Data Communications and Networking. Second Generation Cellular Telephone Systems. Modem Synchronization. Synchronous Voice-Band Modems. Frequency Reuse. Gilbert Held. Bar Codes. Understanding Data Communications .jntuworld. Error Correction. Segmentation and Dualization. UNIT VIII: Data Communications Equipment: Digital Service Unit and Channel Service Unit. UNIT VII: Data Communications Codes. PEA. Cable Modems. Character Synchronization. Wayne Tomasi.jntuworld.com . 8/e.e. and Data Formats: Data Communications Character Codes.www. 3/e. KAKINADA II B. Asynchronous Voice-Band Modems. Personal Communications system. Network Components. I. Digital Cellular Telephone . Cell Splitting. Bell SystemsCompatible Voice-Band Modems.7/e. Error Detection. Error Control. ITU-T VoiceBand Modem and 56K Modems. Voice-Band Modem Classifications.2010 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY. TEXT BOOKS: 1.Tech. 3. & II Sem. PEA J T N W U R O D L www.Sem. Interference. Roaming and handoff.

Sets. (IT) I. The Binding of Referencing Environments. Events Concurrency: Concurrent Programming Fundamentals. (CSE)) 2. Records (Structures) and Variants (Unions). Message Passing Run-time Program Management: Late Binding of Machine Code. Attribute Grammars. Higher-Order Functions. Inspection/Introspection J T N W U R O D L UNIT VII: Data Abstraction and Object Orientation: Object-Oriented Programming.jntuworld. Equality Testing and Assignment UNIT VI: Subroutines and Control Abstraction: Review of Stack Layout. Logic Programming in Perspective www. I. Iteration. Space Management for Attributes. The Meaning of Names within a Scope. Selection. Pointers and Recursive Types. Evaluation Order Revisited. Theoretical Foundations Logic Languages: Logic Programming Concepts. Implementing Scope. Strings. and Bindings: The Notion of Binding Time. Arrays. Sequencing.e. & II Sem. Decorating a Syntax Tree UNIT IV: Control Flow: Expression Evaluation. Files and Input/ Output. Object Lifetime and Storage Management.Sem. Multiple Inheritance UNIT VIII: Functional Languages: Functional Programming Concepts. (Common with II B.Sem.jntuworld. Theoretical Foundations.Tech. Scanning. Scope Rules. Overview of Compilation Programming Language Syntax: Specifying Syntax: Regular Expressions and Context-Free Grammars. Language-Level Mechanisms. Separate Compilation UNIT III: Semantic Analysis: The Role of the Semantic Analyzer. Exception Handling.2 PRINCIPLES OF PROGRAMMING LANGUAGES (Common with CSE) UNIT I: Introduction: The Art of Language Design. Parsing. Calling Sequences. Encapsulation and Inheritance. Prolog. Generic Subroutines and Modules. Why Study Programming Languages? Compilation and Interpretation. Action Routines. Dynamic Method Binding. Coroutines.www. Implementing Synchronization. Parameter Passing. Lists.Tech. Theoretical Foundations UNIT II: Names.f.com . Scopes. Type Checking. Programming Environments.2.2010 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY. Evaluating Attributes. KAKINADA II B. Programming Language Spectrum.com w. Structured and Unstructured Flow. Macro Expansion. Non determinacy UNIT V: Data Types: Type Systems. A Review/Overview of Scheme. Initialization and Finalization. Recursion.

Fundamentals of Programming languages. Concepts of Programming languages.jntuworld. Morgan Kaufmann. Programming Languages Design and Implementation .com w. Elsevier. 4/e Pratt . 8/ e. Sebesta. Zelkowitz.Louden.Sem.Sem.2010 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY.Tech.jntuworld. Cengage. 2 /e. PEA REFERENCE BOOKS: 1.Tech. PHI 2. Programming Language Pragmatics. (IT) I. Michael Scott.e.2009 2. Programming Languages .www. & II Sem. 3/ e. I. (Common with II B.com . Galgotia J T N W U R O D L www. KAKINADA II B. Horowitz.2003 3. (CSE)) TEXT BOOKS: 1.f.

Trees. Event sources. types of applets. Creating and Accessing a Package. UNIT VII: Event Hand. operators.Tech. secure applet. Delegation event model. defining an interface. and Tables. implementing interface. classes and objects – concepts of classes. polymorphism. A way of viewing world – Agents. exploring swing. throw. handling mouse and keyboard events.2. Scroll Panes. summary of oop concepts. inner classes. methods. check box groups. Check boxes. (IT) I. dialogs. limitation. access control. choices. creating own exception sub classes. coping with complexity. type conversion and costing. methods. abstract classes. Applet to applet communication. parameter passing. garbage collection. Differences between multi threading and multitasking. variables. combination.com . check box.Tech.2010 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY. grid. (Common with II B. life cycle of an applet. Event Listeners. creating threads. benefits of exception handling. text components. extension. objects. card and grid bag. layout manager – layout manager types – boarder. constructors. UNIT II: Java Basics: Data types. user interface components. exception hierarchy. I. scrollbars.Sem. Member access rules. scope and life time of variables.com w. usage of try.ling: Events. costs of inheritance. benefits of inheritance. importing packages. lists panels – scrollpane. Termination or presumptive models. variables in interface and extending interfaces. arrays. differences between classes and interfaces.jntuworld. UNIT IV: Packages and Interfaces: Defining. Understanding CLASSPATH.JApplet. MVC architecture. simple java program. messages. applying interfaces. Combo boxes. subclass. catch.labels. Icons and Labels. string handling.f. Radio buttons.Sem. graphics. limitations of AWT. canvas. button. UNIT III: Inheritance: Hierarchical abstractions. Tabbed Panes. daemon threads. (CSE)) 2. substitutability. text fields. Event classes. super uses. overriding and exceptions. differences between applets and applications. JFrame and JComponent. construction. flow. expressions. Base class object. control statements. components. recursion. UNIT VI: Applets: Concepts of Applets. thread groups.jntuworld. abstraction mechanisms. overloading methods and constructors. & II Sem. this keyword. creating applets. Adapter classes.specialization. throws and finally.www. built in exceptions. passing parameters to applets. specification. UNIT VIII: Swings: Introduction. containers. synchronizing threads. class hierarchies (Inheritance).e. UNIT V: Exception handling and Multithreading: Concepts of exception handling. KAKINADA II B. classes and instances. subtype. thread life cycle. forms of inheritance. using final with inheritance. J T N W U R O D L www. method binding. responsibility. The AWT class hierarchy. menubar.3 OBJECT ORIENTED PROGRAMMING THROUGH JAVA (Common with CSE) UNIT I: Basics of Object Oriented Programming (OOP): Need for OO paradigm. buttons – The JButton class.

S.e. Java: The complete reference. E V Prasad. Dietal. Chand 2. Venkateswarlu.com . Learn Object Oriented Programming using Java.jntuworld. (IT) I. Radha Krishna. TMH. Java: How to Program.www.f.jntuworld. PHI REFERENCE BOOKS: 1. Object Oriented Programming through Java. & II Sem. P. JAICO Publishing house 3. Dietal.Sem. (CSE)) TEXT BOOKS: 1. University Press. J T N W U R O D L www.Sem. Herbert schildt. 2.Tech.2010 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY. Programming in Java2.com w.Tech. 8/e. (Common with II B. Dr K SomaSundaram. I. KAKINADA II B. 7/e.

Tech. Control of the Processor. 8085 Architecture . 2. Designing for performance . cache memory principles . Computer Systems Architecture and Organization. PCI Configuration. Symmetric Multiprocessors. Carl Hamacher. computer components. (CSE)) 2.www. Approaches to Vector Computation. Concepts of Multithread and Approaches to explicit multi threading. Dealing with Branches. Micro Instruction Execution. Processor Organization. I/O modules. ALU. Physical characteristics of disk systems. REFERENCE BOOKS: 1. SRAM. Nanoprogramming.com w. concepts of partitioning. Carpinelli. TMH. virtual memory.e.f. & II Sem.2010 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY.Sem.jntuworld. paging. Computer functions.Evolution of Intel x86 Architecture. (IT) I. RISC Architecture UNIT IV: Processor Control Unit: Micro-Operations. hardwired Implementation UNIT V: Micro Program Control: Micro Instruction Sequencing. instruction programming. bus inter connection. (Common with II B. I. TMH J T N W U R O D L set and assembly language www. I/o addressing. KAKINADA II B. compact disk. and segmentation.3/e. memory hierarchy. Zvonko Vranesic. Computer Organization and Architecture. register organization. 8/e. DRAM. Hayes. 8086 Processor Family. PHI. PEA 3. Computer Architecture and Organization.jntuworld. Nonuniform Memory Access. Concepts of Multicore Computers.Elements of cache Design. large Register Files. 5/e. Reduced Instruction Set Computers : Instruction Execution Characteristics.4 COMPUTER ORGANIZATION AND ARCHITECTURE UNIT I: A Brief History of Computers: Von Neumann Machine. Computer Organization. Interrupt driven I/O. William Stalling. John D. DRAM organization. 8086 addressing Modes. Instruction Formats. UNIT II: Machine Instruction set: Addressing Modes.Tech. UNIT VI: Internal Memory: Semiconductor main memory.2.Sem. floating point Adders/ Subtracters. Taxonomy of Micro Instructions. instruction cycle. demand paging. Safwat Zaky. 8086 Multicore Organization TEXT BOOKS: 1. DMA. UNIT III: Instruction pipelining: Pipelining Hazards. UNIT VIII: Parallel Processing: Multiple Processors. Cache Coherence. programmed I/O. 2’complemented multiplication(Booth’s Algorithm) and division. I/O channel and processors. UNIT VII: Input/ Output: External devices. Cache organization. John P. Magnetic disk.com .Types of ROMs.

2010 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY. OR and NOT. Hash Based Indexing :Tree base Indexing .www. Serializability. reasoning about FDS. Aggregative Operators. UNIT III : Introduction to the Relational Model: Integrity Constraint Over relations .jntuworld. Problem related to decomposition .2.Other Models. Impact on SQL Constructs . Schema refinement in Data base Design. Relational Algebra: Selection and projection set operations .Tech.Transaction Management . SECOND.Tech. Comparison using Null values. I. UNIT VI : Transaction Concept: Transaction State. Decompositions . Storage Manager. UNIT VIII : Tree Structured Indexing : Intuitions for tree Indexes.Recovery and Atomicity. UNIT VII : Storage and Indexing : Data on External Storage . Recoverability . Concept Design with the ER Model . Introduction to Nested Queries . Indexed Sequential Access Methods (ISAM) B+ Trees: A Dynamic Index Structure.Correlated Nested Queries Set . Relational Model . View of Data. Primary and Secondary Indexes . database Access for applications Programs . Failure classification.Sem. data base System VS file System. renaming. THIRD Normal forms. nstances and Schemas. UNIT V : Schema Refinement : Problems Caused by redundancy. Complex Integrity Constraints in SQL Triggers and Active Data bases.Storage. Logical connectivity’s.Comparison Operators. KAKINADA II B. BCNF . Testing for serializability. File Organization and Indexing.data base Users and Administrator .5 DATABASE MANAGEMENT SYSTEMS (Common with CSE) UNIT I : Introduction: Data base System Applications. NULL values .Sem.f. the ER Model. Cluster Indexes. DML. Data Abstraction.Logical data base Design . Joins . Outer Joins. Attributes and Entity sets. Introduction to Views . Relationships and Relationship sets.Concurrent Executions.Conceptual Design for Large enterprises. (Common with II B. the Query Processor UNIT II : History of Data base Systems: Data base design and ER diagrams. (CSE)) 2. Division . J T N W U R O D L www. Destroying /altering Tables and Views. Examples of Algebra overviews Relational calculus: Tuple relational Calculus UNIT IV : Form of Basic SQL Query: Examples of Basic SQL Queries. Enforcing Integrity constraints . data Models.Implementation of Atomicity and Durability.Comparison of File Organizations .Dependency preserving Decomposition. AND.Recovery algorithm.data base System Structure .Database Languages : DDL. Additional features of ER Model.Implementation of Isolation. Multi valued Dependencies.jntuworld.Lossless join Decomposition . Disallowing NULL values. FIRST. (IT) I. Querying relational data . FORTH Normal Form. & II Sem. Beyond ER Design Entities.com . Index data Structures .Indexes and Performance Tuning.e.com w.

Introduction to Database Systems.J. 5/e.Tech.PEA 2.www. Raghurama Krishnan.Coronel.jntuworld.com w.5/e. Data base Management System.com . 3/e. (CSE)) TEXT BOOKS: 1.Date. (Common with II B. Database System Concepts. (IT) I. 8/e. PEA 3. Korth.2010 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY.e. Silberschatz. Data base Management Systems. Elmasri Navathe . TMH 2. & II Sem. Ceneage. TMH REFERENCE BOOKS: 1. Peter ROB.Sem. C. J T N W U R O D L www. Johannes Gehrke.Tech.Sem. Data base System Concepts.jntuworld. I. KAKINADA II B.f.

jntuworld. optimization of basic blocks. type conversions. 3/e. Aho. Mishra. S-attributed and L-attributed grammars.www. Theory of Computer Science. Handle pruning. J T N W U R O D L TEXT BOOKS: 1. Storage Allocation Strategies.Sem. UNIT IV: Syntax Directed Translation: Definitions. Type checking. SLR (1) Parser.Tech.com w. UNIT III: Bottom up parsing: Rightmost Parsers: Shift Reduce Parser. Parameter Passing. Principles of Compiler Design.jntuworld. UNIT VII: Code Optimization: Issues in the design of code optimization. Auerbach Publications.Meduna. Yacc Programming Specifications.e. www. DAG representation of basic Blocks. I.V. Ullman. A. 2/e. Techniques and Tools. Taylor and Francis Group. Chandra Shekaran. Generating code from DAGs. UNIT II: Context Free grammars and parsing: Context free Grammars. Applications of Finite Automata to lexical analysis. Conversion of regular expression to NFA. (CSE)) 2. Storage Allocation.f.2010 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY. Machine Dependent Code Generation. (Common with II B.Ullman.2. PEA 2. flow graphs. Leftmost Derivations. (IT) I.Tech. A. Data flow analysis of flow graphs. languages associated with (re). Access to Nonlocal Names. translation of simple statements and control flow statements. abstract syntax tree. operations on languages. J. equivalence of type expressions. Creating LR (0) Parser. Register allocation and assignment. Identity rules for (re). Ambiguity Grammars. NFA. Intermediate code generation. lex tools. overloading of functions and operators.6 AUTOMATA and COMPILER DESIGN UNIT I: Formal Language and Regular Expressions: Languages. Rightmost Derivations.Sem. LR (1) & LALR (1) Parsers. PEA REFERENCE BOOKS: 1. Polymorphic functions. Ravi Sethi. regular expressions (re). Compilers Principles. Chomsky hierarchy of languages and recognizers. Handles. PEA 2.D. & II Sem. Loop optimization. Hopcroft. Aho . Recursive Descent Parsers: LL(K) Parsers and LL(1) Parsers. Ambiguous Grammars. UNIT VI: Storage Organization: Storage language Issues. Automata languages and computation . generic code generation algorithm. operations on (re).com . NFA to DFA. Scope. Parse Trees. Ullman. Top-Down Parsing. Principal sources of optimization. Introduction to Automata Theory Languages & Computation. KAKINADA II B. PHI 3. peephole optimization. Elements of Compiler Design. Parser Hierarchy. object code forms. UNIT VIII: Code Generation: Issues in the design of code Generation. construction of Syntax Trees. Dynamics Storage Allocation Techniques. Finite Automata: DFA. UNIT V: Semantic Analysis: Semantic Errors.

Create an array of Rodent. 5. Add a text field to display the result.e. WAJP that implements a simple client/server application. 10. (Repeat the same by implementing Runnable) 26.7 Object Oriented Programming Lab 1. & II Sem. 19. uses it to produce a result and then sends the result back to the client. if compatible multiply two matrices and find its transpose. WAJP to create and demonstrate packages. WAJP that illustrates how runtime polymorphism is achieved. WAJP that checks whether a given string is a palindrome or not. Every subsequent value is the sum of the 2 values preceding it. The client displays the result on the console.Tech. whether the file is readable/writable. throws).com . Windows or Unix. Mouse. Gerbil. Write A Java Program (WAJP) that uses both recursive and non-recursive functions to print the nth value of the Fibonacci sequence. J T N W U R O D L www.com w. that contains the number of sides in the given geometrical figure.2. and to fix the precision. Use a grid layout to arrange buttons for the digits and for the + . Hamster etc. WAJP that allows user to draw lines.jntuworld. 20. WAJP that prompts the user for an integer and then prints out all the prime numbers up to that Integer. 12. and x1>0. 15. (IT) I.f. KAKINADA II B. (Common with II B. Use JDK 1. The Fibonacci sequence is defined by the following rule. WAJP that reads on file name from the user then displays information about whether the file exists. fill it with different specific types of Rodents and call your base class methods. WAJP to demonstrate wrapper classes.5 or above on any platform e. WAJP that lets users create Pie charts. The client sends data to a server. The server receives the data.Sem. Provide three classes named Trapezoid. 3. such that each one of the classes contains only the method numberOfSides().jntuworld. WAJP for sorting a given list of names in ascending order. 25. 13. WAJP for handling mouse events.Sem. For ex: The data sent from the client is the radius of a circle and the result produced by the server is the area of the circle. 8. depending on the specific type of Rodent. WAJP to implement a Queue. 18. Student is expected to complete any 16 programs. WAJP to check the compatibility for multiplication. Design your own user interface (with Swings & AWT). 23. WAJP to generate a set of random numbers between two numbers x1 and x2. 21.www. 4. 22. 6. using StringTokenizer class. I. 1. 9. rectangles and ovals. 7.g. WAJP that correctly implements Producer-Consumer problem using the concept of Inter Thread Communication. lines and words in a text/text file. the type of file and the length of the file in bytes and display the content of the using FileInputStream class. Ex: MALAYALAM is a palindrome. First thread displays “Good Morning” every 1 sec. that contains an empty method named numberOfSides().x / % operations. 17. 11. which reads a line of integers and then displays each integer and the sum of all integers. WAJP that displays the number of characters. the second thread displays “Hello” every 2 seconds and the third displays “Welcome” every 3 seconds. Triangle andHexagon. 16.2010 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY. The first 2 values in the sequence are 1. WAJP demonstrating the life cycle of a thread. using user defined Exception Handling (also make use of throw. (CSE)) 2. In the base class provide methods that are common to all Rodents and override these in the derived classes to perform different behaviors.Tech. Write an Applet that displays the content of a file. 24. 14. Create an inheritance hierarchy of Rodent. 2. WAJP that creates 3 threads by extending Thread class. WAJP. WAJP to create an abstract class named Shape. WAJP that works as a simple calculator.

5. partitions and locks for a particular DB. Create and manipulate various DB objects for a table. & II Sem. 3.Sem. KAKINADA II B. 18. 6. 7. J T N W U R O D L www.jntuworld. Inventory etc.jntuworld. Write PL/SQL procedure for an application using cursors. Execute a single line and group functions for a table. (Common with II B. (IT) I. 13. Library Operation. Execute DCL and TCL Commands.Tech.2. Create views. Pay roll.e.Tech.www. 15. 12. 2. I. Create table for various relation Implement the query in sql for a) insertion b) retrieval c) updation d) deletion Creating Views Writing Assertion Writing Triggers Implementing operation on relation using PL/SQL Creating Forms Generating Reports Typical Applications – Banking. Insurance. 10. Write a PL/SQL block for transaction operations of a typical application using package. 8.8 Data Base Management Systems Lab 1. Write a PL/SQL block for transaction operations of a typical application using triggers. 17.f.Sem. (CSE)) 2. 14. 4. 16. Electricity Billing. Write a DBMS program to prepare reports for an application using functions.com . 11. Write PL/SQL procedure for an application using exception handling.com w. 9.2010 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY. Design and develop an application using any front end and back end tool (make use of ER diagram and DFD).

- B. TECH.(Computer Engineering) Part -III(Semester v & VI) (Batch 2010)Uploaded byRajan Goyal
- Parser Generation in Perl - An Overview and Available ToolsUploaded byJustin Foster
- Let’s build a compilerUploaded byMíla Kuchta
- Audio Level MeterUploaded bykrishnayahoo
- POSTER L&CUploaded byAbcdef
- An Arificial Neural Network Based Software Re-Engineering Tool for Extracting ObjectsUploaded byPrasanna Venkatesh
- iPad App - Issue #88 AttachmentUploaded byGauravPushkarna
- 6th semUploaded byAjeet Kumar
- cse syllabus_R07Uploaded byynpawan3715
- Crafting an Interpreter Part 2 - The Calc0 Toy Language - VROSNET - CodeProjectUploaded byAntony Ingram
- lexpcfgsUploaded byduyanh92
- MCA 5th Semester (2)Uploaded bykhemchandsahu
- Soe and Syllabus Et Engg 3-8 SemesterUploaded bySamatha Rao K
- Learning Outcome CompilerUploaded bySandeep K. Budhani
- pjhe_dsn2016Uploaded byVBuga84
- Power Amps 5Uploaded byJacobo Palmeiro Jaramillo
- Lab 2 IOR and CUploaded byBonifacio Allysa
- The xparse package. Generic document command parserUploaded byDrAndrei
- AD5260_5262Uploaded byDHIREN
- Data cleansing lectureUploaded byharshilsurti
- EE305Uploaded byapi-3853441
- AB 03 Charakterystyki Tranzystora CB PNPUploaded byilesh22
- Cs1352 Compiler DesignUploaded byKusuma Saddala
- EEE312EXP16Uploaded byYavuz Kaplan
- An Exact Expression for the Thermal Variation of the Emitter Base Voltage of Bipolar TransistorsUploaded byAbhimanyu Ravindranath
- top down parserUploaded bynamokar_bb
- sensores sensoreUploaded byBrayan Quintero
- Ice Complete Syllabus All 8 Sems (1)Uploaded byrohitrana982007
- STATA y la VARIABLESUploaded byjuchama4256
- 2017-18 M.sc. Electronics Part-IUploaded bysonawaneulhas292