RGPV CBGS 3rd Semester Computer Science & Engineering Syllabus

 Computer Science & Engineering, III-Semester 

BE-3001 Mathematics-III (Syllabus for CS, IT, & EC Branches ) 

COURSE OBJECTIVE- The objective of this course is to fulfill the needs of Engineers to understand the Applications of Fourier Series, Fourier & Laplace Transforms and Statistical Techniques in order to acquire Mathematical knowledge and to Solving a wide range of Practical Problems Appearing in the CS/IT/EC discipline of Engineering. 

Course Contents 

Fourier Series: Fourier Series for Continuous & Discontinuous Functions, Expansion of odd and even periodic functions, Half-range Fourier series, Complex form of Fourier Series.

Integral Transforms: Fourier Transform: Complex Fourier Transform, Fourier Sine and Cosine Transforms, Applications of Fourier Transform in Solving the Ordinary Differential Equation. 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 Derivatives and Integrals. Inverse Laplace Transform & its Properties, Convolution theorem, Applications of Laplace Transform in solving the Ordinary Differential Equations. 

Random Variables: Discrete and Continuous Random Variables, Probability Function, Distribution Function, Density Function, Probability Distributions, Mean and Variance of Random Variables.

  Distribution: Discrete Distributions- Binomial & Poisson Distributions with their Constants, Moment Generating Functions, Continuous Distribution- Normal Distribution, Properties, Constants, Moments. Curve Fitting using Least Square Method.

CS-3002 Electronic Devices & Circuits 

Course Contents 

Semiconductor devices, theory of P-N junction, temperature dependence and break down characteristics, junction capacitances. Zener diode, Varactor diode, PIN diode, LED, Photo diode, Transistors BJT, FET, MOSFET, types, working principal, characteristics, and region of operation, load line biasing method. Transistor as an amplifier, gain, bandwidth, frequency response, Type of amplifier. 

Feedback amplifier, negative feedback, voltage-series, voltage shunt, current series and current shunt feedback, Sinusoidal oscillators, L-C (Hartley-Colpitts) oscillators, RC phase shift, Wien bridge, and Crystal oscillators. Power amplifiers, class A, class B, class A B, C amplifiers, their efficiency and power Dissipation. 

Switching characteristics of diode and transistor turn ON, OFF time, reverse recovery time, transistor as switch, Multivibrators, Bistable, Monostable, Astable multivibarators. Clippers and clampers, Differential amplifier, calculation of differential, common mode gain and CMRR using hparameters. 

Operational amplifier characteristics, slew rate, full power bandwidth, offset voltage, bias current, application ,inverting , non inverting amplifier , summer, differentiator, integrator, differential amplifier , instrumentation amplifier, log and antilog amplifier , voltage to current and current to voltage converters , comparators Schmitt trigger. 

Introduction to IC, Advantages and limitations, IC classification, production process of monolithic IC, fabrication of components on monolithic IC, IC packing, general integrated circuit technology, photolithographic process, un polar IC’s, IC symbols. 

List of Experiments: 

1. Diode and Transistor characteristics 

2. Transistor Applications (Amplifier and switching) 

3. OP-Amp and its Applications 

4. 555 timer and its Applications

CS-3003 Digital Circuit & Design 

PREREQUISITE: Electronic Device & Circuits (Transistors, Capacitors, Inductors,), other Hardwares. 

OBJECTIVES To expose the students to perform binary arithmetic and conversion from one number system to another and learn different Boolean simplification techniques. We learn the design and analysis of combinational and sequential circuits. 

Course Contents 

Number systems & codes, Binary arithmetic, Boolean algebra and switching function. Minimization of switching function, Concept of prime implicant, Karnaugh map method, Quine McCluskey’s method,Cases with don’t care terms, Multiple output switching function. 

Introduction to logic gates, Universal gate, Half adder,Half subtractor, Full adder, Full subtractor circuits, Series & parallel addition, BCD adders, Look-ahead carry generator. 

Linear wave shaping circuits, Bistable, Monostable & Astable multivibrator, Schmitt Trigger circuits & Schmitt-Nand gates. Logic families:RTL, DTL, All types of TTL circuits, ECL, I2L, PMOS, NMOS, & CMOS logic, Gated flip- flops and gated multivibrator, Interfacing between TTL to MOS. 

Decoders, Encoders, Multiplexers, Demultiplexers, Introduction to various semiconductor memories, & designing with ROM and PLA. 

Introduction to Shift Registers, Counters, Synchronous & Asynchronous counters, Designing of combinational circuits like code converters. Introduction of Analog to Digital & Digital to Analog converters, sample & hold circuits and V-F converters. 

