Skip to main content

Data Structure & Algorithm Interview Questions And Answers - Part VI.

Here, are some sample questions based on "Data Structures". Read it carefully as these questions will help you in cracking any interview.

26) What are the different types of arrays?

Arrays are of different types namely one-dimensional arrays, two-dimensional arrays and multi-dimensional arrays. One-dimensional arrays comprise of finite homogeneous elements while multi-dimensional arrays comprise of elements, each of which is itself an array.

27) What do you mean by the base address of an array?

In memory, one-dimensional arrays are implemented by allocating a sequence of addressed locations so as to accommodate all its elements. The starting address of the very first element of the array is called base address of the array.

28) Give the formula to calculate the address of any element in an array, when the length of the array along with its base address and size of the element are given ?

The formula to calculate address of any element in an array is:

Address of the element with subscript I = Base address + ES (I – L)

- Where ES is the size of an array element;
L is the lower bound of the array and all array elements are of the same size.

29) How is computer memory allotted for a two-dimensional array ?

For two-dimensional array, the computer memory is allotted either in Row-major form or in Column-major form.

Row-major form stores the 2-D arrays row wise i.e. firstly the first row is stored, then the second row, then third row, and so forth.

Column-major form stores the 2-D array column wise i.e. firstly the first column, then the second column, then third, and so forth. The default form is Row-major.

30) What is the difference between an array and a stack housed in an array?

An array is a group of homogeneous elements stored in contiguous memory locations. The elements in an array can be processed from anywhere in the array.

A stack implemented as an array has elements stored in contiguous memory locations. But a stack is always processed in a LIFO manner i.e. Last in First out manner wherein the elements can be added or removed from the top end of the stack. That is why a stack is also called a LIFO data structure.


31) List the basic operations which can be performed on data structures ?
32) How can you calculate the size of an array, given the upper and lower bounds of the array ?
33) Which are the two very common search techniques and what are their mechanisms ?
34) Describe how linear search is carried out ?
35) How does the binary search work ?

36) What are the differences between linear search and binary search ?
37) State the condition(s) under which binary search is applicable ?
38) What are the advantages of linked lists over arrays ?
39) What is sorting of an array ? Name a few types of sorting techniques ?
40) What is the mechanism of selection sort ?

...Return To Data Structure Index.

... Return To HR Interview Index.


Popular posts from this blog

Tell Me Something About Yourself - Interview Answers.

Try to introduce some of your most important employment-oriented skills as well as your education and accomplishments to the interviewer. Answer to this question is very important because it positions you for the rest of the interview. That's why this statement is often called the "Positioning Statement".

One should take the opportunity to show his/her communication skills by speaking clearly and concisely in an organized manner. Since there is no right or wrong answer for this question hence it is important to appear friendly.


1) I am a person with strong interpersonal skills and have the ability to get along well with people. I enjoy challenges and looking for creative solutions to problems.

2) Besides the details given in my resume, I believe in character values, vision and action. I am quick in learning from mistakes. I am confident that the various tests that you have conducted will corroborate my competencies aptitude and right attitude for the…

100 C Programs Frequently Asked in Technical Interview.

Sample C Program To Print Welcome Message.

#include <stdio.h>

int main()

printf( "Welcome to C Programming World. \n" );
return 0;



Welcome to C Programming World.

Sample C Program To Accept & Display A Number.
#include <stdio.h>
#include <conio.h>


int number;
printf("Enter an integer ");
scanf("%d", &number);
printf("Integer that you have entered is %d",number);
return 0;



Enter an integer 9
Integer you have entered is 9


-- C Program To Print First Ten(10) Natural Numbers.
-- C Program To Print Fibonacci Series Upto 100.
-- C Program To Check Whether A Number Is Prime Or Not.
-- C Program To Compute The Reverse Of A Number.
-- C Program To Print A Semicolon Without Using A Semicolon.

-- C Program To Display Function Without Using The Main Function.
-- C Program To Print Any Print Statement Without Using Semicolon.
-- C Program To Display Its Own Source Code As Its Output.
-- C Program To Swap Two Strings Usin…