UIT-RGPV (Autonomous) Bhopal

Subject code-CS-401 Subject : Mathematics III

Semester : IV

For credits & marks refer your scheme

Course Objectives:
The objective of the course is to familiarize the engineering students with techniques of Fourier
expansion, transform techniques, numerical computations, and their applications in engineering
sciences. It aims to equip the students to deal with advanced level of mathematics and applications that
would be essential for their disciplines.

Course Out comes : At the end of the course student will be able to

CO-1.Todevelopa sound understanding of calculus of vectors and their geometrical as well as physical
applications
CO-2. To develop the knowledge of finding approximate solutions of algebraic as well as simultaneous
linear equations.
CO-3.Tomakestudentsfamiliar with art of interpolation and quadrate re-based interpolation methods.
CO-4.Tofindexpansion of functions in a series of sine and cosine and their application in various
disciplines.
CO-5. The effective use of Laplace transform methods to solve variety of differential equations
appearing in applied sciences Partial differential equations very useful to solve various boundary value
problems.

COURSE CONTENTS:

Unit- I
Vector Calculus: Differentiation of vectors, scalar and vector point function, Gradient, Geometrical
meaning of gradient, Directional derivative, Divergence and curl, Physical interpretation of divergence
and curl. Line integral, Surface integral and Volume integral, Stoke’s theorem (Green’s, theorem as a
special case) and Gauss divergence theorem.

Unit- II
Solution of Algebraic and Transcendental Equations : Bisection method. Iteration methods based on
first degree equation: Secant method, Method of false position, Newton-Raphson method. System of
Simultaneous linear equations: Gauss elimination method, Gauss Jordan’s Method, Crout’s Method,
Jacobi’s method and Gauss-Seidal method.

Unit- III
Interpolation : Difference Operators, Interpolation formulae for equally and unequally spaced in
tervals. Numerical Integration: Trapezoidal, Simpsons 1/3, Simpsons 3/8 and Weddle’s formulae.

Unit- IV
Fourier Series: Euler’s formula, Fourier series for discontinuous functions, Expansion of odd and even
periodic functions, Half range series. Introduction to Fourier Transform
Unit- V
Laplace Transform: Introduction of Laplace transform, Laplace transform of elementary functions,
Properties of Laplace transform, change of scale property, First and second shifting properties, Laplace
transform of derivative and integral. Inverse Laplace transform & its properties, Convolution theorem,
Applications of Laplace transforms to solve the ordinary differential equations.

Books Recommended:
1. B.S.Grewal, Higher Engineering Mathematics, Khanna Publishers.
2. M.K.Jain, Iyengar,R.K.Jain, Numerical Methods for Scientific and Engineering Computation,
New Age International Publishers.
3. B.V.Rammana, Higher Engineering Mathematics, Tata McGraw Hill New Delhi.
4. B.S.Grewal,Numerical Methods in Engineering and Science, Khanna Publishers.
5. E.Kreyzig, Advanced Engineering Mathematics, 9th Edition, John Wiley & Sons.
 UIT-RGPV (Autonomous) Bhopal

Subject code-CS-402 Subject: Analysis & Design of Algorithm

Semester: IV
For credits & marks refer your scheme

Course Out comes : At the end of the course student will be able to

CO1 Design and analyze algorithms, Asymptotic notations, Divide and Conquer Technique
CO2 Study of Greedy Strategy and its applications, Huffman coding, minimum spanning trees.
CO3 Study of Dynamic Programming and its applications , Floyd-Warshall algorithm.
CO4 Study of Backtracking, Branch and Bound Technique , introduction to parallel algorithms.
Understand the concept of Binary Search Tree, B- Tree, Height balanced tree, Searching and
CO5
Traversal Techniques

Course Objective : Student will be able to learn algorithm designing, various problem-solving
strategies like divide and conquer approach, Greedy strategy, Dynamic Programming, Backtracking
etc.

