The roadmap to learning CSS
1. Inline, internal and external CSS
2. Selectors
3. Background
4. Color
5. Box model
6. Height and width
7. Margin and padding
8. Border
9. Positioning
10. display
11. Layouts
12. Grid and Flex
13. Alignment
14. Fonts
15. Animation
16. Pseudo-classes
17. Media query
https://www.youtube.com/watch?v=XKNSgDL3xgM
1. Inline, internal and external CSS
2. Selectors
3. Background
4. Color
5. Box model
6. Height and width
7. Margin and padding
8. Border
9. Positioning
10. display
11. Layouts
12. Grid and Flex
13. Alignment
14. Fonts
15. Animation
16. Pseudo-classes
17. Media query
https://www.youtube.com/watch?v=XKNSgDL3xgM
YouTube
CSS Full Course in #Amharic: የ CSS ሙሉ ኮርስ ከመጀመሪያ እስከ መጨረሻ (Complete Beginner to Advanced)
Welcome to the Complete CSS Full Course in Amharic! 🎨 In this course, you will learn how to style websites and make them visually stunning. CSS (Cascading Style Sheets) is a crucial skill for web development, and this course will help you master it step by…
❤2
The roadmap to learning JavaScript
1. Print statement
2. Data types and variables
3. Basic operators
4. Logical operators
5. Comparisons
6. Loops and statements
7. alert()
8. prompt()
9. Arrays
10. Objects
11. Functions
12. Arrow function
13. Array methods
14. Hoisting
15. Closures
16. Callbacks
17. Promises
18. Async & Await
19. Currying
20. And other ES6 feature
https://www.youtube.com/watch?v=jF5oxeeuu6E
1. Print statement
2. Data types and variables
3. Basic operators
4. Logical operators
5. Comparisons
6. Loops and statements
7. alert()
8. prompt()
9. Arrays
10. Objects
11. Functions
12. Arrow function
13. Array methods
14. Hoisting
15. Closures
16. Callbacks
17. Promises
18. Async & Await
19. Currying
20. And other ES6 feature
https://www.youtube.com/watch?v=jF5oxeeuu6E
YouTube
JavaScript Full Course in #Amharic: የ JS ሙሉ ኮርስ ከመጀመሪያ እስከ መጨረሻ (Complete Beginner to Advanced)
Welcome to the Complete JavaScript Full Course in Amharic! 🚀 This course is designed to teach you JavaScript, the programming language that powers the web. Whether you're new to coding or want to enhance your skills, this course will take you from beginner…
👍1
The most common anxiety we hear about learning to program are Math, Age, and Creativity.
NB:
Programmers Don’t Need to Know Much Math
You Are Not Too Old to Learn Programming
Programming Is a Creative Activity
NB:
Programmers Don’t Need to Know Much Math
You Are Not Too Old to Learn Programming
Programming Is a Creative Activity
👍1
Samsung Galaxy Ring is coming
This is What We Know About:
- Three colours: silver, black, and gold
- Sizes will range from 5 to 13
- Heart rate sensor
- Support for a new Samsung Health feature called “My Vitality Score”.
- The release date is expected to be July
This is What We Know About:
- Three colours: silver, black, and gold
- Sizes will range from 5 to 13
- Heart rate sensor
- Support for a new Samsung Health feature called “My Vitality Score”.
- The release date is expected to be July
👍2
13 Free Tailwind CSS libraries you should check:
🌊 Flowbite
📏 Preline UI
🌊 Ripple UI
🌼 Daisy UI
🔍 Sira
💡 Tailwind Elements
🐍 Mamba UI
🔪 Kutty
⛵️ Sailboat UI
🚀 HyperUI
🧱 Tailblocks
🌟 Meraki UI
📏 Headless UI
@EmmersiveLearning
🌊 Flowbite
📏 Preline UI
🌊 Ripple UI
🌼 Daisy UI
🔍 Sira
💡 Tailwind Elements
🐍 Mamba UI
🔪 Kutty
⛵️ Sailboat UI
🚀 HyperUI
🧱 Tailblocks
🌟 Meraki UI
📏 Headless UI
@EmmersiveLearning
👍4
When someone asks you what programming language they should learn, don’t simply answer the one you prefer.
first, ask what area they plan to focus on. for example:
- Web Frontend: JavaScript
- Backend: JavaScript
- Mobile apps: JavaScript
- Games: JavaScript
- AI: JavaScript
...and that is why we say, Learn JavaScript!....
https://www.youtube.com/watch?v=jF5oxeeuu6E
first, ask what area they plan to focus on. for example:
- Web Frontend: JavaScript
- Backend: JavaScript
- Mobile apps: JavaScript
- Games: JavaScript
- AI: JavaScript
...and that is why we say, Learn JavaScript!....
https://www.youtube.com/watch?v=jF5oxeeuu6E
YouTube
JavaScript Full Course in #Amharic: የ JS ሙሉ ኮርስ ከመጀመሪያ እስከ መጨረሻ (Complete Beginner to Advanced)
Welcome to the Complete JavaScript Full Course in Amharic! 🚀 This course is designed to teach you JavaScript, the programming language that powers the web. Whether you're new to coding or want to enhance your skills, this course will take you from beginner…
😁2❤1👍1
Stepping up in tech without a mentor is like growing up in life without a father 😪
Have a mentor of seniors.
Mentor juniors and beginner's.
Have a mentor of seniors.
Mentor juniors and beginner's.
❤2
Learning web development is all about micro steps.
In the first 3 months, try a bit of everything:
Rough plan might be:
• Start with HTML, CSS
• JavaScript, DOM
• Git and GitHub
• React
• Node.js and APIs
Make sure to build projects using each technology.
@EmmersiveLearning
In the first 3 months, try a bit of everything:
Rough plan might be:
• Start with HTML, CSS
• JavaScript, DOM
• Git and GitHub
• React
• Node.js and APIs
Make sure to build projects using each technology.
@EmmersiveLearning
👍4
What HTML attribute is used to apply CSS styles to a specific group of elements?
A) class
B) id
C) style
D) tag
A) class
B) id
C) style
D) tag
👍3
Complete DSA Roadmap🔥
|
|-- Basic_Data_Structures
| |-- Arrays
| |-- Strings
| |-- Linked_Lists
| |-- Stacks
| └─ Queues
|
|-- Advanced_Data_Structures
| |-- Trees
| | |-- Binary_Trees
| | |-- Binary_Search_Trees
| | |-- AVL_Trees
| | └─ B-Trees
| |
| |-- Graphs
| | |-- Graph_Representation
| | | |- Adjacency_Matrix
| | | └ Adjacency_List
| | |
| | |-- Depth-First_Search
| | |-- Breadth-First_Search
| | |-- Shortest_Path_Algorithms
| | | |- Dijkstra's_Algorithm
| | | └ Bellman-Ford_Algorithm
| | |
| | └─ Minimum_Spanning_Tree
| | |- Prim's_Algorithm
| | └ Kruskal's_Algorithm
| |
| |-- Heaps
| | |-- Min_Heap
| | |-- Max_Heap
| | └─ Heap_Sort
| |
| |-- Hash_Tables
| |-- Disjoint_Set_Union
| |-- Trie
| |-- Segment_Tree
| └─ Fenwick_Tree
|
|-- Algorithmic_Paradigms
| |-- Brute_Force
| |-- Divide_and_Conquer
| |-- Greedy_Algorithms
| |-- Dynamic_Programming
| |-- Backtracking
| |-- Sliding_Window_Technique
| |-- Two_Pointer_Technique
| └─ Divide_and_Conquer_Optimization
| |-- Merge_Sort_Tree
| └─ Persistent_Segment_Tree
|
|-- Searching_Algorithms
| |-- Linear_Search
| |-- Binary_Search
| |-- Depth-First_Search
| └─ Breadth-First_Search
|
|-- Sorting_Algorithms
| |-- Bubble_Sort
| |-- Selection_Sort
| |-- Insertion_Sort
| |-- Merge_Sort
| |-- Quick_Sort
| └─ Heap_Sort
|
|-- Graph_Algorithms
| |-- Depth-First_Search
| |-- Breadth-First_Search
| |-- Topological_Sort
| |-- Strongly_Connected_Components
| └─ Articulation_Points_and_Bridges
|
|-- Dynamic_Programming
| |-- Introduction_to_DP
| |-- Fibonacci_Series_using_DP
| |-- Longest_Common_Subsequence
| |-- Longest_Increasing_Subsequence
| |-- Knapsack_Problem
| |-- Matrix_Chain_Multiplication
| └─ Dynamic_Programming_on_Trees
|
|-- Mathematical_and_Bit_Manipulation_Algorithms
| |-- Prime_Numbers_and_Sieve_of_Eratosthenes
| |-- Greatest_Common_Divisor
| |-- Least_Common_Multiple
| |-- Modular_Arithmetic
| └─ Bit_Manipulation_Tricks
|
|-- Advanced_Topics
| |-- Trie-based_Algorithms
| | |-- Auto-completion
| | └─ Spell_Checker
| |
| |-- Suffix_Trees_and_Arrays
| |-- Computational_Geometry
| |-- Number_Theory
| | |-- Euler's_Totient_Function
| | └─ Mobius_Function
| |
| └─ String_Algorithms
| |-- KMP_Algorithm
| └─ Rabin-Karp_Algorithm
|
|-- Online_Judges_and_Practice_Platforms
| |-- LeetCode
| |-- HackerRank
| |-- CodeChef
| |-- Codeforces
| └─ HackerEarth
|
└─ Interview_Preparation
|-- Commonly_Asked_DSA_Interview_Questions
|-- Mock_Interviews
|-- Problem-Solving_Strategies
|-- Time_and_Space_Complexity_Analysis
└─ Coding_Patterns_and_Techniques
---------------- END --------------
@EmmersiveLearning
|
|-- Basic_Data_Structures
| |-- Arrays
| |-- Strings
| |-- Linked_Lists
| |-- Stacks
| └─ Queues
|
|-- Advanced_Data_Structures
| |-- Trees
| | |-- Binary_Trees
| | |-- Binary_Search_Trees
| | |-- AVL_Trees
| | └─ B-Trees
| |
| |-- Graphs
| | |-- Graph_Representation
| | | |- Adjacency_Matrix
| | | └ Adjacency_List
| | |
| | |-- Depth-First_Search
| | |-- Breadth-First_Search
| | |-- Shortest_Path_Algorithms
| | | |- Dijkstra's_Algorithm
| | | └ Bellman-Ford_Algorithm
| | |
| | └─ Minimum_Spanning_Tree
| | |- Prim's_Algorithm
| | └ Kruskal's_Algorithm
| |
| |-- Heaps
| | |-- Min_Heap
| | |-- Max_Heap
| | └─ Heap_Sort
| |
| |-- Hash_Tables
| |-- Disjoint_Set_Union
| |-- Trie
| |-- Segment_Tree
| └─ Fenwick_Tree
|
|-- Algorithmic_Paradigms
| |-- Brute_Force
| |-- Divide_and_Conquer
| |-- Greedy_Algorithms
| |-- Dynamic_Programming
| |-- Backtracking
| |-- Sliding_Window_Technique
| |-- Two_Pointer_Technique
| └─ Divide_and_Conquer_Optimization
| |-- Merge_Sort_Tree
| └─ Persistent_Segment_Tree
|
|-- Searching_Algorithms
| |-- Linear_Search
| |-- Binary_Search
| |-- Depth-First_Search
| └─ Breadth-First_Search
|
|-- Sorting_Algorithms
| |-- Bubble_Sort
| |-- Selection_Sort
| |-- Insertion_Sort
| |-- Merge_Sort
| |-- Quick_Sort
| └─ Heap_Sort
|
|-- Graph_Algorithms
| |-- Depth-First_Search
| |-- Breadth-First_Search
| |-- Topological_Sort
| |-- Strongly_Connected_Components
| └─ Articulation_Points_and_Bridges
|
|-- Dynamic_Programming
| |-- Introduction_to_DP
| |-- Fibonacci_Series_using_DP
| |-- Longest_Common_Subsequence
| |-- Longest_Increasing_Subsequence
| |-- Knapsack_Problem
| |-- Matrix_Chain_Multiplication
| └─ Dynamic_Programming_on_Trees
|
|-- Mathematical_and_Bit_Manipulation_Algorithms
| |-- Prime_Numbers_and_Sieve_of_Eratosthenes
| |-- Greatest_Common_Divisor
| |-- Least_Common_Multiple
| |-- Modular_Arithmetic
| └─ Bit_Manipulation_Tricks
|
|-- Advanced_Topics
| |-- Trie-based_Algorithms
| | |-- Auto-completion
| | └─ Spell_Checker
| |
| |-- Suffix_Trees_and_Arrays
| |-- Computational_Geometry
| |-- Number_Theory
| | |-- Euler's_Totient_Function
| | └─ Mobius_Function
| |
| └─ String_Algorithms
| |-- KMP_Algorithm
| └─ Rabin-Karp_Algorithm
|
|-- Online_Judges_and_Practice_Platforms
| |-- LeetCode
| |-- HackerRank
| |-- CodeChef
| |-- Codeforces
| └─ HackerEarth
|
└─ Interview_Preparation
|-- Commonly_Asked_DSA_Interview_Questions
|-- Mock_Interviews
|-- Problem-Solving_Strategies
|-- Time_and_Space_Complexity_Analysis
└─ Coding_Patterns_and_Techniques
---------------- END --------------
@EmmersiveLearning
👍4