🎧 New: AI-Generated Podcasts Turn your study notes into engaging audio conversations. Learn more

CSBS-R22 (1).pdf

Loading...
Loading...
Loading...
Loading...
Loading...
Loading...
Loading...

Full Transcript

Estd: 1997 EAMCET Code: BVRI BACHELOR OF TECHNOLOGY (B.Tech.) FOUR YEAR DEGREE PROGRAMME [Choice Based Credit System (CBCS)] R22 Curriculum (Applicable for the batches admitte...

Estd: 1997 EAMCET Code: BVRI BACHELOR OF TECHNOLOGY (B.Tech.) FOUR YEAR DEGREE PROGRAMME [Choice Based Credit System (CBCS)] R22 Curriculum (Applicable for the batches admitted from 2022-2023) DEPARTMENT OF COMPUTER SCIENCE AND BUSINESS SYSTEMS B V RAJU INSTITUTE OF TECHNOLOGY UGC Autonomous, Approved by AICTE, Accredited by NBA & NAAC & Affiliated to JNTUH, Hyderabad Orchard Park Campus, Vishnupur Narsapur, Medak Dist. – 502 313, Telangana, India (Sri Vishnu EducationalSociety) Email: [email protected] Website: www.bvrit.ac.in B V RAJU INSTITUTE OF TECHNOLOGY VISION To create and nurture competent engineers and managers who would be enterprise leaders throughout the world with a sound background in ethics and societal responsibilities. MISSION We are committed to providing a positive and professional learning environment where all students are inspired to strive for excellence in becoming competent engineers, technology innovators and leaders in a global society through a cohesive network of parents, students, college staff and industry. QUALITY POLICY We aim at excellence in Technical Education through continual improvements and are committed to provide responsible technocrats for effective nation building through  Imparting quality Education& Training  Developing students with a disciplined and Integratedpersonality  Facilitating faculty and supporting staff to update their knowledge and skills to match the individual and technologicaldevelopments B V RAJU INSTITUTE OF TECHNOLOGY B.Tech. in Computer Science and Business Systems COURSE STRUCTURE (R22 REGULATIONS) From A.Y 2022-23 admitted Student Batches (L: Lecture, T: Tutorial, P: Practical, C: Credit, CIE: Continuous Internal Evaluation, SEE: Semester End Examination) I YEAR I SEMESTER COURSE S.NO COURSE TITLE CAT L T P C CIE SEE TOTAL CODE 1 A61N1 Discrete Mathematics BS 3 - - 3 40 60 100 Introductory topics in Statistics, Probability and A61N2 Calculus 2 BS 3 - - 3 40 60 100 3 A61K1 Fundamentals of Computer Science ES 2 1 - 3 40 60 100 4 A61B2 Principles of Electrical Engineering ES 2 - - 2 40 60 100 5 A61N3 Statistical Methods BS 3 - - 3 40 60 100 Business Communication A61N4 and Value Science – I 6 HS 2 - - 2 40 60 100 7 A611K Fundamentals of Computer ES - - 3 1.5 40 60 100 Science Lab 8 A612B Principles of Electrical Engineering ES - - 2 1 40 60 100 Lab 9 A614N Statistical Methods Lab BS - - 3 1.5 40 60 100 TOTAL 20 360 540 900 I YEAR II SEMESTER S.NO COURSE COURSE TITLE CAT L T P C CIE SEE TOTAL CODE 1 Linear Algebra BS 3 - - 3 40 60 100 A62N1 2 Physics for Computing Science BS 3 - - 3 40 60 100 A62N2 3 Data Structures through C++ ES 2 1 - 3 40 60 100 A62E2 4 ES 2 - - 2 40 60 100 Principles of Electronics A62B1 Engineering 5 Fundamentals of Economics HS 3 - - 3 40 60 100 A62P1 6 HS 2 - - 2 40 60 100 Business Communication and A62N3 Value Science – II Applied Physics Lab 7 A621N BS - - 3 1.5 40 60 100 8 Data Structures through C++ Lab ES - - 3 1.5 40 60 100 A624E 9 ES - - 2 1 40 60 100 Principles of Electronics A622B Engineering Lab TOTAL 20 360 540 900 II YEAR I SEMESTER II-YEAR I-SEMESTER S.NO COD COURSE TITLE CAT L TP C CIE SEE TOTAL E A63K1 Formal Language and Automata 1 Theory PC 3 - - 3 40 60 100 Computer Organization and 2 A63KA PC 3 -- 3 40 60 100 Architecture 3 A63K2 Advanced-Data Structures through PC 3 - - 3 40 60 100 C++ 4 A63K3 Computational Statistics PC 2 -- 2 40 60 100 5 A64K4 Principles of Software Engineering PC 3 - - 3 40 60 100 with UML 6 A63P1 Financial Management HS 3 - - 3 40 60 100 Advanced-Data Structures through 7 A631K C++ PC - - 2 1 40 60 100 Lab 8 A632K Computational Statistics Lab PC - - 2 1 40 60 100 Principles of Software Engineering with 9 A633K PC - - 2 1 40 60 100 UML Lab TOTAL 360 540 900 II YEAR II SEMESTER II-YEAR II-SEMESTER S.NO COD COURSE TITLE CAT L T P C CIE SEE TOTAL E 1 A64K1 Operating Systems PC 3 - - 3 40 60 100 Database Management 2 A64K2 Systems Concepts PC 2 -- 2 40 60 100 Object Oriented Programming through 3 A64K3 PC 3 - - 3 40 60 100 JAVA Introduction to Innovation, IP A64P1 4 Management and Entrepreneurship HS 2 1- 3 40 60 100 5 A64K4 Operations Research HS 3 - - 3 40 60 100 Business Communication and Value 6 A64N3 HS 2 - - 2 40 60 100 Science – III 7 A641K Operating Systems (UNIX) Lab PC - - 2 1 40 60 100 Database Management Systems 8 A642K PC - - 2 1 40 60 100 Concepts Lab Object Oriented Programming through 9 A643K PC - - 2 1 40 60 100 JAVA Lab 10 A644K Operations Research Lab HS - - 2 1 40 60 100 TOTAL 20 400 600 1000 B V Raju Institute of Technology/B.Tech. CSBS w.e.f. 2020-2021 III-YEAR ISEMESTER S.NO CODE COURSE TITLE CAT L T P C CIE SEE TOTAL 1 Algorithm Design and Analysis PC 2 1 0 3 40 60 100 2 Computer Communications PC 3 0 0 3 40 60 100 Fundamentals of 3 Management HS 2 0 0 2 40 60 100 4 Design Thinking ES 3 0 0 3 40 60 100 5 Professional Elective-1 PE 3 0 0 3 40 60 100 6 Professional Elective-2 PE 3 0 0 3 40 60 100 Algorithm Design and Analysis 7 Lab PC 0 0 2 1 40 60 100 Computer Communications 8 Lab PC 0 0 2 1 40 60 100 9 Technical Term Paper PW 0 0 2 1 100 - 100 TOTAL 16 1 6 20 420 480 900 III-YEAR IISEMESTER S.NO CODE COURSE TITLE CAT L T P C CIE SEE TOTAL 1 Compiler Design PC 3 0 0 3 40 60 100 Cryptography and Information 2 Security PC 2 1 0 3 40 60 100 3 Artificial Intelligence PC 3 0 0 3 40 60 100 4 Financial and Cost Accounting HS 2 0 0 2 40 60 100 5 Professional Elective-3 PE 3 0 0 3 40 60 100 6 Professional Elective-4 PE 3 0 0 3 40 60 100 Business Communication and 7 Value Science-IV HS 2 0 0 2 40 60 100 8 Compiler Design Lab PC 0 0 2 1 40 60 100 9 Artificial Intelligence Lab PC 0 0 2 1 40 60 100 TOTAL 18 1 4 21 360 540 900 B V Raju Institute of Technology/B.Tech. CSBS w.e.f. 2020-2021 IV-YEAR I SEMESTER S.NO CODE COURSE TITLE CAT L T P C CIE SEE TOTAL Usability Design of Software 1 PC 3 0 0 3 40 60 100 Applications 2 Machine Learning PC 3 0 0 3 40 60 100 Marketing Research and 3 HS 2 0 0 2 40 60 100 Marketing Management 4 Human Resource Management HS 2 0 0 2 40 60 100 5 Professional Elective-5 PE 3 0 0 3 40 60 100 6 Professional Elective-6 PE 3 0 0 3 40 60 100 Usability Design of Software 7 PC 0 0 2 1 40 60 100 Applications Lab 8 Machine Learning Lab PC 0 0 2 1 40 60 100 9 Seminar PW 0 0 2 1 100 - 100 10 Summer Internship PW 0 0 4 2 100 - 100 TOTAL 16 0 10 21 520 480 1000 IV-YEAR II SEMESTER S.NO CODE COURSE TITLE CAT L T P C CIE SEE TOTAL 1 Open Elective-1 OE 3 0 0 3 40 60 100 OE 2 Open Elective-2 3 0 0 3 40 60 100 3 Open Elective-3 OE 3 0 0 3 40 60 100 4 Major Project PW 0 0 12 6 40 60 100 TOTAL 9 0 12 15 160 240 400 B V Raju Institute of Technology/B.Tech. CSBS w.e.f. 2020-2021 Professional Electives (PE) PE-1 Course Code Subject Name Conversational Systems Cloud, Microservices and Application Data Mining and Analytics PE-2 Course Code Subject Name Modern Day Robotics and its Industrial Applications Modern Web Applications Introduction to Data Science PE-3 Course Code Subject Name Cognitive Science and Analytics Principles of Internet of Things Cryptology PE-4 Course Code Subject Name Quantum Computation and Quantum Information Advanced Social, Text and Media Analytics Mobile Computing PE-5 Course Code Subject Name Cloud Computing IT Project Management Cyber Security PE-6 Course Code Subject Name Image Processing and Pattern Recognition Computer Forensics Ethics, Policies And The It Act B V Raju Institute of Technology/B.Tech. CSBS w.e.f. 2020-2021 Open Electives OE-1 Course Subject Name Code Business Strategy Psychology OE-2 Course Subject Name Code Behavioral Economics Organizational Behavior OE-3 Course Subject Name Code Advance Finance Enterprise Systems B V Raju Institute of Technology/B.Tech. CSBS w.e.f. 2020-2021 DISCRETE MATHEMATICS I YEAR I SEM L T P C 3 0 0 3 CODE: A61N1 Course Pre-Requisites: Set, Relation, Mapping, Permutations and Combinations Course Objectives: To learn 1. Concepts of sets and relation to understand Group’s and Ring structure 2. The concept of tautology, contradiction, quantifiers and contingency. 3. Combinatorics techniques in solving the system by various methodologies 4. Boolean expressions, operations and truth tables 5. Graphs serve as models for many standard problems Unit-I: Abstract Algebra (10 Periods) Sets, Finite sets, Power sets, Set Operations, Algebra of sets and duality, Partitions, Relations, Types of relations, Closure properties, Equivalence relations, Partial Ordering, Groups, subgroups, Lagrange's theorem on finite groups, introduction to Ring, Integral domain and Field. Unit-II: Logic (10 Periods) Propositional calculus - propositions and connectives, truth assignments and truth tables, validity and satisfiability, tautology; Logical Equivalence and normal forms; Algebra of propositions, Conditional and Bi- conditional statements, Logical implication, Quantifiers, Negation of quantified statements. Unit-III: Combinatorics (9 Periods) Introduction, basic counting, Factorial notation, Binomial coefficients, generating functions, recurrence relations, pigeonhole principle, principle of mathematical induction. Unit-IV: Boolean algebra (9 Periods) Introduction of Boolean algebra, principle of duality, Basic logic gates, truth table, Boolean expressions, canonical form, Karnaugh’s map. Unit-V: Graph Theory (10 Periods) Graphs, Types of Graphs, digraphs, adjacency matrix, isomorphism, Trees, Properties of trees, spanning trees, Minimal Spanning trees using Kruskal’s and Prims Algorithms.Graph Theory Applications: Eulerian paths and circuits in graphs and digraphs, Hamiltonian paths and circuits in graphs, Plan ar graphs, dual of a planer graph, Euler’s formula, chromatic number, statement of Four-color theorem. Course Outcomes: After completing the course, the students will be able to: 1. Represent characteristics of Sets, Groups, Rings and Fields 2. Explain and exemplify tautology, contradiction and contingency 3. Identify underlying combinatorial structures 4. Analyse the design of various combinational & sequential logic circuits using the concepts of Boolean Algebra 5. Apply graph theory based tools in solving practical problems Text Books: 1. Topics in Algebra, I. N. Herstein, John Wiley and Sons. 2. Digital Logic & Computer Design, M. Morris Mano, Pearson. 3. Elements of Discrete Mathematics, (Second Edition) C. L. LiuMcGraw Hill, New Delhi. Reference Books: 1. Graph Theory with Applications, J. A. Bondy and U. S. R. Murty, Macmillan Press, London. 2. Mathematical Logic for Computer Science, L. Zhongwan, World Scientific, Singapore. 3. Introduction to linear algebra. Gilbert Strang. 4. Introductory Combinatorics, R. A. Brualdi, North-Holland, New York. 5. Graph Theory with Applications to Engineering and Computer Science, N. Deo, Prentice Hall, Englewood Cliffs. 6. Introduction to Mathematical Logic, (Second Edition), E. Mendelsohn, Van-Nostrand, London. B V Raju Institute of Technology/B.Tech. CSBS w.e.f. 2020-2021 INTRODUCTORY TOPICS IN STATISTICS, PROBABILITY AND CALCULUS I YEAR I SEM CODE: A61N2 L T P C 3 0 0 3 Course Pre-Requisites: Permutations, Combinations and Basic Calculus Course Objectives: To learn 1. Basic probability theory and statistical parameters 2. Different types of probability distributions 3. Basic objectives of statistic and classification of data 4. Descriptive measures and frequency distributions 5. Differential and integral calculus Unit-I: Basic Probability& Mathematical Expectations (10 Periods) Concept of experiments, sample space, event, Definition of Combinatorial Probability, Conditional Probability, Baye’s theorem, Discrete and continuous random variables, Expected values and moments: mathematical expectation and its properties, Moments (including variance) and their properties, interpretation, Moment generating function. Unit-II: Probability Distributions (9 Periods) Discrete distributions: Binomial, Poisson and Geometric distribution. Continuous distributions: Uniform, Exponential, Normal, Chi-square, t and F distributions Unit-III: Introduction to Statistics (9 Periods) Definition of Statistics, Basic objectives, Applications in various branches of science with examples, Collection of Data: Internal and external data, Primary and secondary Data, Population and sample, Representative sample. Unit-IV: Descriptive Statistics (10 Periods) Classification and tabulation of univariate data, graphical representation, Frequency curves. Descriptive measures - central tendency and dispersion, bivariate data, Summarization, marginal and conditional frequency distribution. Unit-V: Differential Calculus (10 Periods) Limit of functions, continuity, derivatives, Taylor’s and Maclaurin’s series expansions, Partial derivatives, Maxima and minima of function of two variables. Integral Calculus: Length of a plane curve, Volume of solid of revolution, Area of surface of a solid of revolution (Cartesian form). Multiple Integrals- double integrals with constant and variable limits (Cartesian and polar form), change of order of integration (Cartesian form), triple integrals (Cartesian coordinates), and applications of double and triple integrals: Area as double integration in Cartesian coordinates and volume as a triple integration. COURSE OUTCOMES: After completing the course, the students will be able to: 1. Compute expected values of discrete and continuous random variables 2. Identify the suitable probability distribution to solve the problems 3. Classify and analyze the given data through basic statistics 4. Apply basic optimization techniques to the problems involving functions of two variables. 5. Calculate areas and volumes of solids by applying multiple integrals. TEXT BOOKS: 1. Introduction of Probability Models, S. M. Ross, 11th Edition, Academic Press, N.Y.,2014. 2. Introduction to Probability and Statistics for Engineers and Scientists, Sheldon M.Ross, 4thEdition, Academic Press, 2009. 3. Fundamentals of Statistics, Vol. I & II, A. Goon, M. Gupta and B. Dasgupta, World Press, 2016. 4. Higher Engineering Mathematics, B. S. Grewal, Khanna Publishers. REFERENCE BOOKS: 1. Probability and Statistics for Engineers, I. R. Miller, J.E. Freund and R. Johnson, 4thEdition, PHI, 2011. 2. Introduction to the Theory of Statistics, A. M. Mood, F.A. Graybill and D.C. Boes,3rd Edition, McGraw Hill Education, 2017. 3. Advanced Engineering Mathematics, Peter V. O’Neil, 7th Edition, Cengagelearning, 2011. 4. Advanced Engineering Mathematics, M. D. Greenberg, 2nd Edition, PearsonEducation, 2002. 5. Applied Mathematics, P. N. Wartikar and J. N. Wartikar, Vol. I & II, VidyarthiPrakashan, 2010. B V Raju Institute of Technology/B.Tech. CSBS w.e.f. 2020-2021 FUNDAMENTALS OF COMPUTER SCIENCE I Year I sem CODE: A61K1 L T P C 2 1 0 3 COURSE OBJECTIVES: 1. Formulate simple algorithms for arithmetic and logical problems 2. Translate the algorithms to programs (in C language) 3. Test and execute the programs and correct syntax and logical errors 4. Implement conditional branching, iteration and recursion 5. Decompose a problem into functions and synthesize a complete program using divide and conquer approach 6. Use arrays, pointers and structures to formulate algorithms and programs UNIT-I: (10 Periods) General problem solving concepts and Imperative languages: Algorithm, and Flowchart for problem solving with Sequential Logic Structure, Decisions and Loops. Introduction to imperative language; syntax and constructs of a specific language (ANSI C),Types Operator and Expressions with discussion of variable naming and Hungarian Notation: Variable Names, Data Type and Sizes (Little Endian Big Endian), Constants, Declarations, Arithmetic Operators, Relational Operators, Logical Operators, Type Conversion, Increment Decrement Operators, Bitwise Operators, Assignment Operators and Expressions, Precedence and Order of Evaluation, proper variable naming and Hungarian Notation. UNIT-II (9 Periods) Input Output and Control Flow with discussion on structured and unstructured programming Method: Standard I/O, Formatted Output – printf, Formatted Input – scanf, Statements and Blocks, If- Else-If, Switch, Loops – while, do, for, break and continue, goto labels, structured and un- structured programming. UNIT-III (10 Periods) Functions and Program Structure with discussion on standard library: Basics of functions, parameter passing and returning type, C main return as integer, Scope Rules, Block structure, Initialization, Recursion, Standard Library Functions and return types, Variable length argument list, Pre- processor, Macro, User Defined Header, User Defined Library Function, Debugging, External, Auto, Local, Static, Register Variables. UNIT-IV (9 Periods) Pointers and Arrays: Pointers and address, Pointers and Function Arguments, Pointers and Arrays, Address Arithmetic, character Pointers and Functions, Pointer Arrays, Pointer to Pointer, Multi- dimensional array and Row/column major formats, Initialization of Pointer Arrays, Command line arguments, Pointer to functions, complicated declarations and how they are evaluated, Storage allocator. UNIT-V (10 Periods) Structures Files and Unix system Interface: Basic Structures, Structures and Functions, Array of structures, Pointer of structures, Self-referral structures, Table look up, typedef, unions, Bit-fields, file access including FILE structure, fopen, stdin, stdout and stderr, Error Handling including exit, perror and error.h, Line I/O, related miscellaneous functions, File Descriptor, Low level I/O – read and write, open, create, close and unlink, Random access – lseek, Discussions on Listing Directory, make file utility Course Outcomes: 1. Able to design the flowchart and algorithm for real world problems 2. Effectively apply problem solving techniques in designing the solutions for awide-range of problems 3. Able to construct modular and readable programs 4. Understand and use common data structures arrays, strings and perform explicit memory management. 5. Able to write C programs for real world problems using compound data types and perform file handling. B V Raju Institute of Technology/B.Tech. CSBS w.e.f. 2020-2021 Text Books: 1. The C Programming Language, (Second Edition) B. W. Kernighan and D. M. Ritchie, PHI. 2. Programming in C, (Second Edition) B. Gottfried, Schaum Outline Series. Reference Books: 1. C: The Complete Reference, (Fourth Edition), Herbert Schildt, McGraw Hill. 2. Let Us C, Yashavant Kanetkar, BPB Publications. B V Raju Institute of Technology/B.Tech. CSBS w.e.f. 2020-2021 PRINCIPLES OF ELECTRICAL ENGINEERING I YEAR I SEM CODE: L T P C 2 0 0 2 A61B2 COURSE OBJECTIVES: 1. To understand the basic concepts of electrical and magnetic circuits. 2. To study the single phase and three phase ac circuits. 3. To familiarize the students with the network theorems, transformers and DC machines. 4. To identify the types of sensors and measure quantities in AC and DC systems Unit-I: (10 Periods) Introduction: Concept of Potential difference, voltage, current, Fundamental linear passive and active elements to their functional current-voltage relation, Terminology and symbols in order to describe electric networks, voltage source and current sources, ideal and practical sources, concept of dependent and independent sources, Kirchhoff-s laws and applications to network solutions using mesh and nodal analysis, Concept of work, power, energy. Unit-II: (8 Periods) DC Circuits: Current-voltage relations of the electric network by mathematical equations to analyze the network (Thevenin’s theorem, Norton's Theorem, Maximum Power Transfer theorem) Simplifications of networks using series-parallel, Star/Delta transformation. Superposition theorem. Unit-III: (9 Periods) AC Circuits: AC waveform definitions, form factor, peak factor, study of R-L, R-C, RLC series circuit, phasor representation in polar and rectangular form, concept of impedance, admittance, active, reactive, and apparent power, power factor, 3 phase Balanced AC Circuits for Star and Delta connections. Unit-IV: (10 Periods) Electrostatics and Electro-Mechanics: Electrostatic field, electric field strength, concept of permittivity in dielectrics, capacitors in series and parallel, energy stored in capacitors, magnetic field and Faraday's law, self and mutual inductance, Magnetic circuit, Magnetic material and B-H Curve, Single phase transformer, principle of operation, EMF equation, voltage ratio, current ratio, KVA rating. Construction, Principle of operation of DC generator and motor. Unit-V: (10 Periods) Measurements and Sensors: Basic concept of indicating and integrating instruments, Introduction to measuring devices/sensors and transducers (Piezoelectric and thermo-couple) related to electrical signals, Elementary methods for the measurement of electrical quantities in DC and AC systems (Current & Single- phase power), Types of Wiring System, Necessity of earthing and Types of earthing. Course Outcomes: After completion of course, the student should be able to 1. Apply the circuit laws and network reduction techniques to solve electrical circuits for branch voltages and currents. (L3) 2. Apply the network theorems for circuits to find the voltages and currents. 3. Solve the voltages and currents in single phase and balanced three phase AC circuits. (L3) 4. Explain the concepts of electric and magnetic fileds and demonstrate the working principles of single phase transformer & DC machines. (L2) 5. Apply the concept of sensors in measurement of various electrical quantities and demonstrate the types of wiring & earthing. (L3) Text Books: 1. Electric Machinery, (Sixth Edition) A.E. Fitzgerald, Kingsely Jr Charles, D. Umans Stephen, Tata McGraw Hill. 2. A Textbook of Electrical Technology,(vol. I),B. L. Theraja, Chand and Company Ltd., New Delhi. 3. Basic Electrical Engineering, V. K. Mehta, S. Chand and Company Ltd., New Delhi. 4. Theory and problems of Basic Electrical Engineering, (Second Edition), J. Nagrath and Kothari, Prentice Hall of India Pvt. Ltd. Reference Books: 1. Basic of Electrical Engineering, T. K. Nagsarkar and M. S. Sukhija, Oxford University Press. T. K. Nagsarkar and M. S. Sukhija, Basic of Electrical Engineering, Oxford University Press, 2011. 2. Introduction toElectrodynamics, D. J. Griffiths, (Fourth Edition), Cambridge University Press. 3. Engineering Circuit Analysis, William H. Hayt& Jack E. Kemmerly, McGraw-Hill Book Company Inc. 4. Fundamentals of Electrical and Electronics Engineering,Smarjith Ghosh, Prentice Hall (India) Pvt. Ltd. B V Raju Institute of Technology/B.Tech. CSBS w.e.f. 2020-2021 STATISTICAL METHODS I YEAR I SEM CODE: A61N3 L T P C 3 0 0 3 Course Objectives: To learn 1. Concepts of sampling distributions 2. Concepts of correlation, regression and ANOVA 3. Concepts of estimations and sufficient statistic 4. Concepts of test of hypothesis, parametric and nonparametric inferences 5. Concepts of time series analysis and forecasting Unit-I: Sampling Techniques (9 Periods) Random sampling, sampling from finite and infinite populations, Estimates and standard error (Sampling with replacement and sampling without replacement), sampling distribution of sample mean, stratified random sampling. Unit-II: Linear statistical models: (9 Periods) Scatter diagram, Simple linear regression & correlation, multiple regressions &multiple correlations, Analysis of variance (one way, two ways with as well as without interaction) Unit-III: Estimation (8 Periods) Point estimation, criteria for good estimates (un-biasedness, consistency), Methods of estimation including maximum likelihood estimation, Sufficient Statistic: Concept & examples, complete sufficiency, their application in estimation. Unit-IV: Test of Hypothesis and Non-Parametric Inference (14 Periods) Concept & formulation, Type-I and Type-II errors, Neyman Pearson lemma, Procedures of testing, Comparison with parametric inference, Use of order statistics, Sign test, Wilcoxon signed rank test, Mann-Whitney test, Run test, Kolmogorov-Smirnov test. Spearman’s and Kendall’s test, Tolerance region, Unit-V: Basics of Time Series Analysis & Forecasting (8 Periods) Stationary, ARIMA Models: Identification, Estimation and Forecasting. Course Outcomes: After completing the course, the students will be able to: 1. Characterize the huge data using sampling techniques 2. Apply correlation, regression and ANOVA in statistical data. 3. Apply complete sufficiency in estimation 4. Examine the statistical hypothesis and apply different tests in statistical inference 5. Apply the time series analysis in forecasting Text books: 1. Probability and Statistics for Engineers, I. R. Miller, J. E. Freund and R. Johnson, 4th Edition, PHI, 2011. 2. Fundamentals of Statistics, Vol. I & Vol. II, A. Goon, M. Gupta and B. Dasgupta, World Press, 2016. 3. The Analysis of Time Series: An Introduction with R, Chris Chatfield and Haipeng Xing, 7th Edition, CRC press, 2019. References: 1. Introduction to Linear Regression Analysis, D. C. Montgomery & E. Peck, 3rdEdition, Wiley, 2006. 2. Introduction to the Theory of Statistics, A. M. Mood, F. A. Graybill and D. C. Boes, 3rd Edition, McGraw Hill Education, 2017. 3. Applied Regression Analysis, N. Draper & H. Smith, John Wiley & Sons, 1966. B V Raju Institute of Technology/B.Tech. CSBS w.e.f. 2020-2021 BUSINESS COMMUNICATION & VALUE SCIENCE – I I YEAR I SEM CODE: L T P C A61N4 2 0 0 2 COURSE OBJECTIVES: 1. To understand what life skills are and their importance in leading a happy and well-adjusted life. 2. To motivate students to look within and create a better version of self. 3. To introduce them to key concepts of values, life skills and business communication. Unit-I: Life Skills and Values (8 classes) Self-Introduction, Demonstration of Skills and Values (Through a Presentation), Importance of Business Communication. Self-awareness, Recognizing one’s Strengths and Opportunities, Identity, Body Awareness and Stress Management. Activity: Write a Newspaper Report, A Conversation Between a Celebrity and an Interviewer, etc. Unit-II: Basic Tenets of Communication (8 classes) Overview of Communication Skills, Types of Communication, Verbal and Non-verbal Communication, Barriers of Communication, Effective Communication, Difference between Listening and Hearing, Types of Listening. Parts of Speech, Tense, Sentence Formation, Common Errors, Questions and Question Tags. Activity: Skit (Communication Skills Based), Listening Comprehension, etc. Unit-III : Verbal Communication (8 classes) Pronunciation, Clarity of Speech, Art of Questioning, Phrases, Idioms, Significant Abbreviations, GSL & AWL. Activity: Create a Podcast, etc. Unit-IV: Written Communication (8 classes) Email Writing, Summary Writing, Story Writing, Letter Writing, CV Writing. Activity: Story Writing, etc. Unit-V: Realities of Facing Life (ROFL) (8 classes) Life Skills (understanding and application), Movie Based Learning, Critical Life Skills, Multiple Intelligence, Embracing Diversity, Leadership, Team Work, Dealing with Ambiguity, Motivating People, Creativity. Activity: Community Service with an NGO and make a presentation, Field Work, etc. COURSE OUTCOMES: After completing the course, students will be able to 1. Recognize the need for life skills and values and perform SWOT analysis. 2. Understand the basic tenets of communication. 3. Understand the importance of oral communication and appropriate usage of vocabulary in business contexts. 4. Apply the basic communication practices in different types of written communication. 5. Apply the life skills to different situations. Reference Books: 1. English vocabulary in use – Alan Mc’carthy and O’dell 2. APAART: Speak Well 1 (English language and communication) 3. APAART: Speak Well 2 (Soft Skills) 4. Business Communication – Dr. Saroj Hiremath Web References: 1. Train your mind to perform under pressure- Simon sinek 2. https://curiosity.com/videos/simon-sinek-on-training-your-mind-to-perform-under-pressure- capture-your-flag/ 3. Brilliant way one CEO rallied his team in the middle of layoffs 4. https://www.inc.com/video/simon-sinek-explains-why-you-should-put-people-before-numbers.html 5. Will Smith’s Top Ten rules for success 6. https://www.youtube.com/watch?v=bBsT9omTeh0 Online Resources: 1. https://www.coursera.org/learn/learning-how-to-learn 2. https://www.coursera.org/specializations/effective-business-communication B V Raju Institute of Technology/B.Tech. CSBS w.e.f. 2020-2021 FUNDAMENTALS OF COMPUTER SCIENCE LAB I YEAR I SEM CODE: L T P C A611K 3 0 0 1.5 COURSE OBJECTIVES: 1. To gain a working knowledge of C programming to write modular, efficient and readable C programs by Identifying the structural elements and layout of C source code 2. To declare and manipulate single and multi-dimensional arrays of the C data types and derived data types like structures, unions 3. To use functions from the portable C library and to describe the techniques for creating program modules using functions and recursive functions 4. To manipulate character strings in C programs. Utilize pointers to efficiently solve problems LIST OF EXPERIMENTS: WEEK 1: Algorithm and flowcharts of small problems like GCD Structured code writing with: WEEK 2: Small but tricky codes WEEK 3: Proper parameter passing WEEK 4: Command line Arguments WEEK 5: Variable parameter WEEK 6: Pointer to functions WEEK 7: User defined header WEEK 8: Make file utility WEEK 9: Multi file program and user defined libraries WEEK 10: Interesting substring matching / searching programs WEEK 11 & WEEK 12: Parsing related assignments COURSE OUTCOMES: After the completion of the course, the student will be able to 1. Use various data types for a specified problem 2. Design, implement, debug a given problem using appropriate language constructs 3. Implement programs using modular approach, file I/O 4. Solve a given problem using C language TEXT BOOKS: 1. The C Programming Language, (Second Edition) B. W. Kernighan and D. M. Ritchi, PHI. 2. Programming in C, (Second Edition)B. Gottfried, Schaum Outline Series. REFERENCE BOOKS: 1. C: The Complete Reference,(Fourth Edition), Herbert Schildt, McGraw Hill. 2. Let Us C, Yashavant Kanetkar, BPB Publications. B V Raju Institute of Technology/B.Tech. CSBS w.e.f. 2020-2021 PRINCIPLES OF ELECTRICAL ENGINEERING LAB I YEAR I SEM L T P C CODE: A612B PRE- 0 0 2 1 REQUISITES: The students should have the knowledge on 1) Basics of mathematics, vectors, calculus, algebra & trigonometry. 2) Principles of magnetic materials, magnetic flux. 3) Ammeters, voltmeters & multi meters. 4) Definitions and properties of electric current, voltage and power. COURSE OBJECTIVES: The course should enable the student’s ability to 1) Provide working knowledge on basic electrical circuit laws and principles. 2) Impart a basic knowledge on safety precautions and cut-out sections of electrical machines. (Any of 2-Demonstrations and 8 other experiments from below are mandatory) List of Experiments: 1. Demonstration: Basic safety precautions. Introduction and use of measuring instruments – voltmeter, ammeter, multi-meter, oscilloscope. Real-life resistors, capacitors and inductors. 2. Demonstration of cut-out sections of machines: DC machine (commutator-brush arrangement). 3. Demonstration of measurement of electrical quantities in DC and AC systems. 4. Verification of KVL and KCL. 5. Verification of Thevenin’s theorem. 6. Verification of Superposition theorem. 7. Verification of Norton’s theorem. 8. Verification of Maximum Power Transfer theorem. 9. Verification of RMS, Average value, Form factor of a sinusoidal AC waveform. 10.Simulation of R-L-C series circuits for XL>XC and XL< XC. 11. Simulation of Time response of RC circuit. 12. Verification of relation in between voltage and current in three phase balanced star connected load. 13.Verification of relation in between voltage and current in three phase balanced delta connected load. 14.Load test on single phase transformer. Course Outcomes: After completion of course, the student should be able to 1. Determine the branch currents and voltages using KCL, KVL, superposition, Thevenin’s, Norton’s theorems and Maximum Power Transfer theorem on given circuit. (L3) 2. Demonstrate the cut-out sections of DC machines and AC machines with their performance characteristics. (L3) 3. Examine RMS, Average value, Form factor of a sinusoidal AC waveform. (L3) 4. Simulate the electrical circuits using suitable software. (L3) 5. Determine the relation between voltage and current in three phase balance star and delta connected loads. 6. Determine the efficiency of single phase transformer. (L3) B V Raju Institute of Technology/B.Tech. CSBS w.e.f. 2020-2021 STATISTICAL METHODS LAB I YEAR I SEM CODE: A614N L T P C COURSE OBJECTIVES: The objective(s) of this course is to, 0 0 3 1.5 1. Explore various stages of data analytics life cycle and Tools used in data analytics. 2. Understand the programming in R. 3. Use various data analysis models like regression modelling 4. Analyze the usage and importance of statistical methods in building computer applications. LIST OF EXPERIMENTS 1. Exploring R, R-Studio Environment and Installation process. Explore the features 2. Explore the data types of R and demonstrate the basic operations on data types. 3. Create vectors and matrices 4. Explore the control structures of R and demonstrate with one example under each case. 5. Create R functions and use them with simple scripts. 6. Explore Data Analytics Life Cycle. 7. Importing & exporting the data from i) CSV file ii) Excel File 8. Data Visualization through i. Histogram ii. Pie Chart iii. Box Plot iv. Density Plots 9. Demonstrate simple linear regression analysis. Analyze results in detail. 10.Demonstrate multiple regression models. Analyze results in detail. 11. Demonstrate Logistic regression model. Analyze results in detail. 12. Demonstrate other regression model. Analyze results in detail. Note: Minimum 8 experiments are to be performed Course Outcomes: After completing the course, the students will be able to: 1. Explore the basic features of R and R Studio environment. 2. Explore the data types and programming constructs of R with examples. 3. Import and export raw data 4. Explore Data Visualization 5. Analyze the data using regression models. TEXT BOOKS: 1. R for Beginners, SandipRakshit, Mc Graw Hill Education. 2. R-The Statistical Programming Language by Dr. Mark Gardner of Wiley India Pvt. Ltd., REFERENCE BOOKS: 1. R Programming, A.K.Verma of Cengage Learning 2. Hands-on Programming with R,- Garrett Grolemund 3. R for Everyone: Advanced Analytics and Graphics, Jared P.Lander. Data source: www.rbi.org.in B V Raju Institute of Technology/B.Tech. CSBS w.e.f. 2020-2021 LINEAR ALGEBRA I YEAR II SEM L T P C CODE: A62N1 3 0 0 3 Course Pre-Requisites: Set, Relation, Mapping, Permutations and Combinations Course Objectives: To learn 1. Concepts of matrices and solution of system of linear equations by Cramer’s rule and inverse of a matrix. 2. Concepts of a rank of the matrix and apply this to solve the system of linear equations. 3. The concepts of Orthogonality and Orthonormality of vectors. 4. Eigenvalues and Eigenvectors of matrices 5. Introduction onSingular Value Decomposition, and Principal Component Analysis UNIT-I:SystemofLinear Equations-I (10 Periods) Introduction to Matrices and Determinants, Solution of Linear Equations, Cramer’s rule, Inverse of a Matrix. UNIT-II:System ofLinearEquations-II (10 Periods) Vectors and linear combinations Rank of a matrix, Gaussian elimination, LU Decomposition, Solving Systems of Linear Equations using the tools of Matrices. UNIT-III: Vector Spaces (10 Periods) Vector Space, Dimension, Basis, Orthogonality, Projections, Gram-Schmidt Orthogonalization process, QR decomposition. UNIT-IV:EigenvaluesandEigenvectors (9 Periods) Eigenvalues and eigenvectors, positive definite matrices, linear transformations, Hermitian and Unitary matrices. UNIT-V: SVD and PCA (9 Periods) Singular Value Decomposition, Principal Component Analysis, Introduction totheir applications in Image Processing and Machine Learning. COURSE OUTCOMES: After completing the course, the students will be able to: 1. Apply matrix determinants technique to solve the system of linear equations (L3) 2. Apply Gaussian elimination and LU-Decomposition methods to solve the system of linear equations(L3) 3. Apply Orthogonality and Orth normality of vectors in QR-Decomposition(L3) 4. Find the Eigenvalues and Eigenvectors of matrices 5. Apply SVD and PCA in image Processing and Machine Learning TEXT BOOKS: 1. Higher Engineering Mathematics, B. S. Grewal, Khanna Publishers. REFERENCE BOOKS: 1. Advanced Engineering Mathematics, (Seventh Edition), Peter V. O'Neil, Cengage Learning. 2. Advanced Engineering Mathematics, (Second Edition), Michael. D. Greenberg, Pearson. 3. Introduction to linear algebra, (Fifth Edition), Gilbert Strang, Wellesley-Cambridge Press. 4. Applied Mathematics (Vol. I & II), P. N. Wartikar& J. N. Wartikar, Pune VidyarthiGrihaPrakashan. 5. Digital Image Processing, R C Gonzalez and R E Woods, Pearson. WEB SOURCE: https://machinelearningmastery.com/introduction-matrices-machine-learning B V Raju Institute of Technology/B.Tech. CSBS w.e.f. 2020-2021 PHYSICS FOR COMPUTING SCIENCE I YEAR II SEM CODE: L T P C A62N2 3 0 0 3 COURSE OBJECTIVES: 1. To study fundamentals of periodical oscillations. 2. To understand the basic properties of light. 3. To study the fundamentals of quantum mechanics and crystal structures. 4. To understand basic lasing action, study various types of lasers and to learn the principle of optical fiber 5. To understand the fundamental laws in thermodynamics. UNIT-I (9 Periods) Oscillations: Periodic motion-simple harmonic motion-characteristics of simple harmonic motion- vibration of simple spring-mass system, damped harmonic oscillator–heavy, critical and light damping, energy decay in a damped harmonic oscillator, forced oscillations and resonance in mechanical and electrical systems, quality factor. UNIT-II (9 Periods) Wave Optics: Interference: Theory of interference in thin films, Newton’s rings experiment, Diffraction- two kinds of diffraction-difference between interference and diffraction- Fraunhofer diffraction at single slit, plane diffraction grating; temporal and spatial coherence; Polarization- Brewster’s law, double refraction, Nicol prism. plane, elliptical and circularly polarized light, UNIT-III (10 Periods) Quantum Mechanics: Matter waves, de-Broglie wave length, Heisenberg’s Uncertainty principle, time- independent Schrödinger wave equation, physical significance of wave function, particle in a one- dimensional potential well. Crystallography: Basic terms-types of crystal systems, Bravais lattices, Miller indices, d-spacing, Atomic packing factor for SC, BCC, FCC and HCP structures UNIT-IV (9 Periods) Lasers and Fiber Optics: properties of laser beams: mono-chromaticity, coherence, directionality and brightness, Einstein’s theory of matter-radiation interaction and A and B coefficients; amplification of light by population inversion, different types of lasers: Ruby, He-Ne, Semi conductor diode laser, applications of lasers in engineering. Fibre optics: Principle, Acceptance angle, Numerical Aperture, types of optical fibers and applications. UNIT-V (9 Periods) Thermo dynamics: Zeroth law of thermo dynamics, first law of thermo dynamics, application of first law, second law of thermo dynamics and concept of entropy, change in entropy in reversible and irreversible processes, third law of thermodynamics. COURSE OUTCOMES After completion of the course, the student will be able to 1. Use the fundamentals of oscillatory systems and the analogy of mechanical and electrical systems 2. Use interference, diffraction and polarization in optical systems 3. Apply the fundamentals of quantum mechanics, crystallography and solid state physics 4. Describe the working of a few commonly used lasers and classify optical fibers and describe their applications 5. Use the three laws of thermodynamics and apply them to a heat engine B V Raju Institute of Technology/B.Tech. CSBS w.e.f. 2020-2021 TEXT BOOKS: 1. A Beiser, Concepts of Modern Physics, 5/e, McGraw HillInternational,1995. 2. David Halliday, RobertResnick and Jearl Walker, FundamentalsofPhysics,10/e, ileyplus,2013. REFERENCE BOOKS: 1. Ajoy Ghatak, Optics,5/e,Tata McGrawHill,2012. 2. Sears &ZemanskyUniversityPhysics,Addison-Wesley. 3. Jenkins and White, Fundamentals of Optics, 3/e,McGraw-Hill,1957. B V Raju Institute of Technology/B.Tech. CSBS w.e.f. 2020-2021 DATA STRUCTURES THROUGH C++ I YEAR II SEM CODE: A62E2 L T P C 2 1 0 3 COURSE PRE-REQUISITES: C Language COURSE OBJECTIVES: 1. To impart the basic concepts of object-oriented programming and data structures 2. To introduce various searching and sorting techniques 3. To demonstrate operations of linear and non-linear data structure 4. To develop an application using suitable data structure UNIT-I: (9Periods) The Fundamentals of Object-Oriented Programming: Necessity for OOP, Data Hiding, Data Abstraction, Encapsulation, Class, and Object. Scope of Class and Scope Resolution Operator, Member Function of a Class, private, protected, and public Access Specifier, this Keyword, Constructors and Destructors, friend class. Generic Programming: Template concept, class template, function template, template specialization Input and Output: Streams, Files UNIT-II: (6Periods) Linear Data Structure: Array, Stack, Queue (Linear and Circular), Linked list (single and double) , Various Representations, Operations & Applications of Linear Data Structures. UNIT-III: (5 Periods) Non-linear Data Structures: Trees (Binary Tree, Threaded Binary Tree, Binary Search Tree, B & B+ Tree, AVL Tree, Splay Tree) UNIT-IV: (6 Periods) Non-linear Data Structures: Graphs (Directed, Undirected), Various Representations, Operations (search, traversal algorithms and complexity analysis) & Applications of Non- Linear Data structures. UNIT-V: (8 Periods) Searching and Sorting on Various Data Structures: Sequential Search, Binary Search, Breadth First Search, Depth First Search, Insertion Sort, Selection Sort, Shell Sort, Merge Sort, Quick Sort, Heap Sort, Introduction to Hashing. COURSE OUTCOMES: After completion of the course, the student will be able to 1. Understand the specification of object-oriented programming. 2. Analyze basic concepts of data structures. 3. Understand linear data structures, various sorting, searching techniques. 4. Apply various operations on linear and non-linear data structures. 5. Identify appropriate and efficient data structure to implement a given problem. TEXT BOOKS: 1. Fundamentals of Data Structures, E. Horowitz and S. Sahni, 1977. 2. object-oriented programming in C++ Robert Lafore. 3. The C++ Programming Language, Bjarne Stroustrup, Addison Wesley. B V Raju Institute of Technology/B.Tech. CSBS w.e.f. 2020-2021 REFERENCE BOOKS: 1. The Art of Computer Programming: Volume 1: Fundamental Algorithms, Donald E. Knuth 2. Introduction to Algorithms, Thomas, H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein. 3. Open Data Structures: An Introduction (Open Paths to Enriched Learning), 31st Edition, Pat Morin.. B V Raju Institute of Technology/B.Tech. CSBS w.e.f. 2020-2021 PRINCIPLES OF ELECTRONICS ENGINEERING L T P C I YEAR II SEM CODE: 2 0 0 2 A62B1 COURSE OBJECTIVES: 1. To understand the principle of operation and characteristics of various semiconductor devices 2. To study the applications of various semiconductor devices 3. To understand the concepts of feedback in amplifiers 4. To know about analog and digital IC’s UNIT-I: ( 9 Periods) Semiconductors: Energy band theory, Fermi levels; Conductors, Semiconductors & Insulators: electrical properties, Semiconductors: intrinsic & extrinsic, energy band diagram, P and N-type semiconductors, and drift & diffusion currents. Diodes and Diode Circuits: Formation of P-N junction, forward and reverse biased P-N junction, V-I characteristics, Linear piecewise model, Junction capacitance, Zener diode and its reverse characteristics. Rectifier circuits: half wave, full wave, PIV, DC voltage and current, ripple factor, efficiency, regulation. UNIT-II: (9 Periods) Bipolar Junction Transistors: Formation of PNP / NPN junctions; transistor mechanism and principle of transistors, CE, CB, CC configuration, transistor characteristics: cut- off, active and saturation mode, transistor action, injection efficiency, base transport factor and current amplification factors; Biasing and Bias stability: calculation of stability factor. UNIT-III: ( 7 Periods) Field Effect Transistors: Concept of Field Effect Transistors (channel width modulation), Gate isolation types, JFET structure and characteristics, MOSFET structure and characteristics, depletion and enhancement type; CS, CG, CD configurations; CMOS: Basic Principles. UNIT-IV: ( 10 Periods) Feed Back Amplifier, and Operational Amplifiers: Feed Back Amplifier : Concept of feedback, Block diagram, feedback factor, open loop gain, loop gain, properties, positive and negative feedback, topologies of feedback amplifier, effect of feedback on gain, output impedance, input impedance, sensitivities (qualitative), bandwidth stability Operational Amplifiers: Introduction to integrated circuits, operational amplifier and its terminal properties; Application of operational amplifier; Inverting and non- inverting mode of operation, Adders, Subtractors, Voltage follower, Comparator, Integrator, Differentiator. UNIT-V: (7 Periods) Digital Electronics Fundamentals: Difference between analog and digital signals, Boolean algebra,BasicandUniversal Gates,Symbols,Truthtables,logicexpressions, Logic simplification using K- map, Logic ICs: half and full adder/subtractor, multiplexers, de-multiplexers, flip-flops. COURSE OUTCOMES: After completion of the course, the student will be able to 1: Explain the principles of operation and substantiate the applications of Diode 2: Explain the principles of operation of Transistors and FET’s 3: Understand the effect of feedback in amplifiers 4: Apply the knowledge of analog IC’s 5: Apply digital electronics for various applications TEXT BOOKS: 1. Millman’s Integrated Electronics, Jacob Millman, Christos Halkias, Chetan Parikh, 2nd Edition, TMH, 2010. 2. Op-Amps and Linear ICs, Ramakanth A. Gayakwad, 4th Edition, PHI, 2016. 3. Digital Logic & Computer Design, M. Morris Mano, 4th Edition, PHI, 2016. B V Raju Institute of Technology/B.Tech. CSBS w.e.f. 2020-2021 REFERENCE BOOKS: 1. Electronic Devices and Circuit Theory, Robert L. Boylestad, Louis Nashelsky, 11th Edition, Pearson Publishers, 2015. 2. Solid State Electronic Devices, Ben Streetman, Sanjay Banerjee, 7th Edition, PHI, 2016. 3. Electronic Principle, Albert Paul Malvino, 3rd Edition, TMH, 2010. 4. Microelectronics, Jacob Millman, Arvin Grabel, 2nd Edition, TMH, 2000. 5. Electronics Devices and Circuits, S. Salivahanan, N. Suresh Kumar, A.Vallavaraj, 2nd Edition, TMH, 2011. B V Raju Institute of Technology/B.Tech. CSBS w.e.f. 2020-2021 FUNDAMENTALS OF ECONOMICS I YEAR II SEM CODE: A62P1 L T P C 3 0 0 3 COURSE OBJECTIVES: 1. To provide a unifying theme of managerial decision making around the theory of firm by introducing tools such as demand and supply analysis. 2. To analyze consumer behavior w r t select, buy, use and dispose goods, services and ideas based on the effects of price change, income change and substitutions. 3. To get acquainted with various production theories, various costs and their role in cost minimization and various market structures such as perfect and imperfect competition. 4. To gain knowledge on important elements of Nation’s economic environment (National Income, National Product, Exports, Imports, Taxes, subsidies, etc.)and evaluate economic models describing the demand and supply of money. 5. To measure polices and paradigms which are influencing business cycle and stabilization. UNIT-I: 10 Lectures Principles of Demand and Supply – Supply Curves of Firms – Elasticity of Supply; Demand Curves of Households – Elasticity of Demand; Equilibrium and Comparative Statics (Shift of a Curve and Movement along the Curve); Welfare Analysis – Consumers’ and Producers’ Surplus – Price Ceilings and Price Floors. UNIT-II: 10 Lectures Consumer Behavior – Axioms of Choice – Budget Constraints and Indifference Curves; Consumers’ Equilibrium – Effects of a Price Change, Income and Substitution Effects – Derivation of a Demand Curve; Applications – Tax and Subsidies – Intertemporal Consumption – Suppliers’ Income Effect. UNIT-III: 9 Lectures Theory of Production – Production Function and Isoquants – Cost Minimization; Cost Curves - Total, Average and Marginal Costs – Long-Run and Short-Run Costs; Equilibrium of aFirm Under Perfect Competition; Monopoly and Monopolistic Competition. UNIT-IV: 10 Lectures National Income and its Components – GNP, NNP, GDP, NDP; Consumption Function; Investment; Simple Keynesian Model of Income Determination and the Keynesian Multiplier – Government Sector – Taxes and Subsidies; External Sector – Exports and Imports; Money – Definitions; Demand for Money – Transactionary and Speculative Demand; Supply of Money. UNIT-V: 9 Lectures Bank’s Credit Creation Multiplier; Integrating Money and Commodity Markets – IS, LM Model – Business Cycles and Stabilization – Monitory and Fiscal Policy – Central Bank and the Government; The Classical Paradigm – Price and Wage Rigidities - Voluntary and Involuntary Unemployment. COURSE OUTCOMES: After completion of this course, the student will be able to 1. Explain the theory of the firm and various micro-economics tools such as demand and supply analysis that would help in forward planning and decision making 2. Summarize production theories, factors of production, various costs and revenue concepts. 3. Apply the above conceptual knowledge to the various market structures under perfect and imperfect completion. 4. Classify the components of National Income with the help of income determination tools and examine the policies and procedures of Government sector and external sectors of imports and exports in monitory operations by considering demand and supply of money. 5. Compare the existing business cycles and its stabilization considering monetary policies and paradigms which are influencing price-wage rigidities and unemployment. TEXT BOOKS: 1. Microeconomics, Pindyck, Robert S., and Daniel L. Rubinfeld, 8th Edition, Pearson Education, 2017. 2. Macroeconomics, Dornbusch, Fischer and Startz, 13th Edition, McGraw-Hill,2018. 3. Economics, Paul Anthony Samuelson, William D. Nordhaus, 19th Edition, McGraw- Hill,2012. REFERENCE BOOKS: 1. Intermediate Microeconomics: A Modern Approach, Hal R. Varian, 9th Edition, Springer, 2014. 2. Principles of Macroeconomics, N. Gregory Mankiw, 7thEdition , Cengage India, 2012. B V Raju Institute of Technology/B.Tech. CSBS w.e.f. 2020-2021 BUSINESS COMMUNICATION & VALUE SCIENCE – II I YEAR II SEM L T P C CODE: A62N3 2 0 0 2 COURSE OBJECTIVES: 1. To develop effective writing, reading, presentation and group discussion skills. 2. To help students identify personality traits and evolve as a better team player. 3. To introduce them to key concepts of a) Morality b) Behaviour and beliefs c)Diversity & Inclusion UNIT-I: (5 classes) Tools for Structural Written Communication- Good and Bad Writing, Common Errors, Punctuation Rules, Use of Words Practical: Ice Breaker, Individual Identification of Social Issues (Group Discussion). Research on Social Issues, Plan, Design, Create and Launch E-magazine. UNIT-II: (6 classes) Introduce to Basic Presentation Skills & ORAI app, Reading Skills- Skimming and Scanning (Practice) Practical: Form an NGO – Create Vision, Mission, Value Statement, Tagline and Design a Logo, Prepare and Publish the Second Episode of the E-magazine. UNIT-III: (7 classes) Introduction of Dr. Meredith Belbin and his Research on Team Work and How Individuals Contribute, Belbin’s 8 Team Roles, Lindgren’s Big 5 Personality Traits and Belbin’s 8 Team Player Styles. Practical: Brain Storming Session (to discuss and explore the means of articulation and amplifying the social issues their NGOs are working for). Design a Skit. Prepare and Publish the Third Episode of the E-magazine. UNIT-IV: (6 classes) Diversity and Inclusion, Different Forms of Diversity in Our Society, TCS Values (Discussion) Respect for Individual and Integrity. Practical: A Short Film on Diversity (Discussion on Key Take Awayas) Touch the Target (Blind Man)- The Fish and I (film) by Babak Habibifar. Create a Story, Write a Review in Blog, Video Record Interviews of People from Diverse Groups and a Debate. Prepare and Publish the Final Episode of the E-magazine UNIT-V: (5 classes) PROJECT WORK: A Day with the NGO: Look for an NGO, Spend a Day with NGO, Render Voluntary Service, Invite the NGO to Address Students, Host an Interactive Session and Final Presentation. COURSE OUTCOMES: After completing the course, students will be able to 1. Understand and use tools of structured written communication and use electronic/social media to share concepts and ideas. 2. Apply effective techniques to make presentations and Understand tools for reading, and apply the basic concept of speed reading, skimming and scanning. 3. Identify individual personality types and roles in a team and recognize the concepts of outward behaviour and internal behaviour. 4. Understand the basic concepts of morality and diversity; and argue on a topic based on morality and diversity. 5. Articulate opinions, influence others and organize an event to generate awareness, and get support for a cause. REFERENCE BOOKS: 1. Guiding Souls: Dialogues on the purpose of life; Dr. A.P.J Abdul Kalam;Publishing Year-2005; Co-author- -Arun Tiwari 2. The Family and the Nation; Dr. A.P.J Abdul Kalam; Publishing year: 2015; Co-author: Acharya Mahapragya 3. The Scientific India: A twenty First Century Guide to the World around Us; Dr. A.P.J Abdul Kalam; Publishing year: 2011; Co-author- Y.S.Rajan 4. Forge Your Future: Candid, Forthright, Inspiring ; Dr. A.P.J Abdul Kalam; Publishing year: 2014 5. Abundance: The Future is Better Than You Think; Peter H. Diamandis and Steven Kotler; Published: 21 Feb, 2012; Publisher: Free Press B V Raju Institute of Technology/B.Tech. CSBS w.e.f. 2020-2021 6. Start With Why: How Great Leaders Inspire Everyone to Take Action; Simon Sinek; Published: 6 October 2011; Publisher: Penguin 7. Advertising & IMC: Principles and Practice; Sandra Moriarty, Nancy D.Mitchell, William D. Wells; Published: 15 June 2016; Publisher: Pearson Education India WEB REFERENCES: 1. Ethics Fundamentals and Approaches To Ethics ï‚· https://www.eolss.net/Sample-Chapters/C14/E1-37-01-00.pdf 2. A Framework for Making Ethical Decisions ï‚· https://www.brown.edu/academics/science-and-technology-studies/framework-making-ethical- decisions 3. Five Basic Approaches to Ethical Decision- ï‚· http://faculty.winthrop.edu/meelerd/docs/rolos/5_Ethical_Approaches.pdf ONLINE RESOURCES: 1. https://youtu.be/CsaTslhSDI 2. https://m.youtube.com/watch?feature=youtu.be&v=IIKvV8_T95M 3. https://m.youtube.com/watch?feature=youtu.be&v=e80BbX05D7Y 4. https://m.youtube.com/watch?v=dT_D68RJ5T8&feature=youtu.be 5. https://m.youtube.com/watch?v=7sLLEdBgYYY&feature=youtu.be B V Raju Institute of Technology/B.Tech. CSBS w.e.f. 2020-2021 APPLIED PHYSICS LAB (For CSE, CSE(AI&ML), CSE(DS), AI&DS, IT, ECE, EEE, ME, CIVIL, CHE, PHE, BME, CSBS) I YEAR II SEM CODE: L T P C A621N 0 0 3 1.5 COURSE OBJECTIVES: 1. To provide hands on experience on some important physics concepts like wave propagation, resonance effect of electrical circuit and to estimate the errors. 2. To measure the characteristics of magnetic materials. 3. To understand the energy gap of semiconductors and the characteristics of various devices such as PN junction diode, Zener diode and solar cell. 4. To make student better understand on the properties of light using interference and diffraction phenomenon. LIST OF EXPERIMENTS 1. Measurement of errors using simple pendulum experiment 2. LCR Circuit: To determine the resonance frequency & quality factor of LCR Circuit in series and parallel combinations. 3. B-H curve: To study the B-H curve of given magnetic material. 4. Energy gap: To determine the energy gap of semiconductor material of P-N Junction 5. Solar cell: To study V-I characteristics of Solar cell 6. PN-junction diode and Zener diode: To study the V-I characteristics of PN junction diode and Zener diode 7. A) LASER: To determine the wavelength of given LASER source using diffraction grating B) Optical fiber: To determine the acceptance angle and numerical aperture of given optical fiber 8. Newton’s rings experiment: To calculate the radius of curvature of given plano convex lens by forming Newton’s rings 9. Torsional Pendulum: To determine the rigidity modulus of wire using Torsional Pendulum by dynamical method 10. Sonometer: To determine the frequency of AC supply using sonometer. 11. Melde’s experiment – Transverse & Longitudinal modes: To determine the frequency of electrically driven tuning fork using Melde’s arrangement 12. RC-circuit: To estimate the time constant of RC circuit Note: Minimum 8 experiments have to be performed COURSE OUTCOMES: After completing the course, the students will be able to: 1. Carry out data analysis and compare LCR circuit with mechanical oscillator by understanding the resonance and wave propagation. 2. Understand the concept of the energy band gap of semiconductor materials and behaviour of various semiconductor devices. 3. Apply the physical properties of light to calculate wavelength of LASER beam using diffraction grating. 4. Gain the knowledge on the behaviour of hysteresis curve. LABORATORY MANUAL: 1. Laboratory Manual of Engineering Physics by Dr. Y. Aparna & Dr. K. Venkateshwara Rao (V.G.S Publishers). 2. Practical Physics by G L Squires, Cambridge University press, Cambridge, 1985. 3. Physics Lab Manual, BVRIT. B V Raju Institute of Technology/B.Tech. CSBS w.e.f. 2020-2021 DATA STRUCTURES THROUGH C++ LAB I YEAR II SEM CODE: A624E L T P C 0 0 3 1.5 COURSE OBJECTIVES: 1. Identify and practice the basic concepts of object-oriented programming 2. To impart the basic concepts of data structures and algorithms 3. To learn the concepts about searching and sorting 4. To understand the basic concepts about stacks, queues, lists List Of Programs: Week 1: 1. Sample programs using C++ concepts. 2. Sample programs using classes. Week 2: 3. Programs on Parameter passing methods, Inline functions, Static members, Access specifiers. 4. Programs on default arguments, constructors, Constructor overloading, destructors, “this‟ pointers. Week 3: 5. Programs on function overloading, Operator Overloading. 6. Programs on function and class templates. Week 4: 7. Program to implement Stack operations using arrays. 8. Program to implement Queue operations using arrays. Week 5: 9. Program to implement Circular queue operations using arrays. 10. Program to implement Single Linked List. Week 6: 11. Program to implement Stack operations using linked list. 12. Program toimplement Queue operations using linked list. Week 7: 13. Program to convert Infix expression to Postfix expression. 14. Program to Evaluate Postfix expression. Week 8: 15. Program to implement binary tree traversal. 16. Program to implement Insertion and Deletion operations in binary search tree. Week 9: 17. Program to implement Breadth first search. 18. Program to implement Depth first search. Week 10: 19. Program to implement Linear search. 20. Program to implement Binary search. Week 11: 21. Program to implement Insertion sort. 22. Program to implement Selection sort. 23. Program to implement Shell sort. Week 12: 24. Program to implement Merge sort. 25. Program to implement Quick sort. 26. Program to implement Heap sort. COURSE OUTCOMES: After completion of the course, the student will be able to 1. Understand the concepts of Object-Oriented Programming 2. Implement all operations on different linear data structures 3. Develop all operations on different non-linear data structures 4. Apply various searching techniques in real time scenarios 5. Apply various sorting techniques in real time scenarios B V Raju Institute of Technology/B.Tech. CSBS w.e.f. 2020-2021 Text Books: 1. Fundamentals of Data Structures, E. Horowitz, S. Sahni,S. A-Freed, Universities Press. 2. Data Structures and Algorithms,A. V.Aho, J. E.Hopperoft, J. D.UIlman, Pearson. Reference Books: 1. The Art of Computer Programming: Volume 1: Fundamental Algorithms, Donald E. Knuth. 2. Introduction to Algorithms, Thomas, H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, The MIT Press. 3. Open Data Structures: An Introduction (Open Paths to Enriched Learning), (Thirty First Edition), Pat Morin, UBC Press B V Raju Institute of Technology/B.Tech. CSBS w.e.f. 2020-2021 PRINCIPLES OF ELECTRONICS ENGINEERING LAB I YEAR II SEM CODE: A622B L T P C 0 0 2 1 COURSE OBJECTIVES: 1. To know the characteristics of various semiconductor devices 2. To verify the functionality and applications of analog IC’s 3. To verify the functionality of digital IC’s LIST OF EXPERIMENTS: Simulation of any 3 or 4 experiments using open source software 1. Forward and Reverse Bias V-I characteristics of PN junction Diode. 2. V-I characteristics of Zener diode. 3. Full wave rectifier. 4. Characteristics of a BJTunderCBconfiguration. 5. Characteristics of a BJT underCEconfiguration. 6. JFET characteristics under CS configuration. 7. Inverting and Non-Inverting amplifiers using IC 741 Op-Amp. 8. Adder, subtractor and comparator using IC 741 Op-Amp. 9. Integrator using IC 741 Op-Amp. 10. Differentiator using IC 741 Op-Amp 11. Truth table verification of Logic gates. 12. Truth table verification of Half-Adder and Full Adder. COURSE OUTCOMES: After completion of the course, the student will be able to 1. Analyze the characteristics of various semiconductor diode and its application. 2. Analyze the characteristics of BJT and FET. 3. Understand the functionality of analog and digital IC’s. B V Raju Institute of Technology/B.Tech. CSBS w.e.f. 2020-2021 L T P C FORMAL LANGUAGE AND AUTOMATA THEORY 3 0 0 3 II YEAR I SEM CODE: A63K1 Course Objectives: 1. Discuss the relationships between languages and machines such as FA, PDA, LBA and TM. 2. Identify a language’s location in the Chomsky hierarchy (regular sets, context- free, context- sensitive, and recursively enumerable languages). 3. Convert among equivalently powerful notations for a language, including among DFAs, NFAs, and regular expressions, and between PDAs and CFGs. 4. Build the foundation for students to pursue research in the areas of automata theory, formal languages, compiler design and computational power of machines. UNIT-I: Introduction: Alphabet, languages and Chomsky hierarchy of languages, deterministic finite automata (DFA), nondeterministic finite automata (NFA) and equivalence with DFA, Myhill-Nerode theorem and its uses, minimization of finite automata, Meelay & Moore machines. UNIT-II: Regular languages and finite automata: Regular expressions, deterministic finite automata (DFA) and equivalence with regular expressions, grammars, productions and derivation, and languages, regular grammars and equivalence with finite automata, properties of regular languages, Kleene’s theorem, pumping lemma for regular languages. UNIT-III: Context-free languages and pushdown automata: Context-free grammars (CFG) and languages (CFL), Chomsky and Greibach normal forms, deterministic push down automata, nondeterministic pushdown automata (PDA) and equivalence with CFG, pumping lemma for context-free languages, closure properties of CFLs. Context- sensitive languages: Context-sensitive grammars (CSG) and languages, linear bounded automata and equivalence with CSG. UNIT-IV: Turing machines: The basic model for Turing machines (TM), Turing recognizable (recursively enumerable) and Turing-decidable (recursive) languages and their closure properties, variants of Turing machines, nondeterministic TMs and equivalence with deterministic TMs, unrestricted grammars and equivalence with Turing machines, TMsas enumerators. UNIT-V: Undecidability: Church-Turing thesis, universal Turing machine, the universal and diagonalization languages, reduction between languages and Rice s theorem, undecidable problems about languages. Basic Introduction to Complexity: Introductory ideas on Time complexity of deterministic and nondeterministic Turing machines, P and NP, NP- completeness, Cook’s Theorem, other NP -Complete problems. B V Raju Institute of Technology/B.Tech. CSBS w.e.f. 2020-2021 Course Outcomes: After completion of the course, the student will be able to: 1. List computational devices according to their computational power, and tools which allow usto tell if adeviceispowerful enough to solve agiven computational problem. 2. Relate the concepts of the grammar with the concept of programming language. 3. Design Solutions for problems related to Finite Automata, RE, CFG, PDA and Turing Machine. 4. Analyze the properties of deterministic and non-deterministic Turing machines. 5. Analyze various problems and categorize them into P, NP, NP- Complete and NP-Hard problems. Text books: 1. IntroductiontoAutomataTheory,Languages,andComputationJohn E.Hopcroft, Rajeev Motwani and Jeffrey D. Ullman. References: 1. Elements of the Theory of Computation, Harry R. Lewis and Christos H. Papadimitriou. 2. Automata and Computability, Dexter C. Kozen. 3. Introduction to the Theory of Computation, Michael Sipser. 4. Introduction to Languages and the Theory of Computation, John Martin. B V Raju Institute of Technology/B.Tech. CSBS w.e.f. 2020-2021 L T P C COMPUTER ORGANIZATION AND ARCHITECTURE 3 0 0 3 II YEAR I SEM CODE: A63KA Course Objectives: 1. Describe the functional blocks of a computer to interpret the instructions and various addressing modes for the execution of the instruction cycle. 2. Perform Arithmetic micro-operations on integers and Floating point numbers. 3. Analyze the cost performance and design trade-offs in designing and constructing a computer processor including memory. 4. Discuss the different ways of communicating with I/O devices & interfaces and the design techniques to enhance the performance using and pipelining, parallelism. UNIT-I: Basics of conversions from/to Binary, decimal, octal, hexa. Circuits: half adders, full adders, flip-flops. Functional blocks of a computer: CPU, memory, input-output subsystems, control unit. Instruction set architecture of a CPU: Introduction to x86 architecture. Registers & Register transfer, instruction execution cycle, RTL interpretation of instructions, addressing modes, instruction set. UNIT-II: Data representation: Complements, Signed number representation, fixed and floating point representations, character representation, IEEE 754 format. Computer arithmetic: Integer addition and subtraction, ripple carry adder, carry look- ahead adder, etc. multiplication – shift-and-add, Booth multiplier, carry save multiplier, etc. Division restoring and non- restoring techniques, floating point arithmetic. UNIT-III: CPU control unit design: Hardwired and micro-programmed design approaches, design of a simple hypothetical CPU. Memory system design: Semiconductor memory technologies. Memory organization: Memory interleaving, concept of hierarchical memory organization, cache memory, cache size vs. block size, mapping functions, replacement algorithms, write policies. UNIT-IV: Peripheral devices and their characteristics: Input-output subsystems, I/O device interface, I/O transfers – preprogram-controlled interrupt driven and DMA, privileged and non-privileged instructions, software interrupts and exceptions. Programs and processes–role of interruption process state transitions, I/O device interfaces–SCII, USB UNIT-V: Pipelining: Basic concepts of pipelining, throughput and speedup, pipeline hazards. Parallel Processors: Introduction to parallel processors, Concurrent access to memory and cache coherency. B V Raju Institute of Technology/B.Tech. CSBS w.e.f. 2020-2021 Course Outcomes: After completion of the course, the student will be able to 1. Interpret the functional architecture of computing systems. 2. Understand different representations of data and arithmetic operations. 3. Impart the knowledge on micro programming 4. Explore memory, control and I/O functions. 5. Analyze instruction-levell parallelism, Concepts of advanced pipeline techniques. Text Books: 1. Computer System Architecture M. M. Mano:, 3rd ed., Prentice Hall of India, New Delhi, 1993. 2. Computer Organization and Design: The Hardware/Software Interface, David A. Patterson and John L. Hennessy. 3. Computer Organization and Embedded Systems, Carl Hamacher. References: 1. Computer Architecture and Organization, John P. Hayes. 2. Computer Organization and Architecture: Designing for Performance, William Stallings. 3. Computer System Design and Architecture, Vincent P. Heuring and Harry F. Jordan. B V Raju Institute of Technology/B.Tech. CSBS w.e.f. 2020-2021 Advanced Data Structures through C++ L T P C II B.Tech I SEM 3 0 0 3 CODE: A63K2 Pre-requisites: Basic knowledge in Programming. Objectives: 1. To introduce and practice advanced algorithms and programming techniques necessary for developing sophisticated computer application programs 2. To learn new techniques for solving specific problems more efficiently and for analyzing space and time requirements. 3. 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: The Fundamentals of Object-Oriented Programming: Necessity for OOP, Data Hiding, Data Abstraction, Encapsulation, Procedural Abstraction, Class and Object, Scope of Class and Scope Resolution Operator, Member Function of a Class, private, protected, and public Access Specifier. Unit II Priority Queues: Definition, realizing a Priority Queue using Heaps, Insertion, Deletion, Heap sort, External Sorting. Dictionaries: Linear List Representation, Skip List Representation, Operations- Insertion, Deletion and Searching. Unit III: Hashing: Hash Table Representation, Hash Functions, Collision Resolution Separate Chaining, Open Addressing - Linear Probing, Quadratic Probing, Double Hashing, Rehashing, Extendible Hashing, Comparison of Hashing and Skip Lists. Unit IV: Trees: Basic Terminology, Binary Tree, Array and Linked List Representations, Traversals, Threaded Binary Trees. Search Trees (Part I): Binary Search Trees- Definition(ADT), Implementation, Operations- Searching, Insertion and Deletion, AVL Trees, Definition, Operations – Insertion and Searching. Search Trees (Part II): B-Trees- Definition, B-Tree of Order m, Insertion, Deletion and Searching, Redblack Trees and Splay Trees. Unit V: Graphs: Basic Terminology, Representations of Graphs, Graph Search Methods: DFS, BFS. Text Processing Pattern Matching Algorithms: Brute Force, The Knuth-Morris-Pratt Algorithm, Tries: Standard Tries, Compressed Tries, Suffix Tries. Course Outcomes: Upon the successful completion of the course, the student will be able: 1. Analyze performance of algorithms with respect to complexities, trace and code recursive functions, understanding of various searching algorithms. 2. Understand operations on linear data structures such as stacks, queues to solve various computing problems and Implement these data structures in more than one manner. 3. Classify different linked lists and their operations, Compare different implementations to recognize the advantages and disadvantages. B V Raju Institute of Technology/B.Tech. CSBS w.e.f. 2020-2021 4. Understand the linked implementation use in non-linear data structures such as Binary Tree and Binary Search Tree and Tree traversals such as in, pre, post. 5. Understand graph types and their representations. Know the usage of graph traversal algorithms. Textbooks: 1. Data Structures, Algorithms and Applications in C++, S.Sahni, University Press (India) Pvt.Ltd, Second edition, Universities Press Orient Longman Pvt. Ltd. 2. Data Structures and Algorithm Analysis in C++, Mark Allen Weiss, Pearson Education. Ltd., Second Edition. References: 1. Data Structures and Algorithms in C++, Michael T.Goodrich, R.Tamassia and.Mount, Wiley Student Edition, John Wiley and Sons. 2. Data Structures and Algorithms in C++, Third Edition, Adam Drozdek, Thomson 3. Data Structures using C and C++, Langsam, Augenstein and Tanenbaum, PHI. 4. Advanced Data Structures and Algorithms in C++, V.V. Muniswamy Jaaico Publishing House. 5. H. S. Wilf, Algorithms and complexity, Prentice hall. 6. T. H. Cormen, C. E. Leiserson, R. L. Rivest, Introduction to Algorithms, Prentice hall. 7. K. Vishwanathan Iyer, Lecture notes for classroom use. B V Raju Institute of Technology/B.Tech. CSBS w.e.f. 2020-2021 L T P C COMPUTATIONAL STATISTICS 2 0 0 2 II B.Tech I SEM CODE: A63K3 COURSE OBJECTIVES: To learn 1. Multidimensional generalization of a univariate normal random variable. 2. Concept of multivariable linear regression model 3. Linear discriminant function analysis 4. Data Summarization and data reduction using Factor analysis 5. Grouping the data using Cluster analysis UNIT - I: Multivariate Normal Distribution: Multivariate Normal Distribution Functions, Conditional Distribution and its relation to regression model, Estimation of parameters. UNIT-II: Multiple Linear Regression Model: Standard multiple regression models with emphasis on detection of collinearity, outliers, non-normality and autocorrelation, Validation of model assumptions. UNIT-III: Multivariate Regression: Assumptions of Multivariate Regression Models, Parameter estimation, Multivariate Analysis of variance and covariance UNIT-IV: Discriminant Analysis: Statistical background, linear discriminant function analysis, Estimating linear discriminant functions and their properties. Principal Component Analysis: Principal components, Algorithm for conducting principal component analysis, deciding on how many principal components to retain, H-plot. UNIT-V: Factor Analysis: Factor analysis model, Extracting common factors, determining number of factors, Transformation of factor analysis solutions, Factor scores. Cluster A

Use Quizgecko on...
Browser
Browser