2016 scheme - rvce.edu.in. cse iii & iv 2016 scheme.pdf · introduction, periodic function,...

R.V.COLLEGE OF ENGINEERING (Autonomous Institution Affiliated to VTU, Belagavi)

R.V. Vidyaniketan Post, Mysore Road Bengaluru – 560 059

Bachelor of Engineering (B.E.) Scheme and Syllabus for III & IV Semesters

2016 SCHEME

COMPUTER SCIENCE & ENGINEERING

Department Vision To achieve leadership in the field of Computer Science & Engineering by strengthening fundamentals and facilitating interdisciplinary sustainable research to meet the ever-growing needs of the society.

Department Mission • To evolve continually as a centre of excellence in quality education in computers and

allied fields. • To develop state-of-the-art infrastructure and create environment capable for

interdisciplinary research and skill enhancement. • To collaborate with industries and institutions at national and international levels to

enhance research in emerging areas. • To develop professionals having social concern to become leaders in top-notch

industries and/or become entrepreneurs with good ethics.

PROGRAM EDUCATIONAL OBJECTIVES (PEOs) PEO1: Develop Graduates capable of applying the principles of mathematics, science, core engineering and Computer Science to solve real-world problems in interdisciplinary domains. PEO2: To develop the ability among graduates to analyze and understand current pedagogical techniques, industry accepted computing practices and state-of-art technology. PEO3: To develop graduates who will exhibit cultural awareness, teamwork with professional ethics, effective communication skills and appropriately apply knowledge of societal impacts of computing technology. PEO4: To prepare graduates with a capability to successfully get employed in the right role and achieve higher career goals or take up higher education in pursuit of lifelong learning.

PROGRAM SPECIFIC OUTCOMES (PSOs) PSO Description PSO1 System Analysis and Design - The student will:

1. Recognize and understand the dynamic nature of developments in computer architecture, data organization and analytical methods

2. Learn the applicability of various systems software elements for solving real world design problems.

3. Identify the various analysis & design methodologies for facilitating development of high quality system software products with focus on performance optimization.

4. Display good team participation, communication, project management and document skills.

PSO2 Product Development - The student will: 1. Demonstrate knowledge of the ability to write programs and integrate them

resulting in state of art hardware/software products in the domains of embedded systems, databases /data analytics, network/web systems and mobile products.

2. Participate in teams for planning and implementing solutions to cater to business specific requirements displaying good team dynamics and professional ethics.

3. Employ state of art methodologies for product development and testing / validation with focus on optimization and quality related aspects.

Lead Society: Institute of Electrical and Electronics Engineers

R V College of Engineering- Bengaluru-59

Computer Science & Engineering

R.V.COLLEGE OF ENGINEERING (Autonomous Institution Affiliated to VTU, Belagavi)

R.V. Vidyaniketan Post, Mysore Road Bengaluru – 560 059

Bachelor of Engineering (B.E.)

Scheme and Syllabus for III & IV Semesters

2016 SCHEME

COMPUTER SCIENCE & ENGINEERING

Abbreviations

Sl. No. Abbreviation Meaning

1. VTU Visvesvaraya Technological University

2. BS Basic Sciences

3. CIE Continuous Internal Evaluation

4. CS Computer Science and Engineering

5. CV Civil Engineering

6. CHY Chemistry

7. EC Electronics and Communication Engineering

8. EE Electrical and Electronics Engineering

9. ES Engineering Science

10. HSS Humanities and Social Sciences

11. ME Mechanical Engineering

12. PHY Engineering Physics

13. SEE Semester End Examination

14. MAT Engineering Mathematics

INDEX

III Semester Sl. No. Course Code Name of the Course Page No.

1. 16MA31A Laplace Transforms, Fourier Series and Linear Algebra 1 2. 16EB32 Biology for Engineers 3 3. 16CS33 Data Structures Using C 5 4. 16CS34 Logic Design 8 5. 16CS35 Computer Organization 11 6. 16CS36 Discrete Mathematics 13 7. 16DCS37 Bridge Course C Programming 15

IV Semester 8. 16MA41A Graph Theory and Probability Theory 17 9. 16ET42 Environmental Technology 19 10. 16CS43 Design and Analysis of Algorithms 21 11. 16CS44 Object Oriented Programming using JAVA 24 12. 16CS45 Operating Systems 28 13. 16CS46 Theory of Computation 32 14. 16HS47 Professional Practice-II (Communication Skills and

Professional Ethics) 34

15. 16DMA48 Bridge Course Mathematics 36

R V COLLEGE OF ENGINEERNG, BENGALURU-560 059 (Autonomous Institution Affiliated to VTU, Belagavi)

THIRD SEMESTER CREDIT SCHEME

Sl. No.

Course Code Course Title BoS

CREDIT ALLOCATION

L T P S Total Credits

1. 16MA31A Laplace Transforms, Fourier Series and Linear Algebra Maths 3 1 0 0 4

2. 16EB32 Biology for Engineers BT 2 0 0 0 2

3. 16CS33 Data Structures Using C CSE 3 0 1 1 5

4. 16CS34 Logic Design CSE 3 0 1 1 5

5. 16CS35 Computer Organization CSE 4 0 0 1 5

6. 16CS36 Discrete Mathematics CSE 3 1 0 0 4

7. 16DCS37 Bridge Course C Programming CSE 2 0 0 0 0

Total number of Credits 25

Total Number of Hours / Week 18+2 4 4 12

FOURTH SEMESTER CREDIT SCHEME

Sl. No.

Course Code Course Title BoS

CREDIT ALLOCATION

L T P S Total Credits

1. 16MA41A Graph Theory and Probability Theory Maths 3 1 0 0 4

1. 16ET42 Environmental Technology BT 2 0 0 0 2

2. 16CS43 Design and Analysis of Algorithms CSE 3 0 1 1 5

3. 16CS44 Object Oriented Programming using JAVA CSE 3 0 1 1 5

4. 16CS45 Operating Systems CSE 3 0 1 1 5

5. 16CS46 Theory of Computation CSE 3 1 0 0 4

6. 16HS47 Professional Practice-II (Communication Skills and Professional Ethics)

HSS 0 0 1 0 1

7. 16DMA48 Bridge Course Mathematics Maths 2 0 0 0 0

Total number of Credits 26

Total Number of Hours / Week 17+2 4 6 12 1Hr. Theory= 1 Credit 2Hrs. Practical=1 Credit 2Hrs. Tutorial=1 Credit 4Hrs. Self-Study = 1 Credit


Computer Science & Engineering Page 1

Semester: III LAPLACE TRANSFORMS, FOURIER SERIES AND LINEAR ALGEBRA

(Theory) (COMMON TO CS, IS)

Course Code: 16MA31A CIE Marks: 100 Credits: L:T:P:S: 3:1:0:0 SEE Marks: 100 Hours: 36L+24T SEE Duration: 03Hrs Course Learning Objectives: The students will be able to

1 Adequate exposure to basics of engineering mathematics so as to enable them to visualize the applications to engineering problems.

2 Analyze periodic phenomena using concept of Fourier series.

3 Apply Laplace transform technique to solve differential equation which includes the concept of convolution.

4 Use basic terminology of linear algebra in Euclidean spaces, including linear independence, spanning, basis, rank, nullity, subspaces, and linear transformations.

5 Students will become capable to participate and succeed in competitive exams.

UNIT-I Laplace Transform: Existence and uniqueness of Laplace Transform (LT), Transform of elementary functions, RoC. Properties of LT - Linearity, change of scale and first shifting. Transform of function - multiplied by tn, division by t, derivatives and integral. LT of periodic function, Heaviside unit step function, Unit impulse function. Heaviside shift (second shift) theorem.

07 Hrs

UNIT-II Inverse Laplace Transform: Definition, properties of inverse Laplace transform, evaluation using different methods. Convolution theorem, problems. Application to solve ordinary linear differential equations and simultaneous differential equations.

07 Hrs

UNIT-III Fourier Series: Introduction, periodic function, even and odd functions, properties. Special waveforms - square wave, half wave rectifier, saw-tooth wave and triangular wave. Dirichlet’s conditions, Euler’s formula for Fourier series. Fourier series for functions of period 2L (particular cases) - problems. Half Range Fourier series- Construction of Half range cosine and sine series. Parseval’s theorem for Root mean square value of a function(without proof). Complex form of Fourier series.

08 Hrs

UNIT-IV Linear Algebra - I: Vector spaces, subspaces, Linear dependence, basis and dimension, four fundamental sub-spaces. Rank of a matrix, rank and nullity theorem, Orthonormal Bases, Gram-Schmidt process, QR-factorization.

07 Hrs

UNIT-V Linear Algebra - II: Linear Transformation, Geometric meaning, Matrix representation of linear transformation, Projection, reflection, rotation of linear transformation. Eigen values, Eigen vectors, Geometric meaning of Eigen values and Eigen vectors, Algebraic and Geometric multiplicity of Eigen values, Diagonalization of a Matrix, Singular Value Decomposition.

07 Hrs



Course Outcomes: After completing the course, the students will be able to CO1: Demonstrate the fundamental concepts - in Fourier Series, Laplace transforms and Basics of

Linear Algebra. CO2: Identify - appropriate methods to find the Fourier constants, Rank, Nullity, Orthonormal

basis, Linear transformation and properties of Laplace transforms. CO3: Apply - the acquired knowledge to construct the Half range Fourier series, Finding Laplace

transforms and Inverse Laplace transforms for some functions, Eigen values and Eigen vectors of matrix.

CO4: Evaluate - Complex form of Fourier series, solutions of differential equations with initial and boundary conditions using Laplace transforms, QR factorization, Diagonalization of matrix and Singular value decomposition.

Reference Books

1. Higher Engineering Mathematics, B.S. Grewal, 40th Edition, 2007, Khanna Publishers, ISBN: 81-7409-195-5.

2. Linear Algebra and Its Applications, Gilbert Strang, 4th Edition, 2006, Cengage Learning India Edition, ISBN: 81-315-0172-8.

3. Advanced Engineering Mathematics, Erwin Kreyszig, 9th Edition, 2007, John Wiley & Sons, ISBN: 978-81-265-3135-6.

4. A Text Book of Engineering Mathematics, N.P Bali & Manish Goyal, 7th Edition, 2010, Lakshmi Publications, ISBN: 978-81-7008-992-6.

