R V COLLEGE OF ENGINEERING, BANGALORE-560059

(Autonomous Institution under VTU, Belgaum)

SUBJECT: DATA STRUCTURES & PROGRAMMING WITH C++

THEORY & PRACTICALS
Sub Code: 07TC51 CIE Marks: 100+50
Hrs / Week: 4+0+2 Exam: 3 Hrs
Credits: 5 SEE Marks: 100+50
Objective: In the present day scenario Telecommunication and Electronic equipment / appliances are
driven by software programs in addition to hardware. The Objective of this course is to make the
students learn about Data structures & Programming. Review of C++ program concepts & algorithms,
Data representation, analysis methods, dynamic programming, stack & queues, Binary tree & other trees.
A mastery of these areas is essential for us to develop computer programs that utilize computer resources
in an effective manner.
PART – A
01 Overview of C++ (12 Hrs)
Basic C++ programming Elements, reference variables, objects, making & using
objects, data abstraction, dynamic memory allocation, classes, constructors and
destructors, static data members and static member functions, function overloading and
operator overloading, dynamic object creation, templates and C++ standard template
library (STL), inheritance, polymorphism, virtual functions.
02 Data Representation (06 Hrs)
Introduction, Linear Lists, Formula-based Representation Linked Representation,
Indirect Addressing Simulating Pointers.
03 Arrays and Matrices (06 Hrs)
Arrays, Matrices, Special Matrices, Sparse Matrices.
04 Stacks (06 Hrs)
The Abstract Data Types, Derived Classes and Inheritance, Formula-based
Representation, Linked Representation, Applications.
PART- B
05 Queues (04 Hrs)
The Abstract Data Types, Derived Classes and Inheritance, Formula-based
Representation, Linked Representation, Applications.
06 Skip Lists and Hashing (04 Hrs)
Dictionaries, Linear Representation, Skip list presentation, Hash Table Representation.
07 Binary and Other Trees (08 Hrs)
Trees, Binary Trees, Properties and Representation of Binary Trees, Common Binary
Tree Operations, Binary Tree Traversal The ADT Binary Tree, ADT and Class
Extensions.
08 Priority Queue (04Hrs)
Linear lists, Heap, Leftist trees, applications.
PART- C(Laboratory)
The students are expected to write C++ program for the following topics and
execute the same.
The roots of quadratic equations, Sequential search method, Bubble sort, selection sort,
count/rank sort, Linear list representation as a chain into one represented as array,
Insertion, deletion, search an element from the linear linked list, perform the addition,
subtraction, multiplication using class , Transposing of a sparse matrix, circular
queues, de queue, insertion queue, deletion from queue, Constructor, destructor, and
overloading operator in skip list, hash table, binary trees, priority queues.
Reference Books
1 Sartaj Sahni:” Data Structures, Algorithms, and Applications in C++”, McGraw Hill. 2000.
2 Maria Litvin and Gray Litvin: “Programming with C++ and Data Structures” –Vikas Publication,
2003.
3 Donald E. Knuth: “The Art of Computer Programming” (Volume1,2,3), 3rd edition, Pearson
Education.2007.
4 Balaguruswamy: “Object Oriented Programming in C++”, TMH, 2005.

Scheme of Semester end Evaluation:

The Question paper will consist of FIVE questions in Part – A, THREE questions in Part – B .
Student should answer FIVE full questions selecting THREE questions from Part – A, TWO questions
from Part – B.
For Practical examination: Practical examination shall consist of two programs to be written and
executed.
 R V COLLEGE OF ENGINEERING, BANGALORE-560059
(Autonomous Institution under VTU, Belgaum)

SUBJECT: DIGITAL COMMUNICATION

THEORY & PRACTICALS
Sub Code: 07TC52 CIE Marks: 100+50
Hrs / Week: 4 +0+2 Exam: 3 Hrs
Credits: 5 SEE Marks: 100+50

Objective: In the previous semester the students have studied Analog communication as a core course.
Today, digital communication is part and parcel of voice, video and data oriented services. The objective
of this course is to make the students learn about various ways in which analog signals are transmitted as
digital stream using various keying techniques. The course also deals with different impairments that take
place during transmission, their estimation and remedial measures. The transmission data rate and
bandwidth are the main concerns in digital communication systems. Various modulation techniques that
can be used to take care of these in different applications are also dealt with.

PART – A
01 Introduction (02 Hrs)
Sources and Signals, Signal Processing Operations in Digital Communication,
Selection of channels for Digital Communication.
02 Digital coding of Analog Waveforms (12 Hrs)
Sampling Theorem, Quadrature Sampling, Reconstruction of message, Flat top
Sampling, Pulse amplitude modulation, Time Division Multiplexing. PCM,
Quantization, Quantization Noise in PCM, Non-uniform quantization, DPCM, Delta
Modulation, Noise in DM, ADM, T1 system.
03 Base band Shaping for Data Transmission (08Hrs)
Digital formats for Data, ISI problem, ideal Solution, raised cosine spectrum,
Correlative coding, Eye pattern, Base band transmission of M-ary data, Adaptive
equalization, case study -receiver.
04 Detection & Estimation (10Hrs)
Model of Digital Communication System, Gram-Schmidt Orthogonalization
procedure, geometric interpretation of signals, response of bank of correlators to noisy
input, detection of known signals in noise, probability of error, correlation receiver,
matched filter receiver, detection of signals with unknown phase in noise. Estimation:
concept and criteria, maximum likelihood estimation.
PART- B
05 Digital Modulation Techniques (10Hrs)
Digital Modulation formats- ASK, FSK, PSK, Cohérent modulation techniques,
cohérent quadrature modulation techniques- QPSK, MSK, Non-cohérent modulation
techniques, Comparison of binary & Quaternary modulation techniques, M-ary
modulation techniques, , power Spectra, Bandwidth Efficiency, Bit v/s Symbol error
Probabilities, Synchronisation and Applications. Use of OFDM for better spectrum
performance.
06 Spread Spectrum Modulation (08Hrs)
Pseudo noise sequences, notion of spread spectrum, direct sequence spread coherent
binary PSK, signal space dimensionality and processing gain, probability of error,
Frequency hop spread spectrum, Applications.
 PART- C LABORATORY
