Engineering Wing started by Shabana Sultana on 6th May,2022, is a technical educational channel Computer Science students.
This channel aims to convey the technical knowledge in the most simplest way by quoting an analogy wherever possible.

Myself, Shabana Sultana , professor in the department of computer science has a passion for teaching and I would like to share whatever little knowledge I have in this domain with others.

I always aim to see weaker students in a class improve and excel in their performance.

I love to encourage and motivate students in their studies.

I started uploading videos on my channel from 6th May, 2022 onwards.
For any further communication, send email to [email protected]

May God Bless Everyone

Please
. Subscribe to my channel
. Hit the bell icon
. Like and share my videos

#GAIN KNOWLEDGE, #GAIN POWER

Lec14.3: Creating Subnets of Fixed Lengths | Computer Networks
13:38
Lec14.3: Creating Subnets of Fixed Lengths | Computer Networks
Lec14.6:Forwarding Based on Destination Address | Computer Networks
16:52
Lec14.6:Forwarding Based on Destination Address | Computer Networks
Lec14.2 : Creating Subnets of not Fixed Lengths | Computer Networks
23:09
Lec14.2 : Creating Subnets of not Fixed Lengths | Computer Networks
Lec11.0 : Need for Classless Addressing | Computer Networks
10:20
Lec11.0 : Need for Classless Addressing | Computer Networks
Lec10.1: Classful Addressing-Summary | Computer Networks
10:38
Lec10.1: Classful Addressing-Summary | Computer Networks
Lec01.3: Network Topologies | Computer Networks
17:30
Lec01.3: Network Topologies | Computer Networks
Lec01.2: TCP/IP Network Model | Computer Networks
8:38
Lec01.2: TCP/IP Network Model | Computer Networks
Lec01.1 : OSI Network Model | Computer Networks
25:56
Lec01.1 : OSI Network Model | Computer Networks
Lec51: Heap Sort - Heapify Method
8:38
Lec51: Heap Sort - Heapify Method
Lec50: Master Theorem- Solving Recurrence Relations
12:18
Lec50: Master Theorem- Solving Recurrence Relations
Lec49: Topological Sort- DFS Method
7:18
Lec49: Topological Sort- DFS Method
Lec48: Topological Sort- DFS Method
7:52
Lec48: Topological Sort- DFS Method
Lec47: Topological Sort- Source Removal Method
15:27
Lec47: Topological Sort- Source Removal Method
Lec46: Quick Sort Time Complexity
11:41
Lec46: Quick Sort Time Complexity
Lec45: Quick Sort Algorithm - Divide and Conquer
15:28
Lec45: Quick Sort Algorithm - Divide and Conquer
Lec44: Trick to Remember Strassen's Matrix Multiplication Formulas
12:19
Lec44: Trick to Remember Strassen's Matrix Multiplication Formulas
Lec43: Strassen's Matrix Multiplication- Divide and Conquer
18:54
Lec43: Strassen's Matrix Multiplication- Divide and Conquer
Lec42 : String Matching - Brute Force Approach
15:20
Lec42 : String Matching - Brute Force Approach
Lec41 : Comparing Orders of Growth - Limit-based Approach
12:40
Lec41 : Comparing Orders of Growth - Limit-based Approach
Lec 40 : Traveling Salesman Problem | Branch and Bound
17:44
Lec 40 : Traveling Salesman Problem | Branch and Bound
Lec39: Subset Sum problem - Backtracking
14:17
Lec39: Subset Sum problem - Backtracking
Lec 38 : N-Queens Problem - Backtracking
24:16
Lec 38 : N-Queens Problem - Backtracking
Lec37 : Warshall's Algorithm - Dynamic Programming
23:03
Lec37 : Warshall's Algorithm - Dynamic Programming
Lec36 : 0/1 Knapsack Problem - Dynamic Programming
23:47
Lec36 : 0/1 Knapsack Problem - Dynamic Programming
Lec35 : Floyd's Algorithm- All-Pairs Shortest- Paths Problem
25:20
Lec35 : Floyd's Algorithm- All-Pairs Shortest- Paths Problem
Lec34: 2-3 Trees- Example 3
4:54
Lec34: 2-3 Trees- Example 3
Lec33 : 2-3 Trees- Example 2
8:37
Lec33 : 2-3 Trees- Example 2
Lec32 : 2- 3 Tree - Example1
10:11
Lec32 : 2- 3 Tree - Example1
Lec31 : AVL tree Construction - Example
8:38
Lec31 : AVL tree Construction - Example
Lec30 : AVL Tree Rotations - Transform and Conquer Approach
10:21
Lec30 : AVL Tree Rotations - Transform and Conquer Approach