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

DATA STRUCTURE Programming - Technical 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

(#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

(#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

(#M40153331) DATA STRUCTURE QUESTION sorting real time examples Keep an EYE

Can someone please tell some real time examples of insertion,heap,quick,merge,selection sort?

Asked In DATA STRUCTURE sanj (10 years ago)

Unsolved Read Solution (1)

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

(#M40152056) DATA STRUCTURE QUESTION array Keep an EYE

Q.Two dimensional array elements are stored
a. System dependent
b. In Row major dependent
c. Compiler dependent
d. In column major dependent

Asked In DATA STRUCTURE Supriya_kamkar (10 years ago)

Unsolved Read Solution (19)

Is this Puzzle helpful?   (69)   (31) Submit Your Solution Technical

(#M40151840) DATA STRUCTURE QUESTION Keep an EYE

In the game of Jack Straws, a number of plastic or wooden "straws" are dumped on the table and players try to remove them one-by-one without disturbing the other straws. In the question here, we are concerned with the following, related problem: First n straws are dumped on the table. Next, for every pair of straws, we want to determine if the straws are connected by a path of touching straws. In other words, given a list of the endpoints for n > 1 straws (as if they were dumped on a large piece of graph paper), determine all the pairs of straws that are connected. Note that touching is connecting, but also two straws can be connected indirectly via other connected straws. Give an algorithm to compute all the pairs of straws that are connected.
Here is some additional information that you can use:
i. As a basic step you need to determine whether two straws directly touch (intersect), i.e., whether straw ab with end points a and b intersects with straw cd (with end points c and d).
ii. To get full credit also explain how the elementary step i) can be done. If you cannot find an algorithm for this step, assume an O(n 2 ) algorithm and explain how to find all pairs of straws that are connected.
Analyse and explain the worst-case computational complexity of your algorithm in terms of n.

Asked In DATA STRUCTURE aditi yadav (10 years ago)

Solved Kostav Chaudhuri Read Solution (1)

Is this Puzzle helpful?   (3)   (6) Submit Your Solution Technical

(#M40151839) DATA STRUCTURE QUESTION Keep an EYE

You are planning the group seating arrangement for a open book test given a list of students, V from different schools to participate. Assuming the fact that students who are known to each other directly or indirectly will probably cheat more as compared to unknown people sitting together.
Suppose you are also given a lookup table T where T[u] for u ? V is a list of students that u knows. If u knows v, then v knows u. You are required to arrange the seating such that any student at a table doesn't knows any other student sitting at the same table either directly or through some other student sitting at the same table. For example, if x knows y, and y knows z, then x, y, z can sit at the same table. Describe an efficient algorithm that, given V and T, returns the minimum number of tables needed to achieve this requirement. Analyze the running time of your algorithm.

Asked In DATA STRUCTURE aditi yadav (10 years ago)

Unsolved Read Solution (1)

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