Design and Testing of circuits for the following Digital Communication concepts.
Realizing PCM, ADM and DM schemes with various bits and to check errors in
detection, Four bit PCM/TDM generation and detection, Effect of various noises on
data retrieval, Generate error detection and correction codes introduce errors and
detect, Digital keying schemes and detection at given rates, calculation of Bandwidth
requirement by introducing filters. QPSK and MSK schemes, Orthogonal signal
generation and to show they are orthogonal, Generation of Pseudo random , Walsh and
Barker codes, Spread Spectrum DSS and FHSS generation and detection.
Note: 1. Few Experiments to be conducted using Hardware.
2. All experiments to be conducted using MATLAB and LABVIEW.

Reference Books
1 Simon Haykin: ”Digital Communications” –John Wiley, 2003.
2 Bernard Sklar:”Digital Communication Fundamentals and Applications”-Pearson Education, 2e,
2004.
3 K. Sam Shanmugam: ”Digital and Analog Communication Systems” –John Wiley, 2002.
4 H.P.HSU:”Analog and Digital Communications”–Tata McGraw Hill, II edition, 2006.

Scheme of Semester end Evaluation

The Question paper will consist of FIVE questions in Part – A, THREE questions in Part – B
Student should answer FIVE full questions selecting THREE questions from Part – A and TWO
Questions from Part – B.
For Practical examination
The student is expected to design and perform allotted experiment.
as per the distribution in experiment list.
R V COLLEGE OF ENGINEERING, BANGALORE-560059
(Autonomous Institution under VTU, Belgaum)
 SUBJECT: MICROWAVE ENGINEERING
Sub Code: 07 TC 53 CIE Marks: 100
Hrs / Week: 4+0+0 Exam: 3 Hrs
Credits: 4 SEE Marks: 100
Objective: The prerequisite for this subject is knowledge of Field Theory which has been covered in 3rd
sem. In present day Wireless Communication Networks Microwave plays an important role both in land
line (Terrestrial) as well as Satellite Communication. Part-A deals with analysis of Microwave networks
using scattering parameters. During This analysis students are exposed to various passive components
used in microwave circuits. In this part characteristics and analysis of both vaccum tubes and solid state
components are highlighted. Part-B is devoted to measurement of performance characteristics of
microwave devices. Applications of these devices are also studied and the students are exposed to
simple link design of microwave links.
PART – A
01 Introduction (02 Hrs)
RF spectrum, Properties, ITU classification, Applications of various spectrums.
02 Microwave network theory and passive devices (16 Hrs)
Symmetrical Z and Y matrices for reciprocal networks, S matrix representation of
multi-port network, Microwave passive devices: Coaxial connectors and adapters,
Matched termination, Wave guide corners & bends, Coaxial to wave guide adapters,
Coupling loops, Phase shifters, Attenuators, Wave guide Tees, Magic Tees, Isolators,
Circulators, Directional couplers, Microwave resonators, Microwave filters.
03 Microwave vacuum tube devices (04 Hrs)
Klystrons, Reflex Klystron Magnetrons, TWTs.
04 Microwave solid state devices (10 Hrs)
Crystal diode, Schottky diode, PIN diode, GUNN diode, IMPATT & TRAPATT
diodes, Tunnel diode, Parametric amplifiers, Microwave transistors.Gallium
Arsenide and Gallium Nitride devices, Power and efficiency of Microwave devices.
(Characteristics, equivalent circuits and applications).
PART – B
05 Microwave measurements (08 Hrs)
Description of tunable detector, slotted line carriage, VSWR meter, spectrum
analyzer, network analyzer, Klystron and Gunn power supplies. Power
measurements, insertion loss and attenuation measurements, VSWR measurements,
return loss measurements by reflectometer, impedance measurement, and frequency
measurement.
06 Microwave antennas, Propagation, Terrestrial link design, Applications in RADAR (10 Hrs)
and Navigation systems, Application of Microwaves in Domestic, Industrial and
Medical fields. Microwave Hazards.
Reference Books:
1 Samuel Y Liao : Microwave Devices and Circuits-, PHI, 3rd Edition, 2005.
2 David M Pozar:Microwave Engineering - John Wiley, 2e, 2004.
3 Annapurna Das: Microwave Engineering- Tata McGraw-HILL, 2nd Edition reprint, 2003.
Scheme of Semester end Evaluation:
The Question paper will consist of FIVE questions in Part – A and THREE questions in Part – B.
Student should answer FIVE full questions selecting THREE questions from Part – A and TWO from
Part- B.
 R V COLLEGE OF ENGINEERING, BANGALORE-560059
