Mastering Data Structures & Algorithms using C and C++

Explore arrays in C and C++, create and initialize arrays, access elements by index, and practice with for loops and for each loops to understand memory usage and zero initialization.

Explore pointers in c and c++, including declaration, address-of, and dereferencing. Demonstrate heap allocation with malloc and new, and deallocation with free and delete; pointer sizes on 64-bit systems.

Access and modify a structure's members using a pointer and the arrow operator. Allocate a structure on the heap with malloc and cast, then set its length and breadth.

Demonstrate pointers to a structure by accessing length and breadth with dot and arrow operators. Note heap allocation with malloc and new, and printing with printf or cout.

Explore modular programming with functions, including prototypes, declarations, and definitions, and learn about actual versus formal parameters and pass by value, address, and reference.

Learn to implement and use functions in C and C++, including creating an add function that takes two integers, computes a sum, and demonstrates parameter passing and return values.

Explore parameter passing methods in C and C++: pass by value, pass by address with pointers, and pass by reference in C++ with a swap example.

Learn how arrays are passed as parameters in C and C++ by address. See how a function can modify original array and return array via a pointer allocated on heap.

Practice array as parameter: learn pass by address, why you pass size, and how pointers and for loops access elements. See memory returns by creating and returning a heap-allocated array.

Explore passing a structure as a parameter in C and C++. Compare call by value, call by reference, and call by address with rectangle and area calculation, including array handling.

Convert a C program to C++ by turning a rectangle struct into a class with private data and public constructors and methods, enabling object initialization and area computation.

Demonstrates the monolithic programming style by building a simple C/C++ program that reads length and breadth and computes area and perimeter of a rectangle.

Break a monolithic program into modular, procedural components by creating area and perimeter functions that take length and breadth as parameters, return results, and let main handle user interaction.

Demonstrate a C++ rectangle class with private length and breadth, including default and parameterized constructors, area and perimeter methods, mutator and accessor functions, and a destructor.

Explore how template classes enable a single arithmetic class to operate over any data type, performing add and subtract with int, float, or double.

Convert a concrete arithmetic class into a generic template class in C++, using this pointer and scope resolution to implement template methods, enabling support for int, float, and char types.

Install CodeBlocks with MinGW, then create a console C++ project, edit main.cpp, build and run to see a hello world program.

Learn to download and install Dev-C++, set up MinGW, enable debugging with -G, enable C++11 with -std=c++11, then create a console project and run a Hello World program.

Master using the code blocks debugger to trace a C++ program line by line, set breakpoints and watches, and verify the sum of array elements.

Explore recursion in C by implementing a tail recursive function and comparing it with head recursion, observing stack usage, debugging with breakpoints, and printing behavior on return.

Code a recursive Taylor series for e^x in C/C++, using p and f to manage powers and factorials. Show improved accuracy with more terms and validate against a calculator.

Implement a recursive Taylor series for e^x using Horner's rule in C and C++. Handle double precision and avoid integer division with typecasting, and verify results by printing the output.

implement factorial-based and recursive nCr calculations in c and c++, building a factorial function, a nonrecursive nCr, and a recursive nCr with integer results.

This demo shows increasing a heap array by allocating a larger block with malloc, copying values from p to q, freeing p, and reassigning p to q with q null.

Explore three ways to create two-dimensional arrays in C: stack-allocated 3x4 arrays, heap-allocated rows via an array of pointers, and a double-pointer approach with malloc, including printing and garbage values.

Explore array addressing in two-dimensional layouts, including base address calculations, pointer arithmetic, and row-major versus column-major mapping, with deducing data type and dimensions from stepwise evaluation.

Demonstrates implementing an array ADT in C and C++ by defining a structure with size, length, and a heap-allocated A, reading elements, and displaying them.

Implement a delete operation on an array by index, shifting elements and updating the length. Return the deleted value and validate the index, illustrating the process in main.

Learn to insert an element into a sorted array, verify if an array is sorted, and rearrange negatives and positives using a single in-place algorithm in C and C++.

Merge two sorted lists into a single sorted array using i, j, and k pointers, handle remaining elements, and achieve theta(m+n) time complexity.

Demonstrate merging two arrays into a new heap-allocated array using a merge function, comparing elements and appending leftovers to produce a sorted result.

Demonstrate union, intersection, and difference on sorted and unsorted arrays using a merge-based approach, with a single C and C++ project implementing set operations.

Convert a C array program into a C++ class named Array, using dynamic memory, constructors, and destructor. Organize code with private data and public member functions for array operations.

Learn to implement a dynamic C++ array as a class with constructors, destructor, and insert, delete, display functions, then convert it to a template for generic types.

Study method 2 for finding missing elements by marking a hash-like array (bitset) of size equal to the max element, then scanning for zeros to reveal absent numbers.

Master how to find duplicates in a sorted array using a hash table, counting each element's occurrences, and display duplicates with their counts in linear time.

Find pairs in a sorted array whose sum equals a target using left and right pointers. Move pointers based on the sum, print matches, and run in linear time.

Find max and min in a single scan by updating min and max per element and skipping the max check when a value is smaller than min. Demonstrates linear time.

Explore how ASCII codes define characters and how C handles character arrays and strings with a null terminator. Learn to declare, initialize, print, and read strings.

Learn to change string case using ascii codes, converting uppercase to lowercase and vice versa, and toggling case with a for loop and 32 difference.

Validate a string by ensuring only alphabets and digits are allowed, rejecting any special characters. Learn two methods—simple character checks and regular expressions—in C and C++.

Explore two methods to reverse a string in C and C++: copy into a separate array using a reverse loop, and perform in-place swapping with two indices.

Learn how to compare two strings, determine dictionary order, and check palindromes using character-by-character comparison and case-insensitive options, with practical C/C++ examples.

Identify duplicates of letters in a string by comparing characters and counting with a 26-slot hash table using ASCII codes; note a bit-based method is coming next.

Implement a lower triangular matrix in C using row major and column major representations, with dynamic memory, set, get, and display functions, and keyboard input for dimensions and elements.

The lecture demonstrates how to build a menu driven matrix program using functions, with create, get, set, and display operations, using an array and a dimension n.

Learn to implement C++ classes for diagonal and lower triangular matrices, with heap-allocated storage, constructors/destructors, and a menu-driven program to create, display, and access elements.

Learn to implement a sparse matrix in C by defining element and sparse structures, reading dimensions and non-zero elements, allocating memory, and displaying the full matrix.

Implement a C function add that sums two sparse matrices by address, allocates the sum on the heap with malloc, and merges nonzero elements by row and column.

Explore polynomial representation and evaluation in C and C++ by defining term and poly structures, dynamically allocating memory, and reading, displaying, and adding polynomials with pointer-based functions.