OUTCOMES: Upon completion of the course, the students will be able to Perform Simplification of Boolean Functions using Theorems and Karnaugh Maps and Convert between digital codes using encoder/decoder .Student can analyze combinational circuits and sequential circuits . 

List of Experiments : 

1.To study and test operation of all logic gates for various IC’s )IC#7400, IC#7403, IC#7408, IC#7432, IC#7486) 

2.Verification of DeMorgan’s Theorem. 

3.To construct half adder and full adder. 

4.To construct half subtractor and full subtractor circuits. 

5.Verification of versatility of NAND gate. 

6. Verification of versatility of NOR gate. 

7. Designing and verification of property of full adder. 

8.Design a BCD to excess-3 code convertor. 

9.Design a Multiplexer/Demultiplexer 

CS-3004 Data Structures-II 

Objectives 

Data structures play a central role in modern computer science. In addition, data structures are essential building blocks in obtaining efficient algorithms. The objective of the course is to teach students how to design, write, and analyze the performance of programs that handle structured data and perform more complex tasks, typical of larger software projects. Students should acquire skills in using generic principles for data representation & manipulation with a view for efficiency, maintainability, and codereuse. Another goal of the course is to teach advance data structures concepts, which allow one to store collections of data with fast updates and queries. 

Course Contents 

Introduction –Common operations on data structures, Types of data structures, Data structures & Programming, Program Design, Complexities, Time Complexity, order of Growth, Asymptotic Notation. 

Advanced Data Structures-Hash tables ,Heaps , Complexity , Analysis of Heap Operations , Application of Heap , AVL tress , Insertion & Deletion in AVL tree , Red Black Trees , Properties of Red Black trees ,Insertion & Deletion in Red Black tree . 

Sorting –Need for sorting , Types of sorting algorithm-Stable sorting Algorithm, Internal & External sorting algorithm , Outline and offline algorithm ,Sorting Techniques-Insertion , Shell , Selection , Merge ,Quick sort, Radix sort ,bucket sort . 

Augmenting Data structures – Augmenting a red black trees, Retrieving an element with a given rank , Determining the rank of element ,Data structure Maintenance ,An augmentation strategy ,Interval Trees. 

File structures- Basic file operations, File organization –Sequential file organization, Indexed sequential file organization, Direct file organization. External merge sort, Multiway Merge sort, Tournament Tree ,Replacement Selection . 

CS-3005 Discrete Structures 

Objective-

This course introduces the applications of discrete mathematics in the field of computer science. It covers sets, logic, proving techniques, combinatorics, functions, relations, Graph theory and algebraic structures. These basic concepts of sets, logic functions and graph theory are applied to Boolean Algebra and logic networks while the advanced concepts of functions and algebraic structures are applied to finite state machines and coding theory. 

Course Contents 

Set Theory, Relation, Function, Theorem Proving Techniques : Set Theory: Definition of sets, countable and uncountable sets, Venn Diagrams, proofs of some general identities on sets Relation: Definition, types of relation, composition of relations, Pictorial representation of relation, Equivalence relation, Partial ordering relation, Job-Scheduling problem Function: Definition, type of functions, one to one, into and onto function, inverse function, composition of functions, recursively defined functions, pigeonhole principle. Theorem proving Techniques: Mathematical induction, Proof by contradiction. 

Algebraic Structures: Definition, Properties, types: Semi Groups, Monoid, Groups, Abelian group, properties of groups, Subgroup, cyclic groups, Cosets, factor group, Permutation groups, Normal subgroup, Homomorphism and isomorphism of Groups, example and standard results, Rings and Fields: definition and standard results. 

Propositional Logic: Proposition, First order logic, Basic logical operation, truth tables, tautologies, Contradictions, Algebra of Proposition, logical implications, logical equivalence, predicates, Normal Forms, Universal and existential quantifiers. Introduction to finite state machine Finite state machines as models of physical system equivalence machines, Finite state machines as language recognizers 

Graph Theory: Introduction and basic terminology of graphs, Planer graphs, Multigraphs and weighted graphs, Isomorphic graphs, Paths, Cycles and connectivity, Shortest path in weighted graph, Introduction to Eulerian paths and circuits, Hamiltonian paths and circuits, Graph coloring, chromatic number, Isomorphism and Homomorphism of graphs. 

