Scheme & Syllabus III & IV Semester B.E Computer Science and Engineering (2012 Scheme)

Rashtreeya Sikshana Samithi Trust
R. V. COLLEGE OF ENGINEERING
(Autonomous Institution Affiliated to VTU, Belgaum)
R.V Vidyaniketan Post, Mysore Road
Bangalore-560 059
Scheme & Syllabus

III & IV Semester B.E
Computer Science and Engineering
(2012 Scheme)
Department of Computer Science and Engineering
R V College of Engineering, Bangalore
Vision and Mission of the Department of Computer Science and Engineering:

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.
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 with ethical and societal values.
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 takeup higher education in pursuit of lifelong
learning.
Program Outcomes:
PO1
Graduates will be able to apply mathematical foundation, algorithmic principles

and computer science theory, in the modeling and design of computer based
PO2
system.
Graduates will display the proficiency of analyzing and designing using various
computer programming languages and knowledge to various technologies in
PO3
computer system
Graduates will demonstrate ability to use techniques, skills to investigate complex
problems through research and effectively utilize appropriate modern engineering
PO4
tools to solve it.

Graduates will acquire ability to use sustainable, inclusive technology for societal
PO5
and environmental contexts.

Graduates will be able to communicate effectively and develop confidence in self
PO6
and life-long learning.

Graduates will possess leadership, project management and financial skills with
professional ethics.
THIRD SEMESTER :CSE

Sl.
No.
Course
Code
1.
12MA31
12EM32/4
2
12ISE/
CSE33
12EE/CS/I
S/IT/TE
34
Credit Allocation
Course
Applied Mathematics-III
Engineering Material
Science
Data Structures in
C(Theory & Practice)
Digital Logic Design
using HDL(Theory &
Practice)
Computer Organization
12CS35
& Architecture
12CS/
Discrete Mathematical
IS36
Structures
Bridge Course
12DMA37
Mathematics-I**
2.
3.
4.
5.
6.
7.
BoS
Practical
Tutorial
Science
Self
Study
0
ME
18
04
06
16
27
44
ISE
Course
Code
1.
12MA41
2.
12EB32/42
12IS/
CS43
CSE
CSE
3.
4
12CS44
12CS/IS45
12CS46
7
8
12HSS47
12DMA48
Credit Allocation
Course
BoS
Applied Mathematics IV
Environmental Science
& Biology for Engineers
Theory of Computation
Operating Systems
(Theory & Practice)
Design & Analysis of
Algorithms(Theory &
Practice)
Object Oriented
Programming with C++
(Theory & Practice)
Innovation and Social
skills
Bridge Course
Mathematics-II**
No. of Hrs.
EEE
No. of Hrs.
FOURTH SEMESTER :CSE
Sl. No.
Total
Credits
Theory
Total
Credits
Theory
Practical
Tutorial
Science
Self
Study
0
Science
16
27
44
ISE
CSE
CSE
CSE
HSS
18
08
02
Semester: III
APPLIED MATHEMATICS III
Course Code: 12MA31
Hrs/Week: L:T:P:S : 3:2: 0:0
Credits: 04
ALL BRANCHES
CIE Marks: 100

SEE Marks: 100
SEE : 3 Hrs
Course Learning Objectives:
The student should be able to analyze periodic phenomena using concept of Fourier
series.
Understand the basics of matrix theory and its applications for finding solution of
system of linear equations.
Finding the approximate solutions using numerical methods, for problems which do
not have analytical solutions.
Approximating functional values with different curves.
Optimizing real functional with various applications.
Unit I
08 Hrs
Fourier series and Fourier Transforms

Introduction, periodic functions, Even and odd functions, properties. Special
waveforms - Square wave, half wave rectifier, saw-tooth wave and triangular wave.
Eulers formula for Fourier series, Fourier series for functions of period 2L
(particular cases), Dirichlets conditions - problems. Half Range Fourier seriesConstruction of Half range cosine and sine series, Complex form of Fourier series
problems. Complex Fourier Transforms Properties & simple problems.
Unit II
07 Hrs
Matrices and Linear Equations

Elementary transformation, rank of matrix by using Echelon form, consistency of
system of linear equations and solutions, solution of system of linear equations
using Gauss elimination method, Gauss Jordan method, Gauss Seidel method,
Eigenvalues and Eigenvectors, finding largest eigenvalue by using Power method.
Unit III
07 Hrs
Curve Fitting
Method of Least squares - fitting of the curves of the form y = ax + b, y = ae bx, y =
axb and y = ax2 + bx + c, Correlation and Regression analysis.
Finite differences-forward and backward differences, Interpolation-Newtons
forward and backward interpolation formulae, Lagranges interpolation formula.
Unit IV
Numerical methods for Ordinary differential equations.

Numerical integration Simpsons rules, Weddles rule and Gaussian quadrature
(two point & three point formula). Numerical methods for first order ODE Single
step & Multistep methods-Taylors series method, Runge-Kutta fourth order
method, Adam-Bash forths method, BVP for ODE Shooting methods for second
order ODE (All methods without proof).
07 Hrs
Unit V
07 Hrs
Calculus of Variation
Introduction, Variation of functions and functional, extremal of a functional,
variational problem, Eulers equation and special cases. Examples - Geodesics,
Hanging cable, and Brachistochrome problem.
Course outcomes:
At the end of this course the student will be able to :
1. Apply knowledge of linear algebra for finding the solution of system of linear
equations.
2. Analyze and interpret physical phenomena which are periodic in nature by
applying Fourier series.
3. Solve Algebraic and transcendental equations using effective numerical
methods.
Reference Books
1.
B.S. Grewal - Higher Engineering Mathematics, Khanna Publishers, 40th Edition,
2007, ISBN: 81-7409-195-5, Chapters 2, 10, 24, 28, 29, 31, 34.
2.
N.P Bali & Manish Goyal - A Text Book of Engineering Mathematics, Lakshmi
Publications, 7th edition, 2010, ISBN: 978-81-7008-992-6, Chapters: 3(3.343.40,3.46, 3.47), 10 (10.1-10.7-10.10), 2 (2.24 -2.26).
3.
Erwin Kreyszig - Advanced Engineering Mathematics, John Wiley & Sons, 9 th
Edition, 2007, ISBN: 978-81-265-3135-6, Chapters: 6, 7.1, 7.2,10(10.1-10.5,10.910.11),17, 18,19.
4.
Murray R Spiegel - Theory & problems of Fourier Analysis with applications to
Boundary Value problems, Schaums Outline Series.
Scheme of Continuous Internal Evaluation:
CIE consists of Three Tests each for 45 marks (15 marks for Quiz + 30 marks for descriptive)
out of which best of two will be considered. In addition there will be one seminar on new
topics / model presentation etc. for 10 marks.
Scheme of Semester End Examination:
The question paper consists of Part A and Part B. Part A will be for 20 marks covering the
complete syllabus and is compulsory. Part B will be for 80 marks and shall consist of five
questions (descriptive, analytical, problems or/and design) carrying 16 marks each. All five
from Part B will have internal choice and one of the two have to be answered compulsorily.
ENGINEERING MATERIALS (COMMON TO ALL BRANCHES)

Subject Code: 12 EM32/42
CIE: 100 marks
No. of Credits: 03
Duration: 3 hours
Course Learning Objectives
By the end of the course the student should be able to:
Compare materials based on their properties
Identify appropriate materials for specific engineering applications
Identify the phases and structure property relations in alloys based on the phase diagrams
Apply Define and differentiate thermodynamic work and heat.
Select materials and process parameters for Flexible Electronics Technology
Identify appropriate nanomaterials for engineering applications and their characterization
Identify materials and property requirements for advanced engineering applications
Unit I
6
hours
INTRODUCTION
Classification of Materials - Metals, Ceramics, Polymers, composites, Advanced Materialssemiconductors, biomaterials, smart materials, nanostructured materials and their applications
Material properties Mechanical properties, thermal properties Heat capacity, CTE,
thermal conductivity, Electrical and Electronic conductivity, Magnetic properties dia, para,
ferro, ferri, antiferro, domains and hysteresis. Optical properties -Luminescence and
photoconductivity.
Unit II
8
hours
Ferrous materials and Alloys - Binary phase diagrams, Phase Rule, Lever Rule,
Solidification, Nucleation and Grain Growth.
Cast Iron, Chromium steels, Nickel steels, Silicon Steels, Tungsten and Molybdenum Steels
& Stainless Steels; Tool Steels, structural steels, Corrosion and Heat Treatment
Non-ferrous materials and alloys Aluminum, Copper and Titanium, their alloys, properties
and applications.
Unit III
8
hours
Overview of Flexible Electronics Technology
History of Flexible Electronics, Materials for Flexible Electronics, Fabrication Technology
for Flexible Electronics Fabrication on Sheets by Batch Processing, Fabrication on Web by
Roll-to-Roll
Processing
Additive
Printing,
Low-temperature
Amorphous
and
Nanocrystalline Silicon Materials, Low-temperature Dielectrics, Low-temperature Thin-film

Transistor Devices
Ceramic Materials - Definition, Classification of Ceramic Materials, Processing Methods,
Properties and Industrial, Medical and Commercial Applications
Polymers Definition, Classification of Polymers, Properties and their applications,

