Growth of Functions, Summations, Recurrences, Design Techniques: Divide and conquer, Dynamic programming, Greedy algorithms, Backtracking, Branch and Bound, Graph Algorithms: shortest path problems, Network Flow Problems, Minimum spanning trees; P and NP class problems, NP-completeness and reducibility, Polynomials and the Fast Fourier transform (DFT and FFT), Number-theoretic Algorithms, String matching, Algorithms for Parallel computers, Approximation algorithms.

Introduction to Number Systems and Codes. Switching properties of Diodes, BJT and FET, Logic gates, DTL, TTL, ECL, I2L, CMOS Gates and their parameters and comparisons, Applications of switching transistors in bistable, monostable, astable and Schmitt trigger circuits. Boolean algebra, Switching Function, minimization of switching function: Karnaugh map method and Tabulation Method don’t care terms and applications w.r.to code converters and Digital Comparators, etc. Gated Flip Flops, Master Slave Flip Flop, Ripple and Parallel Counter, Up-Down Counter, Shift Registers and Ring Counter, designing the combinational circuits of the counters through Excitation Table. Introduction to the circuits for Arithmetic Unit: Serial and parallel Binary Adders, 2’s compliment and principle of subtraction, Carry-Look Ahead Adder, and BCD adder: Principles of multiplication, division in ALU Semiconductor memories: ROM, PROM, EPROM, EEPROM, Bipolar RAM, static and dynamic RAM. Encoder and Decoder/Demultiplexer, multiplexer, Designing combinational circuits with multiplexer, ROM and PLA.Introduction to advanced memory concepts. Analog-to-Digital conversion:, dual slope integration method and voltage to frequency conversion, principal of DVM. , counter type, successive approximation type, Flash ADC , D-A converter: weighted resistors type, R-2-R ladder type.