Continuous Internal Evaluation (CIE); Theory (100 Marks) CIE is executed by way of quizzes (Q), tests (T) and Assignment. A minimum of three quizzes are conducted and each quiz is evaluated for 10 marks adding up to 30 marks. All quizzes are conducted online. Faculty may adopt innovative methods for conducting quizzes effectively. The number of quizzes may be more than three also. The three tests are conducted for 50 marks each and the sum of the marks scored from three tests is reduced to 60. The marks component for assignment is 10. The total marks of CIE are 100. Semester End Evaluation (SEE); Theory (100 Marks) SEE for 100 marks is executed by means of an examination. The Question paper for each course contains two parts, Part – A and Part – B. Part – A consists of objective type questions for 20 marks covering the complete syllabus. Part – B consists of five main questions, one from each unit for 16 marks adding up to 80 marks. Each main question may have sub questions. The question from Units I, IV and V have no internal choice. Units II and III have internal choice in which both questions cover entire unit having same complexity in terms of COs and Bloom’s taxonomy level.

CO-PO Mapping CO/PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1 3 2 - - - - - - - 1 - 1 CO2 3 3 - - - - - - - 1 - 1 CO3 3 3 1 - 2 - - - - 1 - 1 CO4 3 3 2 1 2 - - - - 1 - 1

Low-1 Medium-2 High-3



Semester III

BIOLOGY FOR ENGINEERS (Theory)

(Common to BT, CS and IS) Course Code:16EB32 CIE Marks: 50 Credits: L:T:P:S: 2:0:0:0 SEE Marks: 50 Hours : 23L SEE Duration: 2Hrs Course Learning Objectives: The students will be able to 1 Familiarize themselves with basic biological concepts 2 Get an interdisciplinary vision of biology and engineering

3 Gain an understanding that the design principles from nature can be translated into novel devices and structures

4 Gain an appreciation for how biological systems can be designed and engineered to substitute natural systems

Course Outcomes: After completing the course, the students will be able to CO1 Remember and explain the fundamentals of biology CO2 Describe the basic principles of design in biological systems. CO3 Comprehend how biological principles have served as a source of inspiring innovation

CO4 Address the problems associated with the interaction between living and non-living materials and systems

UNIT-I

Cells and Biomolecules: Structure and function of plant, animal and microbial cell. Stem cells: types and applications. Biomolecules: Carbohydrates, lipids, Proteins, Nucleic acids, Enzymes, Hormones, Vitamins.

06 Hrs

UNIT II

Human physiology: Digestive, Blood circulatory, Respiratory, Excretory and Nervous system. Structure and Function of sense organs- Skin, Ear, Eye, Tongue and Nose. 05 Hrs

UNIT III

Photosynthesis: Chloroplasts, Light reaction and Dark reaction. Plants as Bio inspirations: Bionic leaf and Photovoltaic cells. 04 Hrs

UNIT IV

Bio inspired Engineering: Lotus leaf effect (Super hydrophobic and self-cleaning surfaces), Echolocation of bats and whales (Ultrasonography), Human brain (Artificial neural networks), Natural recognition receptors (Biosensors), Silk from insects and spiders (High performance fibers and flexible medical tapes), Plant burrs (Velcro).

05 Hrs

UNIT V

Biomimetics: Medical implants: Orthopaedic, Dental, Cardiovascular, Optical and Auditory. Artificial senses: Electronic Nose and Electronic Tongue. 03 Hrs



Reference Books 1. Principles of Biochemistry, Donald Voet, Judith G. Voet, Charlotte W. Pratt, 4th Edition, 2012,

John Wiley & Sons, ISBN-10: 1118092449, ISBN-13: 978-1118092446 2. Principles of Physiology, Pramanik Debasis, 5th Edition, 2015, Jaypee Brothers Medical

Publishers, ISBN-10: 9351529290, ISBN-13: 978-9351529293 3. Biomimetics: Biologically Inspired technologies, Yoseph Bar-Cohen, 1st Edition, 2005, CRC

press, ISBN: 9780849331633 4. Bioinspired Engineering, Jenkins, C.H., 2011, Momentum press, ISBN-10: 1606502239

ISBN-13: 978-1606502235 Continuous Internal Evaluation (CIE); Theory (50 Marks) CIE is executed by way of quizzes (Q), tests (T) and Assignment. A minimum of three quizzes are conducted and each quiz is evaluated for 05 marks adding up to 15 marks. All quizzes are conducted online. Faculty may adopt innovative methods for conducting quizzes effectively. The number of quizzes may be more than three also. The three tests are conducted for 25 marks each and the sum of the marks scored from three tests is reduced to 30. The marks component for Assignment is 05. The total marks of CIE are 50. Semester End Evaluation (SEE); Theory (50 Marks) SEE for 50 marks is executed by means of an examination. The Question paper for each course contains two parts, Part – A and Part – B. Part – A consists of objective type questions for 10 marks covering the complete syllabus. Part – B consists of five main questions, one from each unit for 8 marks adding up to 40 marks. Each main question may have sub questions. The question from Units I, IV and V have no internal choice. Units II and III have internal choice in which both questions cover entire unit having same complexity in terms of COs and Bloom’s taxonomy level.

CO-PO Mapping CO/PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 1 1 1 - - 1 - 1 2 - 1 CO2 1 1 2 1 - 1 - - 1 2 - 1 CO3 1 2 2 1 - 1 - - 1 2 - 1 CO4 2 3 3 1 2 2 1 - 1 2 - 2

High-3 : Medium-2 : Low-1



III Semester

DATA STRUCTURES USING C (Theory and Practice)

Course Code:16CS33 CIE Marks: 100+50 Credits: L:T:P:S : 3:0:1:1 SEE Marks: 100+50 Hours: 36L SEE : 03Hrs + 03Hrs Course Learning Objectives: The students will be able to

1

Learn the fundamental data structures and identify data structuring strategies that are appropriate to a given contextual problem and able to design, develop, test and debug in C language considering appropriate data structure.

2 Illustrate and implement data types such as stack, queue and linked list and apply them for the given problem.

3 Understand and distinguish the conceptual and applicative differences in trees, binary trees, binary search trees, AVL and splay trees. Apply the correct tree for the given application. Create and use appropriate data structures in C programs for solving real life problems.

4 Create and use appropriate data structures in C programs for solving real life problems

UNIT-I Introduction Types of Data Structures, Linear & non-linear Data Structures Stacks Stack definitions & concepts, Representing stacks in C, Operations on stacks, Applications of Stacks: Infix to Postfix, Infix to Prefix, Postfix expression evaluation Recursion Introduction to Recursion, Factorial function, Binary search, Towers of Hanoi problem, Role of the stack during execution.

07 Hrs

UNIT-II Queues Representation of queue, operations, circular queues. Application of Queue: Message queue using circular queue. Dynamic Memory allocation: malloc(), calloc(),free(), realloc()

07 Hrs

UNIT-III Linked Lists Inserting and removing nodes from a list, getnode and freenode operations, Implementation(insertion, deletion and display) of single Linked list, Double linked list, circular linked list and header nodes. Application of lists: Polynomial multiplication using single linked list, addition of long positive integers using circular single linked list.

07 Hrs

UNIT-IV Trees .Implementation (Insertion, deletion and display) of Binary Trees, Binary search trees (BST), AVL trees, splay trees and Tries. Application of tree: expression trees, Infix, Postfix and Prefix traversals

07 Hrs

UNIT – V Heap Heap construction, deletion, Implementation of priority queue. Hashing Collision concept, Implementation (Insertion and deletion) using Linear Probing, separate chaining, quadratic probing, double hashing.

08 Hrs



Laboratory Component:

PART A All the data structures has to be implemented using structures 1

Use Stack operations to do the following: Assign to a variable name Y the value of the third element from the top of the stack and ke

the stack undisturbed. Given an arbitrary integer n pop out the top n elements. A message should be displayed if

unusual condition is encountered. Assign to a variable name Y the value of the third element from the bottom of the stack an keep the stack undisturbed.

nt: you may use a temporary stack) 2 Write a C program that parses Infix arithmetic expressions to Postfix arithmetic expressio

using a Stack. 3 Write a C program to simulate the working of Messaging System in which a message

placed in a circular Queue by a Message Sender, a message is removed from the circul queue by a Message Receiver, which can also display the contents of the Queue.

4 Implement a program to multiply two polynomials using single linked list. 5 Write a C program to implement addition of long positive integers using circular single link

list with header node. 6 Design a doubly linked list to represent sparse matrix. Each node in the list can have the ro

and column index of the matrix element and the value of the element. Print the comple matrix as the output.

7 Write a C program to create Binary Tree and provide insertion and deletion operations and traverse the tree using In-order, Preorder and Post order (recursively)

8 Given a String representing a parentheses-free infix arithmetic expression, implement a program to place it in a tree in the infix form. Assume that a variable name is a single letter. Traverse the tree to produce an equivalent postfix and prefix expression string.

9 Write a C program to implement Hashing using Linear probing. Implement insertio deletion, search and display.

10 Write a C program to implement priority queue to insert, delete and display the elements.

PART – B Student will design, develop and implement an application using the appropriate data structur Some example applications are listed below:

• Huffman coding • Dictionary implementation for Indian Languages • Stemmer implementation for Indian language • Word frequency finder. • Bitmap Image Compression. • Binary Tree (Graphical Implementation) • To store a set of programs which are to be given access to a hard disk according to the

priority • For representing a city region telephone network. • To store a set of fixed key words which are referenced very frequently. • To represent an image in the form of a bitmap. • To implement back functionality in the internet browser. • To store dynamically growing data which is accessed very frequently, based upon a k

value. • To implement printer spooler so that jobs can be printed in the order of their arrival. • To record the sequence of all the pages browsed in one session. • To implement the undo function. • To store information about the directories and files in a system.



Course Outcomes: After completing the course, the students will be able to CO1. Understand and explore the fundamental concepts of various data structures. CO2. Analyze and represent various data structures. CO3. Design algorithms on different data structures like Stack, Queue, List, Tree and

hashing. CO4. Implement programs with suitable data structure based on the requirements of the

application.

Reference Books: 1. Data Structures using C and C++, Yedidyah Langsam Moshe J. Augenstein and Aaron

M. Tenenbaum, 2nd Edition, 2009, PHI/Pearson, ISBN: 978-0387202778 2. Data Structures and Algorithm Analysis in C++, Mark Allen Weiss Addison-Wesley; 4th

Revised Edition, 2013, ISBN-13: 9780132847377 3. Data Structures Using C, Reema Thareja, 1st Edition, 2011, Oxford Higher Education ,

ISBN: 978-0198099307 4. Sweebok: Guide to the software engineering body of knowledge, Pierre Bourque, Richard

E. Fairley, Version 3, IEEE society project.

