**Syllabus of Gujarat Technical University 3rd Sem CSE**

**GUJARAT TECHNOLOGICAL UNIVERSITY **

**B.E Semester: 3**

** **

**Subject Name Basic Electronics**

1. Energy Bands in Solids: Charged Particles, Field Intensity, Potential Energy, The eV Unit of Energy, The Nature of the Atom, Atomic Energy Levels, Electronic Structure of The Elements, The Energy Band Theory of Crystals, Insulators, Semiconductors and Metals

2 Transport Phenomena in Semiconductors: Mobility and Conductivity, Electrons and Holes in an Intrinsic Semiconductor, Donor and Acceptor Impurities, Charge Densities in a Semiconductor, Electrical Properties of Ge and Si, The Hall Effect, Conductivity Modulation, Generation and Recombination of Charges, Diffusion, The Continuity Equation, Injected Minority –Carrier Charge, The Potential Variation within a Graded Semiconductor

3 Junction –Diode Characteristics: Open –Circuited p-n Junction, p-n Junction as a Rectifier, Current Components in a p-n Diode, Volt-Ampere Characteristic, Temperature Dependence of the V/I Characteristic, Diode Resistance, Space Charge, Transition Capacitance, Charge-Control Description of a Diode , Diffusion Capacitance , Junction Diode Switching Times, Breakdown Diodes, Tunnel Diode, Semiconductor Photodiode, Photovoltaic Effect, Light –Emitting Diodes

4 Diode Circuits: Diode as a Circuit Element, Load-Line Concept, Piecewise Linear Diode Model, Clipping Circuits, Clipping at Two Independent Levels, Comparators, Sampling Gate, Rectifiers, Other Full-Wave Circuits, Capacitor Filters, Additional Diode Circuits

5 Transistor Characteristics: Junction Transistor, Transistor Current Components, Transistor as an Amplifier, Transistor Construction, CB Configuration, CE Configuration, CE Cutoff region, CE Saturation Region, Typical Transistor, CE Current Gain, CC Configuration, Analytical Expressions for Transistor Characteristics Maximum Voltage Rating, Phototransistor

6 Transistor at Low Frequencies: Graphical Analysis of the CE configuration, Two-Port Devices and the Hybrid Model, Transistor Hybrid Model, h-Parameters, Conversion Formulas for the Parameters of Three Transistor Configurations, Analysis of a Transistor Amplifier Circuit Using h Parameters, Thevenin’s and Norton’s Theorems and Corollaries, Emitter Follower, Comparison of Transistor Amplifier Configurations, Linear Analysis of a Transistor Circuit, Miller’s Theorem and its Dual, Cascading Transistor Amplifiers, Simplified CE Hybrid Model, Simplified Calculations for the CC Configuration, CE Amplifier with an Emitter Resistance, High Input Resistance Transistor Circuits

7 Transistor Biasing and Thermal Stabilization: Operating Point, Bias Stability, Self-Bias , Stabilization against Variations in

ICO, VBE and β, General Remarks on Collector-Current Stability, Bias Compensation, Thermistor and Sensistor Compensation, Thermal

Runaway, Thermal Stability

8 Field Effect Transistors: Junction FET, Pinch-Off Voltage, JFET Volt-Ampere Characteristics, FET Small-Signal Model, MOSFET, Digital MOSFET Circuits, Low Frequency CS and CD Amplifiers, Biasing the FET, The FET as a Voltage Variable Resistor, CS Amplifier at High Frequencies, CD Amplifier at High Frequencies

9 Power Circuits and Systems: Class A large Signal Amplifiers, Second Harmonic Distortion, Higher –Order

Harmonic Generation, Transformer Coupled Audio Power Amplifier, Efficiency, Push-Pull Amplifiers, Class B Amplifiers, Class AB Operation, Regulated Power Supplies, Series Voltage Regulator

Reference Books:

1. Integrated Electronics By Jacob Millman and Christos C. Halkias, Tata McGraw Hill Publication