Posets, Hasse Diagram and Lattices: Introduction, ordered set, Hasse diagram of partially, ordered set, isomorphic ordered set, well ordered set, properties of Lattices, bounded and complemented lattices. Combinatorics: Introduction, Permutation and combination, Binomial Theorem, Multimonial Coefficients Recurrence Relation and Generating Function: Introduction to Recurrence Relation and Recursive algorithms , Linear recurrence relations with constant coefficients, Homogeneous solutions, Particular solutions, Total solutions , Generating functions , Solution by method of generating functions. W.E.F. July 2017 Academic Session 2017-18 

Outcome:-After this completion student will be familiar with relational algebra,Functions and graph theory.

CS-3006 Computer Programming-I (Java Technologies) 

Objective: To introduce and understand students to programming concepts and techniques using the Java language and programming environment, class, objects , also learn about lifetime, scope and the initialization mechanism of variables and improve the ability general problem solving abilities in programming. Be able to use the Java SDK environment to create, debug and run simple Java program. 

Basic Java Features - C++ Vs JAVA, JAVA virtual machine, Constant & Variables, Data Types, Class, Methods,Objects, Strings and Arrays, Type Casting, Operators, Precedence relations, Control Statements, Exception Handling, File and Streams, Visibility, Constructors, Operator and Methods Overloading, Static Members, Inheritance: Polymorphism, Abstract methods and Classes 

Java Collective Frame Work - Data Structures: Introduction, Type-Wrapper Classes for Primitive Types, Dynamic Memory Allocation, Linked List, Stack, Queues, Trees, Generics: Introduction, Overloading Generic Methods, Generic Classes, Collections: Interface Collection and Class Collections, Lists, Array List and Iterator, Linked List, Vector. Collections Algorithms: Algorithm sorts, Algorithm shuffle, Algorithms reverse, fill, copy, max and min Algorithm binary Search, Algorithms add All, Stack Class of Package java. Util, Class Priority Queue and Interface Queue, Maps, Properties Class, Un-modifiable Collections. 

Advance Java Features - Multithreading: Thread States, Priorities and Thread Scheduling, Life Cycle of a Thread, Thread Synchronization, Creating and Executing Threads, Multithreading with GUI,Monitors and Monitor Locks. Networking: Manipulating URLs, Reading a file on a Web Server, Socket programming, Security and the Network, RMI, Networking, Accessing Databases with JDBC: Relational Database, SQL, MySQL, Oracle

Advance Java Technologies - Servlets: Overview and Architecture, Setting Up the Apache Tomcat Server, Handling HTTP get Requests, Deploying a web Application, Multitier Applications, Using JDBC from a Servlet, Java Server Pages (JSP): Overview, First JSP Example, Implicit Objects, Scripting, Standard Actions, Directives, Multimedia: Applets and Application: Loading, Displaying and Scaling Images, Animating a Series of Images, Loading and playing Audio clips 

Advance Web/Internet Programming (Overview): J2ME, J2EE, EJB, XML.

List of Program : 

1. Installation of J2SDK 

2. Write a program to show Scope of Variables 

3. Write a program to show Concept of CLASS in JAVA 

4. Write a program to show Type Casting in JAVA 

5. Write a program to show How Exception Handling is in JAVA 

6. Write a Program to show Inheritance 

7. Write a program to show Polymorphism 

8. Write a program to show Access Specifiers (Public, Private, Protected) in JAVA 

9. Write a program to show use and Advantages of CONTRUCTOR 

10. Write a program to show Interfacing between two classes 

11. Write a program to Add a Class to a Package 

12. Write a program to show Life Cycle of a Thread 

13. Write a program to demonstrate AWT. 

14. Write a program to Hide a Class 

15. Write a Program to show Data Base Connectivity Using JAVA 

16. Write a Program to show “HELLO JAVA ” in Explorer using Applet 

17. Write a Program to show Connectivity using JDBC 

18. Write a program to demonstrate multithreading using Java. 

19. Write a program to demonstrate applet life cycle. 

20. Write a program to demonstrate concept of servlet. 

Continue Reading →

RGPV MTech 1st Semester Nanotechnology Syllabus

 MNT 101 – Mathematical Methods & Programming 

UNIT I : 

Theory of transforms: Fourier sine, cosine and complex transforms, transforms of derivatives, convolution theorem, Parseval’s relation, momentum representation; example from electromagnetism, Laplace transforms of simple function and derivatives, LT solution of ordinary & partial differential equation, convolution theorem. 

UNIT II : 

Bessel function, Hermite, Legendre & Lagurre polynomials occurrence of special functions and applications to physical problems. 

UNIT III : 