(Autonomous Institution under VTU, Belgaum)

SUBJECT: INFORMATION THEORY & CODING

Sub Code: 07TC54 CIE Marks: 100
Reference
Hrs / Week: Books:
4+0+0 Exam: 3 Hrs
1
Credits:P.S
4 Satyanarayana, “Concepts of Information Theory and Coding” , Dynaram, Bangalore, SEE2003.
Marks: 100
2 Simon Haykin,: “Digital Communications” –John Wiley, 2003.
Objective:
3 K. Sam This course will make
Shanmugam, theand
“Digital student to understand
Analog the concepts
Communication Systems”of –Wiley,
Advanced Digital communication
2002.
and
4 systems.
Taub and The course deals
Schilling:” with various
Principles sources andEngineering”,
of Communication methods of McGraw
encoding.HillVarious channels
3rd Edition, 2008.and the
transmission of digital signals through these channels. Influence of the channels during transmission. Source
and channel
Scheme coding techniques
of Semester to reduce errors at receiving end. The course is a prerequisite to the various
end Evaluation:
systems and technologies that the
The Question paper will consist of Telecommunication
FIVE questions in student
Part – Awill
andstudy
THREEin higher semester.
questions in PartThe
– B.students
Studentwill
appreciate the importance of this subject in voice, video and data transmission.
should answer FIVE full questions selecting THREE questions from Part – A and TWO from Part – B.
PART – A
01 Probability Theory (06Hrs)
Different approaches/Definitions of probability, Joint and conditional probabilities, Total
probability and Bayes theorems, Independent Events, Concept of a Random variable,
Distribution and density functions and their properties, Discrete and Continuous random
variables, Joint random variables – Distribution and density functions, Independent
Random variables, Concept of a Markov chain.
02 Basics of Information theory (06 Hrs)
Measure of Information, Units of Information, Discrete memory less source (DMS) and
Entropy, Logarithmic inequalities, Properties of Entropy, Information Rate, Extension of a
zero memory source, Sources with finite memory - Markov sources, Extension of a
Markov Source, Adjoint Source.
03 Two dimensional schemes:-Discrete channels (06 Hrs)
Joint and Conditional Entropies, Mutual information, Shannon Theorem on Channel
Capacity, Capacity of Channels, BSC and BEC.
04 Continuous channels (06 Hrs)
Entropy of continuous Signals: (Differential entropy), Maximization of entropy, Capacity
of band limited channels with AWGN and Average Power limitation of signals: The
Shannon – Hartley law and its implications.
05 Source Encoding (06 Hrs)
Definition of Codes, Basic properties of codes, Construction of Instantaneous Codes,
Construction of some Basic Codes – Shannon’s Binary encoding, Shannon – Fano Binary
encoding and Huffman coding, Coding for Sources with Memory.
PART- B
06 Error Control Coding – Block Codes (06 Hrs)
Rationale for Coding, Discrete memory less channel and Shannon’s theorem on channel
capacity Revisited, Types of errors, Types of codes, Example of Error Control Coding,
Block codes, Minimum Distance Considerations, Standard Array and Syndrome Decoding,
Hamming Codes.
07 Cyclic Codes (07 Hrs)
Generator Polynomial for Cyclic Codes, Multiplication Circuits, Dividing Circuits,
Systematic Cyclic Codes, Generator Matrix for Cyclic Codes, Syndrome Calculation -
Error Detection and Error Correction, Bose- Chaudhury - Hocquenghem (BCB) Codes,
Cyclic Redundancy Check (CRC) codes, Maximum Length codes, Majority Logic
Decodable Codes, Shortened cyclic codes, Golay codes, Reed-Solomon Codes.

08 Convolutional Codes: Connection Pictorial Representation, Convolutional Encoding – (07 Hrs)

Time domain approach, Encoding of Convolutional Codes; Transform Domain Approach,
Systematic Convolutional Codes, Structural Properties of Convolutional Codes, - State,
Tree and Trellis diagrams, Decoding of Convolutional Codes using Viterbi algorithm.
 R V COLLEGE OF ENGINEERING, BANGALORE-560059
(Autonomous Institution under VTU, Belgaum)

SUBJECT: COMPUTER ORGANIZATION & ARCHITECTURE

Sub Code: 07 TE 55A1 CIE Marks: 100
Hrs / Week: 4+0+0 Exam: 3 Hrs
Credits: 4 SEE Marks: 100
Objective: An Engineer designing Mobile equipments and appliances need to know about various
computer peripherals, architecture, operating systems and real time Embedded system to decide which is
best for a particular application. This subject serves as a prerequisite to “operating systems”, and ‘Real
time embedded systems’. In this subject the student is exposed to the internal organization of a computer
system and learns the implementation of basic arithmetic and logic operations in a computer. The
various processes involved in performing arithmetic operation, fetching word from peripheral devices
are discussed. The student will also learn the various processor architecture and their differences.
 PART – A