2. Electronics Devices by Floyd , Pearson Publication [Seventh edition]

3. Electronic Devices and Circuit Theory by Robert Boylestad and Louis Nashelsky [Ninth Edition]

**Subject Name DATA AND FILE STRUCTURES**

1. INTRODUCTION TO DATA STRUCTURE: Data Management concepts, Data types – primitive and nonprimitive, Performance Analysis and Measurement (Time and space analysis of algorithms-Average, best and worst case analysis), Types of Data Structures- Linear & Non Linear Data Structures.

2. LINEAR DATA STRUCTURE Array: Representation of arrays, Applications of arrays, sparse matrix and its representation., Stack: Stack-Definitions & Concepts, Operations On Stacks, Applications of Stacks, Polish Expression, Reverse Polish Expression And Their Compilation, Recursion, Tower of Hanoi, Queue: Representation Of Queue, Operations On Queue, Circular Queue, Priority Queue,Array representation of Priority Queue, Double Ended Queue, Applications of Queue, Linked List: Singly Linked List, Doubly Linked list,

Circular linked list ,Linked implementation of Stack, Linked implementation of Queue, Applications of linked list.

3. NONLINEAR DATA STRUCTURE : Tree-Definitions and Concepts, Representation of binary tree, Binary tree raversal (Inorder, postorder, preorder), Threaded binary tree, Binary search trees, Conversion of General Trees To Binary Trees, Applications Of Trees-

Some balanced tree mechanism, eg. AVL trees, 2-3 trees, Height Balanced, Weight Balance , Graph-Matrix Representation Of Graphs,

Elementary Graph operations,(Breadth First Search, Depth First Search, Spanning Trees, Shortest path, Minimal spanning tree )

4. HASHING AND FILE STRUCTURES : Hashing: The symbol table, Hashing Functions, Collision-Resolution Techniques, File Structure: Concepts of fields, records and files, Sequential, Indexed and Relative/Random File Organization, Indexing structure for index files, hashing for direct files, Multi-Key file organization and access methods.

5. PRACTICAL DETAILS: At least 10 practical should be performed by students using programming

language.

Reference Books:

1. An Introduction to Data Structures with Applications. by Jean-Paul Tremblay & paul G. Sorenson Publisher-Tata McGraw Hill.

2. Data Structures using C & C++ -By Ten Baum Publisher – Prenctice-Hall International.

3. Fundamentals of Computer Algorithms by Horowitz, Sahni,Galgotia Pub. 2001 ed.

4. Fundamentals of Data Structures in C++-By Sartaj Sahani.

5. Data Structures: A Pseudo-code approach with C -By Gilberg & Forouzan Publisher-Thomson Learning.

**Subject Name: DIGITAL LOGIC DESIGN**

1. Binary System: Digital computer and digital systems, Binary Number, Number base conversion Octal and Hexadecimal Number, complements, Binary Codes, Binary Storage and register, Binary Logic, Integrated Circuit

2. Boolean Algebra and Logic Gates : Basic Definition, Axiomatic Definition of Boolean Algebra, Basic Theorem and Properties of Boolean Algebra, Minterms And Maxterms, Logic Operations, Digital Logic Gates, IC digital Logic Families

3. Simplification of Boolean Functions: Different types Map method, Product of sum Simplification, NAND or NOR implementation, Don’t Care condition, Tabulation method

4. Combinational Logic : Introduction, Design Procedure, adder, subtractor, Code Conversion, Universal Gate

5. Combinational Logic With MSI AND LSI : Introduction, Binary Parallel Adder, Decimal Adder, Magnitude Comparator, Decoder, Multiplexer, ROM, Programmable Logic Array.

6. Sequential Logic: Introduction, Flip-Flops, Triggering of Flip-Flops, Analysis of Clocked Sequential Circuits, State Reduction and Assignment, Flip-Flop Excitation Tables, Design Procedure, Design of Counters, Design with State Equations