Continuous Internal Evaluation (CIE): Total marks: 100+50=150 Theory – 100 Marks CIE is executed by way of quizzes (Q), tests (T) and Self-Study(S). A minimum of three quizzes are conducted and each quiz is evaluated for 10 marks adding up to 30 marks. All quizzes are conducted online. Faculty may adopt innovative methods for conducting quizzes effectively. The number of quizzes may be more than three also. The three tests are conducted for 50 marks each and the sum of the marks scored from three tests is reduced to 50. The marks component for Self-study is 20. The total CIE for theory is 100. Laboratory- 50 Marks The Laboratory session is held every week as per the time table and the performance of the student is evaluated in every session. The average of marks over number of weeks is considered for 40 marks. At the end of the semester a test is conducted for 10 marks. Total marks for the laboratory is 50. Semester End Evaluation (SEE): Total marks: 100+50=150 Theory – 100 Marks SEE for 100 marks is executed by means of an examination. The Question paper for each course contains two parts, Part – A and Part – B. Part – A consists of objective type questions for 20 marks covering the complete syllabus. Part – B consists of five main questions, one from each unit for 16 marks adding up to 80 marks. Each main question may have sub questions. The question from Units I, IV and V have no internal choice. Units II and III have internal choice in which both questions cover entire unit having same complexity in terms of COs and Bloom’s taxonomy level. Laboratory- 50 Marks Experiment Conduction with proper results is evaluated for 40 marks and Viva is for 10 marks. Total SEE for laboratory is 50 marks.

CO-PO Mapping CO/PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 1 3 3 1 1 1 - - - - - 2 CO2 1 2 2 1 1 1 - - - - - 2 CO3 1 2 2 1 1 1 - - - - - 2 CO4 1 3 3 1 1 1 - - - - - 2 High-3: Medium-2: Low-1



III Semester

LOGIC DESIGN (Theory and Practice)

Course Code:16CS34 CIE Marks: 100 + 50 Credits: L:T:P:S : 3:0:1:1 SEE Marks: 100 + 50 Hours: 35L SEE : 03Hrs+03Hrs Course Learning Objectives: The students will be able to

1 Read and Write Boolean equations for logic circuits. 2 Optimize the Boolean logic expressions. 3 Design combinational and sequential circuits using MSI components. 4 Simulate and experimentally validate sequential logic circuits.

UNIT-I

Simplification of Boolean Expressions: Karnaughs Map- Using Karnaugh Maps to obtain minimal Expressions for Complete Boolean functions, Minimal Expressions of Incomplete Boolean Expressions, The Quine MC-Cluskey Method of Generating Prime implicants and Prime implicates, Prime-Implicant / Prime-Implicate, VEM Technique (up to 4 variables). Logic Families: Transistor Transistor Logic (TTL), Static and dynamic hazards in logic circuits

08 Hrs

UNIT-II Logic Design with MSI Components and Programmable Logic Devices(PLD’s): Binary Adders, Substractors, Parallel Adders and Decimal Adders, Comparators, Decoders, Encoders, Multiplexers, Programmable Logic Devices.

08 Hrs

UNIT-III Flip-Flops and Applications: The Basic Bistable Elements, Latches, Timing Considerations, Master-Slave Flip-Flops (Pulse-triggerred Flip-Flops), Edge – Triggerred Flip-Flops, Characteristics Equations, Registers- SISO,SIPO,PISO,PIPO and Universal Register.

06 Hrs

UNIT-IV Counters: Binary Ripple Counters, Synchronous Binary Counters, Counters based on Shift Registers, Design of Synchronous and Asynchronous Counters.

05 Hrs

UNIT – V Synchronous Sequential Networks: Structure and operation of Clocked synchronous Sequential Networks, Analysis of Clocked Synchronous Sequential Networks, Modelling clocked synchronous sequential network behaviour, State Table Reduction, The State Assignment, Completing the design of clocked synchronous sequential networks.

08 Hrs

Laboratory Component:

Part A 1A. B.

Realization of Excess-3 Code converter with Parallel Adder and Subractor using IC – 7483. Realization of Binary to Gray Code Converter and vice-versa using IC 74139.

2. Realization of Full Adder and Full Subtractor using IC 74153. 3A. Design and realization One Bit and Two Bit Magnitude Comparator using Basic Gates.

4A. B.

Realization of Decoder using IC – 7447. Realization of Encoder using IC – 74147.

5. Design and Realization of Master-Slave JK Flip Flop using NAND Gates only. 6 A. B.

Realization of Up-Down programmable counter using IC 74192 and IC 74193. Realization of decade counter and its variations using IC 7490.



7 A. B.

Realization of Ring counter and Johnson counter using IC 7495. Design and realization of sequence generator using IC 7495

8. Design of Mod-N Asynchronous Up and Down counter using IC 7476. 9. Design of Mod-N Synchronous Up counter using IC 7476.

Part-B HDL (Verilog) programs using ModelSim

1. Write a Verilog code for 8:1 multiplexer, simulate and verify it’s working. 2. Write a Verilog code for a 4 bit comparator using logic gates, simulate and verify it’s

working. 3. i) Write a Verilog for D Flip-Flop with positive-edge triggering, simulate and verify it’s

working. ii) Write a Verilog code for a mod-8 up counter, simulate and verify it’s working. 4. Write a Verilog code for Mod-N Synchronous up-counter. Simulate and verify its truth table. 5. Write the Verilog description code for the given mealy model. Open Ended Experiments will be introduced as a part of Experiential Learning: Open ended experiments could be Hardware/Matlab/Xilinx/Simulink/ModelSim implementations with results. Implementation of a digital system of their choice which is different from those taught in class. It has to be a working project implemented on Matlab/Xilinx/Simulink/ModelSim/ Hardware. The details of the project should be well documented. Sample Experiments List 1. HDL models of data storage elements 2. 12h/24h Digital Clock Circuit Design using Counters 3. Traffic Sensors using logic gates 4. One-way Road Intersection Traffic Light 5. LED Chandelier 6. RGB LED Bulb 7. Boolean Algebra Calculator 8. Metal Detector Circuit 9. JK Flip Flop using CD4027 10. Police Lights using 555 Timer

Course Outcomes: After completing the course, the students will be able to CO1. Understand and explore the basic concepts of logic families, Boolean algebra,

combinational and sequential circuits. CO2. Apply the concepts of simplification to realize the digital circuits. CO3. Analyze and evaluate different techniques to realize the digital circuits. CO4. Design and develop digital circuits for various applications.

Reference Books: 1. Digital Principles and Design, Donald D.Givone, 1st Edition, 2003, Tata McGraw-Hill, ISBN-

13: 0-07-252503-7. 2. Digital Principles and Applications, Donald P Leach, Malvoni, Gautam Saha, 7th Edition

2010, Tata McGraw Hill, SBN-13: 978-0070141704. 3 Fundamentals of Digital Logic Design with Verilog, Stephen Brown, 2nd Edition, 2008, Tata

McGraw Hill, SBN-13: 978-0073380339. 4 Digital Design, Morris Mano , 4th Edition, 2006, Pearson, ISBN-13: 978-0131989245





CO1 1 1 - - 1 - 1 - - - - 1 CO2 2 2 - - 1 - 1 - 2 2 - 1 CO3 2 - 1 - 1 - 1 - 2 2 - 1 CO4 - 1 2 - 1 - 2 - 2 1 - 1

High-3: Medium-2: Low-1



III Semester

COMPUTER ORGANIZATION (Theory )

Course Code:16CS35 CIE Marks: 100 Credits: L:T:P:S : 4:0:0:1 SEE Marks: 100 Hours: 44L SEE : 3 Hrs Course Learning Objectives: The students will be able to 1 Understand the fundamentals of computer System and its Organization.

2 Appreciate the functionalities of basic processing unit and its control system in processing the Instruction.

3 Understand the role of bus system and its interfaces. 4 Develop a clear understanding on the Memory System and its design.

5 Present an adequate Instruction Set Architectures for better understanding of the assembly level programming.

UNIT-I

Basic Structures of Computers: Functional units, Basic Operational Concepts, Bus Structures. Performance Machine Instructions and Programs Memory Locations and Addresses, Memory Operation, Instruction and Instruction Sequencing, Addressing Modes, implementation of Variables & Constants, Indirection & pointers, Indexing & Arrays, Relative Addressing, Additional Modes, Assembly Language, Numbers, Number Notation, Arithmetic operations and characters, Example Programs.

8 Hrs

UNIT-II Machine Instructions and Programs Stacks & Queues, Subroutines, Subroutine Nesting & Processor Stack, Parameter passing, The stack frame. Additional Instructions, Example programs. ARM Instruction sets Register Memory access and data transfer, Arithmetic and logical instructions, Branch instructions, Assembly language programs.

9 Hrs

UNIT-III Input / Output Organization Basic Input / Output Operations, Accessing I/O devices, Interrupts: Interrupt Hardware, Enabling & Disabling Interrupt, Handling Multiple Devices, Controlling Device Requests, Exceptions, Direct Memory Access. Buses Bus Arbitration, Synchronous Bus, Asynchronous Bus, PCI bus, SCSI bus, USB(Objective & Architecture)

9 Hrs

UNIT-IV Memory Design Semiconductor RAM memories: Internal Organization of Memory Chips, Static Memories, Asynchronous Drams, Synchronous DRAMs, Structure of Larger Memories, Memory System Considerations, Read-only memory, Speed, Size and cost. Memory Types Cache memories: Mapping functions, performance considerations, Hit rate and miss penalty, Caches on the processor chip, other enhancements and virtual memory.

9 Hrs

UNIT – V Control Unit Logic Fundamental Concepts: Register Transfers, Performing an Arithmetic or Logic operation, Fetching a Word from Memory, Storing a Word in Memory, Execution of a Complete Instruction, Branch instruction. Multiple Bus Organization, Hardwired control, Basics of

9 Hrs



Micro programmed control. Number Representation and Arithmetic Operations Booth Algorithm, Fast Multiplication: Bit-pair Recording of Multipliers; Integer division, Floating-point Numbers & Operations, IEEE Standard for Floating-point Numbers.

Course Outcomes: After completing the course, the students will be able to CO1. Understand and explore the basic operation and organization of computer system CO2. Identify the design requirements in organizing computer system components CO3. Develop assembly language program for different instruction set architecture and its data

representation CO4. Examine the different interfaces of a computer system

Reference Books: 1. Computer Organization, Carl Hamacher, Z Vranesic& S Zaky, 5th Edition, 2011, Mc Graw

Hill, ISBN 10: 1259005275 / ISBN 13: 9781259005275. 2. Computer Organization and Architecture: Designing for Performance, William Stallings,

8th Edition, 2010, Prentice Hall, ISBN-13: 978-0-13-607373-4 ISBN-10: 0-13-607373-5. 3 Computer Organization and Design, Morgan Kaufmann, David A. Patterson & John L.

