VTU Syllabus Computer Science & Engineering 3rd Semester: With the latest VTU Syllabus Computer Science & Engineering 3rd Semester students get to know the chapters and concepts to be covered in all subjects.
The Syllabus for VTU Computer Science & Engineering 3rd Semester gives students a clear understanding of the course structure and its objectives.
Based on the score in Computer Science & Engineering degree, you can apply for better career opportunities.
In the depth knowledge in every topic of Computer Science & Engineering 3rd Semester will also helpful to crack the various competitive exams like Gate.
Here we are providing you the complete guide on VTU Syllabus Computer Science & Engineering 3rd Semester 2020 and Marking Scheme.
VTU Syllabus Computer Science & Engineering 3rd Semester 2020
3rd semester is an important stage for Computer Science & Engineering. It is important to score more in Computer Science & Engineering for future opportunities.
To boost your semester exam preparation, you should have Computer Science 3rd Semester books & study materials, Previous years questions paper along with the latest Computer Science 3rd sem Syllabus.
Before starting the complete guide on VTU Syllabus Computer Science & Engineering 3rd Semester 2020, let’s check the highlights of VTU from the table below.
VTU Belgaum Highlights
Established year  1998 
Approvals  AICTE, UGC, COA( Council of Architecture) 
Courses  UG(35), PG(94), Ph.D & Research(592 departments) Quality Improvement Program(13) 
Official website  www.vtu.ac.in 
Number of Students  +325000 
Collaborations  Bosch Rexroth AGGermany
Virginia Commonwealth University University of California Deshpande FoundationStartup Center India Electronics and Semiconductor Association IBM India Ltd. Bengaluru Intel Asia. Bengaluru 
Download Ultimate Study Materials to Boost Your Preparation  
GATE Study Packages  VTU Study Materials 
CAT Study Packages  UPSC Study Packages 
Check the latest VTU Syllabus Computer Science & Engineering 3rd Semester 2020 from below.
TRANSFORM CALCULUS, FOURIER SERIES AND NUMERICAL TECHNIQUES 

Course Code  18MAT31  CIE Marks  40 
Teaching Hours/Week (L: T:P)  (2:2:0)  SEE Marks  60 
Credits  03  Exam Hours  03 
Course Learning Objectives:· To have an insight into Fourier series, Fourier transforms, Laplace transforms, Difference equations and Ztransforms.
· To develop the proficiency in variational calculus and solving ODE’s arising in engineering applications, using numerical methods. 

Module1  
Laplace Transform: Definition and Laplace transforms of elementary functions (statements only). Laplace transforms of Periodic functions (statement only) and unitstep function – problems.Inverse Laplace Transform: Definition and problems, Convolution theorem to find the inverse Laplace transforms (without Proof) and problems. Solution of linear differential equations using Laplace transforms.  
Module2  
Fourier Series: Periodic functions, Dirichlet’s condition. Fourier series of periodic functions period 2p andarbitrary period. Half range Fourier series. Practical harmonic analysis.  
Module3  
Fourier Transforms: Infinite Fourier transforms, Fourier sine and cosine transforms. Inverse Fourier transforms. Problems.Difference Equations and ZTransforms: Difference equations, basic definition, ztransformdefinition, Standard ztransforms, Damping and shifting rules, initial value and final value theorems (without proof) and problems, Inverse ztransform and applications to solve difference equations.  
Module4  
Numerical Solutions of Ordinary Differential Equations(ODE’s):Numerical solution of ODE’s of first order and first degree Taylor’s series method, Modified Euler’s method.
Runge Kutta method of fourth order, Milne’s and AdamBash forth predictor and corrector method (No derivations of formulae)Problems. 

Module5  
Numerical Solution of Second Order ODE’s: RungeKutta method and Milne’s predictor and corrector method. (No derivations of formulae).Calculus of Variations: Variation of function and functional, variational problems, Euler’s equation,
Geodesics, hanging chain, problems. 

Course outcomes: At the end of the course the student will be able to:· CO1: Use Laplace transform and inverse Laplace transform in solving differential/ integral equation arising in network analysis, control systems and other fields of engineering.
· CO2: Demonstrate Fourier series to study the behaviour of periodic functions and their applications in system communications, digital signal processing and field theory. · CO3: Make use of Fourier transform and Ztransform to illustrate discrete/continuous function arising in wave and heat propagation, signals and systems. · CO4: Solve first and second order ordinary differential equations arising in engineering problems using single step and multistep numerical methods. · CO5:Determine the externals of functionals using calculus of variations and solve problems arising in dynamics of rigid bodies and vibrational analysis. 

Question paper pattern: 
· The question paper will have ten full questions carrying equal marks.· Each full question will be for 20 marks.
· There will be two full questions (with a maximum of four sub questions) from each module. · Each full question will have sub question covering all the topics under a module. · The students will have to answer five full questions, selecting one full question from each module. 

Sl.No.  Title of the Book  Name of Author/s  the  Name of the Publisher  Edition Year  and  
Textbooks  
1  Advanced EngineeringMathematics  E. Kreyszig  John Wiley & Sons  10th2016  Edition,  
2  Higher Engineering Mathematics  B. S. Grewal  Khanna Publishers  44th2017  Edition,  
3  Engineering Mathematics  Srimanta Pal et al  OxfordPress  University  3^{rd} Edition, 2016  
Reference Books  
1  Advanced EngineeringMathematics 
C. Ray Wylie,
Louis C. Barrett 
McGrawHill Book Co  6^{th} Edition, 1995  
2  Introductory Methods of
Numerical Analysis 
S.S.Sastry  Prentice Hall of India  4^{th} Edition 2010  
3  Higher Engineering Mathematics  B.V. Ramana  McGrawHill  11^{th} Edition,2010  
4  A Textbook of Engineering
Mathematics 
N.P.Bali
Manish Goyal 
and  Laxmi Publications  6^{th} Edition, 2014  
5  Advanced Engineering
Mathematics 
Chandrika Prasad
and Reena Garg 
Khanna Publishing,  2018  
Web links and Video Lectures:
1. http://nptel.ac.in/courses.php?disciplineID=111 2. http://www.classcentral.com/subject/math(MOOCs) 4. VTU EDUSAT PROGRAMME – 20 
DATA STRUCTURES AND APPLICATIONS 

