Scribd
Upload
8 views

google interview

The document outlines the details for Erica Jayasundera's upcoming Google Hangout interview for a Software Engineer position, including the date, time, and preparation instructions. It also provides information on interview accommodations and how to confirm attendance. Additionally, the document contains a brief introduction to graph theory, explaining what a graph is, its types, basic terminology, and its importance in various fields.

Uploaded by

erica jayasundera
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
8 views

google interview

The document outlines the details for Erica Jayasundera's upcoming Google Hangout interview for a Software Engineer position, including the date, time, and preparation instructions. It also provides information on interview accommodations and how to confirm attendance. Additionally, the document contains a brief introduction to graph theory, explaining what a graph is, its types, basic terminology, and its importance in various fields.

Uploaded by

erica jayasundera
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

Google Hangout Interview - Erica Jayasundera [Please Confirm]

Vidhi Rupanwal Tue, Nov 5, 2019,


<[email protected]> 2:28 PM

to me,
Jolijn

Hi Erica,

We hope you're excited for your upcoming interview. I’m Vidhi, a Recruiting
Coordinator working with Jolijn to schedule your hangout interview for
the SWE: Software Engineer, General (Google Ads) - Munich (DE) role.
I'm here to ensure you have a smooth interview process by scheduling your
Hangout interview as follows:

Date: Wednesday, 11th December 2019

Interview Time: 4:00pm - 4:45pm (Sri Lanka Standard Time)

Back-up Phone: +94 115 783 154

Email Address: [email protected]

Google is an inclusive workplace, reach out if you’d benefit from


interview accommodations e.g.a sign language interpreter, specialized
equipment, or a lactation break. We’ll then connect you with our
accommodation team to confidentially discuss your options.

What we need from you:

1. Let us know you can make it by replying all to confirm. If you’d like to
do a test Hangout with a member of our team, click here to book a slot.

2. RSVP “Yes” to the Google Calendar invite sent to you via email.

3. Make sure you can access and edit the following Google Doc.

How to prepare:
 Unfamiliar with joining Hangouts Meet? Here’s a step-by-step guide on
how to connect.

 Please join no more than 5 minutes early, and logout of all other
accounts to prevent technical difficulties.

 Use a laptop or desktop computer. Read about system


requirements here.

 Check that your webcam works in advance of your interview. Please


also be sure to have headphones or earbuds handy for your interview.

As a friendly reminder, our interview questions are confidential, so


please keep things under wraps.

Thank you!

Vidhi Rupanwal

Recruitment Coordinator -
APAC

+91 40 6619 4260

careers.google.com

Okay, let's dive into the basics of graph theory!

What is a Graph?

In mathematics, specifically in graph theory, a graph is a structure that


consists of a set of vertices (also called nodes or points) connected by a set
of edges (also called links or lines).

 Vertices (V): These are the fundamental units of a graph. They can
represent various things depending on the context (e.g., cities, people,
web pages).

 Edges (E): These connections between pairs of vertices. An edge can


represent a relationship or a connection between the things the
vertices represent (e.g., a road between cities, a friendship between
people, a hyperlink between web pages).
We often represent a graph as G = (V, E), where V is the set of vertices and E
is the set of edges.

Types of Graphs:

There are several types of graphs, depending on the properties of their


vertices and edges:

 Undirected Graph: The edges have no direction. An edge between


vertex A and vertex B is the same as an edge between vertex B and
vertex A. Think of friendships on Facebook – if A is friends with B, then
B is friends with A.

 Directed Graph (Digraph): The edges have a direction. An edge


from vertex A to vertex B is different from an edge from vertex B to
vertex A. Think of following someone on Twitter – A can follow B, but B
doesn't necessarily follow A. Directed edges are often represented with
arrows.

 Simple Graph: An undirected graph with no loops (an edge


connecting a vertex to itself) and no multiple edges (more than one
edge connecting the same pair of vertices).

 Multigraph: An undirected graph that can have multiple edges


between the same pair of vertices.

 Pseudograph: An undirected graph that can have both loops and


multiple edges.

 Weighted Graph: Each edge has a weight or value associated with it.
This weight can represent cost, distance, capacity, etc. Think of a map
where the edges (roads) have weights representing their lengths.

 Unweighted Graph: The edges have no associated weight.

Basic Graph Terminology:

Here are some fundamental terms used in graph theory:

 Adjacent Vertices (Neighbors): Two vertices are adjacent if there is


an edge connecting them.

 Incident Edge: An edge is incident to the vertices it connects.

 Degree of a Vertex (deg(v)): The number of edges incident to a


vertex. In a directed graph, we have:
o In-degree (deg⁻(v)): The number of edges pointing into the
vertex.

o Out-degree (deg⁺(v)): The number of edges pointing out of the


vertex.

 Path: A sequence of distinct vertices such that each consecutive pair


of vertices in the sequence is connected by an edge.

 Cycle: A path that starts and ends at the same vertex.

 Connected Graph: An undirected graph is connected if there is a path


between every pair of distinct vertices in the graph.

 Disconnected Graph: A graph that is not connected. It consists of


two or more connected components.

 Connected Component: A maximal connected subgraph of a


disconnected graph.

 Complete Graph (K<sub>n</sub>): A simple undirected graph in


which every pair of distinct vertices is connected by a unique edge. 1
K<sub>n</sub> denotes a complete graph with n vertices.

 Bipartite Graph: A graph whose vertices can be divided into two


disjoint and independent sets, U and V, such that every edge connects
a vertex in U to one2 in V. There are no edges within either set U or set
V.

 Subgraph: A graph whose vertex set and edge set are subsets of the
vertex set and edge set of another graph.

 Induced Subgraph: A subgraph formed by a subset of the vertices of


the original graph, and including all the edges between those vertices
that exist in the original graph.

Example:

Let's consider an undirected graph G = (V, E) where:

 V = {A, B, C, D}

 E = {(A, B), (B, C), (C, D), (D, A), (B, D)}

In this graph:

 Vertices A and B are adjacent.


 The edge (A, B) is incident to vertices A and B.

 The degree of vertex A is 2 (edges (A, B) and (D, A)).

 The degree of vertex B is 3 (edges (A, B), (B, C), and (B, D)).

 A path from A to C could be A -> B -> C.

 A cycle in the graph is A -> B -> D -> A.

 The graph is connected because there is a path between any two


vertices.

Why is Graph Theory Important?

Graph theory is a powerful tool with applications in various fields, including:

 Computer Science: Network analysis, algorithms (e.g., shortest path,


search algorithms), data structures, compiler design.

 Social Sciences: Social network analysis, modeling relationships and


interactions.

 Biology: Modeling biological networks (e.g., protein-protein interaction


networks).

 Transportation and Logistics: Route planning, traffic flow


optimization.

 Chemistry: Modeling molecular structures.

 Operations Research: Scheduling, resource allocation.

This is just a brief introduction to the basics of graph theory. There are many
more interesting concepts and theorems to explore! Do you have any
specific aspects of graph theory you'd like to learn more about?

You might also like