Interesting question: Can (a==1 && a==2 && a==3) ever evaluate to true? In Java / in JavaScript?

CSC 374: Computer Systems II: 2017 Winter
Assignment #3

CSC 374: Computer Systems II: 2017 Winter
Assignment #2

Last Modified 2017 January 23

Fit Questions from Goldman Interviews 

HashMap

Big-O Complexity Chart

Java memory model

The Java memory model used internally in the JVM divides memory between thread stacks and the heap. This diagram illustrates the Java memory model from a logic perspective:

How to prepare to Java Interview

• OOP
• Java core
• Data structures and algorithms
• Java Spring / Web / Hibernate
• Design patterns  Please print
• Coding interview

 BFS vs DFS

Shortest paths.

 An edge-weighted digraph is a digraph where we associate weights or costs with each edge. A shortest path from vertex s to vertex t is a directed path from s to t with the property that no other such path has a lower weight.