intrinsically conductive materials
Unit IV
8 hours
COMPOSITES - Types of Matrix Materials and Reinforcements, Selection of Composites,
Properties, Applications, Rule of Mixture for density, elastic modulus and tensile strength.
Nanomaterials - Definition, classification and synthesis physical and chemical processes,
Characterization of nanomaterials Electron microscope, X-Ray Diffraction, particle size
analyzer
Unit V
6 hours
Advanced materials for - Construction Applications, Biomedical applications, High
temperature Applications, Sensors and Actuators - Shape Memory Alloys and Composites,
Thin films and coatings.
Reference Books
1. William D. Callister; Materials Science & Engineering- An Introduction; Wiley
India Pvt. Ltd.; 6th Edition; 2006; New Delhi; ISBN:9814-12-669-1; 1,4,6,7,8,9
2. Fred W. Billmeyer, Jr; Text Book Of Polymer Science; Wiley-Interscience
Publication; 2nd Edition; 1984; ISBN:0-471-82834-3; 8
3. Donald R. Askland, Pradeep P. Phule, Essentials of Materials Science and
Engineering, Thomas Canada Learning INDIA EDITION, ISBN:81-315-0233-3
4. William Smith, Foundation of Materials Science and Engineering, 3rd Edition,
McGraw Hill, 1997. ISBN:9780073529240
5. Flexible Electronics: Materials and Applications, William S. Wong and Alberto
Salleo, eds. ISBN 978-0-387-74362-2, 2009
Course Outcome:
After successful completion of the course the students will be able to:
1. Classify materials based on properties
2. Compute the properties of composites based on the properties of the constituents
3. Draw Binary phase diagrams and identify the phases
4. Identify characterization techniques for nanomaterials, thin films, flexible electronics,
biomedical applications, high temperature applications, sensors and actuators
R.V. COLLEGE OF ENGINEERING, BANGALORE 560059

DATA STRUCTURES WITH C

Theory and Practice
Course Code : 12IS/CS33
CIE Marks : 100 + 50
Hrs /Week : L: T: P: S 3:0:2:4
SEE Marks : 100 + 50
Credits
SEE Duration: 03+03 Hrs
: 05
Course Learning Objectives - CLO:

1. To 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 how data types such as stack, queue and linked list can be
implemented to manage the memory using static and dynamic allocations.
3. Understand and distinguish the conceptual and applicative differences in trees, binary
trees, and binary search trees. Implement binary tree traversals and operations on binary
search trees to design applications like expression trees. Understand Hashing and resolve
hash clashes
4. To create and use appropriate data structures in C programs for solving real life problems.
UNIT I
Introduction to Data Structure:
07 Hrs
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, Postfix expression evaluation
Recursion:
Introduction to Recursion, Factorial function, Binary search, Towers of Hanoi problem, Role
of the stack during execution.
UNIT II
Queue:
07 Hrs
Representation of queue, operations, circular queues, Implementation of Priority queues &

Binary Heap
Dynamic Memory allocation: malloc(), calloc(),free(), realloc()
UNIT III
Lists:
07 Hrs
Inserting and removing nodes from a list, linked implementation of Stacks, Queues. getnode
and freenode operations, Example of list operations, Array implementation, limitations of the
array implementation, Linked list using dynamic variables and its operations.
UNIT IV
Other list structures:
07 Hrs
Circular list, stack and queue as a circular list, primitive operations on circular list, addition
of long positive integers using circular list, Header nodes, Doubly linked list and its
operations.
UNIT V
Hashing:
08 Hrs
Resolving hash clashes by open addressing, deleting items from hash table, separate
chaining.
Trees:
Binary Search Tree (BST), Insertion and Deletion in BST, Expression trees, Infix, Postfix,
and Prefix Traversals, Splay tree, Tries.
Course outcome:
At the end of the course, the student will be able to
1. Understand the fundamental concepts of various data structures and hashing techniques.
2. Analyze and represent various data structures
3. Implement algorithms on different data structures such as Stack, Queue, List, Tree and
hashing.
4. Apply suitable data structure based on the need of the application.
Reference Books:
1. Yedidyah Langsam Moshe J. Augenstein and Aaron M. Tenenbaum; Data Structures
using C and C++, PHI/Pearson, 2nd Edition, 2009.
2. Computer Science A Structured Programming Approach Using C by Behrouz A.
Forouzan and Richard F. Gilberg, 3rd Edition, Thomson, 2009.
3. Data Structures and Program Design in C++, R.Kruse, C.L Tondo and B.Leung, 2 nd
Edition, Pearson Education, 2009.
4. Introduction to Data Structures in C, Ashok N Kamthane, Pearson Education, 1 st Edition,
2009.
Laboratory Component
PART A
1. Use Stack operations to do the following:

i) Assign to a variable name Y the value of the third element from the top of the stack and keep
the stack undisturbed.
ii) Given an arbitrary integer n pop out the top n elements. A message should be displayed if an
unusual condition is encountered.
iii) Assign to a variable name Y the value of the third element from the bottom of the stack and
keep the stack undisturbed.
(Hint: you may use a temporary stack)
2. Write a program to determine if an input character string is of the form XaY. X is a string of
arbitrary length using only the characters from A and B. For example, X may be ABBAB. Y is a
string which is the reverse of X. Thus for the string X given above, Y is BABBA. A is any
arbitrary character which is not A or B. Given ABAAcABAB the program should display a
message that this string is invalid. For the string ABBABCBABBA the program should write a
message that it is valid. Use appropriate data structure.
3. Write a C program that parses Infix arithmetic expressions to Postfix arithmetic expressions using
a Stack.
4. Write a C program to Build Binary Heap to simulate Priority queue.
5. Write a C program to simulate the working of Messaging System in which a message is placed in
a Queue by a Message Sender, a message is removed from the queue by a Message Receiver,
which can also display the contents of the Queue.
6. Write a C program to accept 2 singly linked lists & print the elements which are common in both
the lists.
7. Implement working of lift using appropriate data structure.
8. Consider a linked list with n integers. Each node of the list is numbered from 1 to n. Develop a
program using 'C' language to split this list into 4 lists so that:
a. First list contains nodes numbered 1,5,9,13,_,_,_
b. Second list contains nodes numbered 2,6,10,14,_,_
c. Third list contains nodes numbered 3,7,11,15,_,_
d. Fourth list contains nodes numbered 4,8,12,16,_
9. Implement a program to multiply two polynomials using circular linked list.
10. Design a doubly linked list to represent sparse matrix. Each node in the list can have the row and
column index of the matrix element and the value of the element.
11. Write a C program to implement Hashing using Open Addressing.
12. Write a C program to create Binary Tree and provide insertion and deletion operations and to
traverse the tree using In-order, Preorder and Post order (recursively)
13. 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.
14. Implement a simple Dictionary using Trees and Hashing.
Self-Learning (1 Credit 4 Hrs/Week):
Self-learning will be on emerging fields of the computing technology. It is an

extension of content of tutorial sessions. Students demonstrate realization of the real-life
applications achieved independently. This exercise is to assess understanding of the
fundamentals by student and their aptitude to apply the same to real world problems.
Scheme for Self Learning Evaluation:
The self-learning must be presented in front of evaluation committee; the members of
this committee will be Faculties handling the subject along with an observer appointed by
Head of the Department. Students are required to present their work either in form of
technical presentation or in form of live demonstration. At the end of the presentation the
students are required to submit the report as per the format recommended by the Dept. or
Dean Academics. The format of evaluation for 20 marks is completely under the prerogative
of the committee members or as suggested by HOD.
Scheme for Continuous Internal Evaluation (CIE):
out of which best two will be considered. In addition 20 marks has to be earned through selflearning component on emerging topics in computer architecture, computing infrastructure
and programming.
Each quiz Max marks
Each Internal Test Marks
Max Self Study marks
: 15
: 50 (Reduced to 25)
: 20
Scheme of Evaluation for Practicals (50)

The students have to execute all the programs listed, in the lab and a record duly signed by
the faculty should be maintained. Each program is evaluated independently for 10 marks.
Finally, total marks are reduced to 30. A lab test will be conducted at the end of the semester
for the remaining 20 marks, the questions for the lab test will programs from the given list
will be evaluated for 55% of the marks and 35% will be execution of program of the
facultys choice. The remaining 10% will be viva voce.
Final CIE = Internal Assessment + Self Study valuation + Practicals (CCE+Test)
= 40 x2 (Best Two Scores) + 20 (Self Study valuation) + 30 (CCE) + 20 (Test)
= 150
Scheme of Semester End Examination (150)
Scheme of Evaluation for Theory (100)
In the examination questions must be given from lots. The questions for the lab exam will
programs from the given list evaluated for 55% of the marks and 35% will be execution of
program of the examiners choice. The remaining 10% will be viva voce.
Minimum of 35% should be obtained in both theory & laboratory, with cumulative of marks
obtained in theory and laboratory should be minimum 40%.
Policy for Practical Examination/ Test:
Following things are prohibited during the course of the practical session or examination:
No External Devices like Laptop, Mobile, Pen drives, ipads etc.,

Internet must not be accessed during the sessions.
Semester III
DIGITAL LOGIC DESIGN

(Theory and Practice)
Sub Code: 12TE/EE/CSE/ISE/IT 34
Hrs / Week: L:P: T: S : 3:2:0: 4
CIE Marks
: 150
Total credits: 5
Course Learning Objectives (CLO):
To optimize logic expressions using
Karnaugh map and Tabular method
To simplify Boolean equation and
design combinational circuits with
optimal gates.
To Analyze the working principles
of
Flip-Flops
and
design
asynchronous sequential circuits
To design simple synchronous
digital circuits based on finite state
machine algorithm
To design, simulate and implement
digital systems using HDL
UNIT I
SEE Marks
SEE
: 150
: 3+3 Hrs
Simplification of Boolean Expressions:

