COMPUTING

Semiconductor

• ⨘ } VLSI } coding Techniques – a simple fifo design in verilog / system verilog
  https://youtu.be/uETKhaT77g4  358 total views
• ⨘ } VLSI } Reconvergence, CDC
  https://youtu.be/ycAMZN1Idz0  354 total views
• ⨘ } VLSI } 23 } Transmission Gate Logic Circuits } LE PROFESSEUR }
  Transmission gate logic style offers certain advantages over pass-transistor logic. We discuss about transmission logic gate concepts, how can we ...
• ⨘ } VLSI } 22 } Pass-transistor logic circuits
  nmos/pmos transistors can be used in a configuration where voltage on gate can be think in terms of control or ...
• ⨘ } VLSI } CMOS Circuits, Physical Layout, Combinatorial Logic Gates } LEPROF }
  We have discussed logic gates in the previous lecture: Logic gates using multiplexers. We discussed at logic gate level. In ...
• ⨘ } VLSI } 20 } CMOS Interconnects }
  Wire connecting the devices (nmos, pmos) are normally referred to as interconnects. Interconnects are very important, almost 70 percent chip ...
• ⨘ } VLSI } 19 } System Verilog } Assertions } Async Interfaces } Protocol Verification }
  We discuss assertions for asynchronous interfaces, how asynchronous master-slave protocol assertions can be written, debugged and complex protocols can be ...
• ⨘ } VLSI } 18 } Mentor’s Questa CDC Analysis } 0in }
  Siemens / Mentor’s Questa 0-in clock domain crossing (CDC) solution – how to use Questa CDC tool, what are different ...
• ⨘ } VLSI } 017 } CMOS Power Consumption }
  CMOS power and energy concepts, power analysis during chip design flow is discussed. AC and DC power are discussed. Different ...
• ⨘ } VLSI } 016 } Do You Write a Good RTL Code }
  Important concepts for a good RTL design, blocking, non-blocking type of statements in verilog, multiple-drivers, assertions, fsm-deadlock, and in general ...
• VLSI } 015 } Static Timing Analysis
  This lecture discuss static timing analysis concepts. What are different paths, different kinds of checks, e.g. max type, min type ...
• VLSI } 014 } Latch-up & CMOS Technologies }
  Latch-up phenomenon in CMOS circuits – What is latch-up, what are typical methods to mitigate latch-up and layout changes ...
• VLSI } 013 } Floor-planning tips }
  This lecture discusses some of the SoC floor-planning challenges and tips. A good floor-plan is the key to quality placement ...
• VLSI } 012 } Metastability }
  This lecture discusses concept of metastability. Synchronous designs suffer from this inherent problem associated with flip-flops, latches in the design. ...
• VLSI } 011 } Clock Domain Crossing } Multi Voltage Domains }
  This lecture discusses multi voltage domain crossings. Now a days integrated circuits are no longer simple circuits running on one ...
• VLSI } 010 } Reset Domain Crossing (RDC) }
  This lecture discusses reset domain crossing (RDC) digital design techniques. Reset trees are similar to clock trees and resets crossings ...
• VLSI } 009 } Clock Domain Crossings } FIFO }
  This lecture extends the discussion on clock domain crossings. In this lecture design techniques for multi-bit clock crossings have been ...
• VLSI } 008 } Antenna Effects }
  This lecture discusses concept of antenna effect in vlsi physical design. A typical chip manufacturing steps discussed with the design ...
• VLSI } 007 } Logic Gates using Multiplexers }
  This lecture discusses multiplexers and logic gates. How to design logic gates using 2:1 multiplexers? Multiplexers are considered universal logic. One ...
• Tutorials } System Verilog } Assertions }
  This lecture discusses assertions in system verilog. Immediate, concurrent assertions with multiple clock domains are discussed. Leprofesseur } ...
• VLSI } 006 } Timing }
  This lecture discusses timing in digital circuits. It is said that “Timing is everything”. If someone does not arrive on time ...
• VLSI } 005 } State Machines }
  This lecture discusses a fundamental and an important topic in digital circuit design – state machines. Mealy and Moore variants ...
• VLSI } 004 } Clock-Domain-Crossing [CDC] Design Techniques }
  This lecture discusses clock domain crossing (CDC) design techniques, single bit CDC signals, multi-bit CDC signals, 2-stage synchronizing flip-flops, 3-stage ...
