Google Asia Pacific University Test, also referred to as Google APAC, is perhaps the best opportunity for a student enrolled in higher education institutes in the APAC region to mark a place in the big shot in the IT Sector – Google.
- Go to the Google APAC Website and click on participate.
- Once you login from your Google account, you will be forwarded to the registration form for Google APAC 2017.
- Fill all the details like name, country, gender, university details, etc. You will need to know your University ID. Contact your college for this.
- Fill in the details about any internship or project experience that you have, any awards/honours that you have received carefully. Be precise and to – the point.
- Provide your resume link. Preferably, your resume should be of only one page length with one or two lines about every project that you have worked upon, internship experience etc.
- Once you have filled all the details, click on I accept. Register!
Once you have completed all the registration formalities, you can take the test on your preferred date. The schedule is given below:
Schedule for Google APAC -2017 Test
|Sunday, September 18, 2016||10:30 IST||3hr||Round C|
|Sunday, October 16, 2016||10:30 IST||3hr||Round D|
|Sunday, November 6, 2016||10:30 IST||3hr||Round E|
- There is no restriction on the number of rounds you can sit in. Only the best score will be taken into account.
- Shortlisted students may be called for interviews for internships as well as full time roles after reviewing their form entries and performance in the APAC tests.
Each APAC round will have 4 problems of varying difficulty. There are two kinds of input that you can test your solution for, small and large. Solving a problem for small input will give you lesser points as compared to the large one but it will be easier to solve too.
The solutions are graded according to Google’s terms and finally the leaderboard is prepared. The students are then sorted according to their position in the leaderboard and their registration form entries and may be called for interviews for internship or full time job.
There are usually 4 interview rounds with questions ranging from subjects like Programming, Algorithms, Data Structures, and Operating System.
What to study??
To crack the Google APAC University test, one must have a good grasp on algorithms and data structures. Without working hard on data structures and algorithms , its not possible to crack the Google APAC test. These are some of the important topics that one should try before going for Google APAC Exam:
1. Start your preparation with the basic data structures. You should know how to implement them according to the problem given.
- Linked list
- Binary search tree
- You can also refer to this extensive list of articles on Data structures for more information.
2. Next comes a bit more advanced stuff.
- Graph algorithms
- Breadth First Search (BFS)
- Depth First Search (DFS)
- Shortest Path from source to all vertices **Dijkstra**
- Bridges in a graph
- Articulation Points (or Cut Vertices) in a Graph
- Johnson’s algorithm
- Topological Sort
- Minimum Spanning tree **Kruskal**
- Minimum Spanning tree **Prim**
- Searching and sorting
- Number theory concepts
3. Once you are done with this, you can move on to more advanced algorithms like:
- Convex Hull
- Graham Scan
- Line Intersection
- Interval Tree
- Matrix Exponentiation
- Maxflow Ford Furkerson Algo and Edmond Karp Implementation
- Min cut
- Stable Marriage Problem
- Hopcroft–Karp Algorithm for Maximum Matching
What to practice?
- GeeksforGeeks practice section provides an excellent collection of programming challenges sorted according to category and difficulty level.
- Also, make sure that you try out previous APAC Tests.
This article is contributed by Vishwesh Ravi Shrimali. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
- How to prepare for ACM – ICPC?
- Top 10 Algorithms and Data Structures for Competitive Programming
- How to become a master in competitive programming?
- How to begin with Competitive Programming?
- 10 mistakes people tend to do in an Interview
- Traversal of tree with k jumps allowed between nodes of same height
- Minimum number using set bits of a given number
- Trick for modular division ( (x1 * x2 …. xn) / b ) mod (m)
- Number of digits in the nth number made of given four digits
- Maximum sum increasing subsequence from a prefix and a given element after prefix is must