Computer Engineering Preparation

Digital Logic

Introduction

29:14
Introduction (Contd.)

32:00
Number System

28:06
Number System (Contd.)

31:03
Number System (Contd.)

29:16
Number System (Contd.)

31:57
Number System (Contd.)

26:20
Boolean Algebra

30:11
Boolean Algebra (Contd.)

30:30
Boolean Algebra (Contd.)

27:11
Boolean Algebra (Contd.)

28:33
Boolean Algebra (Contd.)

28:37
Boolean Algebra (Contd.)

32:57
Logic Gates

28:21
Logic Gates (Contd.)

29:02
Logic Gates (Contd.)

29:23
Logic Gates (Contd.)

28:47
Logic Gates (Contd.)

28:30
Logic Gates (Contd.)

25:36
Arithmetic Circuits

28:11
Arithmetic Circuits (Contd.)

30:32
Arithmetic Circuits (Contd.)

16:21
Decoders, Multiplexers, PLA

28:40
Decoders, Multiplexers, PLA (Contd.)

30:08
Decoders, Multiplexers, PLA (Contd.)

28:50
Decoders, Multiplexers, PLA (Contd.)

27:11
Decoders, Multiplexers, PLA (Contd.)

28:50
Sequential Circuits

30:49
Sequential Circuits (Contd.)

29:43
Sequential Circuits (Contd.)

28:11
Sequential Circuits (Contd.)

28:46
Sequential Circuits (Contd.)

26:51
Sequential Circuits (Contd.)

27:53
Sequential Circuits (Contd.)

29:25
Finite State Machine

26:37
Finite State Machine (Contd.)

31:24
Data Converters

28:35
Data Converters (Contd.)

29:56
Data Converters (Contd.)

27:17
Data Converters (Contd.)

28:40
Memory

28:19
Memory(Contd.)

28:04
Memory(Contd.)

28:28
FPGA

30:15
FPGA (Contd.)

29:34
VHDL

30:08
VHDL(Contd.)

27:44
8085 Microprocessor

27:39
8085 Microprocessor (Contd.)

28:54
8085 Microprocessor (Contd.)

30:15
8085 Microprocessor (Contd.)

29:10
8085 Microprocessor (Contd.)

27:36
8085 Microprocessor (Contd.)

28:38
8085 Microprocessor (Contd.)

29:38
8085 Microprocessor (Contd.)

27:10
8085 Microprocessor (Contd.)

26:59
8085 Microprocessor (Contd.)

29:04
8085 Microprocessor (Contd.)

28:24
8085 Microprocessor (Contd.)

28:33
8085 Microprocessor (Contd.)

29:46
8085 Microprocessor (Contd.)

29:13
8085 Microprocessor (Contd.)

25:28
8086 Microprocessor

29:34
8086 Microprocessor (Contd.)

28:49
8086 Microprocessor (Contd.)

14:30

Computer Organization

Computer Architecture

Advanced Computer Architecture

Programming and Data Structures

Introduction to Algorithms and Analysis

Insertion sort

27:23
Analysis of Insertion Sort

26:42
Asymptotic Analysis

26:44
Recurrence of Merge Sort

27:17
Substitution Method

27:32
The Master Method

29:29
Divide-and-Conquer

26:38
Divide-and-Conquer (Contd.)

27:41
Straseen’s Algorithms

34:05
QuickSort

29:49
Analysis of Quicksort

28:51
Randomized Quicksort

33:13
Heap

28:37
Heap Sort

30:07
Decision Tree

29:17
Linear time Sorting

27:09
Radix Sort & Bucket Sort

32:01
Order Statistics

27:23
Randomised Order Statistics

28:20
Worst case linear time order statistics

27:56
Hash Function

27:35
Open Addressing

29:11
Universal Hashing

28:47
Perfect Hashing

34:26
Binary Search Tree (BST) Sort

26:46
Randomly build BST

33:04
Red Black Tree

28:19
Red Black Tree (Contd.)

29:12
Augmentation of data structure

29:02
Interval trees

31:52
Fixed Universe Successor

26:32
Van Emde Boas Data Structure

34:39
Amortized Analysis

