####
**Sub-Directories of Knols in the Area of Computer Science and Engineering**

**Sub-Directories of Knols in the Area of Computer Science and Engineering**

#### _______________________________________________________

### Computer Science

- Accessibility in Interaction Design
**NEW!** - A Conceptual Guide to OpenOffice.org 3
- AJAX Programming
**NEW!** - Applescript for Absolute Beginners
- Basic Computing Using Windows
- Basic Linux Commands
**NEW!** - BecomeAnXcoder
- Blown to Bits: Your Life, Liberty, and Happiness After the Digital Explosion
- Cascading Style Sheets (Wikibook)
- CGI Programming on the World Wide Web (Assayer review)
- Database Development Lifecycle
**NEW!** - A Designer’s Log: Case Studies in Instructional Design
- Designing the User Interface
**NEW!** - Distributed Systems
**NEW!** - Dive into Python
- Electronic Commerce: The Strategic Perspective
- Finding Information in Information Technology and Computing
*NEW!* - Firefox Manual
- Flash Tutorials
- FLOSS Manuals
- The Future of the Internet and How to Stop It
- Green IS: Building Sustainable Business Practices
**NEW!** - Grokking the Gimp (Assayer review)
- How to Think Like a Computer Scientist with Python (Assayer review)
- HyperText Markup Language (Wikibook)
- Information on the Web
**NEW!** - Interpreting Information Systems in Organizations (Global Text Project)
- Introducing ICT Systems
**NEW!** - Introduction to Computer Science
- An introduction to Data and Information
**NEW!** - Introduction to Databases and MySQL
**NEW!** - Introduction to Digital Logic with Laboratory Exercises
- Introduction to SCORM
- LaTeX
- Learning 2.0
- Learning 2.0 for Associations
- Lessons in Electric Circuits (Assayer review)
- Linux 101 (Assayer review)
- Linux for IT Managers
**NEW!** - Multimedia Training (videos)
- Nework Security
**NEW!** - OpenOffice.org Manual
- O’Reilly Open Books
- Operating Systems for Single-Threaded Computers
- Programming from the Ground Up
- Programming Fundamentals – A Modular Structured Approach (Connexions)
- Programming Fundamentals
- Programming in C
- Programming Languages
**NEW!** - Programming Using Java
- Representing and Manipulating Data in Computers
**NEW!** - Structure and Interpretation of Computer Programs
- Stanford Engineering Everywhere – Introduction to Computer Science
- Student Tools (videos)
- Successful Project Management
**NEW!** - Think Python: An Introduction to Software Design
- Video Translation
- Web Security
**NEW!** - Wireless Networking in the Developing World
- XML – Managing Data Exchange

#### __________________________________________________________

Semester: III Lect: 4Hr

Branch:ENC/CST/IT Credit: 04

Definition, properties with regards to summation, differentiation and integration. Laplace transform of standard functions. Theorems on Laplace transform, Shifting properties. Laplace transform of t f(t), f(t) / t.

Laplace transform of derivative of a function, integral of a function.

Evaluation of inverse Laplace transform (by standard formulae and partial fraction method)

Laplace transform of periodic functions, step functions and its derivatives.

Convolution integral and its application in finding the inverse Laplace transform.

Solving differential equation by Laplace transform. Applications in Engg.

2. FOURIER SERIES

Orthogonal functions, expression of a function in a series of orthogonal functions.

Fourier series, definition and condition for its existence, Evaluation of Fourier Coefficients.

Even and Odd functions, Evaluation of Fourier series of even and odd functions

Half range sine and cosine series. Parseval’s theorem and its relations.

Complex form of Fourier series, Introduction to Fourier integrals, Fourier transform, Sine transform, Cosine transform-properties and its elementary applications.

Parseval’s identity and evaluation of definite integrals by using it. Applications in Engg.

SECTION – B

3. COMPLEX VARIABLES

Complex number, representation in Cartesian, Polar and exponential forms. De Moiver’s Theorem and its application to complex numbers. Complex variable (and variables). Continuity, Differentiability of functions of complex variables. Necessary and sufficient conditions for a function to be analytic (Cauchy Riemann Equations in cartesian and polar co-ordinates with proof). Determining the function of a complex variable f(z) from its real and imaginary parts using Cauchy Riemann Equations. Applications in Engg.

4. MAPPING

Conformal mapping and bilinear mapping Geometrical interpretations of mapping. Concept of line integral and its relation with Riemann integral. Concept of point function and path independent functions. Contour integral. Cauchy’s theorem for analytic functions and its applications for multiply connected domains. Cauchy’s integral formula and nth derivative of a complex function Morera’s theorem, maximum modulus theorem (Statements and proof’s). Taylor’s and Lorents development of a functions of a complex variable. Singularities – isolated essential singularity and non isolated singularity. Poles, evaluation of residues. Residue theorem and its application to evaluate real integrals. Applications in Engg.

2. Edwin Kreyszig, Advance Engg. Mathematics, 5th Edition, New Age International (P) Ltd; 1997. (Rs. 295/-)

3. P.N.Wartikar & J. N. Wartikar, Elements of Applied Mathematics, 1st edition, Pune Vidyarthi Griha Prakashan, 1995. (rs. 110/-)

Semester: III Lect: 4 Hr

Branch: ENC / CST / IT Credit: 04

Diodes & Transistors as ‘Switch’ in Digital Circuits, Applications of Digital Logic Circuits, Positive Logic & Negative Logic.

Decimal, Binary, Octal & Hexadecimal, Double – Dabble, Hex-Dabble, Octal Dabble & Streamlined Methods of Interconversions.

Signed – Magnitude Method

1’s Complement Method

2’s Complement Method

Arithmetic operations on binary number system, addition, subtraction, multiplication & division. Hexadecimal addition & subtraction. Octal addition & subtraction. 9’s complement & 10’s complement methods.

Weighted & non-weighted codes. Standard 8421 code, XS-3 code & gray code. XS-3 code numbers addition, gray to binary & binary to gray conversions. Concept of parity, odd & even parity. Error detecting methods: parity & forbidden group.

OR, AND, NOT, NOR, NAND, X-OR gates EX-NOR. Truth-tables & their equivalent Ckts. Using switches diodes & transistors.