COURSE CONTENTS:

Unit- I
Algorithms, designing algorithms, analyzing algorithms, asymptotic notations, heap and heap sort.
Introduction to divide and conquer technique, analysis, design and comparison of various algorithms
based on this technique, example binary search, merge sort, quicksort, Strassen’s matrix multiplication.

Unit- II
Study of Greedy strategy, examples of greedy method like optimal merge patterns, Huffman coding,
minimum spanning trees, knapsack problem, job sequencing with deadlines, single source shortest path
algorithm

Unit- III
Concept of dynamic programming, problems based on this approach such as 0/1 knapsack, multistage
graph, reliability design, Floyd-War shall algorithm

Unit- IV
Backtracking concept and its examples like 8 queen’s problem, Hamiltonian cycle, Graph coloring
problem etc., Introduction to branch & bound method, examples of branch and bound method like
traveling salesman problem, etc. Meaning of lower bound theory and its use in solving algebraic
problem, introduction to parallel algorithms.

Unit- V
Binary search trees, height balanced trees, 2-3 trees, B-trees, basic search and traversal techniques for
trees and graphs (In order, preorder, post order, DFS, BFS), NP-completeness.
References:

1.Coremen Thomas, Leiserson CE, Rivest RL; Introduction to Algorithms; PHI.

2. Horowitz & Sahani; Analysis & Design of Algorithm
3. Das gupta; algorithms; TMH
4. Ullmann; Analysis & Design of Algorithm;
5. Michael T Goodrich, Robar to Tamassia, Algorithm Design,Wiely India

List of Experiments (expandable):

1. Write a program for Iterative and Recursive Binary Search.

2. Write a program for Merge Sort.
3. Write a program for Quick Sort.
4. Write a program for Strassen’s Matrix Multiplication.
5. Write a program for optimal merge patterns.
6. Write a program for Huffman coding.
7. Write a program for minimum spanning trees using Kruskal’ s algorithm.
8. Write a program for minimum spanning trees using Prim’ s algorithm.
9. Write a program for single sources shortest path algorithm.
10. Write a program for Floyd -Warshal algorithm.
11. Write a program for traveling salesman problem.
 UIT-RGPV (Autonomous) Bhopal

Subject code-CS-404 Subject: Theory of Computation

Semester : IV

For credits & marks refer your scheme

Course Objective: The purpose of this subject is to cover the underlying concepts and techniques
used in Theory of Computation. In this syllabus we cover finite automata, pushdown automata,
Context free grammars and Turing machines.

Course Out comes : At the end of the course student will be able to
CO1 Outline the concept to Finite Automata and Regular Expression.
CO2 Illustrate the design of Context Free Grammar for any language set.
CO3 Demonstrate the push down automaton model for the given language.
CO4 Make use of Turing machine concept to solve the simple problems.
CO5 Explain decidability or decidability of various problems.

COURSE CONTENTS:

UNIT-I
Automata: Basic machine, FSM , Transition graph, Transition matrix, Deterministic and
nondeterministic FSM’S, Equivalence of DFA and NDFA, Mealy & Moore machines, minimization of
finite automata, Two-way finite automata. Regular Sets and Regular Grammars: Alphabet, words,
Operations, Regular sets, Finite automata and regular expression, My hill- Nerode theorem Pumping
lemma and regular sets, Application of pumping lemma, closure properties of regular sets.

UNIT-II
Context –Free Grammars: Introduction to CFG, Regular Grammars, Derivation trees and Ambiguity,
Simplification of Context free grammars, Normal Forms (Chomsky Normal Form and Greibach
Normal forms).

UNIT-III
Pushdown Automata: Definition of PDA, Deterministic Pushdown Automata, PDA corresponding to
given CFG, CFG corresponding to a given PDA. Context Free Languages: The pumping lemma for
CFL’s, Closure properties of CFL’s, Decision problems involving CFL’s.

