All Courses
Electrical and Electronic Principle (EEP)
This course contains following topics
1. AC Fundamental :
Basic Principles of AC Generators, Alternating Voltages and Currents, Frequency, Amplitude and Phase, RMS and Average Value, Form Factor, Resistance, Inductance, Capacitance, RLC Series Connection and Resonance, Parallel Resonance.
2. Network Theorem.
KVL, KCL, Superposition theorem, Thevenin’s theorem, Norton’s theorem, Maximum power transfer theorem.
3. Introduction to Semiconductors:
Semiconductors and their properties, Intrinsic and extrinsic semiconductors.
4. Semiconductor Diodes and Special Purpose Diodes:
The p-n junction formation, properties and V-I characteristics, Basic constructions, characteristics, operations and uses of special diodes, Light emitting diode (LED), Zener diode.
5. Regulated Power Supply:
Voltage regulation, rectifiers, half-wave and full-wave rectifiers, Voltage regulator circuits- Zener diode and transistor voltage regulator.
6. Bipolar Junction Transistors: npn and pnp transistors, Amplifying and switching actions of transistor, Transistor characteristics in CB, CE and CC configurations, Operating point, Transistor load line analysis, BJT Biasing.
7. Field Effect Transistors: Classification of FET, Construction, operation and characteristics of JFET, Operation and characteristics curves of MOSFET, DC biasing of JFET.
8. Feedback Techniques and Op-amps: Negative and positive feedback, characteristics and gain with negative voltage and current feedback, Emitter Follower, Basic Op-amps- characteristics, inverting, non-inverting, integrators, differentiators, summing amplifiers.
1. AC Fundamental :
Basic Principles of AC Generators, Alternating Voltages and Currents, Frequency, Amplitude and Phase, RMS and Average Value, Form Factor, Resistance, Inductance, Capacitance, RLC Series Connection and Resonance, Parallel Resonance.
2. Network Theorem.
KVL, KCL, Superposition theorem, Thevenin’s theorem, Norton’s theorem, Maximum power transfer theorem.
3. Introduction to Semiconductors:
Semiconductors and their properties, Intrinsic and extrinsic semiconductors.
4. Semiconductor Diodes and Special Purpose Diodes:
The p-n junction formation, properties and V-I characteristics, Basic constructions, characteristics, operations and uses of special diodes, Light emitting diode (LED), Zener diode.
5. Regulated Power Supply:
Voltage regulation, rectifiers, half-wave and full-wave rectifiers, Voltage regulator circuits- Zener diode and transistor voltage regulator.
6. Bipolar Junction Transistors: npn and pnp transistors, Amplifying and switching actions of transistor, Transistor characteristics in CB, CE and CC configurations, Operating point, Transistor load line analysis, BJT Biasing.
7. Field Effect Transistors: Classification of FET, Construction, operation and characteristics of JFET, Operation and characteristics curves of MOSFET, DC biasing of JFET.
8. Feedback Techniques and Op-amps: Negative and positive feedback, characteristics and gain with negative voltage and current feedback, Emitter Follower, Basic Op-amps- characteristics, inverting, non-inverting, integrators, differentiators, summing amplifiers.
1 day 8 hours 41 minutes
55 steps
Data Structure
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.
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.
21 hours 55 minutes
21 steps
Computer Architecture
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
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
1 day 1 hour 50 minutes
27 steps
Object Oriented Programming
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;.
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;.
23 hours 55 minutes
23 steps
Structured Programming Language
Overview of Structured Programming Language concept; algorithm , flowchart and pseudo
code; Constants, variables and data types; Operator & Expression; Managing Input & Output
Operations; Decision making and branching; Looping; Arrays; Handling of character strings;
User-defined functions; parameter passing conventions, scope rules and storage classes,
recursion; Structure and union; Pointers; File management; header files; preprocessor; library
functions; error handling;
code; Constants, variables and data types; Operator & Expression; Managing Input & Output
Operations; Decision making and branching; Looping; Arrays; Handling of character strings;
User-defined functions; parameter passing conventions, scope rules and storage classes,
recursion; Structure and union; Pointers; File management; header files; preprocessor; library
functions; error handling;
1 hour 35 minutes
1 steps