31:18
Computational Geometry

26:43
Computational Geometry (Contd.)

26:53
Dynamic Programming

27:46
Longest common subsequence

27:47
Graphs

28:35
Prim’s Algorithms

28:02
Graph Search

27:26
BFS & DFS

34:12
Shortest Path Problem

28:07
Dijktra’s

27:20
Example of Dijktra

27:41
Bellman Ford

27:15
Correctness of Bellman Ford

25:47
Application of Bellman Ford

28:06
All Pairs Shortest Path

26:03
Floyd – Warshall

28:14
Joshnson Algorithm

32:42
Disjoint Set Data Structure

26:01
Union – Find

28:21
Augmented Disjoint Set Data Structure

31:27
Network Flow

27:46
Network Flow (Contd.)

25:50
Network Flow (Contd.)

32:52
More on Dynamic Programming

26:24
More on Dynamic Programming (Contd.)

31:51
Computational Complexity

28:18
Computational Complexity (Contd.)

33:12

Databases

Introduction

42:54
Database Architecture

48:30
RDBMS Architecture

41:39
Introduction to ER Model

41:30
Entities and Relationships

39:55
Modelling Weak Entities and Design Choices

42:18
Relational Data Model and Notion of Keys

49:00
Introduction to Relational Algebra

43:49
Operators in Relational Model

39:57
Uses of Renaming, Join and Division in Relation Algebra

42:26
Example Queries in Relation Model and Outer Join Operation

38:57
Convert ER-Model to a Relational Model

45:09
Introduction to tuple relational calculus

44:44
Example TRC queries

42:43
Data definition using SQL

41:14
Basic SQL query block and subqueries

44:27
Correlated subqueries

41:15
Aggregate functions

43:03
Views

43:13
Programmatic access of SQL

48:55
Normal forms – Introduction

42:27
Deriving new functional dependencies

42:00
Proving soundness and completeness of Armstrong’s Axioms

49:46
Normal forms – 2 NF, 3NF, BCNF

41:08
Properties of decompositions

45:36
Normal forms – 4NF, 5NF

31:45
File orgranization methods

44:33
File orgranization methods

47:06
Dynamic File orgranization using Hashing

41:40
Index Structures

50:04
B+ trees on Disks

49:54
Performance and Reliability of Multiple Disks

42:26
Relational Query Evaluation

47:54
Join Operator Processing Algorithms

42:59
Query optimization

33:05
ACID properties and operations in transactions

47:00
Schdeules

52:50
Concurrency control using Locks

31:52
Recovery using undo logging method

48:17
Recovery using Redo and Undo-Redo logging methods

39:36
Recoverable schdeules and transaction isolation levels

24:07

Network Fundamentals

Computer Networks

Introduction to Computer Networks – A brief history

31:47
Data Networks – from Circuit Switching Network to Packet Switching Network

35:21
Network Protocol Stack

38:07
Services at the Different Layers of the Protocol Stack

34:27
Application Layer I – Different Protocols at the Application Layer

33:10
Application Layer II – Domain Name Systems

33:17
Application Layer III – File Transfer (FTP)

33:11
Application Layer IV – Hypertext Transfer Protocol (HTTP), HTML, Telnet Part-I

31:27
Application Layer IV – Hypertext Transfer Protocol (HTTP), HTML, Telnet Part-II

28:09
Application Layer V – Internet Mail Transfer (SMTP), Network Management (SNMP)

31:43
Transport Layer I – Services

31:13
Transport Layer II – Connection

39:23
Transport Layer II – Connection (Contd.)

36:40
Transport Layer IV – Reliability

29:16
Transport Layer V – Sliding Window Protocols

35:46
Transport Layer Performance

28:38
Buffer Management and Congestion Control

35:53
Transport Layer Primitives

28:15
Transmission Control Protocol I – Basics

33:18
Transmission Control Protocol II – Connections

31:36
Transmission Control Protocol III – Flow Control

33:56
Transmission Control Protocol IV – Congestion Control

37:18
User Datagram Protocol

32:08
Socket Programming – I

34:56
Socket Programming – II

42:40
Network Layer I – Introduction