Course Code  18CS32  CIE Marks  40  
Number of Contact Hours/Week  3:2:0  SEE Marks  60  
Total Number of Contact Hours  50  Exam Hours  03  
CREDITS –4  
Course Learning Objectives: This course (18CS32) of VTU Syllabus Computer Science & Engineering 3rd Semester will enable students to:  
· Explain fundamentals of data structures and their applications essential for programming/problem solving.· Illustrate linear representation of data structures: Stack, Queues, Lists, Trees and Graphs.
· Demonstrate sorting and searching algorithms. · Find suitable data structure during application development/Problem Solving. 

Module 1  Contact Hours  
Introduction: Data Structures, Classifications (Primitive & Non Primitive), Data structure Operations, Review of Arrays, Structures, SelfReferential Structures, and Unions. Pointers and Dynamic Memory Allocation Functions. Representation of Linear Arrays in Memory, Dynamically allocated arrays.Array Operations: Traversing, inserting, deleting, searching, and sorting. Multidimensional Arrays, Polynomials and Sparse Matrices.
Strings: Basic Terminology, Storing, Operations and Pattern Matching algorithms. Programming Examples. Textbook 1: Chapter 1: 1.2, Chapter 2: 2.2 – 2.7 Text Textbook 2: Chapter 1: 1.1 – 1.4, Chapter 3: 3.1 – 3.3, 3.5, 3.7, Ch apter 4: 4.1 – 4.9, 4.14 Reference 3: Chapter 1: 1.4 RBT: L1, L2, L3 
10  
Module 2  
Stacks: Definition, Stack Operations, Array Representation of Stacks, Stacks using Dynamic Arrays, Stack Applications: Polish notation, Infix to postfix conversion, evaluation of postfix expression.Recursion – Factorial, GCD, Fibonacci Sequence, Tower of Hanoi, Ackerman’s function. Queues: Definition, Array Representation, Queue Operations, Circular Queues, Circular queues using Dynamic arrays, Dequeues, Priority Queues, A Mazing Problem. Multiple Stacks and Queues. Programming Examples.
Textbook 1: Chapter 3: 3.1 3.7 Textbook 2: Chapter 6: 6.1 6.3, 6.5, 6.76.10, 6.12, 6.13 RBT: L1, L2, L3 
10  
Module 3  
Linked Lists: Definition, Representation of linked lists in Memory, Memory allocation; Garbage Collection. Linked list operations: Traversing, Searching, Insertion, and Deletion. Doubly Linked lists, Circular linked lists, and header linked lists. Linked Stacks and Queues. Applications of Linked lists – Polynomials, Sparse matrix representation. Programming ExamplesTextbook 1: Ch apter 4: 4.1 – 4.6, 4.8, Textbook 2: Ch apter 5: 5.1 – 5.10, RBT: L1, L2, L3  10  
Module 4  
Trees: Terminology, Binary Trees, Properties of Binary trees, Array and linked Representation of Binary Trees, Binary Tree Traversals – Inorder, postorder, preorder; Additional Binary tree operations. Threaded binary trees, Binary Search Trees – Definition, Insertion, Deletion, Traversal, Searching, Application of TreesEvaluation of Expression,Programming Examples  10 
Textbook 1: Chapter 5: 5.1 –5.5, 5.7; Textbook 2: Chapter 7: 7.1 – 7.9 RBT: L1, L2, L3  
Module 5  
Graphs: Definitions, Terminologies, Matrix and Adjacency List Representation Of Graphs, Elementary Graph operations, Traversal methods: Breadth First Search and Depth First Search.Sorting and Searching: Insertion Sort, Radix sort, Address Calculation Sort.
Hashing: Hash Table organizations, Hashing Functions, Static and Dynamic Hashing. Files and Their Organization: Data Hierarchy, File Attributes, Text Files and Binary Files, Basic File Operations, File Organizations and Indexing Textbook 1: Chapter 6 : 6.1 –6.2, Chapter 7:7.2, Chapter 8 : 8.18.3 Textbook 2: Chapter 8 : 8.1 – 8.7, Chapter 9 : 9.19.3, 9.7, 9.9 Reference 2: Chapter 16 : 16.1 – 16.7 RBT: L1, L2, L3 
10 
Course Outcomes: The student will be able to :  
· Use different types of data structures, operations and algorithms· Apply searching and sorting operations on files
· Use stack, Queue, Lists, Trees and Graphs in problem solving · Implement all data structures in a highlevel language for problem solving. 

Question Paper Pattern:  
· The question paper will have ten questions.· Each full Question consisting of 20 marks
· There will be 2 full questions (with a maximum of four sub questions) from each module. · Each full question will have sub questions covering all the topics under a module. · The students will have to answer 5 full questions, selecting one full question from each module. 

Textbooks:  
1. Ellis Horowitz and Sartaj Sahni, Fundamentals of Data Structures in C, 2^{nd} Ed, Universities Press, 2014.2. Seymour Lipschutz, Data Structures Schaum’s Outlines, Revised 1^{st} Ed, McGraw Hill, 2014.  
Reference Books:  
1. Gilberg & Forouzan, Data Structures: A Pseudocode approach with C, 2^{nd} Ed, Cengage Learning,2014.2. Reema Thareja, Data Structures using C, 3^{rd} Ed, Oxford press, 2012.
3. JeanPaul Tremblay & Paul G. Sorenson, An Introduction to Data Structures with Applications, 2^{nd} Ed, McGraw Hill, 2013 4. A M Tenenbaum, Data Structures using C, PHI, 1989 5. Robert Kruse, Data Structures and Program Design in C, 2^{nd} Ed, PHI, 1996. 
ANALOG AND DIGITAL ELECTRONICS 