Formulation of the Simplification Problem, Prime Implicants and Irredundant Disjunctive Expressions, Prime
Implicates and Irredundant Conjunctive 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, PrimeImplicant / Prime-Implicate Tables and Irredundant expressions, VEM Technique (up to 4 variables), Binary
Adders and Substractors, Decimal Adders.
UNIT II07 Hrs
Logic Design with MSI Components and Programmable Logic Devices (PLDs):
Comparators, Decoders, Encoders, Parity Generators and Parity Checking Circuits,
Multiplexers,
Programmable Logic Devices, Programmable Read-only memories, Programmable Logic Arrays,
Programmable Array Logic .
07 HrsUNIT 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, Counters, Design of
Synchronous and asynchronous Counters.
UNIT IV
08 Hrs
Synchronous Sequential Networks:
Structure and operation of Clocked synchronous Sequential Networks, Analysis of Clocked Synchronous
Sequential Networks, Modeling clocked synchronous sequential network behavior, State Table Deduction,
The State Assignment, Completing the design of clocked synchronous sequential networks
08 HrsUNIT V
Logic Families:
Working Principles of Transistor Transistor Logic (TTL), Emitter Coupled Logic (ECL), The MOS Field
Effect Transistor as Switch, NMOS and Design of Boolean Expressions using PMOS Logic, CMOS Logic,
Interface between logic families, Tri-state buffer, RAM and ROM memory, Static and dynamic hazards in
logic circuits.
06 Hrs
1.
2.
3.
4.
5.
6.
7.
8.
UNIT VI
PRACTICALS
PART A
Realization of Parallel adder / subtractor using IC 7483
Design and Realization of adder, subtractor using IC 74153 and binary to gray code conversion using IC
74139
Design and realization of One/Two bit comparators using basic gates. Realization of 4 bit comparators
using IC 7485.
Realization of decoder, encoders and priority encoders
Realization and verification of SR and JK flip-flops using universal gate. Realization of Master-Slave
flip-flop using IC7476.
Design of programmable counters using IC74192 & IC74193
Realization of ring counter and Johnson counter.
Design and verification of Parity generators and parity checkers.
PART B
The students are required to design any one digital system using the concepts learnt in PART A. The
designed circuit has to be realized using discrete hardware components and implement on FPGA using
HDL
1.
2.
3.
4.
5.
6.
Addition of two numbers whose sum is less than 9