01 Basic Structures of Computers (02 Hrs)
Review of basic Operational concepts - Bus structures, Performance, Processor
clock, Basic Performance equation, Pipelining & Superscalar operation,
Multiprocessor & Multicomputers, General features of CISC & RISC.
02 Machine Instructions and Programs (08 Hrs)
Review of Numbers & character representations, storage and access in a computer,
Big – endian & Little – endian assignments, Memory Operation : Instruction &
Instruction Sequencing, Register Transfer Notation, Assembly Language Notation,
Basic Instruction Types, Branching, Condition Codes, Implementation of Addressing
Modes & Assembler Directives, Stacks & Queues : Subroutines : Subroutine Nesting
& Processor Stack, Parameter passing, Encoding of Machine Instruction.
03 Input/ Output Organization (10 Hrs)
Accessing I/O devices, Interrupts, Interrupt Hardware, Enabling & Disabling
Interrupt, Handling Multiple devices, Controlling Device Requests, Exceptions,
Direct Memory Access, Bus Arbitration, Buses - Synchronous Bus, Asynchronous
Bus ; Interface Circuits for Parallel Port & Serial Port, Standard I/O interfaces, PCI
bus, SCSI bus, USB bus.
04 The Memory System (10 Hrs)
Review of Memory classification, characteristics and basic organization of memory
chips. Static Memories, Asynchronous DRAMs, Synchronous DRAMs, Organization
of Larger Memories, Memory System Considerations, Rambus memory; Flash
memories, Cache Memories - Mapping functions, Performance considerations,
Interleaving, Hit Rate & Miss Penalty, Virtual Memories - Address Translation;
Secondary Storage - Magnetic Hard Disks, Optical Disks, magnetic tapes.
PART – B
05 Arithmetic unit (07 Hrs)
Implementation of Addition & Subtraction of Signed Numbers: Design of fast adders
- Carry-Look ahead Addition; Multiplication of positive numbers - Signed – Operand
Multiplication, Booth Algorithm, Fast Multiplication, Bit-pair Recoding of
Multipliers; Integer division , Floating – Point Numbers & Operations, IEEE
Standard for Floating – Point Numbers, Arithmetic Operations on Floating – Point
Numbers, Implementing Floating – Point Operations.

06 Basic Processing Unit (07 Hrs)

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 – A Complete
Processor, Micro programmed Control, Microinstruction, Micro program
Sequencing, Microinstruction with Next-address field.
07 Case Studies and comparison (06 Hrs)
INTEL processor, Motorola Processor, ARM Processor, AMD Processor, Multi core
Processor.
Reference Books:
1 Carl Hamacher, Z Vranesic & S Zaky, “Computer organization”, 5th Edition, TMH, 2002.
2 V Heuring & H Jordan, “Computer System Design & Architecture”, Addison – Wesley, 1 st
Edition, 1999.
3 D. A. Patterson & J. L. Hennessy, “Computer Organization and Design”, 2nd Edition, 2002.
Scheme of Semester end Evaluation:
The Question paper will consist of FIVE questions in Part – A and THREE questions in Part – B.
Student should answer FIVE full questions selecting THREE questions from Part – A and TWO from
Part – B.

R V COLLEGE OF ENGINEERING, BANGALORE-560059

(Autonomous Institution under VTU, Belgaum)

SUBJECT: JAVA AND J2EE PROGRAMMING

Sub Code: 07 TE 55A2 CIE Marks: 100
Hrs / Week: 4+0+0 Exam: 3 Hrs
Credits: 4 SEE Marks: 100
Objective: This course introduces the students to basic features of Java language, learn its syntax,
idioms, patterns, styles and become comfortable with object oriented programming and Learn to think in
objects. The syllabus also introduces the essentials of the Java class library, threads and exceptions,
Event driven Graphical User Interface (GUI) programming, role of J2EE in development of enterprise
software in Java language, and to understand how J2EE facilitates integration of java components with
non-Java systems including databases and world wide web using servlets and JSP. The course also
focus on writing code that is legible, maintainable, reusable, fast, and efficient for developing stand
alone and web applications.
PART – A
01 Introduction to Java (10 Hrs)
Java Language introduction, Java features, why Java is important to internet, Java
Language Introduction- Hello World, Lexical Issues, Java class Libraries, Variables,
Data Types- Simple Types, Type conversion, Arrays. Operators, Flow Control-
Branching, Looping, Classes-Object References, Instance Variables, The new
operator, The Dot(.) Operator, Method Declaration, Method Calling, Constructors,
Method Overloading, Inheritance, Method Overriding, Dynamic Method Dispatch,
Abstract, Packages and Interfaces- Packages, Interfaces.
02 Java Classes (12 Hrs)
String handling- Constructors, String syntax, Character Extraction, Comparison,
String Copy Modifications, Exception Handling-Exception Types, Uncaught
Exceptions, Try and catch, Multiple catch Clauses, Nested try Statements, Exception
sub Classes, Threads and Synchronization- Single Threaded Event Loop, The Java
Thread Model, Thread class, Runnable Interface, Thread Priorities, Synchronization,
Inter-Thread Communication, Thread API Summary. Utilities- Enumerations, Simple
type Wrappers, runtime, Input/ Output- File, Input Stream, Output Stream, File
Streams.
03 Introduction to Java GUI (08 Hrs)
Applets: Applet Basics, Architecture, Applet Lifecycle, repaint(), update, HTML
APPLET Tags, passing parameters to Applets. AWT: AWT classes, Window
fundamentals. Swings: Introduction to Swings, JApplet, JFrame and JComponent,
Icons & labels, Handling Threading issues, Text Fields, Buttons.
PART – B
04 J2EE and JDBC Concepts (10 Hrs)
Overview of J2EE and J2SE, J2EE best Practices, Enterprise Application strategy,
Enterprise Application, clients, session Management, Web Tier & JSP, EJB Tier. The
Concept of JDBC; JDBC Driver Types; JDBC Packages; A Brief Overview of the
JDBC process; Database Connection; Associating the JDBC/ODBC Bridge with the
Database; Statement Objects; Result Set; Transaction Processing; Metadata, Data
types; Exceptions.