NAND & NOR as universal gates.

N-OR gate as parity checker & parity generator. Realization of Boolean expression using gates.

De Morgan’s Theorems

Realization of De Morgan’s theorems using gates.

Reduction Techniques

1) Laws of Boolean algebra

2) K-map reduction techniques

SOP & POS using universal gates.

(concept of minterms & maxterms)

K-map using two, three, four & five variables.

Duality Theorem

K-map reduction techniques : pairs, quads, octets, rolling, overlapping etc.

Quine-Maclusky method .

Combinational Circuits (Data Processing Circuits)

Encoders & Decoders

2 : 4, 3 : 8 encoder BCD to decimal

decoder, IC7445, IC74154

Decoder drivers: 7-segment display (MAN-72)

IC 7446, IC 7447 & IC 7448.

Encoders: Decimal to BCD encoder IC 74147.

IC 74150, IC 74151 & IC 74155

Their applications (Boolean function simplification using mux & demux)

Half-adder, full adder, half subtractor, full subtractor

B421 adder – subtractor, BCD adder subtractor, XS-3 adder, 4-bit parallel binary adder-subtractor (without using k-maps).

8421 adder-subtractor using IC 7483.BCD adder using IC 7483,XS-3 adder using IC 7483.

Flip-flops R-S, ƒƒ, ƒK ƒƒ, D ƒƒ, T ƒƒ, master slave JK ƒƒ their properties & truth tables conversion of one type of ƒƒ into another without using K-maps. Timing diagrams IC 7474, IC 7446.

Counters

Principles of working of a 3-bit ripple counter, synchronous counter, preset table counter, mod-3,mod-6,mod-5,mod-7, mod-10, and mod-12, using decoding gates.

Ring counter,Twisted ring counter.Glitch and gating of a counter.

IC 7490, IC 7493, IC 7495, IC 74193.

Principle of working of buffer register, shift-left, shift-right register.

Four types of register: SISO, SIPO, PISO, PIPO,Typical shift register.Mode controlled shift register.

Classification and characteristics of memories.

Methods of address decoding, memory cells.

ROM memories-Masked ROM,PROM,EPROM,EEPROM.

RAM memories:-TTL RAM,NMOS RAM,Dynamic RAM.

Their principles of working, critical values for I/P, O/P vtg. Levels, curr. Sinking & sourcing, fan-out, noise immunity.

Study of basic 2-i/p TTL NAND gate and its transfer characteristics..

2. Malvino Leach, “Digital Principles & Applications”, 4th edition.

3. R. P. Jain, “Modern Digital Electronics” 2nd edition, Rs.150/-.

Branch: CST Credit: 04

Connectives: conjunction, disjunction, negation, statement formulas and truth table, conditional, bi-conditional, well formed formulas, tautology, contradiction, laws of logic’s, equivalence of formulas, duality law, tautological implication, formulas with distinct truth table, other connectives such as XOR, NAND, NOR.

Normal forms: disjunctive normal form, conjunctive normal form, principal disjunctive normal form, principal conjunctive normal form, ordering and uniqueness of normal forms. Principle of mathematical induction.

Predicate calculus: predicates, the statement functions, variables, universal and existential quantifiers, predicate formulas, free and bound variables, the universe of discourse.

• Set Theory: Introduction, basic concept of set theory, set notation and description, inclusion and equality of sets, finite and infinite set, null set, power set.

Basic set operations such as intersection, union, relative and absolute complement, Cartesian product, and symmetric difference. Disjoint sets, partitions of a set, Venn diagram.

Methods of proof for sets: by using example, by using Venn diagram, by using set membership tables, by using definitions. Laws of set theory, proof using previously proven theorem, proofs using indirect method.

• Counting: permutations and combinations, the pigeonhole principle, elements of probability, recurrence relations.

• Relations: Basic definition, relation notation, and set arising from relations.

Properties of relation: reflexive, irreflexive, symmetric, asymmetric, anti-symmetric, transitive.

Relation matrix and graphs of relation: paths in relation and digraph, composition of paths, identification of properties of relations from relation matrix and graph.

Equivalence relation: definition, determination of equivalence relation from partitions, equivalence classes, properties of equivalence classes.

Manipulation of relations: Boolean product of relation matrices, inverse of a relation, composition of a relation, inverse of a composite relation, complementary relation.

Closures: reflexive, symmetric and transitive closure of a relation, transitive closure by Warshall’s algorithm.

• Functions: definition, image of a function, and restriction of function to a set.

Special types of functions: injective, surjective, bijective, invertible, identity, floor, ceiling, and characteristic function of a set, composition of functions.

Permutation function: definition, different properties.

Growth of a function: Big O notation, big relation and rules of determining classes of a function.

• Algebraic structure: binary and n-ary operations on a set, representation of binary operation by composite table, properties of binary operations.

Algebraic system: definition, some simple algebraic system, and properties of algebraic system such as homomorphism, epimorphism, monomorphism, isomorphism, and endomorphism. Direct product of algebra, congruence relation.

Semigroups and monoids: definition, notation, product of partition, cyclic monoid, different properties of semigroup and monoid such as homomorphism, epimorphism, monomorphism, isomorphism, endomorphism, automorphism implications of homomorphism.

Product and quotient of Semigroups: congruence relation, quotients of semigroups, and direct product of semigroups, Subsemigroup and submonoid.

Groups: definition, notation, order of a group, abelian group, cyclic group, subgroup, proper subgroup, group homomorphism, kernel of the homomorphism, Cosets and LaGrange’s Theorem, normal subgroups, product of groups, quotients of groups.

Ring: definition, properties, ring homomorphism, field.

• Lattice and Boolean algebra: Partial order relation, poset, comparable and incomparable elements, linear ordering, totally order set or chain, lexicographic order, cover of an element, Hasse diagram, different features of Hasse diagram, topological sorting, isomorphism between two poset, extremal elements of posets such as minimal, maximal, least, greatest, upper bound, lower bound, least upper bound, greatest lower bound.