• VLSI } 003 } SoC design using cores and mixed-signal design aspects }
  Practical concerns about system-on-a-chip design with respect to mixed-signal cores are discussed. It is difficult to design a mixed-signal IP ...
• Tutorials } System Verilog } A quick overview for verification }
  This video lecture provides a quick concise overview about hardware verification environment and system verilog. At many universities this topic ...
• VLSI } 002 } ASIC Design Automation Flow }
  This video lecture describes EDA (Electronic Design Automation) tool flows. How the design idea of an integrated circuit is translated ...
• VLSI } 001 } Design abstractions }
  This video lecture discusses design abstractions, different levels in Gajski-Kuhn Y-Chart. If you like to have private lessons/tuition you may contact ...

Algorithms

• Algorithms } 045 } Ant Colony Optimization } Technique
  This lecture extends further the discussion on any colony technique. Ants can be considered artificial agents which work together and ...
• Algorithms } 044 } Ant Colony Optimization } Introduction }
  This lecture introduces the concept of ant colony. Individual ants may not be that smart but when they work in ...
• Algorithms } 043 } Genetic Algorithms }
  This lecture discusses basic principles of Genetic Algorithms, a class of evolutionary computational algorithms. Genetic algorithms are based on the ...
• Algorithms } 042 } Monte-Carlo Methods }
  This lecture discusses basic principles of Monte-Carlo methods, a class of computational algorithms. A simple example of estimating value of ...
• Algorithms } 04 } Bags, Queues, and Stacks }
  This lecture covers very basic concepts about bags, stacks and queues in nutshell. You may have known these concepts already. ...
• Algorithms } 040 } Computational Geometry }
  This lecture introduces computational geometry and basic algorithms for finding line segments. Computational geometry has applications in many areas: robotics, ...
• Algorithms } 039 } String Matching } Knuth-Morris-Pratt }
  This lecture discusses Knuth-Morris-Pratt string matching algorithm. Click above and Leprofesseur } on YouTube. We appreciate your feedback ...
• Algorithms } 038 } String Matching } Finite Automata }
  This lecture discusses string matching problem and finite automation based string matcher algorithm. Click above and Leprofesseur } ...
• Algorithms } 037 } String Matching }
  This lecture discusses string matching problem and brute force naive string matcher algorithm. Click above and Leprofesseur ...
• Algorithms } 036 } Greatest Common Divisor (GCD) }
  This lecture discusses Euclid’s algorithm for finding greatest common divisor. Extended Euclid’s algorithm has also been discussed. ...
• Algorithms } 035 } Linear Programming } Simplex Algorithm }
  This lecture discusses optimization problems, slack representation and Simplex algorithm for solving linear programming problems. Leprofesseur } on ...
• Algorithms } 034 } Solving Linear Equations }
  This lecture discusses LPU decomposition method for solving linear equations. Leprofesseur } on YouTube. We appreciate your feedback ...
• Algorithms } 033 } Parallel Algorithms }
  This lecture discusses introduction to parallel algorithms with multi-threading. Fibonacci series example is discussed. Leprofesseur } on YouTube. ...
• Algorithms } 032 } Graphs } Flow Networks } Push-Relabel }
  This lecture discusses Push-Relabel approach for solving flow network problems. Generic flow-network algorithm has been discussed. Leprofesseur } ...
• Algorithms } 031 } Graphs } Flow Networks } Edmonds-Karp }
  This lecture discusses basic difference between Edmonds-Karp and Ford-Fulkerson’s algorithm. Leprofesseur } on YouTube. We appreciate your feedback ...
• Algorithms } 030 } Graphs } Flow Networks } Ford-Fulkerson }
  This lecture discusses concept of flow networks, flow, residual graph, and how to find maximum flow value in a flow ...
• Algorithms } 029 } Graphs } Dijkstra’s algorithm }
  This algorithm discusses Dijkstra’s algorithm for single-source shortest path problem. Leprofesseur } on YouTube. We appreciate your ...
• Algorithms } 028 } Graphs } The Bellman-Ford Algorithm }
  This lecture discusses the Bellman-Ford algorithm for finding single source shortest path. Leprofesseur } on YouTube. We ...
• Algorithms } 027 } Graphs } Minimum Spanning Tree } Prim }
  This algorithm discusses Prim’s algorithm for finding minimum spanning tree. Leprofesseur } on YouTube. We appreciate your ...
