C Programming & Data Structures
5.0
(0)
6 learners
What you'll learn
This course includes
- 38 hours of video
- Certificate of completion
- Access on mobile and TV
Course content
1 modules • 278 lessons • 38 hours of video
C Programming & Data Structures
278 lessons
• 30 hours
C Programming & Data Structures
278 lessons
• 30 hours
- Introduction to Data Structures 11:18
- Data Types vs. Abstract Data Types 07:51
- Data Structure Definition & Advantages 03:53
- Types of Data Structures 04:28
- Basics of Asymptotic Analysis (Part 1) 06:32
- Basics of Asymptotic Analysis (Part 2) 03:11
- Basics of Asymptotic Analysis (Part 3) 09:50
- Basics of Asymptotic Analysis (Part 4) 07:44
- Basics of Asymptotic Analysis (Part 5) 12:15
- Guidelines for Asymptotic Analysis (Part 1) 05:04
- Guidelines for Asymptotic Analysis (Part 2) 08:26
- Asymptotic Analysis (Solved Problem 1) 07:23
- Asymptotic Analysis (Solved Problem 2) 03:49
- Asymptotic Analysis (Solved Problem 3) 04:07
- Understanding the Void Pointers 04:19
- Understanding the Null Pointers 04:23
- Understanding the Dangling Pointers 05:11
- Understanding the Wild Pointers 02:27
- Basics of Dynamic Memory Allocation 04:18
- Dynamic Memory Allocation using malloc() 08:29
- Dynamic Memory Allocation using calloc() 02:06
- Dynamic Memory Allocation using realloc() 04:52
- Releasing the Dynamically Allocated Memory using free() 04:04
- Structures and Functions (Part 1) 07:11
- Structures and Functions (Part 2) 02:50
- Structures and Functions (Part 3) 02:48
- Structures and Functions (Part 4) 03:38
- Structures and Functions (Part 5) 07:50
- Structures and Functions (Part 6) 05:14
- Self Referential Structures 06:20
- Introduction to Linked List 06:21
- Array vs. Single Linked List (In Terms of Representation) 04:10
- Creating the Node of a Single Linked List 06:00
- Creating a Single Linked List (Part 1) 04:37
- Creating a Single Linked List (Part 2) 07:00
- Traversing a Single Linked List (Counting the Nodes) 06:07
- Traversing a Single Linked List (Printing the Data) 03:44
- Traversing the List (Linked List vs. Arrays) 04:00
- Single Linked List (Inserting a Node at the End) 05:49
- Insertion at the End (Linked List vs. Array) - Part 1 07:35
- Insertion at the End (Linked List vs. Array) - Part 2 08:07
- Single Linked List (Inserting a Node at the Beginning) 05:37
- Inserting the Data at the Beginning of Single Linked Lists (Possible Mistake) 05:47
- Inserting the Data at the Beginning of Single Linked List (2nd Method) 03:47
- Inserting the Data at the Beginning (Singly Linked List vs. Array) 07:28
- Single Linked List (Inserting a Node at a Certain Position) 06:52
- Insertion at a Certain Position (Singly Linked List vs. Arrays) - Part 1 03:07
- Insertion at a Certain Position (Singly Linked List vs. Arrays) - Part 2 08:08
- Single Linked List (Deleting the First Node) 03:47
- Single Linked List (Deleting the Last Node) 05:06
- Single Linked List (Deleting the Last Node using Single Pointer) 04:01
- Deletion at the End (Singly Linked List vs. Array) 04:25
- Deletion at the Beginning (Single Linked List vs. Array) 04:19
- Single Linked List (Deleting the Node at a Particular Position) 09:43
- Deleting the Entire Single Linked List 06:06
- Reverse a Single Linked List 11:57
- Singly Linked List (Solved Problem 1) 05:01
- Singly Linked List (Solved Problem 2) 07:23
- Singly Linked List (Solved Problem 3) 05:44
- Singly Linked List (Solved Problem 4) 07:44
- Singly Linked List (Solved Problem 5) 04:25
- Singly Linked List (Solved Problem 6) 06:54
- Rapid Fire Quiz (Singly Linked List) 05:24
- Introduction to Doubly Linked List 03:03
- Doubly Linked List (Inserting a Node in an Empty List) 02:41
- Doubly Linked List (Insertion at the Beginning) 03:43
- Doubly Linked List (Insertion at the End) 04:22
- Doubly Linked List (Insertion between the Nodes) - Part 1 06:19
- Doubly Linked List (Insertion between the Nodes) - Part 2 05:09
- Creating an Entire Doubly Linked List 07:01
- Doubly Linked List (Deleting the First Node) 03:36
- Doubly Linked List (Deleting the Last Node) 03:22
- Doubly Linked List (Deleting the Intermediate Node) 05:13
- Reversing the Doubly Linked List 07:48
- Doubly Linked List (Solved Problem 1) 04:26
- Doubly Linked List (Solved Problem 2) 04:07
- Why Doubly Linked List? 04:58
- Rapid Fire Quiz (Doubly Linked List) 05:25
- Introduction to Circular Linked List 04:29
- Circular Singly Linked List (Insertion at the Beginning) 05:28
- Traversing a Circular Singly Linked List 05:07
- Circular Singly Linked List (Insertion at the End) 03:13
- Circular Singly Linked List (Insertion between the Nodes) 06:31
- Creating a Circular Singly Linked List 05:38
- Circular Singly Linked List (Deleting the First Node) 04:29
- Circular Singly Linked List (Deleting the Last Node) 04:22
- Circular Singly Linked List (Deleting the Intermediate Node) 04:35
- Circular Singly Linked List (Counting the Number of Elements) 04:10
- Circular Singly Linked List (Searching an Element) 07:32
- Circular Doubly Linked List (Insertion at the Beginning) 06:10
- Circular Doubly Linked List (Insertion at the End) 04:49
- Circular Doubly Linked List (Insertion between the Nodes) 05:28
- Circular Doubly Linked List (Deleting the First Node) 04:08
- Circular Doubly Linked List (Deleting the Last Node) 03:43
- Circular Doubly Linked List (Deleting the Intermediate Node) 05:53
- Sorted Singly Linked List (Inserting a New Element) 12:15
- Application of Linked List (Polynomial Arithmetic) - Part 1 04:14
- Application of Linked List (Polynomial Arithmetic) - Part 2 22:54
- Application of Linked List (Addition of Two Polynomials) 17:29
- Application of Linked List (Multiplication of Two Polynomials) 14:00
- Application of Linked List (Multiplication of Two Polynomials) - Improvements 12:01
- Adding Two Numbers using Linked Lists - Part 1 18:34
- Adding Two Numbers using Linked Lists - Part 2 09:38
- Adding Two Numbers using Linked Lists - Part 3 17:56
- Queues | Chapter-7 | Data Structures | nesoacademy.org 01:28
- Binary Trees | Chapter-8 | Data Structures | nesoacademy.org 03:04
- Binary Search Trees | Chapter-9 | Data Structures | nesoacademy.org 01:09
- AVL Trees | Chapter-10 | Data Structures | nesoacademy.org 01:10
- C Programming – Features & The First C Program 14:58
- Introduction to Variables 08:24
- Variable Naming Conventions 04:21
- Basic Output Function – printf 06:14
- Fundamental Data Types − Integer (Part 1) 07:40
- Fundamental Data Types − Integer (Part 2) 07:20
- Exceeding The Valid Range of Data Types 07:47
- Fundamental Data Types − Character 12:25
- Fundamental Data Types − Float, Double & Long Double 13:06
- C Programming (Important Questions Set 1) 13:42
- Scope of Variables - Local vs Global 11:12
- Variable Modifiers − Auto & Extern 12:52
- Variable Modifiers − Register 04:02
- Variable Modifiers − Static 19:02
- Constants in C (Part 1) 08:43
- Constants in C (Part 2) 04:05
- C Programming (Important Questions Set 2) 06:10
- Basic Input Function – scanf 05:08
- C Programming (Important Questions Set 3) 21:19
- Introduction to Operators in C 05:33
- Arithmetic Operators in C 08:02
- Increment and Decrement Operators in C (Part 1) 10:55
- Increment and Decrement Operators in C (Part 2) 15:39
- Relational Operators in C 03:36
- Logical Operators in C 12:09
- Bitwise Operators in C (Part 1) 07:52
- Bitwise Operators in C (Part 2) 04:59
- Bitwise Operators in C (Part 3) 04:01
- Bitwise Operators in C (Part 4) 04:34
- Assignment Operators in C 04:48
- Conditional Operator in C 05:41
- Comma Operator in C 08:30
- Precedence and Associativity of Operators 16:27
- Operators in C (Solved Problem 1) 05:54
- Operators in C (Solved Problem 2) 06:27
- C Programming (Rapid Fire Quiz-1) 05:52
- Conditionals (if-else, Nested if and else if) 08:10
- Conditionals (Switch) 07:24
- for and while Loops 06:49
- do-while Loop 05:03
- Loop Control Statements − break and continue 07:39
- Conditionals and Loops (Solved Problem 1) 06:30
- Conditionals and Loops (Solved Problem 2) 05:18
- Conditionals and Loops (Solved Problem 3) 05:07
- Conditionals and Loops (Solved Problem 4) 05:41
- Conditionals and Loops (Solved Problem 5) 03:18
- Special Programs in C − Pyramid of Stars 11:06
- Special Programs in C − Check If The Number Is Palindrome Number 08:14
- Special Programs in C− Check If The Number Is Armstrong Number 12:16
- Special Programs in C− Check If The Number Is Strong Number 10:18
- Special Programs in C − Check If The Number Is Prime Number 10:26
- Special Programs in C − Adding Two Numbers Without Using The Plus Operator 04:25
- Special Programs in C − Adding Two Numbers Without Using The Plus Operator (Half Adder Method) 14:16
- Special Programs in C − Fibonacci Series 07:10
- Special Programs in C − Floyd's Triangle 05:09
- Special Programs in C − Binary to Decimal Conversion 07:40
- Special Programs in C − Calculating Power of an Integer 10:25
- Special Programs in C − Check Leap Year 04:32
- Special Programs in C − Check If The Number Is Perfect Number 06:11
- Introduction to Functions in C 05:22
- Function Declaration in C 06:51
- Function Definition in C 06:04
- Call By Value & Call By Reference in C 08:34
- Functions (Solved Question 1) 04:56
- Functions (Solved Question 2) 07:03
- Functions (Solved Question 3) 06:09
- Static Functions in C 04:41
- Static and Dynamic Scoping (Part-1) 11:34
- Static and Dynamic Scoping (Part-2) 08:29
- Static and Dynamic Scoping (Part-3) 05:05
- Static and Dynamic Scoping (Part-4) 06:00
- Static and Dynamic Scoping (Solved Question 1) 03:12
- Static and Dynamic Scoping (Solved Question 2) 05:27
- Recursion in C 11:12
- How to write Recursive Functions 09:03
- Types of Recursion (Part 1) | Direct & Indirect Recursion 09:45
- Types of Recursion (Part 2) | Tail & Non-tail Recursion 13:13
- Advantage and Disadvantage of Recursion 05:01
- Recursion (Solved Problem 1) 06:49
- Recursion (Solved Problem 2) 06:33
- Recursion (Solved Problem 3) 04:31
- Recursion (Solved Problem 4) 10:37
- Recursion (Solved Problem 5) 06:29
- C Programming (Rapid Fire Quiz-2) 05:31
- Definition of Array 05:24
- Declaration of Array 04:43
- Accessing Array Elements 05:19
- Initializing an Array 06:32
- Designated Initialization of Arrays 06:22
- Arrays in C (Solved Problem 1) 04:08
- Arrays in C (Solved Problem 2) 10:03
- Counting Array Elements using sizeof() Operator 04:05
- Introduction to Multidimensional Arrays 03:03
- Introduction to Two-Dimensional (2D) Arrays 10:20
- Introduction to Three-Dimensional (3D) Arrays 07:59
- Multidimensional Arrays (Solved Problem) 05:21
- C Program for Matrix Multiplication (Part 1) 06:29
- C Program for Matrix Multiplication (Part 2) 08:19
- Constant Arrays in C 02:08
- Variable Length Arrays in C 03:57
- Introduction to Pointers in C 02:52
- Declaring & Initializing Pointers in C 04:08
- Value of Operator in Pointers 05:44
- Pointer Assignment 04:00
- Pointer Application (Finding the Largest & Smallest Elements in an Array) 07:06
- Returning Pointers 05:20
- Pointers (Important Questions) 11:11
- Pointer Arithmetic (Addition) 07:10
- Pointer Arithmetic (Subtraction) 07:59
- Pointer Arithmetic (Increment & Decrement) 04:07
- Pointer Arithmetic (Comparing the Pointers) 03:18
- Pointers (Program 1) | Sum of Array Elements using Pointers 03:05
- Using Array Name as a Pointer 06:54
- Pointers (Program 2) | Reversing a Series of Numbers using Pointers 03:27
- Passing Array as an Argument to a Function 03:14
- Using Pointers to Print 2D Arrays 04:11
- Processing the Multidimensional Array Elements (or) Address Arithmetic of Multidimensional Arrays 14:31
- Pointers (Program 3) 10:55
- Pointers (Program 4) 05:34
- Pointer Pointing to an Entire Array 05:22
- Pointer Pointing to an Entire Array (Solved Problem) 06:20
- Pointers (Program 5) 02:34
- Pointers (Program 6) 07:41
- Pointers (Program 7) 05:30
- Pointers (Program 8) 11:12
- Pointers (Program 9) 06:53
- Basics of String Literals 04:05
- Storing the String Literals 03:25
- Performing Operations on String Literals 04:07
- String Literal vs. Character Constant 02:24
- Declaring and Initializing String Variables 09:02
- Writing Strings using printf and puts Functions 04:20
- Reading Strings using scanf and gets Functions 05:19
- Designing The Input Function using getchar() 09:56
- putchar() Function in C 05:00
- Strings (Solved Problem 1) 02:45
- C String Library and String Copy Function - strcpy() 09:00
- String Length Function - strlen() 03:57
- String Concatenate Functions - strcat() & strncat() 06:04
- String Comparison Function - strcmp() 06:04
- Array of Strings 04:44
- Strings (Solved Problem 2) 03:37
- Strings (Solved Problem 3) 04:35
- Strings (Solved Problem 4) 06:43
- Strings (Solved Problem 5) 06:42
- Strings (Solved Problem 6) 04:16
- Function Pointers in C 06:07
- Application of Function Pointers in C 07:11
- Introduction to Structures in C 03:54
- Declaring Structure Variables 04:14
- Structure Types (Using Structure Tags) 06:39
- Structure Types (Using typedef) 02:23
- Initializing & Accessing the Structure Members 02:59
- Designated Initialization in Structures 02:07
- Declaring an Array of Structure 03:22
- Pointer to Structure Variable 02:34
- Structure Padding in C 08:42
- Structure Packing in C 02:27
- Structures in C (Solved Problem 1) 01:28
- Structures in C (Solved Problem 2) 05:31
- Structures in C (Solved Problem 3) 02:37
- Introduction to Unions in C 06:58
- Unions in C (Solved Problem 1) 02:57
- Application of Unions (Part 1) 07:44
- Application of Unions (Part 2) 04:34
- Enumerations in C 06:46
- Program to Find Area of Rectangle Using Structures 08:53
- Structures & Unions in C (Solved Problem) 03:48
- File Handling | Chapter-14 | C Programming | nesoacademy.org 00:51
- Introduction to Programming and Data Structures 09:52
Take this course with you
Download the app to continue lessons from your phone anytime.
