• Placement Questions
• /
• DATA STRUCTURE

DATA STRUCTURE interview questions and answers for freshers

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

Unsolved Read Solution (1)

Is this Puzzle helpful?   (0)   (0) 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 (1 year ago)

Unsolved Read Solution (1)

Is this Puzzle helpful?   (13)   (8) 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 (2 years ago)

Unsolved Read Solution (10)

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

Unsolved Read Solution (8)

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

Unsolved Read Solution (6)

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

Unsolved Read Solution (2)

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

Unsolved Read Solution (2)

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