05 Servlets and JSP (10 Hrs)

Background, The Life Cycle of a Servlet; servelet configuration, Reading/Sending
data, working with Cookies – Cookie class and its methods, Session Tracking-
methods used in session tracking. Java Server Pages (JSP) installation, JSP Tags,
Tomcat-starting and stopping server, Request String, User Sessions, Cookies,
Session Objects.
Reference Books:
1 Herbert Schildt - Java The Complete Reference J2SE, 5th Edition, Tata McGraw Hill, 2007.
2 Jim Keogh: J2EE - The Complete Reference, Tata McGraw Hill, 2007.
 3 Bruce Eckel: Thinking in Java, 3rd Edition, Pearson Education.
4 E. Balagurusamy, Programming with Java, 3rd Edition, McGraw Hill.
Scheme of Semester end Evaluation
The Question paper will consist of FIVE questions in Part – A and THREE questions in Part – B.
Student should answer FIVE full questions selecting THREE questions from Part – A and TWO from
Part – B.

R V COLLEGE OF ENGINEERING, BANGALORE-560059

(Autonomous Institution under VTU, Belgaum)

SUBJECT: DISTRIBUTED COMPUTING

Sub Code: 07 TE 55A3 CIE Marks: 100
Hrs / Week: 4+0+0 Exam: 3 Hrs
Credits: 4 SEE Marks: 100
Objective: The main goal of a distributed computing system is to connect users and resources in a
transparent, open, and scalable way. Ideally this arrangement is drastically more fault tolerant and more
powerful than many combinations of stand-alone computer systems. In this course students will learn
about distributed systems, key features, design goal and design issues involved in the distributed systems
and describe the models of distributed system structure. The course helps in understanding the design of
many different types of distributed computing systems challenges to overcome in successfully designing
one.
PART – A

01 Introduction (04 Hrs)

Distributed Computing Systems, Evolution of Distributed Computing System,
Distributed Computing System Models, Distributed Operating System, Issues in
Designing a Distributed Operating System, Introduction to Distributed Computing
Environment (DCE).
02 Message Passing (07 Hrs)
Desirable Features of a good message passing system, Issues in IPC by Message
Passing, Synchronization, Buffering, Multi datagram Messages, Encoding and
Decoding of Message Data, Process Addressing, Failure Handling, Group
Communication, Case Study: 4.3 BSD UNIX IPC Mechanism.
03 Remote Procedure Calls (08 Hrs)
The RPC Model, Transparency of RPC, Implementing RPC Mechanism, Stub
Generation, RPC Messages, Marshaling Arguments and Results, Server
Management, Parameter - Passing Semantics, Call semantics, Communication
Protocols for RPCs, Complicated RPCs, Client-Server Binding, Exception Handling,
Security, Case Studies: Sun RPC.
04 Distributed Shared Memory (08 Hrs)
General Architecture of DSM Systems, Design and Implementation Issues of DSM,
Granularity, Structure of Shared Memory Space, Consistency Models, Replacement
Strategy, Thrashing, Other approaches to DSM, Heterogeneous DSM, Advantages of
DSM.
05 Synchronization (05 Hrs)
Clock Synchronization, Event Ordering, Mutual Exclusion, Dead Lock, Election
Algorithms.
PART – B
06 Resource Management (06 Hrs)
Desirable Features of a Good Global Scheduling Algorithm, Task Assignment
Approach, Load – Balancing Approach, Load – Sharing Approach.
07 Process Management (04 Hrs)
Process Migration, Desirable features of a good process migration mechanism,
minimal interference, process migration mechanisms, freezing and restarting a
process, Address space transfer mechanism, Process migration in heterogeneous
systems, Threads, models for organizing threads, issues, scheduling.
08 Distributed File Systems (08 Hrs)
Desirable Features of a Good Distributed File System, File models, File–Accessing
Models, File – Sharing Semantics, File – Caching Schemes, File Replication, Fault
Tolerance, Atomic Transactions, Design Principles, Case Study: DCE Distributed
File Service.
Reference Books
1 Pradeep. K. Sinha - “Distributed Operating System: Concepts and Design”, PHI, 2007.
2 Andrew S. Tanenbaum and Maarten VanSteen - “Distributed Systems – Principles and
Paradigms”, 2nd Edition, PHI, 2007.
3 Andrew S. Tanenbaum - “Distributed Operating System”, Pearson Education, 2008.
 4 Ajay D Kshemakalyani, Mukesh Singhal - “Distributed Computing – Principles, Algorithms and
Systems”, Cambridge, 2008.
Scheme of Semester end Evaluation
The Question paper will consist of FIVE questions in Part – A, THREE questions in Part – B.
Student should answer FIVE full questions selecting THREE questions from Part – A, TWO questions
from Part – B.

R V COLLEGE OF ENGINEERING, BANGALORE-560059

(Autonomous Institution under VTU, Belgaum)

SUBJECT: DATABASE MANAGEMENT SYSTEMS

