Google : Applied CS with Android
College : Assam Engineering College (AEC), Guwahati
As a Facilitator of my college for Google's, Applied CS with Android [2017-18], this repository holds all the code and memories made during the flipped classroom program days in AEC. It is the passion that makes it worth it to live the experience of coding and forming beautiful solutions out of it. We formed a family " Applied CS" family, a strong bond and connection cherishing goodwill and support. It is the inner drive that we have, to achieve what we do.
Applied CS was a full-paid invitation to Google Bangalore, to attend bootcamp on Android and the Applied CS program.I have a blog post here [will update later] about my experience at Google, Bangalore . Also, do check out the videos :)
<vid> [Journey to Google]( https://youtu.be/tatcYwEfvcE )
<vid> [Google's Applied CS @ AEC]( https://youtu.be/PmuDhvJxrhM )
We hosted 2 weeks of sessions, of Applied CS with Android ( playlist ) in AEC. In the first week of session, we covered 5 apps followed by a CODESPRINT:
1. Anagrams
2. Scarne's Dice
3. Word Ladder
4. Black Hole
5. Puzzle 8
In the second week of session, we covered other 5 apps followed by another CODESPRINT :
1. Word Stack
2. Binary Search Tree Viewer
3. Ghost I
4. Ghost II
5. Touring Musician
It was fun, memorable and at the same time pretty exciting to learn the most popular Data Structure and Algorithms. Thank you Google, for providing such an opportunity to connect and learn.
GETTING STARTED
Setting Up Android Studio , syncing build/gradle is the most time consuming thing in the workshop. It downloads & downloads ....& downloads dependencies. Slow Internet Connection, might be Fatal to time ! :D . In the meantime , We looked at MIT App Inventor, explained how easy it is to build Android Apps in MIT App inventor. I have a repository βΏ here outlining the works done.
WEEK 1 :
Concepts Learned:
-> ArrayLists, HashSets, and HashMaps
-> A* Search Algorithm, Manhattan Distance
-> Minimax Algorithm, Monte Carlo Method, Graph Traversal ( BFS + DFS ), Alpha Beta Pruning
-> Heap, Priority Queue, Stack, Queue
Applications covered :
- Scarne's Dice by - root, Nishi
- Word Ladder by - root
- Black Hole by - root
CODESPRINT 1:
Apps Made : Uber Car Animation, Memory Game, Catch the Sound, JoyRide (Unity)
Successfully completed Week 1 :)
WEEK 2 : Concepts Learned:
-> Stacks, Tree & Trie
-> Binary Search Trees, AVL Trees
-> Dynamic Programming, Greedy Programming & Recursive Programming
-> Linked List, Circular Linked list & Travelling Salesperson Problem
Applications covered :
- Word Stack by - root
- Touring Musician by - root
CODESPRINT 2:
Apps Made: Alarm Clock, Image Slider, Rock Paper Scissor , CrossDroad (Unity)
Takeaway
Here are all the Applied CS Apps covered. The data structure and algorithms that I learnt are dear, the leadership qualities that I built and the whole journey is close to my heart :)
Thank You for visiting :)
________________________________________________________________________π °π Ώπ Ώπ »π Έπ ΄π ³ π ²π ππ Έππ · π °π ½π ³ππ Ύπ Έπ ³