33:01
IP Addressing (IPv4) I – Classful addressing

30:53
IP Addressing (IPv4) II – CIDR

29:00
IP Addressing (IPv4) III – Network Address Translation (NAT)

31:52
IPv6 Addressing

35:57
Internet QoS – I (What is QoS)

38:03
Internet QoS – II (Basic QoS Architecture)

27:55
Internet QoS – III (Traffic Policing and Traffic Shaping)

24:30
Internet QoS – IV (Traffic Scheduling)

37:26
Internet QoS – V (Integrated and Differentiated Service Architecture)

35:56
IP Routing Table

38:15
Routing in the Internet I – Intra-domain routing

36:43
Routing in the Internet II – Routing protocols

32:51
Routing in the Internet III – Inter-domain Routing

34:15
Routing in the Internet IV – Border Gateway Protocol

35:53
IP Routers

24:21
IP Routers Demo

39:40
Software Defined Networking – I (Basics)

23:57
Software Defined Networking – II (Open Flow)

34:37
Software Defined Networking – III (Demo)

34:22
Data Link Layer – Overview

32:05
Data Link Layer – Basic Concept

32:27
Data Link Layer – Ethernet

33:35
Data Link Layer – Ethernet (Contd.)

32:45
Data Link Layer – Flow and Error Control

31:58
ARP-RAPP-BOOTP-DHCP

34:31
ARP-RAPP-BOOTP-DHCP(Contd.)

33:18
Connectiing LANs,VLAN

33:57
Wireless LANs

32:17
Layer 1: Physical Layer

34:30
Layer 1: Physical Layer-II

32:50
Layer 1: Physical Layer-III

33:20
Network Security-Overview

37:29
Network Security-III[TCP?IPSecurity]

31:42
Network Security-III[TCP/IP Security]

34:11

Computer Networks Full Course

Theory of Computation

Deterministic Finite Automata (DFA)

27:25
Input alphabet

27:50
Extended transition function

29:27
Language of DFA

26:42
Building DFA

28:37
Building DFA (Contd.)

27:29
NFA (Nondeterministic Finite Automata)

25:25
Language of a NFA

27:37
Equivalence of DFA’s and NFA’s

29:27
Subset Construction

30:33
ϵ-NFA

28:25
Extended transition function of 𝜖-NFA

28:23
Language of 𝜖-NFA

24:58
𝜖-NFA to NFA

28:15
𝜖-NFA to DFA

30:45
Regular expression

28:24
Regular expression (Contd.)

27:47
More on regular expression

28:15
Equivalence of 𝜖-NFA and regular expression

28:26
Equivalence of 𝜖-NFA and regular expression (Contd.)

27:06
DFA to Regular expression

26:36
DFA to Regular expression (Contd.)

28:51
Construction of regular expression from a DFA (Example)

28:24
Closure properties of Regular Set

26:52
Closure properties of Regular Set (Contd.)

30:48
Substitution

28:49
Pumping Lemma

28:16
Application of the pumping lemma

26:23
More on Pumping lemma

27:05
Arden’s Theorem

28:37
Minimization of FA

28:52
Minimization of FA (Contd.)

28:56
Two way FA

28:15
Finite automata with output

27:38
Equivalence of Moore and Mealy machine

26:15
Context free grammars (CFG)

26:53
Context free language (CFL)

26:46
More example on CFL

28:21
More on CFG

28:29
Derivation Tree/Parse Tree

26:14
Leftmost and Rightmost derivations

28:39
Ambiguity in CFG

28:24
Simplification of CFG

26:56
Algorithms to construct reduced grammar

29:35
Elimination of Null and Unit productions

31:53
Chomsky Normal Form (CNF)

28:55
Greibach Normal Form (GNF)

33:50
Pushdown Automata (PDA)

28:59
Language accepted by PDA

27:05
Example of a language accepted by PDA

27:46
Deterministic PDA

31:43
Equivalence of language accepted

31:53
Equivalence PDA

27:52
Equivalence PDA and CFL

27:56
Equivalence PDA and CFL (Contd.)

27:00
Relationship between regular language and CFL

26:59
Pumping lemma for CFLs

27:52
Closer properties of CFLs

