BEGIN:VCALENDAR
VERSION:2.0
PRODID:IEEE vTools.Events//EN
CALSCALE:GREGORIAN
BEGIN:VEVENT
DTSTAMP:20251020T203315Z
UID:AA9DD334-BBB3-4C30-A76F-493B67E13E7E
DTSTART;TZID=Etc/GMT+12:20251008T140000
DTEND;TZID=Etc/GMT+12:20251008T160000
DESCRIPTION:Date: October 8\, 2025\n\nDuration: 2 Hours\n\nLocation/Platfor
 m: ENIT\n\nOrganized by: IEEE Computer Society Chapter ENIT\n\n2. Objectiv
 es\n\nThe goals of this second workshop were to:\n\nBuild upon the fundame
 ntals by introducing the core principles of algorithmic thinking.\n\nDemon
 strate how to implement essential problem-solving techniques using C++.\n\
 nStrengthen participants&#39; ability to deconstruct complex problems into man
 ageable algorithmic steps.\n\nProvide practical experience applying these 
 techniques to solve common CP problem types.\n\n3. Summary of Activities\n
 \n- Key Topics Covered:\n\nPrinciples of Algorithmic Thinking: Decompositi
 on\, Pattern Recognition\, and Abstraction.\n\nEssential C++ for CP: Stand
 ard Template Library (STL) basics (vector\, pair\, sort).\n\nKey Algorithm
 ic Techniques:\n\nGreedy Algorithms (concept and examples)\n\nTwo-Pointer 
 Technique\n\nProblem-Solving Workflow: From problem statement to a verifie
 d C++ solution.\n\n- Main Exercises\, Demonstrations\, or Hands-on Work:\n
 \nLive demonstration of solving a problem using a Greedy approach .\n\nSte
 p-by-step coding of a problem solved with the Two-Pointer technique .\n\nH
 ands-on session where participants worked on curated problems designed to 
 practice the taught techniques\, with a focus on efficient C++ implementat
 ion.\n\n- Tools or Methods Introduced:\n\nLanguage: C++.\n\nTechniques: Gr
 eedy Algorithms\, Two-Pointer Technique.\n\nPlatforms: Continued use of Co
 deforces for problem-solving.\n\n4. Attendance\n\nNumber of Participants: 
 32\n\n5. Outcomes\, Feedback &amp; Conclusion\n\nSkills or Knowledge Gained:\n
 \nParticipants developed a structured approach to breaking down problems a
 lgorithmically.\n\nThey gained practical experience with fundamental CP te
 chniques.\n\nUnderstanding of C++ was significantly improved\, enabling th
 em to write more efficient and concise code.\n\nGeneral Participant Feedba
 ck or Notable Comments:\n\nParticipants appreciated the focus on specific\
 , actionable techniques rather than just theory.\n\nThe live-coding demons
 trations were highly praised for showing the entire thought process\, from
  understanding the problem to debugging the code.\n\nSome participants fou
 nd the jump in difficulty from the first session challenging but motivatin
 g\, indicating a clear progression in the workshop series.\n\nConclusion:\
 n\nThe second workshop successfully transitioned participants from underst
 anding CP basics to applying core algorithmic techniques. The consistent a
 ttendance demonstrates strong engagement and a desire to deepen practical 
 skills. By focusing on algorithmic thinking and its implementation in C++\
 , this session effectively equipped participants with critical tools for I
 EEEXtreme 19.0. The workshop set a solid foundation for tackling more comp
 lex data structures and algorithms in future sessions.\n\n[]\n\n[]\n\nSpea
 ker(s): Mohamed Kmiha\, \n\nmanar1\, Tunis\, Tunisia
