Example Curriculum
Python Bootcamp By Mr. Vimal Daga on 25th Jan 2025_GMT20250125-051520
Available in
days
days
after you enroll
- Python Bootcamp - Session 1: CPU Performance | Polyglot Programming | Installing Anaconda | REPL | Statements | RAM | OS | Interpreters | Kernel | Variables | Data Types | Integers | Boolean | Float | Strings | f-String | Arrays | Tuples | CRUD | Lists | Operators | Loops (463:00)
- Summary Python Bootcamp Session 1
- Summary Python Bootcamp Session 2
- Summary Python Bootcamp Session 3
Python Training by Mr. Vimal Daga
Available in
days
days
after you enroll
- Session 4- List & Array |2D data |row-wise and column-wise operation|Numpy |primitive data Structure |Custom data Structure|Install NumPy |Computer Vision |Install OpenCV-Python |Click the photo|Imwrite()|imshow()|waitkey()|Create Own Image |Pixel |RGB color |2D & 3D|Crop image (126:04)
- Summary - Session 4
- Session 6 - Conditions |True & False |Operators|Multi-line comment |Boolean|End= keyword |Inline way block of code |conditional expression or ternary operator|Functional programming|Logical Operators|AND, OR & NOT |Truth table|Lazy Operator |IN Operator (109:03)
- Summary - Session 6
- Summary Session 7
- Session 7 - program file |Process|Run time |Data sources |Speech Recognize |Mic |Pyaudio |Google Speech Recognize |Microphone function |Recognizer function |listen function |Context manager|With keyword|Create a Speech Recognize program|Timeout concept|loop |While loop |Break keyword (116:31)
- Session 8 - Iteration |While loop|For Loop |Append function |In keyword|Index number |Dir function |iterator|Indentation Error|pass keyword |iterable|Pointer |__next__ function |Extract Data|ETL Concept |Inline list with for loop |List comprehension (113:57)
- Summary - Session 8
- Session 10 - Generator | Function | Stack memory | Return keywords | Yield keyword | while loop | For loop | Append (118:40)
- Summary - Session 10
- Session 11 - Time Complexity |Space Complexity |Memory profiler |Inner_wrapper function|Annotation & Decorator|@ Symbol|From Keyword|Create a code for memory Space|Timeit function |Default timer function |Lambda function |This module |Inline concept |Functional Programming|filter function (131:39)
- Summary Session 11
- Session 12 - Memory | Memory Address | Python Virtual Machine (PVM) | Memory Management | Reference Concept | Mutable & Immutable | iadd Function | is Keyword | import copy | Shallow Copy | Deep Copy | Garbage | Ctype Module CPython | Memory Interning | Cvzone | Click Photo (108:45)
- Summary session 12
- Summary Session 14
- Session 14 - Function | Stack Memory | Namespace | Tuple | Dictionaries (121:19)
- Session 15 - Module | Standard | Built-in | Package | C-extension | Binary Code | import sys | import numpy | sys.path (106:15)
- Summary Session 15
- Session 16 - Concurrency | Parallelism | Optimization | Context-switching | Threads | Processes | I/O-bound | Efficiency | Multitasking | Threading module | Threading module | current_thread() | start() method | PID (Process ID) (134:52)
- Summary Session 16
- Session 17 - Threads | CPUs | Parallelism | Global Interpreter Lock | Threading Model | Multi-Threading and GIL | Locking | Global Variables | Race Conditions | Locks and Deadlocks (144:19)
- Summary Session 17
- Session 18 - Parallelism | CPU-intensive | Core-utilization | GIL-bypass | Process-based | Simultaneous | Independence | Efficiency | Separation | Scalability | Memory-isolation | Non-shared | Deadlock-prevention | Race-condition-avoidance | Performance-boost (81:43)
- Summary Session 18
- Session 19 - Multiprocessing | Parallelism | Data Handling | Shared Memory | Queue | Pipe | CPU Affinity | cpu_count() | Process Creation | Lock | Value | Process Explorer | Memory Space | Data Sharing | Race Condition | GIL | Locking Strategy | Context Manager (95:25)
- Summary Session 19
OOPs (Object-Oriented Programming) concepts Session By Mr. Vimal Daga
Available in
days
days
after you enroll
Data Structure & Algorithms (DSA) with Mr. Vimal Daga
Available in
days
days
after you enroll
- Session 1 - Concurrent users | Traffic patterns | Scalability | Server limits | Automation | System design | Tsunami effect | Infra mgmt | Problem-solving | Performance optimization | Full-stack dev | DevOps | SRE | ML | MLOps | GenAIOps | DevSecOps | Efficiency | Resource & time optimization | (118:53)
- Summary Session 1
- Session 2 - Data structures | Algorithms | Optimization | Profit | Resource mgmt | Time complexity | Big O | Algorithmic thinking | Pseudo code | Programming | Worst-case | Constant time | Problem-solving | Efficiency | Scalability | Performance | Cost reduction | Automation | System design (134:23)
- Summary Session 2
- Session 3 - Problem-solving | Algorithm | Runtime | RAM | CPU | Servers | Optimization | Space Complexity | Time Complexity | Efficiency | Cost | Performance | Execution | Process | Resources | Function | Analysis | Solid Principle | Modularity | Compute Device (125:10)
- Summary Session 3
- Session 4 - Algorithms & Functions | Time Complexity (Big O) | Loops in Python (Iteration & Recursion) | Using range() in for loops | Efficient Programming | Constant Time O(1) | Variable Time O(n) | Resource Planning (Hotstar Example) | Time Complexities (O(1), O(n), O(n²)) | Problem-Solving (140:34)
- Summary Session 4
- Session 5 - Natural Number Sum | Real-world Problem Mapping | Identifying Patterns | Loop Implementation | Pseudocode Writing | Variable Naming | Time Complexity (Big O) | Function Optimization | Jupyter Magic Commands | Arithmetic Progression Formula (116:13)
- Summary Session 5
- Session 6 - Algorithmic Thinking | Iteration vs. Recursion | Function Design & Modularity | Direct & Indirect Recursion | Base Conditions in Recursive Functions (111:46)
- Summary Session 6
- Summary Session 7
- Summary Session 8
- Summary Session 9
- Summary Session 10
- Summary Session 11
- Summary Session 12
- Summary Session 13
- Summary Session 14
- Summary Session 15
- Summary Session 16
- Summary Session 17
DSA Extra Session
Available in
days
days
after you enroll
- Session 1 - Linear Search Algorithm | Best Case Scenario | Worst Case Scenario | Pre- created Algorithms | Unordered Array of data | Exit Code | Return Keyword | Garbage Value| Upperbound Value (109:09)
- Session 1 - Summary
- Session 2 - Linear Search | Traversal | Length of the data | Stack Memory | Pointers | Big O(n) | Big O(1) | Best Case Scenario | Worst Case Scenario (120:41)
- Session 2 - Summary
- Session 3 - Compile Time | Run Time | Static & Dynamic Memory Allocation | Stack vs Heap Memory | Organizing Data | Arrays | Data Structures | Continuous vs Non-continuous Storage | Linked List | C Demo: printf, scanf, stdio.h | Pointers | Array Access Time | Big O Notation (98:46)
- Session 3 - Summary
- Session 4 - Heap Memory | Stack Memory | Mallock Function | Dereferencing | Static Memory Allocation | Dynamic Memory Allocation | Compile Time | Allocation at Run Time | Stack Frame | Dynamic Array (126:37)
- Session 4 - Summary
- Session 5 - Access data value after function finished | Pointer to pointer or Double pointer | Use of * and ** in Double pointer | Use case of double pointer | Allocate heap memory using function | Allocation heap memory for array in C++ | De-allocation heap memory for array in C++ (126:15)
- Session 5 - Summary
- Session 6 - Member Access Operator | Static array | Dynamic array | Algorithm for extending dynamic array (117:44)
- Session 6 - Summary
- Session 7 - Class Template | More than one argument to templates | Create Dynamic array in heap memory (126:40)
- Session 7 - Summary
- Session 8 - STL (Standard Template Library) |Time Complexity | Extend Array | Append Data | CPU Time | POP | Vector | Capacity Function | push_back | Size Function " (116:20)
- Session 8 - Summary
- Session 9 - Create dynamic array | Vector | Traversal Operation | Iterator Class | push_back keyword | itr object | foreach loop | Challenges in array (102:49)
- Session 9 - Summary
- Session 10 - Limitation of Array| OutOfMemory Exception | Continuous way | Non-continuous way | Linked List | Node | Self-referencing class (131:59)
- Session 10 - Summary
- Session 11 - Insertion Operation on Array | Time Complexity of Insertion Operation on Array | Insertion Operation on Linked List | Time Complexity (Best Case Scenario) of Insertion Operation on Linked List | Time Complexity (Worst Case Scenario) of Insertion Operation on Linked List (106:34)
- Session 11 - Summary