25:35
Turning Machine

25:56
Language accepted by a Turning machine

28:33

Compiler Design

Introduction

31:40
Introduction (Contd.)

29:32
Introduction (Contd.)

32:20
Introduction (Contd.)

34:04
Introduction (Contd.)

28:04
Introduction (Contd.)

14:19
Lexical Analysis

31:50
Lexical Analysis (Contd.)

30:37
Lexical Analysis (Contd.)

29:26
Lexical Analysis (Contd.)

30:06
Lexical Analysis (Contd.)

27:29
Lexical Analysis (Contd.)

24:55
Lexical Analysis (Contd.)

26:03
Lexical Analysis (Contd.)

28:49
Lexical Analysis (Contd.)

32:52
Parser

30:53
Parser (Contd.)

31:24
Parser (Contd.)

34:46
Parser (Contd.)

28:28
Parser (Contd.)

27:50
Parser (Contd.)

29:01
Parser (Contd.)

29:01
Parser (Contd.)

30:20
Parser (Contd.)

31:41
Parser (Contd.)

27:19
Parser (Contd.)

27:13
Parser (Contd.)

30:02
Parser (Contd.)

28:37
Parser (Contd.)

29:09
Parser (Contd.)

29:01
Parser (Contd.)

28:51
Parser (Contd.)

31:41
Parser (Contd.)

31:12
Parser (Contd.)

29:07
Parser (Contd.)

28:56
Parser (Contd.)

25:55
Parser (Contd.)

33:20
Parser (Contd.)

29:26
Type Checking

28:59
Type Checking(Contd.)

30:43
Type Checking(Contd.)

30:35
Type Checking(Contd.)

29:26
Symbol Table

28:45
Symbol Table (Contd.)

30:20
Symbol Table (Contd.)

29:37
Symbol Table (Contd.) and Runtime Environment

28:30
Runtime Environment

28:55
Runtime Environment (Contd.)

29:21
Runtime Environment (Contd.)

29:26
Intermediate Code Generation

28:53
Intermediate Code Generation (Contd.)

28:43
Intermediate Code Generation (Contd.)

30:11
Intermediate Code Generation (Contd.)

29:30
Intermediate Code Generation (Contd.)

29:14
Intermediate Code Generation (Contd.)

29:43
Intermediate Code Generation (Contd.)

29:52
Intermediate Code Generation (Contd.)

29:33
Intermediate Code Generation (Contd.)

29:13
Intermediate Code Generation (Contd.)

25:13
Intermediate Code Generation (Contd.)

30:28
Intermediate Code Generation (Contd.)

28:43

Programming | C

Introduction

28:27
Idea of Algorithms

27:47
Flow Chart and Pseudocode

32:16
Introduction to Programming Language Concepts

34:40
Variables and Memory

33:33
Types of Software and Compilers

31:57
Introduction to C Programming Language

30:50
Variables and Variable Types in C

29:36
Introducing Functions

28:37
Address and Content of Variables and Types

32:52
Assignment Statement and Operators in C

30:24
Arithmetic Expressions and Relational Expressions

31:08
Logical Operators and Change in Control Flow

27:28
Use of Logical Operaotrs in Branching

32:09
Branching IF – ELSE Statement

28:33
IF-ELSE Statement (Contd.)

33:25
Switch statement

26:14
Switch Statement (Contd.) and Introduction to Loops

26:47
Implementing Repetitions (Loops)

31:18
Implementation of Loops with for Statement (Contd.)

31:00
For Statement (Contd.)

27:26
Example of If-Else

34:41
Example of Loops

27:53
Example of Loops (Contd.)

23:38
Example of Loops (Contd.), Use of FOR Loops

30:25
Introduction to Arrays

27:33
Arrays (Contd.)

28:47
Arrays (Contd1.)

31:12
Program using Arrays

30:12
Array Problem

28:24
Linear Search

34:11
Character Array and Strings

39:26
String Operations

32:48
2-D Array Operation

26:33
Introducing Functions

33:26
More on Functions

32:08
Function (Contd.)

34:51
Scanf and Printf Functions; Function Prototype

30:00
Parameter Passing in Function Revision

