IIT Kharagpur · Computer Science

Problem Solving through Programming in C

Prof. Anupam Basu · 2026 · 61 free video lectures

This course is aimed at enabling the students to Formulate simple algorithms for arithmetic and logical problems Translate the algorithms to programs (in C language) Test and execute the programs and correct syntax and logical errors Implement conditional branching, iteration and recursion…

▶ Play on Open Lecture HallCourse page ↗

Lectures

  1. Lecture 1 : Introduction
  2. Lecture 2: Idea of Algorithms
  3. Lecture 3: Flow Chart and Pseudocode
  4. Lecture 4 : Introduction to Programming Language Concepts
  5. Lecture 5 : Variables and Memory
  6. Lecture 6 : Types of Software and Compilers
  7. Lecture 7: Introduction to C Programming Language
  8. Lecture 8 : Variables and Variable Types in C
  9. Lecture 9 : Introducing Functions
  10. Lecture 10 : Address and Content of Variables and Types
  11. Lecture 11 : Assignment Statement and Operators in C
  12. Lecture 12 : Arithmetic Expressions and Relational Expressions
  13. Lecture 13 : Logical Operators and Change in Control Flow
  14. Lecture 14 : Use of Logical Operators in Branching
  15. Lecture 15 : Branching : IF - ELSE Statement
  16. Lecture 16: IF-ELSE Statement (Contd.)
  17. Lecture 17: Switch statement
  18. Lecture 18: Switch Statement (Contd.) and Introduction to Loops
  19. Lecture 19: Implementing Repetitions (Loops)
  20. Lecture 20: Implementation of Loops with for Statement (Contd.)
  21. Lecture 21: For Statement (Contd.)
  22. Lecture 22: Example of If-Else
  23. Lecture 23 : Example of Loops
  24. Lecture 24 : Example of Loops (Contd.)
  25. Lecture 25 : Example of Loops (Contd.), Use of FOR Loops
  26. Lecture 26: Introduction to Arrays
  27. Lecture 27: Arrays (Contd.)
  28. Lecture 28: Arrays (Contd.)
  29. Lecture 29: Program using Arrays
  30. Lecture 30: Array Problem
  31. Lecture 31 : Linear Search
  32. Lecture 32 : Character Array and Strings
  33. Lecture 33 : String Operations
  34. Lecture 34 : 2-D Array Operation
  35. Lecture 35 : Introducing Functions
  36. Lecture 36: More on Functions
  37. Lecture 37: Function (Contd.)
  38. Lecture 38: Scanf and Printf Functions; Function Prototype
  39. Lecture 39 : Parameter Passing in Function Revision
  40. Lecture 40: Parameter Passing in Function Revision (Contd.)
  41. Lecture 41: Substitution of # include and Macro
  42. Lecture 42: "search" as a function
  43. Lecture 43: Binary Search
  44. Lecture 44: Binary Search (Contd.)
  45. Lecture 45: Sorting Methods
  46. Lecture 46: Bubble Sort (Contd.)
  47. Lecture 47: Use of Pointer in Function : Context Bubble Sort
  48. Lecture 48: Arrays at Strings
  49. Lecture 49: Data Representation
  50. Lecture 50: Bisection Method
  51. Lecture 51 : Interpolation
  52. Lecture 52 : Trapezoidal Rule and Runge-Kutta Method
  53. Lecture 53 : Recursion
  54. Lecture 54 : Recursion(Contd.)
  55. Lecture 55 : Structure
  56. Lecture 56 : Structure (Contd.)
  57. Lecture 57 : Structure with typedef
  58. Lecture 58 : Pointer
  59. Lecture 59 : Pointer (Contd.)
  60. Lecture 60 : Pointer in Structures
  61. Lecture 61 : Dynamic Allocation and File

From NPTEL (IITs and IISc) · CC BY-NC-SA. More from IIT Kharagpur.

Open Lecture Hall is free, with no ads and no sign-up. It is not run by or connected to any university; the lectures are the universities' own free recordings, played from where they host them. About & rights