• Placement Questions
• /
• DATA STRUCTURE

DATA STRUCTURE interview questions and answers for freshers

(#M40167104) DATA STRUCTURE QUESTION Which data structure is better for storing the sorted data? Keep an EYE

Which of the following data structure is better for storing the sorted data on which often insert and deletion operations are performed?

A. Linked list
B. Queue
C. Array
D. Doubly linked-list

Asked In DATA STRUCTURE Jax (4 Months ago)

Unsolved

Is this Puzzle helpful?   (1)   (0) Submit Your Solution Technical

(#M40167070) DATA STRUCTURE QUESTION Given a positive integer n and you task is find the minimum number of steps that takes n to one . Keep an EYE

Problem Statement:

Problem statement is very easy . On a positive integer, you can perform any one of the following 3 steps.

1.) Subtract 1 from it. ( n = n - 1 )

2.) If its divisible by 2, divide by 2. ( if n % 2 == 0 , then n = n / 2 )

3.) If its divisible by 3, divide by 3. ( if n % 3 == 0 , then n = n / 3 )

Given a positive integer n and you task is find the minimum number of steps that takes n to one .

Asked In DATA STRUCTURE SUDHEER BABU PALLANTI (1 year ago)

Unsolved

Is this Puzzle helpful?   (2)   (1) Submit Your Solution

(#M40167068) DATA STRUCTURE QUESTION Move all zeros present in an array to the end Keep an EYE

EXAMPLE:
Input=['1','0','1','2','3','0','3','4','0']
Output:
['1', '1', '2', '3', '3', '4', '0', '0', '0']

// Function to move all zeros present in the array to the end
void reorder(int A[], int n)
{
// k stores index of next available position
int k = 0;

// do for each element
for (int i = 0; i < n; i++)
{
// if current element is non-zero, put the element at
// next free position in the array
if (A[i] != 0)
A[k++] = A[i];
}

// move all 0's to the end of the array (remaining indices)
for (int i = k; i < n; i++)
A[i] = 0;
}

// Move all zeros present in the array to the end
int main(void)
{
int A[] = { ..... };
int n = sizeof(A) / sizeof(A[0]);

reorder(A, n);

for (int i = 0; i < n; i++)
printf("%d ", A[i]);

return 0;
}

Asked In DATA STRUCTURE SUDHEER BABU PALLANTI (1 year ago)

Unsolved

Is this Puzzle helpful?   (2)   (0) Submit Your Solution

(#M40167009) DATA STRUCTURE QUESTION Keep an EYE

A queue is implemented as a single linked list. Each node has an element and pointer to
another node. Rear and Front contain the addresses of the Rear and Front nodes
respectively. If the condition (rear isequal front) is true and neither is NULL, what do we infer
about the linked list?

Asked In DATA STRUCTURE Deepika (1 year ago)

Unsolved Read Solution (1)

Is this Puzzle helpful?   (5)   (4) Submit Your Solution Arrays

(#M40166298) DATA STRUCTURE QUESTION Series Expansion Keep an EYE

logic to expand series upto n

1, 1, 2, 10, 65, 442

Asked In DATA STRUCTURE lokendra ved (2 years ago)

Unsolved Read Solution (1)

Is this Puzzle helpful?   (14)   (9) Submit Your Solution Number Series

(#M40165096) DATA STRUCTURE QUESTION DS Keep an EYE

Given Integer x = 40, y = 35, z = 20, w = 10
Comment on the output of the following two statements
print x * y / z - w print x * y / (z - w)

Asked In DATA STRUCTURE Jainu Parveen S (4 years ago)

Unsolved Read Solution (10)

Is this Puzzle helpful?   (18)   (9) Submit Your Solution Technical

(#M40164448) DATA STRUCTURE QUESTION Data Structures Keep an EYE

Consider the following code:
function modify(w,u)
{
w = w + 2
u = u - 3
return (w - u)
}
function calculate( )
{
integer a = 10, b = 20, c
c = modify(a, b);
print a
print space
print b
}
Assume that a was passed by value and b was passed by reference. What will be the
output of the program on executing function calculate( ) ?

Op 1: 12 17
Op 2: 10 17
Op 3: 12 20
Op 4: 10 20

Asked In DATA STRUCTURE sashreek (4 years ago)

Unsolved Read Solution (8)

Is this Puzzle helpful?   (26)   (7) Submit Your Solution Coding Decoding

(#M40164447) DATA STRUCTURE QUESTION Amcat Keep an EYE

Vrinda writes an efficient program to sum two square diagonal matrices
(matrices with elements only on diagonal). The size of each matrix is nXn. What is the
time complexity of Vrinda's algorithm?

Asked In DATA STRUCTURE sashreek (4 years ago)

Unsolved Read Solution (6)

Is this Puzzle helpful?   (18)   (10) Submit Your Solution Decision Making and Problem Solving

(#M40157042) DATA STRUCTURE QUESTION True/False Keep an EYE

A linked list is of a length specified in its declaration. True or False ?

Asked In DATA STRUCTURE Mayank Sahai (5 years ago)

Unsolved Read Solution (7)

Is this Puzzle helpful?   (29)   (18) Submit Your Solution Technical

(#M40156442) DATA STRUCTURE QUESTION binary tree Keep an EYE

Consider a Binary tree having two pointer for its each children. These pointer are set to NULL if the corresponding child is empty . How many NULL pointer does a Binary Tree with N nodes have ? options are N,n+1,n-1,depend on the shape of the tree

Asked In DATA STRUCTURE ANURAG SINGH (5 years ago)

Unsolved Read Solution (2)

Is this Puzzle helpful?   (36)   (18) Submit Your Solution Technical