JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD. II Year B.Tech. CSE-I Sem L T/P/D C 4 -/-/- 4 PROBABILITY AND STATISTICS

Size: px

Start display at page:

Download "JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD. II Year B.Tech. CSE-I Sem L T/P/D C 4 -/-/- 4 PROBABILITY AND STATISTICS"

Jade Ferguson
5 years ago
Views:

1 PROBABILITY AND STATISTICS To learn Understand a random variable that describes randomness or an uncertainty in certain realistic situation. It can be of either discrete or continuous type. In the discrete case, study of the binomial and the Poisson random variables and the Normal random variable for the continuous case predominantly describe important probability distributions. Important statistical properties for these random variables provide very good insight and are essential for industrial applications. Most of the random situations are described as functions of many single random variables. In this unit, the objective is to learn functions of many random variables through joint distributions. The types of sampling, Sampling distribution of means,sampling distribution of variance, Estimations of statistical parameters, Testing of hypothesis of few unknown statistical parameters. The mechanism of queuing system,the characteristics of queue, The mean arrival and service rates The expected queue length, The waiting line The random processes, The classification of random processes, Markov chain, Classification of states Stochastic matrix ( transition probability matrix ),Limiting probabilities, Applications of Markov chains UNIT-I Single Random variables and probability distributions: Random variables Discrete and continuous. Probability distributions, mass function/ density function of a probability distribution. Mathematical Expectation, Moment about origin, Central moments Moment generating function of probability distribution. Binomial, Poisson & normal distributions and their properties. Moment generating functions of the above three distributions, and hence finding the mean and variance. Multiple Random variables, Correlation & Regression: Joint probability distributions- Joint probability mass / density function, Marginal probability mass / density functions, Covariance of two random variables, Correlation - Coefficient of correlation, The rank correlation. Regression- Regression Coefficient, The lines of regression and multiple correlation & regression. I Sampling Distributions and Testing of Hypothesis Sampling: Definitions of population, sampling, statistic, parameter. Types of sampling, Expected values of Sample mean and varience, sampling distribution, Standard error, Sampling distribution of means and sampling distribution of varience. Parameter estimations likelihood estimate, interval estimations. Testing of hypothesis: Null hypothesis, Alternate hypothesis, type I, & type II errors critical region, confidence interval, Level of significance. One sided test, two sided test, Large sample tests: (i) Test of Equality of means of two samples equality of sample mean and population mean (cases of known varience & unknown varience, equal and unequal variances) (ii) Tests of significance of difference between sample S.D and population S.D. (iii) Tests of significance difference between sample proportion and population proportion & difference between two sample proportions. Small sample tests: Student t-distribution, its properties; Test of significance difference between sample mean and population mean; difference between means of two small samples Snedecor s F- distribution and it s properties. Test of equality of two population variences Chi-square distribution, it s properties, Chi-square test of goodness of fit Queuing Theory: Structure of a queuing system, Operating Characteristics of queuing system, Transient and steady states, Terminology of Queuing systems, Arrival and service processes- Pure Birth-Death process Deterministic queuing models- M/M/1 Model of infinite queue, M/M/1 model of finite queue. UNIT-V Stochastic processes: Introduction to Stochastic Processes Classification of Random processes, Methods of description of random processes, Stationary and non-stationary random process, Average values of single random process and two or more random processes. Markov process, Markov chain, classification of states Examples of Markov Chains, Stochastic Matrix.

