With effect from the acader ‘year 2020-21 CHAITANYA BHARATHI INSTITUTE OF TECHNOLOGY (AUTONOMOUS) With effect from 2020-21 MCA (Master of Computer Applications) SEMESTER 1 Schemeot Scheme ol] Scheme of fxamination S.No | Course Code | Title of the Course Hesiie aa Duratio | Maximum Credits week para [Marks ut |v |in cae | see Hours "THEORY 1 [eomecion [ComputerPreeramming Tat - Ts | a | oo | « 2 | zomecioz | omer fsanzatonard ant. | 3 | 40 | 6 | 4 3 [zomcci0s [sonwaresngineerng | af - | 3 | a | o | « cao | Mathematical Foundations 4 | 20MCC104 | for computer Applications | 3/1] ~ a a | s 5 |zomrcer [Pronabinyasiusis | anf - | 3 | « | o | « PRACTICALS Computer Programming 6 | zoncctos | rapusing a]. os [0] 0] 2 7 [zomccioe | Prion Progamnngiae | [a [= | so [so | 2 Profesional 8 | zoecio1 | Communication in a] | so} so | 2 English Lab TOTAL > | - [a0 | aso [26 1s Lecture T: Tutorial P: Practical CIE: Continuous Internal Evaluation SEE: Semester End ExaminationWith effect from the academic year 2020-21 COMPUTER PROGRAMMING USING ‘C* 2oMecr01 Instruction ALA1T Hours per week Duration of Semester End Examination 3 Hours Semester End Examination (60 Marks Continuous Internal Evaluation 40 Marks Credits 4 Course Outeomes: After completion of the course, the students will be able to 1. Design algorithms and draw flowcharts for various problems, 2. Choose various data types which are sultable for the problems and distinguish the concepts of control structures. Develop programs using functions and preprocessor directives. Apply array and pointer concepts in solving various problems. Unilize the concepts of strings and structures in various problems, Bulld programs by using dynamic memory allocation and file managementconcepts. UNIT=1 Algorithm, flowchart, structured programming, program development steps, creating and running programs, structure of aC program, character set, keywords, identifiers, constants, basic data types and sizes, variables, operators, operator precedence and associativity, expressions, evaluating expressions, type conversions, basic formatted Input/output statements, decision control structures: if and switch statements, loop control structures: while, do-while and for, continue, break. UNIT Functions: Basic concepts, user defined functions, parameter passing, local variables, global variables, recursive functions, comparison of iteration and recursion, standard library functions, header files, storage classes, preprocessor. UNIT 1H Arrays: Basic concepts, one-dimensional array, passing of arrays to functions, searching and sorting: linear seatch, binary search and bubble sort, two-dimensional array, muti-dimensional array. Pointers: Basic concepts, pointers as function arguments, pointer arithmetic, pointers to pointers, pointers and one-dimensional arrays, pointers and two-dimensional arrays, array of pointers. UNIT=1v Strings: Basic concepts, string 1/O operations, pointers and strings, string manipulation functions. ‘Structures: Dedlaration, definition and initiallaation of structures, accessing structures, nested structures, array of structures, structures and functions, pointers to structures, self-referential structures, unions, ‘enumerated types, typedet, uNIT-v Dynamic memory management functions, command line arguments, Files: Basic concepts, text fle, binary files, basic file 1/0 operations, sequentil-access files, random-access files, ‘Text Books: 41, Pradip D and Manas G, "Programming in C", 2" Edition, Oxford Unlversity Press,2007. 2. BAA. Forouzan and RP.Gilberg."Computer science, A structured programming approach using C”, 38 Bdition, Cengage Learning, 2007.With effect from the academic year 2020-21 Suggested Reading: ‘BW Kernighan DM Ritchi India, 1998. J Deitel and H.M Deitel, “C How to program , 6 Edition, PHI,2010. Yashwant Kanetkar, "Let us C*, 13! Edition, BPB Publications, 2013. E Balaguru Swamy, Programming in ANSI C”, 5% Edition, Tata McGraw-Hill, 2007. KR Venugopal and S R Prasad, “Mastering C’, McGraw-Hill, 2007. “The C programming Language", 2» Edition, Prentice HallWith effect from the academic year 2020-21 ‘COMPUTER ORGANIZATION AND ARCHITECTURE 2oMec102 Instruction 3L+1T Hours per week Duration of Semester End Examination 3 Hours Semester End Examination 660 Marks Continuous internal Evaluation 40Maris Credits 4 Course Outcomes: After completion of the course, the students will be able to: ‘Acquaint with the operations and utilities of Boolean algebra and K Maps Evaluate the work implementation of digital components, sequential and combinationaleircuits Lear the basic computer organization and its design. Understand the components of CPU and their functionality Appreciate the input-output and memory organization ‘Analyze Parallel processing concepts and its applicability. UNIT 4 Digital Logic Cireuits and Components: Data types and Number systems, Logic Gates, aolean algebra, 3 and 4 Variable K Maps, Half Adder and Full Adder, SR flip flop and D ip lop, Integrated Circuits, Decoder, Multiplexers, Registers, Shift Registers UNIT-IL Register Transfer and Micro Operations: Register Transfer language, Register transfer, Bus and Memory ‘Transfer, Arithmetic Micro operations, Logic Micro operations, Shift Micro operations and Arithmetic logic shift unit Basic Computer Organization and Design: Instruction codes, CPU Registers, Computer Instructions, Timing and Control, Instruction Cyeles, Memory Reference Instructions, Input, Output and Interrupts UNIT A Central Processing Unit: Micro programmed Control, Control Memory, Address Sequencing, Design of Control Unit. General Register Organization, Stack Organization, Instruction Formats, Nine Addressing Modes, Data Transfer and Manipulation, Program Control. UNIT IV Input-Output and Memory Organization: Peripheral Devices, I/O output interface, Asynchronous data uransfer, Modes of transfer, Priority Interrupts, DMA controller and DMA process, Input output Processor, Serial Communication. Usefulness of Cache Memory, 3 types of Cache Memory mapping procedures UNIT-v Parallel Processing; Introduction to Parallel Processing, Shared Memory Multiprocessing, Abstract model of Parallel Computer, Parallel Processing Mechanism, Multi Programming and Time Sharing, Pipeline Computers, Serial V/s Parallel Processing, Parallelism V/s Pipelining. Text Books: 1. M.Morris Mano, "Computer System Architecture", Pearson Asia/Prentice Hall, 3edn 2007, 2, MSasi Kumar, Dinesh Shikhare, P. Ravi Prakash, Introduction to Parallel Processing” Published by PHI- 2°! Edition 2014. Suggested Reading: 1, William Stallings, "Computer Organization & Architecture", Pearson Education, Sixth Edi 2. Kai Hwang and Faye A.iggs, “Computer Architecture and Parallel Processing” Inter Edition, 1984. on, 2003, jonalWith effect from the academic year 2020-21 SOFTWARE ENGINEERING 2oMeC103 Instruction ALA1T Hours per week Duration of Semester End Examination 3 Hours Semester End Examination (60 Marks, Continuous internal Evaluation 40 Maris, Credits 4 ‘Course Outeomes: ‘After completion of the course, the students wall be able to: 1, Understand the basles of software engineering principles and importance of software requirement’ specification. 2, Acquire the knowledge and requirement of software development models. 4. Identify the importance of software design and architecture principles and models. 4, Acquaint with the software testing approaches and levels of testing 5. Learn the concepts of risk management, software reengineering, reverse engineering and software maintenance activities. UNIT Introduction to Software Engineering: Software Engineering Challenges, Software Engineering approach, Soltware Process, Waterfall, erative, Prototype, Incremental, Spiral Model, V model. UNIT. Requirements specification, SRS Structure, Problem analysis, IEEE format of SRS, Function Oriented Design: Design Principles, Module-level concepts, Design notations and specifications, coupling and cohesion concepts UNIT Structured design methodology, Software Architecture: Role of Software Architecture, Architecture views, Component and Connector view. Risk Engineering - Risk Analysis and Management. RMI Techniques. UNITAY Effort Estimations, Schedule Estimation, Software cost Estimation, COCOMO, Function Point Analysis. White box and black box testing approaches, unit testing, integration testing, system testing, acceptance testing. UNII-V Software Maintenance, Maintenance activities, Sofware Reengine Engineering, Software configuration management. 1g, Reverse Engineering, Forward ‘Text Books: 1, Pankaj Jalote,"An Integrated Approach to Software Engineering’, Edition, Narosa PublishingHouse, 2010. 2, Roger S, Pressman’s, "Software Engineering: A Practitioners Approael Grit, 2010, , 6" Edition, Tata MeWith effect from the academic year 2020-21 MATHEMATICAL FOUNDATIONS FOR COMPUTER APPICATIONS 2oMCCI04 Instruction ALHIT Hours per week Duration of Semester End Examination 3 Hours Semester End Examination 60 Marks Continuous internal Evaluation 40 Marks Credits 4 ‘Course Outeomes: After completion of the course the students will be able to: 1. Understand the required propositional logic to test the logic of a program. Examine various properties of Relations and Functions, Identify the basics of Linear Algebra in the form of Matrices and Vectors. Synthesize the Importance of minimization and Least Squares in data analysis and fitting, Expose the principle of Inclusion and Exclusion as a basis for various Permutations and Combinations, 5, Evaluate the procedural knowledge on Graphs and Trees ta derive applications in Computer Sctenee, UNIT-1 Fundamentals of Logie: Basic Connectives and Truth Tables, Logical Equivalence, Logical Implication, Use of Quantifiers, Definitions and the Proof of Theorems. Boolean algebru: Switching Functions, Logic gates, Don't Care Condition Set Theory: Sets and Subsets, Set operations and the Laws of Set theory Counting and Venn Diagrams. UNIT-11 Functions: Cartesian product, Functions, Onto Functions, Special Functions, Pigeonhole Principle, Composition and Inverse Functions, Computational Complexity. Relations: Partial Order Relations, Lattices, Equivalence Relations and Partitions. UNIT Linear Algebra: Linear Algebraic Systems- Matrices and Vectors, Matrix Inverses, Transposes and Symmetric Matrices, Practical Linear Algebra ~ Tridiagonal Matrices and Pivoting strategies, Vector Spaces: Real Vector Spaces and Sub spaces, Norms. Minimization and Least Squares: Minimization Problems, Minimization of Quadratic Functions, The Closest Point and Least Squares, Data Fitting and Interpolation, Eigen values and Eigen Vectors, introduction to Gradient Descendent Algorithm, UNIT=1V Principles of Inclusion and Exclusion: Introduction, G& Polynomial, Arrangements with Forbidden Position alization of principle, Derangements, Rooks UNIT Graph Theory: Definitions and examples, Sub graphs, Complements and graph fsomorphism, Vertex degree, Planar graphs; Hamiltonian paths and Cycles, Graph coloring, Trees: Definitions, Properties and ‘examples, Rooted Trees, Spanning Trees and Minimum Spanning Trees. Text Hooks: 1, Ralph P. Grimaldi, Discrete and Combinatorial Mathematics", Pearson Education, 4* Edition, 2003. 2, Peter |. Olver, ChehrzadShakiban, “Applied Linear Algebra", Springer International Publishing, 2e4 Edition, 2018, Suggested Reading: 1. Kenneth it Rosen, ‘Discrete Mathematics and its Applications* Tata McGraw Hill, 6! Edlition, 2007, 2, JP Tremblay & R, Manohar, "Discrete Mathematical Structures with Applications to computer science” MeGraw Hill. 1987. 3. Joe L Mott, Akandalé T.P. Baker, “Discrete Mathematics for Compute Scientists & ‘Mathematicians’, Prentice Hall NJ, 1986 4, Kevin Ferland, "Diserete Mathematics", Houghton MiMlin Company, 2009. 10With effect from the academic year 2020-21 PROBABILITY AND STATISTICS 2oMrc27 Instruction ALAIT Hours per week Duration of Semester End Examination 3 Hours Semester End Examination 60 Marics Continuous internal Evaluation 40 Maris Credits 4 ‘Course Outeomes: (On successful completion of this course the students shall be able to 1, Calculate the measures of skewness. 2. Apply probability on continuous and discrete random variables. 3, Use the basic probability for ituing the Random phenomenon, 4, Apply various tests for testing the significance of sample data, 5, Use the principle of Least Squares approximation for estimation of the data. UNIT Basie statisties: Measures of Central Tendency: Mean, Median, Mode. Measures of Dispersion: Quartile deviation, Standard deviation, Coefficient of dispersion, Coefficient of variation. Skewness: Karl Pearson's Coefficient of skewness, Bowley’s Coefficient of Skewness and Kurtosis. Moments about a point and Moments about the Mean. UNIT-L Probability and Mathematical Expectation: Probability, Addition Theorem of probability, Conditional Probability, Multiplication theorem of probability, Bayes Theorem, Random variable, discrete random variable, continuous random variable, Properties of probability mass function and probability density function, Mathematical expectation, properties of expectation, properties of variance and covariance, UNIT-ME: Probability Distributions: Discrete probability distribution: Poisson distribution, Mean, Varanee, MCF, CGF, fiting of Poisson distribution. Continuous probability distributions: Normal disteibution, Standard Normal random varlable Expectation, Variance, MGF (with out proof), CGF, Properties of Normal Curve and Areas under Normal curve, Exponential distribution, Expectation, Variance, MGR, CGR. UNIT-Y; ‘Testing of Hypotheses: Test of significance, null and alternative hypotheses, Errors in sampling, level of significance. Large sample test: Test of significance for single proportion, difference of proportions, single ‘mean and difference of means. t-Test for single mean, differences of Means. F- test for equality of two population variances, Chi-Square test of Goodness of ft. UNIT! Regression and Curve Fitting: Correlation: karl pearson's coelficient of correlation. Linear Regression: Lines of regression, properties of regression coeticients. Curvilinear regression: iting of Parabola, fitting ofa power curve” = °°, Fitting of Exponential eurves = 10! 2700 = ‘Text hooks 1. SC Gupta, V.K. Kappoor, “Fundamentals of Mathematical Statistics”, Sultan Chand and Sons, 2014. 2, Sheldon Ross, “A First Course in Probability’, 9% Edition, Pearson publications, 2014, Suggested Reading: 1, Walpole, H. Myers, L. Myers, Ye, "Probability and statisti for engineers & Scintists’ 9 Edition, Pearson Publications, 2016. 2. SC. Gupta, ‘Fundamentals of Statistics’, Himalaya publishing, 7% Edition 2014. W