Lattice: Definition, properties of lattice, sublattice, direct product of lattices, lattice homomorphism, isomorphism, endomorphism, automorphism, order preserving, order isomorphism, complete lattice, bounded lattice, complemented lattice, distributive lattice.

Boolean algebra: definition, properties of Boolean algebra, sub algebra, direct product of Boolean algebra, Boolean functions as Boolean polynomials.

• Graphs and Trees: Introduction, definition, applications of graph, finite and infinite graph, incidence and degree, isolate vertex, pendant vertex, null graph.

Paths and Circuits: isomorphism, subgraphs, and coloring of a graph, component of a graph, Euler graph, and operation on graphs, Hamiltonian paths and circuits.

Trees and fundamental circuits: definition, properties of trees, pendant vertices in tree, distance and centers in tree, rooted and binary tree, on counting tree, undirected tree, spanning tree, fundamental circuits, finding all spanning trees of a graph, spanning trees in a weighted graph (Prim’s and Kruskal’s algorithm).

1. J. P. Tremblay, and R. Manohar, Discrete mathematical structures with applications to computer science, Tata McGraw Hill,

2. Bernard Kolman, Robert C. Busby, and Sharon Ross, Discrete mathematical structures, 4th edition, PHI, 2002. (Rs. 195/-)

3. Narsing Deo, Graph theory and applications to engineering and computer science, PHI, 1999. (Rs. 150/-)

4. Alan Doerr and Kenneth Levasseur, Applied discrete structures for computer science, Galgotia Publication, 1998. (Rs- 176/-)

5. C. L. Liu, Elements of Discrete Mathematics, 2nd edition, Tata McGraw Hill, 2000. (Rs. 175/-)

6. Frank Harary, Graph theory, Narosa Publication, 1998. (Rs. 135/-)

7. Douglas B. West, Introduction to graph theory, PHI, 1999. (Rs- 195/-)

Design & Analysis of Algorithms

Branch: CST / IT Credit: 04

Algorithm , Different study area’s in algorithm, Asymptotic notations.

Stack, queue and circular queues, insertion & deletion algotithm for stack, queue and circular queue, trees, Binary trees, Heap, different algorithm for creation of heap analysis of different algorithm for creation of heap, heapsort, Sets and disjoint set union, different algorithm for finding union of two sets and find the root of the tree, Graphs, Hashing, Hash function, Overflow handling, Collision handling ,Linear hashing, Hashing with chaining.

The general method, control abstraction for divide and conquer, Iterative form of divide and conquer control abstraction, Binary search, different algorithms for binary search, Finding the maximum & minimum, analysis of maxmin, Straightforward & Recursive algorithm, Mergesort, recursive algorithm for mergesort, analysis of mergesort, Quicksort, analysis of quicksort, sorting by partitioning, Selection, analysis of select, slection of element using median of median rule, Strassen’s matrix multiplication, and its analysis.

The general method, control abstraction, Optimal storage on tapes, Knapsack problem, algorithm for greedy_knapsack, Job sequencing with deadlines, A faster implementation of job sequencing, Algorithm for JS & FJS, Optimal merge patterns, Minimum spanning trees, Prim’s & Kruskal’s algorithm, Single source shortest paths algorithm.

The general method, principle of optimality, Multistage graphs, Algorithm for forward & backward approach, All pairs shortest paths, Optimal binary search trees, 0/1-knapsack, Reliability design, The travelling salesperson problem, Flow shop scheduling.

Binary tree traversal: Inorder, Preorder, Postorder traversal algorithms, Nonrecursive algorithm for inorder traversal, Tree traversal, Search and traversal techniques for graphs such as BFS, BFT, DFS, DFT, Code optimization, Code generation algorithm for machine A & B, AND / OR graphs, algorithm for determining the AND / OR tree T is solvable, breadth first generation of a solution tree, Game trees, post order evaluation of a game tree using different methods, Biconnected components and depth first search.

The general method, recursive backtracking algorithm, estimating the efficiency of backtracking, The 8–queens problem, Sum of subsets, recursive backtracking algorithm, Graph coloring, algorithm for finding m-colorings of a graph and generating a next color, Hamiltonian cycles, algorithm for generating a next vertex and finding all hamiltonian cycles, Knapsack problem, algorithm for a bounding function and backtracking solution to the 0/1 knapsack, modified knapsack algorithm.

The Method, LC-search, control abstraction for LC-Search, properties of LC-Search, LC-Search for least cost answer node, The 15-puzzle problem, Bounding, a FIFO branch and bound algorithm for job sequencing problem, LC Branch-and-bound, LC branch and bound to find minimum cost answer node, Zero-one-knapsack problem, function u( . ) for knapsack problem, LC branch and bound solution, algorithm to compute lower and upper bounds, algorithm for creating a new node and printing the answer, LC branch and bound algorithm for knapsack problem, FIFO branch and bound solution, reduction algorithm for knapsack problem, Traveling salesperson .

1. Ellis Horowitz, and Sartaj Sahani, Fundamentals of Computer Algorithms, Galgotia, 1999. (Rs. 195/-)

2. Aho, Hopcroft, Ullman, Data Structures and Algorithms, Addison-Wesley, 2000. (Rs. 225/-)

3. Knuth, Fundamentals of Algorithms, 2nd edition, Narosa Publication, 1998. (Rs. 185/-)

4. Kruse, Leung, Tondo, Data Structure and Program Design in C, Pearson Education, 2001. (Rs. 250/-)

5. Aho, Hopcroft, Ullman, Design and analysis of Algorithm, Addison-Wesley, 2000. (Rs. 251/-)

6. David Harrel, Algorithmics-The spirit of computing, 2nd edition, Addison-Wesley, 2000. (Rs. 275/-)

7. Herbert S. Wilf, Algorithms and Complexity, PHI, 1986. (Rs. 205/-)

8. S. E. Goodman and S. T. Hedetniemi, Introduction to the sesign and analysis of algoritms, McGraw Hill, 1988. (Rs. 371/-)

9. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Introduction to algorithms, PHI, 1988. (rs. 275/-)

10. Sara Baase, Alan Van Gelder, Computer algorithms introduction to design and analysis, 3rd edidtion, Addison-Wesley, 2000. (Rs. 325/-)