Hennessy, 5th Edition, 2013, ISBN : 9780124077263

Continuous Internal Evaluation (CIE); Theory (100 Marks) CIE is executed by way of quizzes (Q), tests (T) and Self-Study(S). A minimum of three quizzes are conducted and each quiz is evaluated for 10 marks adding up to 30 marks. All quizzes are conducted online. Faculty may adopt innovative methods for conducting quizzes effectively. The number of quizzes may be more than three also. The three tests are conducted for 50 marks each and the sum of the marks scored from three tests is reduced to 50. The marks component for Self-study is 20. The total marks of CIE are 100. Semester End Evaluation (SEE); Theory (100 Marks) SEE for 100 marks is executed by means of an examination. The Question paper for each course contains two parts, Part – A and Part – B. Part – A consists of objective type questions for 20 marks covering the complete syllabus. Part – B consists of five main questions, one from each unit for 16 marks adding up to 80 marks. Each main question may have sub questions. The question from Units I, IV and V have no internal choice. Units II and III have internal choice in which both questions cover entire unit having same complexity in terms of COs and Bloom’s taxonomy level.


CO1 1 1 - - 1 - - - - - - 1 CO2 2 2 - - 1 - - - 2 - - 1 CO3 2 1 1 - 2 - - 1 2 2 - 1 CO4 1 1 2 - - - 1 - 2 1 - 1

High-3: Medium-2: Low-1



III Semester

Course Title: DISCRETE MATHEMATICS (Theory)

Course Code:16CS36 CIE Marks: 100 Credits: L:T:P:S : 3:1:0:0 SEE Marks: 100 Hours : 36L+24T SEE : 3 Hrs Course Learning Objectives: The students will be able to

1 Provide foundational introduction to fundamental discrete mathematics concepts.

2 Cultivate a sense of familiarity and ease in working with mathematical notation and common concepts in discrete mathematics.

3 Teach the basic results in number theory, logic, combinatorics, and graph theory. 4 Cultivate clear thinking and creative problem solving.

UNIT-I

Fundamental Principles of Counting: The Rule of Sum and Product, Permutations, Combinations, The Binomial Theorem, Combinations with repetition Set Theory The principles of inclusion and exclusion: Generalization of the principle.

07Hrs

UNIT-II Mathematical Induction, Recursive Definitions, Recurrence Relations and Fundamentals of Logic: Method of mathematical induction, Recursive definition, First order linear recurrence relation-Formulation problems and examples, Second order linear homogeneous recurrence relations with constant coefficients, The non-Homogeneous recurrence relations. Rules of inference. Open Statement, Quantifiers, Definition and the use of Quantifiers, Definitions and the proofs of theorems.

08 Hrs

UNIT-III Language and Finite State Machine: Set Theory of strings,Finite State machine, Introduction to Finite Automata, Basic concepts of Automata theory, Deterministic Finite Automata, Non-Deterministic Finite Automata, Finite Automata with epsilon-transitions, Equivalence of NFA & DFA.

07 Hrs

UNIT-IV Relations: Properties of relations, Composition of Relations, Partial Orders, Hasse Diagrams, Equivalence Relations and Partitions. Functions: Functions-plain, One-to-one, onto functions, Sterling numbers of the second kind, Function composition and Inverse function, Growth of function.

07 Hrs

UNIT – V Groups theory: Definition, Examples and Elementary properties, Abelian groups, Homomorphism isomorphism, cyclic groups, cosets and Lagrange’s theorem. Coding Theory: Elementary coding theory, the hamming metric, the parity-Check and Generator Matrices

07 Hrs



Course Outcomes: After completing the course, the students will be able to CO1. Understand and explore the fundamental concepts of discrete mathematical structure. CO2. Apply the concepts of discrete mathematical structures for effective computation and

relating problems in computer science domain. CO3. Analyze the concepts of discrete mathematics to various fields of computer science. CO4. Design solutions for complex problem using different concepts of discrete mathematical

structure as a logical predictable system.

Reference Books: 1. Discrete and Combinatorial Mathematics- An Applied Introduction, Ralph P. Grimaldi and

B V Ramana, 5th Edition – 2007, Pearson Education, Asia, ISBN 978-81-7758-424-0 2. Discrete Mathematics and its Applications, Kenneth H. Rosen, 6th Edition, Sixth reprint

2008, Tata – McGraw Hill, ISBN-(13):978-0-07-064824-1 3. An Introduction To Formal Languages & Automata, Peter Linz, 6th Edition, 2007, Narosa

Publishing House, ISBN:978-1-4496-1552-9. 4. Introduction to Languages & Theory of Computation, John Martin, 4th Edition, 2011, Tata

McGraw-Hill, ISBN: 978-0-07-319146-1.



CO1 2 1 - - - - - - 1 2 - 1 CO2 3 3 2 - - - - - 1 2 - 2 CO3 2 3 1 1 - - - - 2 3 - 2 CO4 2 3 2 1 - - - - 2 2 - 1




III Semester

BRIDGE COURSE C PROGRAMMING (Theory)

Course Code: 16DCS37 CIE Marks: 100 Credits: L:T:P:S : 2:0:0:0 (Audit Course) SEE Marks: 100 Hours: 24L SEE : 03 Hrs Course Learning Objectives: The students will be able to

1 Develop arithmetic reasoning and analytical skills to apply knowledge of basic concepts of programming in C.

2 Learn basic principles of problem solving through programming. 3 Write C programs using appropriate programming constructs adopted in programming. 4 Solve complex problems using C programming.

UNIT-I

Introduction to Reasoning, Algorithms and Flowcharts Skill development – Examples related to Arithmetical Reasoning and Analytical Reasoning. Fundamentals of algorithms and flowcharts.

02 Hrs

Introduction to C programming Basic structure of C program, Features of C language, Character set, C tokens, Keywords and Identifiers, Constants, Variables, Data types.

01 Hrs

Handling Input and Output operations Reading a character, Writing a character, Formatted input/output functions, Unformatted input/output functions.

02 Hrs

UNIT-II Operators and Expressions Arithmetic operators, Relational operators, Logical Operators, Assignment operators, Increment and decrement operators, Conditional operators, Bit-wise operators, Arithmetic expressions, evaluation of expressions, Precedence of arithmetic operators, Type conversion in expressions, Operator precedence and associativity.

02 Hrs

Programming Constructs Decision Making and Branching Decision making with ‘if’ statement, Simple ‘if’ statement, the ‘if…else’ statement, nesting of ‘if…else’ statements, The ‘else if’ ladder, The ‘switch’ statement, The ‘?:’ operator, The ‘goto’ statement. Decision making and looping The while statement, the do statement, The ‘for’ statement, Jumps in loops.

03 Hrs

UNIT-III Arrays One dimensional arrays, Declaration of one dimensional arrays. Initialization of one dimensional arrays, Two dimensional arrays, Initializing two dimensional arrays.

02 Hrs

Character Arrays and Strings Declaring and Initializing String Variables, Reading Strings from Terminal, Writing strings to screen, Arithmetic Operations on characters, String operations using with and without String handling functions.

02 Hrs

UNIT-IV User-defined functions Need for User Defined Functions, Definition of functions, Return values and their types, Function calls, Function declaration, Category of functions, Nesting of functions, Functions with arrays, Storage classes.

03 Hrs

Structures and Unions Introduction, Structure definition, Declaring structure variables, Accessing structure members, Structure initialization, Copying and comparing structure variables, Arrays of structure, Arrays within structures, Structures and functions, Unions.

03 Hrs



UNIT – V Pointers : Introduction , Accessing the address of a variable, Declaring and initializing of pointer variables, Accessing a variable using pointers, Chain of pointers, Pointer expressions, Pointer increments and scale factor, Pointers and arrays, Pointers and character strings.

03 Hrs

File Managements in C Basic concepts of files, Defining and opening a file, closing of a file, Input/Output operations on files.

01 Hrs

Course Outcomes: After completing the course, the students will be able to CO1. Understand and explore the fundamental computer concepts and basic programming

principles like data types, input/output functions, operators, programming constructs and user defined functions.

CO2. Analyze and Develop algorithmic solutions to problems. CO3. Implement and Demonstrate capabilities of writing ‘C’ programs in optimized, robust and

reusable code. CO4. Apply appropriate concepts of data structures like arrays, structures, and files to

implement programs for various applications.

Reference Books: 1. Programming in C, P. Dey, M. Ghosh, 1st Edition, 2007, Oxford University press, ISBN -

13: 9780195687910. 2. The C Programming Language, Kernighan B.W and Dennis M. Ritchie, 2nd Edition, 2005,

Prentice Hall, ISBN -13: 9780131101630. 3. Turbo C: The Complete Reference, H. Schildt, 4th Edition, 2000, Mcgraw Hill Education,

ISBN-13: 9780070411838. 4. Understanding Pointers in C, Yashavant P. Kanetkar, 4th Edition, 2003, BPB publications,

ISBN-13: 978-8176563581.

Scheme of Continuous Internal Evaluation: CIE is executed by way of quizzes (Q), tests (T) and Assignment. A minimum of three quizzes are conducted and each quiz is evaluated for 10 marks adding up to 30 marks. Faculty may adopt innovative methods for conducting quizzes effectively. The two tests are conducted and each test is evaluated for 30 marks adding up to 60 marks The marks component for assignment is 10. The total marks of CIE are 100.

Scheme of Semester End Examination: SEE for 100 marks is executed by means of an examination. The Question paper for each course contains two parts, Part – A and Part – B. Part – A consists of objective type questions for 20 marks covering the complete syllabus. Part – B consists of five main questions, one from each unit for 16 marks adding up to 80 marks. Each main question may have sub questions. The question from Units I, IV and V have no internal choice. Units II and III have internal choice in which both questions cover entire unit having same complexity in terms of COs and Bloom’s taxonomy level.

CO-PO Mapping

CO/PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 3 2 2 2 1 - - - - 2 - 1 CO2 3 2 2 2 2 - - - 2 1 - 1 CO3 3 2 2 2 2 1 1 - 2 2 1 2 CO4 3 3 3 2 2 1 1 - 2 2 1 2




Semester: IV

GRAPH THEORY AND PROBABILITY THEORY (Theory)

(COMMON TO CS, IS) Course Code: 16MA41A CIE Marks: 100 Credits: L:T:P:S: 3:1:0:0 SEE Marks: 100 Hours: 36L+12T SEE Duration: 03Hrs Course Learning Objectives: The students will be able to 1 Learn the fundamental concepts in graph theory in view of its applications in modern science.

