Create a database schema for storing Unix permissions.
Create a database schema for storing newspaper reports.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To
how will you protect a base class to override its member function in
derived class
say if there is a function f() in base class then derived cannot
override f() to provide its own definition.
The function must be accessible in derived class.
PS:dont try to make the function private in
how to find a duplicate in a very large file.
i gave two approaches
Hashing
and buliding a BST
can anyone suggest another more efficient approach.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send
plz be more clearwere u asked about characters or words
if it is characters then problem will become quite simple...
take an extra array of size 255.store count of each character and
display the characters with count greater than 1...
--
Amol Sharma
Third Year Student
Computer
what if it is a million URL's .. den what say Amol Sharma ??
in dat case even hashing and BST can be costly ..
On Sat, Jul 30, 2011 at 11:44 PM, Amol Sharma amolsharm...@gmail.comwrote:
plz be more clearwere u asked about characters or words
if it is characters then problem will become
ya...it would be costlyin that case suggest if u can think of any better
method
--
Amol Sharma
Third Year Student
Computer Science and Engineering
MNNIT Allahabad
On Sun, Jul 31, 2011 at 12:56 AM, sukhmeet singh sukhmeet2...@gmail.comwrote:
what if it is a million URL's .. den what say
Solution to this might be a Trie.
A trie is a tree with multiple children, but each children is referred by a
keyword (used for searching).
you break a string into parts and make a Trie out of it. This way searching
for a string will be optimized.
I am working on how to access counts
if u hv say 20 million records and u have to create a b+ tree then you
might be storing 20 million pointers at the leaf levelhow can u
optimize this(using b+ tree only)???
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this
