3rd Semester
ELECTRONIC CIRCUITS & NETWORK THEORY
IT201
UNIT I
Review of equivalent circuit for semi conductor devices (BJT, FET etc ) classification of amplifiers , voltage amplifier , current amplifiers , amplifier characteristics ,BW , gain , input impedance , output impedance, distortion etc. Transistor Biasing and stabilization, Bias compensation, Thermal Runaway.
UNIT II
Switching characteristics –of BJT and FET, linear and non linear wave shaping circuit, bistable , monostable and astable multi-vibrators, RC integrators and differentiators, Clipper and Clamper circuits.
UNIT III
Classification of Amplifiers, Operational Amplifiers(OP-AMP), Inverting & Non inverting mode comparators, Zero Crossing Detector, VF and FV converter, Rectifier circuit using op- amp. 555 Timer and it’s application.
UNIT IV
Circuit Elements, KVL, KCL, Elementary Graph Theory, Incidence Matrix, Cut-Set, Tie- Set, Network Theorems, Superposition, Thevenin’s, Norton’s, Reciprocity, Max. Power Transfer, Millman’s, Tellengens Theorem, and Magnetically Coupled Circuits.
UNIT V
Differential Equations, First & Second order system, Time constant, Initial Conditions, Laplace Transform & its application in circuit analysis, Initial & Final value Theorem, Network Functions, Two Port Network Parameters.
References:
Integrated Electronics by Milliman & Halkias Mc-Grow Hill Publication
Micro-Electronics Circuit by Sedra Smieth Oxford University Press.
Network Analysis by Van Valkenburg PHI publication
Electronic Devices and Circuits by Boylsted
Digital Electronics
IT 202
UNIT 1
Number system: Binary Number System, binary arithmetic, octal number system, hexadecimal system, radix conversion. Binary codes: BCD, Excess three code, grey code, display code, ASCII, EBCDIC,
Boolean algebra: Theorems, AND, OR, NOT, NAND, NOR, Exclusive OR gates, inhibit, simplification of Boolean expressions minimization techniques, karnaugh map, Quine MC – clusky method.
UNIT 2
Study of combinational circuits arithmetic logic unit, full and half adder, subtractor BCD adder, Excess 3 adder multiplexer, and demultipaxer encoder and decoder circuits.
UNIT 3
Flip-Flop: RS clocked RS, TD, JK, race-around problem, master – slave JK.
Elements of sequential switching circuits, synchronous and asynchronous system binary ripple counter, BCD counter up-down counter.
UNIT 4
Shift registers, serial and parallel shift registers, shift left and shift right operation, Johnson and rings counter.
UNIT 5
Design of Sequential circuits, state diagrams implementation of multivibrators, circuit using logic gates, Schmitt trigger.
DISCRETE STUCTURES
IT203
UNIT I
Introduction to set theory, combination of sets, finite and infinite sets, uncountable infinite sets, mathematical induction, principles of inclusion and exclusion, multi-sets. Introduction to Relations and Functions, Properties of Binary Relation, equivalence relation and partitions, partial ordering and total ordering, lattices, chains and anti-chains, functions and pigeonhole principle.
Unit II
Introduction to discrete numeric functions and generating functions, manipulation of numeric functions, asymptotic behavior of numeric function, combinatorial problems.
Unit III
Introduction to recurrence relation and recursive algorithm, linear recurrence relations with constant coefficients, homogeneous solutions, particular solutions, total solution, solution by method of generating functions, sorting algorithm, matrix multiplication algorithm.
Unit IV
Introduction to groups and rings, subgroups, generators and evaluation of powers, Cosets and Lagrange's theorem, permutation groups and burnicide’s theorem, codes and group codes, isomorphism and automorphism, homomorphism and normal subgroups, rings, internal domains and fields, ring homomorphism, polynomial rings and cyclic codes.
Unit V
Introduction to Boolean algebra, lattices and algebraic systems, principles of duality, relation between algebraic system and lattices, distributive and complemented lattices, Boolean lattices and Boolean algebra, uniqueness of finite Boolean algebra’s, Boolean functions and Boolean expressions, prepositional calculus, design and implementation of digital networks switching circuits.
Suggested Books and References.
Element of Discrete Mathematics By C. L. Liu
DATA STRUCTURES
IT204
UNIT 1:
Introduction to data structures, algorithm evaluation, arrays, ordered lists, operations in ordered list, sparse matrices, multi-dimensional arrays, linked lists, operations on linked list, storage pools, garbage collection, doubly linked list and its operations, generalized linked lists.
UNIT 2:
Stacks and Operations in a stack, applications of Stacks and queues, difference between Stacks and queues, Operations in a queue & its application, Circular queues, Mazing problem, Prefix, postfix, infix notations
UNIT 3:
Trees: applications and representation in memory, binary tree : operations on binary tree
Spanning tree, cut sets, graphs : Traversing and properties, Hamiltonian path and circuits
Eularian paths and circuits, Planner graphs and its applications
UNIT 4:
Symbol table: types and use, Static tree table, Dynamic tree table, Hashing, Hash table
Representation of sets: using list, Representation of sets: using bit vector & trees
Operations on sets
UNIT 5:
Sequential Search, Binary Search, Other search techniques, Time complexity & memory requirements, Bubble Sort, Insertion sort, Quick sort, Selection sort, Merge sort, Heap sort, maxima and minima heap
References:
Data Structure by Tanenbaum
Data Structure by Horowitz & Sahani
