C : Programming Language 52

• Lecture1.1
  Introduction: CPU, Program & Programming Language
• Lecture1.2
  First C Program: Edit, Compile & Run on IDE
• Lecture1.3
  C Program to multiply two polynomials
• Lecture1.4
  Variables, Operators & Operator Precedence
• Lecture1.5
  I/O Statements: printf, scanf, Compound Statements
• Lecture1.6
  Conditional Statements: if, if else, cascading if, switch
• Lecture1.7
  Loops in C: for, nested for, while, do-while loop
• Lecture1.8
  Arrays in C: Explained with Examples
• Lecture1.9
  Working with Arrays in C: Explained with Examples
• Lecture1.10
  Arrays: C program to find prime numbers
• Lecture1.11
  Debugging in C | Dev C++ IDE Demo
• Lecture1.12
  Multi-dimensional Arrays, Matrices, Matrix Operations
• Lecture1.13
  Pointers in C: Explained with Example
• Lecture1.14
  Null Pointer, Typecasting, Pointer Arithmetic
• Lecture1.15
  Arrays and Pointers | Pointer arithmetic
• Lecture1.16
  Strings: Initializing, Reading & Printing strings
• Lecture1.17
  String Functions: Length, Copy, Concatenation, Compare
• Lecture1.18
  Functions in C Language: Example
• Lecture1.19
  Functions: definition, prototype, call, control flow
• Lecture1.20
  Call by Value & Call by Reference
• Lecture1.21
  Swap values of two Variables | Printing Arrays
• Lecture1.22
  Recursive Functions, recursion | factorial of a number
• Lecture1.23
  Control Structures, Functions, Arrays, Recursive Data Structures
• Lecture1.24
  Complexity Analysis: Big-O, Big Omega Notation, Sum & Product Rule
• Lecture1.25
  Complexity Analysis of Recursive Functions
• Lecture1.26
  What is an algorithm? Its Correctness and efficiency
• Lecture1.27
  Polynomial Evaluation & Multiplication: Direct, Horner’s, Karatsuba’s Method
• Lecture1.28
  Searching: Linear & Binary Search Explained With Example
• Lecture1.29
  Finding minimum & maximum in an array, Simultaneous min & max
• Lecture1.30
  Sorting: Insertion sort, Merge sort | Program & Algorithm in C
• Lecture1.31
  Sorting Algorithms: Counting & Radix sort | Explained With Example
• Lecture1.32
  Find i-th smallest number in a list of numbers
• Lecture1.33
  structure in C, Nested structures, typedef
• Lecture1.34
  Operations on Structure, Arrays of Structures
• Lecture1.35
  Pointers to structures, Precedence & association
• Lecture1.36
  Dynamic memory allocation in C – malloc, calloc, free: Example
• Lecture1.37
  Linked List in C: Insert, Find & Delete a Node, Printing elements
• Lecture1.38
  A Brief Introduction to C++
• Lecture1.39
  Data Types & Abstract Data Types(ADT)
• Lecture1.40
  Abstract Data Types: List ADT & Operations
• Lecture1.41
  Stack Data Structure: push,pop Operations | Array Implementation of stacks
• Lecture1.42
  Queues: Implementation Using Linked Lists, Arrays & Circular Arrays
• Lecture1.43
  Data Structures in C: Introduction to Trees & Binary Trees
• Lecture1.44
  Binary Tree Traversal: preorder, postorder, inorder
• Lecture1.45
  Data Structures: Binary Search Tree (BST) Explained With Example
• Lecture1.46
  Heaps Data Structures: Create, Insert, Delete & its Implementation
• Lecture1.47
  Data Structures: Introduction to Graphs
• Lecture1.48
  Introduction to Greedy Algorithms
• Lecture1.49
  Introduction to Dynamic programming
• Lecture1.50
  Matrix Chain Multiplication Explained: Example
• Lecture1.51
  Hash Table Explained with Example
• Lecture1.52
  Dijkstra’s Shortest Path Algorithm & Prim’s Minimum Spanning Tree
• Lecture1.53
  Graph Traversals: Breadth First Search, Depth First Search | BFS & DFS
• Lecture1.54
  File IO in C: Open, Read, Write & Close a File | Programming Example
• Lecture1.55
  Introduction to Modular/ Structured Programming in C