11. Gilles Brassard, Paul Bratley, Fundamentals of algorithmics, 4th edition, PHI, 2000. (Rs. 225/-)

Computer Architecture & Organization

Semester: IV Lect: 4 Hr

Branch: ENC / CST / IT Credit: 04

Introduction: Brief history of computers, basic building blocks of computer, organization & architecture, structure & functions, evolution of Pentium & power PC, various generations of computer evolutions, impact of VLSI on computer systems.

Cache memory: – concept of cache, performance of cache, types of cache architectures, memory mapping techniques, and page replacement policies

Data path design: Concept of data processing unit, Fixed-point arithmetic: addition, subtraction, multiplication, and division. Designing aspects related to arithmetic operations, combinational ALU and sequential ALU, advanced ALU.

System Organisation: Use of computer in commutations, serial communications and parallel communication, network topologies, LAN and WAN in brief, various ways to improve the speed of computer, concept of parallel processing, Flynn’s classification of parallel computers, benefits of parallel processing, multiprocessing.

1. William Stallings, Computer Organization and Architecture, 4th Edition, PHI, 1998. (Rs. 325/-)

2. John P Hayes, Computer Architecture and Organization, 3rd Edition, McGraw Hill, 1998. (Rs. 314/-)

3. Andrew C. Tanenbaum, Structured Computer Organization, 3rd Edition, PHI. (Rs. 150/-)

4. M. Morris Maw, Computer System Architecture, 3rd Edition, PHI, 1998. (Rs. 150/-)

Branch: CST Credit: 04

1.1 Evolution of operating systems

1.1.1 Serial Processing

1.1.2 Batch Processing

1.1.3 Multiprogramming

1.2 Types of operating systems

1.2.1 Batch operating systems

1.2.2 Multiprogramming operating systems

1.2.3 Time – sharing systems

1.2.4 Real – time system

2.1 The process concept

2.2 Process scheduling

2.2.1 Process control block (PCB)

2.2.2 Process State Transitions

2.2.3 Process scheduling queue

2.3 Operations on processes

2.3.1 Process creation

2.3.2 Process suspend/resume

2.3.3 Process termination

2.4 Cooperating Processes

2.5 Interprocess Communication

3.1 Types of Schedulers

The long – term scheduler

The medium – term scheduler

The short-term scheduler

3.2 Scheduling Algorithms

3.2.1 First-Come – First –Served (FCFS) Scheduling

3.2.2 Shortest Remaining Time Next (SRTN) Scheduling

3.2.3 Time-Slice Scheduling (Round Robin, RR)

3.2.4 SJF

3.2.5 Multilevel Queue Scheduling

3.2.6 Multilevel feedback Queue Scheduling

4.1 The critical section problem

4.1.1 Mutual Exclusion: First, second, third Algorithm

4.2 Synchronization Hardware

4.3 Semaphores

4.4 Classic problems of synchronization

4.4.1 The bounded –buffer problem

4.4.2 The readers-writers problem

4.4.3 The Dining –Philosophers problem

4.5 Critical Regions

5.1 Deadlock Characterization

5.2 Methods for handling deadlocks

5.3 Deadlock Prevention

5.4 Deadlock Avoidance

5.5 Deadlock Detection, and Recovery

6.1 Address Binding

6.2 Logical – versus physical – address space

6.3 Dynamic Loading

6.4 Swapping

6.5 Contiguous Memory allocation

6.6 Memory Protection

6.7 Fragmentation

6.8 Memory Allocation

First Fit, Best Fit, Worst Fit Algorithm

7.1 Paging

7.1.1 Page Allocation

7.1.2 Hardware Support for paging

7.1.3 Protection and sharing

7.2 Segmentation

7.3 Segmentation with Paging

7.4 Virtual Memory

7.4.1 Demand Paging

7.4.2 Process creation

7.4.3 Page replacement

7.4.3.1 FIFO page replacement

7.4.3.2 Optimal page replacement

7.4.3.3 LRU page replacement

7.5 Page Fault

8.1 File Concept

8.2 Access Methods

8.3 Directory Structure

8.4 Disk Space Management

8.5 File sharing

References

2. H. M. Deitel, Operating Systems, Second Edition, Addison Wesley, (Rs.253.60/-)

3. William Stalling, Operating System, Second Edition, PHI publication. (Rs.250/-)

4. Charles Crowley, Operating Systems A design oriented approach, Tata McGraw Hill. (Rs.275/-)

5. Tanenbaum, Modern operating system, PHI. (Rs.195/-)

Numerical Methods

Branch: ENC/ CST / IT Cedit: 04

(By Newton Raphson method)

1. E. Balagurusamy, Numerical Methods, Tata McGraw- Hill, 2001. (Rs.150/-)

2. S. S. Sastry, Introductory Methods of Numerical Analysis, 2nd Edition, PHI, 1997. (Rs. 75/-)

3. V. Rajaraman, Computer Oriented Numerical Methods, 3rd Edition, PHI, 1997. (Rs. 59/-)

4. John H. Mathews, Numerical Methods for Mathematics, Science & Engineering, 2nd Edition, PHI, 1998. (Rs. 175/-)

Branch: CST / IT Credit: 04

Pointers: pointer definition, de-referencing of pointer, parameter passing, void pointer, precedence of * and [ ] operators, pointer to function, pointer to constant object, constant pointer, wild pointers.

References:

1. Rebecca Wirfs-Brock, Brian Wilkerson, Lauren Wiener, Designing Object Oriented Software, PHI, 2000, (Rs. 150/-)

2. Timonthy Budd, An Introduction to Object Oriented Programming, Pearson Education, 2000. (Rs. 275/-)

3. Venugopal, Rajkumar, Ravishankar, Master in C++, Tata McGraw Hill, 2001. (Rs. 235/-)

4. Herbert Schildt, The complete reference C++, 2nd edition, Tata McGraw Hill, 2000. (Rs. 325/-)

5. Bjarne Stroustroup, the C++ programming language, 3rd edition, Addison-Wesley, 1997. (Rs. 508/-)

6. Cohoon, Davidson, C++ program design, 3rd edition, Tata McGraw Hill, 1999. (Rs. 295/-)