Course Code  18CS33  CIE Marks  40  
Number of Contact Hours/Week  3:0:0  SEE Marks  60  
Total Number of Contact Hours  40  Exam Hours  03  
CREDITS –3  
Course Learning Objectives: This course (18CS33) will enable students to:  
· Explain the use of photoelectronics devices, 555 timer IC, Regulator ICs and uA741 opamap IC· Make use of simplifying techniques in the design of combinational circuits.
· Illustrate combinational and sequential digital circuits · Demonstrate the use of flipflops and apply for registers · Design and test counters, AnalogtoDigital and DigitaltoAnalog conversion techqniues. 

Module 1  Contact Hours  
Photodiodes, Light Emitting Diodes and Optocouplers ,BJT Biasing :Fixed bias ,Collector to base Bias , voltage divider bias, Operational Amplifier Application Circuits: Multivibrators using IC555, Peak Detector, Schmitt trigger, Active Filters, NonLinear Amplifier, Relaxation Oscillator, CurrenttoVoltage and VoltagetoCurrent Converter , Regulated Power Supply Parameters, adjustable voltage regulator ,D to A and A to D converter.Text Book 1 :Part A:Chapter 2(Section 2.9,2.10,2.11), Chapter 4(Section 4.2
,4.3,4.4),Chapter 7 (section (7.2,7.3.1,7.4,7.6 to 7.11), Chapter 8 (section (8.1,8.5), Chapter 9 RBT: L1, L2 
08  
Module 2  
Karnaugh maps: minimum forms of switching functions, two and three variable Karnaugh maps, four variable karnaugh maps, determination of minimum expressions using essential prime implicants, QuineMcClusky Method: determination of prime implicants, The prime implicant chart, petricks method, simplification of incompletely specified functions, simplification using mapentered variablesText book 1:Part B: Chapter 5 ( Sections 5.1 to 5.4) Chapter 6(Sections 6.1 to 6.5)
RBT: L1, L2 
08  
Module 3  
Combinational circuit design and simulation using gates: Review of Combinational circuit design, design of circuits with limited Gate Fanin ,Gate delays and Timing diagrams, Hazards in combinational Logic, simulation and testing of logic circuitsMultiplexers, Decoders and Programmable Logic Devices: Multiplexers, three state buffers, decoders and encoders, Programmable Logic devices, Programmable Logic Arrays, Programmable Array Logic.
Text book 1:Part B: Chapter 8,Chapter 9 (Sections 9.1 to 9.6) RBT: L1, L2 
08  
Module 4  
Introduction to VHDL: VHDL description of combinational circuits, VHDL Models for  08 
multiplexers, VHDL Modules.Latches and FlipFlops: Set Reset Latch, Gated Latches, EdgeTriggered D Flip Flop 3,SR Flip Flop, J K Flip Flop, T Flip Flop, Flip Flop with additional inputs, Asynchronous Sequential Circuits
Text book 1:Part B: Chapter 10(Sections 10.1 to 10.3),Chapter 11 (Sections 11.1 to 11.9) RBT: L1, L2 

Module 5  
Registers and Counters: Registers and Register Transfers, Parallel Adder with accumulator, shift registers, design of Binary counters, counters for other sequences, counter design using SR and J K Flip Flops, sequential parity checker, state tables and graphsText book 1:Part B: Chapter 12(Sections 12.1 to 12.5),Chapter 13(Sections 13.1,13.3 RBT: L1, L2  08 
Course Outcomes: The student will be able to :  
· Design and analyze application of analog circuits using photo devices, timer IC, power supply and regulator IC and opamp.· Explain the basic principles of A/D and D/A conversion circuits and develop the same.
· Simplify digital circuits using Karnaugh Map , and QuineMcClusky Methods · Explain Gates and flip flops and make us in designing different data processing circuits, registers and counters and compare the types. · Develop simple HDL programs 

Question Paper Pattern:  
· The question paper will have ten questions.· Each full Question consisting of 20 marks
· There will be 2 full questions (with a maximum of four sub questions) from each module. · Each full question will have sub questions covering all the topics under a module. · The students will have to answer 5 full questions, selecting one full question from each module. 

Textbooks:  
1. Charles H Roth and Larry L Kinney, Analog and Digital Electronics, Cengage Learning,2019  
Reference Books:  
1. Anil K Maini, Varsha Agarwal, Electronic Devices and Circuits, Wiley, 2012.2. Donald P Leach, Albert Paul Malvino & Goutam Saha, Digital Principles and Applications, 8^{th} Edition, Tata McGraw Hill, 2015.
3. M. Morris Mani, Digital Design, 4^{th} Edition, Pearson Prentice Hall, 2008. 4. David A. Bell, Electronic Devices and Circuits, 5^{th} Edition, Oxford University Press, 2008 
COMPUTER ORGANIZATION 

Course Code  18CS34  CIE Marks  40  
Number of Contact Hours/Week  3:0:0  SEE Marks  60  
Total Number of Contact Hours  40  Exam Hours  03  
CREDITS –3  
Course Learning Objectives: This course (18CS34) of VTU Syllabus Computer Science & Engineering 3rd Semester will enable students to:  
· Explain the basic sub systems of a computer, their organization, structure and operation.· Illustrate the concept of programs as sequences of machine instructions.
· Demonstrate different ways of communicating with I/O devices and standard I/O interfaces. · Describe memory hierarchy and concept of virtual memory. · Describe arithmetic and logical operations with integer and floatingpoint operands. · Illustrate organization of a simple processor, pipelined processor and other computing systems. 

Module 1  Contact Hours  
Basic Structure of Computers: Basic Operational Concepts, Bus Structures, Performance – Processor Clock, Basic Performance Equation, Clock Rate, Performance Measurement. Machine Instructions and Programs: Memory Location and Addresses, Memory Operations, Instructions and Instruction Sequencing, Addressing Modes, Assembly Language, Basic Input and Output Operations, Stacks and Queues, Subroutines, Additional Instructions, Encoding of Machine InstructionsText book 1: Chapter1 – 1.3, 1.4, 1.6 (1.6.11.6.4, 1.6.7), Chapter2 – 2.2 to 2.10 RBT: L1, L2, L3  08  
Module 2  
Input/Output Organization: Accessing I/O Devices, Interrupts – Interrupt Hardware, Direct Memory Access, Buses, Interface Circuits, Standard I/O Interfaces – PCI Bus, SCSI Bus, USB.Text book 1: Chapter4 – 4.1, 4.2, 4.4, 4.5, 4.6, 4.7 RBT: L1, L2, L3  08  
Module 3  
Memory System: Basic Concepts, Semiconductor RAM Memories, Read Only Memories, Speed, Size, and Cost, Cache Memories – Mapping Functions, Replacement Algorithms, Performance Considerations.Text book 1: Chapter5 – 5.1 to 5.4, 5.5 (5.5.1, 5.5.2), 5.6 RBT: L1, L2, L3  08  
Module 4  
Arithmetic: Numbers, Arithmetic Operations and Characters, Addition and Subtraction of Signed Numbers, Design of Fast Adders, Multiplication of Positive Numbers, Signed Operand Multiplication, Fast Multiplication, Integer Division.Text book 1: Chapter22.1, Chapter6 – 6.1 to 6.6 RBT: L1, L2, L3  08  
Module 5  
Basic Processing Unit: Some Fundamental Concepts, Execution of a Complete Instruction, Multiple Bus Organization, Hardwired Control, Micro programmed Control.Pipelining: Basic concepts of pipelining,
Text book 1: Chapter7, Chapter8 – 8.1 RBT: L1, L2, L3 
08  
Course Outcomes: The student will be able to :  
· Explain the basic organization of a computer system. 
· Demonstrate functioning of different sub systems, such as processor, Input/output,and memory.· Illustrate hardwired control and micro programmed control, pipelining, embedded and other computing systems.
· Design and analyse simple arithmetic and logical units. 
Question Paper Pattern: 
· The question paper will have ten questions.· Each full Question consisting of 20 marks
· There will be 2 full questions (with a maximum of four sub questions) from each module. · Each full question will have sub questions covering all the topics under a module. · The students will have to answer 5 full questions, selecting one full question from each module. 
Textbooks: 
1. Carl Hamacher, Zvonko Vranesic, Safwat Zaky, Computer Organization, 5th Edition, TataMcGraw Hill, 2002. (Listed topics only from Chapters 1, 2, 4, 5, 6, 7, 8, 9 and12) 
Reference Books: 
1. William Stallings: Computer Organization & Architecture, 9^{th} Edition, Pearson, 2015. 
SOFTWARE ENGINEERING 

Course Code  18CS35  CIE Marks  40  
Number of Contact Hours/Week  3:0:0  SEE Marks  60  
Total Number of Contact Hours  40  Exam Hours  03  
CREDITS –3  
Course Learning Objectives: This course (18CS35) of VTU Syllabus Computer Science & Engineering 3rd Semester will enable students to:  
· Outline software engineering principles and activities involved in building large software programs.Identify ethical and professional issues and explain why they are of concern to software engineers.· Explain the fundamentals of object oriented concepts
· Describe the process of requirements gathering, requirements classification, requirements specification and requirements validation. Differentiate system models, use UML diagrams and apply design patterns. · Discuss the distinctions between validation testing and defect testing. · Recognize the importance of software maintenance and describe the intricacies involved in software evolution.Apply estimation techniques, schedule project activities and compute pricing. · Identify software quality parameters and quantify software using measurements and metrics. List software quality standards and outline the practices involved. 

Module 1  Contact Hours  
Introduction: Software Crisis, Need for Software Engineering. Professional Software Development, Software Engineering Ethics. Case Studies.Software Processes: Models: Waterfall Model (Sec 2.1.1), Incremental Model (Sec 2.1.2)
and Spiral Model (Sec 2.1.3). Process activities. Requirements Engineering: Requirements Engineering Processes (Chap 4). Requirements Elicitation and Analysis (Sec 4.5). Functional and nonfunctional requirements (Sec 4.1). The software Requirements Document (Sec 4.2). Requirements Specification (Sec 4.3). Requirements validation (Sec 4.6). Requirements Management (Sec 4.7). RBT: L1, L2, L3 
08  
Module 2  
What is Object orientation? What is OO development? OO Themes; Evidence for usefulness of OO development; OO modelling history. Modelling as Design technique: Modelling; abstraction; The Three models. Introduction, Modelling Concepts and Class Modelling: What is Object orientation? What is OO development? OO Themes; Evidence for usefulness of OO development; OO modelling history. Modelling as Design technique: Modelling; abstraction; The Three models. Class Modelling: Object and Class Concept; Link and associations concepts; Generalization and Inheritance; A sample class model; Navigation of class models;Textbook 2: Ch 1,2,3. RBT: L1, L2 L3  08  
Module 3  
System Models: Context models (Sec 5.1). Interaction models (Sec 5.2). Structural models(Sec 5.3). Behavioral models (Sec 5.4). Modeldriven engineering (Sec 5.5).
Design and Implementation: Introduction to RUP (Sec 2.4), Design Principles (Chap 7). Objectoriented design using the UML (Sec 7.1). Design patterns (Sec 7.2). Implementation issues (Sec 7.3). Open source development (Sec 7.4). RBT: L1, L2, L3 
08 
Module 4  
Software Testing: Development testing (Sec 8.1), Testdriven development (Sec 8.2), Release testing (Sec 8.3), User testing (Sec 8.4). Test Automation (Page no 212).Software Evolution: Evolution processes (Sec 9.1). Program evolution dynamics (Sec 9.2). Software maintenance (Sec 9.3). Legacy system management (Sec 9.4).
RBT: L1, L2, L3 
08 
Module 5  
Project Planning: Software pricing (Sec 23.1). Plandriven development (Sec 23.2). Project scheduling (Sec 23.3): Estimation techniques (Sec 23.5). Quality management: Software quality (Sec 24.1). Reviews and inspections (Sec 24.3). Software measurement and metrics (Sec 24.4). Software standards (Sec 24.2)RBT: L1, L2, L3  08 
Course Outcomes: The student will be able to :  
· Design a software system, component, or process to meet desired needs within realistic constraints.· Assess professional and ethical responsibility
· Function on multidisciplinary teams · Use the techniques, skills, and modern engineering tools necessary for engineering practice · Analyze, design, implement, verify, validate, implement, apply, and maintain software systems or parts of software systems 

Question Paper Pattern:  
· The question paper will have ten questions.· Each full Question consisting of 20 marks
· There will be 2 full questions (with a maximum of four sub questions) from each module. · Each full question will have sub questions covering all the topics under a module. · The students will have to answer 5 full questions, selecting one full question from each module. 

Textbooks:  
1. Ian Sommerville: Software Engineering, 9th Edition, Pearson Education, 2012. (Listed topics only from Chapters 1,2,3,4, 5, 7, 8, 9, 23, and 24)2. Michael Blaha, James Rumbaugh: Object Oriented Modelling and Design with UML,2^{nd} Edition,
Pearson Education,2005. 

Reference Books:  
1. Roger S. Pressman: Software EngineeringA Practitioners approach, 7th Edition, Tata McGraw Hill.2. Pankaj Jalote: An Integrated Approach to Software Engineering, Wiley India 
DISCRETE MATHEMATICAL STRUCTURES 

Course Code  18CS36  CIE Marks  40  
Number of Contact Hours/Week  3:0:0  SEE Marks  60  
Total Number of Contact Hours  40  Exam Hours  03  
CREDITS –3  
Course Learning Objectives: This course (18CS36) will enable students to:  
· Provide theoretical foundations of computer science to perceive other courses in the programme.· Illustrate applications of discrete structures: logic, relations, functions, set theory and counting.
· Describe different mathematical proof techniques, · Illustrate the importance of graph theory in computer science 

Module 1  Contact Hours  
Fundamentals of Logic: Basic Connectives and Truth Tables, Logic Equivalence – The Laws of Logic, Logical Implication – Rules of Inference. Fundamentals of Logic contd.: The Use of Quantifiers, Quantifiers, Definitions and the Proofs of Theorems.Text book 1: Chapter2 RBT: L1, L2, L3  08  
Module 2  
Properties of the Integers: The Well Ordering Principle – Mathematical Induction, Fundamental Principles of Counting: The Rules of Sum and Product, Permutations, Combinations – The Binomial Theorem, Combinations with Repetition.Text book 1: Chapter4 – 4.1, Chapter1 RBT: L1, L2, L3  08  
Module 3  
Relations and Functions: Cartesian Products and Relations, Functions – Plain and Oneto One, Onto Functions. The Pigeonhole Principle, Function Composition and Inverse Functions.Relations: Properties of Relations, Computer Recognition – ZeroOne Matrices and Directed Graphs, Partial Orders – Hasse Diagrams, Equivalence Relations and Partitions.
Text book 1: Chapter5 , Chapter7 – 7.1 to 7.4 RBT: L1, L2, L3 
08  
Module 4  
The Principle of Inclusion and Exclusion: The Principle of Inclusion and Exclusion, Generalizations of the Principle, Derangements – Nothing is in its Right Place, Rook Polynomials.Recurrence Relations: First Order Linear Recurrence Relation, The Second Order Linear Homogeneous Recurrence Relation with Constant Coefficients.
Text book 1: Chapter8 – 8.1 to 8.4, Chapter10 – 10.1, 10.2 RBT: L1, L2, L3 
08  
Module 5  
Introduction to Graph Theory: Definitions and Examples, Sub graphs, Complements, and Graph Isomorphism,Trees: Definitions, Properties, and Examples, Routed Trees, Trees and Sorting, Weighted Trees and Prefix Codes
Text book 1: Chapter11 – 11.1 to 11.2 Chapter12 – 12.1 to 12.4 RBT: L1, L2, L3 
08  
Course Outcomes: The student will be able to :  
· Use propositional and predicate logic in knowledge representation and truth verification. 
· Demonstrate the application of discrete structures in different fields of computer science.· Solve problems using recurrence relations and generating functions.
· Application of different mathematical proofs techniques in proving theorems in the courses. · Compare graphs, trees and their applications. 
Question Paper Pattern: 
· The question paper will have ten questions.· Each full Question consisting of 20 marks
· There will be 2 full questions (with a maximum of four sub questions) from each module. · Each full question will have sub questions covering all the topics under a module. · The students will have to answer 5 full questions, selecting one full question from each module. 
Textbooks: 
1. Ralph P. Grimaldi: Discrete and Combinatorial Mathematics, 5th Edition, Pearson Education. 2004. 
Reference Books: 
1. Basavaraj S Anami and Venakanna S Madalli: Discrete Mathematics – A Concept based approach, Universities Press, 20162. Kenneth H. Rosen: Discrete Mathematics and its Applications, 6th Edition, McGraw Hill, 2007.
3. Jayant Ganguly: A Treatise on Discrete Mathematical Structures, SanguinePearson, 2010. 4. D.S. Malik and M.K. Sen: Discrete Mathematical Structures: Theory and Applications, Thomson, 2004. 5. Thomas Koshy: Discrete Mathematics with Applications, Elsevier, 2005, Reprint 2008. 
ANALOG AND DIGITAL ELECTRONICS LABORATORY 

Course Code  18CSL37  CIE Marks  40  
Number of Contact Hours/Week  0:2:2  SEE Marks  60  
Total Number of Lab Contact Hours  36  Exam Hours  03  
Credits – 2  
Course Learning Objectives: This course (18CSL37) will enable students to:  
This laboratory course enable students to get practical experience in design, assembly and evaluation/testing of· Analog components and circuits including Operational Amplifier, Timer, etc.
· Combinational logic circuits. · Flip – Flops and their operations · Counters and registers using flipflops. · Synchronous and Asynchronous sequential circuits. · A/D and D/A converters 

Descriptions (if any):  
· Simulation packages preferred: Multisim, Modelsim, PSpice or any other relevant.· For Part A (Analog Electronic Circuits) students must trace the wave form on Tracing sheet / Graph sheet and label trace.
· Continuous evaluation by the faculty must be carried by including performance of a student in both hardware implementation and simulation (if any) for the given circuit. · A batch not exceeding 4 must be formed for conducting the experiment. For simulation individual student must execute the program. 

Laboratory Programs:  
PART A (Analog Electronic Circuits)  
1.  Design an astable multivibrator ciruit for three cases of duty cycle (50%, <50% and >50%)using NE 555 timer IC. Simulate the same for any one duty cycle.  
2.  Using ua 741 Opamp, design a 1 kHz Relaxation Oscillator with 50% duty cycle. Andsimulate the same.  
3.  Using ua 741 opamap, design a window comparate for any given UTP and LTP. Andsimulate the same.  
PART B (Digital Electronic Circuits)  
4.  Design and implement Half adder, Full Adder, Half Subtractor, Full Subtractor using basicgates. And implement the same in HDL.  
5.  Given a 4variable logic expression, simplify it using appropriate technique and realize thesimplified logic expression using 8:1 multiplexer IC. And implement the same in HDL.  
6.  Realize a JK Master / Slave FlipFlop using NAND gates and verify its truth table. Andimplement the same in HDL.  
7.  Design and implement code converter I)Binary to Gray (II) Gray to Binary Code using basicgates.  
8.  Design and implement a modn (n<8) synchronous up counter using JK FlipFlop ICs anddemonstrate its working.  
9.  Design and implement an asynchronous counter using decade counter IC to count up from 0to n (n<=9) and demonstrate on 7segment display (using IC7447)  
Laboratory Outcomes: The student should be able to:  
· Use appropriate design equations / methods to design the given circuit.· Examine and verify the design of both analog and digital circuits using simulators.
· Make us of electronic components, ICs, instruments and tools for design and testing of circuits 
for the given the appropriate inputs.· Compile a laboratory journal which includes; aim, tool/instruments/software/components used,
design equations used and designs, schematics, program listing, procedure followed, relevant theory, results as graphs and tables, interpreting and concluding the findings. 
Conduct of Practical Examination: 
· Experiment distributiono For laboratories having only one part: Students are allowed to pick one experiment from the lot with equal opportunity.
o For laboratories having PART A and PART B: Students are allowed to pick one experiment from PART A and one experiment from PART B, with equal opportunity. · Change of experiment is allowed only once and marks allotted for procedure to be made zero of the changed part only. · Marks Distribution (Courseed to change in accoradance with university regulations) a) For laboratories having only one part – Procedure + Execution + VivaVoce: 15+70+15 = 100 Marks b) For laboratories having PART A and PART B i. Part A – Procedure + Execution + Viva = 6 + 28 + 6 = 40 Marks ii. Part B – Procedure + Execution + Viva = 9 + 42 + 9 = 60 Marks 
DATA STRUCTURES LABORATORY 

