Symantec Interview Question for Senior Software Development Engineers


Country: India
Interview Type: Phone Interview




Comment hidden because of low score. Click to expand.
4
of 4 vote

Very embarrassed for duplicate submission, because just happened a problem when submitting, but I do not know how to delete.....

- will April 05, 2013 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

the template definition for hash_map is : template <
class Key,
class Value,
class HashKey = Self<Key>,
class EqualKey = EqualTo<Key>,
class LessKey = Less<Key>,
class Alloc = DefaultAllocator<Pair<const Key, Value>
for HashKey, that is for converting Key into bucket index. EqualKey is try to compare to key to check whether occur collision. But for LessKey I guess for some implementation such as Red-Black tree or AVL, it is useful.

- will April 05, 2013 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

the template definition for hash_map is : template <
class Key,
class Value,
class HashKey = Self<Key>,
class EqualKey = EqualTo<Key>,
class LessKey = Less<Key>,
class Alloc = DefaultAllocator<Pair<const Key, Value>
for HashKey, that is for converting Key into bucket index. EqualKey is try to compare to key to check whether occur collision. But for LessKey I guess for some implementation such as Red-Black tree or AVL, it is useful.

- will April 05, 2013 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

This is a really good article(and site) on how hashmap works:

javarevisited.blogspot.com/2011/02/how-hashmap-works-in-java.html

- trish August 14, 2013 | Flag Reply
Comment hidden because of low score. Click to expand.
-1
of 1 vote

the template definition for hash_map is : template <
class Key,
class Value,
class HashKey = Self<Key>,
class EqualKey = EqualTo<Key>,
class LessKey = Less<Key>,
class Alloc = DefaultAllocator<Pair<const Key, Value>
for HashKey, that is for converting Key into bucket index. EqualKey is try to compare to key to check whether occur collision. But for LessKey I guess for some implementation such as Red-Black tree or AVL, it is useful.

- will April 05, 2013 | Flag Reply
Comment hidden because of low score. Click to expand.
-1
of 1 vote

the template definition for hash_map is : template <
class Key,
class Value,
class HashKey = Self<Key>,
class EqualKey = EqualTo<Key>,
class LessKey = Less<Key>,
class Alloc = DefaultAllocator<Pair<const Key, Value>
for HashKey, that is for converting Key into bucket index. EqualKey is try to compare to key to check whether occur collision. But for LessKey I guess for some implementation such as Red-Black tree or AVL, it is useful.

- will April 05, 2013 | Flag Reply
Comment hidden because of low score. Click to expand.
-1
of 1 vote

the template definition for hash_map is : template <
class Key,
class Value,
class HashKey = Self<Key>,
class EqualKey = EqualTo<Key>,
class LessKey = Less<Key>,
class Alloc = DefaultAllocator<Pair<const Key, Value>
for HashKey, that is for converting Key into bucket index. EqualKey is try to compare to key to check whether occur collision. But for LessKey I guess for some implementation such as Red-Black tree or AVL, it is useful.

- will April 05, 2013 | Flag Reply
Comment hidden because of low score. Click to expand.
-1
of 1 vote

the template definition for hash_map is : template <
class Key,
class Value,
class HashKey = Self<Key>,
class EqualKey = EqualTo<Key>,
class LessKey = Less<Key>,
class Alloc = DefaultAllocator<Pair<const Key, Value>
for HashKey, that is for converting Key into bucket index. EqualKey is try to compare to key to check whether occur collision. But for LessKey I guess for some implementation such as Red-Black tree or AVL, it is useful.

- will April 05, 2013 | Flag Reply
Comment hidden because of low score. Click to expand.
-1
of 1 vote

the template definition for hash_map is : template <
class Key,
class Value,
class HashKey = Self<Key>,
class EqualKey = EqualTo<Key>,
class LessKey = Less<Key>,
class Alloc = DefaultAllocator<Pair<const Key, Value>
for HashKey, that is for converting Key into bucket index. EqualKey is try to compare to key to check whether occur collision. But for LessKey I guess for some implementation such as Red-Black tree or AVL, it is useful.

- will April 05, 2013 | Flag Reply


Add a Comment
Name:

Writing Code? Surround your code with {{{ and }}} to preserve whitespace.

Books

is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.

Learn More

Videos

CareerCup's interview videos give you a real-life look at technical interviews. In these unscripted videos, watch how other candidates handle tough questions and how the interviewer thinks about their performance.

Learn More

Resume Review

Most engineers make critical mistakes on their resumes -- we can fix your resume with our custom resume review service. And, we use fellow engineers as our resume reviewers, so you can be sure that we "get" what you're saying.

Learn More

Mock Interviews

Our Mock Interviews will be conducted "in character" just like a real interview, and can focus on whatever topics you want. All our interviewers have worked for Microsoft, Google or Amazon, you know you'll get a true-to-life experience.

Learn More