38:37
Parameter Passing in Function Revision (Contd.)

37:21
Substitution of # include and Macro

31:26
search as a function

29:43
Binary Search

27:23
Binary Search (Contd.)

28:58
Sorting Methods

31:08
Bubble Sort (Contd.)

30:56
Use of Pointer in Function Context Bubble Sort

22:26
Arrays at Strings

36:29
Data Representation

29:48
Bisection Method

35:44
Interpolation

26:21
Trapezoidal Rule and Runge-Kutta Method

30:39
Recursion

27:22
Recursion(Contd.)

18:39
Structure

27:18
Structure (Contd.)

26:27
Structure with typedef

25:50
Pointer

27:57
Pointer (Contd.)

25:38
Pointer in Structures

24:24
Dynamic Allocation and File

36:34

Programming | C++

Introduction

15:04
Introduction (Contd.)

14:46
Introduction (Contd.)

19:23
Introduction (Contd.)

16:44
Problem Solving using Computer

21:22
Problem Solving using Computer (Contd.)

11:14
Problem Solving using Computer (Contd.)

29:11
Problem Solving using Computer (Contd.)

18:51
Problem Solving using Computer (Contd.)

16:46
Part 1 : Basic Elements of Program

22:45
Part 2 : Basic Elements of Program

25:56
Part 3 : Basic Elements of Program

16:12
Part 4 : Basic Elements of Program

13:09
Part 1 : Program Design

09:14
Part 2 : Program Design

14:54
Part 3 : Program Design

17:32
Simple cpp Graphics

25:02
Part 1 : Conditional Execution

21:19
Part 2 : Most general form of if

10:34
Part 3 : More general form of conditions

14:39
Part 4 : A somewhat large program example

07:49
Part 5 : Switch statement and logical data

19:14
Loops

14:49
Mark averaging

11:34
The break and continue statements

09:10
The for statement

24:55
Euclid’s algorithm for GCD

17:18
Correctness proof for GCD

18:29
Computing Mathematical Functions Part 1 : Taylor series

22:54
Computing Mathematical Functions Part 2 : Numerical integration

15:28
Computing Mathematical Functions Part 3 : Bisection Method

19:45
Computing Mathematical Functions Part 4 : Newton Raphson Method

20:42
Loops in various applications Part 1 : Brute force algorithms

17:09
Loops in various applications Part 2 : Finding Pythagorean Triples

18:40
Loops in various applications Part 3 : Modelling a system: bargaining

11:59
Loops in various applications Part 4 : Simulating a water tank

20:22
Loops in various applications Part 5 : Arithmetic on very large numbers

26:07
Functions Part 1 : Basics

29:59
Functions Part 2 : Examples

17:27
Functions Part 3 : Reference parameters

11:41
Functions Part 4 : Pointers

26:10
Functions Part 5 : Graphics Objects and Lecture conclusion

12:05
Recursion Part 1 : Introduction

20:15
Recursion Part 2 : Recursive objects, Tree drawing

24:06
Recursion Part 3 : How to think about recursion

26:10
Virahanka Numbers Part 1 : Introduction

13:37
Virahanka Numbers Part 2 : Recursive Program

14:55
Virahanka Numbers Part 3 : Iterative Program and Conclusion

10:33
Program Organization and Functions Part 1 : Introduction

19:31
Program Organization and Functions Part 2 : Splitting into files

17:13
Program Organization and Functions Part 3 : Namespaces

06:44
Program Organization and Functions Part 4 : How to use C++ without simplecpp

09:44
Advanced Features of Functions Part 1: Introduction and passing one function to another

14:05
Advanced Features of Functions Part 2 : Lambda expressions

15:13
Advanced Features of Functions Part 3 : Default values to parameters

11:22
Advanced Features of Functions Part 4 : Function over loading and lecture conclusion

11:04
Array Part-1 : Part 1 : Introduction

15:20
Array Part-1 : Part 2 : Marks averaging problem

15:38
Array Part-1 : Part 3 : Histogram computation

12:07
Array Part-1 : Part 4 : Marks display variation

17:36
Array Part-1 : Part 5 : Polynomial multiplication

