RGPV Computer Science and Engineering 4th Sem Syllabus
B.E. 401 ENGINEERING MATHAMATICS III
Functions of complex variables : Analytic functions, Harmonic Conjugate, CauchyRiemann Equations, Line Integral, Cauchy’s Theorem, Cauchy’s Integral Formula, Singular Points, Poles & Residues, Residue Theorem , Application of Residues theorem for evaluation of real integrals
Unit II
Errors & Approximations, Solution of Algebraic & Trancedental Equations (Regula Falsi , NewtonRaphson, Iterative, Secant Method), Solution of simultaneous linear equatins by Gauss Elimination, Gauss Jordan, Crout’s methods , Jacobi’s and GaussSiedel Iterative methods
Unit III
Difference Operators, Interpolation ( Newton Forward & Backward Formulae, Central Interpolation Formulae, Lagrange’s and divided difference formulae ), Numerical Differentiation and Numerical Integration.
Unit IV
Solution of Ordinary Differential Equations(Taylor’s Series, Picard’s Method, Modified Euler’s Method, RungeKutta Method, Milne’s Predictor & Corrector method ), Correlation and Regression, Curve Fitting (Method of Least Square).
Unit V
Concept of Probability : Probability Mass function, Probability density function. Discrete Distribution: Binomial, Poisson’s, Continuous Distribution: Normal Distribution, Exponential Distribution ,Gamma Distribution ,Beta Distribution ,Testing of Hypothesis :Students ttest, Fisher’s ztest, ChiSquare Method
Reference 

(i) 
Numerical Methods using Matlab by J.H.Mathews and K.D.Fink, P.H.I. 
(ii) 
Numerical Methods for Scientific and Engg. Computation by MKJain, Iyengar and RK 
Jain, New Age International Publication  
(iii) 
Mathematical Methods by KV Suryanarayan Rao, SCITECH Publuication 
(iv) 
Numerical Methods using Matlab by Yang,Wiley India 
(v) 
Pobability and Statistics by Ravichandran ,Wiley India 
(vi) 
Mathematical Statistics by George R., Springer 
CS402 – Computer System Organisation
Computer Basics and CPU: Von Newman model, various subsystems, CPU, Memory, I/O,
System Bus, CPU and Memory registers, Program Counter, Accumulator, Instruction register, Micro operations, Register Transfer Language, Instruction Fetch, decode and execution, data movement and manipulation, Instruction formats and addressing modes of basic computer. 8085 microprocessor organization
UnitII
Control Unit Organization: Hardwired control unit, Micro and nano programmed control unit, Control Memory, Address Sequencing, Micro Instruction formats, Micro program sequencer, Microprogramming, Arithmetic and Logic Unit: Arithmetic Processor, Addition, subtraction, multiplication and division, Floating point and decimal arithmetic and arithmetic units, design of arithmetic unit.
UnitIII
Input Output Organization: Modes of data transfer – program controlled, interrupt driven and direct memory access, Interrupt structures, I/O Interface, Asynchronous data transfer, I/O processor, 8085 I/O structure, 8085 instruction set and basic programming. Data transfer – Serial / parallel, synchronous/asynchronous, simplex/half duplex and full duplex.
UnitIV
Memory organization: Memory Maps, Memory Hierarchy, Cache Memory – Organization and mappings. Associative memory, Virtual memory, Memory Management Hardware.
Unit V Multiprocessors: Pipeline and Vector processing, Instruction and arithmetic pipelines, Vector and array processors, Interconnection structure and interprocessor communication.
References:
 Morris Mano: Computer System Architecture, PHI.
 Tanenbaum: Structured Computer Organization, Pearson Education
 J P Hayes, Computer Architecture and Organisations, Mc Graw Hills, New Delhi
 Gaonkar: Microprocessor Architecture, Programming, Applications with 8085; Penram Int.
 William Stallings: Computer Organization and Architecture, PHI
 ISRD group; Computer orgOrganization; TMH
 Carter; Computer Architecture (Schaum); TMH
 Carl Hamacher: Computer Organization, TMH
Abstract data types, Objects and classes, Attributes and Methods, Objects as software units, Encapsulation and Information hiding, Objects instantiations and interactions, Object lifetime, Static and dynamic objects, global and local objects, Metaclass, Modeling the real world objects.
CS 403 – Object Oriented Technology
Relationships between classes, Association of objects, Types of Association, Recursive Association, Multiplicities, Navigability, Named association, Aggregation of objects. Types of Aggregation, Delegation, Modeling Association and Aggregation.
Unit III
Inheritance and Polymorphism, Types of polymorphism, Static and dynamic polymorphism, Operator and Method overloading, Inherited methods, Redefined methods, the protected interface, Abstract methods and classes, Public and protected properties, Private operations, Disinheritance, Multiple inheritance.
Unit IV
Container Classes, Container types, typical functions and iterator methods, Heterogeneous containers, Persistent objects, stream, and files, Object oriented programming languages,
Unit V
Study of C++/Java as Objectoriented programming language.
References:
 David Parsons; Object oriented programming with C++; BPB publication
 Object oriented programming in C++ by Robert Lafore: Galgotia
 Balagurusamy; Object oriented programming with C++; TMH
 Java Complete Reference: Herbert Schildt, Mc Graw Hill
 Hubbard; Programming in C++ (Schaum); TMH
 Mastering C++ by Venugopal, TMH
