Learn · ARICENT: First Mile Foundation Program - Programming and Data Structure and Algorithm
Lecture 36 of 55Structures, Dynamic Memory Allocation and ADTs
Dynamic memory allocation
Prof. Shankar Balachandran and Prof. Hema A Murthy · IIT Madras
Credits and licence
- From
- ARICENT: First Mile Foundation Program - Programming and Data Structure and Algorithm, IIT Madras (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
- Introduction to Computers and Programming
- Writing your first program
- Variables, Operators and Expressions
- Variable declarations, more operators and precedence
- Input and Output Statements
- Conditionals
- Loops
- Introduction to arrays
- Working with 1D arrays
- Find prime numbers
- Debugging demo
- Multi-dimensional arrays
- Pointers
- More on pointers
- Arrays and pointer arithmetic
- Introduction to Strings
- More on Strings
- Introduction to functions
- More details on functions
- Arguments, variables and parameters
- Pass parameters by reference
- Recursive Functions
- C control structures, functional specification of programs
- Complexity Analysis using Sum and Product Rule
- Complexity Analysis of Recursive Functions
- Algorithms and Powering
- Polynomial evaluation and multiplication
- Linear and Binary Search Analysis
- Analysis of minimum and maximum in an array
- Sorting I: Insertion, Merge
- Sorting II: Counting, Radix
- Finding i-th smallest number
- Structures
- More on Structures
- Using structures and pointers to structures
- Dynamic memory allocation
- Linked List
- Brief introduction to C++: Classes and objects
- Abstract Data Types
- More on ADT
- Stacks : Last In First Out
- Queues: First In First
- Trees
- Tree Traversal
- Binary Search
- Heaps
- Graphs and Representations
- Greedy Algorithms
- Dynamic Programming
- Matrix Chain Multiplication
- Hash Tables
- Graph Algorithms: Dijkstras Algorithm and Prims Algorithm
- Graph Traversals : BFS,DFS and Articulation Points
- File I/O
- Modular Programming