7. Robert Lafore, Object oriented programming in Turbo C++, 3rd edition, Galgotia Publication, 2001, (Rs. 320/-)

8. Gary J. Bronson, A first book of C++, 2nd edition, Books / Cole publishing company, 2001. (Rs. 342/-)

9. D. Ravichandran, Programming with C++, Tata McGraw Hill, 2001 (Rs. 190/-)

10. Deitel and Deitel, C++ how to program, 2nd, Prentice Hall, 1998. (Rs. 650/-)

11. E. Balagurusamy, Object oriented programming with C++, 2nd edition, Tata McGraw Hill, 2000. (Rs. 165/-)

#### Applied Mathematics - III

Semester: III Lect: 4Hr

Branch:ENC/CST/IT Credit: 04

SECTION - A

1. LAPLACE TRANSFORM

Definition, properties with regards to summation, differentiation and integration. Laplace transform of standard functions. Theorems on Laplace transform, Shifting properties. Laplace transform of t f(t), f(t) / t.

Laplace transform of derivative of a function, integral of a function.

Evaluation of inverse Laplace transform (by standard formulae and partial fraction method)

Laplace transform of periodic functions, step functions and its derivatives.

Convolution integral and its application in finding the inverse Laplace transform.

Solving differential equation by Laplace transform. Applications in Engg.

2. FOURIER SERIES

3.

Orthogonal functions, expression of a function in a series of orthogonal functions.

Fourier series, definition and condition for its existence, Evaluation of Fourier Coefficients.

Even and Odd functions, Evaluation of Fourier series of even and odd functions

Half range sine and cosine series. Parseval’s theorem and its relations.

Complex form of Fourier series, Introduction to Fourier integrals, Fourier transform, Sine transform, Cosine transform-properties and its elementary applications.

Parseval’s identity and evaluation of definite integrals by using it. Applications in Engg.

SECTION – B

3. COMPLEX VARIABLES

Complex number, representation in Cartesian, Polar and exponential forms. De Moiver’s Theorem and its application to complex numbers. Complex variable (and variables). Continuity, Differentiability of functions of complex variables. Necessary and sufficient conditions for a function to be analytic (Cauchy Riemann Equations in cartesian and polar co-ordinates with proof). Determining the function of a complex variable f(z) from its real and imaginary parts using Cauchy Riemann Equations. Applications in Engg.

4. MAPPING

Conformal mapping and bilinear mapping Geometrical interpretations of mapping. Concept of line integral and its relation with Riemann integral. Concept of point function and path independent functions. Contour integral. Cauchy’s theorem for analytic functions and its applications for multiply connected domains. Cauchy’s integral formula and nth derivative of a complex function Morera’s theorem, maximum modulus theorem (Statements and proof’s). Taylor’s and Lorents development of a functions of a complex variable. Singularities – isolated essential singularity and non isolated singularity. Poles, evaluation of residues. Residue theorem and its application to evaluate real integrals. Applications in Engg.

TEXT BOOKS / REFERENCE BOOKS

1. B. S. Grewal, Higher Engineering Mathematics, 34th edition, Khanna Publishers, 1998. (Rs. 170).

2. Edwin Kreyszig, Advance Engg. Mathematics, 5th Edition, New Age International (P) Ltd; 1997. (Rs. 295/-)

3. P.N.Wartikar & J. N. Wartikar, Elements of Applied Mathematics, 1st edition, Pune Vidyarthi Griha Prakashan, 1995. (rs. 110/-)

Discrete Structures and Combinatorics

Semester: III Lect: 4 Hr

Branch: CST Credit: 04

• Logic: Introduction, statement and notations.

Connectives: conjunction, disjunction, negation, statement formulas and truth table, conditional, bi-conditional, well formed formulas, tautology, contradiction, laws of logic’s, equivalence of formulas, duality law, tautological implication, formulas with distinct truth table, other connectives such as XOR, NAND, NOR.

Normal forms: disjunctive normal form, conjunctive normal form, principal disjunctive normal form, principal conjunctive normal form, ordering and uniqueness of normal forms. Principle of mathematical induction.

Predicate calculus: predicates, the statement functions, variables, universal and existential quantifiers, predicate formulas, free and bound variables, the universe of discourse.

Basic set operations such as intersection, union, relative and absolute complement, Cartesian product, and symmetric difference. Disjoint sets, partitions of a set, Venn diagram.

Methods of proof for sets: by using example, by using Venn diagram, by using set membership tables, by using definitions. Laws of set theory, proof using previously proven theorem, proofs using indirect method.

• Counting: permutations and combinations, the pigeonhole principle, elements of probability, recurrence relations.

• Relations: Basic definition, relation notation, and set arising from relations.

Properties of relation: reflexive, irreflexive, symmetric, asymmetric, anti-symmetric, transitive.

Relation matrix and graphs of relation: paths in relation and digraph, composition of paths, identification of properties of relations from relation matrix and graph.

Equivalence relation: definition, determination of equivalence relation from partitions, equivalence classes, properties of equivalence classes.

Manipulation of relations: Boolean product of relation matrices, inverse of a relation, composition of a relation, inverse of a composite relation, complementary relation.

Closures: reflexive, symmetric and transitive closure of a relation, transitive closure by Warshall’s algorithm.

• Functions: definition, image of a function, and restriction of function to a set.

Special types of functions: injective, surjective, bijective, invertible, identity, floor, ceiling, and characteristic function of a set, composition of functions.

Permutation function: definition, different properties.

Growth of a function: Big O notation, big relation and rules of determining classes of a function.

• Algebraic structure: binary and n-ary operations on a set, representation of binary operation by composite table, properties of binary operations.

Algebraic system: definition, some simple algebraic system, and properties of algebraic system such as homomorphism, epimorphism, monomorphism, isomorphism, and endomorphism. Direct product of algebra, congruence relation.

Semigroups and monoids: definition, notation, product of partition, cyclic monoid, different properties of semigroup and monoid such as homomorphism, epimorphism, monomorphism, isomorphism, endomorphism, automorphism implications of homomorphism.

Product and quotient of Semigroups: congruence relation, quotients of semigroups, and direct product of semigroups, Subsemigroup and submonoid.