2 Learn to understand and create mathematical proofs, including an appreciation of its significance in computer science.

3 Use the concepts of Graph theory in subsequent courses in the design and analysis of algorithms, computability theory, software engineering and computer systems.

4 Apply concepts of the theory of probability in study of random phenomena, analyzing and interpreting data that involves uncertainties.

UNIT-I

Graph: Introduction, basic terminology, simple graph, degree of a vertex, types of graphs, subgraphs and isomorphic graphs, operations of graphs and connectivity, Eulerian and Hamiltonian graph, shortest path problems, representation of graphs in network flows.

07 Hrs

UNIT-II Trees:

Introduction, trees and their properties, types of trees, spanning tree, Cayley’s theorem (with proof)-problems, minimum spanning tree. Binary tree, properties of binary trees, m-array trees. Planar Graphs: Definition, Euler’s formula (with proof), applications and problems, Kuratowski’s theorem, matching.

07 Hrs

UNIT-III Colorings: Introduction, coloring of graphs, vertex coloring, chromatic number, chromatic index, chromatic polynomial, chromatic partitioning, Five color theorem (with proof), four color theorem (without proof). Edge coloring of graphs.

08 Hrs

UNIT-IV Probability: Baye’s rule, Random Variables, Discrete and continuous. Probability mass function, probability density function, cumulative density function, mean, variance, standard deviation-problems. Joint probability distributive function, Discrete and continuous, mean, covariance and correlation.

07 Hrs

UNIT-V Probability Distributions: Some standard discrete and continuous Distributions - Binomial, Poisson, Normal, Exponential and Geometric distributions. Sampling Theory: Sampling, sampling distributions, standard errors, student’s t-distribution, chi-square distribution as a test of goodness of fit.

07 Hrs



Course Outcomes: After completing the course, the students will be able to CO1: Demonstrate - the knowledge of fundamental concepts in Graph theory and Probability

theory. CO2: Apply - models of Graph theory, Probability theory respectively to solve problems of

connectivity and uncertainty. CO3: Analyze - graphs, trees and random phenomena occurring in real life situations using Graph

theory and Probability theory respectively. CO4: Interpret - the models of Graph theory, Probability theory for real life and engineering

problems. Reference Books

1. Graph Theory, Frank Harary, Narosa Publishing House, ISBN: 978-81-850-1555-2. 2. Probability and Statistics with Reliability, Queuing and Computer applications, Kishor S.

Trivedi, 2nd Edition, Wiley Publication, ISBN: 978-0-471-33341-8. 3. Graph Theory-Modeling, Applications and Algorithms, Geir Agnarsson & Raymond

Greenlaw, Pearson Education, 2008, ISBN: 978-81-317-1728-8. 4. Theory and Problems of Probability, Seymour Lipschutz & Marc Lars Lipson, 2nd Edition,

Schaum’s Outline Series, ISBN: 0-07-118356-6. Continuous Internal Evaluation (CIE); Theory (100 Marks) CIE is executed by way of quizzes (Q), tests (T) and Assignment. A minimum of three quizzes are conducted and each quiz is evaluated for 10 marks adding up to 30 marks. All quizzes are conducted online. Faculty may adopt innovative methods for conducting quizzes effectively. The number of quizzes may be more than three also. The three tests are conducted for 50 marks each and the sum of the marks scored from three tests is reduced to 60. The marks component for assignment is 10. The total marks of CIE are 100. Semester End Evaluation (SEE); Theory (100 Marks) SEE for 100 marks is executed by means of an examination. The Question paper for each course contains two parts, Part – A and Part – B. Part – A consists of objective type questions for 20 marks covering the complete syllabus. Part – B consists of five main questions, one from each unit for 16 marks adding up to 80 marks. Each main question may have sub questions. The question from Units I, IV and V have no internal choice. Units II and III have internal choice in which both questions cover entire unit having same complexity in terms of COs and Bloom’s taxonomy level.


CO1 3 2 - - - - - - - 1 - 1 CO2 3 2 2 1 - - - - - 1 - 1 CO3 3 3 2 2 - - - - - 1 - 1 CO4 3 3 3 3 - - - - - 1 - 1




IV Semester

ENVIRONMENTAL TECHNOLOGY (Theory)

Course Code: 16ET32/16ET42 CIE Marks: 50 Credits: L:T:P:S: 2:0:0:0 SEE Marks: 50 Hours: 25L SEE Duration: 02Hrs Course Learning Objectives: The students will be able to

1 Understand the various components of environment and the significance of the sustainability of healthy environment.

2 Recognize the implications of different types of the wastes produced by natural and anthropogenic activity.

3 Learn the strategies to recover the energy from the waste.

4 Design the models that help mitigate or prevent the negative impact of proposed activity on the environment

UNIT-I Introduction: Ecosystem – Types and structure of ecosystem. Components of environment, Environmental education, Environmental act & regulations. Global environmental issues, ISO 14000, Environmental Impact Assessment and Challenges.

05 Hrs

UNIT II Environmental pollution: Causes, effects and control measures of Air, noise and land pollution. Air Pollution. Clean air act, Pollution standard index. Indoor air quality. Global atmospheric change - Global warming, Acid rain &Ozone depletion and their controlling measures.

05 Hrs

UNIT III Water pollution and management: Pollutants in surface & ground water, water borne diseases. Water purification systems: physical & chemical treatment - aeration, solids separation, settling operations, coagulation, softening, filtration, disinfection, The common technologies for purification of drinking water - Ultraviolet radiation treatment, Reverse Osmosis. Rain water harvesting, water recycling, STP plant.

05 Hrs

UNIT IV Renewable energy sources and technology for generation of energy: Different types of energy, conventional sources & non conventional sources of energy, solar energy, wind energy, hydro electric energy, Geothermal Energy, Nuclear energy, Fossil Fuels & Biomass energy.

05 Hrs

UNIT V Solid waste management:Types, causes, control and processing. Typical generation rates, estimation of solid waste quantities, factors that affect generation rates. Management - On site handling, collection, storage and processing techniques, ultimate disposal, landfills. Reduction and recycling of waste – waste to composite, energy.

05 Hrs



Course Outcomes: After completing the course, the students will be able to

CO1 Identify the components of environment and exemplify the detrimental impact of anthropogenic activities on the environment.

CO2 Differentiate the various types of wastes and suggest appropriate safe technological methods to manage the waste.

CO3 Aware of different renewable energy resources and can analyse the nature of waste and propose methods to extract clean energy.

CO4 Adopt the appropriate recovering methods to recover the essential resources from the wastes for reuse or recycling.

Reference Books 1. Introduction to environmental engineering and science, Gilbert, M.M., Pearson Education. 2nd

Edition, 2004, ISBN: 8129072770. 2. Environmental Engineering, Howard S. Peavy, Donald R. Rowe and George Tchobanoglous,

2000, McGraw Hill Series in water resources and Environmental Engg., ISBN: 0070491348 3. Environmental Science – 15th edition, G. Tyler Miller, Scott Spoolman, 2012,Publisher:

Brooks Cole, ISBN-13: 978-1305090446 ISBN-10: 130509044 4. Environment Management, Vijay Kulkarni and T. V. Ramachandra, 2009, TERI Press,

ISBN: 8179931846, 9788179931844 Continuous Internal Evaluation (CIE); Theory (50 Marks) CIE is executed by way of quizzes (Q), tests (T) and Assignment. A minimum of three quizzes are conducted and each quiz is evaluated for 05 marks adding up to 15 marks. All quizzes are conducted online. Faculty may adopt innovative methods for conducting quizzes effectively. The number of quizzes may be more than three also. The three tests are conducted for 25 marks each and the sum of the marks scored from three tests is reduced to 30. The marks component for Assignment is 05. The total marks of CIE are 50. Semester End Evaluation (SEE); Theory (50 Marks) SEE for 50 marks is executed by means of an examination. The Question paper for each course contains two parts, Part – A and Part – B. Part – A consists of objective type questions for 10 marks covering the complete syllabus. Part – B consists of five main questions, one from each unit for 8 marks adding up to 40 marks. Each main question may have sub questions. The question from Units I, IV and V have no internal choice. Units II and III have internal choice in which both questions cover entire unit having same complexity in terms of COs and Bloom’s taxonomy level.

CO-PO Mapping CO/PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 1 - - - - - 3 - 2 - - CO2 2 3 3 2 1 - 3 3 2 - 2 1 CO3 - 3 1 3 - 2 3 3 2 - 1 2 CO4 1 - 2 1 3 - 2 - 2 - - 2 High-3 : Medium-2 : Low-1

https://www.amazon.com/s/ref=dp_byline_sr_book_1?ie=UTF8&text=G.+Tyler+Miller&search-alias=books&field-author=G.+Tyler+Miller&sort=relevancerank

https://www.amazon.com/s/ref=dp_byline_sr_book_2?ie=UTF8&text=Scott+Spoolman&search-alias=books&field-author=Scott+Spoolman&sort=relevancerank



IV Semester DESIGN AND ANALYSIS OF ALGORITHMS

(Theory and Practice) Course Code:16CS43 CIE Marks: 100 + 50 Credits: L:T:P:S : 3:0:1:1 SEE Marks: 100 + 50 Credits: 36L SEE : 3 + 3 Hrs

Course Learning Objectives: The students will be able to

1 Explore various design techniques and the algorithms under each technique. 2 Differentiate between various asymptotic notations used in complexity analysis. 3 Analyze the complexity of the algorithms using the mathematical model developed. 4 Synthesize efficient algorithms in common engineering design situations.

UNIT-I

Fundamentals of the Analysis of Algorithms Notion of Algorithm, Fundamentals of algorithmic problem solving, Analysis Framework, Asymptotic notations and Basic efficiency classes, Mathematical analysis on Nonrecursive algorithms, Mathematical analysis on recursive algorithms, Empirical Analysis of algorithms

07 Hrs

UNIT-II Divide and Conquer Merge sort, Quick sort, Multiplication of Large integers and Strassen’s matrix multiplication Decrease and Conquer Insertion Sort, Depth First Search and Breadth First Search, Topological sorting, Algorithms for generating combinatorial objects, Decrease by a constant factor algorithms, variable-size decrease algorithms

07 Hrs

UNIT-III Transform and Conquer Pre-sorting, Balanced Search Trees: 2-3 Tree, Heap sort, Problem reduction. String matching algorithm – Naïve string matching, Horspool’s algorithm and Boyer-Moore algorithm.

07 Hrs

UNIT-IV Dynamic Programming Computing Binomial coefficient, Warshall’s and Floyd’s algorithms, The Knapsack problem and Memory functions Greedy Technique Prim’s Algorithm, Kruskal’s Algorithm, Dijkstra’s Algorithm, Huffman Tree

