Introduction:
- Concept Data Structure
- Example
- Need of Data structure
- Advantages of using DS
- Algorithm Definition
- Characteristics of algorithm
- Elements of algorithm
- Pseudocode example
- Difference of Algorithm & Pseudocode
- What is function
- Types of function
- How function works
- Function recursion and how it works.
- Concept of Array
- Types of array
- Basic Programs
- Array with Functions
- Single & 2-dimensional array in function
- argument.
- Pointer Basics
- Pointer with functions
- Call by reference
- Array of pointers & pointer to array & Programs
- Understanding about Structure
- Pointer structure variable
- Structure as function argument
- Using call by member value
- Hole structure and call by
- Passing reference of structure.
- Operations on Stack
- Array & Linked Representation
- Programs on stack
- Push & Pop operations
- Traversing.