UNIT-IV
Turing Machines: Introduction, TM model, representation and languages acceptability of TM Design of
TM, Universal TM & Other modification, Church’s hypothesis, composite & iterated TM. Turing
machine as enumerators. Properties of recursive & recursively enumerable languages, Universal Turing
machine

UNIT-V
Tractable and Untraceable Problems: P, NP, NP complete and NP hard problems, examples of these
problems like satisfy ability problems, vertex cover problem, Hamiltonian path problem, traveling
sales man problem, Partition problem etc.
References:-
1. John E. Hopcroft, Jeffery Ullman,”Introduction to Automata theory, Langauges & computation” , Narosa
Publishers.
2. K.L.P Mishra & N.Chandrasekaran,“Theory of Computer Science”, PHI Learning
3. Michael Sipsev,“Theory of Computation”,Cenage Learning
4. John C Martin, “ Introdution to languages and theory of computation”, McGraw Hill
5. Daniel I.A. Cohen,“ Introduction to Computer Theory”, Wiley India.
6. Kohavi,”Switching & Finite Automata Theory”, TMH
 UIT-RGPV (Autonomous) Bhopal

Subject code-CS-405 Subject: Analog & Digital Communication

Semester : IV
For credits & marks refer your scheme

Course Objective: To familiarize students with the fundamentals of analog and digital communication
systemsandprovidestudentswithtoolsforcommunicationsignalanalysis.Thestudentsfamiliarizewith
various techniques for amplitude modulation and demodulation of analog signals

Course Out comes : At the end of the course student will be able to
CO1 Understand the fundamentals of signals and the properties.
Analyze the analog communication systems using amplitude and angle modulation
CO2
techniques.
CO3 Analyze various modulation techniques for pulse transmission.
CO4 Analyze the under lying concepts of various signal sampling techniques.
CO5 Compare various digital modulation techniques

COURSE CONTENTS:

Unit-I
Time domain and frequency domain representation of signal, Fourier Transform and its properties,
Transform of Gate, Periodic gate, Impulse periodic impulse sine and cosine wave, Concept of energy
density and power density (Parseval’s theorem), Power density of periodic gate and impulse function,
impulse response of a system, convolutions, convolution with impulse function, causal and non causal
system impulse response of ideal low pass filter, Correlation & Auto correlation.

Unit-II
Base band signal, need of modulation, Introduction of modulations techniques, Amplitude modulation,
Equation and its frequency domain representation, Bandwidth, Power distribution. AM suppressed
carrier waveform equation and frequency domain representation Generation (Balance/Chopper
modulator) and synchronous detection technique, errors in synchronous detection, Introduction to SSB
and VSB Transmission Angle modulation, Frequency and phase modulation equation and their relative
phase and frequency deviations, modulation index frequency spectrum, NBFM and WBFM,B and
width comparison of modulation techniques.

Unit-III
Sampling of signal, sampling theorem for low pass and Band pass signal, Pulse amplitude modulation
(PAM), Time division, multiplexing (TDM). Channel Bandwidth for PAM-TDM signal Type of
sampling instantaneous, Natural and flat top, Aperture effect, Introduction to pulse position and pulse
duration modulations,Digitalsignal,Quantization,Quantizationerror,Pulsecodemodulation,signalto noise
ratio, Companding, Data rate and Baud rate, Bit rate, multiplexed PCM signal, Differential PCM
(DPCM), Delta Modulation (DM) and Adaptive Delta Modulation (ADM), comparison of various
systems.
Unit-IV
Digital modulations techniques, Generation, detection, equation and Bandwidth of amplitude shift keying
(ASK) Binary Phase Shift keying (BPSK), Differential phase shift keying (DPSK), offset and non
offset quadrature phase shift keying (QPSK), M-AryPSK, Binary frequency Shift Keying(BFSK),M-FSK
Quadrature Amplitude modulation (QAM), MODEM, Introduction to probability of error.

