4 тысяч подписчиков
293 видео
Lec68: File System Layout | Operating Systems
Lec69: Implementing Directories | Operating Systems
Lec30 : Program to swap two numbers without using a third Variable
Lec38: Hierarchical (Multilevel) Paging- Two level Paging Example
Lec10 :Theta notation-Example
Lec24:Port Security | CN Lab
Lec59- HTTP | Computer Networks
Lec43 -Transport Layer services(Part-1)| Computer Networks
Lec21- What is DHCP and how does it work??|Computer Networks
Lec31-How to construct forwarding tables for Routers in RIP
Components of a Computer Network-Introduction
Lec08: Big Omega Notation | Aysmptotic Notations
Lec18:DHCP Service -Configuration and Implementation in a LAN
Lec51: Heap Sort - Heapify Method
Lec47: Topological Sort- Source Removal Method
Lec46 - UDP Services
Lec25-Binary Semaphore and Mutex
Lec53- Data Transfer in TCP | computer Networks
Lec07-Introduction to IPv4 Addresses; What is Classful Addressing? |Computer Networks
Lec04 : Analysis Framework and Order of Growth
Lec30:IOS Show commands in cisco packet tracer | CN LAB
Lec34: 2-3 Trees- Example 3
Lec11 : Sequential Search Algorithm and it's time complexity | Brute Force Approach
Lec41 : Comparing Orders of Growth - Limit-based Approach
Lec42 : String Matching - Brute Force Approach
Lec14-Example on Subnetting |Computer Networks
Lec19: Difference between getch() and getche()
Lec17: Recursive Analysis- Tower of Hanoi
Lec35 : Floyd's Algorithm- All-Pairs Shortest- Paths Problem
Lec01.2: TCP/IP Network Model | Computer Networks
Lec16: Initial Switch Configuration | Computer Networks Lab.
Lec34:Paging-A non-contiguous Memory Allocation technique.
Lec51:LRU Page Replacement Algorithm
Lec14.5 -Network Address Translation(NAT) |Computer Networks
Lec24: Increment and Decrement Operators; Part-3
Lec48: Topological Sort- DFS Method
Lec33 : 2-3 Trees- Example 2
Lec28 : Dijkstra's Algorithm | Single source shortest Path
Lec 40 : Traveling Salesman Problem | Branch and Bound
Lec36 : 0/1 Knapsack Problem - Dynamic Programming
Lec44: Trick to Remember Strassen's Matrix Multiplication Formulas
Lec43: Strassen's Matrix Multiplication- Divide and Conquer
Lec16 : Tower of Hanoi | Recursive Algorithm
Lec49-TCP services | Computer Networks
Lec36: ELSE IF LADDER statement in c programming
Lec39: Subset Sum problem - Backtracking
Lec49: Topological Sort- DFS Method
Lec33-An example for Link State Routing|Computer Networks
Lec12:SRTN(Shortest Remaining Time Next)Preemptive of SJF
Lec55- Error Control in TCP |Computer Networks
Lec29 : Transform and Conquer and AVL trees - Introduction