Course Code  18CSL38  CIE Marks  40  
Number of Contact Hours/Week  0:2:2  SEE Marks  60  
Total Number of Lab Contact Hours  36  Exam Hours  03  
Credits – 2  
Course Learning Objectives: This course (18CSL38) will enable students to:  
This laboratory course enable students to get practical experience in design, develop, implement, analyze and evaluation/testing of· Asymptotic performance of algorithms.
· Linear data structures and their applications such as stacks, queues and lists · NonLinear data structures and their applications such as trees and graphs · Sorting and searching algorithms 

Descriptions (if any):  
· Implement all the programs in ‘C / C++’ Programming Language and Linux / Windows as OS.  
Programs List:  
1.  Design, Develop and Implement a menu driven Program in C for the following array operations.a. Creating an array of N Integer Elements
b. Display of array Elements with Suitable Headings c. Inserting an Element (ELEM) at a given valid Position (POS) d. Deleting an Element at a given valid Position (POS) e. Exit. Support the program with functions for each of the above operations. 

2.  Design, Develop and Implement a Program in C for the following operations on Strings.a. Read a main String (STR), a Pattern String (PAT) and a Replace String (REP)
b. Perform Pattern Matching Operation: Find and Replace all occurrences of PAT in STR with REP if PAT exists in STR. Report suitable messages in case PAT does not exist in STR Support the program with functions for each of the above operations. Don’t use Builtin functions. 