Unit-V
Information theory and coding- Information, entropies (Marginal and conditional), Model of a
communication system, Mathematical representation of source, channel and receiver characteristics,
Mutual information, channel capacity efficiency of noise free channel Binary symmetric channel (BSC)
Binary erasure channel (BEC), Repetition of signal, NM symmetric Binary channel, Shannon theorem,
Shanon-Hartley theorem (S/N-BW trade off) Source encoding code properties; Shan on, Fano and
Huffman coding methods and their efficiency error control coding, Minimum Hamming distance,
Linear Block Code, Cyclic code and convolution codes. Line Encoding: Manchester coding, RZ, NRZ
coding.

References:
1. Singh & Sapre, Communication System, TMH
2. Taub & shilling, Communication System, TMH
3. Hsu; Analog and digital communication (Schaum); TMH
4. B.P. Lathi, Modern Digital and analog communication system,
5. Simon Haykins, Communication System. John Willy
6. Wayne Tomasi, Electronic Communication system.
7. Martin S. Roden, Analog & Digital Communication System; Discovery Press.
8. Frank R. Dungan, Electronic Communication System, Thomson/Vikas.

List of Experiments (Expandable)

1. Study of sampling process and signal reconstruction and aliasing.
2. Study of PAMPPM and PDM
3. Study of PCM transmitter and receiver.
4. Time division multiplexing (TDM) and De-multiplexing
5. Study of ASKPSK and FSK transmitter and receiver.
6. Study of AM modulation and Demodulation techniques (Transmitter and Receiver) Calculate of
7. Study of FM modulation and demodulation(Transmitter and Receiver)& Calculation of parameters
8. To construct and verify pre-emphasis and de-emphasis and plot the waveforms.
9. Study of super heterodyne receiver and characteristics of ratio radio receiver.
10. To construct frequency multiplier circuit and to observe the waveform
11. Study of AVC and AFC.
 UIT-RGPV (Autonomous) Bhopal

Subject code-CS-408 Subject : Microprocessor & Interfacing

Semester : IV

For credits & marks refer your scheme

Course Objective- The purpose of this subject is to cover the underlying concepts and techniques used in
Microprocessor and Interfacing. In this subject we cover the unique issues associated with designing, testing,
integrating, and implementing microcontroller/microprocessor-based embedded systems.

Course Out comes : At the end of the course student will be able to
CO-1 Student is able to describe the architecture and different modes of operations of a typical
microprocessor.
CO-2 Student is able to understand different addressing modes and instructions of 8086, design
and develop assembly language programs using software interrupts, subroutines, macros
CO-3 Student is able to interface memory, I/O devises and interrupt controller with 8086
microprocessors.
CO-4 Student is able to do memory interfacing using 8085/8086/8253/DMA8257/8279/8080I/O
Processor
CO-5 Student is able to design and develop assembly language programs using 8051
microcontroller

COURSE CONTENTS:

Unit-I
Microprocessor and Microprocessor Development Systems: Evolution of Microprocessor,
Microprocessor architecture and its operations, memory, inputs-outputs (I/Os), data transfer schemes
interfacing devices, Architecture advancements of microprocessors, Typical microprocessor
development system.

Unit-II
8085 Microprocessor: Architectures of 8085 microprocessor ,Instruction set and Adressing modes of
8085microprocessor,Assembly language programs of 8085 microprocessor, Stack, Subroutines, Time-
Delay loops, Modular programming, Macro .

Unit-III
8086 Microprocessor: Architecture, Registers, Memory Segmentation, 8086 Memory Addressing,
Memory Read and Write Bus Cycle of 8086,Demultiplexing of the system Bus in 8086 and 8088
microprocessors, Instruction set and Addressing modes of 8086 microprocessor, Assembly language
programs of 8086miroprocessor.