Sub Code: 07 TE 55A4 CIE Marks: 100
Hrs / Week: 4+0+0 Exam: 3 Hrs
Credits: 4 SEE Marks: 100
Objective: The database research in Mobile environment is very much required for mobility
management. This course provides the student with an overview of creating, modifying & managing
data-base for single user & multi-user environment. The topic on ER-model exposes the students to the
concepts of modeling ER-diagram. SQL- Queries, Concurrency control and an exposure to basic normal
forms enable the student to learn creating databases and applications to produce an effective and
efficient system.
PART – A
01 Databases and Database Users (06 Hrs)
Introduction; Characteristics of Database approach; Actors on the Scene; Workers
behind the scene; Advantages of using DBMS approach. Data models, schemas and
instances; Three-schema architecture and data Independence; Database languages
and interfaces; The database system environment; Centralized and client-server
architectures; Classification of Database Management systems.
02 Data Modeling Using the Entity-Relationship Model (06 Hrs)
Using High-Level Conceptual Data Models for Database Design; Entity Types,
Entity Sets, Attributes and Keys; Relationship types, Relationship Sets, Roles and
Structural Constraints; Weak Entity Types; Refining the ER Design; ER Diagrams,
Naming Conventions and Design Issues; Relationship types of degree higher than
two.
03 Database Design (08 Hrs)
Informal Design Guidelines for Relation Schemas; Functional Dependencies;
Normal. Forms Based on Primary Keys; General Definitions of Second and Third
Normal Forms; Boyce-Codd Normal Form. Properties of Relational Decompositions;
Algorithms for Relational Database Schema Design; Multivalued Dependencies and
Fourth Normal Form; Join Dependencies and Fifth Normal Form; Inclusion
Dependencies; Other Dependencies and Normal Forms.
04 Relational Model (08 Hrs)
Relational Model Concepts; Relational Model Constraints and Relational Database
Schemas; Relational Database Design. Update Operations, Transactions, and Dealing
with constraint Violations. Unary Relational Operations: SELECT and PROJECT;
Relational Algebra Operations from Set Theory; Binary Relational Operations: JOIN
and DIVISION; Additional Relational Operations; Examples of Queries in Relational
Algebra, Relational Database Design Using ER- to-Relational Mapping.
PART – B
05 SQL Data definition and data types (10 Hrs)
Specifying basic constraints in SQL; Schema change statements in SQL; Basic
queries in SQL; More complex SQL Queries. Insert, Delete and Update statements in
SQL; Specifying general constraints as Assertion and Trigger; Views (Virtual
Tables) in SQL; Additional features of SQL; Database programming issues and
techniques; Embedded SQL, Dynamic SQL; Database stored procedures and SQL /
PSM.
06 Transaction Management: (10 Hrs)
The ACID Properties; Transactions and Schedules; Concurrent Execution of
Transactions; Lock- Based Concurrency Control; Performance of locking;
Transaction support in SQL; Introduction to crash recovery. 2PL,Serializability and
Recoverability; Introduction to Lock Management; Lock Conversions; Introduction
to ARIES; The log; Other recovery-related structures; The write-ahead log protocol;
Checkpointing; Recovering from a System Crash; Media Recovery; Other
approaches and interaction with concurrency control.
Reference Books:
1 Elmasri and Navathe - Fundamentals of Database Systems, 5th Edition, Addison- Wesley, 2007.
 2 Raghu Ramakrishnan and Johannes Gehrke - Database Management Systems, 3rd Edition,
McGraw-Hill ,2003.
3 Silberschatz, Korth and Sudharshan - Data base System Concepts, 5th Edition, Mc-GrawHill,
2006.
4 C.J. Date, A. Kannan, S. Swamynatham - An Introduction to Database Systems, 8th Edition,
Pearson Education, 2006.
Scheme of Semester end Evaluation:
The Question paper will consist of FIVE questions in Part – A and THREE questions in Part – B.
Student should answer FIVE full questions selecting THREE questions from Part – A and TWO from
Part – B.

R V COLLEGE OF ENGINEERING, BANGALORE-560059

(Autonomous Institution under VTU, Belgaum)
SUBJECT: SYSTEM DESIGN
Sub Code: 07 TE 56 B1 CIE Marks:100
Hrs / Week: 3*+0+2* Exam: 3 Hrs
Credits: 4 SEE Marks: 100
Objective: This subject is introduced to teach a student how to design any electronic system. Starting
from the basic concept to implementation is what this subject teaches. Documentation is an important part
of any product which is also dealt here. The design and design testing using specified tools is introduced.
The verification of design against various practical odds has also been introduced. After completing this
course a student should be able to design circuits and systems on his own and also implement the same.
PART-A
01 Introduction to various system parameters in analog, digital and mixed mode systems. (06 Hrs)
Need of specifications, constraints- Transient, AC, Stability, power, Size, cost, Tools,
Design Economics, Data Sheets. Need for Documentation.
02 Arriving at System Concept, Requirements, Specifications, Design and development, (08 Hrs)
Failure considerations, noise, Thermal design and Power supply management.
03 Digital Modeling Constructs: Entity Declaration, Architecture, Digital behavior, Port (04 Hrs)
mapping.
04 Analog Modeling Constructs: Free Quantities, Terminals and branches, Simultaneous (08 Hrs)
statements, Analog structural description, step limit specifications.

