IIT Bombay · Computer Science

An Introduction To Programming Through C++

Prof. Abhiram Ranade · 126 free video lectures

126 video lectures. Topics: Part 1: Introduction; Part 2 : Introduction; Part 3 : Introduction; Part 4 : Introduction; Part 1 : Problem Solving using Computer; Part 2 : Problem Solving using Computer; Part 3 : Problem Solving using Computer; Part 4 : Problem Solving using Computer; Part 5 : Problem…

▶ Play on Open Lecture HallCourse page ↗

Lectures

  1. Lecture 1 Part 1: Introduction
  2. Lecture 1 Part 2 : Introduction
  3. Lecture 1 Part 3 : Introduction
  4. Lecture 1 Part 4 : Introduction
  5. Lecture 2 Part 1 : Problem Solving using Computer
  6. Lecture 2 Part 2 : Problem Solving using Computer
  7. Lecture 2 Part 3 : Problem Solving using Computer
  8. Lecture 2 Part 4 : Problem Solving using Computer
  9. Lecture 2 Part 5 : Problem Solving using Computer
  10. Lecture 3 Part 1 : Basic Elements of Program
  11. Lecture 3 Part 2 : Basic Elements of Program
  12. Lecture 3 Part 3 : Basic Elements of Program
  13. Lecture 3 Part 4 : Basic Elements of Program
  14. Lecture 4 Part 1 : Program Design
  15. Lecture 4 Part 2 : Program Design
  16. Lecture 4 Part 3 : Program Design
  17. Lecture 5 : Simple cpp Graphics
  18. Lecture 6 Part 1 : Conditional Execution
  19. Lecture 6 Part 2 : Most general form of if
  20. Lecture 6 Part 3 : More general form of conditions
  21. Lecture 6 Part 4 : A somewhat large program example
  22. Lecture 6 Part 5 : Switch statement and logical data
  23. Lecture 7 Part 1 : Loops
  24. Lecture 7 Part 2 : Mark averaging
  25. Lecture 7 Part 3 : The break and continue statements
  26. Lecture 7 Part 4 : The for statement
  27. Lecture 7 Part 5 : Euclid's algorithm for GCD
  28. Lecture 7 Part 6 : Correctness proof for GCD
  29. Lecture 8 : Computing Mathematical Functions Part 1 : Taylor series
  30. Lecture 8 : Computing Mathematical Functions Part 2 : Numerical integration
  31. Lecture 8 : Computing Mathematical Functions Part 3 : Bisection Method
  32. Lecture 8 : Computing Mathematical Functions Part 4 : Newton Raphson Method
  33. Lecture 9 : Loops in various applications Part 1 : Loops in various applications brute force algorithms
  34. Lecture 9 : Loops in various applications Part 2 : Finding Pythagorean Triples
  35. Lecture 9 : Loops in various applications Part 3 : Modelling a system: bargaining
  36. Lecture 9 : Loops in various applications Part 4 : Simulating a water tank
  37. Lecture 9 : Loops in various applications Part 5 : Arithmetic on very large numbers
  38. Lecture 10 : Functions Part 1 : Basics
  39. Lecture 10 : Functions Part 2 : Examples
  40. Lecture 10 : Functions Part 3 : Reference parameters
  41. Lecture 10 : Functions Part 4 : Pointers
  42. Lecture 10 : Functions Part 5 : Graphics Objects and Lecture conclusion
  43. Lecture 11 : Recursion Part 1 : Introduction
  44. Lecture 11 : Recursion Part 2 : Recursive objects, Tree drawing
  45. Lecture 11 : Recursion Part 3 : How to think about recursion
  46. Lecture 12 : Virahanka Numbers Part 1 : Introduction
  47. Lecture 12 : Virahanka Numbers Part 2 : Recursive Program
  48. Lecture 12 : Virahanka Numbers Part 3 : Iterative Program and Conclusion
  49. Lecture 13 : Program Organization and Functions Part 1 : Introduction
  50. Lecture 13 : Program Organization and Functions Part 2 : Splitting into files
  51. Lecture 13 : Program Organization and Functions Part 3 : Namespaces
  52. Lecture 13 : Program Organization and Functions Part 4 : How to use C++ without simplecpp
  53. Lecture 14 : Advanced Features of Functions Part 1 : Introduction and passing one function to another
  54. Lecture 14 : Advanced Features of Functions Part 2 : Lambda expressions
  55. Lecture 14 : Advanced Features of Functions Part 3 : Default values to parameters
  56. Lecture 14 : Advanced Features of Functions Part 4 : Function overloading and lecture conclusion
  57. Lecture 15 : Array Part-1 : Part 1 : Introduction
  58. Lecture 15 : Array Part-1 : Part 2 : Marks averaging problem
  59. Lecture 15 : Array Part-1 : Part 3 : Histogram computation
  60. Lecture 15 : Array Part-1 : Part 4 : Marks display variation
  61. Lecture 15 : Array Part-1 : Part 5 : Polynomial multiplication
  62. Lecture 15 : Array Part-1 : Part 6 : Queues in dispatching taxis
  63. Lecture 15 : Array Part-1 : Part 7 : More efficient Queues in dispatching taxis
  64. Lecture 15 : Array Part-1 : Part 8 : Disk intersection
  65. Lecture 15 : Array Part-1 : Part 9 : Arrays of graphical objects and conclusion
  66. Lecture 16 : Array Part-2 : Part 1 : Introduction
  67. Lecture 16 : Array Part-2 : Part 2 : Interpretation of aname[index]
  68. Lecture 16 : Array Part-2 : Part 3 : Arrays and function calls
  69. Lecture 16 : Array Part-2 : Part 4 : A function to sort an array
  70. Lecture 17 : More on Arrays : Part 1 : Textual data
  71. Lecture 17 : More on Arrays : Part 2 : Functions on character strings
  72. Lecture 17 : More on Arrays : Part 3 : Two dimensional arrays
  73. Lecture 17 : More on Arrays : Part 4 : Command Line Arguments
  74. Lecture 18 : Arrays and recursion : Part 1 : Binary Search Introduction
  75. Lecture 18 : Arrays and recursion : Part 2 : Binary search analysis
  76. Lecture 18 : Arrays and recursion : Part 3 : Mergesort overview
  77. Lecture 18 : Arrays and recursion : Part 4 : Merge function
  78. Lecture 18 : Arrays and recursion : Part 5 : Mergesort conclusion
  79. Lecture 19 : Structures : Part 1 : Definition and instantiation
  80. Lecture 19 : Structures : Part 2 : Operations on structures
  81. Lecture 19 : Structures : Part 3 : An example program
  82. Lecture 19 : Structures : Part 4 : Pointers and lecture conclusion
  83. Lecture 20 : Structures Part 2 : Part 1 : Introduction to Member functions
  84. Lecture 20 : Structures Part 2 : Part 2 : Vectors from Physics
  85. Lecture 20 : Structures Part 2 : Part 3 : Taxi dispatch
  86. Lecture 21 : Classes : Part 1 : Introduction
  87. Lecture 21 : Classes : Part 2 : Constructors
  88. Lecture 21 : Classes : Part 3 : Operator overloading
  89. Lecture 21 : Classes : Part 4 : Access control
  90. Lecture 21 : Classes : Part 5 : Classes for graphics and input output
  91. Lecture 21 : Classes : Part 6 : General remarks
  92. Lecture 22 : Representing variable length entities: Part 1 : Introduction
  93. Lecture 22 : Representing variable length entities: Part 2 : Heap memory basics
  94. Lecture 22 : Representing variable length entities: Part 3 : Pitfalls of using heap memory
  95. Lecture 22 : Representing variable length entities: Part 4 : Automating memory management
  96. Lecture 22 : Representing variable length entities: Part 5 : Implementing a class with automated memory management 1
  97. Lecture 22 : Representing variable length entities: Part 6 : Implementing a class with automated memory management 2
  98. Lecture 22 : Representing variable length entities: Part 7 : Using the implemented class and conclusion
  99. Lecture 23 : The Standard Library: Part 1 : Class string
  100. Lecture 23 : The Standard Library: Part 2 : Class vector
  101. Lecture 23 : The Standard Library: Part 3 : Classes map and unordered_map
  102. Lecture 23 : The Standard Library: Part 4 : Iterators
  103. Lecture 23 : The Standard Library: Part 5 : Iterators
  104. Lecture 24 : Data structure based programming : Part 1 : Introduction
  105. Lecture 24 : Data structure based programming : Part 2 : Set and pair classes
  106. Lecture 24 : Data structure based programming : Part 3 : Implementation of standard library data structures
  107. Lecture 24 : Data structure based programming : Part 4 : Composing data structures
  108. Lecture 24 : Data structure based programming : Part 5 : typedef and lecture conclusion
  109. Lecture 25 : Medium size programs : Part 1 : The new marks display program
  110. Lecture 25 : Medium size programs : Part 2 : Manual algorithm for new marks display
  111. Lecture 25 : Medium size programs : Part 3 : RSMTAB and rest of the program
  112. Lecture 25 : Medium size programs : Part 4 : Sophisticated solutions to marks display
  113. Lecture 26 : A graphical editor and solver for circuits : Part 1 : Outline
  114. Lecture 26 : A graphical editor and solver for circuits : Part 2 : Main program and organization
  115. Lecture 26 : A graphical editor and solver for circuits : Part 3 : Mathematical representation of the circuit
  116. Lecture 26 : A graphical editor and solver for circuits Part 4 : Extensions and concluding remarks
  117. Lecture 27 : Cosmological simulation : Part 1 : Introduction and First order Euler method
  118. Lecture 27 : Cosmological simulation : Part 2 : Second order Euler method
  119. Lecture 27 : Cosmological simulation : Part 3 : The program
  120. Lecture 27 : Cosmological simulation : Part 4 : Concluding remarks
  121. Live Session 19-04-2021
  122. Live Session 12-03-2020
  123. Live Session 06-09-2019
  124. Live Session 22-10-2019
  125. Live Session 21-03-2022
  126. Live Session 04-07-2022

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

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