Unit-IV
I/O and Memory Interfacing Using 8085/8086: memory interfacing, Interrupts of 8085/8086
Microprocessors, 8259A Programmable Interrupt Controller, Programmable peripheral Interface, 8253
Programmable Counter/Interval Timer. Communication and Bus Interfacing with 8085/8086
Microprocessor: Serial Communication Interface, DMA Controller 8257, 8279-Programmable
Keyboard and Display I/O Interface, BusInterface,8089 I/O processor
Unit-V
8051 Microcontroller: Architecture of 8051 microcontroller, Memory organization, Timers/Counters,
Interrupts, addressing modes, 8051 Instruction set, Assembly language Programs, Applications of
microcontrollers.

References:
1. Douglas V Hall, “Microprocessors and interfacing–Programming & Hardware” TMH
2. Gaonkar, “Microprocessor Architecture, Programming & Applications with 8085”,
TMH Grading System 2013 - 14
3. Rafiquzzaman, “Microprocessors-Theory & Applications”, PHI
4. Savaliya,“8086 Programming & Advance Processor Architecture”, Wiley India
5. Ray, Bhurchandi, “Advanced Microprocessor and peripherals” TMH Pub
6. Soumitra Kumar Mandal, “Microprocessors and Microcontroller” TMH Pub
 UIT-RGPV (Autonomous) Bhopal

Subject code-CS-406 Subject : Programming Lab–II (.Net Technologies)

Semester : IV
For credits & marks refer your scheme

Course Objective: To introduce and understand students to programming concepts and techniques
using the C# language in .NET frame work .

Course Out comes : At the end of the course student will be able to

CO1 Gain Proficiency in .NET Framework Development and its Practical Application.

C02 Demonstrate Proficiency in Advanced C# Programming Concepts.

C03 Master the Art of ASP.NET and Windows Forms Development.

C04 Proficiently Manage Control Events, ADO.NET, and Database Controls.

C05 Mastering Advanced Web Technologies: XML, Navigation Controls, JavaScript, and Web Services.

COURSE CONTENT:

UNIT-I
Introduction. NET framework, features of Net frame work, architecture and component to f.Net,
elements of .Net.

UNIT-II
Basic Features Of C# Fundamentals, Classes and Objects, Inheritance and Polymorphism, Operator
Overloading, Structures. Advanced Features Of C# Interfaces, Arrays, Indexers and Collections;
Strings and Regular Expressions, Handling Exceptions, Delegates and Events.

UNIT-III
Installing ASP.NET framework, overview of the ASP .net framework, overview of CLR, class library,
overview of ASP.net control, understanding HTML controls, study of standard controls, validations
controls, rich controls. Windows Forms: All about windows form, MDI form, creating windows
applications, adding controls to forms, handling Events, and using various Tolls

UNIT-IV
Understanding and handling controls events, ADO.NET- Component object model, ODBC,
OLEDB, and SQL connected mode, disconnected mode, dataset, data-reader Data base controls:
Overview of data access data control, using grid view controls, using details view and frame view
controls, ado.net data readers, SQL data source control, object data source control, sitemap data source.
UNIT-V
XML: Introducing XML, Structure, and syntax of XML, document type definition (DTD), XML
Schema, Document object model, Presenting and Handling XML. xml data source, using navigation
controls, introduction of web parts, using java script, Web Services
References:
1. C# for Programmers by Harvey Deitel, Paul Deitel, Pearson Education
2. Balagurusamy; Programming in C#; TMH
3. Web Commerce Technology Hand book by Daniel Minoli, Emma Minoli, TMH
4. Web Programming by Chris Bates, Wiley
5. XML Bible by Elliotte Rusty Harold,
6. ASP. Net Complete Reference by Mc Donald, TMH.
7. ADO. Net Complete Reference by Odey, TMH

List of Experiments/program (Expandable):