PART-B
05 Mixed Signal Design: Mixed signal description, Analog to digital and Digital to analog (06 Hrs)
conversion, Mixed technology description, Design Processing.

06 Case study: To take a project involving Digitization, encoding, decoding, analog (06 Hrs)
conversion and design, simulate and synthesize. Design tradeoff Analysis.

07 R.F. design limitations and procedures. (04 Hrs)

Reference Books
1 Kim R.Flower, “Electronic Instrument Design- Architecting for the Life Cycle”, Oxford university
press, 2004.
2 Peter J. Ashenden et.al. “The system Designer’s guide to VHDL-AMS”, Morgan Kaufmann
Publishers, 2005.

Scheme of Semester end Evaluation

The Question paper will consist of FIVE questions in Part – A, THREE questions in Part – B.
Student should answer FIVE full questions selecting THREE questions from Part – A, TWO questions
from Part – B.

R V COLLEGE OF ENGINEERING, BANGALORE-560059

(Autonomous Institution under VTU, Belgaum)
 SUBJECT: LINEAR ALGEBRA
Sub Code: 07TC56 B2 CIE Marks: 100
Hrs / Week: 3*+2*+0 Exam: 3 Hrs
Credits: 4 SEE Marks: 100
Objective: For most of the engineering subjects this course will be very helpful. The students are
thought linear equations, vector space, transformations and matrices which are used to derive
equations for models in communication and coding
PART – A
01 Linear equations (07 Hrs)
Fields, system of linear equations, and its solutions Sets, elementary row
operations and echelon forms, matrix operations invertible matrices, LU
factorizations.
02 Vector spaces (05 Hrs)
Vector spaces, sub spaces bases and dimension, Co-ordinates, summary of row
equivalence, computations concerning subspaces.
03 Linear Transformations (07 Hrs)
Linear transformations, algebra of linear transformation, isomorphism,
representations of transformations by matrices, linear functional, transpose of a
linear transformation.
04 Canonical Forms (08 Hrs)
Characteristics Values, annihilating polynomials, invariant direct sums, primary
decomposition theorem, cyclic basis, Jordan canonical forms, Iterative Estimates
of characteristic values.
PART- B
05 Inner product spaces (08 Hrs)
Inner products, inner product spaces, orthogonal sets and projections, Gram
Schmidt process, QR-factorization, Least-Square problems, unitary operators.
06 Symmetric Matrices and Quadratic forms (07 Hrs)
Diagonalisation, Quadratic forms, constrained optimization Singular value
decomposition (SVD).
Reference Books:
1 Kenneth Hoffman and Ray Kunze,”Linear Algebra” 2nd edition, Pearson Education (Asia) Pvt
Ltd/ Prentice Hall of India, 2004.
2 David C Lay, “Linear Algebra and its Applications”, 3rd Edition, Pearson Education(Asia)Pvt
Ltd 2005.
3 Gilbert Strang, “Linear Algebra and its Applications”, 3rd Edition, Thomson Learning Asia,
2003
4 Bernard Kolman and David R Hill , “ Introductory Linear algebra with applications, Pearson
Education(Asia) Pvt Ltd, 7th edition , 2003.
Scheme of Semester end Evaluation:
The Question paper will consist of FIVE questions in Part – A and THREE questions in
Part–B. Student should answer FIVE full questions selecting THREE questions from Part–A
and TWO questions from Part – B.

R V COLLEGE OF ENGINEERING, BANGALORE-560059

(Autonomous Institution under VTU, Belgaum)
 SUBJECT: RANDOM PROCESS
