Course Outcomes and Programme Outcomes Mapping for Engineering Courses, Exams of Software Engineering

Download Course Outcomes and Programme Outcomes Mapping for Engineering Courses and more Exams Software Engineering in PDF only on Docsity! Handbook of B.Tech. Part of B.Tech. / M. Tech. (Dual Degree Programmes) offered by USICT in its campus. Applicable from Batch Admitted in Academic Session 2021-22 Onwards Page 126 of 160 Paper Code: ICT 204 / ICT 217 Paper: Computational Methods L T/P C Paper ID: 4 0 4 Prerequisite Paper: ICT Marking Scheme : 1. Teacher’s Continuous Evaluation : 25 marks 2. Term and Theory Examinations : 75 marks Instructions for paper setter 1. There should be 9 questions in the term end examinations question paper. 2. The first (1st) question should be compulsory and cover the entire syllabus. This question should be objective, single line answers or short answer type questions of total 15 marks. 3. Apart from question one which is compulsory, rest of the paper shall consists of four units as per the syllabus. Every unit shall have two questions covering the corresponding unit of the syllabus. However, the student shall be asked to attempt only one of the two questions in the unit. Individual questions may contain up to 5 sub-parts/sub-questions. Each unit shall have a marks weightage of 15. 4. The questions are to be framed keeping in view the learning objectives of course/paper. The standard /level of the questions to be asked should be at the level of the prescribed text box. 5. The requirement of (scientific) calculators/log tables/data-tables may be specified if required. Course Objectives : 1. To understand numerical methods to find roots of functions and first order unconstrained minimization of functions. 2. To introduce concept of interpolation methods and numerical integration. 3. To understand numerical methods to solve systems of algebraic equations and curve fitting by splines. 4. To understand numerical methods for the solution of Ordinary and partial differential equations. Course Outcomes (CO) CO 1 Ability to develop mathematical models of low level engineering problems CO 2 Ability to apply interpolation methods and numerical integration. CO 3 Ability to solve simultaneous linear equations and curve fitting by splines CO 4 Ability to numerically solve ordinary differential equations that are initial value or boundary value problems Course Outcomes (CO) to Programme Outcomes (PO) mapping (scale 1: low, 2: Medium, 3: High) PO01 PO02 PO03 PO04 PO05 PO06 PO07 PO08 PO09 PO10 PO11 PO12 CO 1 3 2 2 2 2 - - - 2 2 2 3 CO 2 3 2 2 2 2 - - - 2 2 2 3 CO 3 3 3 3 3 2 - - - 2 2 2 3 CO 4 3 3 3 3 2 - - - 2 2 2 3 UNIT-I Review of Taylor Series, Rolle ’s Theorem and Mean Value Theorem, Approximations and Errors in numerical computations, Data representation and computer arithmetic , Loss of significance in computation Location of roots of equation: Bisection method (convergence analysis and implementation), Newton Method (convergence analysis and implementation), Secant Method (convergence analysis and implementation). Unconstrained one variable function minimization by Fibonacci search, Golden Section Search and Newton’s method. Multivariate function minimization by the method of steepest descent, Nelder- Mead Algorithm. UNIT-II Interpolation: Assumptions for interpolation, errors in polynomial interpolation, Finite differences, Gregory- Newton’s Forward Interpolation, Gregory-Newton’s backward Interpolation , Lagrange’s Interpolation, Newton’s divided difference interpolation Numerical Integration: Definite Integral, Newton-Cote’s Quadrature formula, Trapezoidal Rule, Simpson’s one-third rule, simpson’s three-eight rule, Errors in quadrature formulae, Romberg’s Algorithm, Gaussian Quadrature formula. UNIT-III System of Linear Algebraic Equations: Existence of solution, Gauss elimination method and its computational effort, concept of Pivoting, Gauss Jordan method and its computational effort, Triangular Handbook of B.Tech. Part of B.Tech. / M. Tech. (Dual Degree Programmes) offered by USICT in its campus. Applicable from Batch Admitted in Academic Session 2021-22 Onwards Page 127 of 160 Matrix factorization methods: Dolittle algorithm, Crout’s Algorithm, Cholesky method, Eigen value problem: Power method Approximation by Spline Function: First-Degree and second degree Splines, Natural Cubic Splines, B Splines, Interpolation and Approximation UNIT - IV Numerical solution of ordinary Differential Equations: Picard’s method, Taylor series method, Euler’s and Runge-Kutta’s methods, Predictor-corrector methods: Euler’s method, Adams-Bashforth method, Milne’s method. Numerical Solution of Partial Differential equations: Parabolic, Hyperbolic, and elliptic equations Implementation to be done in C/C++ Textbook(s): 1. E. Ward Cheney & David R. Kincaid , “Numerical Mathematics and Computing” Cengage; 7th ed (2013). References: 1. R. L. Burden and J. D. Faires, “Numerical Analysis”, CENGAGE Learning Custom Publishing; 10th Edition (2015). 2. S. D. Conte and C. de Boor, “Elementary Numerical Analysis: An Algorithmic Approach”, McGraw Hill, 3rd ed. (2005). 3. H. M. Antia, “Numerical Methods for Scientists & Engineers”, Hindustan Book Agency, (2002). 4. 2. E Balagurusamy “Numerical Methods” McGraw Hill Education (2017). Handbook of B.Tech. Part of B.Tech. / M. Tech. (Dual Degree Programmes) offered by USICT in its campus. Applicable from Batch Admitted in Academic Session 2021-22 Onwards Page 130 of 160 Paper Code: ICT221 Paper: Analog Electronics-I L T/P C Paper ID: 4 0 4 Prerequisite Paper: None Marking Scheme: 1. Teacher’s Continuous Evaluation: 25 Marks 2. Term End Theory Examination: 75 Marks Instruction for paper setter: 1.There should be 9 questions in the term end examinations question paper. 2.The first question should be compulsory and cover the entire syllabus. This question should be objective, single line answers or short answer type questions of total 15 marks. 3.Apart from question 1 which is compulsory, rest of the paper shall consist of 4 units as per the syllabus. Every unit shall have two questions covering the corresponding unit of the syllabus. However the student shall be asked to attempt only one of the two questions in the unit. Individual questions may contain upto five sub- parts/sub-questions. Each unit will have a marks weightage of 15. 4.The questions are to be framed keeping in view the learning outcomes of the course/paper. The standard/level of questions to asked should be at the level of the prescribed textbook. 5.The requirements of (scientific) calculators/ log-tables/ data- tables may be specified if required. Course Objectives: 1. To develop understanding of operation, characteristics, parameters and applications of p-n junction diode 2. To develop understanding about BJT and FET in terms of structure, operation, configurations and characteristics. Also analyse stability and amplifier circuit using small signal models 3. To impart knowledge of cascade amplifiers, coupling schemes, power amplifiers and their analysis 4. To impart knowledge of Feedback amplifiers and oscillators Course Outcome (CO): CO 1 Ability to understand of operation, characteristics, parameters and applications of p-n junction diode CO 2 Ability to understand about BJT and FET in terms of structure, operation, configurations and characteristics and able to analyse stability and amplifier circuit using small signal models CO 3 Ability to understand and analyse cascade amplifiers, coupling schemes in amplifiers and power amplifiers CO 4 Ability to understand feedback amplifiers and oscillators Course Outcomes (CO) to Programme Outcomes (PO) Mapping (Scale - 1: Low, 2: medium, 3: High) CO/PO PO01 PO02 PO03 PO04 PO05 PO06 PO07 PO08 PO09 PO10 PO11 PO12 CO1 3 3 3 3 2 1 1 - 2 1 - 2 CO2 3 3 3 3 2 1 1 - 2 1 - 2 CO3 3 3 3 3 2 1 1 - 2 1 - 2 CO4 3 3 3 3 2 1 1 - 2 1 - 2 UNIT - I Open circuit P-N junction diode, Forward and reverse biased diode, I-V characteristics of diode, Diode Equation, Temperature dependence of diode. Breakdown phenomena, diffusion and transition capacitance of diode. Diode equivalent circuit, Ideal diode. Solar cell. Diode circuits: half-wave and full-wave rectifiers with capacitor filter, clamping and clipping circuits. Zener diodes as voltage regulator. UNIT - II Bipolar Junction transistor (BJT): Structure, modes of operation, Configurations, I-V characteristics, early effect, junction voltages; Transistor Biasing: Need of biasing, load line concept, fixed bias, self-bias, collector to base bias, stability factors, Current Mirrors; hybrid model of BJT amplifier, small signal analysis of CE BJT amplifier using h parameter JFET: Physical structure, I-V characteristics; MOSFET: Depletion and enhancement types, Physical structure and I-V characteristics; FET small-signal model (low & high frequency); MOSFET as resistance and switch, UNIT – III Cascade amplifiers: Analysis of cascade amplifier (voltage gain, current gain, input and output impedances); Darlington pair, Cascode amplifier; Types of coupling: DC, RC and Transformer; RC coupled Amplifier and its frequency response; Differential Amplifier: differential and Common mode operation, CMRR. Handbook of B.Tech. Part of B.Tech. / M. Tech. (Dual Degree Programmes) offered by USICT in its campus. Applicable from Batch Admitted in Academic Session 2021-22 Onwards Page 131 of 160 Power Amplifiers: Classification of output stages (Class A, B, C & AB), Class A Amplifier, Transformer coupled class A amplifier, Push pull amplifiers: Class A and Class B, Harmonic distortion, efficiency, crossover distortion, class AB operation, Class C amplifier. UNIT - IV Feedback Amplifiers: classification, Feedback concept, basic feedback topologies, Characteristics of Negative Feedback, Feedback and stability, gain margin, Noise margin, Sinusoidal Oscillator, Barkhausen criterion, RC phase shift, LC (Colpitt’s, Hartley, Clapp), Crystal Oscillator. Textbook(s): 1. J. Millman, C.C. Halkias and Satyabrata Jit, “Electronic Devices and Circuits”, Tata McGraw Hill, 4th ed. , 1998 2. R. L. Boylestad and N. Nashlesky, “Electronic Devices and Circuit Theory”, Pearson Education, 11th Ed., 2014 References: 1. Adel S. Sedra and Kenneth C. Smith, “Micro Electronic Circuits Theory and Applications,” 5th Edition , OUP, 2004. 2. B. Kumar and S. B. Jain, “Electronic Devices and Circuits””, Prentice Hall of India, 2007 3. S Salivahanan, and N. Suresh Kumar, “Electronic Devices and Circuits”, McGraw Hill Education (India), 2018 4. B.P. Singh and Rekha Singh, “Electronic Devices and Integrated Circuits”, Pearson Education, 2009. 5. J. J. Cathey, “Schaum’s Outline of Theory and Problems in Electronic Devices and Circuits”, McGraw Hill, 2002. Handbook of B.Tech. Part of B.Tech. / M. Tech. (Dual Degree Programmes) offered by USICT in its campus. Applicable from Batch Admitted in Academic Session 2021-22 Onwards Page 132 of 160 Paper Code: ICT223 Paper: Analog Communication L T/P C Paper ID: 3 3 Prerequisite Paper: None Marking Scheme: 1. Teacher’s Continuous Evaluation: 25 Marks 2. Term End Theory Examination: 75 Marks Instruction for paper setter: 1.There should be 9 questions in the term end examinations question paper. 2.The first question should be compulsory and cover the entire syllabus. This question should be objective, single line answers or short answer type questions of total 15 marks. 3.Apart from question 1 which is compulsory, rest of the paper shall consist of 4 units as per the syllabus. Every unit shall have two questions covering the corresponding unit of the syllabus. However the student shall be asked to attempt only one of the two questions in the unit. Individual questions may contain upto five sub- parts/sub-questions. Each unit will have a marks weightage of 15. 4.The questions are to be framed keeping in view the learning outcomes of the course/paper. The standard/level of questions to asked should be at the level of the prescribed textbook. 5.The requirements of (scientific) calculators/ log-tables/ data- tables may be specified if required. Course Objectives: 1. To impart understanding of the concepts of analog communication systems. 2. To impart understanding of various modulation and demodulation techniques of analog communication. 3. To impart understanding of transmitters and receivers in analog communication. 4. To impart understanding of the causes of noise and noise performance of analog communication. Course Outcome (CO): CO 1 To understand the concepts of analog communication systems. CO 2 To understand various modulation and demodulation techniques of analog communication. CO 3 To understand transmitters and receivers in analog communication. CO 4 To understand the causes of noise and noise performance of analog communication. Course Outcomes (CO) to Programme Outcomes (PO) Mapping (Scale - 1: Low, 2: medium, 3: High) CO/PO PO01 PO02 PO03 PO04 PO05 PO06 PO07 PO08 PO09 PO10 PO11 PO12 CO1 3 3 3 3 2 1 1 - 2 1 - 2 CO2 3 3 3 3 2 1 1 - 2 1 - 2 CO3 3 3 3 3 2 1 1 - 2 1 - 2 CO4 3 3 3 3 2 1 1 - 2 1 - 2 UNIT I The Communication Process, Review of Fourier Transforms and Dirac Delta Functions, Transmission through Linear Systems, Filters (low pass and band pass signals), Phase and Group Delay, Sources of Information. Amplitude Modulation: Introduction, Double Sideband – Suppressed Carrier Modulation, Quadrature – Carrier Multiplexing, Single-Sideband and Vestigial-Sideband methods of modulation, Frequency Translation, Frequency-Division Multiplexing UNIT II Angle Modulation: Introduction, Basic Definitions, Frequency Modulation, Phase-Locked Loop, Nonlinear Effects in FM Systems, Superheterodyne receiver. UNIT III Probability and Random Processes: Introduction; Probability; Random Variables, Statistical Averages; Random Processes; Mean, Correlation, and Covariance functions; Transmission of a Random Process Through a Linear Filter, Power Spectral Density, Gaussian Process, Noise, Narrowband Noise UNIT IV Noise: Introduction, Receiver Model, Noise in DSB-SC Receivers, Noise in AM Receivers, Noise in FM Receivers, Pre-emphasis and De-emphasis in FM. Note:The practical list shall be notified by the teacher in the first week of the class commencement. Handbook of B.Tech. Part of B.Tech. / M. Tech. (Dual Degree Programmes) offered by USICT in its campus. Applicable from Batch Admitted in Academic Session 2021-22 Onwards Page 135 of 160 UNIT – IV Waveguides: Rectangular waveguide, characteristic of TE and TM waves- cutoff wavelength and phase velocity impossibility of TEM waves in waveguides- dominant mode, Surface currents, Attenuation, impedances. Circular wave guides- solution of field equations in cylindrical coordinates- TE and TM waves in circular guides – wave impedance and characteristic impedance, Microwave cavities: rectangular cavity resonators, circular cavity resonators- Q-factor. Introduction to antenna: monopole, dipole antenna and microstrip antenna. Textbook(s): 1. M. N.O. Sadiku, “Elements of Electromagnetics”, Oxford Universit y Press. 2. W.H. Hayt, “Engineering Electromagnetics”, Tata McGraw Hill. References: 1. E.C. Jordan & K.G. Balmain, Electromagnetic waves & Radiating Systems, Prentice Hall, India. 2. G. S. Rao, “Electromagnetic Field Theory and Transmission lines” Wiley India. 3. David M. Pozar, “Microwave Engineering” John Wiley -2nd edition Handbook of B.Tech. Part of B.Tech. / M. Tech. (Dual Degree Programmes) offered by USICT in its campus. Applicable from Batch Admitted in Academic Session 2021-22 Onwards Page 136 of 160 Paper Code: ICT 202 Paper: Computer Graphics L T/P C Paper ID: 3 - 3 Prerequisite Paper: ICT209 Marking Scheme : 1. Teacher’s Continuous Evaluation : 25 marks 2. Term and Theory Examinations : 75 marks Instructions for paper setter 1. There should be 9 questions in the term end examinations question paper. 2. The first (1st) question should be compulsory and cover the entire syllabus. This question should be objective, single line answers or short answer type questions of total 15 marks. 3. Apart from question one which is compulsory, rest of the paper shall consists of four units as per the syllabus. Every unit shall have two questions covering the corresponding unit of the syllabus. However, the student shall be asked to attempt only one of the two questions in the unit. Individual questions may contain up to 5 sub-parts/sub-questions. Each unit shall have a marks weightage of 15. 4. The questions are to be framed keeping in view the learning objectives of course/paper. The standard /level of the questions to be asked should be at the level of the prescribed text book. Course Objectives : 1. To introduce fundamentals of computer graphics, types of graphics and Raster graphics algorithms 2. To introduce geometric manipulation in 2D and 3D space, perspective projections, surface and solid modelling. 3. To understand Color models and various illumination models 4. To understand Rendering techniques and Advanced modelling techniques Course Outcomes (CO) CO 1 Ability to understand the usage of the computer graphics primitives and perform the operations on it like clipping etc. CO 2 Ability to perform any editing of operations on geometry of the objects through 2D and 3D transformations as per the requirements and should be able to model curves and surfaces using different techniques. CO 3 Ability to make the model appearance realistic in terms of desired color, material and final appearance calculations. CO 4 Ability to understand the concepts of different rendering techniques and advanced modelling techniques. Course Outcomes (CO) to Programme Outcomes (PO) mapping (scale 1: low, 2: Medium, 3: High) PO01 PO02 PO03 PO04 PO05 PO06 PO07 PO08 PO09 PO10 PO11 PO12 CO 1 3 2 2 2 2 - - - 2 2 1 3 CO 2 3 2 2 2 2 - - - 2 2 1 3 CO 3 3 2 2 3 2 - - - 2 2 1 3 CO 4 3 2 2 3 2 - - - 2 2 1 3 UNIT - I Introduction to graphics and types of graphics, quality parameters of graphics display. Basic raster graphics algorithms for drawing 2 D primitives: DDA line, Bresenham’s line, Bresenham’s circle, midpoint circle, midpoint ellipse. Conic Sections, Clipping of line (Cohen Sutherland algorithm), clipping of polygon (Sutherland Hodgeman algorithm), polygon filling. Attributes of Output primitives, Antialiasing UNIT - II Geometric manipulation in 2D and 3D space, window to viewport transformations, homogeneous coordinates, projections: parallel and perspective projections. Generating curves like Hermite, Bezier and B-spline. Surface generation, wireframe, surface and solid modelling. 3-D polygon surfaces, polygon tables, polygon meshes. UNIT - III Visible surface determination techniques for visible surface determination: Z-buffer, A- buffer algorithm, scanline algorithm, area subdivision algorithm for implementation of hidden surface removal. Achromatic and hardware color models and software color models. Local and global illumination models calculations, Lambert, Gouraud & Phong shading techniques. UNIT - IV Rendering: introduction to ray casting, ray-tracing, recursive ray tracing, and shadows. Advanced Handbook of B.Tech. Part of B.Tech. / M. Tech. (Dual Degree Programmes) offered by USICT in its campus. Applicable from Batch Admitted in Academic Session 2021-22 Onwards Page 137 of 160 procedural modelling: fractals, concept of fractals generation, concept of grammar-based modelling. Textbook(s): 1. D. D. Hearn, M.P. Baker, “Computer Graphics C version”, Pearson Education India, 2nd Edition, 2002. 2. J.D. Foley et. al., “Computer Graphics Principles & Practice in C”, Pearson Education India, 2nd Edition, 2006. References: 1. R.H. Bartels, J.C. Beatty and B.A. Barsky, “An Introduction to Splines for use in Computer Graphics and Geometric Modeling”, Morgan Kaufmann Publishers Inc., 1996. 2. W. M. Newman and R. F. Sproul, “Principles of Interactive Computer Graphics”, McGraw-Hill Education, 2nd Edition, 2001. 3. Z. Xiang and R. Plastock, “Theory and Problems of Computer Graphics”, Schaum’s Series, McGraw Hill, 2nd Edition, 2017. 4. F.P. Preparata and M.I. Shamos, “Computational Geometry: An Introduction”, Springer, Reprint of the original 1st ed. 1985 Edition, 2012. 5. D. Rogers and J. Adams, “Mathematical Elements for Computer Graphics”, McGraw Hill Education, 2nd Edition , 2017. 6. David F. Rogers, “Procedural Elements for Computer Graphics”, McGraw Hill Education, 2nd Edition , 2017. 7. Alan Watt and Mark Watt, “Advanced Animation and Rendering Techniques”, Addison-Wesley, 2002. Handbook of B.Tech. Part of B.Tech. / M. Tech. (Dual Degree Programmes) offered by USICT in its campus. Applicable from Batch Admitted in Academic Session 2021-22 Onwards Page 140 of 160 Paper Code: ICT 208 Paper: Theory of Computation L T/P C Paper ID: 4 0 4 Prerequisite Paper: ICT201 Marking Scheme : 1. Teacher’s Continuous Evaluation : 25 marks 2. Term and Theory Examinations : 75 marks Instructions for paper setter 1. There should be 9 questions in the term end examinations question paper. 2. The first (1st) question should be compulsory and cover the entire syllabus. This question should be objective, single line answers or short answer type questions of total 15 marks. 3. Apart from question one which is compulsory, rest of the paper shall consists of four units as per the syllabus. Every unit shall have two questions covering the corresponding unit of the syllabus. However, the student shall be asked to attempt only one of the two questions in the unit. Individual questions may contain up to 5 sub-parts/sub-questions. Each unit shall have a marks weightage of 15. 4. The questions are to be framed keeping in view the learning objectives of course/paper. The standard /level of the questions to be asked should be at the level of the prescribed text box. 5. The requirement of (scientific ) calculators/log tables/data-tables may be specified if required. Course Objectives : 1. To understand Automata (Deterministic and Non-Deterministic) and Language Theory 2. To understand Context Free Grammar (CFG), Parse Trees and Push Down Automata 3. To introduce the concepts of Turing Machines and Computability Theory 4. To understand Complexity Theory (NP-completess NP-hardness) and Space complexity Course Outcomes (CO) CO 1 Ability to understand the design aspects of “abstract models” of computers like finite automata, pushdown automata, and Turing machines. CO 2 Ability to comprehend the recognizability (decidability) of grammar (language) with specific characteristics through these abstract models. CO 3 Ability to decide what makes some problems computationally hard and others easy? CO 4 A ability to deliberate the problems that can be solved by computers and the ones that cannot? Course Outcomes (CO) to Programme Outcomes (PO) mapping (scale 1: low, 2: Medium, 3: High) PO01 PO02 PO03 PO04 PO05 PO06 PO07 PO08 PO09 PO10 PO11 PO12 CO 1 3 2 2 2 2 - - - 2 1 1 3 CO 2 3 2 2 2 2 - - - 2 1 1 3 CO 3 3 2 2 2 2 - - - 2 1 1 3 CO 4 3 2 2 2 2 - - - 2 1 1 3 UNIT – I Automata and Language Theory: Chomsky Classification, Finite Automata, Deterministic Finite Automata (DFA), Non-Deterministic Finite Automata (NFA), Regular Expressions, Equivalence of DFAs, NFAs and Regular Expressions, Closure properties of Regular grammar, Non-Regular Languages, Pumping Lemma. UNIT - II Context Free Languages: Context Free Grammar (CFG), Parse Trees, Push Down Automata (deterministic and non-deterministic) (PDA), Equivalence of CFGs and PDAs, Closure properties of CFLs, Pumping Lemma, Parsing, LL(K) grammar. UNIT - III Turing Machines and Computability Theory: Definition, design and extensions of Turing Machine, Equivalence of various Turing Machine Formalisms, Church – Turing Thesis, Decidability, Halting Problem, Reducibility and its use in proving undecidability. Rices theorem. Undecidability of Posts correspondence problem., Recursion Theorem. UNIT - IV Complexity Theory: The class P as consensus class of tractable sets. Classes NP, co-NP. Polynomial time reductions. NP-completess, NP-hardness. Cook- Levin theorem (With proof). Space complexity, PSPACE and NPSPACE complexity classes, Savitch theorem (With proof). Probabilistic computation, BPP class. Interactive proof systems and IP class. relativized computation and oracles. Handbook of B.Tech. Part of B.Tech. / M. Tech. (Dual Degree Programmes) offered by USICT in its campus. Applicable from Batch Admitted in Academic Session 2021-22 Onwards Page 141 of 160 Textbook(s): 1. Sipser, Michael. Introduction to the Theory of Computation, Cengage Learning, 2012. 2. J. Hopcroft, R. Motwani, and J. Ullman, Introduction to Automata Theory, Language and Computation, Pearson, 2nd Ed, 2006. References: 1. Peter Linz, An Introduction to Formal Languages and Automata, 6th edition, Viva Books, 2017 1. Maxim Mozgovoy, Algorithms, Languages, Automata, and Compilers, Jones and Bartlett, 2010. 2. D. Cohen, Introduction to Computer Theory, Wiley, N. York, 2nd Ed, 1996. 3. J. C. Martin, Introduction to Languages and the Theory of Computation, TMH, 2nd Ed. 2003. 4. K. L. Mishra and N. Chandrasekharan, Theory of Computer Science: Automata, Languages and Computation, PHI, 2006. 5. Anne Benoit, Yves Robert, Frédéric Vivien , A Guide to Algorithm Design: Paradigms, Methods, and Complexity Analysis, CRC Press, 2013. Handbook of B.Tech. Part of B.Tech. / M. Tech. (Dual Degree Programmes) offered by USICT in its campus. Applicable from Batch Admitted in Academic Session 2021-22 Onwards Page 142 of 160 Paper Code: ICT 210 Paper: Software Engineering L T/P C Paper ID: 3 3 Prerequisite Paper: ICT 101 or ICT209 Marking Scheme : 1. Teacher’s Continuous Evaluation : 25 marks 2. Term and Theory Examinations : 75 marks Instructions for paper setter 1. There should be 9 questions in the term end examinations question paper. 2. The first (1st) question should be compulsory and cover the entire syllabus. This question should be objective, single line answers or short answer type questions of total 15 marks. 3. Apart from question one which is compulsory, rest of the paper shall consists of four units as per the syllabus. Every unit shall have two questions covering the corresponding unit of the syllabus. However, the student shall be asked to attempt only one of the two questions in the unit. Individual questions may contain up to 5 sub-parts/sub-questions. Each unit shall have a marks weightage of 15. 4. The questions are to be framed keeping in view the learning objectives of course/paper. The standard /level of the questions to be asked should be at the level of the prescribed text box. Course Objectives : 1. To introduce the concepts of Software engineering, software processes and its models 2. To understand Software requirements analysis, SRS document, software metrics and system modelling 3. To understand fundamentals of Software Design, Software Quality and software maintenance 4. To understand Software Testing and System Security Course Outcomes (CO) CO 1 Ability to demonstrate fundamentals of software engineering and techniques. CO 2 Ability to develop, maintain and evaluate software systems. CO 3 Ability to produce and execute test cases for software systems using different testing techniques. CO 4 Ability to discover how to evaluate the software quality, evolutionary process and security. Course Outcomes (CO) to Programme Outcomes (PO) mapping (scale 1: low, 2: Medium, 3: High) PO01 PO02 PO03 PO04 PO05 PO06 PO07 PO08 PO09 PO10 PO11 PO12 CO 1 3 3 3 2 3 - - - 2 3 2 3 CO 2 3 3 3 2 3 - - - 2 3 2 3 CO 3 3 3 3 2 3 - - - 2 3 2 3 CO 4 3 3 3 2 3 - - - 2 3 2 3 UNIT - I Introduction: software processes and its models (waterfall, incremental development, spiral model, re-use oriented model, prototype), Process activities, Process improvement (CMM Levels). Agile Development model, plan driven vs agile model of development, agile methods and development techniques (user stories, refactoring, test first development, pair programming, agile project management (SCRUM agile method). UNIT - II Requirement Engineering: Functional and non-functional requirements, requirement elicitation, use case development, requirement analysis and validation, requirement review or requirement change, SRS document. Size Estimation: Software Size, LOC and function point, cost and effort estimation, COCOMO, ISO 9001:2015 Certification. System modelling: Interaction models: Use case diagram, sequence diagrams, Structural models: class diagrams, generalization, aggregation, Behavioural models: ER diagrams, Data flow diagrams, data dictionaries. UNIT - III Software Design: Architectural views and patterns, Modularity (cohesion and coupling), information hiding, functional independence, function oriented design, object oriented design, SOA, SAAS. Software Quality: McCall’s Quality Factors, ISO 9126 Quality Factors, Quality Control, Quality Assurance, Software Reliability. Software Evolution: Evolution process, legacy system, software maintenance: Maintenance prediction, Re- Handbook of B.Tech. Part of B.Tech. / M. Tech. (Dual Degree Programmes) offered by USICT in its campus. Applicable from Batch Admitted in Academic Session 2021-22 Onwards Page 145 of 160 packet filter firewall, proxy firewall. Programming: Socket programming. Textbook(s): 1. B. A. Forouzan and F. Mosharraf, “Computer Networks: A Top-Down Approach”, TMH, 2012 2. James F. Kurose and Keith W.,"Computer Networking: A Top-Down Approach", 7th Edition, Pearson Education, 2017. References: 1. Behrouz A. Forouzan, “Data Communications and Networking”, 5th Edition, Tata McGraw Hill, 2013 2. Andrew S. Tanenbaum and David J. Wetherall, “Computer Networks”, 5th Edition, Pearson Education India 2013. 3. Larry L. Peterson and Bruce S. Davie, "Computer Networks: A Systems Approach", 5th Edition, Elsevier, 2012 4. Natalia Olifer and Victor Olifer, “Computer Networks: Principles, Technologies and Protocols for Network Design”, Wiley, 2006 5. Jerry FitzGerald, Alan Dennis and Alexandra Durcikova, “Business Data Communications and Networking”, John Wiley & Sons, 2019 6. William Stallings, "Data and Computer Communications", 10th Edition, Pearson Education, India, 2017 7. Wayne Tomasi, “Introduction to Data Communication and Networking”, Pearson Education, 2005 Handbook of B.Tech. Part of B.Tech. / M. Tech. (Dual Degree Programmes) offered by USICT in its campus. Applicable from Batch Admitted in Academic Session 2021-22 Onwards Page 146 of 160 Paper Code: MS 214 Paper: Accountancy For Engineers L T/P C Paper ID: 2 0 2 Prerequisite Paper: None Marking Scheme : 1. Teacher’s Continuous Evaluation : 25 marks 2. Term and Theory Examinations : 75 marks Instructions for paper setter 1. There should be 9 questions in the term end examinations question paper. 2. The first (1st) question should be compulsory and cover the entire syllabus. This question should be objective, single line answers or short answer type questions of total 15 marks. 3. Apart from question one which is compulsory, rest of the paper shall consists of four units as per the syllabus. Every unit shall have two questions covering the corresponding unit of the syllabus. However, the student shall be asked to attempt only one of the two questions in the unit. Individual questions may contain up to 5 sub-parts/sub-questions. Each unit shall have a marks weightage of 15. 4. The questions are to be framed keeping in view the learning objectives of course/paper. The standard /level of the questions to be asked should be at the level of the prescribed text book. 5. The requirement of (scientific) calculators/log tables/data-tables may be specified if required. Course Objectives : 1. To teach the principles of accountancy 2. To teach preparation of trial balance. 3. To teach preparation of final accounts. 4. To teach depreciation handling Course Outcomes (CO) CO 1 Understand the principles of accountancy CO 2 Ability to understand journal entry, preparation of balance sheet and trial balance CO 3 Ability to understand final account statement CO 4 Ability to model depreciation. Course Outcomes (CO) to Programme Outcomes (PO) mapping (scale 1: low, 2: Medium, 3: High) CO/PO PO01 PO02 PO03 PO04 PO05 PO06 PO07 PO08 PO09 PO10 PO11 PO12 CO 1 - - - - - 2 2 2 - - 3 2 CO 2 - - - - - 2 2 2 - - 3 2 CO 3 - - - - - 2 2 2 - - 3 2 CO 4 - - - - - 2 2 2 - - 3 2 UNIT – I Objectives and Nature of Accounting, Definitions and Functions of Accounting, Book Keeping and Accounting, Interrelationship of Accounting with other Disciplines, Branches, Limitation. Accounting Principles, Accounting Concepts and Conventions. UNIT – II Journal entries, Compound Journal Entries, Opening Entry, Ledger Posting and Trial Balance, Preparation of Ledger, Posting, Cash Book, Sales and Purchase Book and trial Balance. UNIT – III Preparation of Final Accounts with Adjustment, Trading Account, Profit and Loss Account, Balance Sheet. Green Accounting, Social Responsibility Accounting, Accounting ethics UNIT – IV Concept of Depreciation, Causes and Features of Depreciation, Depreciation Accounting, Fixation of Depreciation Amount, Methods of recording Depreciation, methods of providing Depreciation, Depreciation Policy. Textbook: 1. S. N. Maheshwari, Suneel K. Maheshwari and Sharad K. Maheshwari, “Financial Accounting for BBA”, Vikas Publishing House, 2018. References: 1. S. N. Maheshwari, Suneel K. Maheshwari and Sharad K. Maheshwari, “Financial Accounting”, Vikas Publishing House, 2018.