Forwarded from Immersive Ai
i do...
Vibe Coding.
Vibe Marketing
Vibe Meeting
Vibe walking.
Vibe emailing.
Vibe Posting
.
.
.
Vibe Breathing.
.
Vibe Living 😊
What else ?
Vibe Coding.
Vibe Marketing
Vibe Meeting
Vibe walking.
Vibe emailing.
Vibe Posting
.
.
.
Vibe Breathing.
.
Vibe Living 😊
What else ?
Forwarded from Immersive Ai
New Video : Ai for Learning.
How to use AI for Learning ?
https://youtu.be/TiYvF1nHpDk?si=flHs_pItXMUARlcg
How to use AI for Learning ?
https://youtu.be/TiYvF1nHpDk?si=flHs_pItXMUARlcg
YouTube
AI Tricks Every Student Should Know! | Ai ለተማሪዎች | AI ለ ትምህርት | Ai for Learning #ai #learning
Ready to supercharge your studies? Discover how AI can transform the way you learn! In this video, we explore the best AI tools and strategies for students, from personalized study plans and homework help to research, writing, and exam prep.
Learn how to…
Learn how to…
❤4
Forwarded from Muhammed Teshome
ምን እንማር ለሚሉ ብዙዎች አሪፍ ጥቆማ ናት!
Are you a student and trying to choose what to focus on ?
Pavel : Math.
Elon : Physics.
Are you a student and trying to choose what to focus on ?
Pavel : Math.
Elon : Physics.
❤4
Stage1 – HTML
Stage2 – CSS
Stage3 – Git+GitHub
Stage4 – Build Project 👈
Stage5 – JavaScript
Stage6 – API
Stage7 – Build Project 👈
Stage8 – React VueJS Svelte Angular
Stage9 – Build Project 👈
Stage10 – Node.js PHP Python Go Rust
Stage11 –Build Project 👈
Stage12 - Frameworks: NextJS Django Laravel...
Stage13 – MongoDB MySQL || Postgres
Stage14 – Build Project 👈
🏆 – Full Stack developer
Stage2 – CSS
Stage3 – Git+GitHub
Stage4 – Build Project 👈
Stage5 – JavaScript
Stage6 – API
Stage7 – Build Project 👈
Stage8 – React
Stage9 – Build Project 👈
Stage10 – Node.js
Stage11 –Build Project 👈
Stage12 - Frameworks: NextJS
Stage13 – MongoDB
Stage14 – Build Project 👈
🏆 – Full Stack developer
❤11👍2😁1
የ ሰመር ኮርስ ምዝገባ ጀምረናል!
በ ብዙዎች ጥያቄ መሰረት 2ኛ ዙር የ ሰመር ኮርስ ምዝገባ ጀምረናል።
በ ቅርቡ ክላስ ስለምንጀመር ቀድመው ይመዝገቡ!
የምንሰጣቸው ኮርሶች ፡
1. Full stack Development ( MERN ) ( 6 month program )
2. Python Programming ( 3 month Program)
3. AI Fluency ( 2 week program )
ሙሉ መረጃውን በ ሊንኩ ታገኛላችሁ!
የምትፈልጉ ቶሎ ተመዝገቡ!
https://docs.google.com/forms/d/e/1FAIpQLSdqRDPDvNMO1W4InBGYYuB_BQ9INvhcMhuC29gQWMyEKLetfQ/viewform?usp=dialog
በ ብዙዎች ጥያቄ መሰረት 2ኛ ዙር የ ሰመር ኮርስ ምዝገባ ጀምረናል።
በ ቅርቡ ክላስ ስለምንጀመር ቀድመው ይመዝገቡ!
የምንሰጣቸው ኮርሶች ፡
1. Full stack Development ( MERN ) ( 6 month program )
2. Python Programming ( 3 month Program)
3. AI Fluency ( 2 week program )
ሙሉ መረጃውን በ ሊንኩ ታገኛላችሁ!
የምትፈልጉ ቶሎ ተመዝገቡ!
https://docs.google.com/forms/d/e/1FAIpQLSdqRDPDvNMO1W4InBGYYuB_BQ9INvhcMhuC29gQWMyEKLetfQ/viewform?usp=dialog
❤5👍2
Forwarded from Emmersive Learning (Mehammed T.)
የ ሰመር ኮርስ ምዝገባ ጀምረናል!
በ ብዙዎች ጥያቄ መሰረት 2ኛ ዙር የ ሰመር ኮርስ ምዝገባ ጀምረናል።
በ ቅርቡ ክላስ ስለምንጀመር ቀድመው ይመዝገቡ!
የምንሰጣቸው ኮርሶች ፡
1. Full stack Development ( MERN ) ( 6 month program )
2. Python Programming ( 3 month Program)
3. AI Fluency ( 2 week program )
ሙሉ መረጃውን በ ሊንኩ ታገኛላችሁ!
የምትፈልጉ ቶሎ ተመዝገቡ!
https://docs.google.com/forms/d/e/1FAIpQLSdqRDPDvNMO1W4InBGYYuB_BQ9INvhcMhuC29gQWMyEKLetfQ/viewform?usp=dialog
በ ብዙዎች ጥያቄ መሰረት 2ኛ ዙር የ ሰመር ኮርስ ምዝገባ ጀምረናል።
በ ቅርቡ ክላስ ስለምንጀመር ቀድመው ይመዝገቡ!
የምንሰጣቸው ኮርሶች ፡
1. Full stack Development ( MERN ) ( 6 month program )
2. Python Programming ( 3 month Program)
3. AI Fluency ( 2 week program )
ሙሉ መረጃውን በ ሊንኩ ታገኛላችሁ!
የምትፈልጉ ቶሎ ተመዝገቡ!
https://docs.google.com/forms/d/e/1FAIpQLSdqRDPDvNMO1W4InBGYYuB_BQ9INvhcMhuC29gQWMyEKLetfQ/viewform?usp=dialog
❤5😁4
በ ግላችሁ computer science/ software engineering / IT ....እና መሰል ፊልዶችን የምትማሩ ይሄ ፕሌይሊስት በደንብ ይጠቅማችኋል።
ስለ ኮርሶቹ ጠቅለል ያለ overview ይሰጣችኋል!
በ ዉስጡ ወደ 11 የሚደርሱ ቪድዮዎች አሉበት፤ እነሱም፡
1. Computer Science
2. Algorithm.
3. Data Structure
4. Programming
5. Computer Architecture
6. Database
7. Computer Networking
8. Software Engineering
9. Operating System
10. Cyber Security
11. Artificial Intelligence...
Enjoy...
ስለ ኮርሶቹ ጠቅለል ያለ overview ይሰጣችኋል!
በ ዉስጡ ወደ 11 የሚደርሱ ቪድዮዎች አሉበት፤ እነሱም፡
1. Computer Science
2. Algorithm.
3. Data Structure
4. Programming
5. Computer Architecture
6. Database
7. Computer Networking
8. Software Engineering
9. Operating System
10. Cyber Security
11. Artificial Intelligence...
Enjoy...
❤17
Emmersive Learning
7 must-know runtime complexities for coding interviews:
7 must-know runtime complexities for coding interviews:
1. 𝐎(1) - 𝐂𝐨𝐧𝐬𝐭𝐚𝐧𝐭 𝐭𝐢𝐦𝐞
- The runtime doesn't change regardless of the input size.
- Example: Accessing an element in an array by its index.
2. 𝐎(𝐥𝐨𝐠 𝐧) - 𝐋𝐨𝐠𝐚𝐫𝐢𝐭𝐡𝐦𝐢𝐜 𝐭𝐢𝐦𝐞
- The runtime grows slowly as the input size increases. Typically seen in algorithms that divide the problem in half with each step.
- Example: Binary search in a sorted array.
3. 𝐎(𝐧) - 𝐋𝐢𝐧𝐞𝐚𝐫 𝐭𝐢𝐦𝐞
- The runtime grows linearly with the input size.
- Example: Finding an element in an array by iterating through each element.
4. 𝐎(𝐧 𝐥𝐨𝐠 𝐧) - 𝐋𝐢𝐧𝐞𝐚𝐫𝐢𝐭𝐡𝐦𝐢𝐜 𝐭𝐢𝐦𝐞
- The runtime grows slightly faster than linear time. It involves a logarithmic number of operations for each element in the input.
- Example: Sorting an array using quick sort or merge sort.
5. 𝐎(𝐧^2) - 𝐐𝐮𝐚𝐝𝐫𝐚𝐭𝐢𝐜 𝐭𝐢𝐦𝐞
- The runtime grows proportionally to the square of the input size.
- Example: Bubble sort algorithm which compares and potentially swaps every pair of elements.
6. 𝐎(2^𝐧) - 𝐄𝐱𝐩𝐨𝐧𝐞𝐧𝐭𝐢𝐚𝐥 𝐭𝐢𝐦𝐞
- The runtime doubles with each addition to the input. These algorithms become impractical for larger input sizes.
- Example: Generating all subsets of a set.
7. 𝐎(𝐧!) - 𝐅𝐚𝐜𝐭𝐨𝐫𝐢𝐚𝐥 𝐭𝐢𝐦𝐞
- Runtime is proportional to the factorial of the input size.
- Example: Generating all permutations of a set.
1. 𝐎(1) - 𝐂𝐨𝐧𝐬𝐭𝐚𝐧𝐭 𝐭𝐢𝐦𝐞
- The runtime doesn't change regardless of the input size.
- Example: Accessing an element in an array by its index.
2. 𝐎(𝐥𝐨𝐠 𝐧) - 𝐋𝐨𝐠𝐚𝐫𝐢𝐭𝐡𝐦𝐢𝐜 𝐭𝐢𝐦𝐞
- The runtime grows slowly as the input size increases. Typically seen in algorithms that divide the problem in half with each step.
- Example: Binary search in a sorted array.
3. 𝐎(𝐧) - 𝐋𝐢𝐧𝐞𝐚𝐫 𝐭𝐢𝐦𝐞
- The runtime grows linearly with the input size.
- Example: Finding an element in an array by iterating through each element.
4. 𝐎(𝐧 𝐥𝐨𝐠 𝐧) - 𝐋𝐢𝐧𝐞𝐚𝐫𝐢𝐭𝐡𝐦𝐢𝐜 𝐭𝐢𝐦𝐞
- The runtime grows slightly faster than linear time. It involves a logarithmic number of operations for each element in the input.
- Example: Sorting an array using quick sort or merge sort.
5. 𝐎(𝐧^2) - 𝐐𝐮𝐚𝐝𝐫𝐚𝐭𝐢𝐜 𝐭𝐢𝐦𝐞
- The runtime grows proportionally to the square of the input size.
- Example: Bubble sort algorithm which compares and potentially swaps every pair of elements.
6. 𝐎(2^𝐧) - 𝐄𝐱𝐩𝐨𝐧𝐞𝐧𝐭𝐢𝐚𝐥 𝐭𝐢𝐦𝐞
- The runtime doubles with each addition to the input. These algorithms become impractical for larger input sizes.
- Example: Generating all subsets of a set.
7. 𝐎(𝐧!) - 𝐅𝐚𝐜𝐭𝐨𝐫𝐢𝐚𝐥 𝐭𝐢𝐦𝐞
- Runtime is proportional to the factorial of the input size.
- Example: Generating all permutations of a set.
❤4
DevOps in 10 brutal steps.
🖥 Learn Linux Basics
🧰 Master CLI Tools
📦 Understand Package Managers
🐳 Learn Docker
☸️ Dive into Kubernetes
🛠 Set Up CI/CD
🔐 Manage Secrets & Env Vars
📡 Monitor Logs & Metrics
🛡 Apply Security Best Practices
☁️ Master Cloud Platforms
🖥 Learn Linux Basics
🧰 Master CLI Tools
📦 Understand Package Managers
🐳 Learn Docker
☸️ Dive into Kubernetes
🛠 Set Up CI/CD
🔐 Manage Secrets & Env Vars
📡 Monitor Logs & Metrics
🛡 Apply Security Best Practices
☁️ Master Cloud Platforms
👏2👍1