- 293
- 617 786
Engineering Wing
India
Приєднався 8 жов 2012
"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 engineeringwing22@gmail.com
May God Bless Everyone
Please
. Subscribe to my channel
. Hit the bell icon
. Like and share my videos
#GAIN KNOWLEDGE, #GAIN POWER
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 engineeringwing22@gmail.com
May God Bless Everyone
Please
. Subscribe to my channel
. Hit the bell icon
. Like and share my videos
#GAIN KNOWLEDGE, #GAIN POWER
Відео
Lec50: Master Theorem- Solving Recurrence Relations
Переглядів 5332 місяці тому
#mastertheorem #recurrencerelation
Lec47: Topological Sort- Source Removal Method
Переглядів 5722 місяці тому
#sourceremoval #topologicalsort #ada
Lec45: Quick Sort Algorithm - Divide and Conquer
Переглядів 7012 місяці тому
#quicksort #ada #algorithms
Lec44: Trick to Remember Strassen's Matrix Multiplication Formulas
Переглядів 1,5 тис.2 місяці тому
#strassen'smatrixmultiplication #algorithms #Ada #daa
Lec43: Strassen's Matrix Multiplication- Divide and Conquer
Переглядів 8202 місяці тому
#strassensmatrixmultiplication #divideandconquer div
Lec42 : String Matching - Brute Force Approach
Переглядів 1,8 тис.2 місяці тому
#stringmatching #bruteforce #algorithms #Ada
Lec41 : Comparing Orders of Growth - Limit-based Approach
Переглядів 4122 місяці тому
#comparingordersofgrowth #limitbasedapproach #asymptoticnotations #ada ada
Lec 40 : Traveling Salesman Problem | Branch and Bound
Переглядів 8252 місяці тому
#TSP #algorithms #timecomplexity
Lec 38 : N-Queens Problem - Backtracking
Переглядів 8732 місяці тому
at 10.28, kindly note this correction Q3 = 3 has to be the end of that branch..you need not explore those four options for Q4 which I have shown in the state space tree.
Lec37 : Warshall's Algorithm - Dynamic Programming
Переглядів 5482 місяці тому
# Warshallalgorithm #ada #algorithms
Lec36 : 0/1 Knapsack Problem - Dynamic Programming
Переглядів 1,1 тис.3 місяці тому
Lec36 : 0/1 Knapsack Problem - Dynamic Programming
Lec35 : Floyd's Algorithm- All-Pairs Shortest- Paths Problem
Переглядів 8113 місяці тому
Lec35 : Floyd's Algorithm- All-Pairs Shortest- Paths Problem
Lec31 : AVL tree Construction - Example
Переглядів 8043 місяці тому
Lec31 : AVL tree Construction - Example
Lec30 : AVL Tree Rotations - Transform and Conquer Approach
Переглядів 7433 місяці тому
Lec30 : AVL Tree Rotations - Transform and Conquer Approach
Lec29 : Transform and Conquer and AVL trees - Introduction
Переглядів 7003 місяці тому
Lec29 : Transform and Conquer and AVL trees - Introduction
Lec28 : Dijkstra's Algorithm | Single source shortest Path
Переглядів 1,3 тис.3 місяці тому
Lec28 : Dijkstra's Algorithm | Single source shortest Path
Lec27: Kruskal Algorithm - Greedy Approach
Переглядів 8923 місяці тому
Lec27: Kruskal Algorithm - Greedy Approach
Lec26: Prim's Algorithm- Greedy Approach
Переглядів 1,1 тис.3 місяці тому
Lec26: Prim's Algorithm- Greedy Approach
Lec25: Minimum Cost Spanning Tree (Part-2)
Переглядів 5053 місяці тому
Lec25: Minimum Cost Spanning Tree (Part-2)
Lec24: Greedy Approach and Minimum Spanning Tree - Introduction
Переглядів 6463 місяці тому
Lec24: Greedy Approach and Minimum Spanning Tree - Introduction
Lec23: Comparison Count Sort Algorithm and Time Complexity
Переглядів 4,3 тис.3 місяці тому
Lec23: Comparison Count Sort Algorithm and Time Complexity
Lec22: Trace the Pseudocode- Horspool Algorithm
Переглядів 2 тис.3 місяці тому
Lec22: Trace the Pseudocode- Horspool Algorithm
Abbott Estates
So so helpful. Really glad I came across your videos before my exam.
Wolf Pass
Haley Gateway
Thank You So Much Mam Very clear
Thank you for your knowledge mam it was a really helpful video🙇
Excellent video! You explain the concepts in a very simply and understandable way. Thank you very much :)
Applicant name wife ka daal diya kya hoga
But little fast
Excellent class
Is this series completed?
Is this series completed?
👍
6207 Howell Drives
Wilkinson Lights
Reilly Hollow
Best explanation❤❤
Sonny Light
Thank you so much! Accounting from the sender's perspective using LastByteSent - LastByteAcked <= rwnd, and from receiver perspective would be rwnd = RcvBuffer - (LastByteRcvd - LastByteRd) is clear with this visualization
Thank you mam
Very useful video ❣️
Most helpful thank you 😊
CORRECTION: The Transmission Control Protocol (TCP) header can be between 20 and 60 bytes in size, depending on whether optional fields are included, NOT 20-40.
Thankyou mam, i understand clearly ❤
Share pl with your friends my channel information
Very well explained mam 😊
Share pl with your friends my channel information
Thank you so much..
So good teaching
Share pl with your friends my channel information
Thank u
Thank you so much
❤
After spending whole day finally found your lectures playlist and cleared my concepts, and now I will sleep peacefully. Hope in coming days this channel will rock. ❤
Nice explanation Ma'am ❤️❤️🙏
We're lucky to have a professor like you. Thank you for being strict mam.
Mam ur lec is excellent...but I need ur help to clear my doubt....at msg 3, we r informing r1,r3,r4 that they can communicate with N10,N11,N12 of the autonomous sys 3....but u wrote n1,n2,n3 ........and lly at msg 4 we are telling the router9,8 that they can communicate with networks of as1 ...but u wrote n10,n11,n12....this got me confused ...plz help me clear my doubt.....rest thanku ❤helped me alot
Thank You very much !!! 💛
This was full copied in our class seminar😅😅
Plz explain bottom up and bottom down approach method diffence
Madam you not explain knapsack algorithm using memory fuction bottom up
I have followed syllabus of one particular university, if I receive request for any other topic, I shall post in near future.
Tq mam ❤
mam suppose if there is process no 5 which is of 310 kb then in the first fit can we accomodate this proceess in the process in the remaining space the accomodated by process p2
In fixed size partitioning, only one process can be placed in a partition
@@engineeringwing7469 thank you mam
Mam it's so super and very understandable
Fantastic video on electronic mail Mam ! ✉ The way you explained the workings of email protocols like SMTP, IMAP, and POP3 was very clear and informative. The historical context and the breakdown of how emails are sent and received really helped me understand the entire process. Thanks for making such a complex topic so accessible. Looking forward to more great content! 👍
You are awesome ma'am 💓
Thank you so much ma'am! 😊
In the formula for R and S, note the following correction pl R is A11 S is A22 By mistake it is written as A22 for R and A11 for S.
why you deleted node 3...?
a root node with minimum value
Pls note the correction , the correct formula for V is V = (B21+B22)(A12- A22)
Maam in the formula for V, the formula is (B21+B22)(A12-A22). You have written B22 instead of A22
Yes, u r right..I will post the correction in the comment box..tnx for informing.
At 0.44, Pls note the following correction. Regional ISP address is 192.168.10.0 / 24 Totally it will be 256 addresses and each subnet mask will have 64 addresses
then subnet bits become 0 right??? so no subnets in the network
In example 2 there is no edge from A to D In out degree and indegree example, you made a mistake and told that Indegree is number of edges coming out of a vertex
Indegree is total no.of incoming edges to a vertex and outdegree is total number of outgoing edges from a vertex..It is a mistake in speech..shall write this correction in the description box..