RAJIV GANDHI PROUDYOGIKI VISHWAVIDYALAYA, BHOPAL

New Scheme Based On AICTE Flexible Curricula

Computer Science & Information Technology, IV-Semester

BT401 Mathematics-III 3L-1T-0P 4 Credits

OBJECTIVES: The objective of this course is to fulfill the needs of engineers to understand
applications of Numerical Analysis, Transform Calculus and Statistical techniques in order to
acquire mathematical knowledge and to solving wide range of practical problems appearing in
different sections of science and engineering. More precisely, the objectives are:
 To introduce effective mathematical tools for the Numerical Solutions algebraic and
transcendental equations.
 To enable young technocrats to acquire mathematical knowledge to understand Laplace
transformation, Inverse Laplace transformation and Fourier Transform which are used in
various branches of engineering.
 To acquaint the student with mathematical tools available in Statistics needed in various
field of science and engineering.
Module 1: Numerical Methods – 1: (8 hours): Solution of polynomial and transcendental
equations – Bisection method, Newton-Raphson method and Regula-Falsi method. Finite
differences, Relation between operators, Interpolation using Newton’s forward and backward
difference formulae. Interpolation with unequal intervals: Newton’s divided difference and
Lagrange’s formulae.
Module 2: Numerical Methods – 2: (6 hours): Numerical Differentiation, Numerical integration:
Trapezoidal rule and Simpson’s 1/3rd and 3/8 rules. Solution of Simultaneous Linear Algebraic
Equations by Gauss’s Elimination, Gauss’s Jordan, Crout’s methods, Jacobi’s, Gauss-Seidal, and
Relaxation method.,
Module 3: Numerical Methods – 3: (10 hours): Ordinary differential equations: Taylor’s series,
Euler and modified Euler’s methods. RungeKutta method of fourth order for solving first and
second order equations. Milne’s and Adam’s predicator-corrector methods. Partial differential
equations: Finite difference solution two dimensional Laplace equation and Poission equation,
Implicit and explicit methods for one dimensional heat equation (Bender-Schmidt and Crank-
Nicholson methods), Finite difference explicit method for wave equation.
Module 4: Transform Calculus: (8 hours): Laplace Transform, Properties of Laplace Transform,
Laplace transform of periodic functions. Finding inverse Laplace transform by different methods,
convolution theorem. Evaluation of integrals by Laplace transform, solving ODEs by Laplace
Transform method, Fourier transforms.
Module 5: Concept of Probability: (8 hours): Probability Mass function, Probability Density
Function, Discrete Distribution: Binomial, Poisson’s, Continuous Distribution: Normal
Distribution, Exponential Distribution.
Textbooks/References:
1. P. Kandasamy, K. Thilagavathy, K. Gunavathi, Numerical Methods, S. Chand & Company, 2nd
Edition, Reprint 2012.
2. S.S. Sastry, Introductory methods of numerical analysis, PHI, 4th Edition, 2005.
3. Erwin kreyszig, Advanced Engineering Mathematics, 9th Edition, John Wiley & Sons, 2006.
4. B.S. Grewal, Higher Engineering Mathematics, Khanna Publishers, 35th Edition, 2010.
5. N.P. Bali and Manish Goyal, A text book of Engineering Mathematics, Laxmi Publications,
Reprint, 2010.
6. Veerarajan T., Engineering Mathematics, Tata McGraw-Hill, New Delhi, 2008.
7. P. G. Hoel, S. C. Port and C. J. Stone, Introduction to Probability Theory, Universal Book Stall,
2003 (Reprint).
8. S. Ross, A First Course in Probability, 6th Ed., Pearson Education India, 2002.
9. W. Feller, An Introduction to Probability Theory and its Applications, Vol. 1, 3rd Ed., Wiley,
1968. Statistics
 RAJIV GANDHI PROUDYOGIKI VISHWAVIDYALAYA, BHOPAL

New Scheme Based On AICTE Flexible Curricula

Computer Science & Information Technology, IV-Semester

CSIT 402 Analog & Digital Communication