12:16
Array Part-1 : Part 6 : Queues in dispatching taxis

14:58
Array Part-1 : Part 7 : More efficient Queues in dispatching taxis

16:42
Array Part-1 : Part 8 : Disk intersection

12:51
Array Part-1 : Part 9 : Arrays of graphical objects and conclusion

13:35
Array Part-2 : Part 1 : Introduction

12:04
Array Part-2 : Part 2 : Interpretation of aname[index]

14:31
Array Part-2 : Part 3 : Arrays and function calls

11:50
Array Part-2 : Part 4 : A function to sort an array

18:39
More on Arrays : Part 1 : Textual data

23:15
More on Arrays : Part 2 : Functions on character strings

17:23
More on Arrays : Part 3 : Two dimensional arrays

25:02
More on Arrays : Part 4 : Command Line Arguments

13:40
Arrays and recursion : Part 1 : Binary Search Introduction

30:27
Arrays and recursion : Part 2 : Binary search analysis

13:25
Arrays and recursion : Part 3 : Mergesort overview

07:42
Arrays and recursion : Part 4 : Merge function

12:00
Arrays and recursion : Part 5 : Mergesort conclusion

14:40
Structures : Part 1 : Definition and instantiation

09:28
Structures : Part 2 : Operations on structures

14:06
Structures : Part 3 : An example program

11:16
Structures : Part 4 : Pointers and lecture conclusion

13:01
Structures Part 2 : Part 1 : Introduction to Member functions

10:22
Structures Part 2 : Part 2 : Vectors from Physics

17:59
Structures Part 2 : Part 3 : Taxi dispatch

12:28
Classes : Part 1 : Introduction

08:42
Classes : Part 2 : Constructors

11:07
Classes : Part 3 : Operator overloading

15:41
Classes : Part 4 : Access control

09:12
Classes : Part 5 : Classes for graphics and input output

11:10
Classes : Part 6 : General remarks

17:06
Representing variable length entities: Part 1 : Introduction

07:56
Representing variable length entities: Part 2 : Heap memory basics

17:09
Representing variable length entities: Part 3 : Pitfalls of using heap memory

12:14
Representing variable length entities: Part 4 : Automating memory management

15:20
Part 5 : Implementing a class with automated memory management 1

16:19
Part 6 : Implementing a class with automated memory management 2

13:36
Part 7 : Using the implemented class and conclusion

13:43
The Standard Library: Part 1 : Class string

09:42
The Standard Library: Part 2 : Class vector

17:00
The Standard Library: Part 3 : Sorting vectors and arrays

04:41
The Standard Library: Part 4 : Classes map and unordered_map

08:36
The Standard Library: Part 5 : Iterators

16:26
Data structure based programming : Part 1 : Introduction

05:04
Data structure based programming : Part 2 : Set and pair classes

15:31
Part 3 : Implementation of standard library data structures

13:03
Data structure based programming : Part 4 : Composing data structures

15:37
Data structure based programming : Part 5 : typedef and lecture conclusion

06:02
Medium size programs : Part 1 : The new marks display program

09:47
Medium size programs : Part 2 : Manual algorithm for new marks display

28:08
Medium size programs : Part 3 : RSMTAB and rest of the program

26:38
Medium size programs : Part 4 : Sophisticated solutions to marks display

37:51
A graphical editor and solver for circuits : Part 1 : Outline

07:13
A graphical editor and solver for circuits : Part 2 : Main program and organization

33:49
Part 3: Mathematical representation of the circuit

28:50
A graphical editor and solver for circuits Part 4 : Extensions and concluding remarks

12:25
Cosmological simulation : Part 1 : Introduction and First order Euler method

25:59
Cosmological simulation : Part 2 : Second order Euler method

21:45
Cosmological simulation : Part 3 : The program

21:42
Cosmological simulation : Part 4 : Concluding remarks

09:00

Programming | Java

Introduction

33:34
Java Programming Steps

28:59
Java Tools and Resources

38:09
Demonstration – I

29:01
Java Applet Programming

35:56
Demonstration-II

30:23
Encapsulation

35:38
Demonstration-III

34:55
Java Programming Insights

