Gigsky

Role: Not Specified

College: Not Specified

Interview Date: March 21, 2015

Interview Type: Not Specified

Result: Not Specified

Difficulty: Not Specified

Rounds: Not Specified

Topics Asked: Data Structures (Binary Search Tree), Algorithms, Operating Systems (Processes, Threads, Shared Memory), Java (wait(), notify())

Experience:

This candidate had an interview with GigSky and was asked several technical questions. The questions covered data structures and algorithms, specifically on Binary Search Trees (BST). They were asked to insert a new node into a BST without needing to balance the tree and to find the height of a tree using recursion.

Additionally, questions related to Java concurrency were posed, including providing a code sample demonstrating the use of `wait()` and `notify()` methods.

Operating system concepts were also part of the interview, with questions about the difference between a process and a thread, how to share data between processes (excluding serialization/file/db), and what shared memory in an OS is.