Priory and posteriory probability, Bayes theorem, discrete and continuous distribution, correlation and regression analysis, theory of errors, noise power spectral density, techniques of noise reduction. 

UNIT IV : 

C++ programming basics, FOR loops, WHILE loops, DO loops. IF statement, IF ELSE, ELSE IF, BREAK, CONTINUE; Function declaration, calling the function, passing arguments to function, returning values from the function, Array elements, initializing arrays, passing arrays to function. Programming for solution of quadratic equations, partial differential equations and matrices. 

UNIT V : 

Mat Lab programming: symbolic & numerical calculations, graphics, 3D plots, equation solving, matrices, mathematical relations, complex numbers, simplifications, algebraic expressions, mathematical operations, inbuilt functions, differentiation, integration, series, and limits.

MNT 102 - Synthesis of Nanomaterials 

UNIT I : 

Top-down & Bottom-up techniques: Formation of nanostructures by mechanical milling (ball milling) and mechanical attrition, Chemical vapor deposition (CVD), Physical vapour deposition (PVD) thermal and e beam evaporation, Pulsed laser ablation (PLD). 

UNIT II : 

Chemical Routes for synthesis of Nanomaterials: Chemical precipitation and coprecipitation, chemical bath deposition (CBD), Sol-gel synthesis, Microemulsions or reverse micelles, Solvothermal synthesis, Thermolysis routes and spray pyrolysis, 

UNIT III : 

Electrodeposition (DC and pulsed DC & AC), Electrodeposion cell in 3-electrode geometry, Procedure of multilayered thinfilm, nanowire and quantum dots electrodeposition, Electrophoresis, and their growth parameters (temperature, pH, surfactants, precursor ion concentration). Self assembly, self-assembled monolayers, directed assembly, layer by layer assembly, self organization, ordered and colloidal dispersion. 

UNIT IV : 

Optical lithography: Light sources – photo mask and alignment, Resolution in projection systems – positive and negative photo resists, Electron beam lithography (Maskless lithography), Semiconductor processing. Nanolithography, Nanoimprint lithography, Dip-pen nanolithography. 

UNIT V :

 Preparation of amorphous materials, metallic glass, thermal evaporation techniques such as sputtering, CVD Techniques, quenching. Glasses, theory of glass transition, glass transition temperature. Structure of disordered materials. Experimental techniques, electronic density of states. Localization phenomenon, transport, optical and dielectric properties.

MNT 103 – Mechanics at Nano Scale 

UNIT I : 

Introduction to Quantum Mechanics, Uncertainty relations, Basic postulates of quantum mechanics, Wave functions, Particle in a box, hydrogen atom, linear harmonic oscillator. Schrödinger, Heisenberg & Interaction representations. Angular momention operators : eigen values & eigen vectors of L2 Lz, spin & J2 & Jz. 

UNIT II : 

WKB method and their applications to study quantum structures, tunnelling through a barrier. 

UNIT III : 

Degenerate perturbation theory and variational approximation, Zeeman & stark like effects. 

UNIT IV : 

Time independent perturbation upto second order, time dependent perturbation theory for constant and harmonic perturbation, transition probability, and Fermi Golden rule, atoms in a radiation field, emission and absorption of radiation, selection rules. 

UNIT V : 

Maxwell-Boltzmann’s statistics, Fermi-Dirac statistics and fermions, Pauli’s exclusion principle, Bose Einstien statistics, Bosons, Bose condensations. 

MNT 104 – Materials at Nano Scale 

Unit I : 

Single crystalline, polycrystalline and amorphous structures, Crystal structure, unit cells, crystal plane, Miller indices, classification of crystal (symmetry group classification), crystal orientation. Imperfection in solids: Grain boundaries their relation to mechanical properties, dislocations in single crystals (linear defects and screw dislocation), imperfection dependent properties of crystals. 

Unit II : 

Nanocomposites, Nanopolymers, Nanoceramics, flexible nano ceramics, morphology, crystal structures, imperfections, nano phase diagrams, cemented carbides, ceramics for structural, wear and environmental applications. Composites: Composite materials, large particle and dispersion strengthened composites. Polymer matrix, metal matrix and ceramic matrix composites. 

Unit III : 

Equilibrium diagrams: The Phase rule, Unary diagrams. Two component systemssolid solubility, Binary diagrams, relative amount of phases, Thermal analysis, Limited solid solubility, the Binary Euctectic diagram, the peritectic diagram. Phase transitions and critical pheneomenon: Broken symmetry and ordered parameters in condensed matter. 

Unit IV : 