36:45
Demonstration-IV

38:56
Java Static Scope Rule

33:01
Demonstration-V

38:11
Inheritance

33:23
Demonstration-VI

36:53
Information Hiding

34:37
Demonstration-VII

37:18
Packages-I

29:23
Packages-II

35:16
Demonstration-VIII

33:55
Interface-I

33:09
Interface-II

29:34
Demonstration-IX

41:17
Exception Handling-I

27:16
Exception Handling-II

28:05
Exception Handling-III

31:49
Demonstration-X

22:24
Multithreading-I

36:10
Multithreading-II

34:36
Demonstration-XI

37:09
I-O Stream-I

21:59
I-O Stream-II

38:45
I-O Stream-III

36:48
Demonstration-XII

45:31
Applet Programming—I

29:26
Applet Programming—II

33:35
Applet Programming–III

34:40
Demonstration-XIII

34:43
Demonstration-XIV

28:25
AWT Programming—I

38:00
AWT Programming—II

35:26
Demonstration-XV

37:45
AWT Programming–III

38:05
Swing—I

28:23
Swing—II

32:21
Demonstration-XVI

35:48
Demonstration-XVII

21:13
Demonstration-XVIII

33:43
Networking with Java

45:40
Demonstration-XIX

32:54
JDBC—I

34:39
JDBC—II

37:03
JDBC—III

19:13
Demonstration—XX

27:49
Demonstration—XXI

23:38
Demonstration—XXII

22:15
Case Studies—I

25:18
Case Studies—II

28:13
Case Studies—III

23:35
Case Studies—IV

22:16
Case Studies—V

25:17

Computer Engineering Preparation

About Course

What Will You Learn?

Course Content

Digital Logic

Introduction

Introduction (Contd.)

Number System

Number System (Contd.)

Number System (Contd.)

Number System (Contd.)

Number System (Contd.)

Boolean Algebra

Boolean Algebra (Contd.)

Boolean Algebra (Contd.)

Boolean Algebra (Contd.)

Boolean Algebra (Contd.)

Boolean Algebra (Contd.)

Logic Gates

Logic Gates (Contd.)

Logic Gates (Contd.)

Logic Gates (Contd.)

Logic Gates (Contd.)

Logic Gates (Contd.)

Arithmetic Circuits

Arithmetic Circuits (Contd.)

Arithmetic Circuits (Contd.)

Decoders, Multiplexers, PLA

Decoders, Multiplexers, PLA (Contd.)

Decoders, Multiplexers, PLA (Contd.)

Decoders, Multiplexers, PLA (Contd.)

Decoders, Multiplexers, PLA (Contd.)

Sequential Circuits

Sequential Circuits (Contd.)

Sequential Circuits (Contd.)

Sequential Circuits (Contd.)

Sequential Circuits (Contd.)

Sequential Circuits (Contd.)

Sequential Circuits (Contd.)

Finite State Machine

Finite State Machine (Contd.)

Data Converters

Data Converters (Contd.)

Data Converters (Contd.)

Data Converters (Contd.)

Memory

Memory(Contd.)

Memory(Contd.)

FPGA

FPGA (Contd.)

VHDL

VHDL(Contd.)

8085 Microprocessor

8085 Microprocessor (Contd.)

8085 Microprocessor (Contd.)

8085 Microprocessor (Contd.)

8085 Microprocessor (Contd.)

8085 Microprocessor (Contd.)

8085 Microprocessor (Contd.)

8085 Microprocessor (Contd.)

8085 Microprocessor (Contd.)

8085 Microprocessor (Contd.)

8085 Microprocessor (Contd.)

8085 Microprocessor (Contd.)

8085 Microprocessor (Contd.)

8085 Microprocessor (Contd.)

8085 Microprocessor (Contd.)

8086 Microprocessor

8086 Microprocessor (Contd.)

8086 Microprocessor (Contd.)

Computer Organization

Introduction To Computing

Introduction To System : Software

Introduction To System : Hardware

Processor Activities

Processor As a State Machine

Data Path Architecture

Data Path Controller : Micro Programmed

State Machine Design

Controller Design: Microprogrammed and Hardwired