3.  Design, Develop and Implement a menu driven Program in C for the following operations on STACK of Integers (Array Implementation of Stack with maximum size MAX)a. Push an Element on to Stack
b. Pop an Element from Stack c. Demonstrate how Stack can be used to check Palindrome d. Demonstrate Overflow and Underflow situations on Stack e. Display the status of Stack f. Exit Support the program with appropriate functions for each of the above operations 

4.  Design, Develop and Implement a Program in C for converting an Infix Expression to Postfix Expression. Program should support for both parenthesized and free parenthesized expressions with the operators: +, , *, /, % (Remainder), ^ (Power) and alphanumericoperands.  
5.  Design, Develop and Implement a Program in C for the following Stack Applicationsa. Evaluation of Suffix expression with single digit operands and operators: +, , *, /, %,
^ b. Solving Tower of Hanoi problem with n disks 
6.  Design, Develop and Implement a menu driven Program in C for the following operations on Circular QUEUE of Characters (Array Implementation of Queue with maximum size MAX)a. Insert an Element on to Circular QUEUE
b. Delete an Element from Circular QUEUE c. Demonstrate Overflow and Underflow situations on Circular QUEUE d. Display the status of Circular QUEUE e. Exit Support the program with appropriate functions for each of the above operations 
7.  Design, Develop and Implement a menu driven Program in C for the following operations on Singly Linked List (SLL) of Student Data with the fields: USN, Name, Programme, Sem,PhNo
a. Create a SLL of N Students Data by using front insertion. b. Display the status of SLL and count the number of nodes in it c. Perform Insertion / Deletion at End of SLL d. Perform Insertion / Deletion at Front of SLL(Demonstration of stack) e. Exit 
8.  Design, Develop and Implement a menu driven Program in C for the following operations on Doubly Linked List (DLL) of Employee Data with the fields: SSN, Name, Dept, Designation,Sal, PhNo
a. Create a DLL of N Employees Data by using end insertion. b. Display the status of DLL and count the number of nodes in it c. Perform Insertion and Deletion at End of DLL d. Perform Insertion and Deletion at Front of DLL e. Demonstrate how this DLL can be used as Double Ended Queue. f. Exit 
9.  Design, Develop and Implement a Program in C for the following operationson Singly Circular Linked List (SCLL) with header nodesa. Represent and Evaluate a Polynomial P(x,y,z) = 6x^{2}y^{2}z4yz^{5}+3x^{3}yz+2xy^{5}z2xyz^{3}
b. Find the sum of two polynomials POLY1(x,y,z) and POLY2(x,y,z) and store the result in POLYSUM(x,y,z) Support the program with appropriate functions for each of the above operations 
10.  Design, Develop and Implement a menu driven Program in C for the following operations on Binary Search Tree (BST) of Integers .a. Create a BST of N Integers: 6, 9, 5, 2, 8, 15, 24, 14, 7, 8, 5, 2
b. Traverse the BST in Inorder, Preorder and Post Order c. Search the BST for a given element (KEY) and report the appropriate message d. Exit 
11.  Design, Develop and Implement a Program in C for the following operations on Graph(G) of Citiesa. Create a Graph of N cities using Adjacency Matrix.
b. Print all the nodes reachable from a given starting node in a digraph using DFS/BFS method 
12.  Given a File of N employee records with a set K of Keys (4digit) which uniquely determine the records in file F. Assume that file F is maintained in memory by a Hash Table (HT) of m memory locations with L as the set of memory addresses (2digit) of locations in HT. Let the keys in K and addresses in L are Integers. Design and develop a Program in C that uses Hash function H: K ®L as H(K)=K mod m (remainder method), and implement hashingtechnique to map a given key K to the address space L. Resolve the collision (if any) using linear probing. 
Laboratory Outcomes: The student should be able to: 
· Analyze and Compare various linear and nonlinear data structures· Code, debug and demonstrate the working nature of different types of data structures and their applications
· Implement, analyze and evaluate the searching and sorting algorithms · Choose the appropriate data structure for solving real world problems 
Conduct of Practical Examination: 
· Experiment distributiono For laboratories having only one part: Students are allowed to pick one experiment from the lot with equal opportunity.
o For laboratories having PART A and PART B: Students are allowed to pick one experiment from PART A and one experiment from PART B, with equal opportunity. · Change of experiment is allowed only once and marks allotted for procedure to be made zero of the changed part only. · Marks Distribution (Courseed to change in accoradance with university regulations) c) For laboratories having only one part – Procedure + Execution + VivaVoce: 15+70+15 = 100 Marks d) For laboratories having PART A and PART B i. Part A – Procedure + Execution + Viva = 6 + 28 + 6 = 40 Marks ii. Part B – Procedure + Execution + Viva = 9 + 42 + 9 = 60 Marks 
CONSTITUTION OF INDIA, PROFESSIONAL ETHICS AND CYBER LAW (CPC) 

