PaulDaviesC
BAN USER- 1of 1 vote
AnswerYou are given the task of creating the address book application for a smart phone. There are some
- PaulDaviesC in India
of the top level features you must implement.
1.There will be 1000+ phone book entries and user must get very quick response.
2.On default screen it shows the names of all people in alphabetical ascending order.
3.Using the search option, user can search and it will show only those names starting
with those characters which are typed in the search box.
You are supposed to compare two different data structures and list down the pros and cons of each
and finally recommend the best suited data structure.| Report Duplicate | Flag | PURGE
Xurmo Intern Data Structures - 1of 1 vote
AnswersHighly coupled code is code where the dependencies between classes are dense, lots of things
- PaulDaviesC in India
depend on other things. This kind of program is hard to understand, tough to maintain, and tends
to be fragile, breaking easily when things change.
Simplistically, we can say that class A is statically coupled to class B if the compiler needs the
definition of B in order to compile class A. Moreover dependencies among them are transitive.
That is if A depends on B and B depends on C, then A also depends on C
Create a program logic/pseudo code which can print the "expanded dependency tree" given a set
of input per class dependencies. Make sure that there are no duplicates in the output
Input
A -> B,C
B->C,E
C->G
D->A,F
E->F
F->H
Output
A depends on B C E F G H
B depends on C E F G H
C depends on G
D depends on A B C E F G H
E depends on F H
F depends on H| Report Duplicate | Flag | PURGE
Xurmo Intern
Here is one idea
- PaulDaviesC March 23, 20131.Do a preoder traversal.Before starting set the minNode=root and Minweight=weight(root)
2.While doing preorder do these things
if weight(current node) < Minweight then
minNode=current node
3.At the end of the above customised preorder traversal,we have the node with minimum weight, in the Minweight variable.