All Courses

Syllabus

Introduction: Introductory concepts, Number System and code, Logic gates and Boolean algebra.

Combinational Logic: Combinational Circuits design using logic gates, universal gates. Minimization of switching functions, algebraic simplification, the Karnaugh map, Prime Implement.

Sequential Logic: NAND and NOR latches. Clocked SR. JK D and T flip-flops. FF timing consideration. Master-slave FF.

Complex Sequential logic: Frequency division and counting troubleshooting. Asynchronous ripple up and down counters, counters with any MOD numbers asynchronous IC counters, propagation delay. Parallel up down and up/down counters. Presentable counters. The 74193 counter. Decoding a counter. Cascading counters. Shift registers, IC shift, digital clock, troubleshooting case studies. MSI logic circuits: BCD-to-Decimal decoders, BCD-to-7 segment decoder/drivers. Encoders.

Multiplexer and Demultiplexer: Multiplexer and their applications, Demultiplexers, Troubleshooting case studies, Analog-to-Digital conversion, digital-ramp, successive approximation, flash ADC, Digital-to-Analog conversion: circuits, specifications, Sample and hold circuits, Analog multiplexers, Data acquisition, digital voltmeter.

Memory Devices: Semiconductor memory technologies ROM architecture timing and type of ROM, EPROM, EEPROM, ROM applications. RAM architecture static and dynamic RAM, DRAM structure operation and refreshing. Expanding word size and capacity. Magnetic bubble and CCD memories trouble shooting case studies. Introduction to sequential circuits, formal representation of sequential circuits.

Arithmetic circuits: The half-adder, full adder, parallel adders, 2’s complement addition and troubleshooting case studies.

Reference Books:
1) Digital Systems: Principles and Applications, Ronald J. Tocci, Neal S. Wildmer.
2) Hand Book of Modern Digital Electronics, G. Moazzam and M. Shorif Uddin.
3) Modern Digital Electronics, R P Jain.
4) An Engineering Approach to Digital Design, William I. Fletcher.

Introduction: Basic Terminology; Elementary Data Organization; Data Structures; Data
Structure Operations; Control Structures; Algorithms: Complexity, Time-Space Tradeoff,
Mathematical Notation and function, String Processing: String Operations, word processing,
and Pattern Matching Algorithms.
Arrays, Records and Pointers: Linear Arrays; Representation of linear array in memory;
Traversing linear arrays, Inserting and Deleting; Sorting; (Bubble sort), Searching (linear, binary),
Multidimensional Arrays; Pointer Arrays; Record Structures; Matrices.
Linked lists: Representation of Linked lists in memory, Traversing a linked list, Searching a
linked list, insertion, deletion; Header and two-way lists.
Stacks, Queues, Recursion: Array Representation of Stacks, Polish Notation; Quicksort,
Recursive definition; Towers of Hanoi, Implementation of Recursive procedures, Queue
Dequeue, Priority Queues.
Trees: Binary Trees; Representing Binary Trees in memory, traversing binary tree, Header
Nodes; Threads , binary search trees, Heap tree, heap sort, Huffman’s Algorithm.
Graphs: Sequential Representation of Graph; Adjacency Matrix; Path Matrix; Warshall’s
Algorithm; Linked representation of Graphs.

Introduction: Organisation and Architecture, Instruction sets- formats, cycle, timing etc;
Addressing modes; Types of Instruction; RISC characteristics; CISC characteristics.
Computer System: System Buses, Components, Functions, Bus Interconnection,
Computer Arithmetic: Different types of data representation; Addition and Subtraction;
Multiplication Algorithms; Division Algorithms.
Memory Organization: Main memory, Auxiliary memory, Associative memory, Cache
memory, Virtual memory, Memory management requirements and hardware.
Input-Output Organization: Input-Output Interfaces; Data transfer, Interrupts; Direct
Memory Access (DMA); Input-Output channel.
Central Processing Unit(CPU): ALU, CPU structure and Functions
Control Unit: Control Unit operation, Micro-operation, Control of processor, Hardwired
Implementation.
Fundamentals of parallel processing: Parallel processing; Pipelining; Vector processing;
Multiprocessors; Array processor, Bit-slice processor Interconnection structures

Principles of Object-Oriented Programming; Beginning with C++; Tokens, Expressions and
Control Structure; Functions in C++; Classes and objects; Constructors and Destructors;
Operator Overloading and Type conversions; Inheritance: Extending classes; Pointers, Virtual
Functions and Polymorphism; Managing console I/O operations; Working with Files; Exception
Handling; Template functions and classes; Multi-threaded Programming.
Introduction to java, comparison between java and c++, Applets and Servlets, basic of java.lang,
java.util and java.io;.