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

DATA STRUCTURE Programming Technical Interview Questions : Solved Question

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

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

(#M40118122) DATA STRUCTURE QUESTION BigO Notation Keep an EYE

f(n)=O(f(n)^2) Is it true or false

Asked In DATA STRUCTURE Thirupathi Reddy (10 years ago)

Solved sunny bhai Read Solution (4)

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