Diffusion in Solids: Fick’s Law of diffusion. Solution to Fick’s second law. Application based on second law solution, The Kirkendall effect. Nucleation and growth; the nucleation kinetics. The growth and overall transformation kinetics. Applications: transformation in steel. 

Unit V : 

Elasticity: Stress, strain, elastic and plastic deformation, tensile properties, compressive, shear and torsional deformation, hardness. Electronic and ionic conduction, electron mobility and electrical resistivity, temperature dependence and carrier conductance , electrical properties of polymers, capacitance, polarization and types, frequency dependence of dielectric constant, ferro and piezo electricity, heat capacity thermal expansion , thermal conductivity and stresses. 

MNT 105 – Characterization of Nanomaterials 

UNIT I : 

X-ray Diffraction (XRD), powder and single crystal Diffraction, X-ray fluorescence (XRF), X ray photoelectron spectroscopy (XPS), Energy Dispersive X-ray analysis (EDAX), Extended X ray absorption fine structures (EXAFS), Dispersive high pressure XRD and Diamond anvil cells (DAC). 

UNIT II : 

Scanning tunneling microscopy (STM), Contact and non contact atomic force microscopy (AFM), Conductive AFM, Magnetic force microscopy (MFM), scanning tunneling spectroscopy (STS), Nano indentation. 

UNIT III : 

Nuclear magnetic resonance (NMR) and Raman spectroscopy: description and analysis. Surface analysis methods: Secondary ion mass spectroscopy (SIMS), Auger electron spectroscopy, ESCA, Deep level transient spectroscopy (DLTS), Thermo gravimetric analysis (TGA), Differential scanning calorimetry (DSC). 

UNIT IV : 

Spectrophotometers, UV-Vis spectrophotometers, IR spectrophotometers, Fourier Transform Infrared radiation (FTIR), photoluminescence, electroluminesce and thermoluminescence spectroscopy, Nearfield scanning optical microscopy (NSOM). 

UNIT V : 

Scanning Electron Microscopy (SEM), Transmission electron microscoy (TEM), High resolution TEM Field emission SEM, Electron energy loss spectroscopy (EELS), Electron probe micro analyzer (EPMA).

Continue Reading →

RGPV B.E 3rd Semester M-III proposed Syllabus

This is to inform you that RGPV has declared Mathematics III syllabus for B.E 3rd Semester ME/AU/CM/FT/IP/MI branch students.

M-III (BE III ) ME/AU/CM/FT/IP/MI Branches )

Course Contents (Proposed)

Unit: I Fourier Series: 

Fourier Series for Continuous & Discontinuous Functions, Expansion of odd and even periodic

functions, Half range Fourier series, Complex form of Fourier Series, Parseval’s formula.

Unit: II 

Fourier Transform: Complex Fourier Transform, Fourier Sine and Cosine Transforms.

Unit: III 

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 Derivatives and Integrals. Inverse Laplace Transform & its Properties, Convolution theorem, Applications of Laplace Transform in solving the Ordinary Differential Equations.

Unit: IV

Functions of Complex Variables : Analytic functions, Harmonic Conjugate, Cauchy-Riemann 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: V

Vector Calculus: Differentiation of Vectors, Scalar and Vector Point functions, Gradient, Directional derivative, Divergence and Curl. Line Integral, Surface Integral and Volume Integral, Stoke’s Theorem and Gauss divergence theorem. 

References:

1. Erwin Kreyszig: Advanced Engineering Mathematics, Wiley India.

2. B.S. Grewal: Higher Engineering Mathematics , Khanna Publication.

3. Engineering Mathematics By Samnta Pal and Bhutia, Oxford Publication

4. Ramana: Advance Engg. Mathematics, TMH New Delhi

5. Numerical Methods for Engineers by Steven C. Chapra, McGraw Hill Education

6. Introductory Methods of Numerical Analysis by S. S. Sastry, PHI Learning Pvt. Ltd.

7. Numerical Methods By Shrimanta Pal, Oxford

Continue Reading →

RGPV B.E 3rd Semester M-III proposed Syllabus

This is to inform you that RGPV has declared Mathematics III syllabus for B.E 3rd Semester EC/EX/EE/EI/BM Branches students.

M-III (BE III ) EC/EX/EE/EI/BM Branches )

Course Contents (Proposed)

Unit: I Fourier Series: 

Fourier Series for Continuous & Discontinuous Functions, Expansion of odd and even periodic

functions, Half range Fourier series, Complex form of Fourier Series, Parseval’s formula.

Unit: II 

Fourier Transform: Complex Fourier Transform, Fourier Sine and Cosine Transforms.

