How it works

What do you call a linear ordering of a directed graph of its vertices such that for every directed edge uv from vertex u to vertex v, u comes before v in the ordering? — Topological sort

0
ahmed kamel taha
Random
G
picture loading error handler
1227 thought(s)1.2K

Google Interview

This flashcard deck made by jwasham contains knowledge about google interview. For more details, please follow https://github.com/jwasham/google-interview-university
interview
computer science
development
ahmed kamel taha
Get

Explore more quotes

What is Hamming Code?
ahmed kamel taha
9
What is the square root of 256?
ahmed kamel taha
8
2^16
ahmed kamel taha
6
Using bitwise operations, how would you test that a number is a power of 2?
ahmed kamel taha
4
What does ELF stand for?
ahmed kamel taha
3
example of a latency device
ahmed kamel taha
4
example of a throughput device
ahmed kamel taha
3
What is the Hamming Distance?
ahmed kamel taha
3
What are the 5 steps of the compiling process?
ahmed kamel taha
3
What is parsing?
ahmed kamel taha
2
What is lexical analysis?
ahmed kamel taha
2
What is code generation?
ahmed kamel taha
2
4 * 16
ahmed kamel taha
3
2 ^ 4
ahmed kamel taha
2
2^3
ahmed kamel taha
2
2^5
ahmed kamel taha
2
2^6
ahmed kamel taha
2
2^7
ahmed kamel taha
2
2^8
ahmed kamel taha
2
2^9
ahmed kamel taha
2
2^10
ahmed kamel taha
3
2^11
ahmed kamel taha
2
2^12
ahmed kamel taha
2
2^13
ahmed kamel taha
2
2^14
ahmed kamel taha
2
2^15
ahmed kamel taha
2
2^32
ahmed kamel taha
2
size of char in bits
ahmed kamel taha
2
size of char in bytes
ahmed kamel taha
2
size of bool in bits
ahmed kamel taha
2
size of short in bits
ahmed kamel taha
2
size of short in bytes
ahmed kamel taha
2
size of int in bits
ahmed kamel taha
2
size of int in bytes
ahmed kamel taha
2
size of long in bits
ahmed kamel taha
2
size of long in bytes
ahmed kamel taha
2
size of long long in bits
ahmed kamel taha
2
size of long long in bytes
ahmed kamel taha
2
size of float in bits
ahmed kamel taha
2
size of float in bytes
ahmed kamel taha
2
size of double in bits
ahmed kamel taha
2
size of double in bytes
ahmed kamel taha
1
size of wchar_t in bits
ahmed kamel taha
1
size of wchar_t in bytes
ahmed kamel taha
1
Write a function that reverses a linked list, with this argument: pointer to pointer to the head node.
ahmed kamel taha
1
Delete a given value from a BST rooted at given node. Returns a pointer to node.
ahmed kamel taha
1
Get the successor of a value in a BST rooted by given node. Returns int.
ahmed kamel taha
Using recursion, insert a value into a tree: root = insert(node*, int)
ahmed kamel taha