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