## What is the difference between NULL and VOID?

Null is actually a value, whereas Void is a data type identifier. A null variable simply indicates an empty value, whereas void is used to identify pointers as having no initial size.

Skip to content
# Data Structure Interview Questions

## What is the difference between NULL and VOID?

## List Some Applications of Multilinked Structures?

## What are the advantages of Selecetion Sort?

## What are the advantages of Binary search over linear search?

## What are the applications of Graph data structure?

## Which data structures are used in BFS and DFS algorithm?

## Mention the data structures which are used in graph implementation.

## Differentiate among cycle, path, and circuit?

## Define the graph data structure?

## List some applications of Tree-data structure?

Null is actually a value, whereas Void is a data type identifier. A null variable simply indicates an empty value, whereas void is used to identify pointers as having no initial size.

Sparse matrix, Index generation.

It is simple and easy to implement. It can be used for small data sets. It is 60 per cent more efficient than bubble sort.

There are relatively less number of comparisons in binary search than that in linear search. In average case, linear search takes O(n) time to search a list of n elements while Binary search takes O(log n) time to search a list of n elements.

The graph has the following applications: Graphs are used in circuit networks where points of connection are drawn as vertices and component wires become the edges of the graph. Graphs are used in transport networks where stations are drawn as vertices and routes become the edges of the graph. Graphs are used in maps that …

What are the applications of Graph data structure? Read More »

In BFS algorithm, Queue data structure is used. In DFS algorithm, Stack data structure is used.

For the graph implementation, following data structures are used. In sequential representation, Adjacency matrix is used. In Linked representation, Adjacency list is used.

Path: A Path is the sequence of adjacent vertices connected by the edges with no restrictions. Cycle: A Cycle can be defined as the closed path where the initial vertex is identical to the end vertex. Any vertex in the path can not be visited twice Circuit: A Circuit can be defined as the closed …

A graph G can be defined as an ordered set G(V, E) where V(G) represents the set of vertices and E(G) represents the set of edges which are used to connect these vertices. A graph can be seen as a cyclic tree, where the vertices (Nodes) maintain any complex relationship among them instead of having …

Applications of Tree- data structure: The manipulation of Arithmetic expression, Symbol Table construction, Syntax analysis Hierarchal data model