2 MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE To explain with examples the basic terminology of functions, relations, and sets. To perform the operations associated with sets, functions, and relations. To relate practical examples to the appropriate set, function, or relation model, and interpret the associated operations and terminology in context. To describe the importance and limitations of predicate logic. To relate the ideas of mathematical induction to recursion and recursively defined structures. To use Graph Theory for solving problems. UNIT-I Mathematical Logic : Statements and notations, Connectives, Well formed formulas, Truth Tables, tautology, equivalence implication, Normal forms, Quantifiers, universal quantifiers. Predicates : Predicative logic, Free & Bound variables, Rules of inference, Consistency, proof of contradiction, Automatic Theorem Proving. Relations: Properties of Binary Relations, equivalence, transitive closure, compatibility and partial ordering relations, Lattices, Hasse diagram. Functions: Inverse Function Composition of functions, recursive Functions, Lattice and its Properties, Algebraic structures : Algebraic systems Examples and general properties, Semi groups and monads, groups sub groups homomorphism, Isomorphism. I Elementary Combinatorics: Basis of counting, Combinations & Permutations, with repetitions, Constrained repetitions, Binomial Coefficients, Binomial Multinomial theorems, the principles of Inclusion Exclusion. Pigeon hole principles and its application. Recurrence Relation : Generating Functions, Function of Sequences Calculating Coefficient of generating function, Recurrence relations, Solving recurrence relation by substitution and Generating funds. Characteristics roots solution of In homogeneous Recurrence Relation. UNIT-V Graph Theory : Representation of Graph, DFS, BFS, Spanning Trees, planar Graphs. Graph Theory and Applications, Basic Concepts Isomorphism and Sub graphs, Multi graphs and Euler circuits, Hamiltonian graphs, Chromatic Numbers. TEXT BOOKS : 1. Elements of DISCRETE MATHEMATICS- A computer Oriented Approach- C L Liu, D P Mohapatra. Third Edition, Tata McGraw Hill. 2. Discrete Mathematics for Computer Scientists & Mathematicians, J.L. Mott, A. Kandel, T.P. Baker, PHI. REFERENCE BOOKS : 1. Discrete Mathematics and its Applications, Kenneth H. Rosen, Fifth Edition.TMH. 2. Discrete Mathematical structures Theory and application-malik & Sen, Cengage. 3. Discrete Mathematics with Applications, Thomas Koshy, Elsevier. 4. Logic and Discrete Mathematics, Grass Man & Trembley, Pearson Education. Ability to Illustrate by examples the basic terminology of functions, relations, and sets and demonstrate knowledge of their associated operations. Ability to Demonstrate in practical applications the use of basic counting principles of permutations, combinations, inclusion/exclusion principle and the pigeonhole methodology. Ability to represent and Apply Graph theory in solving computer science problems.

3 DATA STRUCTURES To understand the basic concepts such as Abstract Data Types, Linear and Non Linear Data structures. To understand the notations used to analyze the Performance of algorithms. To understand the behavior of data structures such as stacks, queues, trees, hash tables, search trees, Graphs and their representations. To choose the appropriate data structure for a specified application. To understand and analyze various searching and sorting algorithms. To write programs in C to solve problems using data structures such as arrays, linked lists, stacks, queues, trees, graphs, hash tables, search trees. UNIT- I Basic concepts- Algorithm Specification-Introduction, Recursive algorithms, Data Abstraction Performance analysis- time complexity and space complexity, Asymptotic Notation-Big O, Omega and Theta notations, Introduction to Linear and Non Linear data structures. Singly Linked Lists-Operations-Insertion, Deletion, Concatenating singly linked lists, Circularly linked lists- Operations for Circularly linked lists, Doubly Linked Lists- Operations- Insertion, Deletion. Representation of single, two dimensional arrays, sparse matrices-array and linked representations. UNIT- II Stack ADT, definition, operations, array and linked implementations in C, applications-infix to postfix conversion, Postfix expression evaluation, recursion implementation, Queue ADT, definition and operations,array and linked Implementations in C, Circular queues-insertion and deletion operations, Deque (Double ended queue)adt, array and linked implementations in C. UNIT- III Trees Terminology, Representation of Trees, Binary tree ADT, Properties of Binary Trees, Binary Tree Representations-array and linked representations, Binary Tree traversals, Threaded binary trees, Max Priority Queue ADT-implementation-Max Heap-Definition, Insertion into a Max Heap, Deletion from a Max Heap. Graphs Introduction, Definition, Terminology, Graph ADT, Graph Representations- Adjacency matrix, Adjacency lists, Graph traversals- DFS and BFS. UNIT- IV Searching- Linear Search, Binary Search, Static Hashing-Introduction, hash tables, hash functions, Overflow Handling. Sorting-Insertion Sort, Selection Sort, Radix Sort, Quick sort, Heap Sort, Comparison of Sorting methods. UNIT- V Search Trees-Binary Search Trees, Definition, Operations- Searching, Insertion and Deletion, AVL Trees- Definition and Examples, Insertion into an AVL Tree,B-Trees, Definition, B-Tree of order m, operations-insertion and Searching, Introduction to Red-Black and Splay Trees(Elementary treatment-only Definitions and Examples), Comparison of Search Trees. Pattern matching algorithm- The Knuth-Morris-Pratt algorithm, Tries (examples only). 1. Fundamentals of Data structures in C, 2 nd Edition, E.Horowitz, S.Sahni and Susan Anderson-Freed, Universities Press. 2. Data structures A Programming Approach with C, D.S.Kushwaha and A.K.Misra, PHI. 1. Data structures: A Pseudocode Approach with C, 2 nd edition, R.F.Gilberg And B.A.Forouzan, Cengage Learning. 2. Data structures and Algorithm Analysis in C, 2 nd edition, M.A.Weiss, Pearson. 3. Data Structures using C, A.M.Tanenbaum,Y. Langsam, M.J.Augenstein, Pearson. 4. Data structures and Program Design in C, 2 nd edition, R.Kruse, C.L.Tondo and B.Leung,Pearson. 5. Data Structures and Algorithms made easy in JAVA, 2 nd Edition, Narsimha Karumanchi, CareerMonk Publications. 6. Data Structures using C, R.Thareja, Oxford University Press. 7. Data Structures, S.Lipscutz,Schaum s Outlines, TMH. 8. Data structures using C, A.K.Sharma, 2 nd edition, Pearson.. 9. Data Structures using C &C++, R.Shukla, Wiley India. 10. Classic Data Structures, D.Samanta, 2 nd edition, PHI. 11. Advanced Data structures, Peter Brass, Cambridge. Learn how to use data structure concepts for realistic problems. Ability to identify appropriate data structure for solving computing problems in respective language. Ability to solve problems independently and think critically.

