DSA Bootcamp

---

Setting the tone with the quote by Chris Pine, "Programming isn’t about what you know; it’s about what you can figure out," the IEEEXtreme 19.0 DSA Bootcamp was launched as a foundational technical workshop for aspiring competitive programmers. This intensive two-day event, held on September 24th and 25th, 2025, was a collaborative initiative by the IEEE Computer Society SBC TKMCE, IEEE Computer Society SBC CEP, and IEEE SB TKMCE.

The bootcamp was led by Mr Aron Mathew Tom, a 4th Year Computer Science student from TKMCE. As a senior student and peer, Mr Aron Mathew Tom was uniquely positioned to act as a mentor. His recent and relevant experience with the very challenges and academic curriculum the participants are currently facing made his insights both practical and relatable. This peer-to-peer training model fostered a comfortable and interactive learning environment where participants felt encouraged to ask questions.

Recognising that a strong command of Data Structures and Algorithms (DSA) is the backbone of success in any programming competition, this bootcamp was strategically scheduled as part of the preparatory series for the upcoming IEEEXtreme 19.0 global challenge. The event was designed to move beyond theoretical knowledge and focus on the practical application and problem-solving skills necessary to excel under pressure.

The primary goal of the bootcamp was clear and direct: to strengthen the foundations of participants in Data Structures and Algorithms.

Secondary objectives included:

• Revisiting fundamental DSA concepts to ensure all participants had a common, solid baseline.

• Introducing complex algorithms and data structures frequently encountered in competitive programming.

• Analyzing problems to help students identify the appropriate DSA to apply for an efficient solution.

• Building the technical confidence of students preparing for the IEEEXtreme 19.0 marathon.

The two-day bootcamp was structured to create a logical progression from foundational knowledge to advanced application.

Day 1 (September 24): The Building Blocks

The first session, kicking off at 7:30 PM, focused on the fundamentals. The agenda was designed to refresh and solidify core concepts, including:

• Complexity Analysis: Understanding Big O notation O(n) to measure the efficiency of algorithms.

• Linear Data Structures: A deep dive into the implementation and use cases of Arrays, Linked Lists, Stacks, and Queues.

• Basic Algorithms: Reviewing essential searching (Binary Search) and sorting (Merge Sort, Quick Sort) algorithms that are prerequisites for more complex problems.

Day 2 (September 25): Advanced Algorithms & Strategy

The second session built upon the first, transitioning into topics more directly applicable to competitive challenges like IEEEXtreme. Key topics covered included:

• Non-Linear Data Structures: An introduction to Trees (Binary Search Trees, Heaps) and Graphs (including traversal methods like BFS and DFS).

• Problem-Solving Techniques: Discussing vital algorithmic strategies such as Hashing, Greedy Algorithms, and Dynamic Programming.

• Application:Mr. Aron Mathew Tom likely guided participants through sample problems, demonstrating how to break down a complex challenge and select the most efficient data structure and algorithm for the job.The IEEEXtreme 19.0 DSA Bootcamp was a significant success, serving as a crucial technical primer for the main competition. By dedicating two focused evenings to intensive learning, the organising committees provided invaluable support to their members. Participants left the session not only with refreshed theoretical knowledge but, more importantly, with the confidence and strategic thinking required to "figure out" the complex problems IEEEXtreme 19.0 would present. The collaboration between the three student branches (IEEE CS TKMCE, IEEE CS CEP, and IEEE SB TKMCE) further exemplified a strong community commitment to student success.

• 

---

---

---

---

---

dsa1		93.02 KiB
dsa2		113.06 KiB
dsa3		100.17 KiB
dsa4		100.50 KiB
dsa5		116.05 KiB

---