• Algorithms } 026 } Graphs } Minimum Spanning Tree } Kruskal }
  This algorithm discusses Kruskal’s algorithm for finding minimum spanning tree. Leprofesseur } on YouTube. We appreciate your support ...
• Algorithms } 025 } Graphs } Minimum Spanning Tree } Introduction }
  This lecture discusses spanning trees and minimum spanning tree with a generic algorithm to find a minimum spanning tree ...
• Algorithms } 024 } Topological Sort }
  This lecture discusses topological sort algorithm with examples.  6,680 total views
• Algorithms } 023 } Graphs } Depth-First Search (DFS) }
  This lecture discusses depth-first search algorithm.  7,231 total views
• Algorithms } 022 } Graphs } Breadth-First Search (BFS) }
  This lecture discusses breadth-first search algorithm. Sincerely, H.  6,679 total views
• Algorithms } 21 } Graphs } Representation }
  This lectures introduces graphs in the context of computer science. Representation basics with examples are discussed. Please ...
• Algorithms } 020 } Data Structures } Disjoint-Sets }
  This lecture discusses disjoint dynamic set data structures. A graph example is discussed for dynamic sets. Please ...
• Algorithms } 019 } Data Structures } van Emde Boas [ vEB ] Trees }
  This lecture discusses in detail a very beautiful data structure – van Emde Boas Tree. Dictionary structures, direct address tables, ...
• Algorithms } 018 } Data Structures } Fibonacci Heap } Basic Operations } 4 }
  This lecture discusses deleting a node and how to decrease the key of node in a Fibonacci heap data structure. Please ...
• Algorithms } 017 } Data Structures } Fibonacci Heaps } Basic Operations } 3 }
  This lecture discusses extract operations on Fibonacci Heaps. Please { Leprofesseur } on YouTube. We appreciate your support. Sincerely, ...
• Algorithms } 016 } Data Structures } Fibonacci Heaps } Basic operations } 2 }
    This lecture discusses union operation on Fibonacci heaps. Please { Leprofesseur } on YouTube. We appreciate your support. Sincerely, H. ...
• Algorithms } 015 } Data Structures } Fibonacci Heaps } Basic Operations } 1 }
  This lecture discusses creation and insertion operation on Fibonacci heap data structure. If you need private lessons/consultation you may contact ...
• Algorithms } 014 } Fibonacci Heaps } Introduction }
  This lecture discusses Fibonacci Heaps. { Leprofesseur } channel on YouTube. Sincerely, H.  4,574 total views
• Algorithms } 013 } Data Structures } B-Trees } Basic Operations }
  This lecture discusses basic operations like search, creation, insertion, and deletion in a B-Tree. We appreciate your feedback and do ...
• Algorithms } 012 } Data Structures } B-Trees } Introduction }
  This lecture introduces an advanced data structure – B-Trees. Do not forget to { Leprofesseur } channel ...
• Algorithms } 011 } Dynamic programming and portfolio optimization }
    This video lecture discusses the dynamic programming approach of solving problems. One simple problem rod cutting is discussed with DP ...
• Algorithms } 010 } Bucket Sort }
  This video lecture discusses bucket sort algorithm. An example is discussed with how to calculate time complexity of this algorithm. If ...
• Algorithms } 009 } Counting Sort }
  This video lecture discusses counting sort. If you need private lessons, you may contact at: hr@Leprofesseur.org Do not forget to subscribe ...
• Algorithms } 008 } Heapsort }
  Heapsort algorithm is discussed in this video lecture. If you need private lessons, you may contact at: he@Leprofesseur.org Do not forget ...
• Algorithms } 007 } Analysis of randomized algorithms }
  This lecture discusses about the analysis of randomized algorithms, a randomized quick-sort example is discussed. If you need private lessons, you ...
• Algorithms } 006 } Randomized algorithms }
  This video lecture lights upon basic concepts about randomized algorithms, classification of random algorithms, time complexity of random algorithms. If ...
• Algorithms } 005 } Divide-and-conquer }
  This video lecture explains divide-and-conquer approach. Divide-and-conquer algorithm for solving a stock market problem is discussed. A simple algorithm to ...
• Algorithms } 004 } Analysis of algorithms }
  This video lecture explains the analysis of algorithms, run-time complexity and how we can estimate it. Do not forget to ...
• Algorithms } 003 } Insertion Sort }
    This video explains insert sort algorithm and helps to develop more understanding about algorithms. If you like to have private tuition/lessons, ...