7. Registers Transfer Logic & Micro-Operation : Introduction, Inter-register Transfer, Arithmetic, logic and shift MicroOperations, Conditional Control Statements, Fixed-Point Binary Data, overflow, Arithmetic Shifts, Decimal Data, Floating-Point Data, Instruction

Codes, Design of Simple Computer

8. Registers, Counters and the Memory unit : Introduction, Registers, Shift Registers, Ripple Counters, Synchronous

Counters, Timing Sequences, Memory unit.

9. Processor Logic Design : Introduction, Processor Organization, Arithmetic Logic Unit, Design of Arithmetic and logic circuit, Design of ALU. Status Register, Design of shifter, Processor Unit,Design of Accumulator.

10. Control Logic Design : Introduction, Control Organization, Hard-Wired Control, Micro-Program

Control.

Reference Books:

1. Digital Logic and Computer Design By M Morris Mano

2. Principle of digital Electronics By Malvino & Leach

3. Modern Digital Electronics By R.P.Jain

**Subject Name DATABASE MANAGEMENT SYSTEM**

1. Introductory concepts of DBMS : Introduction and applications of DBMS, Purpose of data base, Data Independence, Database System architecture- levels, Mappings, Database users and DBA

2. Relational Model : Structure of relational databases, Domains, Relations, Relational algebra – fundamental operators and syntax, relational algebra queries

3. Entity-Relationship model : Basic concepts, Design process, constraints, Keys, Design issues, E-R diagrams, weak entity sets, extended E-R features – generalization, specialization, aggregation, reduction to E-R database schema

4. 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, BCNF, Multivalued dependency, 4NF, Join dependency and 5NF

5. 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, materialized views

6. Transaction Management : Transaction concepts, properties of transactions, serializability of transactions, testing for serializability, System recovery, Two- Phase Commit protocol, Recovery and Atomicity, Log-based recovery, concurrent

executions of transactions and related problems, Locking mechanism, solution to concurrency related problems, deadlock, , two-phase locking protocol, Isolation, Intent locking

7. Security: Introduction, Discretionary access control, Mandatory Access Control, Data Encryption

8. SQL Concepts : Basics of SQL, DDL,DML,DCL, structure – creation, alteration, defining constraints – Primary key, foreign key, unique, not null, check, IN operator, aggregate functions, Built-in functions –numeric, date, string functions, set operations, sub-queries, correlated sub-queries, join, Exist, Any, All , view and its types., transaction control commands.

9. PL/SQL Concepts : Cursors, Stored Procedures, Stored Function, Database Triggers

Reference Books:

1. An introduction to Database Systems, C J Date, Addition-Wesley.

2. Database System Concepts, Abraham Silberschatz, Henry F. Korth & S. Sudarshan, McGraw Hill.

3. Understanding SQL by Martin Gruber, BPB

4. SQL- PL/SQL by Ivan bayross

5. Oracle – The complete reference – TMH /oracle press

**Subject Name COMPUTER ORGANIZATION AND ARCHITECTURE**

1. OVERVIEW OF REGISTER TRANSFER AND MCROOPERATIONS: Register Transfer Language, Register transfer, Bus and Memory transfer, Arithmetic Micro-operations,Logic Micro-operations, Shift Microoperations, Arithmatic Logic Shift Unit.

2. BASIC COMPUTER ORGANIZATIONAND DESIGN : Instruction codes,Computer registers, computer instructions, Timing and

Control, Instruction cycle, Memory-Reference Instructions, Input-output and interrupt, Complete computer description, Design of Basic computer, design of Accumulator Unit.

3. PROGRAMMING THE BASIC COMPUTER: Introduction, Machine Language, Assembly Language, the Assembler, Program loops, Programming Arithmetic and logic operations, subroutines, I-O Programming.

4. MICROPROGRAMMED CONTROL: Control Memory, Address sequencing, Microprogram Example, design of control Unit

5. CENTRAL PROCESSING UNIT: Introduction, General Register Organization, Stack Organization, Instruction format, Addressing Modes, data transfer and manipulation, Program Control, Reduced Instruction Set Computer (RISC)

