This class was created by Brainscape user john simerlink. Visit their profile to learn more about the creator.
By:
john simerlink
- decks
- flashcards
- learners
Decks in this class (31)
Hash maps
Why is it difficult to make an on...,
Why is it relevant to know it is ...,
Cuckoo hashing vs chained hashing...
59
cards
B-Trees
0
cards
V8
What is essential for explaining ...,
What different javascript engine ...,
High level what are the differenc...
5
cards
Stacks
Java stack is subclass of what 1,
What should you use if you want a...
2
cards
LinkedLists
What is a faster queue than a lin...,
Doubly linked list 2,
Memory locality questions aside w...
10
cards
More Sorting
What is quicksort space complexit...
1
cards
Locality Optimizations
Loop nest optimization 1,
Loop fission 2
2
cards
External Memory Algorithms
Out of core 1,
M 2,
External memory algorithms genera...
3
cards
Queues
Deque 1,
How to pronounce deque 2,
List two possible subtypes of deq...
14
cards
Misc
Online vs offline algo definition 1,
Performance of online vs offline ...,
What are competitive online algor...
13
cards
Heaps
How to construct a heap from an a...,
What data structure are heaps imp...,
Min heap property 3
24
cards
Strings
Name of o n algo for simple patte...,
Rabin karp time complexity 2
2
cards
Computational complexity Theory
Np stands for 1,
P 2,
Tractable vs intractable 3
37
cards
More graph Algos
Forest 1,
Kruskal s algo for a connected ed...,
Is kruskals greedy or non greedy 3
78
cards
OS And Runtime Basics
When should you use the heap inst...,
Memory hierarchy 2,
Memory manager 3
10
cards
Computer architecture
What is a chipset 1,
Examples of peripherals 2,
Xeon chipsets contain what two th...
26
cards
DDI Ch 3 - Storage & Retrieval
There is a big difference between...,
List the two types of storage eng...,
For writes it s hard to beat the ...
21
cards
Hardware Performance
Typical hdd seek time 1,
Typical ssd seek time 2,
The two categories of hard disk p...
28
cards
Algo's
Kaden s algorithm to determine ma...,
Why does the currentsum max curre...,
What type of problems is kadens a...
3
cards
LEETCODE
What algorithm should be utilized...,
Find the max absolute sum of any ...,
Dfs when do you pick pre order tr...
5
cards
Trees
What is a full binary tree 1,
What is a complete binary tree 2,
Perfect binary tree 3
20
cards
Arrays
How to make a read only bst from ...,
What is regarded by many as the g...,
The 2 ways to randomize quicksort 3
33
cards
JS syntax / functions
Array reduce 1,
How to make a subarray 2,
Mathrandom range 3
3
cards
Computational Complexity Theory 2
Euler diagram of key complexity c...,
Euler diagram of key complexity c...
2
cards
Distributed Algorithms
What does m stand for in distribu...,
Lnode 2,
Llink 3
10
cards
Sorting
Downside of most most worst case ...,
How to rectify mergesort not taki...,
List 8 adaptive sort algorithms 3
13
cards
Sorting - Concurrent
Pairwise sorting network vs batch...
1
cards
Hashing - in depth
0
cards
Dynamic Programming
What is dynamic programming 1
1
cards
Ddi Ch 3 Images
0
cards
-LCB Arrays
0
cards
More about
-TierI Interview Prep
- Class purpose General learning
Learn faster with Brainscape on your web, iPhone, or Android device. Study john simerlink's -TierI Interview Prep flashcards now!
How studying works.
Brainscape's adaptive web mobile flashcards system will drill you on your weaknesses, using a pattern guaranteed to help you learn more in less time.
Add your own flashcards.
Either request "Edit" access from the author, or make a copy of the class to edit as your own. And you can always create a totally new class of your own too!
What's Brainscape anyway?
Brainscape is a digital flashcards platform where you can find, create, share, and study any subject on the planet.
We use an adaptive study algorithm that is proven to help you learn faster and remember longer....
Looking for something else?
DS Interview MAIN
- 34 decks
- 1837 flashcards
- 5 learners
Decks:
General, Bit Wise Manipulation, Math And Logic Puzzle, And more!
Interviewing
- 13 decks
- 822 flashcards
- 149 learners
Decks:
Ch 2 Interviewing, Ch 3 Interviewing, Ch 4 Interviewing, And more!