08 Hrs

UNIT – V Limitations of Algorithms Decision Tree, P,NP and NP Complete Problems, Coping with the Limitations of Algorithm Power:: Backtracking, Branch and Bound, Approximation Algorithms for NP hard problems

07 Hrs

Laboratory Component

PART-A Note: The following programs can be executed on C/C++/any equivalent tool/language 1. Write a program to sort a given set of elements using Merge sort method and find the time

required to sort the elements. 2. Write a program to sort a given set of elements using Quick sort method and find the time

required to sort the elements 3. Write a program to print all the nodes reachable from a given starting node in a graph using

Depth First Search method and Breadth First method. Also check connectivity of the graph. If the graph is not connected, display the number of components in the graph.



4. Write a program to obtain the Topological ordering of vertices in a given digraph using a)Vertices deletion method b)DFS method

5. Write a program to sort a given set of elements using Heap sort method. Find the time complexity.

6. a) Write a program to implement Boyer Moore algorithm for String Matching.

b) Write a program to implement all pair shortest paths problem using Floyd’s algorithm. 7. a) Write a program to implement 0/1 Knapsack problem using dynamic programming b) Write a program to implement binomial coefficient using dynamic programming. 8. Write a program to find Minimum cost spanning tree of a given undirected graph using

Prim’s algorithm. 9. Write a program to find the shortest path using Dijkstra’s algorithm for a weighted connected

graph. 10. Write a program to implement N -queens problem.

PART B Students have to solve a problem*(either given by the staff or student may come up with their own problem) using the design techniques such as

1. Divide and Conquer 2. Decrease and Conquer 3. Dynamic Programming 4. Greedy Technique 5. Back Tracking

*The problem may be (not limited to) 1. Finding the maximum and minimum in the given set of elements 2. Sorting 3. To count the number of nodes or leaf nodes in a binary tree. 4. To find the shortest path.

Course Outcomes: After completing the course, the students will be able to CO1. Understand and explore the asymptotic runtime complexity of algorithms by using

mathematical relations. CO2. Analyse various algorithm design strategies and develop algorithm for a given problem CO3. Evaluate the time and space efficiency for a given problem by considering the employed

data structures. CO4. Apply the most appropriate algorithmic solution for the given problem. Reference Books: 1. Introduction to The Design and Analysis of Algorithms, Anany Levitin, 2nd Edition,

2003, Pearson Education, ISBN:9780201743951 2. Introduction to Algorithms, Cormen T.H., Leiserson C.E., Rivest R.L., Stein C, 3rd

Edition, 2010, PHI Publications, ISBN:9780262033848. 3. Computer Algorithms, Horowitz E., Sahani S., Rajasekharan S., 2nd Edition, 2006,

Galgotia Publications, ISBN:9780716783169.





CO1 3 3 2 2 2 - - - 2 1 - 1 CO2 2 2 3 2 1 - - - 2 1 - 1 CO3 2 3 2 2 2 - - 1 2 - - - CO4 2 2 2 2 2 - - 1 2 - - 1




IV Semester OBJECT ORIENTED PROGRAMMING USING JAVA

(Theory and Practice) Course Code:16CS44 CIE Marks: 100 + 50 Credits: L:T:P:S : 3:0:1:1 SEE Marks: 100 + 50 Credits: 36L SEE : 3 + 3 Hrs Course Learning Objectives: The students will be able to

1 Understand fundamentals of programming such as variables, conditional and iterative execution, methods, etc.

2 Explore the features of object-oriented programming in Java, including defining classes, invoking methods, using class libraries, etc.

3 Develop the ability to program in Java to solve specified problems.

4 Use the object oriented principles and design classes using an appropriate tools of collaborating programming (versioning systems, code review) and study their usage through group programming projects.

UNIT-I

The Object Model Foundations of the Object Model- Object-Oriented Programming , Object-Oriented Design, Object-Oriented Analysis Elements of the Object Model - Abstraction , Encapsulation , Modularity , Hierarchy, Typing , Concurrency, Persistence Applying the Object Model. The Nature of an Object, Relationships among Objects, The Nature of a Class, Relationships among Classes, The Interplay of Classes and Objects, Building Quality Classes and Objects.

06 Hrs

UNIT-II Java Programming Fundamentals: Features, Data Types, Variables and Arrays , Operators , Control Statements, Class Fundamentals , Declaring Objects , Introducing Methods , Constructors ,Static fields and Methods, Super and this keyword, Inheritance ,Interface ,Inner-classes, Package. Exception Handling : Exception-Handling Fundamentals – Exception Classes , Exception Types, Uncaught Exceptions, Using try and catch, Multiple catch clauses, Nested try Statements, throw,throws, finally.

07 Hrs

UNIT-III Multithreaded Programming : Java Thread Classes, The Java Thread Model , The Main Thread , Creating a Thread, Creating Multiple Threads, Using isAlive( ) and join( ) , Thread Priorities , Synchronization , Suspending, Resuming and Stopping Threads . Lambda Expressions :Fundamentals, Block Lambda expressions, Passing Lambda Expressions as Argument,Lambda Expressions and Exceptions,Method References. Collections :The Collection Interfaces , The Collection Classes , Accessing a Collection via an Iterator, Legacy Classes and Interface.

08 Hrs

UNIT-IV Files : Byte streams, Character Streams,Console Class. Regular Expressions: Regular Expressions Processing. JavaFX GUI Programming: Basic Concepts, Application Skeleton, Application Thread, Using Buttons and Events, JavaFxControls : Using Image and ImageView, Radio Buttons,Check Box, TextField, ScrollPane,MenuBa,Menu,MenuItem.

07 Hrs



UNIT – V J2EE Database Concepts : JBDC Driver types , JDBC Packages , JDBC Process, Database Connection , Connection pool ,Statement Objects , Result Sets , Transaction processing. MVC and Java Beans : MVC Architecture, What is Java Beans?, Advantage, Introspection, Bound and Constrained Properties,Persistence, Bean Example. Java Server Pages (JSP): JSP Tags, Tomcat, Request String, User Sessions, Cookies, Session Objects.

08 Hrs

Laboratory Component

PART-A 1) Classes and objects.

a) Create a Java class called Student with the following details as variables within it. (i) USN (ii) Name (iii) Branch (iv) Phone

Write a Java program to create ‘n’ Student objects and print the USN, Name, Branch, and Phone of these objects with suitable headings.

b) Write a program in Java with class Rectangle with the data fields width, length, area and color. The length, width and area are of double type and color is of string type. The methods are set_ length (), set_width (), set_ color (), and find_ area (). Create two object of Rectangle and compare their area and color. If area and color both are the same for the objects then display “Matching Rectangles”, otherwise display “Non matching Rectangle”.

c) Write a java program to overload constructor and method. 2) Inheritance and polymorphism.

a) Write a program in Java to create a Player class. Inherit the classes Cricket _Player, Football _Player and Hockey_ Player from Player class.

b) Consider the trunk calls of a telephone exchange. A trunk call can be ordinary, urgent or lightning. The charges depend on the duration and the type of the call. Write a program using the concept of polymorphism in Java to calculate the charges.

c) Design a superclass called Staff with details as StaffId, Name, Phone, Salary. Extend this class by writing three subclasses namely Teaching (domain, publications), Technical (skills), and Contract (period). Write a Java program to read and display at least 3 staff objects of all three categories.

d) Write a Java program to read two integers a and b. Compute a/b and print, when b is not zero. Raise an exception when b is equal to zero.

3) Package and Interface. a) Write a program to make a package Balance in which has Account class with Display_Balance method in it. Import Balance package in another program to access Display_Balance method of Account class.

b) Create the dynamic stack by implementing the interfaces that defines push() and pop() methods.

4) Exception handling. On a single track two vehicles are running. As vehicles are going in same direction there is no problem. If the vehicles are running in different direction there is a chance of collision. To avoid collisions write a Java program using exception handling. You are free to make necessary assumptions.



5) Multithreading a) Write a Java program to create five threads with different priorities. Send two

threads of the highest priority to sleep state. Check the aliveness of the threads and mark which thread is long lasting.

b) Write a multithreaded Java program to implement producer consumer problem. 6) String Handling Write a program to reverse words in a sentence without using library method 7) Collections Write a program to create List containing ‘n‘ copies of Specified Object Example

PART B Develop standalone JAVA application to implement the following

1. Lambda expression 2. List 3. Dictionary 4. Hashtable 5. JavaFX framework 6. Tree

Develop web based JAVA application to implement the following 1. JDBC 2. JSP 3. Native methods

Course Outcomes: After completing the course, the students will be able to CO1. Explore the fundamentals of Object-oriented concepts and apply features of object-

oriented programming of Java to solve real world problems. CO2. Design Classes and establish relationship among Classes for various applications from

problem definition. CO3. Analyze and implement reliable object-oriented applications using Java features such as

Exception Handling , Multithreaded Programming , Lambda Expressions, Collection framework, JavaFX GUI Programming, J2EE Database Concepts and JSP

CO4. Design and develop standalone/web based application using Java and Advanced J2EE technologies.

Reference Books: 1. Object-Oriented Analysis And Design With applications, Grady Booch , Robert A

Maksimchuk, Michael W Eagle, Bobbi J Young, 3rd Edition , 2013, Pearson education, ISBN :978-81-317-2287-93.

2. The Complete Reference - Java , Herbert Schildt 9th Edition, 2016, TMH Publications, ISBN :978-93-392-1209-4.

3. The Complete Reference -J2EE , Jim Keogh, 3rd Edition, 2015, TataMcGRAW Hill Publications, ISBN : 9780070529120.

4. Head First Java, Kathy Sierra and Bert Bates, 2nd Edition, 2014, Oreilly Publication , ISBN : 978817366602.




CO-PO Mapping

CO/PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 2 1 1 1 - - - - - - - 1 CO2 2 2 3 1 2 - - 1 1 1 - 1 CO3 1 3 2 2 2 - - 1 2 2 - 1 CO4 1 2 2 2 2 - - 1 2 - - 1




IV Semester

OPERATING SYSTEMS (Theory and Practice)

Course Code:16CS45 CIE Marks: 100 + 50 Credits: L:T:P:S : 3:0:1:1 SEE Marks: 100 + 50 Credits: 35L SEE : 3 + 3 Hrs Course Learning Objectives: The students will be able to 1 Know and understand the classes of operating system, design architecture and system calls. 2 Understand the concept of processes, threads and their scheduling mechanisms.

3 Model, abstract, and implement efficient software solutions for process synchronization using semaphores and monitors.

