Code Pumpkin

Tag Archives: DataStructure

Subscribe

Sapient Global Markets Interview Questions – Set 3

Hey everyone, I am writing this article for the people who wants to appear for Sapient Global Markets. I appeared for Senior Application Developer I in Sapient Global Markets Bangalore on August 2017. I would Like to share my experience with you guys. I will cover Technical round question and some brief intro of Sapient GM process. […]

Synechron Interview Questions – Set 1

September 20, 2017
Posted by Pumpkin

Synechron has arranged walk-in drive at Ahmedabad location for multiple opening at Mumbai, Pune and Bangalore location.  I have appeared for Sr Java Developer position. I got a call from Ethos HR consultancy and interview was scheduled at the office of Ethos HR, Ahmedabad. Arrangement by Ethos HR was very poor and unprofessional. However, interviewers were […]

Graph Search – Depth First Search

April 1, 2017
Posted by Pumpkin

We discussed about basic search mechanisms for Graph and Breadth First Search(BFS) in previous article. In this article we will start with basic definition of the Depth First Search(DFS). Depth First Search(DFS): In depth first search, we start from the root node then traverse the graph layerwise until we reach the leaf or dead end. In short, One […]

Graph Search – Breadth First Search

April 1, 2017
Posted by Pumpkin

In Our previous article about Graph, we have seen the different ways to represent the graph.  we have a way to represent this unstructured data structure.  Now question arise is how I will traverse through this given graph structure.  There are main two methods which we will use to traverse through graph.  Breadth First Search […]

Graph

March 31, 2017
Posted by Pumpkin

Graph is a non linear data structure, it contains a set of points known as nodes (or vertices) and set of links known as edges which connects the vertices. The pictorial representation is shown in the image in the left pane. Types of Graph: Undirected Graph is a graph that is a set of vertices connected by edges, where the […]

Heap (Min/Max Heap)

March 31, 2017
Posted by Pumpkin

What is heap? Heap is a balanced binary tree data strucure where the root-node key is compared with its children and arranged accordingly. Max Heap: Root element will always be greater than or equal to either of its child element( see the image on left pane). Min Heap: Root element will always be less than or equal […]

Linked List

March 31, 2017
Posted by Pumpkin

A linked list is a dynamic data structure which is consist of nodes and links. The number of nodes in a list is not fixed and can grow and shrink on demand. As Discussed in previous article of ArrayList, this structure will provide us more space effective insertion/deletion for intermediate elements. In this structure it will […]


Total Post : 80
Subscribe
Contribute Your Articles

Interview Experiences

Related Books

Like Us On Facebook

Alexa Page Rank