• Placement Questions
• /
• DATA STRUCTURE

DATA STRUCTURE interview questions and answers for freshers Page 2

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

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

(#M40151838) DATA STRUCTURE QUESTION Keep an EYE

Your job is to build a data structure to maintain a set of photographs. Your photograph database should allow you to insert and search for photographs, as well as to designate some of the photographs as favourites by marking them. In more detail, your data structure should support the following operations:
• Insert(x, t, m): inserts photograph x that was taken at time t. If m = 1, then the photograph is marked as a favourite; if m = 0, then it is not a favourite.
• Search(t): find the next photograph taken after time t.
• NextFavorite(t): find the next photograph taken after time t that is a favourite.
Give a data structure for solving this problem, and explain how it works. For more efficiency, your data structure should be both time and space efficient: more points will be given for more efficient solutions. (Remember that the photographs themselves may be quite large.) Give the performance (i.e., running time) of each operation and the space usage of the data structure. You may assume that at any given time t, your camera has taken at most one photograph x. Describe your solution in words, or very high-level pseudocode. You do not need to provide complete details. You must provide enough detail, however, that your solution is clear.

Asked In DATA STRUCTURE aditi yadav (10 years ago)

Solved gaurav Read Solution (4)

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

(#M40151278) DATA STRUCTURE QUESTION Data structure Keep an EYE

Inorder traversal of the following tree
10
/
3 5
/ /
1 7 9 6

a)1 3 7 10 9 5 6
b)1 3 7 9 5 6 10
c)10 3 5 1 7 9 6
d)1 7 9 6 3 5 10

Asked In DATA STRUCTURE kranthi kanchanapally (10 years ago)

Unsolved Read Solution (10)

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

(#M40151277) DATA STRUCTURE QUESTION Data structure Keep an EYE

A level order traversal in a binary tree requires which data structure?
a)stack b)Deque
c)Linked List d)DoublLinked list

Asked In DATA STRUCTURE kranthi kanchanapally (10 years ago)

Unsolved Read Solution (8)

Is this Puzzle helpful?   (27)   (17) Submit Your Solution Technical