FREE C PROGRAMS

Data Structures and C Programming

  DATA STRUCTURES USING C

 HOME PAGE

Data Structures Interview Questions

Pg : 1 , 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14

Data Structures Interview Questions

Areas in which data structures are applied extensively?
Compiler Design,
Operating System,
Database Management System,
Statistical analysis package,
Numerical Analysis,
Graphics,
Artificial Intelligence,
Simulation


What is hashing?
Hashing is a way retrieving records from memory in faster way. Record is inserted into memory by using hash function(division, midsqure,folding,digit analysis)and also records
are retrieved using same hash function.

In RDBMS, what is the efficient data structure used in the internal storage representation?
B+ tree. Because in B+ tree, all the data is stored only in leaf nodes, that makes searching easier.
This corresponds to the records that shall be stored in leaf nodes.


What is the data structures used to perform recursion?
Stack. Because of its LIFO (Last In First Out) property.

What are the parts of root node?
A root node contains data part and has link part. i.e links to its child. If it is binary tree it has two links i.e left child and right child.

What is binary tree?
Binary tree is a tree which has maximum no. of childrens either 0 or 1 or 2. i.e., there is at the most 2 branches in every node.

Which is the simplest file structure?
(a) Sequential
(b) Indexed
(c) Random

Sequential

How to find the number of possible tree in the given tree?
The number of possible tree = (2 power of n) - n.
For example:A tree contain three node.So if n=3,the possible number of trees = 8 - 3 = 5.

In an AVL tree, at what condition the balancing is to be done?
If the ‘pivotal value’ (or the ‘Height factor’) is greater than 1 or less than –1.

What is a spanning Tree?
A spanning tree is a tree associated with a network. All the nodes of the graph appear on the tree once. A minimum spanning tree is a spanning tree organized so that the total edge weight between nodes is minimized.

Minimum number of queues needed to implement the priority queue?

Two. One queue is used for actual storing of data and another for storing priorities.
 

Popular Stuff

Binary Search C program

Binary search algorithm is a technique for locating a particular value in a sorted list.

Creation Of Binary Search tree

Learn How to Create a BST

Simple Linked List

In computer science, a linked list is one of the fundamental data structures, and can be used to implement other data structures

Doubly Linked List

Doubly Linked List Implementation

Push and Pop in Linked list

Learn how to Push & Pop in a Linked List

Threaded Binary tree

A binary tree is threaded by making all right child pointers

---------------------------------------------------------------------------------------