Course Objectives
The study of communication systems starts with the concept of analog communication. In this
course time and frequency representation of information is given. The objective of this course is to
be familiar with the basic building blocks of communication systems such as modulator and
demodulator. Different types of analog modulation techniques are given in this course.
Unit-I Signals and Systems: Block diagram of a communication system, signal-definition, types of
signals continuous, discrete, deterministic, non-deterministic, periodic, non-periodic, energy,
power, analog and digital signals. Electromagnetic Spectra, Standard signals- DC, sinusoidal, unit
step, ramp, signum, rectangular pulse, impulse(delta) signal. System definition, classification of
systems, linear, nonlinear, time variant, time invariant, causal, non causal, stable and unstable
systems. Fourier transforms: Time domain and frequency domain representation of signal, Fourier
Transform and its properties, conditions for existence, Transform of Gate, unit step, constant,
impulse, sine and cosine wave. Shifting property of delta function, convolution, time and
frequency convolution theorems.
Unit-II Amplitude Modulation: Modulation, need of modulation, types of modulation techniques,
amplitude modulation (DSB-FC), modulation index, frequency spectrum of AM wave, linear and
over modulation, power relation in AM, transmission efficiency, modulation by a complex signal,
bandwidth of AM, AM modulators, square law and switching modulator, advantages and
disadvantages of AM. Demodulation of AM: Suppressed carrier amplitude modulation systems,
DSB-SC, SSB-SC, VSB-SC systems, comparison of various amplitude modulation systems.
Demodulation of AM, square law and envelope detector, synchronous detection of AM, Low and
high power AM transmitters, AM receivers, TRF and superheterodyne receivers, sensitivity,
selectivity and fidelity of receivers.
Unit-III Angle modulation: Introduction and types of angle modulation, frequency modulation,
frequency deviation, modulation index, deviation ratio, bandwidth requirement of FM wave, types
of FM. Phase modulation, difference between FM and PM, Direct and indirect method of FM
generation, FM demodulators- slope detector, Foster seeley discriminator, ratio detector.
Introduction to pulse modulation systems.
Unit-IV 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, Digital signal, Quantization, Quantization
error, Pulse code modulation, signal to 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-V 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-Ary PSK, Binary
frequency Shift Keying (BFSK), M-Ary FSK Quadrature Amplitude modulation (QAM).
Course Outcomes:

At the end of the course student will be able to :

1. Differentiate Analog and Digital Signal and types of signals.

2. Understand the communication of information over the communication channel.
3. Understand how information signal of low frequency can be transmitted with the help of
modulation techniques over a long distance.
4. Differentiate different modulation techniques such as AM, SSB, DSB and FM.
5. Explain using block diagrams, modulation and demodulation techniques for digital signal
and determine bandwidth requirement.
Reference Books:
1. Singh & Sapre, “Communication Systems”, TMH.
2. Taub Schilling, “Principles of Communication Systems”, TMH.
3. W. Tomasi “Electronic Communications Systems”, Pearson Education Pvt. Ltd.
4. Taub & shilling, “Communication Systems”, TMH.
5. Abhay Gandhi, “Analog and Digital Communication”, CENGAGE Learning.
List of Experiments:

1. AM Modulation and Demodulation (Envelope Detector)

2. Frequency modulation using reactance modulator.
3. Frequency modulation using varactor modulator.
4. Pulse Amplitude Modulation and Demodulation
5. Pre-emphasis and De-emphasis
6. Analog Multiplexing.
7. Amplitude Modulation using Pspice
8. Receiver characteristics (selectivity, sensitivity, fidelity).
9. Operation of foster-seeley loop detector.
10. Operation of ratio detector.
 RAJIV GANDHI PROUDYOGIKI VISHWAVIDYALAYA, BHOPAL

New Scheme Based On AICTE Flexible Curricula

Computer Science & Information Technology, IV-Semester

CSIT 403 Analysis & Design of Algorithm

Course Objectives

Data structure includes analyzing various algorithms along with time and space complexities. It also
helps students to design new algorithms through mathematical analysis and programming.

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, quick sort, 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, etc.

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

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, postorder, DFS, BFS), NP-completeness.

Course Outcomes:
At the end of the course student will be able to :
1 Implement sorting and searching algorithm