• Algorithms } 002 } Data Structures } Introduction }
    This lecture discusses basic concepts about data structures. Data abstraction, abstract data types, and basic idea about data structures are ...
• Algorithms } 001 } Introduction }
    This is the first video lecture for algorithms lecture series. This video gives a basic understanding about algorithms, discusses flowchart ...

Computational Complexity

• Computational Complexity } 004 } Space complexity }
  This lecture discusses space complexity classes. Please { Leprofesseur } on YouTube. We appreciate your support. Sincerely, H.  6,369 total views, ...
• Computational Complexity } 003 } coNP, EXP, and NEXP }
  This lecture discusses Karp’s reduction, coNP, EXP, and NEXP complexity classes. Do not forget to { Leprofesseur ...
• Computational Complexity } 002 } P, NP, NP-Completeness, and Non-Deterministic Turing Machine }
  In this lecture, NP complexity class, NP-completeness, relation between P and NP, and Non-deterministic Turing Machine concept is discussed. Do not ...
• Computational Complexity } 001 } Introduction, P and NP }
  This lecture introduces the computational complexity subject with formal definition of Turing machine and a discussion on P, NP and ...

Computer Programming

• ⨘ } Matlab quick overview }
  This lecture provides a quick overview for Matlab or Octave. Matlab and Octave both are software tools for scientific computations. ...
• Computer Programming } 007 } Art of Programming, How to Structure your Program }
  This lecture discusses about how you can structure your program. It explains use of header files, makefile and in general ...
• Computer Programming } 006 } C++ } Basic facilities }
  This video lecture provides a quick overview of different basic facilities offered by C++. Do not forget to subscribe { ...
• Computer Programming } 005 } C++ } Concurrency }
  This video lecture discusses basic methods for handling concurrency in C++ programs. If you need private lessons, you may contact at: ...
• Computer Programming } 004 } C++ } Standard Library }
  This video lecture discusses some features of C++ standard library. If you need private lessons, you may contact at: hr@leprofesseur.org Do ...
• Computer Programming } 003 } C++ } Abstraction mechanisms }
  This video lecture discusses C++ data abstraction mechanisms. Abstract classes, concrete classes and templates are discussed. You may subscribe { Leprofesseur ...
• Computer Programming } 002 } C++ } Introduction }
  This video lecture provides a tour of C++, discusses some basic concepts and a general overview of the language. Do not ...
• Computer Programming } 001 } Languages }
  In this video lecture basic idea about programming languages, abstraction levels, syntax, semantics and general background about programming are discussed. Do ...

Software Engineering

• Software Engineering } 007 } Agile versus Spiral }
  This lecture discusses key ideas of agile framework and its differences with traditional waterfall and spiral software development methodologies. Waterfall model ...
• Software Engineering } 006 } UML } Introduction }
  This lecture introduces UML . An overview about different UML diagrams is discussed. [ ►Subscribe ...
• Software Engineering } 005 } Objects & Classes }
  This lecture discusses concept of objects and classes with UML and C++ examples. Please { Leprofesseur } ...
• Software Engineering } 004 } Modularity & Hierarchy }
  This lecture discusses modularity and hierarchy concepts in the context of object-oriented analysis and design. Please { Leprofesseur ...
• Software Engineering } 003 } Encapsulation }
  This lecture discusses concept of encapsulation. Please { Leprofesseur } on YouTube. We appreciate your support. Sincerely, H.  4,664 total ...
• Software Engineering } 002 } Abstraction }
  This lecture discusses concept of abstraction. Please { Leprofesseur } on YouTube. We appreciate your support and ...
• Software Engineering } 001 } Systems & Objects }
  This lecture set up the foundation for object-oriented software systems design course. A discussion about systems, objects, procedural thinking, and ...

Reference List:

1. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, “Introduction to Algorithms”.
2. Bjarne Stroupstrup, “The C++ programming language”.
3. Sanjeev Arora, Boaz Barak, “Computational Complexity”.
4. Alan V. Oppenheim, “Signals and systems”.
5. Mark Rhodes-Ousley, “Information Security”.
6. Larry Patterson, “Computer Networks”.
7. Bahzad Razavi, “RF Microelectronics”.
8. Chuck Easttom, “Computer Security Fundamentals”.

And,
– Various research papers, documents, and articles from internet search.