- 85
- 121 860
EduSyl
เข้าร่วมเมื่อ 31 ส.ค. 2023
Welcome to Edusyl - Your Gateway to Free Knowledge and Empowerment!
🚀 About Us:
At Edusyl, we believe that knowledge is the key to personal and professional growth. Our mission is to provide access to high-quality information and tools that can help individuals excel in their pursuits, all at absolutely no cost.
🛠️ What We Offer:
We will share the information about the patent filing as well as the writing style of research paper. Edusyl is committed to breaking down barriers to education. All our content is available to you without any financial obligation. Together, we create a vibrant learning ecosystem. Our diverse content ensures there's something for everyone.
🌟 Subscribe Now:
Don't miss out on the opportunity to enhance your skills, broaden your horizons, and unlock new potentials. Hit the subscribe button, and let's embark on this journey of knowledge and empowerment together!
Thank you for being a part of the Edusyl community. Let's learn, grow, and thrive together! 🌱
🚀 About Us:
At Edusyl, we believe that knowledge is the key to personal and professional growth. Our mission is to provide access to high-quality information and tools that can help individuals excel in their pursuits, all at absolutely no cost.
🛠️ What We Offer:
We will share the information about the patent filing as well as the writing style of research paper. Edusyl is committed to breaking down barriers to education. All our content is available to you without any financial obligation. Together, we create a vibrant learning ecosystem. Our diverse content ensures there's something for everyone.
🌟 Subscribe Now:
Don't miss out on the opportunity to enhance your skills, broaden your horizons, and unlock new potentials. Hit the subscribe button, and let's embark on this journey of knowledge and empowerment together!
Thank you for being a part of the Edusyl community. Let's learn, grow, and thrive together! 🌱
Fastest Unpaid SCI/SCOPUS indexed Computer Science Journals/Computer Networks Journals in 4-7 months
Fastest Unpaid SCI/SCOPUS indexed Computer Science Journals 2024
Fastest Unpaid SCI/SCOPUS indexed Computer Networks Journals 2024
Fastest Unpaid SCI/SCOPUS indexed Wireless Communication Journals 2024
Fastest Unpaid SCI/SCOPUS indexed IoT Journals 2024
Fastest Unpaid SCI/SCOPUS indexed Computer Architecture and VLSI Journals 2024
Fastest Unpaid SCI/SCOPUS indexed Medical Electronics Journals 2024
Fastest Unpaid SCI/SCOPUS indexed Opto-Electronics Journals 2024
Fastest Unpaid SCI/SCOPUS indexed Quantum communications Journals 2024
Fastest Unpaid SCI/SCOPUS indexed Underwater communication Journals 2024
Fastest Unpaid SCI/SCOPUS indexed Peer-to-Peer Networking and Applications Journals 2024
Fastest Unpaid SCI/SCOPUS indexed Architectures and Protocols Journals 2024
Fastest Unpaid SCI/SCOPUS indexed Ad hoc and Sensor networks Journals 2024
Fastest Unpaid SCI/SCOPUS indexed Quality of Service Journals 2024
Fastest Unpaid SCI/SCOPUS indexed Next generation Journals 2024
Fast Springer Journal 2024.
Fast Taylor & Francis Journal 2024.
Fast Wiley Journal 2024.
ETRI Journal [Aim and Scope]:
ETRI Journal provides an international, multidisciplinary forum for the exchange of innovative ideas and technology in the fields of information, telecommunications, and electronics. It is published bimonthly in English. The main focus of the journal is to provide an open forum to exchange innovative ideas and technology in the fields of information, telecommunications, and electronics.
Key topics of interest include high-performance computing, multimedia technology, communication networks and services, wireless communications and mobile computing, material and component technology, as well as security.
With an international editorial committee and experts from around the world as reviewers, ETRI Journal publishes high-quality research papers on the latest and best developments from the global community.
International Journal of Communication Systems Journal [Aim and Scope]:
The International Journal of Communication Systems provides a forum for R&D, open to researchers from all types of institutions and organisations worldwide, aimed at the increasingly important area of communication technology. The Journal's emphasis is particularly on the issues impacting behaviour at the system, service and management levels. Published twelve times a year, it provides coverage of advances that have a significant potential to impact the immense technical and commercial opportunities in the communications sector. The International Journal of Communication Systems strives to select a balance of contributions that promotes technical innovation allied to practical relevance across the range of system types and issues.
The Journal addresses both public communication systems (Telecommunication, mobile, Internet, and Cable TV) and private systems (Intranets, enterprise networks, LANs, MANs, WANs). The following key areas and issues are regularly covered:
Transmission/Switching/Distribution technologies (ATM, SDH, TCP/IP, routers, DSL, cable modems, VoD, VoIP, WDM, etc.)
System control, network/service management
Network and Internet protocols and standards
Client-server, distributed and Web-based communication systems
Broadband and multimedia systems and applications, with a focus on increased service variety and interactivity
Trials of advanced systems and services; their implementation and evaluation
Novel concepts and improvements in technique; their theoretical basis and performance analysis using measurement/testing, modelling and simulation
Performance evaluation issues and methods.
The Journal has a prime remit to publish first-class original papers providing in-depth analysis of R&D work, and Special Issues are produced that comprise many papers focusing on a particular theme. A further crucial role for the Journal is to enable the reader to identify emerging principles and trends in the communications arena. Papers that will aid cross-fertilisation between disciplines are encouraged. Case studies that describe practical applications of communication technologies are welcomed.
Concurrency and Computation: Practice and Experience Journal [Aim and Scope]:
Concurrency and Computation: Practice and Experience (CCPE) publishes high-quality, original research papers, and authoritative research review papers, in the overlapping fields of:
Parallel and distributed computing;
High-performance computing;
Computational and data science;
Artificial intelligence and machine learning;
Big data applications, algorithms, and systems;
Network science;
Ontologies and semantics;
Security and privacy;
Cloud/edge/fog computing;
Green computing; and
Quantum computing.
#research #science #researcheverything #researchpaper #researchpapers #researchpaperwriting #journal #fastpublicationscopusindexedjournals #scopus #scijournal #sci #scopusjournals #scopusindexedjournals #scopusjournalfastpublication #scopuspublication
Fastest Unpaid SCI/SCOPUS indexed Computer Networks Journals 2024
Fastest Unpaid SCI/SCOPUS indexed Wireless Communication Journals 2024
Fastest Unpaid SCI/SCOPUS indexed IoT Journals 2024
Fastest Unpaid SCI/SCOPUS indexed Computer Architecture and VLSI Journals 2024
Fastest Unpaid SCI/SCOPUS indexed Medical Electronics Journals 2024
Fastest Unpaid SCI/SCOPUS indexed Opto-Electronics Journals 2024
Fastest Unpaid SCI/SCOPUS indexed Quantum communications Journals 2024
Fastest Unpaid SCI/SCOPUS indexed Underwater communication Journals 2024
Fastest Unpaid SCI/SCOPUS indexed Peer-to-Peer Networking and Applications Journals 2024
Fastest Unpaid SCI/SCOPUS indexed Architectures and Protocols Journals 2024
Fastest Unpaid SCI/SCOPUS indexed Ad hoc and Sensor networks Journals 2024
Fastest Unpaid SCI/SCOPUS indexed Quality of Service Journals 2024
Fastest Unpaid SCI/SCOPUS indexed Next generation Journals 2024
Fast Springer Journal 2024.
Fast Taylor & Francis Journal 2024.
Fast Wiley Journal 2024.
ETRI Journal [Aim and Scope]:
ETRI Journal provides an international, multidisciplinary forum for the exchange of innovative ideas and technology in the fields of information, telecommunications, and electronics. It is published bimonthly in English. The main focus of the journal is to provide an open forum to exchange innovative ideas and technology in the fields of information, telecommunications, and electronics.
Key topics of interest include high-performance computing, multimedia technology, communication networks and services, wireless communications and mobile computing, material and component technology, as well as security.
With an international editorial committee and experts from around the world as reviewers, ETRI Journal publishes high-quality research papers on the latest and best developments from the global community.
International Journal of Communication Systems Journal [Aim and Scope]:
The International Journal of Communication Systems provides a forum for R&D, open to researchers from all types of institutions and organisations worldwide, aimed at the increasingly important area of communication technology. The Journal's emphasis is particularly on the issues impacting behaviour at the system, service and management levels. Published twelve times a year, it provides coverage of advances that have a significant potential to impact the immense technical and commercial opportunities in the communications sector. The International Journal of Communication Systems strives to select a balance of contributions that promotes technical innovation allied to practical relevance across the range of system types and issues.
The Journal addresses both public communication systems (Telecommunication, mobile, Internet, and Cable TV) and private systems (Intranets, enterprise networks, LANs, MANs, WANs). The following key areas and issues are regularly covered:
Transmission/Switching/Distribution technologies (ATM, SDH, TCP/IP, routers, DSL, cable modems, VoD, VoIP, WDM, etc.)
System control, network/service management
Network and Internet protocols and standards
Client-server, distributed and Web-based communication systems
Broadband and multimedia systems and applications, with a focus on increased service variety and interactivity
Trials of advanced systems and services; their implementation and evaluation
Novel concepts and improvements in technique; their theoretical basis and performance analysis using measurement/testing, modelling and simulation
Performance evaluation issues and methods.
The Journal has a prime remit to publish first-class original papers providing in-depth analysis of R&D work, and Special Issues are produced that comprise many papers focusing on a particular theme. A further crucial role for the Journal is to enable the reader to identify emerging principles and trends in the communications arena. Papers that will aid cross-fertilisation between disciplines are encouraged. Case studies that describe practical applications of communication technologies are welcomed.
Concurrency and Computation: Practice and Experience Journal [Aim and Scope]:
Concurrency and Computation: Practice and Experience (CCPE) publishes high-quality, original research papers, and authoritative research review papers, in the overlapping fields of:
Parallel and distributed computing;
High-performance computing;
Computational and data science;
Artificial intelligence and machine learning;
Big data applications, algorithms, and systems;
Network science;
Ontologies and semantics;
Security and privacy;
Cloud/edge/fog computing;
Green computing; and
Quantum computing.
#research #science #researcheverything #researchpaper #researchpapers #researchpaperwriting #journal #fastpublicationscopusindexedjournals #scopus #scijournal #sci #scopusjournals #scopusindexedjournals #scopusjournalfastpublication #scopuspublication
มุมมอง: 252
วีดีโอ
Fastest Unpaid SCI/SCOPUS indexed Computer Science Journals/Computer Networks Journals in 3-4 months
มุมมอง 533 หลายเดือนก่อน
Fastest Unpaid SCI/SCOPUS indexed Computer Science Journals 2024 Fastest Unpaid SCI/SCOPUS indexed Computer Networks Journals 2024 Fastest Unpaid SCI/SCOPUS indexed Wireless Communication Journals 2024 Fastest Unpaid SCI/SCOPUS indexed IoT Journals 2024 Fastest Unpaid SCI/SCOPUS indexed Computer Architecture and VLSI Journals 2024 Fastest Unpaid SCI/SCOPUS indexed Medical Electronics Journals 2...
Algorithm Design | Problem Solving on Weighted Set Cover #algorithm #algorithmdesign
มุมมอง 3767 หลายเดือนก่อน
Lecture Note: drive.google.com/file/d/1LrJMFxv1udjMGVMHa8irZvoqTbMqOdlD/view?usp=drive_link Algorithm Design Problem Solving on Weighted Set Cover How to find Weighted Set Cover Unlock the power of algorithms! In this video, we dive deep into the Design and Analysis of Algorithms, providing a clear understanding of fundamental concepts, types of algorithms, and key techniques like Divide and Co...
Algorithm Design | Randomized Algorithm | Hashing: A Randomized Implementation of Dictionaries
มุมมอง 6787 หลายเดือนก่อน
Lecture Note: drive.google.com/file/d/1OlCinqABeBasPemNShPfmEG9RS7RbX7v/view?usp=drive_link 📚 Resources:Source - 1: www.cs.princeton.edu/~wayne/kleinberg-tardos/pdf/13RandomizedAlgorithms-2x2.pdfSource - 2: www.cs.princeton.edu/~wayne/kleinberg-tardos/pearson/13RandomizedAlgorithms-2x2.pdf Title: "Mastering Randomized Hashing: Unlock the Power of Efficient Data Structures!" Description: 🚀 Disco...
Algorithm Design | Randomized Algorithm | Randomized Divide and Conquer: Median-Finding & Quicksort
มุมมอง 7027 หลายเดือนก่อน
Lecture Note: drive.google.com/file/d/1bmws3SBu7-0g1wv-3MJ7lNv-Uat_M3yZ/view?usp=drive_link Title: "Randomized Algorithms Masterclass: Median-Finding and Quicksort with Divide and Conquer!" Description: 🚀 Unlock the power of Randomized Algorithms with our in-depth tutorial on Randomized Divide and Conquer techniques! Whether you're a coding enthusiast, a student exploring advanced algorithms, o...
Algorithm Design | Local Search | Vertex Cover Problem #algorithm #localsearch
มุมมอง 7467 หลายเดือนก่อน
Lecture Note: drive.google.com/file/d/1H7328JJLjKRmQkA0l9Pks4daeX_7scBH/view?usp=drive_link 📚 Resources: Source - 1: www.cs.princeton.edu/~wayne/kleinberg-tardos/pdf/11ApproximationAlgorithms-2x2.pdf Source - 2: www.cs.princeton.edu/courses/archive/spr05/cos423/lectures/11approx-alg.pdf Title: "Solving the Vertex Cover Problem with Local Search: Efficient Optimization Techniques!" Description: ...
Algorithm Design | Local Search | Introduction & the Landscape of an Optimization Problem #algorithm
มุมมอง 6997 หลายเดือนก่อน
Lecture Note: drive.google.com/file/d/1rRHoi8Ay_ZAl0ZWBAunJqZDDE3QM09A8/view?usp=drive_link 📚 Resources: Source - 1: www.cs.princeton.edu/~wayne/kleinberg-tardos/pdf/11ApproximationAlgorithms-2x2.pdf Source - 2: www.cs.princeton.edu/courses/archive/spr05/cos423/lectures/11approx-alg.pdf Title: "Introduction to Local Search Algorithms: Efficient Problem Solving Techniques!" Description: 🚀 Embark...
Algorithm Design | Local Search | Hopfield Neural Networks #algorithm #neuralnetworks #algo
มุมมอง 1.4K7 หลายเดือนก่อน
Lecture Note: drive.google.com/file/d/1VMSc8hrdZRZA8Mq_2QFZWRpr9JAdPTxM/view?usp=drive_link 📚 Resources: Source - 1: www.cs.princeton.edu/~wayne/kleinberg-tardos/pdf/11ApproximationAlgorithms-2x2.pdf Source - 2: www.cs.princeton.edu/courses/archive/spr05/cos423/lectures/11approx-alg.pdf Title: "Unlocking Hopfield Neural Networks: Local Search and Optimization Explained!" Description: 🚀 Dive int...
Algorithm Design | Approximation Algorithm | Weighted Vertex Cover using Pricing Method #algorithm
มุมมอง 1.1K8 หลายเดือนก่อน
Lecture Note: drive.google.com/file/d/1sbmZMBGZnHEoBooWaYtP6IWPtJVmxvMr/view?usp=drive_link 📚 Resources: Source - 1: www.cs.princeton.edu/~wayne/kleinberg-tardos/pdf/11ApproximationAlgorithms-2x2.pdf Source - 2: www.cs.princeton.edu/courses/archive/spr05/cos423/lectures/11approx-alg.pdf Title: "Approximation Algorithms for Weighted Vertex Cover: Mastering the Pricing Method!" Description: 🚀 Del...
Algorithm Design | Approximation Algorithm | Set Cover: A General Greedy Heuristic #algorithm
มุมมอง 1.2K8 หลายเดือนก่อน
Lecture Note: drive.google.com/file/d/1KCvF42ewiLsIyswgRchps4jem6ycKZMZ/view?usp=drive_link Title: "Mastering Set Cover with Approximation Algorithms: The Greedy Heuristic Explained!" Description: 🚀 Unlock the power of Approximation Algorithms with our comprehensive tutorial on the Set Cover Problem and its General Greedy Heuristic! Whether you're a coding enthusiast, a student delving into alg...
Algorithm Design | Approximation Algorithm | Center Selection Problem is 2-Approximation #algorithm
มุมมอง 1.6K8 หลายเดือนก่อน
Lecture Note: drive.google.com/file/d/1blzg83wpDOy08jJiijfcP2PjXXcf3ZAk/view?usp=drive_link 📚 Resources: Source - 1: www.cs.princeton.edu/courses/archive/spr05/cos423/lectures/11approx-alg.pdf Source - 2: www.cs.princeton.edu/~wayne/kleinberg-tardos/pdf/11ApproximationAlgorithms-2x2.pdf Title: "Approximation Algorithms for the Center Selection Problem: Efficient and Near-Optimal Solutions!" Des...
Algorithm Design | Approximation Algorithm | Load Balancing,List Scheduling,Longest Processing Time
มุมมอง 1.8K8 หลายเดือนก่อน
Lecture Note: drive.google.com/file/d/1m812Ep3gkwvYHiMkWwAPcVE9YjY6Nmff/view?usp=drive_link 📚 Resources: LINK: www.cs.princeton.edu/courses/archive/spr05/cos423/lectures/11approx-alg.pdf Title: "Approximation Algorithms for Load Balancing: Achieving Near-Optimal Solutions!" Description: 🚀 Dive into the world of Approximation Algorithms with our comprehensive tutorial on Load Balancing! Whether ...
Algorithm Design | Approximation Algorithm | Traveling Salesman Problem with Triangle Inequality
มุมมอง 1.2K8 หลายเดือนก่อน
Lecture Note: drive.google.com/file/d/1LsTEZ3q8RH2_p1F9X3lcYgHujgArKRQO/view?usp=drive_link Title: "Mastering Approximation Algorithms: Solving the Traveling Salesman Problem with Triangle Inequality!" Description: 🌟 Welcome to our channel, where we embark on an enlightening exploration of approximation algorithms! In this tutorial, we delve into the intricate world of approximation algorithms ...
Algorithm Design | Approximation Algorithm | Vertex Cover Problem #algorithm #approximation
มุมมอง 1.7K8 หลายเดือนก่อน
Lecture Note: drive.google.com/file/d/1HFeb4DbEBl5ADMyPYKq6iD0E4eGdxTuN/view?usp=drive_link Title: "Exploring Approximation Algorithms: Tackling the Vertex Cover Problem!" Description: 🌟 Welcome to our channel, where we embark on an enlightening exploration of approximation algorithms! In this tutorial, we delve into the fascinating world of approximation algorithms through the lens of the Vert...
Algorithm Design | Approximation Algorithm | Introduction #algorithm #approximation #algorithmdesign
มุมมอง 1.4K8 หลายเดือนก่อน
Lecture Note: drive.google.com/file/d/1CFHPFAGUM9G6lh1q6kRhaqsNMnxgBtly/view?usp=drive_link Title: "Introduction to Approximation Algorithms: Bridging Theory and Practice in Optimization!" Description: 🌟 Welcome to our channel, where we embark on an enlightening exploration of approximation algorithms! In this tutorial, we delve into the fascinating world of approximation algorithms, offering i...
Algorithm Design | PSPACE | Quantified Satisfiability #algorithm #algorithms #algorithmdesign #npc
มุมมอง 1.4K9 หลายเดือนก่อน
Algorithm Design | PSPACE | Quantified Satisfiability #algorithm #algorithms #algorithmdesign #npc
Algorithm Design | Reductions | Hard Reductions | Satisfiability Problem #algorithm #algorithmdesign
มุมมอง 1.1K9 หลายเดือนก่อน
Algorithm Design | Reductions | Hard Reductions | Satisfiability Problem #algorithm #algorithmdesign
Algorithm Design | Reductions| Hard Reductions| Vertex Cover reducible to Independent Set #algorithm
มุมมอง 9459 หลายเดือนก่อน
Algorithm Design | Reductions| Hard Reductions| Vertex Cover reducible to Independent Set #algorithm
Algorithm Design | Reductions | Hard Reductions | Independent Set reducible to Clique #algorithm
มุมมอง 8149 หลายเดือนก่อน
Algorithm Design | Reductions | Hard Reductions | Independent Set reducible to Clique #algorithm
Algorithm Design | Reductions | Hard Reductions | Hamiltonian Cycle reducible to TSP #algorithm
มุมมอง 1.1K9 หลายเดือนก่อน
Algorithm Design | Reductions | Hard Reductions | Hamiltonian Cycle reducible to TSP #algorithm
Algorithm Design | Reductions | Easy Reductions | Sort reducible to Convex Hull #algorithm
มุมมอง 9279 หลายเดือนก่อน
Algorithm Design | Reductions | Easy Reductions | Sort reducible to Convex Hull #algorithm
Algorithm Design | Reductions | Easy Reductions| Closest pair of points reducible to Sort #algorithm
มุมมอง 8999 หลายเดือนก่อน
Algorithm Design | Reductions | Easy Reductions| Closest pair of points reducible to Sort #algorithm
Algorithm Design | Reductions | Easy Reductions | LCM reducible to GCD #algorithm #algorithmdesign
มุมมอง 7979 หลายเดือนก่อน
Algorithm Design | Reductions | Easy Reductions | LCM reducible to GCD #algorithm #algorithmdesign
Algorithm Design | Reduction in Complexity Theory | Introduction #algorithm#algorithmdesign
มุมมอง 1.3K9 หลายเดือนก่อน
Algorithm Design | Reduction in Complexity Theory | Introduction #algorithm#algorithmdesign
Algorithm Design | Complexity Theory | P, NP, CO-NP, NP COMPLETE, NP HARD #algorithm#algorithmdesign
มุมมอง 2.8K9 หลายเดือนก่อน
Algorithm Design | Complexity Theory | P, NP, CO-NP, NP COMPLETE, NP HARD #algorithm#algorithmdesign
Algorithm Design | Network Flow | MINIMUM CUT | MIN CUT = MAX FLOW #algorithm #algorithmdesign
มุมมอง 2.7K10 หลายเดือนก่อน
Algorithm Design | Network Flow | MINIMUM CUT | MIN CUT = MAX FLOW #algorithm #algorithmdesign
Algorithm Design | Network Flow | Ford-Fulkerson Algorithm | MAXIMAL FLOW PROBLEM | MAX FLOW PROBLEM
มุมมอง 2.7K10 หลายเดือนก่อน
Algorithm Design | Network Flow | Ford-Fulkerson Algorithm | MAXIMAL FLOW PROBLEM | MAX FLOW PROBLEM
Algorithm Design | Dynamic Programming | 0/1 Knapsack Problem #algorithm #algorithmdesign
มุมมอง 1.5Kปีที่แล้ว
Algorithm Design | Dynamic Programming | 0/1 Knapsack Problem #algorithm #algorithmdesign
Algorithm Design | Dynamic Programming | Bellman Ford Algorithm #algorithm #algorithmdesign
มุมมอง 1Kปีที่แล้ว
Algorithm Design | Dynamic Programming | Bellman Ford Algorithm #algorithm #algorithmdesign
Algorithm Design | Divide and Conquer Approach | Karatsuba Algorithm #algorithm #algorithmdesign
มุมมอง 2.5Kปีที่แล้ว
Algorithm Design | Divide and Conquer Approach | Karatsuba Algorithm #algorithm #algorithmdesign
Sir plz teach us Algorithm design 2 for 4th sem
As always amazing teaching by amazing teacher !! sir today at iter, I didnt understood a bit but after coming hostel from college its crystal clear...
can i get your contact ?
Sir please share your number
Well explained sir
love from bh10 iter
Sir your contact information please?
Sir AD exam is just around the corner, you are a lifesaver
Thank you for your nice words. Be happy and stay blessed always.🙂
Hi sir i need design registration examination reply format can u plz provide me
Hello Vighneshwar, you may find the format in the description section. Reply to FER Template: docs.google.com/document/d/1n3cPDBVZBXBiIYiPzGtAOlwZYH_Qcj1F/edit?usp=drive_link&ouid=117604321911127302580&rtpof=true&sd=true
love from iter sir😇🙏
Thank you sir
You are most welcome. Take Care.😊
Thankyou sir very much for concept explanation understood it very well. Sir By the ways you teach which section in ITER,SOA?
Is he from iter ,how do u know?
I have also heard it from many of my batchmates that he was a ITER faculty but currently he is in ITER or not I don't know
I was teaching AD to 2024 and 2025 passout batch. I am glad you found it helpful. Stay blessed always.🙂
@@ayushbhanja7640 Take care and stay blessed always.🙂
@@Hexa-v5p Take care and stay blessed always.🙂
8:13 Sir wo example mei for loop ke andar Wale print statement ko n kyun nahi liya gaya
Jyotiprakash, I have considered the print statement while mentioning the time complexity as "O(n+1)". Each statement will run for O(1). If the statement is within the loop, then it will behave accordingly. Hope your doubt is resolved.😊
Sir, the max lateness which we found. How will we reduce it?. We just learnt how to find it.
🛌
Some so called expert professors in Foreign countries are teaching this for 20 lakh rupees and still we are not able to learn anything!!, and this Indian guy is explaining very well for free , hats off brother!!
Sir, I think log²n=logn×logn not log(logn). Please correct me if I am wrong.
Yes, you are right. But still mathematicians are saying log²n is not equals to logn×logn. Recently, I found from the book that log²n = logn × logn. Thank you for detecting it.
Sir you take a extra (1/2 )^1 when you take the common n in Ci at15:48
Sir, plz the PPT slides of this lecture !!
Share !!
Debanjan, I have uploaded the PDF.
Sir please comeback to ITER. All AD teachers are bad here.🥲
Sir is this playlist follow algorith design by pearson?
Yes. The playlist is based on 3 different books. I have already mentioned in the description section.
I think you should also share the code...It will be more helpful
Actually I applied for Copyright. After approval I will post in the description section.
this Algorithm some times not terminated letus suppose in Augmented graph have always some Augmented path from source to sink then this Algorithm does not terminated plz if this is not ended then give me Another Algorithm
what about solving problems?
sir what if we have T(n) = T(n-1)+T(n-2)+c and upon solving for k times i have T(n) = (k+1)T(n-(k+1)) + (k)T(n-(k+2))+2^k(c) and if the base condition is T(0) = 0 then which of the two function i will take as zero?? will i take T(n-(k+1)) this as 0 or T(n-(k+2)) this ??
Assume, T(n) = 2 × T(n-1) + c Then everything will be easy. Because, T(n-2) will be converted to the maximum worst time T(n-1) as per recursion tree method.
Sir your videos are really relatable to real world codes and i can now actuallty relate How the Rec. Relation for Time complexity works. Thank you sir....❤❤❤❤💕💕
Stay blessed always.🙂
Sir can we file both design and utility for the same product
Yes, definitely.🙂
Sir randomly built binary search tree equation explanation please upload sir comming Tuesday i have to take seminar in class sir
Sorry, could not understood the question properly. If possible could you please clarify again. 🙂
sir how do we know we have to multiply both to logn in divisible function problem
Ankit, to know the unknown term we need to take the help of "log". For more clarity, you may check the problem solving videos. 🙂
how to get design representation sheets sir need to create manual in work or i can get from patent website ?
You may follow the video, there I informed you how to make the representation sheet. If possible I will keep the demo of representation sheet in the description of this video.
Form1 is enough for granting
Form - 1 is mandatory for submission. We may expect a reply after the exam.
14:03 Sopln("Sum") as no variable is present there named "factorial".
Koushik, you are right. It should be "system.out.println(sum);".🙂
17:00 definición
what to filled in previously redg. classes and UNder no, and number of class ???? please replay
During submission, if you are not getting any match with the classes, you may select miscellaneous class.
Does we have to submit only blue prints?
Yes.
Thank you sir for the information and i need more informstion can you share your number or contact mailid than i can ask you some question Thank you sir
You may mail me your queries. My mail ID is "ayeschinmay@gmail.com".
How we can download FORM 1 filled online? FORM 1 provided online is in pdf and not clear
You may download the FORM - 1 and take the printout. Then fill up all the required details through pen and submit the scan copy of the Form - 1.
Thanks
❤
Sir Please upload Hashing🙏
It's already uploaded.🙂
why are we using the local search if it is not giving the optimal solution?
There are two types of local search algorithms are available (i.e., Greedy based local search algorithm and Dynamic approach based local search algorithm). Most of the times we are using the Greedy based local search algorithm, which may or may not provides optimal solution as per the Greedy property.
Sir, please upload hashing too.....🙏🙏🙏🙏🙏🙏
It's already uploaded.🙂
Thanks sir @ayeschinmay sir
Welcome Nishant. Take Care.🙂
Thank you sir
Welcome Astha. Take Care.🙂
Some unwanted noises are there you should remove it.And it is very understanding😊😊
Noted.🙂👍
sir add videos on Randomization
Sure.🙂
I gave up on AD , bhagwan bachaye ab😭
Yes. 😀 We can't succeed in our lives without the blessings of GOD.🙂
Sir can u please upload a video on randomised algorithms
Sure. I will try to upload the videos asap.
sir ,if you solve another question other then book's example,it will be very helpfull for us to understand(like assaignment question).Please
Sure. You will expect such videos in "Problem Solving in Algorithm Design" playlist after completion of detailed videos.
please upload a video on local search vertex cover
Sure. 🙂
Sabyasachi, the video is available now. LINK: th-cam.com/video/_sDnmwXgQbc/w-d-xo.html