Live Coding with Data Structures for campus/internship/jobs Course includes 25 hrs video content and enrolled by 3 K+ students and received a 4.6 average review out of 5. Now, Course instructor offering 100%OFF on the original price of the course and its limited time offer. Enroll the course before the coupon expired Once you’re enrolled for the course, you can start it whenever and complete it at your own pace. it will never expire on your account.
Following topics are covered as part of hands-on / Live coding videos :
Linked Lists (LL) Implementation / Coding:
- Concept of link
- Creating a Linked List (LL)
- Appending a node to LL
- Display of LL
- Length of LL (count)
- Reversing of LL
- Sorting
- Adding node at Start of LL
- Inserting node in between of LL
- Deleting a node
- Creating a Double LL
- Appending a node to Double LL
- Display of Double LL
- Length of Double LL (count)
- Reversing of Double LL
- Inserting a node in between a Double LL
- Rotate Double LL
- Count Pairs with criteria for a Double LL
- Questions
- Circular LL overview (access pointers)
- Creating a Circular LL
- Adding node at Start Circular LL (approach 1)
- Traversal / Display Circular LL (approach 1)
- Inserting node in between a Circular LL (approach 1)
- Deleting a node
- Adding node at End Circular LL (approach 2)
- Traversal / Display Circular LL (approach 2)
- Circular LL – Queue (Adding Node)
- Circular LL – Queue (Removing Node)
- Questions
Stacks (Implementation / Coding):
- Stack overview
- Stack with Array
- Expressions
- Evaluation of Postfix expression
- Infix to Post fix
- Evaluation of Prefix overview. infix to prefix overview
- Application: Finding next big element
- Stack using Linked List
- Reversing Stack with Linked List
- Questions
Queues (Implementation / Coding) :
- Queue Overview
- Queue using Array
- Priority Queue with Array
- Queue using Linked List
- Priority Queue using Double Linked List
- Questions
Recursion
- Recursion Overview, Phases, Types
- Recursive Functions
- Linked List operations using Recursion
- Questions
Trees
- Binary Trees
- Tree Traversals
- Inorder
- preorder
- postorder
- Binary Search Trees (BST)
- BST – Insertion
- BST – Insertion & Traversals
- Traversals Explained
- BST – Search
- Search operations
- BST Deletion
- Deletion cases
- Binary Tree to BST conversion
- Identify a Tree to be BST
- Identify zero, one child nodes of BST
- Questions
Sorting
- Selection Sort
- Selection Sort Analysis
- Bubble Sort
- Bubble Sort Analysis
- Insertion Sort
- Insertion Sort Analysis
- Quick Sort
- Quick Sort Analysis
- Quick Sort, Merge Sort Discussion
- Questions
Topics of Data Structures and interaction
Who this course is for:
- fresh students, C programmers
Can I download Live Coding with Data Structures for campus/internship/jobs course?
You can download videos for offline viewing in the Android/iOS app. When course instructors enable the downloading feature for lectures of the course, then it can be downloaded for offline viewing on a desktop.Can I get a certificate after completing the course?
Yes, upon successful completion of the course, learners will get the course e-Certification from the course provider. The Live Coding with Data Structures for campus/internship/jobs course certification is a proof that you completed and passed the course. You can download it, attach it to your resume, share it through social media.Are there any other coupons available for this course?
You can check out for more Udemy coupons @ www.coursecouponclub.com
Note: 100% OFF Udemy coupon codes are valid for maximum 3 days only. Look for "ENROLL NOW" button at the end of the post.
Disclosure: This post may contain affiliate links and we may get small commission if you make a purchase. Read more about Affiliate disclosure here.
Disclosure: This post may contain affiliate links and we may get small commission if you make a purchase. Read more about Affiliate disclosure here.