Design a Stop Clock to display from 0 to 9 Sec.
Design a Stop Clock to display from 1 to 9 min.
Design a Circuit that will display random numbers from 0 to 9.
Design a circuit that will transmit 4 bit of information serially / over a single channel.
Sequence Generator
7.
8.
9.
10.
11.
12.
13.
Switch debouncer
Programmable Signal Generator
4 bit by 3 bit binary multiplier
Data serializer
Design of parity generator and checker using multiplexer
Design a digital system to control a dc motor using decoder
Design a digital system to generate carry, overflow and auxiliary carry for an 8 bit addition and
subtraction using suitable IC`s
14. Design a 2 bit comparator using PAL
15. Design a driver circuits with current rating
Self-Learning (1 Credit 4Hrs/Week):
Case Study, Design concepts of emerging technologies to be discussed pertaining to the course and beyond
syllabus.
The self-learning must be presented in front of evaluation committee; Members of this committee will be
Faculties handling the subject along with an observer appointed by Head of the Department. Students are
required to present their work either in form of technical presentation or in form of live demonstration. At
the end of the presentation the students are required to submit the report as per the format recommended
by the Dept. or Dean Academics. The scheme of evaluation for 20 marks is completely under the
prerogative of the committee members or as suggested by HOD.
Course Outcome :
At the end of the course student will be able to :
1.To understand the fundamentals of basic gates and simplification of expressions.

2.Analyse and optimize the circuits for implementation.
3.Design & Develop and Trouble shoot digital circuits.
4.Implement a digital system, components or process to meet the desired needs within realistic
constraints.
Reference Books
1
Donald D.Givone, Digital Principles and Design, Tata McGraw-Hill, 2002,ISBN 0-07-052906
Chapters: 3,4,5,6,7
2
Stephen Brown, Fundamentals of Digital Logic Design with verilog, Tata McGraw Hill, 2 nd
Edition, 2008. ISBN: 00-70-667241 Chapters: 2,3,4,5,6,7,8,9
3
M Morris Mano, Michael D.Ciletti, Digital Design, Pearson, 4 th Edition, ISBN-978-81-317-14508. Chapters: 3,4,5,6,7,10.
4
Samir Palnitkar Verilog HDL A guide to digital design and synthesis Pearson Education Asia, 2 nd
Edition, ISBN : 81-7758-918-0. Part 1 of this book
CIE consists of Three Tests each for 40 marks (15 marks for Quiz + 25 marks for descriptive) out of which
best of two will be considered. In addition self learning is evaluated for 20 marks.
Scheme of Continuous Internal Evaluation for Practicals:
The Record is evaluated for 35 Marks and final test is conducted for 15 Marks.
The question paper consists of Part A and Part B. Part A will be for 20 marks covering the complete syllabus
and is compulsory. Part B will be for 80 marks and shall consist of five questions (descriptive, analytical,
problems or/and design) carrying 16 marks each. All five from Part B will have internal choice and one of the
two have to be answered compulsorily.
Scheme of Semester End Examination for Practicals:
In the laboratory examination, the student has to conduct one experiment randomly picked by him/ her. The
percentage split of marks for Procedure & Write up is 20%, Conducting the Practicals is 60% and Viva-voce
is 20%.
R.V.COLLEGE OF ENGINEERING, BANGALORE 560059.

COMPUTER ORGANIZATION AND ARCHITECTURE
Course Code: 12CS35

Hrs/Week L-T-P-S: 3-1-0-4
Teaching Hours: 36 Hrs
CIE: 100 marks

SEE: 100 marks
2.
To develop a fundamental understanding on the organization of Computer.

To develop a clear picture on processing unit
To understand and visualize the roles of Bus system in processing the Instruction.
To develop a clear understanding on the Memory System.
To develop macro level instruction.
To present an adequate standard architectures for better understanding of the computer
operation.
To understand the operation and performance of parallel architecture
UNIT-I
Basic Structures of Computers
Functional units, Basic Operational Concepts, Bus Structures. Processor clock,
Basic performance equation, Pipelining and Superscalar operation, Clock rate,
Performance measurement- SPEC, CISC and RISC models.
Number Representation and Arithmetic Operations
Numbers, Number Notation, Arithmetic operations and characters, Half Adder and
Full adder, Multiplication of Positive numbers, Booth Algorithm, Fast
Multiplication: Bit-pair Recording of Multipliers; Integer division, Floating-point
Numbers & Operations, IEEE Standard for Floating-point Numbers.
Hours
3 Hrs
4 Hrs
3.
4.
5.
6.
7.
8.
9.
10.
UNIT-II
Machine Instructions and Programs
Memory Locations and Address, Byte addressability, Big-endian and Little-endian
assignments, Word Alignment, Accessing Numbers, Characters and Character
strings, memory Operation, Instruction and Instruction Sequencing, Register
Transfer Notation, Assembly Language Notation.
Basic Instruction Types
Instruction Execution & Straight-line sequencing, Branching, Condition Codes,
Generating Memory Addresses, Addressing Modes, implementation of Variables
& Constants, Indirection & pointers, Indexing & Arrays, Relative Addressing,
Additional Modes, Assembly Language: Assembler Directives, Stacks & Queues,
Subroutines, Subroutine Nesting & Processor Stack.
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- Version, Traffic modes, Architecture, Packet Structure.
UNIT-IV
The Memory System
Some
Basic
Concepts: Static Memories, Asynchronous DRAMs, Synchronous DRAMs,
Structure of Larger Memories, Memory System Considerations, Read-only
memory, Speed, Size & cost. The basics of Caches, mapping functions, Handling
Cache Misses, Handling Writes.
Control Unit Logic
Some 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 Micro programmed control.
UNIT-V
Pipelining
Basic Concepts, Pipelined Data path, Data Hazards, Instruction Hazards-Branch
hazards, Influence on Instruction set
Parallel Organization
Multiple processor organization, Symmetric multi-processors, Clusters, Nonuniform memory organization.
3 Hrs
4 Hrs
4 Hours
3 Hours
4 Hours
4 Hours
3 Hrs
4 Hrs
REFERENCE BOOKS:
1. Carl Hamacher, Z Vranesic & S Zaky, Computer Organization, Mc Graw Hill, 5 th Edition,
2002 ISBN10: 0-07-112218-4.
2. William Stallings, Computer Architecture and Organization, PHI, 6 th edition, 2003, ISBN10:
0-13-049307-4.
3. David A. Patterson and John L. Hennessy, Computer Organization and Design, Elsevier, 3 rd
Edition, 2005, ISBN10: 1-55860-604-1.
4. Mostafa Abd-El-Barr, Hesham El-Rewini, FUNDAMENTALS OF COMPUTER
ORGANIZATION ANDARCHITECTURE, Wiley publisher, 2005, ISBN10: 0-471-46741-3.
At the end of the course, students will be able to (Course Outcome) -
1. Understand the basic operation and organization of computer system.

2. Design system components and the interfaces of the computer system.
3. Choose the appropriate interrupt handling and control mechanism techniques for the
computer system.
4. Implement programs using assemble code required for interfacing using appropriate
data representation.
Tutorial Sessions (1 Credit 1 Hr/Week):
Tutorial session will be live demonstration of hardware disassembly in Laboratory
environment and is basically for the identification of computer components and application of
organization aspects in practice.
Self-learning will be on emerging fields of the computing technology, advanced
programming paradigm like parallel and cluster, a survey on Standard Computer
Architectures.
The self-learning must be presented in front of evaluation committee; The members of this
committee will be Faculties handling the subject along with an observer appointed by Head
of the Department. Students are required to present their work either in form of technical
presentation or in form of live demonstration. At the end of the presentation the students are
required to submit the report as per the format recommended by the Dept. or Dean
Academics. The scheme of evaluation for 20 marks is completely under the prerogative of
the committee members or as suggested by HOD, CSE.
out of which best two will be considered. In addition 20 marks have to be earned through
self-learning component on emerging topics in computer architecture, computing
infrastructure and programming.
Each quiz Max marks
: 15
: 20
Final CIE = (Best two quiz and Internal test) + Self Study valuation
= 40 x2 (Best Two Scores) + Self Study valuation (20)
= 100

DISCRETE MATHEMATICAL STRUCTURES

Course Code: 12CS/IS36
Hrs/Week L-T-P-S: 3-1-0-4
Teaching Hours: 36 Hrs
CIE: 100
SEE: 100

This course is designed
To provide an engineering student an intense foundational introduction to the
fundamental concepts in Discrete Mathematics.
Interpret, identify, and apply the language associated with logical structure, sets,
relations and functions, modular arithmetic.
Write and interpret logical statements using quantifiers.
To understand the concepts of group and coding theory and its applications
1
UNIT-I
Fundamental Principles of Counting:
The Rules of Sum and Product, Permutations, Combinations: The Binomial
Theorem, Combinations with Repetition.
Set Theory:
Sets and Subsets, Set Operations and the Laws of Set Theory, Cartesian
Products, The Principles of Inclusion and Exclusion: Generalizations of the
Principle, Derangements Nothing is in its Right Place, Rook Polynomials,
and Arrangements with Forbidden Positions
UNIT-II
Mathematical Induction, Recursive Definitions and Recurrence Relations:
Method of mathematical induction, Recursive definitions, First order Linear
Recurrence Relation Formulation Problems and examples. Second order
Linear Homogeneous Recurrence Relations with Constant Coefficients. The
Non-Homogeneous Recurrence Relations. The method of Generating
Functions.
UNIT-III
Fundamentals of Logic:
Basic Connectives and Truth Tables, Tautologies, Logical Equivalence: The laws
of logic, Logical Implications: Rules of Inference, The use of Quantifiers. The
proofs of Theorems
Hours
8Hrs
7Hrs
7 Hours
UNIT-IV
4
a) Relations:
Properties of Relations, Composition of Relations, Partial Orders, Hasse
Diagrams, Equivalence Relations and Partitions
b) Functions:
Functions : Plain and One to one, Onto Functions: Stirling Numbers of the
second kind, Function Composition and Inverse Function.
7 Hours
UNIT-V
5
a) Groups Theory:
Definition, Examples, and Elementary Properties, Abelian Groups,
Homomorphism, Isomorphisms, and Cyclic Groups, Cosets and Lagranges
7Hrs
Theorem.
b) Coding Theory:
Elementary Coding Theory, The Hamming Metric, The Parity Check and
Generator Matrices, Group Codes: Decoding with Coset Leaders.
REFERENCE BOOKS:
1. Ralph P. Grimaldi and B V Ramana, Discrete and Combinatorial Mathematics- An Applied
Introduction, Pearson Education, Asia, Fifth edition 2007. ISBN 978-81-7758-424-0
2. J.P. Tremblay and R. Manohar, Discrete Mathematical Structures with Applications to Computer
Science, Tata McGraw Hill, 35TH reprint 2008. ISBN 13:978-0-07-463113-3
3. Kenneth H. Rosen, Discrete Mathematics and its Applications, Tata McGraw Hill, Sixth
Edition, Sixth reprint 2008. ISBN-(13):978-0-07-064824-1
4. C. L. Liu and D P Mohapatra, Elementary Discrete Mathematics, Sixth Edition, Tata- McGraw
Hill.ISBN:10:0-07-066913-9
At the end of the course, students will be able to (Course Outcome)

1. Have in-depth knowledge of fundamental concepts of discrete mathematical
structure.
2. Analyze the different tools of discrete mathematics to various fields of computer
science.
3. Design solutions model for complex problem using different concepts of discrete
mathematical structure as a logical predictable system.
4. Apply the concepts of discrete mathematical structures that describes computation
effectively and efficiently for expressing and relating problems in the real world
Tutorial Sessions (1 Credit 1 Hr/Week):
Tutorial session will be live demonstration of hardware disassembly in Laboratory
environment and is basically for the identification of computer components and application of
organization aspects in practice.
Self learning will be on emerging fields in the operating systems research area like:
i.
Operating system design strategies and design considerations
ii.
Case study on linux operating system, windows operating system, android
operating system etc.
iii.
Distributed operating system design issues.
iv.
Distributed computing model.
The self-learning must be presented in front of evaluation committee; The members of this
Academics. The scheme of evaluation for 20 marks is completely under the prerogative of
the committee members or as suggested by HOD.
out of which best two will be considered. In addition 20 marks has to be earned through selflearning component on emerging topics in computer architecture, computing infrastructure
and programming.
Each quiz Max marks
: 15
: 20
Final CIE = (Best two quiz and Internal test) + Self Study valuation
= 40 x2 (Best Two Scores) + Self Study valuation (20)
= 100
R. V. COLLEGE OF ENGINEERING, BANGALORE-560059

(Autonomous Institution affiliated to VTU, Belgaum)
DEPARTMENT OF MATHEMATICS
BRIDGE COURSE MATHEMATICS- I
Subject Code: 12MA37
CIE Marks: 100
Periods / Week: 2
SEE Marks: 100
Audit course
Exam duration: 03 Hrs
Apply the knowledge of ordinary and partial differentiation in engineering and real life
problems;
Learn how to formulate and interpret a Taylor series approximation of a function.
Comprehend basic meaning of partial derivatives.
Make the student recognize and model differential equations and apply analytical
techniques to compute solutions.
Recognize and model differential equations, apply analytic techniques to compute
solution for engineering problems;
UNIT 1
Differential Calculus
(06 Hrs)
Successive differentiation, nth derivatives of standard functions, Leibnitzs theorem (without

proof). Taylors series and Maclaurins series for function of single variable (without proof).
UNIT 2
Partial Differentiation
(06 Hrs)
Introduction-partial derivatives, total derivative, differentiation of composite and implicit

functions. Jacobians and problems.
UNIT 3
Ordinary differential equations
(06Hrs)
Solution of first order and first degree differential equations - variable separable methods
homogeneous, linear, Bernoulli, exact equations (without integrating factor).
.
UNIT 4
Linear ordinary differential equations of second and higher order
(06Hrs)
Linear differential equations of higher order with constant coefficients. Solution by inverse
differential operator method. Solution by method of variation of parameters.
.
UNIT 5
Vector Analysis
(06)
Vector Algebra - Vector addition, Multplication (dot, cross & triple products),
Vector differentiation velocity, acceleration of a vector point function.
.
Learning Outcomes:
Upon completing this course, the student will be able to:
1. Use the concept of functions of several variables and their partial derivatives for
computing the areas, volumes using multiple integrals.
2. Ability to apply concept of differential equations to handle physical problems.
Reference Books:
1. B. S. GREWAL, Higher Engineering Mathematics, Khanna Publications, 40th edition
2007.
2. N. P. BALI, MANISH GOYAL A Text Book of Engineering Mathematics, Laxmi
Publications, 7th edition, 2007.
3. B. V. RAMANA Higher Engineering Mathematics, Tata Mc Graw Hill Publications,
2007.
4. E- KREYSZIG Advanced Engineering Mathematics, John Wiley & sons Publications,
8th edition, 2007.

CIE consists of Two Tests each for 50 marks (20 marks for Quiz + 30 marks for descriptive).
complete syllabus and is compulsory. Part B will consist of eight questions out of which five
questions have to be answered.
Semester: IV
APPLIED MATHEMATICS IV
Course Code: 12MA41
Hrs/Week: L:T:P:S : 3:2: 0:0
Credits: 04
EC/TC/IT/IS/CSE/ME/CHEMICAL
CIE Marks: 100

SEE Marks: 100
SEE : 3 Hrs
Provide basic definitions and theorems of the calculus of complex functions which are
involved in any field problems of Engineering.
Use of Bessel functions and Legendre polynomials and their properties in Heat, wave
and Laplace equations with cylindrical and spherical symmetry.
The theory of probability in study of random phenomena, analyzing and interpreting
data that involves uncertainty.
Apply linear programming techniques for optimization problems subject to linear
constraints in the various areas of Engineering & Science.
A student will be able to find the solution of partial differential equations which arise
in physical situations.
Unit I
07 Hrs
Complex Analysis
Complex variables - Function of a complex variable, analytic functions-CauchyRiemann equations in cartesian and polar forms (without proof), properties of
analytic functions, construction of analytic functions by Milne-Thomson method.
Complex integration - Complex line integrals-Cauchys theorem and corollaries
(without proof), Taylors and Laurents series (statements only), singularities, poles,
residues, residue theorem (without proof) - problems.
Unit II
07 Hrs
Special Functions
Introduction of Bessels and Legendres differential equation using the solution of
Laplace equation in cylindrical and spherical system. Series solution of Bessels
differential equation leading to Bessel function of first kind, recurrence relations,
generating functions, Bessels integral formula, orthogonality of Bessel function.
Legendres differential equation, Legendre polynomials, Rodrigues formula.
Unit III
07 Hrs
Linear Programming Problem

Mathematical formulation of Linear Programming Problem, Graphical method,
Simplex method and Big M method.
Unit IV
07Hrs
Probability and Distributions

Basics of Probability: Sample Space, events, probability of an event, addition
theorem. Conditional probability, Multiplication theorem, Bayes rule. Random
Variables: Discrete and continuous, Probability mass function, Probability density
function, Cumulative density function, Mean, Variance, standard deviation
Binomial, Poisson, Exponential and Normal Distributions.
Unit V
07 Hrs
Partial Differential Equations

Classification of second order Partial differential equations - Elliptic, Parabolic and
Hyperbolic. Solution of two dimensional Laplace equation in polar coordinates by the
method of separation of variables. Solution of two dimensional heat flow in transient state
and steady state.Solution of two dimensional wave equation by the method of separation of
variables. Vibrating membrane, solution in the case of rectangular and circular membrane Simple problems.
Course outcomes:
At the end of the course student will be able to:
1. Provide basic definitions and theorems of the calculus of complex functions
which are involved in any field problems of Engineering.
2. Use Bessel functions, Legendre polynomials and their properties in heat, wave
and Laplace equations with cylindrical and spherical symmetry.
3. Study of random phenomena, analyzing and interpreting data that involves
uncertainty, using theory of probability.
4. Interpret the models of probability distributions for real life and engineering
problems.
Reference Books
1. B.S. Grewal - Higher Engineering Mathematics, Khanna Publishers, 40th Edition,
2007, ISBN: 81-7409-195-5, Chapters: 16, 17, 19, 20, 26, 33.
2. N.P Bali & Manish Goyal - A Text Book of Engineering Mathematics, Lakshmi
Publications, 7th edition, 2010, ISBN: 978-81-7008-992-6,Chapters: 15, 16, 21.
3. Erwin Kreyszig - Advanced Engineering Mathematics, John Wiley & Sons, 9th
Edition, 2007, ISBN: 978-81-265-3135-6, Chapters: 4,11, 12, 20, 22.
4. Seymour Lipschutz & Marc Lars Lipson- Theory and Problems of Probability,
Schaums Outline Series, 2nd Edition, ISBN: 0-07118356-6, Chapters: 1, 2,3,4,5,6.
out of which best of two will be considered. In addition there will be one seminar on new
topics / model presentation etc. for 10 marks.
Environmental Science and Biology for Engineers

Course Objectives
Objectives for Environmental Technology
To make engineering graduates understand the changes happening in the environment
over decades (to give statistics with causes)
Role of human beings in the changes in environment and ways and means of
controlling the changes through technology
Sustainability issues in new technologies and its adaptation
Innovation (case studies) to arrest degradation of environment
Objectives for Applied Biology
To create awareness among all engineering graduates the need of biological study in
engineering (biology related issues in each engineering profession with case studies
and also application of biology in each program of engineering
Various branches of biological sciences (this might contain discussion of basic human
physiology, sensors and systems)
Effect of environment on biological issues and think of solutions (case studies in
industrial environment to be studied)
Environmental Science and Biology for Engineers

Subject Code:12EB32/42
CIE Marks: 100
Hrs/week: L:T:P:S: 3:0:0:1
SEE Marks: 100
Credits: 4
SEE duration: 3Hrs
.
Unit 1
Ecosystems and environment
6 hr
Principles of ecosystem, impact of human being on environment: pollution, resource
depletion and global environmental issues, ecosystem health and environmental changes and
human health.
Procedure to assess ecosystems health. Standards- ISO14000 and
Environmental Impact Assessment definition, objectives, and types. Rapid and
Comprehensive Environmental Impact Assessment (EIA), Environmental Impact Statement
(EIS) and Finding Of No Significant Impact (FONSI). Some EIA examples Thermal Power
Plant, Mining, Fertilizer, Construction Projects, Airport, Water and Wastewater Treatment
Plants.
Unit 2
10 hr
Strategies and Technology-based solutions for Improvement of Environment Quality:
Environment quality objectives and Waste challenge in modern society - types of waste:
municipal, agricultural, medicinal, E-waste, industrial. Engineering ethics, 3 Rs Reduce,
Reuse & Recycle, and Sustainable waste management: Compacting, drying, dewatering, biodrying, composting, bioremediation, biodegradation (chemicals and oil spillage). Waste to
energy energy recovery by incineration, bio-gasification, gasification and pyrolysis,
bioconversion to clean energy (biofuels). Some examples: Upflow anaerobic sludge blanket
(UASB) digestion for waste water treatment and biogas production. Technology to reduce
pollution: SO2/CO2 reduction by smoke-scrubber in coal thermal plants, chlorofluorocarbon
(CFC) and incandescent bulb replacement, Renewable energy sources wind, solar, tidal
waves and biomass. Emerging technologies: Geo-engineering - ocean iron fertilization, green
cement, bioremediation by terminator insects and synthetic biology.
Unit 3
Design and Modeling for Development of Environment
6 hr
Environmental Design: principles, benefits and motivation. Environmental design for
manufactured products, building and for developmental planning. Systems Engineering
Analysis - Design synthesis - applications to environmental Engineering Systems.
Environmental Modeling: introduction, forecast modeling and growth modeling, sensitivity
analysis. Application of remote-sensing and geographic information systems (GIS) in
environmental modeling.
Unit 4
Introduction to cell and organ systems
6 hr
Cell Types: Structure of plant, animal and microbial cell and Specialized cells like stem cells
and nerve cells. Biological macromolecules: Carbohydrates, proteins and nucleic acids and
Special biomolecules hormones, enzymes, vitamins and antibiotics. Introduction to organ
systems for example digestive, respiratory, excretory nervous and circulatory. Nervous
Control and coordination, sensory organs: Auditory, vision, olfactory, touch and taste.
Unit 5
Bio-Inspired engineering (BIE) or Bionics
8 hr
Biological phenomena and innovative engineering. Introduction to Bioelectronics,
Biocomputing, biophotonics and biomechatronics. Locomotion and Bio-inspired Robotics,
Prosthesis and biomedical implants, Aerodynamics and flight muscle functioning (birds &
Drosophila). Signaling: Enzymes and recognition receptors in biosensors; Neurotransmission

and neural networks (artificial intelligence, signal processing and imaging); Bioelectric
signals and cardiac generator. Sound: Ultrasonics in biology (echolocation in bats, sonar in
whales & dolphins) and instrumentation (medical ultrasonography - ultrasound imaging).
Light: Photosynthesis and photovoltaic cells
Course outcomes
The graduates will have the knowledge of:
1. The adverse changes in the environment due to human activities
2. The need of innovative technology to arrest or reverse these changes.
3. Ethical considerations important for systems engineering.
4. Basics of biological phenomena and their application in innovative engineering and
development of technology.
References
1. Vijay Kulkarni and T. V. Ramachandra 2009. Environment Management. TERI Press;
ISBN: 8179931846, 9788179931844
2. Gerald Kiely 1997. Environmental Engineering. McGraw-Hill; ISBN:
9780077091279
3. Sven Erik Jrgensen 2002. Integration of Ecosystem Theories: A Pattern Ecology &
Environment; Edition 3, Springer; ISBN: 1402007558, 9781402007552
4. Linvil Gene Rich 2003. Environmental Systems Engineering, McGraw-Hill; ISBN:
9780070522503
5. Ni-Bin Chang: Systems Analysis for Sustainable Engineering: Theory and
Applications (Green Manufacturing & Systems Engineering). McGraw-Hill
Professional, 2011, ISBN: 0071630058, 9780071630054
6. Larry Canter 1995. Environmental Impact Assessment, McGraw-Hill. ISBN:
0070097674
R.V. COLLEGE OF ENGINEERING, BANGALORE 560059

THEORY OF COMPUTATION
Course Code : 12IS/CS43
CIE Marks : 100
Hrs /Week : L: T: P: S 3:0:0:4
SEE Marks : 100
Credits
: 04
SEE Duration: 03

Understand fundamental concepts of theory of computation and the use of
mathematical thinking as it is applied to Computer Science.
Compare finite automata; push down automata and Turing machines as
Mathematical models of computation.
Develop the concepts and skills necessary to be able to evaluate the computability
and complexity of practical computational problems.
Understand formal thought processes, computation, algorithms and their limits.
Design a machine model to accept a specified language
UNIT I
08 Hrs
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. Equivalence & minimization of automata.
UNIT II
07 Hrs
Regular Expressions, Finite Automata & Regular Expressions, Applications of Regular
Expressions, Algebraic laws of RE, Pumping Lemma, Closure properties of Regular
Languages, Decision properties of Regular languages.
UNIT III
08 Hr
Context-free grammars, Parse trees, Applications, Ambiguity in grammars &
languages,Normal forms of CFGs, The Pumping Lemma, Closure properties of CFLs,
Decision properties of CFLs.
UNIT IV
06 Hrs
Definition, the languages of a PDA, Equivalence of PDAs & CFGs, Deterministic PDA.
UNIT V
07 Hrs
Problems that computers cannot solve, The Turing Machine and basic concepts,
Programming techniques for Turing Machines, Different types of Turing Machines, Turing
Machines & Computers. A language that is not recursively enumerable, An undecidable
problem that is RE, Posts Correspondence problem, Other undecidable problems. The
Chomsky hierarchy.
Course Outcome:
1. Apply a number of proof techniques to theorems in language design
2. Develop a clear understanding of undesirability.
3. Deduce the equivalence between Non-deterministic Finite State Automata and
Deterministic Finite State Automata.
4. Deduce the equivalence between Context-Free Grammars and Non-deterministic
Pushdown Automata.
5. Apply the power of the Turing Machine, as an abstract automaton, that describes
computation, effectively and efficiently
Reference Books:
1. J.P.Hopcroft, Rajeev Motwani, J.D.Ullman, Introduction to Automata Theory, Languages
& Computation, 3rd Edition, Pearson Education.
2. John Martin, Introduction to Languages & Theory of Computation, Tata McGraw-Hill, 3rd
Edition, 2007.
3. Peter Linz, An Introduction To Formal Languages & Automata, VI Edition, Narosa
Publishing House, 2007.
CIE consists of Three Tests each for 40 marks (15 marks for Quiz + 25 marks for descriptive) out of
which best of two will be considered. In addition there will be one seminar on new topics / model
presentation etc. for 20 marks.
The question paper consists of Part A and Part B. Part A will be for 20 marks covering the complete
syllabus and is compulsory. Part B will be for 80 marks and shall consist of five questions
(descriptive, analytical, problems or/and design) carrying 16 marks each. All five from Part B will
have internal choice and one of the two have to be answered compulsorily.

OPERATING SYSTEMS
(Theory & Practice)
Sub Code
Hrs / Week
Credits
: 12CS44
: L:T:P:S: 3:0:3:0
:5
CIE Marks
: 100 + 50
SEE Marks : 100 + 50
Exam Hours : 3 Hours

This course is designed to enable the student to:
Understand the operation of modern operating systems, and the relative merits and suitability
for complex computing environment.
Understand and analyze theoretical concepts and implementation of processes and threads.
Learn and implement the common algorithms used for Preemptive and Non-Preemptive
scheduling of tasks in operating systems.
Model, abstract, and implement efficient software solutions for process synchronization using
semaphores, monitors and critical regions.
Know resource allocation issues and deadlock handling mechanism used by an operating
system.
Acquire a detailed understanding of operations in memory management and disk management
and its implementation.
Study files system and protection concepts used in operating systems.
PART - A
UNIT-I
1.
Introduction to operating systems

Hours
What is an operating system? Mainframe systems, Desktop systems, Multiprocessor system,

Distributed system, Clustered system, Real time system and handheld system. Operating system
structures: System components, OS Services, System calls, Virtual machines.
2. Process
2 Hours
Process concept, Process scheduling, Operation on processes, cooperating processes, Inter process
communication.
UNIT-II
3. Threads Thread concept overview, Multithreading models, Threading issues, Pthread. 2 Hours
4. CPU scheduling
4 Hours
CPU scheduling - Basic concepts, scheduling criteria, scheduling algorithms, multiple processor
scheduling, Real time scheduling.
UNIT-III
5. Process Synchronization
4 Hours
The Critical section problem: Two-process solutions and multiple-process solutions,
Synchronization hardware, Semaphores: usage and implementation, Binary semaphores. Classic
problems of synchronization, Critical regions, monitors.
6. Deadlocks
4 Hours
System model, Deadlock characterization: necessary conditions, resource-allocation graph,

Methods for handling deadlocks: deadlock prevention, deadlock avoidance: Bankers algorithm,
Deadlock detection and recovery from deadlock: Process termination and resource preemption.
UNIT-IV
7. Main Memory Management
4 Hours
Background Address binding, Logical versus physical-address space, Swapping, Contiguous
allocation, Paging, Segmentation, Segmentation with paging
8. Virtual memory
4 Hours
Background, Demand paging, Page replacement algorithms: FIFO page replacement, Optimal
page replacement, LRU page replacement, LRU approximation page replacement, Allocation of
frames, Thrashing.
UNIT-V
9. Mass storage structures
Hours
Disk structure, Disk scheduling methods, Disk management, Swap space management.
10. File System interface and protection

3
Hours
File concept, Access methods and Directory structure, Allocation methods, Domain of protection,
Access matrix, Implementation of access matrix.
PART B
Laboratory
1. Study of UNIX commands related to information management, process management, file
management, utility commands etc along with their important options. Sample commands to
be practiced are :
a. Information management : cal, date, tty, sh, env, set, man, who, whoami
b. File management: ls, ln, rm, rmdir, mkdir, file, chmod, find, pwd, mount, umount,
mv, stat, touch
c. Process management: ps, kill, top, strace, nice.
d. Utility commands :wc, echo, tail, less, more, sort, grep, bc, cmp, comm
2. Write a program using following system calls of Unix operating system:
Fork() ,exec(), getpid() , getppid(), exit() and wait().
3. Write a program to create a child process to print a greeting message, it sleeps for 20secs and
then exits. The parent process should print the greeting message before creating the child and
after the child has terminated. It should then terminate.
4. Write a program to create a thread using pthread library to find sum of N numbers.
5. Write a program to compute the average turnaround and waiting time of Shortest Job First
(SJF) and Round Robin(RR) CPU scheduling algorithm
6. Write a program for the following classical problems of synchronization.
a. First Readers-Writer problem. b. Producer Consumer problem
7. Write a program to solve Classical Dinning Philosopher problem using monitors.
8. Write a program for Dekkers algorithm to implement the mutual exclusion problem.
9. Write a program to simulate deadlock handling using Bankers algorithm.
10. Write a program to simulate paging scheme in memory management.
11. Write a program to implement first fit and best fit algorithms in memory management.
12. Write a program to implement LRU and optimal page replacement algorithm. The program
should compute the number of page faults for a given page reference string with a given
number of frames.
13. Write a program to simulate I/O requests scheduling algorithm using Elevator algorithm.
14. Write a program to merge two files and display the contents of the resultant file.
15. Write a program to implement bit map vector for free space management.
16. Write a program for inter process communication using shared memory pipes and message
queues.
REFERENCE BOOKS:
1. Abraham silberschatz, Peter Baer Galvin , Greg Gagne, Operating System Concepts, John
Wiley & Sons, sixth edition, 2003, ISBN 9812-53-055-X.
2. Deitel, Deitel and Choffnes, Operating Systems, Pearson Education, Third Edition, 2004,
ISBN 0131828274.
3. Andrew S. Tenenbaum, Modern Operating Systems, Pearson Education, Third Edition, 2008,
ISBN 0136006639.
4. Gary Nutt, Operating Systems, Pearson Education, Third Edition, 2004, ISBN 0201773449.
Course outcome:
At the end of the course students will be able to:
1. Introduce to fundamentals of OS, architecture and different systems, thread concepts,

process synchronization and deadlocks, memory-management, storage structure and
file systems.
2. Analyze system components, system calls, thread models, methods of handling
deadlock, memory swapping and contiguous allocation, disc management, swap space
management and memory allocation methods.
3. Design IPC, Process scheduling algorithms, Semaphores, develop deadlock
prevention algorithms, paging and segmentation.
4. Implement solution for classical problems of process synchronization, deadlock
detection and recovery methods, page replacement algorithms and Implementation of
Access Matrix.

which best two will be considered. In addition 20 marks has to be earned through self learning
component on emerging topics in computer architecture, computing infrastructure and programming.
Each quiz Max marks
Max Assignment Marks
: 15
: 10

The students have to execute all the programs listed, in the lab and a record duly signed by the faculty
should be maintained. Each program is evaluated independently for 10 marks. Finally, total marks are
reduced to 30. A lab test will be conducted at the end of the semester for the remaining 20 marks, the
questions for the lab test will programs from the given list will be evaluated for 55% of the marks
and 35% will be execution of program of the facultys choice. The remaining 10% will be viva
voce.
Final CIE = Internal Assessment + Assignment + Practicals (CCE+Test)
= 45 x2 (Best Two Scores) +Assignment (10) + 30 (CCE) + 20 (Test)
= 150

In the examination questions must be given from lots. The questions for the lab exam will programs
from the given list evaluated for 55% of the marks and 35% will be execution of program of the
examiners choice. The remaining 10% will be viva voce.


DESIGN AND ANALYSIS OF ALGORITHMS
(Theory & Practice)
Sub Code
Hrs / Week
Credits
: 12CS/IS45
: L:T:P:S: 3:0:3:4
: 5
CIE Marks
: 100+50
SEE Marks
: 100+50
Exam Hours
: 3 Hours
Course Learning Objective:

To learn a mathematical model to find complexity of algorithms
To learn different algorithm design techniques and the algorithms that employs these
techniques.
To analysis the efficiency of the algorithms using the mathematical model developed.
To understand the limitations of algorithmic power
Part - A
UNIT I 8 Hours
Fundamentals of Algorithm Analysis : Definition of algorithm, Algorithmic Problem Solving,
Framework for Analysis of algorithm efficiency, Asymptotic Notations : , , and notations,
Properties of asymptotic notations, Basic Efficiency Classes, Mathematical Analysis of Non
recursive algorithms, Mathematical Analysis of Recursive Algorithms and Introduction to Divide
and Conquer, Master Theorem, Empirical analysis of algorithms.
UNIT II 7 Hours
Merge sort, Quick sort, Comparison with brute force selection sort, Multiplication of large
integers, Decrease and conquer : Depth First Search(DFS), Breadth First Search(BFS),
Applications of DFS and BFS, Topological Sorting, Fake coin Problem, Computing a median and
selection problem, Transform and Conquer : Introduction, Presorting, Balanced Search Trees
UNIT III 7 Hours
Heaps and Heap sort, Problem reduction String matching Brute force method, Horspools
method, Boyer-Moores method Dynamic Programming(DP): Computing a Binomial
Coefficient, Floyds Algorithm, The Knapsack Problem Brute force method, bottom-up DP
method and Memory Functions.
UNIT IV 7 Hours
Greedy Technique: Introduction, Prims Algorithm, Kruskals Algorithm, Dijkstras Algorithm,
Huffman Trees, Iterative improvement Introduction, The maximum-flow problem, maximum
matching in bipartite graphs, Lower-Bound Arguments, Decision Trees,
UNIT V 7 Hours
P, NP and NP-Complete Problems. Backtracking(BT) : n-queens problem, Subset-Sum problem,
Branch-and-Bound(BB) : Assignment problem - Brute force and BB method, Knapsack
problem, Traveling Salesman Problem Brute-force and BB method
PART B
DESIGN AND ANALYSIS OF ALGORITHMS - LAB
General Guideline
1.
2.
3.
4.
5.
6.
7.
GOTO statements are not allowed

No global declarations allowed
Prototype for each user-defined-function must be provided before main
main should be the first function in any program
Students are encouraged to use user-defined-header files
Programs must be indented appropriately
Students are required to bring only the algorithms in the data sheet
Implement the following using C/C++ Language.
1. Write a program to sort a given set of elements using Quick sort method and find the time required
to sort the elements
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. 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 print all the nodes reachable from a given starting node in a graph
using Breadth First Search method. Also check connectivity of the graph. If the graph
is not connected, display the number of components in the graph.
6. Write a program to sort a given set of elements using Heap sort method. Find the
time complexity.
7. a) Write a program to implement Horspool algorithm for String Matching.
b) Write a program to implement all pair shortest paths problem using Floyds
algorithm.
8. Write a program to implement 0/1 Knapsack problem using dynamic programming.
9. Write a program to find Minimum cost spanning tree of a given undirected graph
using Prims algorithm.
10. Write a program to find Minimum cost spanning tree of a given undirected graph
using Kruskals algorithm.
11. Write a program to find the shortest path using Dijkstras algorithm for a weighted
connected graph.
12. Write a program to implement Subset-Sum problem using Back Tracking.
13. Write a program to implement TSP using branch and bound algorithm.
14. Write a program to implement n-queens problem.
Course Outcomes
1. Analyze asymptotic runtime complexity of algorithms including formulating recurrence
relations.
2. Identify the efficient design technique to solve a given problem.
3. Understand the limitation of the algorithms and techniques to overcome it.
4. Apply the optimal algorithms and design techniques to solve engineering problems.
REFERENCE BOOKS:
1. Levitin A., Introduction to The Design and Analysis of Algorithms, Pearson Education, 2003,
ISBN: 9780201743951
2. Cormen T.H., Leiserson C. E., Rivest R.L., Stein C., Introduction to Algorithms, 3rd edition, PHI
2010, ISBN:9780262033848
3. Horowitz E., Sahani S., Rajasekharan S., Computer Algorithms, Galgotia Publications, 2001,
ISBN: 9780716783169
4. Mark Allen Weiss, Data structures and algorithm analysis in C++, Pearson Education, 2003,
ISBN: 032144146
Self Learning (1 Credit 4 Hrs/Week):

Self learning will be on emerging fields of the computing technology. It is an extension of
content of tutorial sessions. Students demonstrate realization of the real-life applications achieved
independently. This exercise is to assess understanding of the fundamentals by student and their
aptitude to apply the same to real world problems.

The self learning must be presented in front of evaluation committee; The members of this
committee will be Faculties handling the subject along with an observer appointed by Head of the
Department. Students are required to present their work either in form of technical presentation or in
form of live demonstration. At the end of the presentation the students are required to submit the
report as per the format recommended by the Dept. or Dean Academics. The format of evaluation for
20 marks is completely under the prerogative of the committee members or as suggested by HOD,
CSE.
which best two will be considered. In addition 20 marks has to be earned through self learning
component on emerging topics in computer architecture, computing infrastructure and programming.
Each quiz Max marks
: 15
: 20
The students have to execute all the programs listed, in the lab and a record duly signed by the faculty
should be maintained. Each program is evaluated independently for 10 marks. Finally, total marks are
reduced to 30. A lab test will be conducted at the end of the semester for the remaining 20 marks, the
questions for the lab test will programs from the given list will be evaluated for 55% of the marks
and 35% will be execution of program of the facultys choice. The remaining 10% will be viva
voce.
= 150

In the examination questions must be given from lots. The questions for the lab exam will programs
from the given list evaluated for 55% of the marks and 35% will be execution of program of the
examiners choice. The remaining 10% will be viva voce.


Object Oriented Programming with C++

(Theory & Practice)
Sub Code
Hrs / Week
Credits
: 12CS46
: L:T:P:S: 3:0:3:4
: 5
CIE Marks
SEE Marks
Exam Hrs
: 150
: 150
: 3 Hours
Course Learning Objective:

To apply the concept of object oriented programming through C++ to solve complex
problems.
Use of data abstraction instead of procedural abstraction
To design applications using generality, reusability and extensibility feature.
Understand fundamentals of programming such as variables, conditional and iterative

execution, methods, etc.
Use Object-oriented techniques such as inheritance, polymorphism, operator
overloading for software development.
Work in team and present their works
UNIT I
1. Introduction to C++
3 Hours
A Review of Structures, Procedure-Oriented Programming Systems, Object-Oriented
Programming Systems, Comparison of C++ with C, Console Input/output in C++,
Variables in C++, Reference Variables in C++, Functions in C++: Function Prototyping,
Function Overloading, Default Values for Formal Arguments of Functions, Inline
Functions.
2. Class and Objects
2 Hours
Introduction to Classes and Objects, Member Functions and Member Data, Objects and
Functions, Objects and Arrays, Namespaces, Nested Classes.
3. Constructors and Destructors
2 Hours
Constructors: Zero argument constructors, Parameterized constructors and copy
constructors destructors
UNIT II
4. Dynamic Memory Management
2 Hours
Introduction, Dynamic Memory Allocation, Dynamic Memory De-allocation, The
set_new_handler() function.
5. Inheritance
4 Hours
Introduction to Inheritance, Base Class and Derived Class Pointers, Function Overriding,
Base Class Initialization, The protected access specifiers, deriving by different access
specifiers, and different types of Inheritance, Order of Invocation of Constructors and
Destructors.
UNIT III
6. Operator Overloading
7 Hours
Operator Overloading, Overloading the Various Operators Overloading the Increment
and the Decrement Operators (Prefix and Postfix), Overloading the Unary Minus and the
Unary Plus Operator, Overloading the Arithmetic Operators, Overloading the Relational
Operators, Overloading the Assignment Operator, Overloading the Insertion and

Extraction Operators, Overloading the new and the delete Operators, Overloading the
Subscript Operator, Overloading the Pointer-to-member(->) Operator (Smart Pointer).
UNIT IV
7. Virtual Functions and Dynamic Polymorphism
3 Hours
The Need for Virtual Functions, Virtual Functions, The Mechanism of Virtual Functions,
Pure Virtual Functions, Virtual Destructors and Virtual Constructors.
8. Templates
4 Hours
Templates- Introduction, Function Templates, Class Templates, The Standard Template
Library (STL): Iterators, List class, Pair class, Map class and STL algorithms: Copy,
Count, Copy_backward, equal and find.
UNIT V
9. Exception Handling
3 Hours
Exception Handling- Introduction, C-Style Handling of Error-generating Codes, C++
Style Solution the try/throw/catch Construct, Limitation of Exception Handling.
10. Stream Handling
5 Hours
Streams, The Class Hierarchy of Handling Streams, Text Input/output, Binary
Input/output, Opening and Closing Files, Object Input/output through Member Functions,
Error Handling
PART B
OBJECT ORIENTED PROGRAMMING WITH C++ - LAB
General Guideline
1.
GOTO statements are not allowed
2.
No global declarations allowed
3.
Students are encouraged to use user-defined-header files
4.
Programs must be indented appropriately
5.
Students are required to bring only the algorithms in the data sheet
1. Write a C++ program to create two classes INCOME(basic, HRA, DA, allowance)
and DEDUCT(PF, IT,PT). Write a friend function(NET_SAL) to find the net salary of
an employee.
Goss Salary=basic+HRA+DA
NETSAL=INCOME-DEDUCT
Basic: Input from user
PF: 12% of basic
HRA: 25% of basic
IT: 20% of gross salary
DA:60% of basic
PT: Rs:200/-(use constructors)
2. Write a C++ Program to create a class called COMPLEX, and implement the
following by overloading the function ADD which returns the COMPLEX number.
i. ADD (s1, s2) Where s1 is an integer (real part) and s2 is a COMPLEX
number.
ii. ADD (s1, s2) where s2 and s2 are Complex numbers.
iii. Display the result by overloading the operators <<.
3. Write a C++ program to create a class called as STACK using array of integers.
Implement the following operations by overloading the operators + and -. Also
display the status and contents of the stack after each operation, by overloading the
operator <<. s1=s1+element ; where s1 is an object of the class STACK and element
is an integer to be pushed on top of the stack.
S1=s1--;where s1 is a object of
the class STACK, -- operator pops the element. Handle the STACK empty and
STACK full conditions using exception handling.
4.
Write a C++ program to create a class OCTAL which has the characteristics of an
octal number. Implement the following by writing an appropriate constructor and an
overloaded operator +. Display the OCTAL object by overloading the operator <<.
Also display the values of k and y.
OCTAL h = x;
int y=h + k;
where x is in decimal, h is in octal and k is in decimal.(overload = operator and use copy
constructor
5. Write a C++ program to create a template class QUEUE, with add and delete member
functions and use exception handler to display the message when the operation is not
possible. Using it, implement a queue of integers and doubles. Demonstrate the
implementation by displaying the status and content of the queue after every
operation.
6.
Write a C++ program to create a base class called as STUDENT (Name, Regno, age)
and using inheritance, create classes UG Student, and PG Student having fields as
semester, fees and stipend. Enter the data for at least 5 students. Find the average
age, semester wise, for all UG and PG students separately.
7.
Write a C++ program to implement the operations of LIST using STL functions for
the following operations
i.
Creation of a list
ii.
Insert at back
iii.
Insert at front
iv.
Delete back
v.
Delete front
vi.
Insert at position
vii.
Delete given element
viii. Display the contents of the list using Iterator.
8. Write a C++ program to perform the following operations on STRING class using
STL functions.
i.
Copy a string using copy() function
ii.
Reverse string using copy_backward() function
iii.
Count the number of characters using count()function
iv.
If strings are equal using equal()function
v.
Find a specific character in the string.
9. a).Write a C++ program to create an abtract class (SHAPE) with three virtual
functions (perimeter(), volume(), Area()) override these virtual functions in the
derived classes RECT , TRIANGLE, SQUARE to find perimeter, volume and area.
b).Write a C++ program to find CGPA of 5 students . Create three classes class
FIRST_SEM(USN , SUBCODE , GP) , SECOND_SEM (USN , SUBCODE, GP)

AND SUBJECT(SUBCODE , CREDITS). Calculate the CGPA for each students.
N
n
CGPA = CREDITS i * GRADEPOINT i / CREDITS i.
i =1
i =1
10. Write a C++ program to create a class called as MATRIX using two dimensional
array integers. Implement the following by overloading the operator == which checks
the compatibility of two matrices to be added and subtracted. Perform the following
by overloading + and operators. Display the result by overloading the operator <<.
If (m1==m2)
{
m3=m1+m2;
m4=m1+m2;
}
else
display error.
Where m1, m2, m3 and m4 are MATRIX objects.
Self Study:
On emerging fields of the Object oriented concepts and its real world applications.
Course Outcome:
At the end of the course,
1. Apply knowledge of object-oriented programming using C++ to solve real world
problems.
2. Design the definition of class and object by using suitable attributes, methods,
constructors & destructors pertaining to the problem definition. Also, suitably able to use
memory allocation and de-allocation for member variables.
3. Demonstrate rich features of OOP such as inheritance, operator overloading, dynamic
polymorphism, virtual functions , virtual constructors and virtual destructors, stream
handling .
4. Apply templates suitably and exception handling mechanism using try/catch/throw constructs .
REFERENCE BOOKS:
1. Sourav Sahay, Object-Oriented Programming With C++, Oxford University
Press,2012, 2Nd edition, ISBN: 9780198065302
2. Stanley B. Lippman, Josee Lajoie, Barbara E. Moo, C++ Primer, Addison Wesley, 5 th
edition, 2012.ISBN:978-0-321-71411-4
3. Bjarne Stroustrup,The C++ programming language, Pearson education,4th
edition,2013, ISBN:978-0321563842
4. Herbert Schildt, The Complete Reference C++, TMH, 4th Edition, 2005.
ISBN:9780070532465
5. Russ Miles, Kim Hamilton ,Learning UML 2.0 A Pragmatic Introduction to UML
Publisher: O'Reilly Media, April 2006 ISBN: 13: 978-0596009823
Self Learning (1 Credit 4Hrs/Week):
Self learning will be on emerging fields of the Object oriented concepts and its real world
applications such as software development in the form of Discrete event simulation of a client
server model using nested classes, Sparse matrix application using constructor/destructor,
Simulating a slot machine using virtual functions, Infrastructure development,

telecommunication networks.
The self learning must be presented in front of evaluation committee; The members of this
Academics. The format of evaluation for 20 marks is completely under the prerogative of
the committee members or as suggested by HOD, CSE.
out of which best two will be considered. In addition 20 marks has to be earned through self
learning component on emerging topics in computer architecture, computing infrastructure
and programming.
Each quiz Max marks
: 15
: 20

The students have to execute all the programs listed, in the lab and a record duly signed by
the faculty should be maintained. Each program is evaluated independently for 10 marks.
Finally, total marks are reduced to 30. A lab test will be conducted at the end of the semester
for the remaining 20 marks, the questions for the lab test will programs from the given list
will be evaluated for 55% of the marks and 35% will be execution of program of the
facultys choice. The remaining 10% will be viva voce.
= 150
In the examination questions must be given from lots. The questions for the lab exam will
programs from the given list evaluated for 55% of the marks and 35% will be execution of
program of the examiners choice. The remaining 10% will be viva voce.
R. V. COLLEGE OF ENGINEERING, BANGALORE-560059

(Autonomous Institution affiliated to VTU, Belgaum)
DEPARTMENT OF MATHEMATICS
BRIDGE COURSE MATHEMATICS- II
Subject Code: 12MA48
Periods/Week: 2
Audit course
CIE Marks: 100

SEE Marks: 100
Exam duration: 03 Hrs
Recognize partial differential equations and apply analytic techniques to compute

solution for engineering problems.
Apply the significance of vector integration and their theoretical importance in
engineering problems.
Identify and solve initial value problems, physically interpret the solutions using the
Laplace transforms.
UNIT 1
Laplace Transforms
Definition, transforms of elementary functions, properties, derivatives and integrals, unit step
function.
(06 Hrs)
UNIT 2
Inverse Laplace Transforms
Inverse Laplace transforms- properties, convolution theorem (statement only) - problems,
solution of linear differential equations, with constant coefficients.
(06 Hrs)
UNIT 3
Integral Calculus
Multiple integrals - Double and Triple integrals. Area enclosed by plane curves, Volume of
solids. Definition of beta and gamma functions and problems.
(06 Hrs)
UNIT 4
Partial Differential Equations (PDE)
Formation of Partial differential equations by elimination of arbitrary constants/functions.
Solution of Lagranges linear PDE. Solution of PDE by the Method of separation of variables
(first and second order equations).
(06 Hrs)
UNIT 5
Vector Analysis
Vector Differentiation - Scalar and vector point functions, gradient, directional derivative,
divergence and curl. Solenoidal and Irrotational fields, vector identities.
(06 Hrs)
Learning Outcomes:
Upon completing this course:
1. The student will be able to solve problems arising in signal processing and various
systems using Laplace transforms techniques for problems arising in signals and systems.
2. The student will be able to apply vector integration to different Engineering applications.
Reference Books:
1. B. S. GREWAL, Higher Engineering Mathematics, Khanna Publications, 40th edition
2007.
2. N. P. BALI, MANISH GOYAL, A Text Book of Engineering Mathematics, Laxmi
Publications, 7th edition, 2007.
3. B. V. RAMANA Higher Engineering Mathematics, Tata Mc Graw Hill Publications,
2007.
4. E- KREYSZIG, Advanced Engineering Mathematics, John Wiley & sons Publications,
8th edition, 2007.
CIE consists of Two Tests each for 50 marks (20 marks for Quiz + 30 marks for descriptive).
complete syllabus and is compulsory. Part B will have eight questions out of which five
questions have to be answered.

Scheme & Syllabus III & IV Semester B.E Computer Science and Engineering (2012 Scheme)

Загружено:

Сведения о документе

Оригинальное название

Авторское право

Доступные форматы

Поделиться этим документом

Поделиться или встроить документ

Параметры публикации

Этот документ был вам полезен?

Это неприемлемый материал?

Авторское право:

Доступные форматы

Scheme & Syllabus III & IV Semester B.E Computer Science and Engineering (2012 Scheme)

Загружено:

Авторское право:

Доступные форматы

Rashtreeya Sikshana Samithi Trust

Scheme & Syllabus

Vision and Mission of the Department of Computer Science and Engineering:

interdisciplinary research and skill enhancement.

To develop professionals with ethical and societal values.

Program Educational Objectives (PEOs):

Graduates will be able to apply mathematical foundation, algorithmic principles

tools to solve it.

and environmental contexts.

and life-long learning.

THIRD SEMESTER :CSE

CIE Marks: 100

Course Learning Objectives:

Fourier series and Fourier Transforms

Matrices and Linear Equations

Numerical methods for Ordinary differential equations.

ENGINEERING MATERIALS (COMMON TO ALL BRANCHES)

Nanocrystalline Silicon Materials, Low-temperature Dielectrics, Low-temperature Thin-film

Polymers Definition, Classification of Polymers, Properties and their applications,

R.V. COLLEGE OF ENGINEERING, BANGALORE 560059

DATA STRUCTURES WITH C

Course Code : 12IS/CS33

CIE Marks : 100 + 50

Hrs /Week : L: T: P: S 3:0:2:4

SEE Marks : 100 + 50

SEE Duration: 03+03 Hrs

Course Learning Objectives - CLO:

Types of Data Structures, Linear & non linear Data Structures

Representation of queue, operations, circular queues, Implementation of Priority queues &

1. Use Stack operations to do the following:

Self-Learning (1 Credit 4 Hrs/Week):

Self-learning will be on emerging fields of the computing technology. It is an

Scheme of Evaluation for Practicals (50)

No External Devices like Laptop, Mobile, Pen drives, ipads etc.,

DIGITAL LOGIC DESIGN

Simplification of Boolean Expressions:

Flip-Flops and Applications:

Addition of two numbers whose sum is less than 9

1.To understand the fundamentals of basic gates and simplification of expressions.

R.V.COLLEGE OF ENGINEERING, BANGALORE 560059.

Course Code: 12CS35

CIE: 100 marks

Course Learning Objectives (CLO):

To develop a fundamental understanding on the organization of Computer.

At the end of the course, students will be able to (Course Outcome) -

1. Understand the basic operation and organization of computer system.

R.V.COLLEGE OF ENGINEERING, BANGALORE 560059.

DISCRETE MATHEMATICAL STRUCTURES

Course Learning Objectives (CLO):

At the end of the course, students will be able to (Course Outcome)

R. V. COLLEGE OF ENGINEERING, BANGALORE-560059

CIE Marks: 100

SEE Marks: 100

Exam duration: 03 Hrs

Course Learning Objectives (CLO):

Successive differentiation, nth derivatives of standard functions, Leibnitzs theorem (without

Introduction-partial derivatives, total derivative, differentiation of composite and implicit

Scheme of Continuous Internal Evaluation:

CIE Marks: 100

Course Learning Objectives:

Linear Programming Problem

Probability and Distributions

Partial Differential Equations