2 Experiment with techniques for obtaining maximum output with minimum efforts

3 Make use of dynamic programming for finding

4 Solve 8 queen’s problem and others of the kind for application in real world scenarios .

5 Distinguish between NP hard and NP complete problems and develop their solutions

Reference Books:-

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

2. Horowitz & Sahani; Analysis & Design of Algorithm
3. Dasgupta; algorithms; TMH
4. Ullmann; Analysis & Design of Algorithm;
5. Michael T Goodrich, Robarto Tamassia, Algorithm Design, Wiley 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-Warshall algorithm.
11. Write a program for traveling salesman problem.
12. Write a program for Hamiltonian cycle problem.
 RAJIV GANDHI PROUDYOGIKI VISHWAVIDYALAYA, BHOPAL

New Scheme Based On AICTE Flexible Curricula

Computer Science & Information Technology, IV-Semester

CSIT 404 Computer Organization & Architecture

Objectives: Students to be familiarize the basic principles of computer architecture, Design and
Multi Processing, Types of data transfer, Concept of semi conductor memories which is useful for
research work in field Computer System.

Unit-I Basic Structure of Computer: Structure of Desktop Computers, CPU: General

Register Organization-Memory Register, Instruction Register, Control Word, Stack Organization,
Instruction Format, ALU, I/O System, bus,CPU and Memory Program Counter, Bus Structure,
Register Transfer Language-Bus and Memory Transfer, addressing modes. Control Unit
Organization: Basic Concept of Instruction, Instruction Types, Micro Instruction Formats,
Fetch and Execution cycle, Hardwired control unit, Micro-programmed Control unit
microprogram sequencer Control Memory, Sequencing and Execution of Micro Instruction.
Unit-II Computer Arithmetic: Addition and Subtraction, Tools Compliment
Representation, Signed Addition and Subtraction, Multiplication and division, Booths
Algorithm, Division Operation, Floating Point Arithmetic Operation. design of Arithmetic
unit
Unit-II I/O Organization:I/O Interface –PCI Bus, SCSI Bus, USB, Data Transfer: Serial,
Parallel, Synchronous, Asynchronous Modes of Data Transfer, Direct Memory Access(DMA), I/O
Processor.
Unit-IV Memory Organization: Main memory-RAM, ROM, Secondary Memory –Magnetic
Tape, Disk, Optical Storage, Cache Memory: Cache Structure and Design, Mapping Scheme,
Replacement Algorithm, Improving Cache Performance, Virtual Memory, memory management
hardware
Unit-V Multiprocessors: Characteristics of Multiprocessor, Structure of Multiprocessor-
Inter-processor Arbitration, Inter-Processor Communication and Synchronization. Memory
in Multiprocessor System, Concept of Pipelining, Vector Processing, Array Processing,
RISC And CISC, Study of Multicore Processor –Intel, AMD.

Reference Books:
1.Morris Mano , “Computer System Organization ”PHI
2.Alan Clements: “Computer Organization and Architecture”, Cengage Learning
3.Subrata Ghosal: “Computer Architecture and Organization”, Pearson
4.William stalling ,“Computer Architecture and Organization” PHI
5.M. Usha, T.S. Shrikant: “Computer System Architecture and Organization”, Willey India
6.Chaudhuri, P.Pal: “Computer Organization and Design”, PHI
7.Sarangi: “Computer Organization and Architecture”,Mc-Graw Hills
Computer Org.& Architecture (List of Practicals)
1. Study of Multiplexer and Demultiplexer
2. Study of Half Adder and Subtractor
3. Study of Full Adder and Subtractor
4. WAP to add two 8 bit numbers and store the result at memory location 2000
5. WAP to multiply two 8 bit numbers stored at memory location 2000 and 2001 and stores
the result at memory location 2000 and 2001.
6. WAP to add two 16-bit numbers. Store the result at memory address starting from 2000.
7. WAP which tests if any bit is '0' in a data byte specified at an address 2000. If it is so, 00
would be stored at address 2001 and if not so then FF should be storedat the same address.
8. Assume that 3 bytes of data are stored at consecutive memory addresses of the data
memory starting at 2000. Write a program which loads register C with (2000), i.e. with data
contained at memory address2000, D with (2001), E with (2002) and A with (2001).
9. Sixteen bytes of data are specified at consecutive data-memory locations starting at 2000.
Write a program which increments the value of all sixteen bytes by 01.
10. WAP to add t 10 bytes stored at memory location starting from 3000. Store the result at
memory location 300A
 RAJIV GANDHI PROUDYOGIKI VISHWAVIDYALAYA, BHOPAL