Groups: definition, notation, order of a group, abelian group, cyclic group, subgroup, proper subgroup, group homomorphism, kernel of the homomorphism, Cosets and LaGrange’s Theorem, normal subgroups, product of groups, quotients of groups.

Ring: definition, properties, ring homomorphism, field.

• Lattice and Boolean algebra: Partial order relation, poset, comparable and incomparable elements, linear ordering, totally order set or chain, lexicographic order, cover of an element, Hasse diagram, different features of Hasse diagram, topological sorting, isomorphism between two poset, extremal elements of posets such as minimal, maximal, least, greatest, upper bound, lower bound, least upper bound, greatest lower bound.

Lattice: Definition, properties of lattice, sublattice, direct product of lattices, lattice homomorphism, isomorphism, endomorphism, automorphism, order preserving, order isomorphism, complete lattice, bounded lattice, complemented lattice, distributive lattice.

Boolean algebra: definition, properties of Boolean algebra, sub algebra, direct product of Boolean algebra, Boolean functions as Boolean polynomials.

• Graphs and Trees: Introduction, definition, applications of graph, finite and infinite graph, incidence and degree, isolate vertex, pendant vertex, null graph.

Paths and Circuits: isomorphism, subgraphs, and coloring of a graph, component of a graph, Euler graph, and operation on graphs, Hamiltonian paths and circuits.

Trees and fundamental circuits: definition, properties of trees, pendant vertices in tree, distance and centers in tree, rooted and binary tree, on counting tree, undirected tree, spanning tree, fundamental circuits, finding all spanning trees of a graph, spanning trees in a weighted graph (Prim’s and Kruskal’s algorithm).

References:

2. Bernard Kolman, Robert C. Busby, and Sharon Ross, Discrete mathematical structures, 4th edition, PHI, 2002. (Rs. 195/-)

3. Narsing Deo, Graph theory and applications to engineering and computer science, PHI, 1999. (Rs. 150/-)

4. Alan Doerr and Kenneth Levasseur, Applied discrete structures for computer science, Galgotia Publication, 1998. (Rs- 176/-)

5. C. L. Liu, Elements of Discrete Mathematics, 2nd edition, Tata McGraw Hill, 2000. (Rs. 175/-)

6. Frank Harary, Graph theory, Narosa Publication, 1998. (Rs. 135/-)

7. Douglas B. West, Introduction to graph theory, PHI, 1999. (Rs- 195/-)

#### Digital Logic Circuits

Semester: III Lect: 4 Hr

Branch: ENC / CST / IT Credit: 04

Concept of Digital & Analog Circuit

1’s Complement Method

2’s Complement Method

Arithmetic operations on binary number system, addition, subtraction, multiplication & division. Hexadecimal addition & subtraction. Octal addition & subtraction. 9’s complement & 10’s complement methods.

NAND & NOR as universal gates.

N-OR gate as parity checker & parity generator. Realization of Boolean expression using gates.

De Morgan’s Theorems

Realization of De Morgan’s theorems using gates.

Reduction Techniques

1) Laws of Boolean algebra

2) K-map reduction techniques

SOP & POS using universal gates.

(concept of minterms & maxterms)

K-map using two, three, four & five variables.

Duality Theorem

K-map reduction techniques : pairs, quads, octets, rolling, overlapping etc.

Quine-Maclusky method .

2 : 4, 3 : 8 encoder BCD to decimal

decoder, IC7445, IC74154

Decoder drivers: 7-segment display (MAN-72)

IC 7446, IC 7447 & IC 7448.

Encoders: Decimal to BCD encoder IC 74147.

Their applications (Boolean function simplification using mux & demux)

B421 adder – subtractor, BCD adder subtractor, XS-3 adder, 4-bit parallel binary adder-subtractor (without using k-maps).

8421 adder-subtractor using IC 7483.BCD adder using IC 7483,XS-3 adder using IC 7483.

Counters

Principles of working of a 3-bit ripple counter, synchronous counter, preset table counter, mod-3,mod-6,mod-5,mod-7, mod-10, and mod-12, using decoding gates.

Ring counter,Twisted ring counter.Glitch and gating of a counter.

IC 7490, IC 7493, IC 7495, IC 74193.

Principle of working of buffer register, shift-left, shift-right register.

Four types of register: SISO, SIPO, PISO, PIPO,Typical shift register.Mode controlled shift register.

Classification and characteristics of memories.

Methods of address decoding, memory cells.

ROM memories-Masked ROM,PROM,EPROM,EEPROM.

RAM memories:-TTL RAM,NMOS RAM,Dynamic RAM.

Their principles of working, critical values for I/P, O/P vtg. Levels, curr. Sinking & sourcing, fan-out, noise immunity.

Study of basic 2-i/p TTL NAND gate and its transfer characteristics..

2. Malvino Leach, “Digital Principles & Applications”, 4th edition.

3. R. P. Jain, “Modern Digital Electronics” 2nd edition, Rs.150/-.

Electrical Network Theory

Lect: 4 Hr

Branch:ENC Credit: 04

NETWORK TOPOLOGY

Graph- oriented, planer, subgraph, concept of tree, Incidence matrix, reduced incidence matrix, Tie- set / fundamental loops of graph, KVL equations for f-loops, rank, Cut-set & its orientation, KCL equations for cut-set, Cut-set matrix, Formulations network equations, Networks with mutual inductances & controlled sources, Duality Concept.Maximum, mini-cut Theorem & Properties.

Transient responses to networks, General & particular solution, R-L & R-C network, Time constant, DC forcing function response, Initial conditions in networks.

RLC network.

State equations and their formulations, Equivalent source method & topological method, Time-Domain solution of State-Equations.

Laplace Transform and their application to networks.

Z, Y, H, G, ABCD or Transmission parameters, Interconversion of parameters, Condition of reciprocity & Symmetry.

Network functions of some typical networks, Pole- Zero Plot of network functions, restrictions on Pole- Zero locations.

Filter classifications, Mathematical representations of Attenuation, Characteristics Impedance, Attenuation & Phase Constants, Cut-off Frequency.