4 DIGITAL LOGIC DESIGN To understand basic number systems codes and logical gates. To understand the Boolean algebra and minimization logic. To understand the design of combinational sequential circuits. To understand the basic s of various memory. UNIT-I Digital Systems: Binary Numbers, Octal, Hexa Decimal and other base numbers, Number base conversions, complements, signed binary numbers, Floating point number representation, binary codes, error detecting and correcting codes, digital logic gates(and, NAND,OR,NOR, Ex-OR, Ex-NOR), Boolean algebra, basic theorems and properties, Boolean functions, canonical and standard forms. Gate Level Minimization and combination circuits, The K-Maps Methods, Three Variable, Four Variable, Five Variable, sum of products, product of sums Simplification, Don t care conditions, NAND and NOR implementation and other two level implantation. I Combinational Circuits (CC): Design Procedure, Combinational circuit for different code converters and other problems, Binary Adder, subtractor, Multiplier, Magnitude Comparator, Decoders, Encoders, Multiplexers, Demultiplexers. Synchronous Sequential Circuits: Latches, Flip-flops, analysis of clocked sequential circuits, design of counters, Up-down counters, Ripple counters, Registers, Shift registers, Synchronous Counters. Asynchronous Sequential Circuits: Reduction of state and follow tables, Role free Conditions. UNIT-V: Memory: Random Access memory, types of ROM, Memory decoding, address and data bus, Sequential Memory, Cache Memory, Programmable Logic Arrays, memory Hierarchy in terms of capacity and access time. 1) Digital Design- M. Morris Mano. 1) 1. Switching and Finite Automata Theory by Zvi. Kohavi, Tata McGraw Hill. 2) 2. Switching and Logic Design, C.V.S. Rao, Pearson Education. 3) 3. Digital Principles and Design Donald D.Givone, Tata McGraw Hill, Edition. 4) 4. Fundamentals of Digital Logic & Micro Computer Design, 5TH Edition, M. Rafiquzzaman John Wiley. After this course student could able to design, understand the number systems, combinational sequential circuits. And they should be in a position to continue with computer organization.