Unit: III 

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 Derivatives and Integrals. Inverse Laplace Transform & its Properties, Convolution theorem, Applications of Laplace Transform in solving the Ordinary Differential Equations.

Unit: IV

Functions of Complex Variables : Analytic functions, Harmonic Conjugate, Cauchy-Riemann 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: V

Vector Calculus: Differentiation of Vectors, Scalar and Vector Point functions, Gradient, Directional derivative, Divergence and Curl. Line Integral, Surface Integral and Volume Integral, Stoke’s Theorem and Gauss divergence theorem.

References:

1. Erwin Kreyszig: Advanced Engineering Mathematics, Wiley India.

2. B.S. Grewal: Higher Engineering Mathematics , Khanna Publication.

3. Engineering Mathematics By Samnta Pal and Bhutia, Oxford Publication

4. Ramana: Advance Engg. Mathematics, TMH New Delhi

5. Numerical Methods for Engineers by Steven C. Chapra, McGraw Hill Education

6. Introductory Methods of Numerical Analysis by S. S. Sastry, PHI Learning Pvt. Ltd.

7. Numerical Methods By Shrimanta Pal, Oxford

Continue Reading →

RGPV B.E 3rd Semester M-III proposed Syllabus

This is to inform you that RGPV has declared Mathematics III syllabus for B.E 3rd Semester Computer Science and Information Technology branch students.

M-III (BE III ) CS/IT Branches )

Course Contents (Proposed)

Unit: I Fourier Series: 

Fourier Series for Continuous & Discontinuous Functions, Expansion of odd and even periodic

functions, Half range Fourier series, Complex form of Fourier Series, Parseval’s formula.

Unit: II 

Fourier Transform: Complex Fourier Transform, Fourier Sine and Cosine Transforms.

Unit: III 

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 Derivatives and Integrals. Inverse Laplace Transform & its Properties, Convolution theorem, Applications of Laplace Transform in solving the Ordinary Differential Equations.

Unit: IV

Random Variables: Discrete and Continuous , Probability Function, Distribution Function, Density Function, Probability Distribution, Mean and Variance. .

Unit: V

Distribution: Discrete Distributions- Binomial & Poisson Distributions with their Constants, Moment Generating Functions, Expected Frequencies & Fittings, Continuous Distribution- Normal or Gaussian Distribution with normal curve, Properties, Constants, Moments, Method of Area of Fitting a normal distribution & Exponential Distribution.  

References:

1. Erwin Kreyszig: Advanced Engineering Mathematics, Wiley India.

2. B.S. Grewal: Higher Engineering Mathematics , Khanna Publication.

3. Engineering Mathematics By Samnta Pal and Bhutia, Oxford Publication

4. Ramana: Advance Engg. Mathematics, TMH New Delhi

5. Numerical Methods for Engineers by Steven C. Chapra, McGraw Hill Education

6. Introductory Methods of Numerical Analysis by S. S. Sastry, PHI Learning Pvt. Ltd.

7. Numerical Methods By Shrimanta Pal, Oxford

Continue Reading →

RGPV B.E 3rd Semester M-III proposed Syllabus

This is to inform you that RGPV has declared Mathematics III syllabus for B.E 3rd Semester Civil and Textile branch students.

M-III (BE III ) CE/TX Branches )

Course Contents (Proposed)

Unit: I Fourier Series: 

Fourier Series for Continuous & Discontinuous Functions, Expansion of odd and even periodic

functions, Half range Fourier series, Complex form of Fourier Series, Parseval’s formula.

Unit: II 

Fourier Transform: Complex Fourier Transform, Fourier Sine and Cosine Transforms.

Unit: III 

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 Derivatives and Integrals. Inverse Laplace Transform & its Properties, Convolution theorem, Applications of Laplace Transform in solving the Ordinary Differential Equations.

Unit: IV

Functions of Complex Variables : Analytic functions, Harmonic Conjugate, Cauchy-Riemann 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: V

Solution of Ordinary Differential equations: Picard’s, Taylor’s Series, Eulers’s, Modified Eulers’s, Runge-Kutta, Milne’s and Adam’s Bashforth Method; 

Unit: VI

Numerical Solution of Difference Equations: Classification of Partial

Differential Equations. Numerical Solution of Elliptic , Parabolic & Hyperbolic Equations.

References:

1. Erwin Kreyszig: Advanced Engineering Mathematics, Wiley India.

2. B.S. Grewal: Higher Engineering Mathematics , Khanna Publication.

3. Engineering Mathematics By Samnta Pal and Bhutia, Oxford Publication