Equivalent Circuit of transmission lines, Line equations, VSWR, Measurement of various parameters, Transmission line Matrices, Distortions in Transmission Lines, Distortion less line, Characteristics Impedance, Impedance transformation & matching- - single and Double Stub Matching.

2) M.E. Van Valkenberg, Network Analysis, 3rd Edition, PHI, 1997 (Rs 150/-)

3) D Roy Choudhury, Networks & Systems, Fourth Reprint, Wiley Eastern Publications, 1994. (Rs-200/-)

4) Hayt, Kemmerly, Engineering Circuit analysis, Fifth Edition, Tata McGraw Hill 2000. (Rs.275/-)

#### Electronics Measurement and Instruments

Semester: IV Lect: 4 Hr

Branch: ENC Credit: 04

1. Measurement and Error

• Definition, Significance, Methods of Measurements

• Accuracy and Precision

• Significant Figures

• Types of Error

• Statistical Analysis

• Probability of Errors

• Phases of Instruments (Mechanical Instruments, Electrical Instruments, Electronics Instruments)

• Classification of Standards

• Standards for Mass, Length, and Volume

• Time and Frequency Standards

• Electrical Standards

• Standards of Temperature and Luminous Intensity

• IEEE Standards

• Introduction

• Whetstone Bridge

• Kelvin Bridge

• AC Bridge and Their Application

• Maxwell Bridge

• Hay Bridge

• Schering Bridge

• Unbalance Condition

• Wein Bridge

• Electronic DC Voltmeter

• AC Voltmeter (Average Reading Voltmeter, Peak Reading Voltmeter)

• RMS Voltmeter

• Electronic Multimeter

• Ohm-Meter

• Series Type Ohm-Meter

• Shunt Type Ohm-Meter

• DC Ammeters