Course Code  18CPC39/49  CIE Marks  40 
Teaching Hours/Week (L:T:P)  (1:0:0)  SEE Marks  60 
Credits  01  Exam Hours  02 
Course Learning Objectives: To· know the fundamental political codes, structure, procedures, powers, and duties of Indian government institutions, fundamental rights, directive principles, and the duties of citizens
· Understand engineering ethics and their responsibilities; identify their individual roles and ethical responsibilities towards society. · Know about the cybercrimes and cyber laws for cyber safety measures. 

Module1  
Introduction to Indian Constitution:The Necessity of the Constitution, The Societies before and after the Constitution adoption. Introduction to the Indian constitution, The Making of the Constitution, The Role of the Constituent Assembly – Preamble and Salient features of the Constitution of India. Fundamental Rights and its Restriction and limitations in different Complex Situations. Directive Principles of State Policy (DPSP) and its present relevance in our
society with examples. Fundamental Duties and its Scope and significance in Nation building. 

Module2  
Union Executive and State Executive:Parliamentary System, Federal System, CentreState Relations. Union Executive – President, Prime Minister, Union Cabinet, Parliament – LS and RS, Parliamentary Committees, Important Parliamentary Terminologies. Supreme Court of India, Judicial Reviews and Judicial Activism. State Executives – Governor, Chief Minister, State Cabinet, State Legislature, High Court and Subordinate Courts, Special Provisions (Articles
370.371,371J) for some States. 