4. Ramana: Advance Engg. Mathematics, TMH New Delhi

5. Numerical Methods for Engineers by Steven C. Chapra, McGraw Hill Education

6. Introductory Methods of Numerical Analysis by S. S. Sastry, PHI Learning Pvt. Ltd.

7. Numerical Methods By Shrimanta Pal, Oxford

Continue Reading →

RGPV B.E Computer Science 3rd Semester CBCS Syllabus

Computer Science and Engg, III-Semester

Electronic Devices & Circuits

CSE (III Sem) Electronic Device & Circuits

• Semiconductor devices, theory of P-N junction, temperature dependence and break down characteristics, junction capacitances. Zener diode, Varactor diode, PIN diode, LED, Photo diode, Transistors BJT, FET, MOSFET, types, working principal, characteristics, and region of operation, load line biasing method. Transistor as an amplifier, gain, bandwidth, frequency response, Type of amplifier.

• Feedback amplifier, negative feedback, voltage-series, voltage shunt, current series and current shunt feedback, Sinusoidal oscillators, L-C (Hartley-Colpitts) oscillators, RC phase shift, Wien bridge, and Crystal oscillators. Power amplifiers, class A, class B, class A B, C amplifiers, their efficiency and power Dissipation. 

• Switching characteristics of diode and transistor turn ON, OFF time, reverse recovery time, transistor as a switch, Multivibrators, Bistable, Monostable, Astable multivibrators. Clippers and clampers, Differential amplifier, calculation of differential, common mode gain and CMRR using h parameters.

• Operational amplifier characteristics, slew rate, full power bandwidth, offset voltage, bias current, application ,inverting , non inverting amplifier , summer, differentiator, integrator, differential amplifier, instrumentation amplifier, log and antilog amplifier , voltage to current and current to voltage converters , comparators Schmitt trigger .

• Introduction to IC, Advantages and limitations, IC classification, production process of monolithic IC, fabrication of components on monolithic IC, IC packing, general integrated circuit technology, photolithographic process, un polar IC’s, IC symbols.

References:

1. Milliman Hallkias - Integrated Electronics; TMH Pub.

2. Gayakwad; OP-amp and linear Integrated Circuits; Pearson Education

3. Salivahanan; Electronic devices and circuits; TMH

4. Robert Boylestad & Nashetsky; Electronics Devices and circuit Theory; Pearson Ed.

5. Salivahanan; Linear Integrated Circuits; TMH

6. Miliman Grabel; Micro electronics, TMH

List of Experiments:

1. Diode and Transistor characteristics

2. Transistor Applications (Amplifier and switching)

3. OP-Amp and its Applications

4. 555 timer and its Applications

Digital Circuit & Design

• Number systems & codes, Binary arithmetic, Boolean algebra and switching function. Minimization of switching function, Concept of prime implicant, Karnaugh map method, Quine McCluskey’s method,Cases with don’t care terms, Multiple output switching function.

• Introduction to logic gates, Universal gate, Half adder,Half subtractor, Full adder, Full subtractor circuits, Series & parallel addition, BCD adders, Look-ahead carry generator.

• Linear wave shaping circuits, Bistable, Monostable & Astable multivibrator, Schmitt Trigger circuits & Schmitt-Nand gates. Logic families:RTL, DTL, All types of TTL circuits, ECL, I2L, PMOS, NMOS, & CMOS logic, Gated flip- flops and gated multivibrator, Interfacing between TTL to MOS.

• Decoders, Encoders, Multiplexers, Demultiplexers, Introduction to various semiconductor memories, & designing with ROM and PLA. Introduction to Shift Registers, Counters, Synchronous & Asynchronous counters, Designing of combinational circuits like code converters.

• Introduction of Analog to Digital & Digital to Analog converters, sample & hold circuits and V-F converters.

References:

1.M. Mano; “ Digital Logic & Computer Design”; Pearson

2.Malvino Leach; “Digital Principles & Applications”;TMH

3.Millman & Taub; “Pulse Digital & Switching Waveforms”;TMH

4. W.H Gothman; “Digital Electronics”;PHI

5. R.P.Jain “Modern Digital Electronics” TMH

List of Experiments :

1.To study and test operation of all logic gates for various IC’s )IC#7400, IC#7403, IC#7408, IC#7432,

IC#7486)

2.Verification of DeMorgan’s Theorem.

3.To construct half adder and full adder.

4.To construct half subtractor and full subtractor circuits.

5.Verification of versatility of NAND gate.

6. Verification of versatility of NOR gate.

7. Designing and verification of property of full adder.