• Suspension Galvanometer (D’ Arsonval Galvanometer

• Permanent Magnet Moving Coil Instrument (PMMC Galvanometer)

5. Q-Meter

• Basic Q-Meter Circuit

• Measurement Methods

• Direct Connection

• Series Connection

• Parallel Connection

• Sources of Errors

• Introduction

• Oscilloscope Block Diagram

• Cathode Ray Tube

• Electrostatic Focusing

• Electrostatic Deflection (Derivation for D-LldEd/2dEa)

• Deflection Sensitivity, Deflection Factor

• Post Deflection Acceleration of Electrostatic Beam

• Screens for CRT

• Vertical Deflection System

• Horizontal Deflection System

• Types of Sweeps

• Dual Trace Oscilloscope

• Sampling Oscilloscope

• Storage Oscilloscope

Principle of Secondary Emission

Variable Persistence Storage

Bistable Storage Oscilloscope

• Digital Storage Oscilloscope

• Comparison Between Analog and Digital Storage Oscilloscope

• Sine Wave Generator

• Frequency Synthesized Signal Generator

• Sweep Frequency Generator

• Function Generator

• Wave Analyzers

• Frequency Selective Wave Analyzers

• Heterodyne Wave Analyzers

• Harmonic Distortion Analyzers

Tuned-Circuit Harmonic Analyzer

Heterodyne Harmonic Analyzer or Wave Meter

• Spectrum Analyzer

• Basic Spectrum Analyzer

• Fourier Transform Spectrum Analyzer

• Applications of the Spectrum Analyzers

• Introduction

• Structure and Classification

• Piezoelectric Transducers

• Thermocouple

• Photo-Electric Transducer

Text Book

W. D. Cooper," Electronic Instrumentation & Measurement Technique", Prentice Hall India, 1982

1. B. H. Oliver & J.M. Cage (ed.), "Electronic Measurement & Instrumentation", McGraw Hill , 1971

2. A. M. Rudkin , "Electronic Test Equipment", 1981

3. M. L. Meade," Lock-in amplifiers", Peter Peregnius, 1983

4. S. Soclof," Applications of Analog Integrated Circuits",

Prentice Hall, 1987.

5. J. A. Alloca," Electronic Instrumentation", Prentice Hall, 1987

6. A. K. Sawani, “Electronic Measurement & Instrumentation”.

#### Microprocessor – I

Semester: V Lect: 4 Hr

Branch: ENC / CST / IT Credit: 04

Brief history of Microprocessors, Basic building blocks of microcomputer systems.

Pin diagram and pin description

Internal architecture with functional block diagram.

Register organization inside 8085

Instruction set of 8085: study of instructions from instruction set

of 8085. Grouping of instructions.

Addressing modes of 8085 – their types with suitable examples.

Programming of 8085 - Program development for 8085 using inst. set

Stacks and subroutines – concept of stack and stack pointer, use of PUSH, POP and other stack related instructions, subroutines, their types and execution of subroutines.

I/O data transfer techniques- programmed I/O, interrupt driven I/O, DMA, data transfer with handshake signals and ready signals.

Interrupts - hardware and software interrupts, maskable and Nonmaskable interrupts, vectored and nonvectored interrupts, interrupt structure of 8085,

Instructions related to interrupt like EI, DI, RIM and SIM.

I/O device interfacing – I/O mapped I/O and memory mapped

I/O techniques.

Programmable I/O devices – study of 8155, 8355/8755, block diagram, pin functions and modes of operation.

Programmable Peripheral Interface (PPI) 8255-block diagram, pin functions, features, modes of operations, interfacing with 8085.

Programmable Interval Timer 8253/54- block diagram, pin function, features, modes of operations, interfacing with 8085.

Programmable interrupt controller 8259-block diagram, pin function, features, modes of operation, interfacing with 8085.

DMA Controller 8257- block diagram, pin function, features, modes of operation, interfacing with 8085.

ADC/DAC interfacing – study of ADC/DAC IC’S – 0800, 0808,0809,generation of various waveforms

Debugging tools: Assemblers, Logic Analyzers.

8085 Microprocessor based system Design.

Architecture of 8051, hardware, of 8051, oscillator & clock, Register organization inside 8051,Special function Registers, Internal memory, internal RAM.

Pin Configuration & functions of pins.

Modes for serial I/O operation- mode 0, mode 1, mode 2, mode 3. Modes for interrupt- operation interrupt structure external

interrupt control and priority.

Timer/ counter modes - mode 0, mode 1, mode 2, mode 3.

Power Saving modes -power down mode, idle mode

Instruction set & Addressing modes of 8051

Programming of 8051- programs for addition,subtraction,

multiplication and division.

Interfacing of external memory to 8051

Interfacing of external peripherals to 8051.

Text Books and Reference Books

2. Borole and Vibhute, “Microprocessor”, 2nd edition, Technova Publications. (Rs. 220/-)

3. A. P. Godse , “Microprocessor”, 1st edition, Nirali Publications. (Rs. 275/-)

4. A .P. Godse, Gilmore , “Microprocessor”, 2nd edition, McGraw Hill International. (Rs. 765/- )

5. Kenneth J. Ayala, ‘The 8051Microcontroller”, 2nd edition, Penram International. (Rs. 225/-)

#### Electromagnetic Wave Theory

Branch: ENC

Credit: 04

Fundamental relations, Guass’s law, electric potential, continuous charge distribution, equipotential surfaces,Divergence theorem, Poissons & Laplace equations, capacitace, elctrostatic energy, boundary conditions, Uniquness theorem, Dirac delta representation.

Magnetic field, Faraday’s law, Lenz’s law, Flux density, field strength, Ampere’s law, Permeability, Magnetostatic energy, Lornetz force equation, Ampere’s force law, Magnetic potential, analogies between electric & magnetic field.Maxwell’s equations: Continuity equation for time varying fields, Maxwell’s equations, Boundary conditions.

Waves in free space, Uniform plane waves, Waves in conducting medium, sinusoidal time variations.

Conductors & Dielectrics: Polarization in dielectrics, Normal & oblique incidence, surface impedance, Poynting theorem, poynting vector, interpretation of E*H, power loss in plane conductor.

Guided Waves: TE & TM waves, characteristics of TE & TM waves, TEM waves, velocities of propagation, wave impedance, current flow through conductor.

References:

1. Edward Jordan & Kieth Balmain, Electromagnetic waves & radiating systems, 2nd Edition, PHI, 1998. (Rs-175/-)

2. John D. Kraus, Electromagnetics, 4th Edition, McGraw-Hill, 1991. (Rs- 300/-)

3. K. D. Prasad, Antenna & Wave Propagation, 3rd Edition, Satya Prakashan New Delhi, 2001. (Rs. 250/-)

#### Analog Circuits

Branch:ENC/CST/IT Credit: 04

Diff. Amp. Circuit configurations- dual/single i/p balanced output, dual/single i/p unbalanced output, DC & AC analysis, swamping resistors, constant current bias, current mirror, level shifter.

Block diagram of typical Op-Amp, schematic symbol, Ideal Op-Amp, Op-Amp equivalent circuit, Transfer characteristics, Op- Amp parameters- DC – offset voltage & current, compensation for offset voltage, AC parameters- CMRR, slew rate, gain bandwidth product. Thermal drift, Noise.

Feedback configurations- Inverting, non-inverting & Differential Op-Amp, effect of f/b on different parameters

Frequency response, Compensation for frequency, Op-Amp at high frequency, effects of slew rate.

Linear Applications:

Peaking amplifier, summing, scaling, averaging amp, Instrumentation amplifier, Integrator & Differentiator, Log & Antilog amplifier.

Oscillator principles, Barkhausen criterion, Types- Phase shift, Wien Bridge, Quadrature oscillators. Waveform generators- Square, triangular & sweep generator, Voltage controlled oscillator.

Basic comparator, zero crossing detector, Schmitt trigger, window detector, V/F & F/V converters, sample & hold circuits.

IC555 timer - monostable & astable multivibrators, applications.

Operating principle, monolithic PLLs, IC565 PLL applications.

Fixed & variable voltage regulators, IC723 voltage regulators.

Monolithic power amplifiers, LM 380 power amplifier.

References:

1. Ramakant Gayakwad, “Op-Amps and Linear Integrated circuits”, 3rd edition, PHI, 2000. (Rs 195/-)

2. K.R. Botkar, “Integrated Circuits”, 9th Edition, Khanna Publication, 1996. (Rs –150/-)

3. Graeme Tobey, “Operational Amplifier, Design & applications”, 1985.

Numerical Methods

Branch: ENC/ CST / IT Cedit: 04

Floating-point representation of numbers, arithmetic operations with normalized floating point numbers, consequences, and errors in numbers, Binary representation of numbers, conversions and conclusions.

Introduction, starting an iterative method, method of successive bisection, False-position method, Newton Raphson method, Secant method, Successive approximation method, comparison of iterative methods, solution of non-linear equations

(By Newton Raphson method)

Introduction, Gauss-elimination method, pivoting, Gauss-seidel iterative method, comparison of direct and iterative methods.

Interpolation: Introduction, Lagrange’s interpolation, difference tables, and truncation error in interpolation.

Introduction, fitting a straight line, polynomial regression, fitting geometric and exponential functions, multiple linear regressions.

Introduction, Taylor series representation

Differentiation:

Introduction, formulae for numerical differentiation, numerical integration, Trapezoidal rule, Simpson’s 1/3 rd and 3/8 th rules, Gaussian quadrature formulae, comparison of integration formulae.

Introduction, Euler’s method, Taylor series method, Runge-kutta (R-K) second & fourth order formulae, Predictor-corrector (P-C) method, higher order differential equations, comparison of R-K and P-C methods.

Transportation problems, PERT/CPM

References:

1. E. Balagurusamy, Numerical Methods, Tata McGraw- Hill, 2001. (Rs.150/-)

2. S. S. Sastry, Introductory Methods of Numerical Analysis, 2nd Edition, PHI, 1997. (Rs. 75/-)

3. V. Rajaraman, Computer Oriented Numerical Methods, 3rd Edition, PHI, 1997. (Rs. 59/-)

4. John H. Mathews, Numerical Methods for Mathematics, Science & Engineering, 2nd Edition, PHI, 1998. (Rs. 175/-)

http://knol.google.com/k/narayana-rao/syllabus-second-year-computer-science/ 2utb2lsm2k7a/ 1503

## No comments:

## Post a Comment