6. PIPELINE AND VECTOR PROCESSING: Parallel Processing, Pipelining, Arithmetic Pipeline, Instruction, Pipeline, RISC Pipeline, Vector Processing, Array Processors

7. COMPUTER ARITHMETIC: Introduction, Addition and subtraction, Multiplication and Division Algorithms, Floating Point Arithmetic, Decimal Arithmetic Unit and Operations

Reference Books:

1. Computer System Architecture : By M. Morris Mano.

2. Structured Computer Organization : By Tanenbaum

3. Computer Organization : By Stallings.

4. Computer Architecture and Organization : By Hayes.

**Subject Name Mathematics – 3**

1. First order ODE: Methods for solving them, homogeneous equations, exactness, methods for

finding integrating factors, Linear and Bernoulli’s equation.

2. Higher order ODE: Linear ODEs (generalities) complimentary function as and particular integrals, linear dependence and independence of functions, Wronskians, Abel-Liouville formula, use of a known solution (for reduction of order)

method of variation of parameter.

3. Linear ODEs with constant coefficient and the Cauchy Euler equation. the characteristic polynomial and indicial polynomial, discussion of the case of complex roots and repeated roots, extracting the real form of the solution via

Euler’s formula = + , method of undetermined coefficient for finding the particular integral for special right hand sides. (forcing functions) both for constant coefficient ODEs as well as Cauchy Euler ODEs.

4. Beta Gamma functions and their basic properties, statement of Euler’s reflection formula, duplication formula via beta gamma.

5. Laplace transforms: Definition of functions of exponential type with examples. Definition of the Laplace transform and its basic properties as well as examples of Laplace transforms of exponential function, polynomials and trigonometric functions.

Statement of the Riemann Lebesgue lemma. Finding the inverse transform. Laplace transform of and () Heaviside unit step function and shifting theorems. Convolution and the convolutions theorem. Beta gamma identity. Use of Laplace transform for solving IVP for ODEs and systems of ODEs. Computing certain important integrals via Laplace transforms.

6. Series solution of ODEs, Illustrative examples as the equations of Legendre, Tchebychev etc., Legendre polynomials, their Orthogonality and completeness.

7. Ordinary differential equations with regular singular points and the method of Frobenious. Detailed discussion of Bessel’s equations and Bessels’ functions of first kind only. Basic properties of J xp ( ), the recurrence relation

between J xp−1 ( ), J xp ( ) and J xp+1 ( ). Integral representation of J xn ( )(where n is a non negative integer).

8. Fourier series and Fourier transforms Basic formulae in Fourier series. Statement of the theorem on pointwise convergence of Fourier series. Parsevals formula (statement only) and Bessel’s inequality with examples. Mean convergence of Fourier series. Fourier transforms and its basic properties. Fourier transform of the Gaussian and the Fourier inversion theorem (statement only). Riemann

Lebesgue lemma for Fourier series and Fourier transforms (statement only).

9. Basic partial differential equations of mathematical physics and their origins (vibrating strings, vibrating membrances heat conduction in solids etc.,). Solving PDEs via the method of separation of variables. The Laplace operator in cylindrical and spherical polar coordinates. Brief discussion of Fourier Bessel series. Solution via Fourier series/Fourier-Bessel series for rectangular and circular domains in R^{2 }and spherical and cylindrical domains in R^{3.}

Reference Books:

1. E.Kreyszig, Advanced engineering mathematics (8thEdition), John Wiley(1999).

2. W. E. Boyce and R. DiPrima, Elementary Differential Equations (8thEdition),John Wiley (2005).

3. R. V. Churchill and J. W. Brown, Fourier series and boundary value problems (7thEdition), McGraw-Hill (2006).

4. T.M.Apostol, Calculus , Volume-2 ( 2ndEdition ), Wiley Eastern , 1980

**To download engineering ebooks, medical ebooks, management ebooks, free ebooks please visit www.kopykitab.com**