5 ELECTRONIC DEVICES AND CIRCUITS This is a fundamental course, basic knowledge of which is required by all the circuit branch engineers. This course focuses: To familiarize the student with the principle of operation, analysis and design of Junction diode, BJT and FET amplifier circuits, transistors and field effect transistors. To understand diode as rectifier. To study basic principle of filter circuits and various types. UNIT -I P-N Junction Diode: Qualitative Theory of P-N Junction, P-N Junction as a Diode, Diode Equation, Volt- Ampere Characteristics, Temperature dependence of VI characteristic, Ideal versus Practical Resistance levels (Static and Dynamic), Transition and Diffusion Capacitances, Diode Equivalent Circuits, Load Line Analysis, Breakdown Mechanisms in Semiconductor Diodes, Zener Diode Characteristics. Special Purpose Electronic Devices: Principle of Operation and Characteristics of Tunnel Diode (with the help of Energy Band Diagram), Varactor Diode, SCR and Semiconductor Photo Diode. UNIT -II Rectifiers and Filters : The P-N junction as a Rectifier, Half wave Rectifier, Full wave Rectifier, Bridge Rectifier, Harmonic components in a Rectifier Circuit, Inductor Filters, Capacitor Filters, L- Section Filters, π- Section Filters, Comparision of Filters, Voltage Regulation using Zener Diode. UNIT -III Bipolar Junction Transistor and UJT: The Junction Transistor, Transistor Current Components, Transistor as an Amplifier, Transistor Construction, BJT Operation, BJT Symbol, Common Base, Common Emitter and Common Collector Configurations, Limits of Operation, BJT Specifications, BJT Hybrid Model, Determination of h-parameters from Transistor Characteristics, Comparison of CB, CE, and CC Amplifier Configurations, UJT and Characteristics. UNIT -IV Transistor Biasing and Stabilization: Operating Point, The DC and AC Load lines, Need for Biasing, Fixed Bias, Collector Feedback Bias, Emitter Feedback Bias, Collector - Emitter Feedback Bias, Voltage Divider Bias, Bias Stability, Stabilization Factors, Stabilization against variations in V BE and β, Bias Compensation using Diodes and Transistors, Thermal Runaway, Thermal Stability, Analysis of a Transistor Amplifier Circuit using h- Parameters. UNIT -V Field Effect Transistor and FET Amplifiers Field Effect Transistor: The Junction Field Effect Transistor (Construction, principle of operation, symbol) Pinch-off Voltage - Volt-Ampere characteristics, The JFET Small Signal Model, MOSFET (Construction, principle of operation, symbol), MOSFET Characteristics in Enhancement and Depletion modes. FET Amplifiers: FET Common Source Amplifier, Common Drain Amplifier, Generalized FET Amplifier, Biasing FET, FET as Voltage Variable Resistor, Comparison of BJT and FET. 1. Millman s Electronic Devices and Circuits J. Millman, C.C.Halkias, and Satyabrata Jit, 2 Ed.,1998, TMH. 2. Electronic Devices and Circuits Mohammad Rashid, Cengage Learing, Electronic Devices and Circuits David A. Bell, 5 Ed, Oxford. 1. Integrated Electronics J. Millman and Christos C. Halkias, 1991 Ed., 2008, TMH. 2. Electronic Devices and Circuits R.L. Boylestad and Louis Nashelsky, 9 Ed., 2006, PEI/PHI. 3. Electronic Devices and Circuits B. P. Singh, Rekha Singh, Pearson, 2 Ed, Electronic Devices and Circuits - K. Lal Kishore, 2 Ed., 2005, BSP. 5. Electronic Devices and Circuits Anil K. Maini, Varsha Agarwal, 1 Ed., 2009, Wiley India Pvt. Ltd. 6. Electronic Devices and Circuits S.Salivahanan, N.Suresh Kumar, A.Vallavaraj, 2 Ed., 2008, TMH. Understand and Analyse the different types of diodes, operation and its characteristics. Design and analyse the DC bias circuitry of BJT and FET. Design biasing circuits using diodes and transistors. To analyze and design diode application circuits, amplifier circuits and oscillators employing BJT, FET devices.

6 II Year B. Tech CSE I SEM L T/P/D C BASIC ELECTRICAL ENGINEERING This course introduces the concepts of basic electrical engineering parameters, quantities, analysis of AC and DC circuits, the construction operation and analysis of transformers, DC and AC machines. It also gives knowledge about measuring instruments operation in detail. UNIT I Introduction to Electrical Engineering: Ohm s law, basic circuit components, Kirchhoff s laws. Simple problems. Network Analysis: Basic definitions, types of elements, types of sources, resistive networks, inductive networks, capacitive networks, and series parallel circuits, star delta and delta star transformation., Network theorems- Superposition, Thevenins s, Maximum power transfer theorems and simple problems. Alternating Quantities: Principle of ac voltages, waveforms and basic definitions, root mean square and average values of alternating currents and voltage, form factor and peak factor, phasor representation of alternating quantities, the J operator and phasor algebra, analysis of ac circuits with single basic network element, single phase series circuits. I Transformers : Principles of operation, Constructional Details, Ideal Transformer and Practical Transformer, Losses, Transformer Test, Efficiency and Regulation Calculations (All the above topics are only elementary treatment and simple problems). D.C. and A.C. Machines: D.C generators: Principle of operation of dc machines, types of D.C generators, EMF equation in D.C generator. D.C motors: Principle of operation of dc motors, types of D.C motors, losses and torque equation, losses and efficiency calculation in D.C generator. A.C Machines: Three phase induction motor, principle of operation, slip and rotor frequency, torque (simple problems). UNIT V Basic Instruments: Introduction, classification of instruments, operating principles, essential features of measuring instruments, Moving coil permanent magnet (PMMC) instruments, Moving Iron of Ammeters and Voltmeters (elementary Treatment only). 1. Basic concepts of Electrical Engineering, PS Subramanyam, BS Publications. 2. Basic Electrical Engineering, S.N. Singh, PHI. 1. Basic Electrical Engineering, Abhijit Chakrabarthi, Sudipta nath, Chandrakumar Chanda, Tata-McGraw- Hill. 2. Principles of Electrical Engineering, V.K Mehta, Rohit Mehta, S.Chand Publications. 3. Basic Electrical Engineering, T.K.Nagasarkar and M.S. Sukhija, Oxford University Press. 4. Fundamentals of Electrical Engineering, RajendraPrasad, PHI. 5. Basic Electrical Engineering by D.P.Kothari, I.J. Nagrath, McGraw-Hill. After going through this course the student gets a thorough knowledge on basic electrical circuits, parameters, and operation of the transformers in the energy conversion process, electromechanical energy conversion, construction operation characteristics of DC and AC machines and the constructional features and operation of operation measuring instruments like voltmeter, ammeter, wattmeter etc...with which he/she can able to apply the above conceptual things to real-world electrical and electronics problems and applications.