Module3  
Elections, Amendments and Emergency Provisions:Elections, Electoral Process, and Election Commission of India, Election Laws. Amendments – Methods in Constitutional Amendments (How and Why) and Important Constitutional Amendments. Amendments – 7,9,10,12,42,44, 61, 73,74, ,75, 86, and 91,94,95,100,101,118 and some important Case Studies. Emergency Provisions, types of Emergencies and its consequences.
Constitutional special provisions: Special Provisions for SC and ST, OBC, Women, Children and Backward Classes. 

Module4  
Professional / Engineering Ethics:Scope & Aims of Engineering & Professional Ethics – Business Ethics, Corporate Ethics, Personal Ethics. Engineering and Professionalism, Positive and Negative Faces of Engineering Ethics, Code of Ethics as defined in the website of Institution of Engineers (India): Profession, Professionalism, and Professional Responsibility. Clash of Ethics, Conflicts of Interest. Responsibilities in Engineering Responsibilities in Engineering and Engineering Standards, the impediments to Responsibility. Trust and Reliability in
Engineering, IPRs (Intellectual Property Rights), Risks, Safety and liability in Engineering 

Module5  
Internet Laws, Cyber Crimes and Cyber Laws:Internet and Need for Cyber Laws, Modes of Regulation of Internet, Types of cyber terror capability, Net
neutrality, Types of Cyber Crimes, India and cyber law, Cyber Crimes and the information Technology Act 2000, Internet Censorship. Cybercrimes and enforcement agencies. 
Course Outcomes: On completion of this course, students will be able to, CO 1: Have constitutional knowledge and legal literacy.CO 2: Understand Engineering and Professional ethics and responsibilities of Engineers.
CO 3: Understand the the cybercrimes and cyber laws for cyber safety measures. 

