mera aaj endsem exam tha mene kal raat tak eek video dekhi jisme coding plus dsa ki interview tak kii tarayari kara rahe thai jo irrelevant tha endtime endsem ki preperation ke liye mene raat ko 10 baje se ess video ko start kari 4 ghante shoya oor sube 5 baje uthkar 2x par ye video dekh daali exam centre tak bhi 10 baje exam tha 9:50 tak video oor rough notes revised bhai yakiin mano mene pura paper kardiya theoretical part or coding ke questions or mein thai sare theoretical basic coding tree sab kar liya ooor mene jo esse pehle 24 hrs ki video dekhi thi ussse sirf time complexity eek question kardiya ...... thankyou sir aapka itna high quality content ke liye
Ignore(just using comment section as bookmark) Post order In order to tree: 5:13:10. BST: 5:16:00 BST Deletion: 5:20:00 Heap deletion: 6:07:00 BFS traversal : 6:38:00
17:11 premertive non premitive 21:20 homogeneous vs hetro 2:34:00 prefix postfix 2:53:00 recursion 3:00:45 recursion vs itteriation 3:08:00 recursion problems tree 3:17:00 fibnocci no. 4:13:00 que delt 4:54:00 binary tree 5:04:00 traversal tree 5:15:00 binary search tree 5:54:00 complete binary tree
Thank You So Much Sir, I have watched all the courses of CS/IT from your recorded lectures. This One shot video gives total overview of all topics, I would suggest every CS/IT student to watch this series for overall revision.
Your One Shot Semester series is hands down my secret weapon for acing exams! 🌟 The depth and clarity you bring in such a short time is mind-blowing. As my software engineering exams approach, I'm counting on your magic. 🖥💡 Could you please drop a One Shot on software engineering? It's not just a request; it's a desperate student's plea for salvation! 😅 Your videos are a game-changer, and a software engineering edition would be a total knockout. Keep rocking the educational world! 🚀📚"
Thanks a lot Shrey for your valuable feedback, happy to know that you are liking the content & understanding the concepts easily. Sure, will try to work on your suggestion, do like & subscribe, keep learning & stay tuned for more upcoming contents👍😊
Wow...just fells proud after completing DSA give some positiveness..average students is now broken his line and just keep stepping with your videos ..thanks a lot sir ....I know ye sb likhte h but mai cmnt nhi krta but after completing this my soul my heart and my brain ...forced me to type this 😊🙏
Nice, thank you so much for your feedback @Shubham, this motivates to bring more valuable content for you all. Please like, subscribe, and share the video, and stay connected for more amazing content👍
I want that you complete other subjects like AI, Statistics, DAA, so that this channel grows like a boom, Keep uploading like this, sir, It's our good luck to witness such a next level teacher teaching here, the concepts foundation is held so tight that we feel fully confidence because of you,
Thank you so much @Gaurav for your kind words😍 Sure we'll definitely try to upload more useful content for our dear learners, stay connected & keep learning👍😊
mera aaj endsem exam tha mene kal raat tak eek video dekhi jisme coding plus dsa ki interview tak kii tarayari kara rahe thai jo irrelevant tha endtime endsem ki preperation ke liye mene raat ko 10 baje se ess video ko start kari 4 ghante shoya oor sube 5 baje uthkar 2x par ye video dekh daali exam centre tak bhi 10 baje exam tha 9:50 tak video oor rough notes revised bhai yakiin mano mene pura paper kardiya theoretical part or coding ke questions or mein thai sare theoretical basic coding tree sab kar liya ooor mene jo esse pehle 24 hrs ki video dekhi thi ussse sirf time complexity eek question kardiya ...... thankyou sir aapka itna high quality content ke liye
Sir aapne 72 se start krne ko kha indexing but ye to hmesa 0 se suru hoga means array ka indexing jab tkk hum programming language bnate time ya nai programming language bnani pdegi ??
Sir a very humble request from my side on the behalf of every student, please do a one shot on OOPM (Object oriented programming), as semester exams are very close.
Thank you so much sir for uploading this ,, eagerly waiting for this video.......please next upload DAA in one shot....Please sir...🙏respect and love for whole KG team....🙏🙏🙏❤❤❤
Hello sir I am from Nabadwip (BIRTH PLACE OF SRI CHAITANYA MAHAPRAVU) and state is west Bengal . Previous few month I watch your video and also fan of your teaching style . Thanks sir ❤❤
Your One Shot Semester series has been exceptional for my exam preparation, sir. The clarity and speed with which you explain concepts are truly remarkable. With my AI exams approaching, I would be immensely grateful if you could consider creating a One Shot on AI for semester. It would be of great help. Thank you.
Glad you liked it, @soumadipmajila7962. Thank you, keep learning. AI one shot is already available on our channel, here is the video link: ruclips.net/video/yiXAmkimZRQ/видео.html
Sir, You are LORD!!! You Really saved me I got back to back Compartment in DS due to less marks in Internals, from 3 years. Finally I can say I will score 80+ this time in theory. THANKS ALOT SARKAR❤
Thank You so much sir!! University based + notes + complete thing!! Incredible Sir!! Please keep making more videos for our university exams :)) Thank you again
Sir apka bhut bhut dnybad mene apni 6 hours ki discrete structure ki video deki thi usme mere sare topic cover ho gye the esliye mera paper bhut accha gya sirf aapki bjh he ❤❤❤
Sir, your one-shot videos are very helpful. I am a 2nd year student pursuing CSE in KIIT. I watched your playlist of 'TOC | AUTOMATA THEORY '. The explanations of those videos are awesome but this playlist was created based on the GATE syllabus. Please bring a new one-shot video for this 'Theory of Computation' subject according to our college syllabus. It will also be very helpful for our semester exam.
Here is the syllabus of our college- UNIT I Finite Automata: Alphabets, Strings and Languages, Automata and Grammars, Deterministic Finite Automata (DFA), Formal Definition, Simplified notation: State transition graph, Transition table. Language of DFA, Non-deterministic Finite Automata (NFA), NFA with epsilon transition, Language of NFA, Equivalence of NFA and DFA, Minimization of Finite Automata, Distinguishing one string from other, Myhill Nerode Theorem. UNIT II Regular Expression (RE): Definition, Operators of regular expression and their precedence, Algebraic laws for Regular expressions, Kleen’s Theorem, Regular expression to FA, DFA to Regular expression, Arden Theorem, Non Regular Languages, Pumping Lemma for regular Languages. Application of Pumping Lemma, Closure properties of Regular Languages, Decision properties of Regular Languages, FA with output: Moore and Mealy machine, Equivalence of Moore and Mealy Machine, Applications and Limitation of FA. UNIT III Context Free Grammar (CFG) and Context Free Languages: Definition, Examples, Derivation, Derivation trees, Ambiguity in Grammar, Inherent ambiguity, Ambiguous to Unambiguous CFG, Useless symbols, Simplification of CFGs, Normal forms for CFGs: CNF and GNF, Closure properties of CFLs, Decision Properties of CFLs: Emptiness, Finiteness and Membership, Pumping lemma for CFLs. UNIT IV Push Down Automata (PDA): Description and definition, Instantaneous Description, Language of PDA, Acceptance by Final state, Acceptance by empty stack, Deterministic PDA, Equivalence of acceptance by empty stack and final state, Conversion of CFG to PDA and PDA to CFG.UNIT V UNIT V Turing Machines (TM) and Undecidability: Basic model, definition and representation, Instantaneous Description, Language acceptance by TM, Variants of Turing Machine, TM as Computer of Integer functions, Universal TM, Church’s Thesis, Recursive and recursively enumerable languages, Halting problem, Introduction to Undecidability, Undecidable problems about TMs, Post correspondence problem (PCP), Modified PCP and undecidable nature of post correspondence problem, Introduction to recursive function theory.
Thank you so much Sourendu for your valuable feedback😍Sure, will consider your suggestion, do like, subscribe & share the video & stay connected for more amazing upcoming contents👍😊
Thank you, @@KNOWLEDGEGATE_kg sir for your response. Please make the video on Theory of Computation as soon as possible as in most colleges, semester exams will be started within a few days.
hlo sir , your teaching style is awesome the concepts are crystal clear now , theit is one request sir can you please discuss the previous year questions of data structure cs303 of rgpv it will help a lot
Such a very useful video.........I like it soo much and it's really very helpful for those students who want to prepare the whole subject in one place .............😊 Thanku so much sir 🙏🏻
Sir ,please upload Software Engineering next ! My exams are approaching ,Computer Networking one shot helped me to connect every dots of all the concepts i have studied earlier . Same i want SE too ! Thank you Sir :)
Dear sir take a one shot oops with c++ I have bpsc tre exam I have adda 24*7 classes but I didn't watch kyuki usse achha to sir me pdha lunga apka pura class dekhta hu then self study
Something is wrong in the program at 1:30:00 because we are already assigning data in createNode function so we won't reassign it in the insertAfter function again. Also In insertAfter method there's no variable data so it doesn't make sense to reassign it.
sir, you are the most amazing teacher, I had gone through various channels but your one is the best.... having a teacher like you was such a greatfull thing ... thank you sir very much for this video
3:16:53 sir iss wale question me I guess add nhi karna ...sir Output 12314125 ye hoga ig pls clarify....Btw thank you sir for such great lecture series ❤
For complete content on Computer Science, check out the course link: tiny.cc/allcomputersciencecourse
Sir PDF Notes ma Linked List topic missing ha, Sir Please Re-Upload
@@sayandeepsoren361 it's after stack & queue
mera aaj endsem exam tha mene kal raat tak eek video dekhi jisme coding plus dsa ki interview tak kii tarayari kara rahe thai jo irrelevant tha endtime endsem ki preperation ke liye mene raat ko 10 baje se ess video ko start kari 4 ghante shoya oor sube 5 baje uthkar 2x par ye video dekh daali exam centre tak bhi 10 baje exam tha 9:50 tak video oor rough notes revised bhai yakiin mano mene pura paper kardiya theoretical part or coding ke questions or mein thai sare theoretical basic coding tree sab kar liya ooor mene jo esse pehle 24 hrs ki video dekhi thi ussse sirf time complexity eek question kardiya ...... thankyou sir aapka itna high quality content ke liye
Is this data Structure c ++
Hey notes kaise download kare ??@@sayandeepsoren361
🎯 Key Takeaways for quick navigation:
04:14 *Efficient Programming Essential*
04:54 *Solid Understanding Needed*
05:22 *Efficient Coding Crucial*
06:16 *Proper Data Arrangement*
06:41 *Organization is Key*
07:47 *Importance of Arrangement*
08:16 *Proper Item Placement*
11:42 *Modify Data Structures*
13:29 *Define new structures*
13:59 *Choose right algorithm*
14:13 *Data structure depends*
14:26 *Suitable data structure*
16:17 *Modularize structures*
16:32 *Basic structures available*
18:04 *Primitive Data Structures*
18:19 *Predefined Operations*
18:32 *Integers Operations*
18:45 *Inefficient Structures*
19:16 *Linear vs. Non-Linear*
19:44 *Non-Linear Data Structure*
20:24 *Implementation Complexity*
20:39 *Traversal Orders*
21:21 *Homogeneous and Heterogeneous*
23:09 *Quantity matters.*
24:57 *Accessing elements.*
25:11 *Array declaration basics.*
27:30 *Array Indexing Basics*
28:14 *Efficient Storage Use*
28:28 *Fast Access Methods*
29:22 *Easy to Modify*
29:37 *Specify Space Needs*
29:51 *Understand Space Allocation*
30:18 *Manage Dynamic Space*
33:05 *Serious Computer Time*
33:34 *Priority in Life*
37:14 *Upper bound*
37:27 *Formula explained*
37:41 *Perfect answer*
37:53 *Array size calculation*
38:20 *Multi-dimensional array size*
38:46 *Base address calculation*
39:42 *Random indexing*
40:11 *Base address calculation*
43:40 *1D vs 2D understanding*
48:22 *Understandable for psychology*
58:31 *Indexing Comprehension*
59:10 *Dimension Length Logic*
01:01:31 *Sparse Matrix Concept*
01:02:52 *Smart Sparse Matrix Storage*
01:04:40 *Sparse Matrix Handling*
01:08:25 *Runtime data manipulation.*
01:09:06 *Understanding linked lists.*
01:11:36 *Link and pointer part explanation.*
01:11:50 *Disadvantages of linked lists.*
01:12:18 *Simple node structure.*
01:12:57 *Dynamic size and memory efficient.*
01:13:37 *Easy insert/delete.*
01:14:47 *Consider space & time.*
01:20:00 *Creating nodes.*
01:21:49 *Basic operations.*
01:25:26 *Iterative vs. Recursive*
01:29:31 *Insert Node at Start*
01:36:55 *Implementing recursion.*
01:38:45 *Using Temp Variables*
01:39:54 *Iterative Process*
01:40:35 *Try Different Cases*
01:41:44 *Linking Nodes*
01:42:14 *Pointer Movement*
01:42:54 *Order of Operations*
01:43:17 *Head and Tail Movement*
01:44:11 *List traversal*
01:44:37 *Header list simplification*
01:44:52 *Header node usage*
01:45:06 *Special nodes in the list*
01:45:49 *Header list implementation*
01:46:04 *Understanding changes*
01:47:05 *Circular list benefits*
01:48:53 *Circular queue advantages*
01:51:03 *Techniques for managing pointers*
01:53:46 *Location Previous Next*
01:53:59 *Circular Double Linked*
01:55:06 *Link List Different*
01:55:34 *Power Multiplication Zero*
01:56:18 *Understandable Structure Understandable*
01:56:46 *Clear Simple Idea*
01:57:43 *Pointers Addition*
02:00:23 *Real-life Examples*
02:01:02 *Clothes as Stack*
02:02:42 *Understanding Stack*
02:03:35 *Push Pop Understanding*
02:03:50 *Top Bottom Basic*
02:04:04 *Stack Operations Example*
02:03:35 *Push Pop Basics*
02:03:50 *Top Bottom Concept*
02:04:17 *Value Sequence*
02:08:11 *Insertion Overflows Check*
02:08:26 *Stack Implementation Insights*
02:08:40 *Handling Default Case*
02:09:35 *Handling Full Stack*
02:10:17 *Deletion (Pop) Strategy*
02:10:31 *Indexing and Implementation*
02:10:42 *Handling Pop Operations*
02:10:54 *Starting Index Consideration*
02:12:42 *Considerations for Deletion*
02:12:56 *Stack structure basics*
02:17:34 *Stack Implementation*
02:22:24 *Stack Applications Basics*
02:24:06 *Three Notations: Infix, Prefix, Postfix*
02:25:21 *Polish Notation Introduced*
02:28:09 *Prefix evaluation*
02:28:21 *Operator priority*
02:28:49 *Expression conversion*
02:29:18 *Operator associativity*
02:30:28 *Expression conversion steps*
02:33:22 *Postfix expression.*
02:35:52 *Power precedence.*
02:38:17 *Convert expressions*
02:38:30 *Tree traversal method*
02:38:45 *Preorder traversal*
02:38:57 *Solve expressions*
02:39:51 *Solve expressions with priority*
02:40:32 *Traverse the tree*
02:41:09 *Solve expressions by traversal*
02:41:48 *Benefits of tree method*
02:43:33 *Convert expressions*
02:43:48 *Using stack help*
02:45:28 *Postfix notation*
02:45:43 *Closing bracket*
02:47:23 *Evaluate expressions*
02:49:13 *Result Calculation Process*
02:51:32 *Value Pop Process*
02:53:22 *Importance of recursion.*
02:54:19 *Handling base case.*
02:56:01 *Recursive factorial function.*
02:59:12 *Loop within loop*
Tail Recursion Example
03:07:29 *Print command understanding*
03:08:13 *Recursion understanding clear*
03:09:19 *Recursive function observation*
03:13:00 *Recursive function understanding*
03:22:24 *Sequential Number Analysis*
03:26:51 *Understanding tower patterns*
03:28:00 *Flexibility in problem-solving*
03:28:42 *Recursive thinking importance*
03:30:43 *Puzzle solving approach*
03:31:38 *Tower of Noi function call*
03:34:48 *Swap algorithm explained.*
03:36:06 *Total moves calculation.*
03:40:02 *Recursion Simple Idea*
03:40:29 *Tail Recursion Explanation*
03:41:38 *Understanding Recursion Process*
03:45:22 *Condition Applicable*
03:46:45 *Understanding Recursion*
03:47:12 *Call and Print*
03:50:39 *Preorder traversal*
03:51:05 *Understanding tree structure*
03:56:25 *Understand Recursion Better*
03:57:44 *Recursive Function Call Analysis*
04:01:08 *Direct approach analysis.*
04:01:20 *Transition from cash.*
04:02:06 *Understanding pointers.*
04:06:12 *Efficient processing.*
04:06:32 *Sequential processing.*
04:06:58 *Resource management.*
04:07:39 *Index manipulation.*
04:08:33 *Rearrangement process.*
04:09:00 *Element ordering.*
04:09:12 *Position management.*
04:09:27 *Position updating.*
04:09:39 *Queue operation flow.*
04:11:40 *Special case*
04:16:04 *Define structure*
04:20:07 *Circular Queue Basics*
04:20:21 *Implementing Queue*
04:21:03 *Insert/Delete Observations (continued)*
04:21:30 *Node Structure Continued*
04:21:44 *Handling Overflow*
04:21:58 *Inserting Elements*
04:22:21 *Checking for Empty Queue*
04:22:49 *Updating Rear Pointer*
04:23:18 *Updating Rear Pointer (continued)*
04:23:31 *Handling Deletion*
04:23:44 *Handling Deletion (continued)*
04:24:40 *Bypass q's front*
04:25:47 *Implement logic*
04:26:13 *Observe how it works*
04:27:33 *Get final result*
04:27:46 *Ensure clarity*
04:28:40 *Handle overflow*
04:29:08 *Think logically*
04:29:35 *Circular Queue Implementation*
Understand the change.
Rearrange items.
Check overflow condition.
04:40:58 *Implementation Options*
04:41:51 *Input & Output Restrictions*
04:47:02 *Tree Terminology Clarity*
04:47:44 *Tree Node Connectivity*
04:50:16 *Degree Calculation*
04:50:30 *Total Tree Concept*
04:50:59 *Node Maximum Children*
04:54:36 *Binary Tree Structure*
04:59:39 *Understanding Structure Basics*
05:00:44 *Storing Data Method*
05:01:28 *Critique of Storing Method*
05:05:45 *Preorder, inorder, and postorder traversal*
05:10:07 *Creating unique trees.*
05:10:34 *Question tree traversal.*
05:10:48 *Types of binary tree traversal.*
05:11:15 *Post-order traversal: right to left.*
05:11:29 *Explaining traversal positions.*
05:12:08 *Traversal continuation.*
05:12:35 *Final traversal positions.*
05:15:29 *Left smaller, right larger.*
05:16:13 *Inorder traversal.*
05:16:41 *Binary search.*
05:17:36 *Observing tree cases.*
05:18:47 *Handling deletions.*
05:19:00 *Deletion process.*
05:20:12 *Delete easy nodes*
05:25:16 *Sorted sequences explained.*
05:26:12 *Search algorithm example.*
05:26:52 *Confirming search steps.*
05:27:17 *Validating search sequence.*
05:30:43 *Subtree value comparison*
05:30:57 *AVL tree node values*
05:31:11 *AVL tree insertion*
05:32:33 *Identifying node problems*
05:32:49 *Handling node problems*
05:33:01 *AVL tree rotation*
05:33:16 *Identifying node issues*
05:33:58 *AVL tree balancing*
05:34:57 *AVL tree balancing*
05:36:12 *Perfect Macanism Method*
05:36:50 *Balancing explanation*
05:37:19 *Tree structure analysis*
05:37:47 *No need for recheck*
05:38:16 *Mandatory balancing*
05:38:44 *Handling imbalances*
05:39:12 *Tree status evaluation*
05:39:40 *Perfect balance achieved*
05:39:54 *Continuous practice*
05:42:07 *Copying is difficult*
05:45:28 *Check balancing factors*
05:47:51 *Left type delete*
05:48:44 *Rotate for balance*
05:49:09 *Eliminate cases*
05:49:38 *Delete left node*
05:49:51 *Balance factor -1*
05:50:45 *Direct deletion*
05:51:48 *Replacement selection*
05:52:20 *Successor determination*
05:52:32 *Last node problem*
05:53:42 *Complete Binary Tree*
05:53:55 *Left to Right*
05:55:58 *Node Properties*
05:56:13 *Heap Variants*
05:57:24 *Parent-Child Relationship*
05:58:03 *Max Heap Analysis*
05:58:31 *Understanding Heap*
06:03:42 *Minimum exchanges needed*
06:03:51 *Examining numbers pattern*
06:04:58 *Reversing indices order*
06:05:13 *Deleting elements in heap*
06:06:05 *Understanding heap deletion*
06:06:18 *Handling root deletion in heap*
06:07:36 *Various types of questions*
06:08:05 *Different types of structures*
06:08:54 *Factorial Division Result*
06:09:57 *Labeling Binary Trees*
Made with HARPA AI
Tnx bro😊
Thank bhai
good job
Yu ka hobe hai harpa ai
U made my exam day bro thanks Bhai 🎉🎉
Ignore(just using comment section as bookmark)
Post order In order to tree: 5:13:10.
BST: 5:16:00
BST Deletion: 5:20:00
Heap deletion: 6:07:00
BFS traversal : 6:38:00
🎯 Key Takeaways for quick navigation:
04:14 Efficient Programming Essential
04:54 Solid Understanding Needed
05:22 Efficient Coding Crucial
06:16 Proper Data Arrangement
06:41 Organization is Key
07:47 Importance of Arrangement
08:16 Proper Item Placement
11:42 Modify Data Structures
13:29 Define new structures
13:59 Choose right algorithm
14:13 Data structure depends
14:26 Suitable data structure
16:17 Modularize structures
16:32 Basic structures available
18:04 Primitive Data Structures
18:19 Predefined Operations
18:32 Integers Operations
18:45 Inefficient Structures
19:16 Linear vs. Non-Linear
19:44 Non-Linear Data Structure
20:24 Implementation Complexity
20:39 Traversal Orders
21:21 Homogeneous and Heterogeneous
23:09 Quantity matters.
24:57 Accessing elements.
25:11 Array declaration basics.
27:30 Array Indexing Basics
28:14 Efficient Storage Use
28:28 Fast Access Methods
29:22 Easy to Modify
29:37 Specify Space Needs
29:51 Understand Space Allocation
30:18 Manage Dynamic Space
33:05 Serious Computer Time
33:34 Priority in Life
37:14 Upper bound
37:27 Formula explained
37:41 Perfect answer
37:53 Array size calculation
38:20 Multi-dimensional array size
38:46 Base address calculation
39:42 Random indexing
40:11 Base address calculation
43:40 1D vs 2D understanding
48:22 Understandable for psychology
58:31 Indexing Comprehension
59:10 Dimension Length Logic
01:01:31 Sparse Matrix Concept
01:02:52 Smart Sparse Matrix Storage
01:04:40 Sparse Matrix Handling
01:08:25 Runtime data manipulation.
01:09:06 Understanding linked lists.
01:11:36 Link and pointer part explanation.
01:11:50 Disadvantages of linked lists.
01:12:18 Simple node structure.
01:12:57 Dynamic size and memory efficient.
01:13:37 Easy insert/delete.
01:14:47 Consider space & time.
01:20:00 Creating nodes.
01:21:49 Basic operations.
01:25:26 Iterative vs. Recursive
01:29:31 Insert Node at Start
01:36:55 Implementing recursion.
01:38:45 Using Temp Variables
01:39:54 Iterative Process
01:40:35 Try Different Cases
01:41:44 Linking Nodes
01:42:14 Pointer Movement
01:42:54 Order of Operations
01:43:17 Head and Tail Movement
01:44:11 List traversal
01:44:37 Header list simplification
01:44:52 Header node usage
01:45:06 Special nodes in the list
01:45:49 Header list implementation
01:46:04 Understanding changes
01:47:05 Circular list benefits
01:48:53 Circular queue advantages
01:51:03 Techniques for managing pointers
01:53:46 Location Previous Next
01:53:59 Circular Double Linked
01:55:06 Link List Different
01:55:34 Power Multiplication Zero
01:56:18 Understandable Structure Understandable
01:56:46 Clear Simple Idea
01:57:43 Pointers Addition
02:00:23 Real-life Examples
02:01:02 Clothes as Stack
02:02:42 Understanding Stack
02:03:35 Push Pop Understanding
02:03:50 Top Bottom Basic
02:04:04 Stack Operations Example
02:03:35 Push Pop Basics
02:03:50 Top Bottom Concept
02:04:17 Value Sequence
02:08:11 Insertion Overflows Check
02:08:26 Stack Implementation Insights
02:08:40 Handling Default Case
02:09:35 Handling Full Stack
02:10:17 Deletion (Pop) Strategy
02:10:31 Indexing and Implementation
02:10:42 Handling Pop Operations
02:10:54 Starting Index Consideration
02:12:42 Considerations for Deletion
02:12:56 Stack structure basics
02:17:34 Stack Implementation
02:22:24 Stack Applications Basics
02:24:06 Three Notations: Infix, Prefix, Postfix
02:25:21 Polish Notation Introduced
02:28:09 Prefix evaluation
02:28:21 Operator priority
02:28:49 Expression conversion
02:29:18 Operator associativity
02:30:28 Expression conversion steps
02:33:22 Postfix expression.
02:35:52 Power precedence.
02:38:17 Convert expressions
02:38:30 Tree traversal method
02:38:45 Preorder traversal
02:38:57 Solve expressions
02:39:51 Solve expressions with priority
02:40:32 Traverse the tree
02:41:09 Solve expressions by traversal
02:41:48 Benefits of tree method
02:43:33 Convert expressions
02:43:48 Using stack help
02:45:28 Postfix notation
02:45:43 Closing bracket
02:47:23 Evaluate expressions
02:49:13 Result Calculation Process
02:51:32 Value Pop Process
02:53:22 Importance of recursion.
02:54:19 Handling base case.
02:56:01 Recursive factorial function.
02:59:12 Loop within loop
Tail Recursion Example
03:07:29 Print command understanding
03:08:13 Recursion understanding clear
03:09:19 Recursive function observation
03:13:00 Recursive function understanding
03:22:24 Sequential Number Analysis
03:26:51 Understanding tower patterns
03:28:00 Flexibility in problem-solving
03:28:42 Recursive thinking importance
03:30:43 Puzzle solving approach
03:31:38 Tower of Noi function call
03:34:48 Swap algorithm explained.
03:36:06 Total moves calculation.
03:40:02 Recursion Simple Idea
03:40:29 Tail Recursion Explanation
03:41:38 Understanding Recursion Process
03:45:22 Condition Applicable
03:46:45 Understanding Recursion
03:47:12 Call and Print
03:50:39 Preorder traversal
03:51:05 Understanding tree structure
03:56:25 Understand Recursion Better
03:57:44 Recursive Function Call Analysis
04:01:08 Direct approach analysis.
04:01:20 Transition from cash.
04:02:06 Understanding pointers.
04:06:12 Efficient processing.
04:06:32 Sequential processing.
04:06:58 Resource management.
04:07:39 Index manipulation.
04:08:33 Rearrangement process.
04:09:00 Element ordering.
04:09:12 Position management.
04:09:27 Position updating.
04:09:39 Queue operation flow.
04:11:40 Special case
04:16:04 Define structure
04:20:07 Circular Queue Basics
04:20:21 Implementing Queue
04:21:03 Insert/Delete Observations (continued)
04:21:30 Node Structure Continued
04:21:44 Handling Overflow
04:21:58 Inserting Elements
04:22:21 Checking for Empty Queue
04:22:49 Updating Rear Pointer
04:23:18 Updating Rear Pointer (continued)
04:23:31 Handling Deletion
04:23:44 Handling Deletion (continued)
04:24:40 Bypass q's front
04:25:47 Implement logic
04:26:13 Observe how it works
04:27:33 Get final result
04:27:46 Ensure clarity
04:28:40 Handle overflow
04:29:08 Think logically
04:29:35 Circular Queue Implementation
Understand the change.
Rearrange items.
Check overflow condition.
04:40:58 Implementation Options
04:41:51 Input & Output Restrictions
04:47:02 Tree Terminology Clarity
04:47:44 Tree Node Connectivity
04:50:16 Degree Calculation
04:50:30 Total Tree Concept
04:50:59 Node Maximum Children
04:54:36 Binary Tree Structure
04:59:39 Understanding Structure Basics
05:00:44 Storing Data Method
05:01:28 Critique of Storing Method
05:05:45 Preorder, inorder, and postorder traversal
05:10:07 Creating unique trees.
05:10:34 Question tree traversal.
05:10:48 Types of binary tree traversal.
05:11:15 Post-order traversal: right to left.
05:11:29 Explaining traversal positions.
05:12:08 Traversal continuation.
05:12:35 Final traversal positions.
05:15:29 Left smaller, right larger.
05:16:13 Inorder traversal.
05:16:41 Binary search.
05:17:36 Observing tree cases.
05:18:47 Handling deletions.
05:19:00 Deletion process.
05:20:12 Delete easy nodes
05:25:16 Sorted sequences explained.
05:26:12 Search algorithm example.
05:26:52 Confirming search steps.
05:27:17 Validating search sequence.
05:30:43 Subtree value comparison
05:30:57 AVL tree node values
05:31:11 AVL tree insertion
05:32:33 Identifying node problems
05:32:49 Handling node problems
05:33:01 AVL tree rotation
05:33:16 Identifying node issues
05:33:58 AVL tree balancing
05:34:57 AVL tree balancing
05:36:12 Perfect Macanism Method
05:36:50 Balancing explanation
05:37:19 Tree structure analysis
05:37:47 No need for recheck
05:38:16 Mandatory balancing
05:38:44 Handling imbalances
05:39:12 Tree status evaluation
05:39:40 Perfect balance achieved
05:39:54 Continuous practice
05:42:07 Copying is difficult
05:45:28 Check balancing factors
05:47:51 Left type delete
05:48:44 Rotate for balance
05:49:09 Eliminate cases
05:49:38 Delete left node
05:49:51 Balance factor -1
05:50:45 Direct deletion
05:51:48 Replacement selection
05:52:20 Successor determination
05:52:32 Last node problem
05:53:42 Complete Binary Tree
05:53:55 Left to Right
05:55:58 Node Properties
05:56:13 Heap Variants
05:57:24 Parent-Child Relationship
05:58:03 Max Heap Analysis
05:58:31 Understanding Heap
06:03:42 Minimum exchanges needed
06:03:51 Examining numbers pattern
06:04:58 Reversing indices order
06:05:13 Deleting elements in heap
06:06:05 Understanding heap deletion
06:06:18 Handling root deletion in heap
06:07:36 Various types of questions
06:08:05 Different types of structures
06:08:54 Factorial Division Result
06:09:57 Labeling Binary Trees
bro which ai tool did you used to know this
@@dhruvgupta910 harpa ai
17:11 premertive non premitive
21:20 homogeneous vs hetro
2:34:00 prefix postfix
2:53:00 recursion
3:00:45 recursion vs itteriation
3:08:00 recursion problems tree
3:17:00 fibnocci no.
4:13:00 que delt
4:54:00 binary tree
5:04:00 traversal tree
5:15:00 binary search tree
5:54:00 complete binary tree
👍🏻
👍🏻
I really appreciate him including humor, memes beside really quality content which is compact, no fluff material. He is indeed a really good teacher!
Glad you liked it Vedant, thanks for following the content, keep learning & stay connected.
4:55:34 q. binary tree height
5:10:17 q2. inorder postorder conv.
5:13:41 q3. inorder preorder conv.
Sir, one shot videos are extremely helpful, please keep continuing to make them..
Sure dear, keep learning❤
can you tell me which programming language Data structure is this? i want to learn from C Prog language
@@neonblade209this is for C
2:37:56 Right answer is -+a*/*bc^d^efdc
Thank You So Much Sir, I have watched all the courses of CS/IT from your recorded lectures. This One shot video gives total overview of all topics, I would suggest every CS/IT student to watch this series for overall revision.
Sir abhi to hame "Sharma Aur Warma" bhi confuse nhi kr skte😅😅
You're most welcome Lokesh, yes please do share our content with all your friends & stay with us for more amazing upcoming contents👍
Your One Shot Semester series is hands down my secret weapon for acing exams! 🌟 The depth and clarity you bring in such a short time is mind-blowing. As my software engineering exams approach, I'm counting on your magic. 🖥💡
Could you please drop a One Shot on software engineering? It's not just a request; it's a desperate student's plea for salvation! 😅 Your videos are a game-changer, and a software engineering edition would be a total knockout. Keep rocking the educational world! 🚀📚"
Thanks a lot Shrey for your valuable feedback, happy to know that you are liking the content & understanding the concepts easily. Sure, will try to work on your suggestion, do like & subscribe, keep learning & stay tuned for more upcoming contents👍😊
ruclips.net/video/ThWHdHlFp2A/видео.htmlsi=jnfC_-73JwPG7cRx
ruclips.net/video/ThWHdHlFp2A/видео.htmlsi=jnfC_-73JwPG7cRx
bhai chat gpt se taarif karra hai kya ?:)
Will this lecture be helpful if I only know C language
At 2:03:55 in prefix order after - (minus) + (plus ) will be there ? - + a*/*bc^d^efdc
Yes, KG's Team should notice that.
true bro i too noticed that stuff..
🙃🙃
Yes
Matlab man ki baat padh lete ho sir aap 😅 really searching for this type of video, Ahmedabad, Gujarat
Wow...just fells proud after completing DSA give some positiveness..average students is now broken his line and just keep stepping with your videos ..thanks a lot sir ....I know ye sb likhte h but mai cmnt nhi krta but after completing this my soul my heart and my brain ...forced me to type this 😊🙏
Nice, thank you so much for your feedback @Shubham, this motivates to bring more valuable content for you all. Please like, subscribe, and share the video, and stay connected for more amazing content👍
Sir you are such a gem 💎 thank you for this useful one short video and i hope you will be creating more videos like this ❤❤
Most welcome 😊 Do like, subscribe & share the video with your friends. Stay connected for more upcoming contents👍
Thanks Sir,
Exam से One Week पहले सही Time पर मिल गया ये LifeSaver Video 🙏🙏
Great, all the best for your exam, keep learning👍😊
Thank you Sir 🙏
Apne itne kam time me video provide kr diya
Aap best teacher ho ...
Most welcome dear @Karan, keep learning, which subject do you want next?
Discrete structure and theory of logic 🙏
I want that you complete other subjects like AI, Statistics, DAA, so that this channel grows like a boom, Keep uploading like this, sir, It's our good luck to witness such a next level teacher teaching here, the concepts foundation is held so tight that we feel fully confidence because of you,
Thank you so much @Gaurav for your kind words😍 Sure we'll definitely try to upload more useful content for our dear learners, stay connected & keep learning👍😊
@@KNOWLEDGEGATE_kgai one shot plz
ruclips.net/video/ThWHdHlFp2A/видео.htmlsi=jnfC_-73JwPG7cRx
Placement interview
@@bengaliguy4590ruclips.net/video/ThWHdHlFp2A/видео.htmlsi=jnfC_-73JwPG7cRx
@@swalehamomin8448ruclips.net/video/ThWHdHlFp2A/видео.htmlsi=jnfC_-73JwPG7cRx
sir you are great, this lecture helped me a lot in building concepts
thanku sir
Thankyou so much sir 😊😊😊 for Cristal clear Explanation 😊
You're welcome Munish😍 Do like, subscribe & share it with your friends. Stay connected for more upcoming contents👍😊
Mitochondria is the power house of the cell❌
Array starts at 0✅
Engineer aur Doctor me difference padh rahe ho ka😂
Aayein 🤣
6:56:42 option a is right, clarify sir
Thank you very much Sir. Please also upload Design and Analysis of Algorithms (DAA) one shot video 🙏🏻. We students love your content 😁
Ok dear, will consider your suggestion, stay connected & keep learning👍😊
sir exam 28 ko hai please DAA upload kijiye DAA se dar lag raha hai@@KNOWLEDGEGATE_kg
I completed your data communications and computer networking 🎉🎉🎉🎉 very nice clss 😊😊😊😊😊
mera aaj endsem exam tha mene kal raat tak eek video dekhi jisme coding plus dsa ki interview tak kii tarayari kara rahe thai jo irrelevant tha endtime endsem ki preperation ke liye mene raat ko 10 baje se ess video ko start kari 4 ghante shoya oor sube 5 baje uthkar 2x par ye video dekh daali exam centre tak bhi 10 baje exam tha 9:50 tak video oor rough notes revised bhai yakiin mano mene pura paper kardiya theoretical part or coding ke questions or mein thai sare theoretical basic coding tree sab kar liya ooor mene jo esse pehle 24 hrs ki video dekhi thi ussse sirf time complexity eek question kardiya ...... thankyou sir aapka itna high quality content ke liye
Great, glad to know our content is helpful & you performed well in your exam. Stay connected for more content & do share the video with your friends👍
Sir notes toh hai hi nhi discription mai not available pdf notes @@KNOWLEDGEGATE_kg
Sir aapne 72 se start krne ko kha indexing but ye to hmesa 0 se suru hoga means array ka indexing jab tkk hum programming language bnate time ya nai programming language bnani pdegi ??
The way you teach is fabulous.
Glad you liked it, thank you @Abhay. Keep learning & stay tuned for more content👍
This is a evergreen video sir ... Even after 10 years students can study from this video...
Thank you Manish, keep learning & following👍😊
Thnq vry much it is so helpful for me to.prepare for my exams a proper study material u gave....❤❤❤
Most welcome, keep learning & all the best😊
jai hind jai bharat ..very helpful content Sir . Thanks and Regards
Glad it's helpful, thank you for watching, keep learning👍
How it is possible to start array indexing from -3
Sir a very humble request from my side on the behalf of every student, please do a one shot on OOPM (Object oriented programming), as semester exams are very close.
can u tell is it going to happen in december ??
@@ashutoshyadav6013 yes
Thank you so much sir for uploading this ,, eagerly waiting for this video.......please next upload DAA in one shot....Please sir...🙏respect and love for whole KG team....🙏🙏🙏❤❤❤
You're welcome dear @Rupashree, sure will consider your suggestion, stay connected & keep learning👍😊
@@KNOWLEDGEGATE_kg 🙏🙏❤️❤️
Very nice video and very nice explaination sir you are genius sir 🎉🎉🎉❤❤
One word for this vedio "perfect"😘😘😘👏
Thank you so much Ritik, keep learning & stay tuned for more upcoming contents👍😊
Sir , I like your Way of Talking , I always see You Calm . I really learn so much thing from u including my Study❤. Love u Sir❤
Thank you so much for the kind comment, keep learning & stay connected👍😊
i am a bca second y student i really was searching one shot of dsa ....thanks for explaining in easy way ...a huge thanks to u sir
You're welcome, Ankit. Keep learning, supporting & stay connected for more upcoming content👍
Thank u so much sir for this content❤❤
So nice of you
Hello sir I am from Nabadwip (BIRTH PLACE OF SRI CHAITANYA MAHAPRAVU) and state is west Bengal . Previous few month I watch your video and also fan of your teaching style . Thanks sir ❤❤
Great, thank you for watching Arup. Keep learning and following. Do share the video with your friends if you find it helpful.
Very nice clss sir g 🥳🥳🥳🥳🥳 I'm polytechnic students computer science branch 2nd year 😊😊😊😊😊
Thanks for watching dear, keep learning & stay connected for more upcoming content! 👍
Yes sir 😊😊😊 I'm from Madhogarh Jalaun 285126🎉🎉🎉🎉@@KNOWLEDGEGATE_kg
Please upload a one shot video on Mathematics-III (Differential Calculus)
Sir you are thinking about students and love them sir i have watch all your videoes you are best teacher on
Fore me love you sir. Har Har madha dev.
Thanks a lot dear @Rushikesh, keep learning & stay blessed❤ Which subject do you want next?
@@KNOWLEDGEGATE_kg TOC
Your One Shot Semester series has been exceptional for my exam preparation, sir. The clarity and speed with which you explain concepts are truly remarkable. With my AI exams approaching, I would be immensely grateful if you could consider creating a One Shot on AI for semester. It would be of great help. Thank you.
Glad you liked it, @soumadipmajila7962. Thank you, keep learning. AI one shot is already available on our channel, here is the video link: ruclips.net/video/yiXAmkimZRQ/видео.html
@@KNOWLEDGEGATE_kg Sorry sir I didn't notice that. And thanks for the reply.
Sir these one shot is extremely helpful for ourselves.Thank you sir for best one shot ❤❤❤
Glad it's helpful dear! Keep learning & supporting, do like, subscribe & share the video👍😊
Very very very nice......i can't imagine the teaching skil😮😮l......thank u sir🎉
You're welcome, Bikash. Keep learning, supporting & stay connected for more content👍
really.... that's what is called an one shot... perfectly described... awesome video... thanks sir.
Glad you liked it Subhabrata, keep learning, do like, subscribe & share our videos. Stay connected for more upcoming contents👍😊
I searched lot of videos and this video is super good. this is perfect for me ❤❤❤❤❤ thanks sir ❤
Most welcome 😊 Keep learning, do like & subscribe our channel for more upcoming videos👍😊
i wish i had you 8 years back when i was struggling in college and backlogs and mental health 😞
Hope you're doing great now..
What u are doing now
@@FardeenKhaNaeemKhaPathan struggling in life, jobless, in the darkest phase of my life. But I'm fighting it out with a smile ☺️
~Most~thank u sir❤❤❤❤😊😊
You're welcome! Do like, subscribe & share the video with your friends. Stay connected for more upcoming contents👍
1:01:57 Sir you have solved the ques by row major instead of column major
Sir, You are LORD!!! You Really saved me I got back to back Compartment in DS due to less marks in Internals, from 3 years. Finally I can say I will score 80+ this time in theory. THANKS ALOT SARKAR❤
Excellent, am glad to know this, keep learning & supporting❤
Waheguru ji tuhanu lambi umar bakshan..🙏
Bahut Bahut Dhanyawad 🙏🏻☺️
Thank You so much sir!! University based + notes + complete thing!! Incredible Sir!! Please keep making more videos for our university exams :)) Thank you again
Glad you liked it Lakshya, thank you for your feedback😍 Do like, subscribe & share the video & stay connected for more amazing videos & contents👍😊
Do I need to learn programming language before this vedio
Sir apka bhut bhut dnybad mene apni 6 hours ki discrete structure ki video deki thi usme mere sare topic cover ho gye the esliye mera paper bhut accha gya sirf aapki bjh he ❤❤❤
Arey waah very nice, keep learning & following our channel for more useful content👍
sir very nice video. I got every concept of DSA for my exam point of view, Thank you so much sir🙌🙌
Great, keep learning & supporting👍
Sir, your one-shot videos are very helpful. I am a 2nd year student pursuing CSE in KIIT. I watched your playlist of 'TOC | AUTOMATA THEORY '. The explanations of those videos are awesome but this playlist was created based on the GATE syllabus. Please bring a new one-shot video for this 'Theory of Computation' subject according to our college syllabus. It will also be very helpful for our semester exam.
Here is the syllabus of our college-
UNIT I
Finite Automata: Alphabets, Strings and Languages, Automata and Grammars, Deterministic Finite Automata (DFA), Formal Definition, Simplified notation: State transition graph, Transition table. Language of DFA, Non-deterministic Finite Automata (NFA), NFA with epsilon transition, Language of NFA, Equivalence of NFA and DFA, Minimization of Finite Automata, Distinguishing one string from other, Myhill Nerode Theorem.
UNIT II
Regular Expression (RE): Definition, Operators of regular expression and their precedence, Algebraic laws for Regular expressions, Kleen’s Theorem, Regular expression to FA, DFA to Regular expression, Arden Theorem, Non Regular Languages, Pumping Lemma for regular Languages. Application of Pumping Lemma, Closure properties of Regular Languages, Decision properties of Regular Languages, FA with output: Moore and Mealy machine, Equivalence of Moore and Mealy Machine, Applications and Limitation of FA.
UNIT III
Context Free Grammar (CFG) and Context Free Languages: Definition, Examples, Derivation, Derivation trees, Ambiguity in Grammar, Inherent ambiguity, Ambiguous to Unambiguous CFG, Useless symbols, Simplification of CFGs, Normal forms for CFGs: CNF and GNF, Closure properties of CFLs, Decision Properties of CFLs: Emptiness, Finiteness and Membership, Pumping lemma for CFLs.
UNIT IV
Push Down Automata (PDA): Description and definition, Instantaneous Description, Language of PDA, Acceptance by Final state, Acceptance by empty stack, Deterministic PDA, Equivalence of acceptance by empty stack and final state, Conversion of CFG to PDA and PDA to CFG.UNIT V
UNIT V
Turing Machines (TM) and Undecidability: Basic model, definition and representation, Instantaneous Description,
Language acceptance by TM, Variants of Turing Machine, TM as Computer of Integer functions, Universal TM, Church’s Thesis, Recursive and recursively enumerable languages, Halting problem, Introduction to Undecidability, Undecidable problems about TMs, Post correspondence problem (PCP), Modified PCP and undecidable nature of post correspondence problem, Introduction to recursive function theory.
Thank you so much Sourendu for your valuable feedback😍Sure, will consider your suggestion, do like, subscribe & share the video & stay connected for more amazing upcoming contents👍😊
Thank you, @@KNOWLEDGEGATE_kg sir for your response. Please make the video on Theory of Computation as soon as possible as in most colleges, semester exams will be started within a few days.
bhai imp bta de ds k lia
Hey college mate
hlo sir ,
your teaching style is awesome the concepts are crystal clear now ,
theit is one request sir can you please discuss the previous year questions of data structure cs303 of rgpv it will help a lot
Thanks a lot Sameer, keep learning👍😊
sie mind blowing preparation for semester sir hatts of to u
Great, do well👍
Such a very useful video.........I like it soo much and it's really very helpful for those students who want to prepare the whole subject in one place .............😊
Thanku so much sir 🙏🏻
Glad you liked it @Ritesh, thanks for watching. Keep learning & following for more content.
Thank you so much Sir, this is very helpful 🙏🏻
Glad it's helpful dear, thanks for watching.
how many wants Compiler Design One Shot
I really need it
I don't
Thank for you sir❤❤
I seriously need it!
I need it
Delhi, had a great experience in the 7 hours . a master weapon for exam . Thank you sir and thanks to the team.
You're most welcome! Do like, subscribe & share the video with your friends. Stay connected for more upcoming contents👍
Sir ,please upload Software Engineering next ! My exams are approaching ,Computer Networking one shot helped me to connect every dots of all the concepts i have studied earlier . Same i want SE too ! Thank you Sir :)
Ok dear, will try to consider your suggestion, stay connected & keep learning👍😊
Thik video not only help in semester exam also help in entrance exam thanku sir🥰🥰
Most welcome Jay, keep learning & following us for more content👍
Your are superb sir❤❤❤❤
Thank you so much, Anubhav. Keep supporting & learning!
Kal semester exam he 🙂 aj dhek raha hu
Mera bhinkl h😅
Us bro us
Completed full DS while preparing for NET JRF really helpful , best short term revision of concept is done.....THANKS A LOT
You're welcome, keep learning & all the best for your exam👍😊
Dear sir take a one shot oops with c++ I have bpsc tre exam
I have adda 24*7 classes but I didn't watch kyuki usse achha to sir me pdha lunga apka pura class dekhta hu then self study
Excellent explanation sir I m from Lahore Pakistan, may God bless you and grant you health, wealth and success ameen. Regards
Thank you so much Abdul for your kind & generous words, stay blessed & keep learning👍😊
Amazing explanation and the way you teach is excellent .... thank you
You're welcome! Keep learning, do share the video with your friends & please follow us for more content👍
Ek hi dil hai kitni bar jitenge sir ❤❤
Thank you, stay blessed❤
AKTU ka. hai koii???
aktu wala hai koi yaha pe
🙃
Hmm
Hhhh
Ha Bhai ❤
Ha
Such a great one shot sir 😍, it was very helpful for our semester exam and also understanding DS so easily.
Thanks a lot Ashish, glad to know it's helpful, keep learning & stay tuned.
Is this good for revision purpose or ca n really teach to the students who just started
Thank you so much sir for your valuable information. Now I know how to forger her existence. Thank you so much 🙏🙏2:12:21
sir please DAA (Design and Analysis of Algorithm) ka bhi one shot release kar do soon❤❤
Ok dear, will consider your suggestion, stay connected & keep learning👍😊
I am also waiting for DAA and Compiler Design@@KNOWLEDGEGATE_kg
MAKAUT. Wala hai koi
Bro can you tell me is this video covered makaut syllabus? Just thinking of starting syllabus 😢
@kim_gongja maza nahi aa rha padhh ke kuchh samjh me aata kuchh nahi. Code with Harry se padh lo isase achha
Yah bro
Attendance SPPU Students 😂
2:12:20 best advice for life ........
Sir, you an amazing teacher. Your way of teaching is so simple and interesting, it shows your excellent understanding of the concepts.
Thank you, glad you liked it. Stay connected & keep learning😊
Attendance anyone Mumbai university 😂
Yes
Yes
anyone from makaut??
yeee
missing topic sorting?
Amazing sir this one shot is too good for learning ds ❤❤
Sir algorithm wali video kha par milegi ?
Thank you, sharing Algorithm video: ruclips.net/video/z6DY_YSdyww/видео.html
Thanks so much sir love you 😘
You're welcome Vikram, keep learning, do like, subscribe & share the video & stay connected for more upcoming contents👍😊
Rgpv wala hain ka yahan per koi
Exam me aaaya Tha es video see
Haa
.
2d array coloum question, solution is "2024"😅
Yes Same😅
Anyone from ptu ?
Yes
Something is wrong in the program at 1:30:00 because we are already assigning data in createNode function so we won't reassign it in the insertAfter function again. Also In insertAfter method there's no variable data so it doesn't make sense to reassign it.
thanks sir for your video iam going to ace my exam due to you thanks a lot I am really grateful to you
Glad to know, all the very best for your exam, do well & keep supporting👍😊
Ptu wala hai koi ❤
Any one form inverties university bareilly ❤
🙋🏻♂️😂
Excellent teaching skill.
Thank youu sir it was very easy to uderstand this.....
You're welcome, Hema. Keep learning, supporting & stay connected for more upcoming content👍
Arrey anshika 😂
Array Priyanka 😂
Anyone from lpu?
Yes darling
Here !! 🙋🏻♂️
Usar East campus
Yes
🙋🏼❤JIMS
1:00:00
1:30:00
1:45:00
3:36:00 Question solution practice
Watching from another side of border, love from Skardu
From where?
@omkarsalunkhe07 from Skardu Gilgit Baltistan
@HaqqanHaider which country ?
@@omkarsalunkhe07 🇵🇰
@@HaqqanHaider oo bhai padosii 🤝
sir,
you are the most amazing teacher,
I had gone through various channels but your one is the best....
having a teacher like you was such a greatfull thing ...
thank you sir very much for this video
You're most welcome, Dhruv. Am glad you like our content, stay connected for more amazing upcoming videos & keep learning😊
3:16:53 sir iss wale question me I guess add nhi karna ...sir Output 12314125 ye hoga ig pls clarify....Btw thank you sir for such great lecture series ❤