8.Design a BCD to excess-3 code convertor.

9.Design a Multiplexer/Demultiplexer

Data Structures-II

Unit- I

Introduction – Common operations on data structures, Types of data structures, Data structures &

Programming, Program Design, Complexities, Time Complexity, order of Growth, Asymptotic

Notation.

Unit- II

Advanced Data Structures-Hash tables ,Heaps , Complexity , Analysis of Heap Operations , Application

of Heap , AVL tress , Insertion & Deletion in AVL tree , Red Black Trees , Properties of Red Black

trees ,Insertion & Deletion in Red Black tree .

Unit- III

Sorting –Need for sorting , Types of sorting algorithm-Stable sorting Algorithm, Internal & External

sorting algorithm , Outline and offline algorithm ,Sorting Techniques-Insertion , Shell , Selection ,

Merge ,Quick sort, Radix sort ,bucket sort .

Unit- IV

Augmenting Data structures – Augmenting a red black trees, Retrieving an element with a given rank , Determining the rank of element ,Data structure Maintenance ,An augmentation strategy ,Interval Trees.

Unit- V

File structures- Basic file operations, File organization –Sequential file organization, Indexed sequential file organization, Direct file organization. External merge sort, Multiway Merge sort, Tournament Tree, Replacement Selection .

REFERENCES:

1. Horowitz and Sahani, “Fundamentals of data Structures”,University Press

2. Trembley and Sorenson , “Data Structures”, TMH Publications

3..A. M. Tenenbaum, “Data Structures using C & C++”, Pearson Pub

4. Venkatesan , Rose, “Data Structures” Wiley India Pvt.Ltd

5. Pai; Data structure and algorithm , TMH Publications

6. T.H.Coreman,”Introduction to algorithm”,PHI.

Discrete Structures

Unit-I

Set Theory, Relation, Function, Theorem Proving Techniques : Set Theory: Definition of sets, countable and uncountable sets, Venn Diagrams, proofs of some general identities on sets Relation: Definition, types of relation, composition of relations, Pictorial representation of relation, Equivalence relation, Partial ordering relation, Job-Scheduling problem Function: Definition, type of functions, one to one, into and onto function, inverse function, composition of functions, recursively defined functions, pigeonhole principle. Theorem proving Techniques: Mathematical induction, Proof by contradiction.

Unit-II

Algebraic Structures: Definition, Properties, types: Semi Groups, Monoid, Groups, Abelian group,

properties of groups, Subgroup, cyclic groups, Cosets, factor group, Permutation groups, Normal

subgroup, Homomorphism and isomorphism of Groups, example and standard results, Rings and Fields: definition and standard results.

Unit-III

Propositional Logic: Proposition, First order logic, Basic logical operation, truth tables, tautologies,

Contradictions, Algebra of Proposition, logical implications, logical equivalence, predicates, Normal

Forms, Universal and existential quantifiers. Introduction to finite state machine Finite state machines as models of physical system equivalence machines, Finite state machines as language recognizers

Unit-IV

Graph Theory: Introduction and basic terminology of graphs, Planer graphs, Multigraphs and weighted graphs, Isomorphic graphs, Paths, Cycles and connectivity, Shortest path in weighted graph,

Introduction to Eulerian paths and circuits, Hamiltonian paths and circuits, Graph coloring, chromatic

number, Isomorphism and Homomorphism of graphs.

Unit V

Posets, Hasse Diagram and Lattices: Introduction, ordered set, Hasse diagram of partially, ordered set, isomorphic ordered set, well ordered set, properties of Lattices, bounded and complemented lattices.

Combinatorics: Introduction, Permutation and combination, Binomial Theorem, Multimonial

Coefficients Recurrence Relation and Generating Function: Introduction to Recurrence Relation and

Recursive algorithms , Linear recurrence relations with constant coefficients, Homogeneous solutions, Particular solutions, Total solutions , Generating functions , Solution by method of generating functions.

References:

1. C.L.Liu, “Elements of Discrete Mathematics” Tata Mc Graw-Hill Edition.

2. Trembley, J.P & Manohar; “Discrete Mathematical Structure with Application CS”, McGraw Hill.

3. Kenneth H. Rosen, “Discrete Mathematics and its applications”, McGraw Hill.

4. Bisht, “Discrete Mathematics”,Oxford University Press

5. Biswal,”Discrete Mathematics & Graph Theory”, PHI

RGPV B.E 3rd Semester CBCS Syllabus.

RGPV B.E Civil 3rd Semester CBCS Syllabus

Continue Reading →