Скачать 0.65 Mb.

PROBABILITY AND STATISTICSUNITI Probability: Sample space and events – Probability – The axioms of probability – Some Elementary theorems  Conditional probability – Baye’s theorem.UNITII Random variables – Discrete and continuous – Distribution – Distribution function. Distribution UNITIII Binomial and poison distributions Normal distribution – related properties. UNITIV Sampling distribution: Populations and samples  Sampling distributions of mean (known and unknown) proportions, sums and differences. UNITV Estimation: Point estimation – interval estimation  Bayesian estimation. UNITVI Test of Hypothesis – Means– Hypothesis concerning one and two means– Type I and Type II errors. One tail, twotail tests. UNITVIITests of significance – Student’s ttest, Ftest, test. Estimation of proportions. UNITVIII Queuing Theory: Pure Birth and Death Process M/M/1 Model and Simple Problems. Text Books:
References:
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD II Year B.Tech. CSE  I Sem T P C 4+1* 0 4 MATHEMATICAL FOUNDATION OF COMPUTER SCIENCE UNITI Mathematical Logic : Statements and notations, Connectives, Well formed formulas, Truth Tables, tautology, equivalence implication, Normal forms. UNITII Predicates : Predicative logic, Free & Bound variables, Rules of inference, Consistency, proof of contradiction, Automatic Theorem Proving. UNITIII Set Theory : Properties of binary Relations, equivalence, compatibility and partial ordering relations, Hasse diagram. Functions: Inverse Function Comports of functions, recursive Functions, Lattice and its Properties, Pigeon hole principles and its application. UNITIV Algebraic structures : Algebraic systems Examples and general properties, Semi groups and monads, groups sub groups’ homomorphism, Isomorphism. UNITV Elementary Combinatorics: Basis of counting, Combinations & Permutations, with repetitions, Constrained repetitions, Binomial Coefficients, Binomial Multinomial theorems, the principles of Inclusion – Exclusion. UNITVI 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. UNITVII Graph Theory : Representation of Graph, DFS, BFS, Spanning Trees, planar Graphs UNITVIII Graph Theory and Applications, Basic Concepts Isomorphism and Sub graphs, Multi graphs and Euler circuits, Hamiltonian graphs, Chromatic Numbers TEXT BOOKS : 1. Discrete and Combinational Mathematics An Applied Introduction5th Edition – Ralph. P.Grimaldi.Pearson Education 2. Discrete Mathematical Structures with applications to computer science Trembly J.P. & Manohar .P, TMH 3.Discrete Mathematics and its Applications, Kenneth H. Rosen, Fifth Edition.TMH. REFERENCES : 1. Discrete Mathematics with Applications, Thomas Koshy, Elsevier 2. Discrete Mathematical Structures, Bernand Kolman, Roberty C. Busby, Sharn Cutter Ross, Pearson Education/PHI. 3. Discrete Mathematical structures Theory and applicationMalik & Sen 4. Discrete Mathematics for Computer science, Garry Haggard and others, Thomson. 5. Discrete Mathematics for Computer Scientists & Mathematicians, J.L. Mott, A. Kandel, T.P. Baker Prentice Hall. 6. Logic and Discrete Mathematics, Grass Man & Trembley, Person Education. JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD II Year B.Tech. CSE  I Sem T P C 4+1* 0 4 ADVANCED DATA STRUCTURES Unit I : C++ Class Overview Class Definition, Objects, Class Members, Access Control, Class Scope, Constructors and destructors, parameter passing methods, Inline functions, static class members, this pointer, friend functions, dynamic memory allocation and deallocation (new and delete), exception handling. Unit II : Function Over Loading, Operator Overloading, Generic Programming Function and class templates, Inheritance basics, base and derived classes, inheritance types, base class access control, runtime polymorphism using virtual functions, abstract classes, streams I/O. Unit III : Algorithms, performance analysis time complexity and space complexity. Review of basic data structures The list ADT, Stack ADT, Queue ADT, Implementation using template classes in C++. Unit IV : Dictionaries, linear list representation, skip list representation, operations insertion, deletion and searching, hash table representation, hash functions, collision resolutionseparate chaining, open addressinglinear probing, quadratic probing, double hashing, rehashing, extendible hashing, comparison of hashing and skip lists. Unit V : Priority Queues – Definition, ADT, Realizing a Priority Queue using Heaps, Definition, insertion, Deletion, External Sorting Model for external sorting, Multiway merge, Polyphase merge. Unit VI : Search Trees (Part1): Binary Search Trees, Definition, ADT, Implementation, Operations Searching, Insertion and Deletion, AVL Trees, Definition, Height of an AVL Tree, Operations – Insertion, Deletion and Searching Unit VII : Search trees (prt II) : Introduction to Red –Black and Splay Trees, BTrees, BTree of order m, height of a BTree, insertion, deletion and searching, Comparison of Search Trees Unit VIII : Pattern matching and Tries : Pattern matching algorithmsBrute force, the Boyer –Moore algorithm, the KnuthMorrisPratt algorithm, Standard Tries, Compressed Tries, Suffix tries. TEXT BOOKS : 1. Data structures, Algorithms and Applications in C++, S.Sahni, University Press (India) Pvt.Ltd, 2nd edition, Universities Press Orient Longman Pvt. Ltd. 2. Data structures and Algorithms in C++, Michael T.Goodrich, R.Tamassia and .Mount, Wiley student edition, John Wiley and Sons. REFERENCES : 1. Data structures and Algorithm Analysis in C++, Mark Allen Weiss, Pearson Education. Ltd., Second Edition. 2. Data structures and algorithms in C++, 3rd Edition, Adam Drozdek, Thomson 3. Data structures using C and C++, Langsam, Augenstein and Tanenbaum, PHI. 4. Problem solving with C++, The OOP, Fourth edition, W.Savitch, Pearson education. JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD II Year B.Tech. CSE  I Sem T P C 4+1* 0 4 DIGITAL LOGIC DESIGN UNITI BINARY SYSTEMS : Digital Systems, Binary Numbers, Number base conversions, Octal and Hexadecimal Numbers, complements, Signed binary numbers, Binary codes, Binary Storage and Registers, Binary logic. UNITII BOOLEAN ALGEBRA AND LOGIC GATES : Basic Definitions, Axiomatic definition of Boolean Algebra, Basic theorems and properties of Boolean algebra, Boolean functions canonical and standard forms, other logic operations, Digital logic gages, integrated circuits. UNITIII GATE – LEVEL MINIMIZATION : The map method, Fourvariable map, FiveVariable map, product of sums simplification Don’tcare conditions, NAND and NOR implementation other Twolevel implementnations, Exclusive – Or function, Hardward Description language (HDL). UNIT  IV COMBINATIONAL LOGIC : Combinational Circuits, Analysis procedure Design procedure, Binary AdderSubtractor Decimal Adder, Binary multiplier, magnitude comparator, Decoders, Encoders, Multiplexers, HDL for combinational circuits. UNIT  V SYNCHRONOUS SEQUENTIAL LOGIC : Sequential circuits, latches, FlipFlops Analysis of clocked sequential circuits, HDL for sequential circuits, State Reduction and Assignment, Design Procedure. UNIT  VI Registers, shift Registers, Ripple counters synchronous counters, other counters, HDL for Registers and counters. UNIT  VII Introduction, RandomAccess Memory, Memory Decoding, Error Detection and correction Readonly memory, Programmable logic Array programmable Array logic, Sequential Programmable Devices. UNITVIII ASYNCHRONOUS SEQUENTIAL LOGIC : Introduction, Analysis Procedure, Circuits with Latches, Design Procedure, Reduciton of state and Flow Tables, RaceFree state Assignment Hazards, Design Example. TEXT BOOKS : 1. DIGITAL DESIGN – Third Edition , M.Morris Mano, Pearson Education/PHI. 2. FUNDAMENTALS OF LOGIC DESIGN, Roth, 5th Edition,Thomson. REFERENCES : 1. Switching and Finite Automata Theory by Zvi. Kohavi, Tata McGraw Hill. 2. Switching and Logic Design, C.V.S. Rao, Pearson Education 3. Digital Principles and Design – Donald D.Givone, Tata McGraw Hill, Edition. 4. Fundamentals of Digital Logic & Micro Computer Design , 5TH Edition, M. Rafiquzzaman John Wiley JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD II Year B.Tech. CSE  I Sem T P C 4+1* 0 4 MANAGERIAL ECONOMICS AND FINANCIAL ANALYSIS Unit I Introduction to Managerial Economics: Definition, Nature and Scope of Managerial Economics–Demand Analysis: Demand Determinants, Law of Demand and its exceptions. Unit II Elasticity of Demand: Definition, Types, Measurement and Significance of Elasticity of Demand. Demand Forecasting, Factors governing demand forecasting, methods of demand forecasting (survey methods, statistical methods, expert opinion method, test marketing, controlled experiments, judgmental approach to demand forecasting) Unit III Theory of Production and Cost Analysis: Production Function – Isoquants and Isocosts, MRTS, Least Cost Combination of Inputs, CobbDouglas Production function, Laws of Returns, Internal and External 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. Breakeven Analysis (BEA)Determination of BreakEven Point (simple problems) Managerial Significance and limitations of BEA. Unit IV Introduction to Markets & Pricing Policies: Market structures: Types of competition, Features of Perfect competition, Monopoly and Monopolistic Competition. PriceOutput Determination in case of Perfect Competition and Monopoly. Objectives and Policies of Pricing Methods of Pricing: Cost Plus Pricing, Marginal Cost Pricing, Sealed Bid Pricing, Going Rate Pricing, Limit Pricing, Market Skimming Pricing, Penetration Pricing, TwoPart Pricing, Block Pricing, Bundling Pricing, Peak Load Pricing, Cross Subsidization. Unit V Business & New Economic Environment: Characteristic features of Business, Features and evaluation of Sole Proprietorship, Partnership, Joint Stock Company, Public Enterprises and their types, Changing Business Environment in Postliberalization scenario. Unit VI Capital and Capital Budgeting: Capital and its significance, Types of Capital, Estimation of Fixed and Working capital requirements, Methods and sources of raising finance. Nature and scope of capital budgeting, features of capital budgeting proposals, Methods of Capital Budgeting: Payback Method, Accounting Rate of Return (ARR) and Net Present Value Method (simple problems) Unit VII Introduction to Financial Accounting: DoubleEntry Book Keeping, Journal, Ledger, Trial Balance Final Accounts (Trading Account, Profit and Loss Account and Balance Sheet with simple adjustments). Unit VIII Financial Analysis through ratios: Computation, Analysis and Interpretation of Liquidity Ratios (Current Ratio and quick ratio), Activity Ratios (Inventory turnover ratio and Debtor Turnover ratio), Capital structure Ratios (Debt Equity ratio, Interest Coverage ratio), and Profitability ratios (Gross Profit Ratio, Net Profit ratio, Operating Ratio, P/E Ratio and EPS). TEXT BOOKS: 1. Aryasri: Managerial Economics and Financial Analysis, 2/e, TMH, 2005. 2. Varshney & Maheswari: Managerial Economics, Sultan Chand, 2003. REFERENCES: 1. Ambrish Gupta, Financial Accounting for Management, Pearson Education, New Delhi. 2. H. Craig Peterson & W. Cris Lewis, Managerial Economics, PHI, 4^{th} Ed. 3. Suma Damodaran, Managerial Economics, Oxford University Press. 4. Lipsey & Chrystel, Economics, Oxford University Press. 5. S. A. Siddiqui & A. S. Siddiqui, Managerial Economics & Financial Analysis, New age International Space Publications. 6. Domnick Salvatore: Managerial Economics In a Global Economy, 4th Edition, Thomson. 7. Narayanaswamy: Financial Accounting—A Managerial Perspective, PHI. 8. Raghunatha Reddy & Narasimhachary: Managerial Economics& Financial Analysis, Scitech. 9. S.N.Maheswari & S.K. Maheswari, Financial Accounting, Vikas. 10. Truet and Truet: Managerial Economics:Analysis, Problems and Cases, Wiley. 11. Dwivedi:Managerial Economics, 6th Ed., Vikas. Prerequisites: Nil Objective: To explain the basic principles of managerial economics, accounting and current business environment underlying business decision making. Codes/Tables: Present Value Tables need to be permitted into the examinations Hall. Question Paper Pattern: 5 Questions to be answered out of 8 questions. Each question should not have more than 3 bits. JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD II Year B.Tech. CSE  I Sem T P C 4+1* 0 4 