List of experiments (Expandable):
Programming assignments may be given to students so that they can better understand the concepts of object oriented programming such as objects, classes, classrelationships, association, aggregation, inheritance, polymorphism etc.
CS 404 – Analysis & Design of Algorithm
UnitI
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
Unit III
Concept of dynamic programming, problems based on this approach such as 0/1 knapsack, multistage graph, reliability design, FloydWarshall 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, 23 trees, Btrees, basic search and traversal techniques for trees and graphs (In order, preorder, postorder, DFS, BFS), NPcompleteness.
References:
1. Coremen Thomas, Leiserson CE, Rivest RL; Introduction to Algorithms; PHI.
 Horowitz & Sahani; Analysis & Design of Algorithm
 Dasgupta; algorithms; TMH
 Ullmann; Analysis & Design of Algorithm;
 Michael T Goodrich, Robarto Tamassia, Algorithm Design, Wiely India
List of Experiments( expandable):
1. Write a program for Iterative and Recursive Binary Search.
 Write a program for Merge Sort.
 Write a program for Quick Sort.
 Write a program for Strassen’s Matrix Multiplication.
 Write a program for optimal merge patterns.
 Write a program for Huffman coding.
 Write a program for minimum spanning trees using Kruskal’s algorithm.
 Write a program for minimum spanning trees using Prim’s algorithm.
 Write a program for single sources shortest path algorithm.
10. Write a program for FloyeWarshal algorithm.
11. Write a program for traveling salesman problem.
12. Write a program for Hamiltonian cycle problem.
CS 405 – Analog & Digital Communication
UnitI
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.
UnitII
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, Bandwidth comparison of modulation techniques.
UnitIII
Sampling of signal, sampling theorem for low pass and Band pass signal, Pulse amplitude modulation (PAM), Time division, multiplexing (TDM). Channel Bandwidth for PAMTDM 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.
UnitIV
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), MAry PSK, Binary frequency Shift Keying (BFSK), MAry FSK Quadrature Amplitude modulation (QAM), MODEM, Introduction to probability of error.
UnitV 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, ShanonHartley theorem (S/NBW trade off)Source encoding code properties; Shanon, 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:
 Singh & Sapre, Communication System, TMH
 Taub & shilling, Communication System, TMH
 Hsu; Analog and digital communication(Schaum); TMH
 B.P. Lathi, Modern Digital and analog communication system,
 Simon Haykins, Communication System. John Willy
 Wayne Tomasi, Electronic Communication system.
 Martin S. Roden, Analog & Digital Communication System; Discovery Press.
 Frank R. Dungan, Electronic Communication System, Thomson/Vikas.
List of Experiments(Expandable)
1. Study of sampling process and signal reconstruction and aliasing.
 Study of PAM PPM and PDM
 Study of PCM transmitter and receiver.
 Time division multiplexing (TDM) and De multiplexing
 Study of ASK PSK and FSK transmitter and receiver.
 Study of AM modulation and Demodulation techniques (Transmitter and Receiver) Calculate of parameters
 Study of FM modulation and demodulation (Transmitter and Receiver) & Calculation of parameters
8. To construct and verify pre emphasis and deemphasis and plot the wave forms.
 Study of super hetrodyne receiver and characteristics of ratio radio receiver.
10. To construct frequency multiplier circuit and to observe the waveform
11. Study of AVC and AFC.
CS 406 – Computer Programming IV (.Net Technologies)
UNIT I
Introduction .NET framework, features of .Net framework, architecture and component of .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, datareader 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.
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
 Balagurusamy; Programming in C#; TMH
 Web Commerce Technology Handbook by Daniel Minoli, Emma Minoli , TMH
 Web Programming by Chris Bates, Wiley
 XML Bible by Elliotte Rusty Harold ,
 ASP .Net Complete Reference by McDonald, TMH.
 ADO .Net Complete Reference by Odey, TMH
List of Experiments/ program (Expandable):
1. Working with call backs and delegates in C#
 Code access security with C#.
 Creating a COM+ component with C#.
 Creating a Windows Service with C#
 Interacting with a Windows Service with C#
 Using Reflection in C#
 Sending Mail and SMTP Mail and C#
 Perform String Manipulation with the String Builder and String Classes and C#:
 Using the System .Net Web Client to Retrieve or Upload Data with C#
 Reading and Writing XML Documents with the XML TextReader/Writer Class and C#
11. Working with Page using ASP .Net.
12. Working with Forms using ASP .Net
 Data Sources access through ADO.Net,
14. Working with Data readers , Transactions
 Creating Web Application.
RGPV Computer Science Engineering 4th Sem Syllabus
shu
Thanks for the guidance for 4 sem books for cse.
done good job!
gave in computer science engineering branch code
Nice expirience
C.s. Is a very importent feald this is a user frendly
thnx it’s helpful for guidance
thanks…sir