• Placement Questions
• /
• DATA STRUCTURE
• /
• Programming

DATA STRUCTURE Programming Technical Interview Questions

(#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 (3 years ago)

Unsolved Read Solution (1)

Is this Puzzle helpful?   (7)   (3) 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 (4 years ago)

Unsolved

Is this Puzzle helpful?   (3)   (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 (4 years 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 (5 years ago)

Unsolved Read Solution (1)

Is this Puzzle helpful?   (9)   (11) Submit Your Solution Arrays

(#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 (7 years ago)

Unsolved Read Solution (10)

Is this Puzzle helpful?   (19)   (13) Submit Your Solution Technical

(#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 (9 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 (9 years ago)

Unsolved Read Solution (2)

Is this Puzzle helpful?   (48)   (22) Submit Your Solution Technical

(#M40155911) DATA STRUCTURE QUESTION Binary search tree Keep an EYE

Which of the following traversal is used for printing the keys of Binary search tree in ascending order?
[1]post-order traversal
[2]pre-order traversal
[3]in-order traversal
[4]None of the above

Asked In DATA STRUCTURE Rishikesh Agrawani (9 years ago)

Unsolved Read Solution (7)

Is this Puzzle helpful?   (9)   (1) Submit Your Solution Basics

(#M40155910) DATA STRUCTURE QUESTION Which of the following data structure is best for level by level order traversal in Binary tree? Keep an EYE

Which of the following data structure is best used for level by level order traversal in Binary tree?
[1] Queue
[2] Stack
[3] Array
[4] None of the above

Asked In DATA STRUCTURE Rishikesh Agrawani (9 years ago)

Unsolved Read Solution (5)

Is this Puzzle helpful?   (11)   (5) Submit Your Solution Technical

(#M40153418) DATA STRUCTURE QUESTION Keep an EYE

Imagine that two divisions of the Pandava army are camped outside an enemy camp of
Kauravas commanded by Bhishma. Each division is commanded by its own general;
Saatyaki and Yudhishtra. The two generals can communicate with one another only by
messengers, who might get caught by the Kauravas. After observing the Kaurava camp,
Saatyaki and Yudhistra must each decide independently whether to attack the Kauravas
or not. Then they must each communicate their plan to the other through messengers.
Upon receiving a message from the other, both Saatyaki and Yudhistra must decide a
common plan of action. The Pandavas can succeed only when both Saatyaki and
Yudhishtra attack the Kaurava camp at the same time.

Asked In DATA STRUCTURE suneetha (10 years ago)

Unsolved Read Solution (2)

Is this Puzzle helpful?   (8)   (15) Submit Your Solution Technical