7 - -/3/- 2 DATA STRUCTURES LAB To write and execute programs in C to solve problems using data structures such as arrays, linked lists, stacks, queues, trees, graphs, hash tables and search trees. To write and execute write programs in C to implement various sorting and searching methods. Recommended Systems/Software Requirements: Intel based desktop PC with minimum of 166 MHZ or faster processor with at least 64 MB RAM and 100 MB free disk space. C compiler. Week1: Write a C program that uses functions to perform the following: a) Create a singly linked list of integers. b) Delete a given integer from the above linked list. c) Display the contents of the above list after deletion. Week2: Write a C program that uses functions to perform the following: a) Create a doubly linked list of integers. b) Delete a given integer from the above doubly linked list. c) Display the contents of the above list after deletion. Week3: Write a C program that uses stack operations to convert a given infix expression into its postfix Equivalent, Implement the stack using an array. Week 4: Write C programs to implement a double ended queue ADT using i)array and ii)doubly linked list respectively. Week 5: Write a C program that uses functions to perform the following: a) Create a binary search tree of characters. b) Traverse the above Binary search tree recursively in Postorder. Week 6: Write a C program that uses functions to perform the following: a) Create a binary search tree of integers. b) Traverse the above Binary search tree non recursively in inorder. Week 7: Write C programs for implementing the following sorting methods to arrange a list of integers in Ascending order : a) Insertion sort b) Merge sort Week 8: Write C programs for implementing the following sorting methods to arrange a list of integers in ascending order: a) Quick sort b) Selection sort Week 9: i) Write a C program to perform the following operation: a)insertion into a B-tree. ii) Write a C program for implementing Heap sort algorithm for sorting a given list of integers in ascending order. Week 10: Write a C program to implement all the functions of a dictionary (ADT) using hashing. Week 11: Week 12: Write a C program for implementing Knuth-Morris- Pratt pattern matching algorithm. Write C programs for implementing the following graph traversal algorithms: a)depth first traversal b)breadth first traversal 1. C and Data Structures, Third Edition, P.Padmanabham, BS Publications. 2. C and Data Structures, Prof. P.S.Deshpande and Prof. O.G. Kakde, Dreamtech Press. 3. Data structures using C, A.K.Sharma, 2 nd edition, Pearson. 4. Data Structures using C, R.Thareja, Oxford University Press. 5. C and Data Structures, N.B.Venkateswarlu and E.V.Prasad,S.Chand. 6. C Programming and Data Structures, P.Radha Krishna, Hi-Tech Publishers. Ability to identify the appropriate data structure for given problem. Graduate able to design and analyze the time and space complexity of algorithm or program. Ability to effectively use compilers includes library functions, debuggers and trouble shooting.

St. MARTIN s ENGINERING COLLEGE Dhulapally,Secunderabad

St. MARTIN s ENGINERING COLLEGE Dhulapally,Secunderabad-500014 INFORMATION TECHNOLOGY COURSE DESCRIPTION FORM Course Title Data Structures Course Code A30502 Regulation R13-JNTUH Course Structure Lectures