Sub Code: 07 TE 56 B3 CIE Marks:100
Hrs / Week: 3*+2*+0 Exam: 3 Hrs
Credits: 4 SEE Marks: 100
Objective: This subject is introduced to study the models for random message signals and noise
encountered in communication systems. As the random signals cannot be explicitly described prior to
their occurrence and noises cannot be described by deterministic functions of time, hence a random signal
or noise may exhibit certain regularities that can be described in terms of probabilities and statistical
averages. The student is taught to estimate noise and interference which is very much required to design a
communication system.
PART – A
01 Review of Probability Theory (02 Hrs)
Axiomatic approach, Properties of probability, Joint and Conditional probabilities,
Total probability and Bayes’ theorem, Independent events.
02 Review of Random Variable theory (08 Hrs)
Concept of a Random variable, Distribution function, Discrete and Continuous random
variables, Density and Mass functions, The Gaussian Random variable, Other RV’s –
Uniform, Exponential and Rayleigh. Binomial, Poisson and Geometric distributions;
other characterizations – Expectation operation, Moments, Central moments, Variance
and Skew; Chebychev’s Inequality, Characteristic function and Moment generating
function, Transformations of an RV.
03 Multiple Random Variables (08 Hrs)
Joint distribution and Joint density functions, Properties, Conditional distribution and
density – Point conditioning, Statistical Independence, Distribution and density of a
sum of RV’s, Central Limit theorem, Joint moments, Joint central moments, Joint
characteristic functions, Jointly Gaussian random variables, Sampling and some limit
theorems – Sampling and estimation, Estimation of Mean, power and Variance, Weak
law of large numbers, Strong law of large numbers.
04 Random Processes (08 Hrs)
Concept and classifications, Stationarity and Independence – Distribution and Density
functions, Statistical independence, First order stationary process, Second - Order and
Wide Sense Stationarity, Strict Sense Stationarity, Time averages and Ergodicity, Auto
correlation function(ACF) and Cross Correlation Functions(CCF) and their properties,
Covariance functions, Mean Ergodic and Correlation Ergodic processes, Discrete Time
Processes and Sequences, Gaussian and Poisson Random processes.
PART – B
05 Spectral Characterization of Random Processes (06 Hrs)
Introduction, Power Density Spectrum(PSD) and its properties, Relation between PSD
and ACF, Cross Power Density Spectrum(CPSD) and its properties, Power Spectrum
for Discrete – Time Processes and/ Sequences.
06 Linear Systems with Random Inputs (06 Hrs)
Random signal response of linear systems – system response, Convolution, Mean and
Mean squared value, ACF, CCF of I/P and O/P; System evaluation using random
noise, Spectral characteristics of system response – PSD, CPSD of I/P and O/P; Noise
Band Width; Band Pass, Band Limited and Narrow Band Processes.
07 Optimum Linear Systems (02 Hrs)
Matched filters for Colored noise and White noise, Wiener Filters.
08 Some Practical Applications (02 Hrs)
Noise in AM and FM communication Systems, Noise in PLL, Radar detection using a
single observation.
Reference Books:
1 Peyton Z. Peebles, Jr; “Probability, Random Variables and Random Signal Principles”, Tata
McGraw-Hill, 4th Edition, 2007.
2 Eugene Xavier, S. P., “Probability Theory and Random Processes”, S. Chand & Company LTD,
Ram Nagar, New Delhi – 110 055, 1997.
3 Gardner, W.A., “Introduction to Random Processes with Applications to Signals and Systems”,
McGraw-Hill, 2nd Edition,1990.
4 Shanmugam, K. S. and A. M. Breipohl, “Random Signals: Detection, Estimation and Data
Analysis”, Wiley, 1998.
Scheme of Semester end Evaluation:
The Question paper will consist of FIVE questions in Part – A and THREE questions in Part–B. Student
should answer FIVE full questions selecting THREE questions from Part–A and TWO questions from
Part – B.

R V COLLEGE OF ENGINEERING, BANGALORE-560059

(Autonomous Institution under VTU, Belgaum)
 SUBJECT: MODERN CONTROL SYSTEMS
Sub Code: 07TC56B4 CIE Marks: 100
Hrs / Week:3*+0+2* Exam: 3 Hrs
Credits: 4 SEE Marks: 100
Objective: For students who want to design control and telecommand for a system this subject will
be essential. The student will learn about discrete control systems and application of state variable
techniques. The various system characters such as Controllability, Observability and Stability are
discussed. The subject deals with digital control in both space and time domain. The student is also
introduced to Non-linear systems.
PART_A
01 State variable description of linear Continuous data systems (06 Hrs)
State space representation of Continuous time control systems, Physical
variables and representation of electrical, mechanical and electromechanical
systems,Phase variable canonical form, Observability form, Normal or
diagonal form, Jordan canonical form, State variable representation from
transfer functions in different canonical forms.
02 Solution of state equations (06 Hrs)
Concept of state transition matrix, computation of state transition matrix by
i) series expansion method, ii) Laplace transform approach and iii) Cayley
Hamilton theorem; Solution of state equations by different methods, Input
imbedding, Transfer functions from state space representations.
03 Controllability and Observability (06 Hrs)
State variable equations of composite systems; effect of pole zero
cancellation; subsystems of composite systems, controllability and
observability, transformation to the phase variable canonical form, Methods
of assessing controllability and observability.
04 Design of control system by state space methods (06 Hrs)
Control system design via pole placement techniques, Design of state
observer (full order and reduced order observer); state representation of the
system with controller and observer, Effects of addition of observer on a
closed loop system.
05 Digital Control Systems (06 Hrs)
Review of difference equations and Z — transforms, Z – transfer function
(Pulse transfer function), Block diagram reduction, Z – Transform analysis of
sampled data systems, Stability analysis (Jury’s Stability Test and Bilinear
Transformation).
PART_B
06 State space analysis and design of discrete time systems (06 Hrs)
State space representation of discrete –time systems in different canonical
forms, solving discrete time state equations, the pulse transfer function
matrix, discretisation of continuous time state space equations, controllability
and observability, design via pole placement, design of state observer - Full
order and reduced order observes, Dead beat control by state feedback, effect
of observers on stability.

07 Nonlinear systems (06 Hrs)

Introduction, Common nonlinearities, Phase plane method – Singular points,
Stability of nonlinear systems, limit cycles, Construction of Phase trajectories.
 08 Stability analysis (06 Hrs)
Concepts, Liapunov function, direct method of Liapunov, Liapunov’s second
method, Construction of Liapunov functions using Krasovkii’s method and
stability analysis.

NOTE: To use MATLAB control system toolbox for better

understanding of subject.

Reference Books:
1 K. Ogata, “Modern Control Engineering” PHI, 2004.
2 Nagarath and Gopal,” Control Systems Engineering”, New Age International Pvt Ltd,
2007.
3 Ogata K “Discrete time Control Systems”, Pearson Education, 2004.
4 Satyanarayana, P.S., “Concepts of Control Systems”,Dynaram,Bangalore,2001.

Scheme of Semester end Evaluation:

The Question paper will consist of FIVE questions in Part – A and THREE questions in Part–B.
Student should answer FIVE full questions selecting THREE questions from Part–A and TWO
questions from Part – B.