New Scheme Based On AICTE Flexible Curricula

Computer Science & Information Technology, IV-Semester

CSIT 405 Data base Management System

Course Objectives:
The main objectives of the course are
1. To understand fundamental knowledge of file system, database concepts and use of
relational database.
2. To study of different data model and conceptual design using ER diagram.
3. Students can use SQL operations to manipulate the database and learn how to design and
create a good database using functional dependencies and normalization.
4. The course provides an overview of transaction management, concurrency control,
distributed database and Big Data.

Unit-I Basic Concepts: Introduction to DBMS, File system vs DBMS, Advantages of database
systems, Database System architecture, Data models, Schemas and instances, Data
independence, Functions of DBA and designer, Entities and attributes, Entity types, Key
attributes, Relationships, Defining the E-R diagram of database.

Unit-II Relational Model: Structure of relational databases, Domains, Relations, Relational

algebra – fundamental operators and syntax, relational algebra queries, Entity-Relationship
model :Basic concepts, Design process, constraints, Keys, Design issues, E-R diagrams, weak
entity sets, extended E-R features –generalization, specialization and aggregation

Unit-III SQL: Data definition in SQL, update statements and views in SQL: Data storage and
definitions, Data retrieval queries and update statements, Query Processing & Query
Optimization: Overview, measures of query cost, selection operation, sorting, join, evaluation of
expressions, transformation of relational expressions, estimating statistics of expression results,
evaluation plans. Case Study of ORACLE and DB2.

Unit-IV Relational Database design: Functional Dependency –definition, trivial and non-trivial
FD, closure of FD set, closure of attributes, irreducible set of FD, Normalization –1NF, 2NF,
3NF, Decomposition using FD-dependency preservation, lossless join, BCNF, Multi-valued
dependency, 4NF, Join dependency and 5NF

Unit-V Introduction of transaction, transaction processing and recovery, Concurrency control:

Lock management, specialized locking techniques, concurrency control without locking,
Protection and Security Introduction to: Distributed databases, Basic concepts of object oriented
data base system.

Course Outcomes:
After successful completion of this course, the students would be able to:
1. Compare file system and DBMS and explain how DBMS is better than traditional File
Processing Systems.
2. Analyze the physical and logical database designs, database modeling, relational,
hierarchical, and network models
3. Analyze and renovate an information model into a relational database schema and to use a
DDL, DML and DCL utilities to implement the schema using a DBMS.
4. Formulate data retrieval queries in SQL and Relational Algebra.
5. Demonstrate an understanding of functional dependencies, normalization theory and
apply such knowledge to the design of a database.
6. Demonstrate and explain terms like Transaction Processing, Concurrency Control,
distributed database and big data.

Reference Books:
1. Korth, Silbertz, Sudarshan, “Database Concepts”, McGraw Hill.
2. Elmasri, Navathe, “Fundamentals of Database Systems”, Pearson.
3. Ivan Bayross, “SQL, PL/SQL the Programming Language of Oracle”, BPB publications.
4. S. Sharma, J. Agrawal, S. Agrawal, “Advanced Database Management System”,
Dreamtech Press.
5. Leon & Leon, “Fundamental of Data Base Management System”, TMH

List of Experiments:
1. To perform various SQL Commands of DDL, DML, DCL.
2. Write SQL Commands such as Insertion, deletion and updation for any schema.
3. To execute Nested Queries, Join Queries, order-by, having clause and string operation.
4. To perform set operators like Union, Intersect, Minus on a set of tables.
5. To execute various commands for GROUP functions (avg, count, max, min, Sum).
6. Write a PL/SQL block for transaction application using Triggers.
7. Write a DBMS program to prepare report for an application using function.
8. Designing of various Input screens/Forms.
9. Create reports using database connectivity of Front end with back end.
10. Create database Design with normalization and implementing in any application.
 RAJIV GANDHI PROUDYOGIKI VISHWAVIDYALAYA, BHOPAL

