Problem solving through Programming In C
5.0
(0)
5 learners
What you'll learn
This course includes
- 30.5 hours of video
- Certificate of completion
- Access on mobile and TV
Course content
1 modules • 61 lessons • 30.5 hours of video
Problem solving through Programming In C
61 lessons
• 30.5 hours
Problem solving through Programming In C
61 lessons
• 30.5 hours
- Introduction 28:27
- Idea of Algorithms 27:47
- Flow Chart and Pseudocode 32:16
- Introduction to Programming Language Concepts 34:40
- Variables and Memory 33:33
- Types of Software and Compilers 31:57
- Introduction to C Programming Language 30:50
- Variables and Variable Types in C 29:36
- Introducing Functions 28:37
- Address and Content of Variables and Types 32:52
- Assignment Statement and Operators in C 30:24
- Arithmetic Expressions and Relational Expressions 31:08
- Logical Operators and Change in Control Flow 27:28
- Use of Logical Operaotrs in Branching 32:09
- Branching IF - ELSE Statement 28:33
- IF-ELSE Statement (Contd.) 33:25
- Switch statement 26:14
- Switch Statement (Contd.) and Introduction to Loops 26:47
- Implementing Repetitions (Loops) 31:18
- Implementation of Loops with for Statement (Contd.) 31:00
- For Statement (Contd.) 27:26
- Example of If-Else 34:41
- Example of Loops 27:53
- Example of Loops (Contd.) 23:38
- Example of Loops (Contd.), Use of FOR Loops 30:25
- Introduction to Arrays 27:33
- Arrays (Contd.) 28:47
- Arrays (Contd1.) 31:12
- Program using Arrays 30:12
- Array Problem 28:24
- Linear Search 34:11
- Character Array and Strings 39:26
- String Operations 32:49
- 2-D Array Operation 26:33
- Introducing Functions 33:26
- More on Functions 32:08
- Function (Contd.) 34:52
- Scanf and Printf Functions; Function Prototype 30:00
- Parameter Passing in Function Revision 38:37
- Parameter Passing in Function Revision (Contd.) 37:21
- Substitution of # include and Macro 31:26
- search as a function 29:43
- Binary Search 27:23
- Binary Search (Contd.) 28:58
- Sorting Methods 31:08
- Bubble Sort (Contd.) 30:56
- Use of Pointer in Function Context Bubble Sort 22:26
- Arrays at Strings 36:29
- Data Representation 29:48
- Bisection Method 35:44
- Interpolation 26:21
- Trapezoidal Rule and Runge-Kutta Method 30:39
- Recursion 27:22
- Recursion(Contd.) 18:39
- Structure 27:18
- Structure (Contd.) 26:27
- Structure with typedef 25:50
- Pointer 27:57
- Pointer (Contd.) 25:38
- Pointer in Structures 24:24
- Dynamic Allocation and File 36:34
