Very Imp Qus. on Algorithm(Graph & Hashing) | Must Watch | NTA NET June 2021

[@DeepakKumar-pm7ie]

Shandar jabardast jindabad 😃😃😃🇮🇳🇮🇳🇮🇳

[@goutamnagpal3912]

Thank you sir, please upload more videos like these.

[@hussainasghar9057]

sir please upload a video on "how to find minimum no of tables using partial participation, total participation, strong entity, weak entity etc of ER-Model" in DBMS.

[@yamisharma7226]

Vry nice Sir

[@siddiquiadnan92]

Sir dsssb ka ek alag playlist bna dijiye

[@siddiquiadnan92]

👌👌👌

[@PratimaYadav23]

Thanku sir 🙏

[@payalsagar1808]

thankyou🙌

[@shivatyagi2047]

thank you sir

[@shivaclasses1683]

Ty sir

[@pritamsarkar3371]

I think explanation of statement no 2 is wrong, cost of spanning tree depends on no of vertices v-1

[@hussainasghar9057]

no ...cost of spanning not depend on no of vertices... v-1 is no of edges not vertices.

[@varshasingh2748]

Thank you sir

[@simasingh5587]

thank u sir