New Scheme Based On AICTE Flexible Curricula

Computer Science & Information Technology, IV-Semester

CSIT 406 Dot Net

Course Objective:

Gain a comprehensive understanding of the philosophy and architecture of C-Sharp

programming. Configure and deploy a Microsoft ASP.NET Web application. Learn how to
implement web applications using web forms, including programs that interact with databases.
Gain a strong knowledge in all Dot Net Web application concepts

Introduction .NET framework, features of .Net framework, architecture and component of

.Net, elements of .Net.

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.

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

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, site map data source.

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 Handbook by Daniel Minoli, Emma Minoli , TMH
4. Web Programming by Chris Bates, Wiley
5. Alex Mackey, “ Introduction.NET 4.5 “, Wiley India
6. ASP .Net Complete Reference by McDonald, 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.
12. Working with Forms using ASP .Net
13. Data Sources access through ADO.Net,
14. Working with Data readers , Transactions
15. Creating Web Application.
 RAJIV GANDHI PROUDYOGIKI VISHWAVIDYALAYA, BHOPAL

New Scheme Based On AICTE Flexible Curricula

Computer Science & Information Technology, IV-Semester

BT407- 90 hrs Internship based on using various software’s –Internship -II

To be completed anytime during fourth semester. Its evaluation/credit to be added in fifth

semester.
 RAJIV GANDHI PROUDYOGIKI VISHWAVIDYALAYA, BHOPAL

New Scheme Based On AICTE Flexible Curricula

Computer Science & Information Technology, IV-Semester

BT408 Cyber Security

Unit I
Introduction- Introduction of Cyber Crime, Categorizing Cybercrime, Cybercrime Theory,
Criminology perception of cyber criminals: hackers, computer intrusions and Attacks, Privacy,
surveillance and protection, hiding crimes in cyberspace, cryptography, hacking vs cracking,
privacy and security at risk in the global information society.

Unit II
Application Security- Data Security, Security Technology-Firewall and VPNs, Intrusion
Detection, Access Control. Security Threats -Viruses, Worms, Trojan Horse, Bombs, Trapdoors,
Spoofs, E-mail Viruses, Macro Viruses, Malicious Software, Network and Denial of Services
Attack, Security Threats to E-Commerce- Electronic Payment System, e- Cash, Credit/Debit
Cards.

Unit III
Cryptrography concepts and Techniques
Plain text , cipher text, types – substitution ,transposition ,encryption, decryption , symmetric
and asymmetric key cryptography algorithms, steganography .

Unit IV
Security Policies- Development of Policies, WWW Policies, Email Security Policies, Policy Review
Process-Corporate Policies-Sample Security Policies, Publishing and Notification Requirement of
the Policies.

Unit V
Information Security Standards-ISO, IT Act, Copyright Act, Patent Law, IPR. Cyber Laws in India;
IT Act 2000 Provisions, Intellectual Property Law: Copy Right Law, Software License,
Semiconductor Law and Patent Law.
Case Study – Corporate Security , Cyber cases
References:

 Nina Godbole “ Cyber Security: Wiley.

 Michael E.Whitman and Herbert J Mattord "Principle of Information Security" Cengage
 William stallings “Cryptography and Network Security” PEARSON
 Charles P. Pfleeger, Shari Lawerance Pfleeger, “Analysing Computer Security”, Pearson
Education India.
 Vinod V. Sople, “Managing Intellectual Property” PHI Learning Private Limited
 IT Act 2000 Details www.mit.gov.in
 Atul Khate, “Cryptrography and Network Security” ,TMH
 V.K.Pachghare, “Cryptography and information Security”, PHI Learning Private Limited,
Delhi India.
 CHANDER, HARISH,” Cyber Laws And It Protection ” , PHI Learning Private Limited ,Delhi