JNTU-HYDERABADB. TECH (R09) Computer Science & Engineering (2-1 Syllabus) Computer Science & Engineering Code Subject 53009 Electronic Devices & Circuits 53014 Probability and Statistics Mathematical Foundations of Computer 53022 Science 53023 Data Structures through C++ 53024 Digital Logic Design 53025 Basic Electrical Engineering 53608 Electrical and Electronics Lab 53609 Data Structures Lab through C++ Regulation: R09 Year: II Semester: I Internal External Total Credits 25 75 100 4 25 75 100 3 25 75 100 3 25 25 25 25 25 75 75 75 50 50 100 100 100 75 75 4 4 3 2 2 d. Voltage divider bias. Volt-Ampere Characteristics.com .section filters. Inductor filters. UNIT. symbol) �pinch of voltage. Load Line Analysis.Branch:CSE Subject Code: 53009 Regulation: R09 Year: II Semester: I ELECTRONIC DEVICES AND CIRCUITS UNIT-I p-n Junction Diode: Qualitative Theory of p-n Junction. Stabilization against variations in V BE and �. Common Drain Amplifier. CE. voltage-ampere characteristics. the DC and AC load lines. UNIT. Need for biasing . common emitter and common collector configuration. P-n Junction as a Diode. the JFET small signal model. thermal stability.II: Rectifiers and Filters : the p-n junction as a rectifier. Diode Equation. Temperature dependence of V I Characteristics. full wave rectifiers. collector feedback bias. and FET. www. Biasing FET. Uni junction Transistor.jntuworld. collector-emittor feedback bias. BTJ operation. Generalized FET Amplifier. UNIT. Comparision of BJT. configurations. UNIT. BJT symbol. Zener diode characteristics. principle of operation. UNIT-V: Small Signal Low Frequency BJT Models BJT hybrid model. determination of h-parameters from transistor characteristics. BJT specification. Comparision of CB. L SECTION filteres. composition of filters. fixed bias . Bias stability. UNIT. Ideal versus Practical � Resistance levels ( static and dynamic0 Transition and diffusion capacitances. MOSFET characteristics in enhancement and depletion modes. thermal runaway. FET as Voltage Variable Resistor. bridge rectifiers harmonic components in a rectifier circuit. Breakdown Mechanisms in semi conductor diodes. voltage regulation using zener diode. MOSFET construction. and CC amplifiers.VII: FET AMPLIFIERS : FET Common Source Amlifiere.IV: Transistor Biasing and Stabilization : Operating point. capacitor filtlers. Emitter feedback bias. half wave rectifiers. transistor current components. limits of operation . common base. Bias compensation using diodes and transistors . Diode Equivalent circuits.III: Bipolar Junction Transistor : the junction transitor. Stabilization factors.VI: Field Effect Transistor The Junction field effect transistor (construction. Analysis of a transistor amplifier circuit using h-parameters.. symbol) . principle of operation. Transistor as an amplifier. Transistor construction. S. Principle of Operation of Schottky Barrier Diode. 2009 WIPL 4. 2nd Ed. B.9th Edition. Electronic Devices and Circuits � Dr.C. and Satyabratha Jit Tata McGraw Hill. Lal Kishore.Millman. a vallavaraj 2008 TMH. Integrated electronics � J. 2005. Millman�s Electronic Devices and Circuits � J.2006. TMH 2. varsha agarwal . C.Millman and Christos c halkias 1991. Boylestad and Louis Nashelsky. 2.Halkias. TMH..L. K. Electronic Devices and Circuits � R. 2nd Edition.www. Pearson/Prentice Hall. . 2008. TEXT BOOKS : 1. 3. Electronic Devices and Circuits � s salivahana n suresh kumar.jntuworld. Introduction to electronic devices and circuits-robert t painter PE. 3. Publications. SCR and Semiconductor Photo Diode. REFERENCES : 1. Electronic Devices and Circuits � Anil k maini . 1998 .com UNIT-VIII Special Purpose Electronic Devices: Priniciple of Operation and Characteristics of Tunnel Diode ( with the help of Energy Band Diagram 0 and Varactor Diode. stochastic matrix .sampling distributions of means ( s known and unknown) UNIT-III : Test of Hypothesis I � point estimations � interval estimations Bayesian estimation.the lines of regression � the rank correlation. Random variables � discrete and continuous. Test of hypothesis-. Large samples. D. Sampling distributions Distribution . Murugeson & P. limiting probabilities.examples of markov chains. Text Books: 1. .Branch: CSE Subject Code: 53014 Regulation: R09 Year: II Semester: I PROBABILITY AND STATISTICS UNIT-I Probability: Sample space and events � Probability � The axioms of probability � Some Elementary theorems .tests of hypothesis � t � distributions. UNIT-VII Queuing Theory: Arrival theorem.regression coefficient. UNIT-II : distribution: Binomial and poison distributions Normal distribution � related properties. Tests of hypothesis for the proportions single and difference between the proportions.Pure Birth and Death Process M/M/1 Model UNIT-VIII Stochastic Processes: Introduction to stochastic processes. UNIT-IV Test of Hypothesis II � confidential interval for the proportions. UNIT-V Small samples:Confidence interval for the t-distribution. distribution.Conditional probability � Baye�s theorem. UNIT-VI Correlation & regression: coefficient of correlation. F-distributions. Anuradha Publishers .critical region confidential interval for mean testing of single variance. Probability & Statistics. & type II errors.markov process classification of states. null hypothesis. Guru Swamy.alternate hypothesis type I. Difference between the mean. K. 2. Prentice Hall of India. References: 1. K. by William mendenhall & others cengage pub. Probability & Statistics. B. scitech publications.s. V. A first course in probability & statistics by BLS Prakasa rao. Iyengar. Chand & Company. World scientific. Probability & Statistics for Engineers. Probability & Statistics. Higher engineering mathematics by jain and iyengar . Miller and John E.s. . Higher engineering mathematics by b s grewal m khanna pub. 6. T. Probability & Statistics for engineers by g. Krishna Gandhi and Others S. narasa publications 5. 4. 3. 2.bhima rao. Freund. Automatic Theorem Proving. groups sub groups� homomorphism. UNIT-V Elementary Combinatorics: Basis of counting. Normal forms. BFS. Constrained repetitions. Multi graphs and Euler circuits. Spanning Trees. Function of Sequences Calculating Coefficient of generating function. Truth Tables. UNIT-IV Algebraic structures : Algebraic systems Examples and general properties. UNIT-III Relations: Properties of binary Relations. recursive Functions. Solving recurrence relation by substitution and Generating funds. Isomorphism. Hamiltonian graphs. DFS. equivalence implication. Basic Concepts Isomorphism and Sub graphs. Functions: Inverse Function Comports of functions. Consistency. equivalence. the principles of Inclusion � Exclusion. compatibility and partial ordering relations. Pigeon hole principles and its application UNIT-VI Recurrence Relation : Generating Functions. Combinations & Permutations. Rules of inference.Branch: CSE Subject Code: 53022 Regulation: R09 Year: II Semester: I MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE UNIT-I Mathematical Logic : Statements and notations. Binomial Multinomial theorems. Connectives. planar Graphs UNIT-VIII Graph Theory and Applications. Semi groups and monads. Hasse diagram. Chromatic Numbers . Free & Bound variables. Well formed formulas. Binomial Coefficients. UNIT-II Predicates : Predicative logic. Lattice and its Properties. proof of contradiction. Recurrence relations. Characteristics roots solution of In homogeneous Recurrence Relation. . UNIT-VII Graph Theory : Representation of Graph. tautology. with repetitions. Discrete Mathematical structures Theory and application-Malik & Sen 4. Discrete and Combinational Mathematics.Discrete Mathematics and its Applications. 7. Discrete mathematics for computer scientists & mathematicians JL Mott. TP Baker PHI. Discrete Mathematics with Applications. Discrete Mathematical Structures. Thomson. Garry Haggard and others. Fifth Edition. 6. Thomas Koshy. Grass Man & Trembley.TMH. Baker Prentice Hall. Kandel. TMH 9. 3.Pearson Education 8.P. Discrete Mathematical Structures with applications to computer science Trembly J. . Roberty C. Bernand Kolman. 5. REFERENCES : 1.L. T. Sharn Cutter Ross. Elements of DISCRETE MATHEMATICS-A computer oriented approach CL Liu.TEXT BOOKS : 1. P. J. Elsevier 2.An Applied Introduction-5th Edition � Ralph. A.P. Person Education. Pearson Education/PHI. Rosen. Discrete Mathematics for Computer Scientists & Mathematicians. A Kandel. Mott. Logic and Discrete Mathematics. Busby. d p nohapatra. Kenneth H. Discrete Mathematics for Computer science.P. & Manohar . 3rd ed TMH 2.Grimaldi. comparison of hashing and skip lists. extendible hashing.Function and class templates. Implementation using template classes in C++.Branch: CSE Subject Code: 53023 Regulation: R09 Year: II Semester: I Data Structures through C++ Unit I : C++ Class Overview. B-Trees. Inheritance basics.The list ADT.Model for external sorting. Unit III : Algorithms.time complexity and space complexity. Polyphase merge. Deletion and Searching Unit VII : Search trees (prt II) : Trees definitions. Access Control. static class members. AVL Trees. collision resolution-separate chaining. External Sorting. parameter passing methods. performance analysis. Queue ADT. hash table representation. Definition. Review of basic data structures. Operator Overloading. Implementation. Stack ADT. Comparison of Search Trees . double hashing. insertion. height of a B-Tree. deletion and searching.Searching. Insertion and Deletion. Realizing a Priority Queue using Heaps. Unit II : Function Over Loading. B-Tree of order m. Operations � Insertion. Unit VI : Search Trees (Part1):Binary Search Trees. base class access control. linear list representation. Unit IV : Dictionaries. dynamic memory allocation and deallocation (new and delete). Deletion. Height of an AVL Tree. Inline functions. base and derived classes. rehashing. Multiway merge. friend functions. quadratic probing. streams I/O. runtime polymorphism using virtual functions. abstract classes. inheritance types. ADT. operations insertion. exception handling. this pointer. Constructors and destructors. ADT. deletion and searching. Class Members. Operations. Definition.Class Definition. insertion. skip list representation. Generic Programming. Definition. Unit V : Priority Queues � Definition. Class Scope. open addressing-linear probing. hash functions. Objects. John Wiley and Sons. Data structures and Algorithm Analysis in C++. Thomson 3.Graphs: Basic terminology. Ltd. The OOP. Adam Drozdek. 4. Data structures and algorithms in C++. Ltd. Standard Tries. W. Augenstein and Tanenbaum.Goodrich. the Knuth-Morris-Pratt algorithm. Pearson Education. 2. TEXT BOOKS : 1.. Wiley student edition. Data structures. representations of graphs. BFS. Pearson education. Algorithms and Applications in C++. Data structures using C and C++. Langsam.Tamassia and .Savitch. . 2nd edition.Sahni. Unit VIII : Text Processing : Pattern matching algorithms-Brute force.Mount.Ltd. 2. 3rd Edition. S. R. graph search methods DFS. Mark Allen Weiss. Second Edition. Michael T. Compressed Tries. Fourth edition. Data structures and Algorithms in C++. REFERENCES : 1. PHI. Universities Press Orient Longman Pvt. University Press (India) Pvt. the Boyer �Moore algorithm. Problem solving with C++. Suffix tries. magnitude comparator. HDL for combinational circuits. latches. Flip-Flops Analysis of clocked sequential circuits. Number base conversions. Decoders. Binary codes. Analysis procedure Design procedure. Error Detection and correction Read-only memory.VI Registers. shift Registers. UNIT . Binary multiplier.VII Introduction. NAND and NOR implementation other Two-level implementnations. UNIT . Hardward Description language (HDL). Multiplexers. Digital logic gages. Design Procedure. Binary Storage and Registers. UNIT . Exclusive � Or function. other logic operations. Ripple counters synchronous counters. HDL for Registers and counters. Random-Access Memory. Boolean functions canonical and standard forms.Branch: CSE Subject Code: 53024 Regulation: R09 Year: II Semester: I DIGITAL LOGIC DESIGN UNIT-I BINARY SYSTEMS : Digital Systems. Sequential Programmable Devices. Basic theorems and properties of Boolean algebra. Binary Adder-Subtractor Decimal Adder. Signed binary numbers. Encoders. other counters. product of sums simplification Don�t-care conditions. State Reduction and Assignment. Binary Numbers. HDL for sequential circuits. Memory Decoding. complements. Four-variable map. UNIT-VIII . Programmable logic Array programmable Array logic. Five-Variable map. Binary logic. integrated circuits. UNIT .IV COMBINATIONAL LOGIC : Combinational Circuits. Axiomatic definition of Boolean Algebra. Octal and Hexadecimal Numbers. UNIT-III GATE � LEVEL MINIMIZATION : The map method.V SYNCHRONOUS SEQUENTIAL LOGIC : Sequential circuits. UNIT-II BOOLEAN ALGEBRA AND LOGIC GATES : Basic Definitions. 2. 5th Edition. Design Procedure. DIGITAL DESIGN � Third Edition . Digital Principles and Design � Donald D. Pearson Education 3.Givone. Race-Free state Assignment Hazards. FUNDAMENTALS OF LOGIC DESIGN.ASYNCHRONOUS SEQUENTIAL LOGIC : Introduction. Tata McGraw Hill.Thomson. C. Pearson Education/PHI. Roth.Morris Mano. 5TH Edition. Circuits with Latches. Tata McGraw Hill. REFERENCES : 1.S. M. 4. Design Example. Kohavi. Fundamentals of Digital Logic & Micro Computer Design . TEXT BOOKS : 1. Analysis Procedure.V. Rao. Rafiquzzaman John Wiley . Reduciton of state and Flow Tables. Switching and Logic Design. 2. M. Edition. Switching and Finite Automata Theory by Zvi. Network theorems. Thevenins�s. Conductors.f equation in a dc machine UNIT-VI D.. UNIT-III Alternating Quantities : Principle of ac voltages . UNIT-VII . speed and number of poles.Superposition . star delta and delta star transformation . e. single phase parallel circuits. waveforms and basic definitions. Simple problems. capacitive networks. Electric field. form factor and peak factor. Motors : Principle of operation of dc motors.C generator. losses and efficiency calculation in D. Losses and torque equation. electromagnetism related laws. relationship between frequency.I Introduction to Electrical Engineering : Essence of electricity. single phase series parallel circuits. Kirchhoff�s laws. Losses. types of DC Motors. ohm�s law. electric current.force on a current carrying conductor placed in a magnetic field. Magnetic field due to electric current flow . inductive networks. resistive networks. the J operator and phasor algebra. phasor representation of alternating quantities. Maximum power transfer theorems and simple problems.Branch: CSE Subject Code: 53025 Regulation: R09 Year: II Semester: I BASIC ELECTRICAL ENGINEERING UNIT . analysis of ac circuits with single basic network element. basic circuit components. power in ac circuits. potential and potential difference. Ideal Transformer and Practical Transformer. root mean square and average values of alternating currents and voltage. single phase series circuits. types of sources. UNIT-IV Transformers : Principles of operation. types of DC GENERAtors.m. types of elements . Faradays laws of electromagnetic induction. UNIT-II Network Analysis : Basic definitions. generators: Principle of operation of dc machines. Constructional Details. electric power. UNIT-V D. electromotive force. Efficiency and Regulation Calculations (All the above topics are only elementary treatment and simple problems).C. series parallel circuits.C. Transformer Test. semiconductors and insulators (elementary treatment only). Types of induced EMF�s. JR.Chand Publications.C Machines : Three phase induction motor.S. David Irwin Pearson. 2. Basic Electrical Engineering . REFERENCES : 1.Naidu and S. torque (simple problems). principle of operation. J. UNIT VIII Basic Instruments : Introduction. slip and rotor frequency. 3. Nagrath PHI. . Sukhija Oxford University Press.K Mehta.Nagasarkar and M. 2. Moving coil permanent magnet (PMMC) instruments. operating principles.K. Basic Electrical Engineering �By T.By M.P.S. Electrical and Electronic Technology by hughes �Pearson Education. Theory and Problems of Basic Electrical Engineering by D. Moving Iron of Ammeters and Voltmeters (elementary Treatment only) TEXT BOOKS : 1. Kerns. classification of instruments. Essentials of Electrical and Computer Engineering by David V.J.A. 3. essential features of measuring instruments. Kamakshiah � TMH.Kothari & I. Principles of Electrical Engineering by V. S. Swinburne�s Test on DC shunt machine (Predetermination of efficiency of a given DC Shunt machine working as motor and generator). verification on AC with Resistive and Reactive loads. Determination of critical field resistance. Verification of maximum power transfer theorem. 2. Coils. OC & SC tests on Single-phase transformer (Predetermination of efficiency and regulation at given power factors and determination of equivalent circuit). Identification. Brake test on DC shunt motor. BJTs. Reverse bias) 3. LEDs. Determination of performance Characteristics. Switches (SPDT. 12. Brake test on 3-phase Induction motor (performance characteristics). Gang Condensers. DPDT and DIP). Resonant frequency. 6. Bandwidth and Q-factor determination for RLC network.C. Magnetization characteristics of D. 8. Serial and Parallel Resonance � Timing. 7. LCDs. 10. 4. 9. Verification of Superposition and Reciprocity theorems. Shunt generator. chain matrix and analytical verification. 3.Branch: CSE Subject Code: 53608 Regulation: R09 Year: II Semester: I ELECTRICAL AND ELECTRONICS LAB PART � A 1. 2. Two port network parameters � Z-Y Parameters. Diodes. MOSFETs. PN Junction Diode Characteristics (Forward bias. Experimental determination of Thevenin�s and Norton�s equivalent circuits and verification by direct test. UJT. Specifications and Testing of R. Bread Boards. C Components (colour codes). 5. Lowpower JFETs. 11. Potentiometers. Verification on DC. Zener Diode Characteristics . Identification and Specifications of active devices. Linear and Digital ICs. L. Time response of first order RC/RL network for periodic non-sinusoidal inputs � time constant and steady state error determination. SCR. Regulation of alternator by synchronous impedance method PART � B 1. Relays. Rectifier with Filters (Full wave & half wave) 7. RC Phase Shift Oscillator 12. FET Characteristics 9. Rectifier without Filters (Full wave & Half wave) 6. Feedback Amplifier (Voltage Series/Current series) 11. Transistor CE Characteristics (Input and Output) 5. SCR Characteristics 8. CE and CC Amplifier 10.4. Hartely/Colpitts Oscillator . a) Stack ADT b) Queue ADT Week3. Recommended Systems/Software Requirements: � Intel based desktop PC with minimum of 166 MHZ or faster processor with atleast 64 MB RAM and 100 MB free disk space � C++ compiler and STL Recommended Week1.C++ programs to implement the following using an array. Week5-.Write C++ programs for implementing the following sorting methods: a) Merge sort b) Heap sort .Write C++ programs to implement the deque (double ended queue) ADT using a doubly linked list and an array. c) Search for a key element in a binary search tree.Write C++ programs that use non-recursive functions to traverse the given binary tree in a) Preorder b) inorder and c) postorder.Branch: CSE Subject Code: 53609 Regulation: R09 Year: II Semester: I DATA STRUCTURES LAB THROUGH C++ Objectives: � To make the student learn a object oriented way of solving problems. Week 4-Write a C++ program to perform the following operations: a) Insert an element into a binary search tree. Week6-. a) Stack ADT b) Queue ADT Week2.Write C++ programs to implement the following using a singly linked list. b) Delete an element from a binary search tree. � To make the student write ADTS for all data structures. Week7.Write C++ programs for the implementation of bfs and dfs for a given graph. Adam Drozdek.Stroustrup. Programming Prinicples and Practice using C++. (Note: Use Class Templates In the above Programs) TEXT BOOKS : 1. 4. Data Structures and Algorithms in C++. Data Structures using C++. Thomson. Indian edition. 2. Week12-. R. DATA structures a pseudo code approach with c++ . Malik.A.Write a C++ program to implement all the functions of a dictionary (ADT) using hashing. Week11-Write a C++ program to implement Prim�s algorithm to generate a minimum cost spanning tree.Write a C++ program to perform the following operations a) Insertion into an AVL-tree b) Deletion from an AVL-tree Week10-Write a C++ program to implement Kruskal�s algorithm to generate a minimum cost spanning tree.Forouzan Cengage Learning. B. Third Edition.Gilberg and B. Thomson .Write a C++ program to perform the following operations a) Insertion into a B-tree b) Deletion from a B-tree Week9-.F.Week8-.S. Addition-Wiesly (Pearson Education) 3. D.