Question paper pattern for SEE and CIE:· The SEE question paper will be set for 100 marks and the marks scored by the students will proportionately be reduced to 60. The pattern of the question paper will be objective type (MCQ).
· For the award of 40 CIE marks, refer the University regulations 2018. 

Sl.No.  Title of the Book  Name of the Author/s  Name of the Publisher  Edition and Year 
Textbook/s  
1  Constitution of India, Professional Ethics and Human Rights  Shubham Singles, Charles E. Haries, and et al  Cengage Learning India  2018 
2  Cyber Security and Cyber Laws  Alfred Basta and et al  Cengage Learning India  2018 
Reference Books  
3  Introduction to theConstitution of India  Durga Das Basu  Prentice –Hall,  2008. 
4  Engineering Ethics  M. Govindarajan, S.Natarajan, V. S. Senthilkumar  Prentice –Hall,  2004 
ADDITIONAL MATHEMATICS – I 

Course Code  18MATDIP31  CIE Marks  40 
Teaching Hours/Week (L:T:P)  (2:2:0)  SEE Marks  60 
Credits  0  Exam Hours  03 
Course Learning Objectives:· To provide basic concepts of complex trigonometry, vector algebra, differential and integral calculus.
· To provide an insight into vector differentiation and first order ODE’s. 

Module1  
Complex Trigonometry: Complex Numbers: Definitions and properties. Modulus and amplitude of a complex number, Argand’s diagram, DeMoivre’s theorem (without proof).Vector Algebra: Scalar and vectors. Addition and subtraction and multiplication of vectors Dot and Cross products, problems.  
Module2  
Differential Calculus: Review of successive differentiationillustrative examples. Maclaurin’s series expansionsIllustrative examples. Partial Differentiation: Euler’s theoremproblems on first order derivatives only. Total derivativesdifferentiation of composite functions. Jacobians of order twoProblems.  
Module3  
Vector Differentiation: Differentiation of vector functions. Velocity and acceleration of a particle moving on a space curve. Scalar and vector point functions. Gradient, Divergence, Curlsimple problems. Solenoidal and irrotational vector fieldsProblems.  
Module4  
Integral Calculus: Review of elementary integral calculus. Reduction formulae for sin^{n}x, cos^{n}x (with proof)and sin^{m}xcos^{n}x (without proof) and evaluation of these with standard limitsExamples. Double and triple integralsSimple examples.  
Module5  
Ordinary differential equations (ODE’s. Introductionsolutions of first order and firstdegree differential equations: exact, linear differential equations. Equations reducible to exact and Bernoulli’s equation.  
Course Outcomes: At the end of the course the student will be able to:· CO1: Apply concepts of complex numbers and vector algebra to analyze the problems arising in related area.
· CO2: Use derivatives and partial derivatives to calculate rate of change of multivariate functions. · CO3: Analyze position, velocity and acceleration in two and three dimensions of vector valued functions. · CO4: Learn techniques of integration including the evaluation of double and triple integrals. · CO5: Identify and solve first order ordinary differential equations. 

Question paper pattern:· The question paper will have ten full questions carrying equal marks.
· Each full question will be for 20 marks. · There will be two full questions (with a maximum of four sub questions) from each module. · Each full question will have sub question covering all the topics under a module. · The students will have to answer five full questions, selecting one full question from each module. 
Sl No  Title of the Book  Name of the Author/s  Name of the Publisher  Edition and Year 
Textbook  
1  Higher Engineering Mathematics  B. S. Grewal  Khanna Publishers  43^{rd} Edition, 2015 
Reference Books  
1  Advanced Engineering Mathematics  E. Kreyszig  John Wiley & Sons  10^{th} Edition, 2015 
2  Engineering Mathematics  N. P .Bali andManish Goyal  Laxmi Publishers  7th Edition, 2007 
3  Engineering Mathematics Vol. I  Rohit Khurana  Cengage Learning  1^{st} Edition, 2015 
 Download VTU Computer Science & Engineering 3rd Semester Syllabus PDF
 Download VTU Computer Science & Engineering 3rd Semester Scheme PDF
We have covered the complete guide on VTU Syllabus Computer Science & Engineering 3rd Semester 2020. feel free to ask us any questions in the comment section below