4 Know resource allocation issues and deadlock handling mechanism used by an operating system.

5 Acquire a detailed understanding of operations in memory management. 6 Study the important files system used in major operating systems.

7 Relate the concepts studied to one used in practice by taking a case study of two major operating systems.

UNIT-I

Introduction to operating systems , Processes and Threads Goals of Operating system((1.2 text book 2), Classes of Operating System(2.2 -2.8 text book 2), System Calls (2.3 Text Book 1), Dual mode of operation, Approaches to OS design and implementation: Microkernel, Layered, Kernel Approach, , Virtual Machines. Process- Process concept, Process scheduling, Threads - Overview, Multithreading models, Pthreads

07 Hrs

UNIT-II CPU scheduling and Process Synchronization CPU scheduling - Basic concepts, scheduling criteria, scheduling algorithms(5.3.1-5.3.4 Text Book 1), Thread scheduling Process Synchronization Background, The Critical section problem, Peterson’s Solution, Synchronization hardware

07 Hrs

UNIT-III Process Synchronization and Deadlocks Semaphores, Classic problems of synchronization,Monitors. Deadlocks System model, Deadlock characterization, Methods for handling deadlocks, deadlock prevention, Deadlock avoidance: Banker’s algorithm, Deadlock detection and recovery from deadlock

07 Hrs

UNIT-IV Main Memory Management Address binding, Logical versus physical-address space, dynamic loading, Dynamic linking and shared libraries, Swapping, Contiguous allocation, Paging, Segmentation Virtual memory Demand paging, Page replacement algorithms: FIFO page replacement, Optimal page replacement, LRU page replacement, LRU approximation page replacement, Allocation of frames, Thrashing.

07 Hrs

UNIT – V Disk Scheduling, File System interface and protection Disk scheduling methods, File Access methods, File Allocation methods, FAT file system , NTFS file system , EXT/Linux file system , The Linux System(21.2-21.7 text book 1) , xv6 operating system(chapter 1, chapter 2 chapter 5 and chapter 6 Text Book 3)

07 Hrs



Laboratory Component The students are expected to devise/identify suitable problem and implement solution which involves the concepts listed below . 1. Process control system calls

Application to demonstrate use of fork, execve, wait, getpid, exit system calls.

2. Thread management using Pthread Library Application to demonstrate use of pthread_create, pthread_join, pthread_exit and other pthread library functions.

3. Process scheduling and process priority Application to examine and modify process priorities with getpriority(), setpriority()and scheduling policy with sched_gettscheduler(), sched_setscheduler().

4. Process/Thread synchronization Application to demonstrate process/thread synchronization using semaphores and mutex. Implement Dining philosophers problem, reader-writer and producer-consumer.

5. Deadlock Avoidance Write a program that implements the Bankers’ algorithm. Create n threads that request and release resources from the bank. The banker will grant request only if it leaves the system in a safe state.

6. Memory Management Simulate memory management function of operating system. Assume that a system has 32-bit virtual address with a 4-KB page size. Write a C program that is passed a virtual address(in decimal) on the command line and have it output the page number and offset for given address. As an example, your program would run as follows

./a.out 19986 Your program would output :

The address 19986 contains Page number = 4 Offset = 3602

7. Memory Management Write a program to simulate Buddy memory allocation algorithm

8. File Management Write a program to create, open, write and read from file. Show how to perform sequential and random access from the file.

Open Ended Experiments Students are expected to implement a mini project using operating system concepts and APIs/system calls learned in the theory. The primary emphasis of the experiment is to understand and gain knowledge of operating system concepts so as to apply these concepts in implementing solutions to real world problems. Students are required to form a team with 2 persons in a team. Students have to select the problem/application of their choice and get confirmed with faculty handling the course. Few sample topics are listed below. Open ended



1. To compile and run xv6 2. xv6 System call tracing 3. Implement malloc, realloc, free using brk and sbrk 4. Implement a mini shell 5. Implement a garbage collector

Course Outcomes: After completing the course, the students will be able to CO1. Understand and explore the fundamentals of OS, OS design architecture, process, threads,

scheduling, process synchronization, deadlocks, memory management and file systems. CO2. Analyze the theory and implementation of processes, process synchronization, scheduling,

memory management and file system. CO3. Apply process synchronization, CPU scheduling, deadlock handling, memory management

and file system management concepts/algorithms to real world problems. CO4. Design or develop solutions for process synchronization, CPU scheduling, deadlock

handling, memory management and file system management Reference Books: 1. Operating System Concepts, Abraham Silberschatz, Peter Baer Galvin , Greg Gagne,

8th Edition, Incorporated, 2010, John Wiley & Sons,ISBN 0470233990, 9780470233993. 2. Operating systems - A concept based Approach, D.M Dhamdhere, 3rd Edition, 2008, Tata

McGraw-Hill, ISBN: 9781259005589, 1259005585. 3. “xv6: a simple, Unix-like teaching operating system”,

https://pdos.csail.mit.edu/6.828/2014/xv6/book-rev8.pdf 4. Modern Operating Systems, Andrew S. Tenenbaum, 4th Edition, 2013, Pearson Education,

ISBN-13: 978-0133591620, ISBN-10: 013359162X

Continuous Internal Evaluation (CIE): Total marks: 100+50=150 Theory – 100 Marks CIE is executed by way of quizzes (Q), tests (T) and Self-Study(S). A minimum of three quizzes are conducted and each quiz is evaluated for 10 marks adding up to 30 marks. All quizzes are conducted online. Faculty may adopt innovative methods for conducting quizzes effectively. The number of quizzes may be more than three also. The three tests are conducted for 50 marks each and the sum of the marks scored from three tests is reduced to 50. The marks component for Self-study is 20. The total CIE for theory is 100. Laboratory- 50 Marks The Laboratory session is held every week as per the time table and the performance of the student is evaluated in every session. The average of marks over number of weeks is considered for 40 marks. At the end of the semester a test is conducted for 10 marks. Total marks for the laboratory is 50. Semester End Evaluation (SEE): Total marks: 100+50=150 Theory – 100 Marks SEE for 100 marks is executed by means of an examination. The Question paper for each course contains two parts, Part – A and Part – B. Part – A consists of objective type questions for 20 marks covering the complete syllabus. Part – B consists of five main questions, one from each unit for 16 marks adding up to 80 marks. Each main question may have sub questions. The question from Units I, IV and V have no internal choice. Units II and III have internal choice in which both questions cover entire unit having same complexity in terms of COs and Bloom’s taxonomy level. Laboratory- 50 Marks

https://pdos.csail.mit.edu/6.828/2014/xv6/book-rev8.pdf



Experiment Conduction with proper results is evaluated for 40 marks and Viva is for 10 marks. Total SEE for laboratory is 50 marks.


CO1 - 1 - - - - - - - - - 1 CO2 - 2 - - - - - - - - - 1 CO3 2 2 1 1 - - - - - 2 - 2 CO4 - 2 1 1 - - - - - 1 - 2




IV Semester

THEORY OF COMPUTATION (Theory)

Course Code:16CS46 CIE Marks: 100 Credits: L:T:P:S: 3:1:0:0 SEE Marks: 100 Hours: 36L+24T SEE Duration: 03Hrs Course Learning Objectives: The students will be able to

1 Understand fundamental concepts of theory of computation and the use of mathematical thinking as it is applied to Computer Science.

2 Compare finite automata; push down automata and Turing machines as Mathematical models of computation.

3 Develop the concepts and skills necessary to be able to evaluate the computability and complexity of practical computational problems.

4 Understand formal thought processes, computation, algorithms and their limits. 5 Design a machine model to accept a specified language

UNIT-I

Regular Expressions, Finite Automata & Regular Expressions, Applications of Regular Expressions, Algebraic laws of RE, Equivalence & minimization of automata.

06 Hrs

UNIT-II Pumping Lemma, Closure properties of Regular Languages, Decision properties of Regular languages, Context-free grammars, Parse trees, Applications, Ambiguity in grammars & languages, Simplification of CFG, Normal forms of CFGs.

08 Hrs

UNIT-III Definition, the languages of a PDA, Equivalence of PDA’s & CFG’s, Deterministic PDA. The Pumping Lemma, Closure properties of CFLs, Decision properties of CFLs

08 Hrs

UNIT-IV Regular Grammar,Equivalence of Regular Grammar and DFA, Context-Sensitive Grammar, Linear Bound Automata.

06 Hrs

UNIT – V Problems that computers cannot solve, The Turing Machine and basic concepts, Programming techniques for Turing Machines, Different types of Turing Machines, Unrestricted Grammar, Turing Machines & Computers. A language that is not recursively enumerable, An undecidable problem that is RE, Post’s Correspondence problem, Other undecidable problems. The Chomsky hierarchy.

08 Hrs

Course Outcomes: After completing the course, the students will be able to CO1. Get in depth knowledge of fundamental concepts of theory of computations. CO2. Analyse the tools of finite automata to various fields of computer science. CO3. Design solution model for complex problems, using the appropriate skills of automata

theory for better results. CO4. Apply automata skills in situations that describe computation effectively and efficiently.

Reference Books: 1. Introduction to Automata Theory, Languages & Computation, J.P.Hopcroft, Rajeev

Motwani, J.D.Ullman, 3rd Edition, 2008, Pearson Education, ISBN:81-3172-047-0. 2. Introduction to Languages & Theory of Computation, John Martin, 4th Edition, 2011, Tata

McGraw-Hill, ISBN: 978-0-07-319146-1. 3. An Introduction To Formal Languages & Automata, Peter Linz, 6th Edition, 2007, Narosa

Publishing House, ISBN: 07-6371-422-4.





CO1 1 1 - - - - - - 2 2 - 1 CO2 - 3 - - 1 - - - 3 2 - 1 CO3 3 3 3 - - - - - 3 3 - 1 CO4 - 2 1 - 1 - - - 2 2 - 1




IV Semester

Professional Practice – II COMMUNICATION SKILLS AND PROFESSIONAL ETHICS

Course Code: 16HS47 CIE Marks: 50 Credits: L:T:P:S: 0:0:1:0 SEE Marks: NA Hours: 18 Hrs CIE Duration: 02 Hrs Course Learning Objectives: The students will be able to

1 Develop communication style, the essentials of good communication and confidence to communicate effectively.

2 Manage stress by applying stress management skills. 3 Ability to give contribution to the planning and coordinate Team work. 4 Ability to make problem solving decisions related to ethics.

III Semester UNIT-I

Communication Skills: Basics, Method, Means, Process and Purpose, Basics of Business Communication, Written & Oral Communication, Listening. Communication with Confidence & Clarity- Interaction with people, the need the uses and the methods, Getting phonetically correct, using politically correct language, Debate & Extempore.

06 Hrs

UNIT-II Assertive Communication- Concept of Assertive communication, Importance and applicability of Assertive communication, Assertive Words, being assertive. Presentation Skills- Discussing the basic concepts of presentation skills, Articulation Skills, IQ & GK, How to make effective presentations, body language & Dress code in presentation, media of presentation.

06 Hrs

UNIT-III.A Team Work- Team Work and its important elements Clarifying the advantages and challenges of team work Understanding bargains in team building Defining behaviour to sync with team work Stages of Team Building Features of successful teams.

06 Hrs

IV Semester UNIT-III.B

Body Language & Proxemics - Rapport Building - Gestures, postures, facial expression and body movements in different situations, Importance of Proxemics, Right personal space to maintain with different people.

06 Hrs

UNIT-IV Motivation and Stress Management: Self-motivation, group motivation, leadership abilities, Stress clauses and stress busters to handle stress and de-stress; Understanding stress - Concept of sound body and mind, Dealing with anxiety, tension, and relaxation techniques. Individual Counselling & Guidance, Career Orientation. Balancing Personal & Professional Life-

06 Hrs

UNIT-V Professional Practice - Professional Dress Code, Time Sense, Respecting People & their Space, Relevant Behaviour at different Hierarchical Levels. Positive Attitude, Self Analysis and Self-Management. Professional Ethics - values to be practiced, standards and codes to be adopted as professional engineers in the society for various projects. Balancing Personal & Professional Life

06 Hrs

Course Outcomes: After completing the course, the students will be able to CO1: Inculcate skills for life, such as problem solving, decision making, stress management. CO2: Develop leadership and interpersonal working skills and professional ethics. CO3: Apply verbal communication skills with appropriate body language. CO4: Develop their potential and become self-confident to acquire a high degree of self.



Reference Books 1. The 7 Habits of Highly Effective People, Stephen R Covey, Free Press, 2004 Edition, ISBN:

0743272455 2. How to win friends and influence people, General Press, Dale Carnegie, 1st Edition, 2016, ISBN:

9789380914787 3. Crucial Conversation: Tools for Talking When Stakes are High, Kerry Patterson, Joseph Grenny,

Ron Mcmillan, 2012 Edition, McGraw-Hill Publication ISBN: 9780071772204 4. Aptimithra: Best Aptitude Book , Ethnus 2014 Edition, Tata McGraw Hill ISBN: 9781259058738 Scheme of Continuous Internal Examination (CIE) Evaluation of CIE will be carried out in TWO Phases. Phase Activity Weightage

I Test 1 is conducted in III Sem for 50 marks (15 Marks Quiz and 35 Marks Descriptive answers) after completion of Unit-1, Unit-2 and Unit -3.A for 18 hours of training sessions.

50%

II Test 2 is conducted in IV Sem for 50 marks ((15 Marks Quiz and 35 Marks Descriptive answers) after completion of Unit -3B, Unit - 4 and Unit-5 for 18 hours of training sessions.

50%

At the end of the IV sem Marks of Test 1 and Test 2 is consolidated for 50 marks (Average of Test1 and Test 2 (T1+T2/2). The grading is provided by the Coe. The final CIE marks is scrutinized by the committee comprising of HSS- Chairman, Training Co-ordinator, respective department Staff Placement co-ordinator before submitting to CoE.

SEE: NA

CO-PO Mapping CO/PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 1 --- ___ --- ---- 1 ---- 1 1 1 2 1 CO2 1 2 2 --- --- --- ---- 1 2 1 2 1 CO3 --- --- 3 --- --- 1 --- 2 1 2 1 --- CO4 --- --- ___ --- ---- 1 3 1 1 1 1 --- Low-1 Medium-2 High-3



IV Semester

BRIDGE COURSE MATHEMATICS (Theory)

Course Code: 16DMA48 CIE Marks: 100 Credits: L:T:P:S: 2:0:0:0 SEE Marks: 100 Audit Course SEE Duration: 03Hrs Course Learning Objectives: The students will be able to 1 Understand the existence of polar coordinates as possible 2 - D geometry, approximate a

function of single variable in terms of infinite series. 2 Gain knowledge of multivariate functions, types of derivatives involved with these functions

and their applications. 3 Recognize linear differential equations, apply analytical techniques to compute solutions. 4 Acquire concepts of vector functions, vector fields and differential calculus of vector

functions in Cartesian coordinates. 5 Explore the possibility of finding approximate solutions using numerical methods in the

absence of analytical solutions of various systems of equations. Prerequisites : Hyperbolic functions, Trigonometric formulas, methods of differentiation, methods of integration, reduction formulae, vector algebra.

UNIT-I Differential Calculus: Taylor and Maclaurin’s series for function of single variable. Partial derivatives – Introduction, simple problems. Total derivative, Composite functions, Jacobian’s- simple problems.

05 Hrs

UNIT-II Multiple Integrals: Evaluation of double and triple integrals – direct problems, change of order in double integral, change of variables to polar, cylindrical and spherical coordinate systems.

05 Hrs

UNIT-III Differential Equations: Higher order linear differential equations with constant coefficients, Complementary function and Particular integral, problems. Equations with variable coefficients – Cauchy and Legendre differential equations, problems.

06 Hrs

UNIT-IV Vector Differentiation: Introduction, simple problems in terms of velocity and acceleration. Concepts of Gradient, Divergence- solenoidal vector function, Curl- irrotational vector function and Laplacian, simple problems.

05 Hrs

UNIT-V Numerical Methods: Algebraic and transcendental equations – Regula-Falsi method, Newton-Raphson method. Ordinary Differential Equations – Taylor’s, modified Euler’s and 4th order Runge-Kutta methods. Numerical Integration – Simpson’s 1/3rd, 3/8th and Weddle’s rules.

05 Hrs

Course Outcomes: After completing the course, the students will be able to CO1: Demonstrate the understanding of the basics of polar coordinates, partial differentiation,

multiple integrals, vector differentiation, classification and types of solutions of higher order linear differential equations, requirement of numerical methods and few basic definitions.

CO2: Solve problems on total derivatives of implicit functions, double integrals by changing order of integration, homogeneous linear differential equations, velocity and acceleration vectors.



CO3: Apply acquired knowledge to find infinite series form of functions, multiple integrals by changing order, solution of non-homogeneous linear differential equations, and numerical solution of equations.

CO4: Evaluate multiple integrals by changing variables, different operations using del operator and numerical solutions of differential equations and numerical integration.

Reference Books 1. Higher Engineering Mathematics, B.S. Grewal, 40th Edition, Khanna Publishers, 2007,

ISBN: 81-7409-195-5. 2. Advanced Engineering Mathematics, R. K. Jain & S.R.K. Iyengar, Narosa Publishing House,

2002, ISBN: 817-3-19-420-3. Chapters: 1, 2, 8, 15. 3. Advanced Engineering Mathematics, Erwin Kreyszig, 9th Edition, John Wiley & Sons, 2007,

ISBN: 978-81-265-3135-6. Chapters: 6, 10, 12. 4. A Text Book of Engineering Mathematics, N.P Bali & Manish Goyal, 7th Edition, Lakshmi

Publications, 2010, ISBN: 978-81-7008-992-6. Chapters: 6, 18, 16, 8, 26. Continuous Internal Evaluation (CIE); Theory (100 Marks) CIE consists of Two Tests each for 50 marks (20 marks for Quiz + 30 marks for descriptive questions) Semester End Evaluation (SEE); Theory (100 Marks) SEE for 100 marks is executed by means of an examination. The Question paper for each course contains two parts, Part – A and Part – B. Part – A consists of objective type questions for 20 marks covering the complete syllabus. Part – B consists of five main questions, one from each unit for 16 marks adding up to 80 marks. Each main question may have sub questions. The question from each unit have internal choice in which both questions cover entire unit having same complexity in terms of COs and Bloom’s taxonomy level.

CO-PO Mapping CO/PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 3 2 - - - - - - - - - 1 CO2 3 2 - - - - - - - - 2 1 CO3 3 3 1 1 - - - - - - 2 1 CO4 3 3 1 1 - - - - - - 2 1

Curriculum Design Process

Academic Planning and Implementation

PROCESS FOR COURSE OUTCOME ATTAINMENT

Final CO Attainment Process

Program Outcome Attainment Process

Guidelines for Fixing Targets

• The target may be fixed based on last 3 years’ average attainment

Course (Syllabus)

CO Attainment

CO –PO Mapping

PO Attainment DIRECT

PO Attainment

80%

PO Attainment INDIRECT Alumni Survey Employer Survey

Senior Exit Survey

20%

PROGRAM OUTCOMES (POs)

1. Engineering knowledge: Apply the knowledge of mathematics, science, engineering fundamentals, and an engineering specialisation for the solution of complex engineering problems.

2. Problem analysis: Identify, formulate, research literature, and analyse complex engineering problems reaching substantiated conclusions using first principles of mathematics, natural sciences, and engineering sciences.

3. Design/development of solutions: Design solutions for complex engineering problems and design system components or processes that meet t h e specified needs with appropriate consideration for public health and safety, and cultural, societal, and environmental considerations.

4. Conduct investigations of complex problems: Use research-based knowledge and research methods including design of experiments, analysis and interpretation of data, and synthesis of the information to provide valid conclusions.

5. Modern tool usage: Create, select, and apply appropriate techniques, resources, and modern engineering and IT tools, including prediction and modelling to complex engineering activities, with an understanding of the limitations.

6. The engineer and society: Apply reasoning informed by the contextual knowledge to assess societal, health, safety, legal, and cultural issues and the consequent responsibilities relevant to the professional engineering practice.

7. Environment and sustainability: Understand the impact of the professional engineering solutions in societal and environmental contexts, and demonstrate the knowledge of, and need for sustainable development.

8. Ethics: Apply ethical principles and commit to professional ethics and responsibilities and norms of the engineering practice.

9. Individual and team work: Function effectively as an individual, and as a member or leader in diverse teams, and in multidisciplinary settings.

10. Communication: Communicate effectively on complex engineering activities with the engineering community and with t h e society at large, such as, being able to comprehend and write effective reports and design documentation, make effective presentations, and give and receive clear instructions.

11. Project management and finance: Demonstrate knowledge and understanding of the engineering and management principles and apply these to one’s own work, as a member and leader in a team, to manage projects and in multidisciplinary environments.

12. Life-long learning: Recognise the need for, and have the preparation and ability to engage in independent and life-long learning in the broadest context of technological change.

2016 scheme - rvce.edu.in. cse iii & iv 2016 scheme.pdf · introduction, periodic function,...

Documents