Learn · Problem Solving through Programming in C
Lecture 58 of 61Week 12
Lecture 58 : Pointer
Prof. Anupam Basu · IIT Kharagpur
Credits and licence
- From
- Problem Solving through Programming in C, IIT Kharagpur (at NPTEL)
- Licence
- CC BY-NC-SA, as NPTEL states it. Non-commercial use only.
- Attribution
- NPTEL states: "Distributed under Creative Commons Attribution-ShareAlike / CC BY - NC - SA", beside a BY-NC-SA badge.
- Who can watch
- Tweens profiles and older. How courses are placed
All the lectures
- Lecture 1 : Introduction
- Lecture 2: Idea of Algorithms
- Lecture 3: Flow Chart and Pseudocode
- Lecture 4 : Introduction to Programming Language Concepts
- Lecture 5 : Variables and Memory
- Lecture 6 : Types of Software and Compilers
- Lecture 7: Introduction to C Programming Language
- Lecture 8 : Variables and Variable Types in C
- Lecture 9 : Introducing Functions
- Lecture 10 : Address and Content of Variables and Types
- Lecture 11 : Assignment Statement and Operators in C
- Lecture 12 : Arithmetic Expressions and Relational Expressions
- Lecture 13 : Logical Operators and Change in Control Flow
- Lecture 14 : Use of Logical Operators in Branching
- Lecture 15 : Branching : IF - ELSE Statement
- Lecture 16: IF-ELSE Statement (Contd.)
- Lecture 17: Switch statement
- Lecture 18: Switch Statement (Contd.) and Introduction to Loops
- Lecture 19: Implementing Repetitions (Loops)
- Lecture 20: Implementation of Loops with for Statement (Contd.)
- Lecture 21: For Statement (Contd.)
- Lecture 22: Example of If-Else
- Lecture 23 : Example of Loops
- Lecture 24 : Example of Loops (Contd.)
- Lecture 25 : Example of Loops (Contd.), Use of FOR Loops
- Lecture 26: Introduction to Arrays
- Lecture 27: Arrays (Contd.)
- Lecture 28: Arrays (Contd.)
- Lecture 29: Program using Arrays
- Lecture 30: Array Problem
- Lecture 31 : Linear Search
- Lecture 32 : Character Array and Strings
- Lecture 33 : String Operations
- Lecture 34 : 2-D Array Operation
- Lecture 35 : Introducing Functions
- Lecture 36: More on Functions
- Lecture 37: Function (Contd.)
- Lecture 38: Scanf and Printf Functions; Function Prototype
- Lecture 39 : Parameter Passing in Function Revision
- Lecture 40: Parameter Passing in Function Revision (Contd.)
- Lecture 41: Substitution of # include and Macro
- Lecture 42: "search" as a function
- Lecture 43: Binary Search
- Lecture 44: Binary Search (Contd.)
- Lecture 45: Sorting Methods
- Lecture 46: Bubble Sort (Contd.)
- Lecture 47: Use of Pointer in Function : Context Bubble Sort
- Lecture 48: Arrays at Strings
- Lecture 49: Data Representation
- Lecture 50: Bisection Method
- Lecture 51 : Interpolation
- Lecture 52 : Trapezoidal Rule and Runge-Kutta Method
- Lecture 53 : Recursion
- Lecture 54 : Recursion(Contd.)
- Lecture 55 : Structure
- Lecture 56 : Structure (Contd.)
- Lecture 57 : Structure with typedef
- Lecture 58 : Pointer
- Lecture 59 : Pointer (Contd.)
- Lecture 60 : Pointer in Structures
- Lecture 61 : Dynamic Allocation and File