LOCATION:manar1\, Tunis\, Tunisia
ORGANIZER:enit@ieee.org 
SEQUENCE:40
SUMMARY:Algorithmic Thinking with C++ - Preparation for IEEEXtreme 19.0
URL;VALUE=URI:https://events.vtools.ieee.org/m/506370
X-ALT-DESC:Description: &lt;br /&gt;&lt;p dir=&quot;ltr&quot;&gt;&amp;nbsp\;&lt;/p&gt;\n&lt;p dir=&quot;ltr&quot;&gt;Date: 
 October 8\, 2025&lt;/p&gt;\n&lt;p dir=&quot;ltr&quot;&gt;Duration: 2 Hours&lt;/p&gt;\n&lt;p dir=&quot;ltr&quot;&gt;Loc
 ation/Platform: ENIT&lt;/p&gt;\n&lt;p dir=&quot;ltr&quot;&gt;Organized by: &lt;span style=&quot;color: r
 gb(230\, 126\, 35)\;&quot;&gt;IEEE Computer Society Chapter ENIT&lt;/span&gt;&lt;/p&gt;\n&lt;p di
 r=&quot;ltr&quot;&gt;&lt;strong&gt;2. Objectives&lt;/strong&gt;&lt;/p&gt;\n&lt;p dir=&quot;ltr&quot;&gt;The goals of this
  second workshop were to:&lt;/p&gt;\n&lt;p dir=&quot;ltr&quot;&gt;Build upon the fundamentals by
  introducing the core principles of algorithmic thinking.&lt;/p&gt;\n&lt;p dir=&quot;ltr
 &quot;&gt;Demonstrate how to implement essential problem-solving techniques using 
 C++.&lt;/p&gt;\n&lt;p dir=&quot;ltr&quot;&gt;Strengthen participants&#39; ability to deconstruct com
 plex problems into manageable algorithmic steps.&lt;/p&gt;\n&lt;p dir=&quot;ltr&quot;&gt;Provide
  practical experience applying these techniques to solve common CP problem
  types.&lt;/p&gt;\n&lt;p dir=&quot;ltr&quot;&gt;&lt;strong&gt;3. Summary of Activities&lt;/strong&gt;&lt;/p&gt;\n&lt;
 p dir=&quot;ltr&quot;&gt;- Key Topics Covered:&lt;/p&gt;\n&lt;p dir=&quot;ltr&quot;&gt;Principles of Algorith
 mic Thinking: Decomposition\, Pattern Recognition\, and Abstraction.&lt;/p&gt;\n
 &lt;p dir=&quot;ltr&quot;&gt;Essential C++ for CP: Standard Template Library (STL) basics 
 (vector\, pair\, sort).&lt;/p&gt;\n&lt;p dir=&quot;ltr&quot;&gt;Key Algorithmic Techniques:&lt;/p&gt;\
 n&lt;p dir=&quot;ltr&quot;&gt;Greedy Algorithms (concept and examples)&lt;/p&gt;\n&lt;p dir=&quot;ltr&quot;&gt;T
 wo-Pointer Technique&lt;/p&gt;\n&lt;p dir=&quot;ltr&quot;&gt;Problem-Solving Workflow: From prob
 lem statement to a verified C++ solution.&lt;/p&gt;\n&lt;p dir=&quot;ltr&quot;&gt;- Main Exercis
 es\, Demonstrations\, or Hands-on Work:&lt;/p&gt;\n&lt;p dir=&quot;ltr&quot;&gt;Live demonstrati
 on of solving a problem using a Greedy approach .&lt;/p&gt;\n&lt;p dir=&quot;ltr&quot;&gt;Step-b
 y-step coding of a problem solved with the Two-Pointer technique .&lt;/p&gt;\n&lt;p
  dir=&quot;ltr&quot;&gt;Hands-on session where participants worked on curated problems 
 designed to practice the taught techniques\, with a focus on efficient C++
  implementation.&lt;/p&gt;\n&lt;p dir=&quot;ltr&quot;&gt;- Tools or Methods Introduced:&lt;/p&gt;\n&lt;p 
 dir=&quot;ltr&quot;&gt;Language: C++.&lt;/p&gt;\n&lt;p dir=&quot;ltr&quot;&gt;Techniques: Greedy Algorithms\,
  Two-Pointer Technique.&lt;/p&gt;\n&lt;p dir=&quot;ltr&quot;&gt;Platforms: Continued use of Code
 forces for problem-solving.&lt;/p&gt;\n&lt;p dir=&quot;ltr&quot;&gt;&lt;strong&gt;4. Attendance&lt;/stron
 g&gt;&lt;/p&gt;\n&lt;p dir=&quot;ltr&quot;&gt;Number of Participants: 32&lt;/p&gt;\n&lt;p dir=&quot;ltr&quot;&gt;&lt;strong&gt;
 5. Outcomes\, Feedback &amp;amp\; Conclusion&lt;/strong&gt;&lt;/p&gt;\n&lt;p dir=&quot;ltr&quot;&gt;Skills
  or Knowledge Gained:&lt;/p&gt;\n&lt;p dir=&quot;ltr&quot;&gt;Participants developed a structure
 d approach to breaking down problems algorithmically.&lt;/p&gt;\n&lt;p dir=&quot;ltr&quot;&gt;Th
 ey gained practical experience with fundamental CP techniques.&lt;/p&gt;\n&lt;p dir
 =&quot;ltr&quot;&gt;Understanding of C++ was significantly improved\, enabling them to 
 write more efficient and concise code.&lt;/p&gt;\n&lt;p dir=&quot;ltr&quot;&gt;General Participa
 nt Feedback or Notable Comments:&lt;/p&gt;\n&lt;p dir=&quot;ltr&quot;&gt;Participants appreciate
 d the focus on specific\, actionable techniques rather than just theory.&lt;/
 p&gt;\n&lt;p dir=&quot;ltr&quot;&gt;The live-coding demonstrations were highly praised for sh
 owing the entire thought process\, from understanding the problem to debug
 ging the code.&lt;/p&gt;\n&lt;p dir=&quot;ltr&quot;&gt;Some participants found the jump in diffi
 culty from the first session challenging but motivating\, indicating a cle
 ar progression in the workshop series.&lt;/p&gt;\n&lt;p dir=&quot;ltr&quot;&gt;Conclusion:&lt;/p&gt;\n
 &lt;p dir=&quot;ltr&quot;&gt;The second workshop successfully transitioned participants fr
 om understanding CP basics to applying core algorithmic techniques. The co
 nsistent attendance demonstrates strong engagement and a desire to deepen 
 practical skills. By focusing on algorithmic thinking and its implementati
 on in C++\, this session effectively equipped participants with critical t
 ools for IEEEXtreme 19.0. The workshop set a solid foundation for tackling
  more complex data structures and algorithms in future sessions.&lt;/p&gt;\n&lt;p d
 ir=&quot;ltr&quot;&gt;&lt;img style=&quot;display: block\; margin-left: auto\; margin-right: au
 to\;&quot; src=&quot;https://events.vtools.ieee.org/vtools_ui/media/display/9ce27247
 -262b-42ca-9391-aadd07f22a87&quot; alt=&quot;&quot; width=&quot;343&quot; height=&quot;342&quot;&gt;&lt;/p&gt;\n&lt;p dir
 =&quot;ltr&quot;&gt;&lt;img style=&quot;display: block\; margin-left: auto\; margin-right: auto
 \;&quot; src=&quot;https://events.vtools.ieee.org/vtools_ui/media/display/6c613cb2-3
 e95-42a2-8a68-355bc8d52d4d&quot; alt=&quot;&quot; width=&quot;340&quot; height=&quot;344&quot;&gt;&lt;/p&gt;
END:VEVENT
END:VCALENDAR