Job Title: Multiple Internship Positions
Company: Yaltopia Tech
Description:
Yaltopia Tech is excited to announce its internship program, offering exceptional opportunities for aspiring professionals in the fields of backend development, frontend development, and digital marketing. As an intern at Yaltopia Tech, you will have the chance to work alongside industry experts, gain hands-on experience, and contribute to cutting-edge projects that are shaping the future of technology.
Apply Here : https://forms.gle/qza2G8rbj4bK5BCV9
Approved by Maroset
Share: Ethiopian Remote Jobs
Company: Yaltopia Tech
Description:
Yaltopia Tech is excited to announce its internship program, offering exceptional opportunities for aspiring professionals in the fields of backend development, frontend development, and digital marketing. As an intern at Yaltopia Tech, you will have the chance to work alongside industry experts, gain hands-on experience, and contribute to cutting-edge projects that are shaping the future of technology.
Apply Here : https://forms.gle/qza2G8rbj4bK5BCV9
Approved by Maroset
Share: Ethiopian Remote Jobs
โค3โก2๐1๐1
Do You Know?
Did you know that the first computer bug was a literal bug? In 1947, when Grace Hopper was working on the Harvard Mark II computer, she found a moth trapped between the relays. She removed it and taped it to her logbook, noting it as the โfirst actual case of a bug being found.โ Since then, the term โdebuggingโ has become synonymous with fixing software issues! ๐๐ง
Did you know that the first computer bug was a literal bug? In 1947, when Grace Hopper was working on the Harvard Mark II computer, she found a moth trapped between the relays. She removed it and taped it to her logbook, noting it as the โfirst actual case of a bug being found.โ Since then, the term โdebuggingโ has become synonymous with fixing software issues! ๐๐ง
๐คฉ1๐1
Forwarded from Google Developer Group AAU
2 Days Left!
Join Us at the GDSC Welcome Program! ๐
Just a friendly reminder that our GDSC Welcome Program is only 2 days away!
๐ Date: May 17
๐ Time: 2:00 PM - 5:00 PM
๐ Location: 4 Kilo Campus
Don't miss out on:
- Getting introduced to the GDSC community
- Learning about GDSC's mission, goals, and activities
- Hearing from esteemed guest speakers and senior developers
- Networking with fellow students and GDSC members
- Q&A session for all your queries
Get ready to be inspired and take your first step into the exciting world of tech and community!
Make sure you register here and got your tickets through your email๐
https://gdsc.community.dev/events/details/developer-student-clubs-addis-ababa-university-addis-ababa-ethiopia-presents-welcome-program/
See you there!
Join Us at the GDSC Welcome Program! ๐
Just a friendly reminder that our GDSC Welcome Program is only 2 days away!
๐ Date: May 17
๐ Time: 2:00 PM - 5:00 PM
๐ Location: 4 Kilo Campus
Don't miss out on:
- Getting introduced to the GDSC community
- Learning about GDSC's mission, goals, and activities
- Hearing from esteemed guest speakers and senior developers
- Networking with fellow students and GDSC members
- Q&A session for all your queries
Get ready to be inspired and take your first step into the exciting world of tech and community!
Make sure you register here and got your tickets through your email๐
https://gdsc.community.dev/events/details/developer-student-clubs-addis-ababa-university-addis-ababa-ethiopia-presents-welcome-program/
See you there!
the most energy consuming organ in our body is brain๐ง (~20%).
and you know?
the main thing our brain is good at is ๐ถโ๐ซ๏ธForgetting.
and you know?
the main thing our brain is good at is ๐ถโ๐ซ๏ธForgetting.
๐3
๐ Bitcoin's Future is Unfolding! ๐
Last week, the Bitcoin world was buzzing with two major events: the Halving and the launch of the Runes Protocol! ๐โจ
**Whatโs the Buzz About Runes?
Runes is a game-changing token standard for creating fungible tokens right on the Bitcoin blockchain. Created by Casey Rodarmor, the mastermind behind Ordinals, Runes promises efficiency, simplicity, and a lighter blockchain footprint. Say goodbye to BRC-20's complexities and hello to streamlined token creation! ๐๐ฐ
How It Works:
- Etching: Create a new token with unique properties.
- Minting: Produce new token units.
- Transferring: Move tokens easily between users.
Impact on Bitcoin:
- More Use Cases: From stablecoins to governance tokens, Runes could attract a wider user base.
- Increased Miner Revenue: Higher transaction volume means more fees for miners.
- Innovation Boost: Lower barriers for developers to create cool new projects!
The Future:**
Caseyโs next big idea? Direct trading between users and potential Layer-2 network integration for even more scalability and fun! ๐
**TL;DR:**
Runes = Efficient tokens on Bitcoin + More users + Higher miner fees + Innovation boost! Will Runes revolutionize Bitcoin? Only time will tell, but the ride is looking exciting! ๐๐
Join the convo and share your thoughts! ๐ฌ
#Bitcoin #CryptoInnovation #RunesProtocol
Read More at: https://magazine.mindplex.ai/runes-protocol-did-it-ruin-bitcoin-or-save-it/?mpsa=9703-664f9cc295a2b-link
Last week, the Bitcoin world was buzzing with two major events: the Halving and the launch of the Runes Protocol! ๐โจ
**Whatโs the Buzz About Runes?
Runes is a game-changing token standard for creating fungible tokens right on the Bitcoin blockchain. Created by Casey Rodarmor, the mastermind behind Ordinals, Runes promises efficiency, simplicity, and a lighter blockchain footprint. Say goodbye to BRC-20's complexities and hello to streamlined token creation! ๐๐ฐ
How It Works:
- Etching: Create a new token with unique properties.
- Minting: Produce new token units.
- Transferring: Move tokens easily between users.
Impact on Bitcoin:
- More Use Cases: From stablecoins to governance tokens, Runes could attract a wider user base.
- Increased Miner Revenue: Higher transaction volume means more fees for miners.
- Innovation Boost: Lower barriers for developers to create cool new projects!
The Future:**
Caseyโs next big idea? Direct trading between users and potential Layer-2 network integration for even more scalability and fun! ๐
**TL;DR:**
Runes = Efficient tokens on Bitcoin + More users + Higher miner fees + Innovation boost! Will Runes revolutionize Bitcoin? Only time will tell, but the ride is looking exciting! ๐๐
Join the convo and share your thoughts! ๐ฌ
#Bitcoin #CryptoInnovation #RunesProtocol
Read More at: https://magazine.mindplex.ai/runes-protocol-did-it-ruin-bitcoin-or-save-it/?mpsa=9703-664f9cc295a2b-link
Mindplex
Runes Protocol: Did It Ruin Bitcoin or Save It? - Mindplex
The Runes protocol, a new token standard for Bitcoin, aims to provide a more efficient and responsible way of creating fungible tokens. What are the downsides?
๐ฐ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
|
|-- OnlinePlatforms
| |-- LeetCode
| |-- HackerRank
Groups & Friends too
|-- 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
|
|-- OnlinePlatforms
| |-- LeetCode
| |-- HackerRank
Groups & Friends too
๐2
It's irrelevant but found interesting..,.. but let's see how Dev's react to this article!
แตแ แ แ แซ แญแ แแ แซแแแ?
๐
1)แจแซแต แแณแต แฅแ แจแตแแฅแ แฐแแฝ แแแแต แฅแแ "แฅแ แจแแตแฉ แฐแญแถ แ แญแฅแแ" แ แญแซแฝ แ แ แซ แ แแแฝแ
2)แ แ แซ แฅแแฐแแแฝ แฅแแตแถแฝ แจแฐแ แแณ แแตแฅ แแฅแณ แจแ แ แฐแฅแ แ แตแ แแ
3)แ แ แซ แ แจแแฅ แตแแณแแฝ แฅแแ แจแซแแฝแแ แฅแ แ แแญแฝ แ แณแฐแญแแ
4)แฅแ แฐแแฝ แ แ แซ แจแแณแแ แขแแตแแธแแแฃ แจแแฐแฝแฃแธแแ แ แ แฃแซ แฅแ แแแแต แแ แจแแแ แฅแแตแณ แ แแญ แ แณแแซ แณแแแแฝ
5)แจแแ แญ แ แ แซ แจแจแฐแ แแแซ แแแขแซ แ แแด แซแจแฝ แฅแตแ แแณแ แ แตแจแณแ
6)แ แ แซ แฅแตแจ 60 แชแ แแตแญ แจแแฐแแกแแฎ แตแแแตแแญแแ แแแฅ แจแแแฃแฑ แ แแต แณแแแแฝ
7)แจแแฌแต แแแแฅแแฅ แ แฐแ แจแแจแ แฑ แ แแต แฌแธแต แ แแฐแแต แฐแแฝแ แณแฐแญแแแฝแข
8)แ แแฝแแ แแฆแแซแ แจแฅแแตแณแต แแ แฐแญ แ แฃแ แตแแตแฃแจแ แฅแ แ แตแฐแแญ แฐแฅแแ แจแฐแแแแกแต แถแแแแฃ แแแณแฃ แแแแฃ แแจแตแฃ แฅแญแ แฅแ แ แ แซ แแธแแกแก
9)แ แ แซ แแแแแต แฐแแฝแ แ แณแแแแต แณแญแณแญแต แจแแซแแแแ แณแณแช แฐแซแฐแ แแ แฅแซแ แแฐแแ แฐแแฃ แฐแซแ แฐแ แแญแ แแแฑ แฐแแ แแแแแ 'แ แ แซ'แฐแฅแ แแฐแฐแก แจแ แ แซแ แจแแแแต แแแณ แแซแต แแแกแก
10)แจแฐแ แแแฝ แแแ แ แแแแญ แ แ แซ แขแแแ แจแ แ แซแ แญแฅแญ แ แแณแถแฃ แแแ แ แแแแแต แแแญแฐแ แ แแ แแ แณ แจแฐแแจ แญแฅแญ แแตแ แณแฝแ แจแฐแแฅแฎ แแแ แจแแฐแแ แแแแ แจแแซแณแญ แแแกแก
11)แ แ แซ 20 แฐแ แต แ แแ แฅแซแแแแ แจแ แ แซ แแแก แฑแ แฒแแ แจแตแแต แแ แแฐแต แแแข
12)แ แ แซ แ แแญแ แ แแฅแ แฅแซแแแแแฝ แจแฑแ แฅแ แตแตแฅ แแช แ แแดแ แฐแแแณ แ แณแแ แแกแกแจแแแณ แ แแฆแ แตแแขแฐแแ แ แแ แณ แแ แแแณแ แแณแด แญแธแจแแแกแก
13)แ แฅแ แ แแญ แญแฅแญ แฃแญแฐแ แแ แ แฅแแแแ แ แ แซ แแญ แแณแต แแตแจแต แแญแต แคแต แแตแฎ แแฅแฅแซ แซแตแแญแณแแกแกแจแ แ แซ แแฅแต แฐแแแฝแ แ แฅแแแแ แจแฐแแแ แแญแทแแกแก
14) แ แ แแชแซ แจแดแแญแซแฒแญ แแญแฒ แแแญแต แ แ แซ แแแ แจแ แ แซแ แแแณ แ แแฐแฅ แแแกแก
แจแแแฑ แแแ แแแฎ แ แแ แณ แแ แฅแแ แแแแญแฉ แจแฅแ แ แแญ แแแฒแจแแฝ แฅแฉ แแณแ แแ (แจแแฃแธแ) แ แญแแฃแธแแ แฅแแ แจแแแฒแซ แแญแฒแแฝ แแแญแซ แฒแแณแฐแฉ แจแ แ แซแ แแตแ แ แแแญแตแแต แขแ แแ แฅแฉ แแแกแก
15) "แฅแแฐ แฐแ แจแแซแตแฅ แ แ แซ แฃแแแ แ แฅแแฐแ แ แซ แจแแซแต แฐแ แ แแแแ"แจแแแ แ แฃแฃแ แฐแฐแฅ แฐแแฝแ แแแแแ แจแแซแแแแ แขแแตแแ แจแ แ แซแ แขแแฐแแแแฒ แ แแซแแ แฐแแฝ แจแฐแแแธ แ แฃแฃแ แแแข
16)แ แ แแ แณ แฅแแ แ แ แ แซ แแดแ แฅแ แแแต แคแต แแญแแต แจแแญแแฑแต แจแฅแ แ แแญ แแแดแแฝ 'แ แ แซ แแดแ' แแญแ "แ แ แซ แแแต แคแต" "แ แ แซ แฑแแญแแญแฌแต" แฅแแ แขแฐแญแ แจแณแณแชแแ แฅแ แจแจแแแ แฅแแตแณ แตแซแ แแ แแแธแ แฅแแ แตแตแฅแ แจแแแแ แ แแแแแ แแจแณแต แ แแฃแธแแกแกแแซแแซ 30 แจแ แ แซ แแ แแแข
แแแญ แแ แ แซแ แแฒแซ
๐2๐1๐ฅ1๐ค1
You know? You Can use chatGPT without Internet on #Windows #Linux and #Mac
Download from > https://ollama.com/download
for more description > Watch NetworkChuck < https://youtu.be/Wjrdr0NU4Sk?si=m4HbeBZHEnWvUmhC >
Download from > https://ollama.com/download
for more description > Watch NetworkChuck < https://youtu.be/Wjrdr0NU4Sk?si=m4HbeBZHEnWvUmhC >
๐2