1. Working with call backs and delegates in C#
2. Code access security with C#.
3. Creating a COM+ component with C#.
4. Creating a Windows Service with C#
5. Interacting with a Windows Service with C#
6. Using Reflection in C#
7. Sending Mail and SMTP Mail and C#
8. Perform String Manipulation with the String Builder and String Classes and C#:
9. Using the System. Net Web Client to Retrieve or Upload Data with C#
10. Reading and Writing XML Documents with the XML Text-Reader/-Writer Class and C#
11. Working with Page using ASP.Net.
 UIT-RGPV (Autonomous) Bhopal

Subject code-CS-407 Subject : Network & Communication Workshop

Semester : IV
For credits & marks refer your scheme

Course Objective: To introduce and understand students various peripheral devices and
networking devices, various memories, cable and connectors with PC troubleshooting techniques.

Course Out comes : At the end of the course student will be able to
C01 Demonstrate various input devices and their uses.
C02 Demonstrate various output devices and their uses.
C03 Demonstrate and ability to identify various network devices for applying various
communication applications.
C04 Demonstrate and ability to conduct investigation of various ports and their technical issues.
C05 Troubleshooting of various hardware issues.

COURSE CONTENTS:

UNIT–I
Peripheral Device – 1 Input Devices: Keyboard; Principle of Operation, Interface Logic, Function and
its type, Pointing Device: Touch Screen, Mouse: Principle of Operation, Function and its Types. Video
Input device: Introduction, Operation and Function of Digital Camera, Webcam, Image Scanner,
Fingerprint Scanner, Barcode Reader, 3D Scanner. Audio Input Devices: Microphone, Game
Controller.

UNIT–II
Peripheral Device – 2 Output Device: Principle Operation and Function of Monitor ( CRT, TFT, LCD,
LED and Plasma Display), Printer ( Dot matrix, Plotter, Laser, Ink Jet), Speaker, Head phone.

UNIT–III
Major Component, Connector, Ports etc. Major Component: CPU, Mother Board. Memory: RAM
DRAM, SDRAM, DDRSDRAM, ROM and its type, HARDDISK, SMPS, LANCARD, CMOS
BATTRY, Coolent (Fans, Heat Sink), Graphic Card, and Sound Card. Blue – Ray Disk, Pen drive or
USB Flash drive Data traveler.

UNIT–IV
Connectors: Unshielded Twisted pair (UTP) Cable Connectors: RJ-45, RJ-12, UHF, D-shell connector
DB9,Insulation Displacement Connector (IDCs), ”Jones” or “Cinch-Jones” connector. Shielded
Twisted Pair Cable Connectors, Coaxial Cable Connectors: BNC Connector, Audio, Video, Digital, RF
connector, RCA, TNC, Type-N connectors T-connector, Barrel Connector, Fiber Optic Cable, Single
mode and multi mode connector, HDMI, VGA, F- Connector. Ports: Ethernet, Fire wire (IEEE1394),
Parallel Port, Serial Port, Thunderbolt, Universal Serial Bus (USB), RS-232, RS485, RS422.
UNIT–V
PC TROUBLESHOOTING: Definition, Need and major Steps of PC Troubleshooting. Basic Hardware
Troubleshooting: Drive Troubleshooting. Troubleshooting, Benefits of Troubleshooting.
Troubleshooting of Motherboard (Possible Problems, Diagnosis Procedure and Troubleshooting),
Troubleshooting key board, Troubleshooting of Printer (Possible Problems, Diagnosis Procedure and
Troubleshooting).

List of Experiments:-
1. Testing internal working of Different types of Mouse.
2. Testing internal working of Keyboard.
3. Identifying and verifying internal working of CRT,TFT.
4. Troubleshooting of Printers.
5. Troubleshooting of Motherboard.

Reference Book:
1. Computer installation and servicing, D. Balsubramanian, TATA McGraw Hill Publication, Second
Edition.
2. Troubleshooting, Maintaining and repairing PCs, Stephon J Bigelow TATA Mc Graw Hill Publication.
3. Introduction to computers, Peter Norton, Mc Graw Hill Publication, 7th Edition.