by Chuck
31. August 2009 12:38
Question: "Write function to serialize and de-serialize any object in C#"
[More]
by Alex
22. April 2009 18:14
Stack and Query structures in computing are extremely fundamental and important. Then interviewing I expect candidate to fully understand this data structures and have experience using them.
[More]
by Alex
9. April 2009 20:31
Working with regular expressions on the daily basis for the last five years I still use reference almost every time I need to write something somehow complicated. It is just unfair to expect candidate to know the answer right away on the white board. But again, it is something you just need to be prepared for; especially in this thought times then employers looking on big pool of candidates and can be picky.
[More]
by Alex
11. March 2009 15:30
"Interview Patterns" idea is quite simple but often overlooked by job seekers. In analogies with mathematical basis which is the minimal set of vectors necessary to define all other vectors in the space, there are basis interview questions and techniques which would let you solve big subset of related problems. The ability to recognize interview pattern (i.e. what is the intend of the question) and apply basis solution would not only give you powerful tool to solve the problem but also impress interviewer with your structural approach.
[More]
Currently rated 4.0 by 2 people
- Currently 4/5 Stars.
- 1
- 2
- 3
- 4
- 5
Tags:
Patterns
by Alex
25. December 2008 13:57
Another very common interview questions is how to store a tree data structure in a database. Be prepared to answer this question even if you are applying for UI ,API, MT or any other non-DB related positions. The question simply tests your ability to think about data structures in the abstract way. The interviewer will usually provide some sample tree as shown in image below and ask about storing this structure in the database.
[More]
by Alex
20. December 2008 05:25
A number of data structures can be chosen to represent a graph. The appropriate choice should be based on the problem definition and on the operation that should be applied to the edges and vertexes. The two most common representations for graphs are adjacency matrix and adjacency list. Adjacency matrix is an NxN boolean matrix, where N is the number of vertexes in the graph. At this point it is important to mention that a graph is an advanced data structure. You won’t see it very often in the interview questions. But if you are interviewing for a lead or architect position, you certainly should be prepared to solve graph problems.
[More]
by Alex
4. December 2008 09:10
An onsite interview is the core of all interviewing processes. Up to this point all that you have experienced is just preparation for this main event. Most probably you will be talking onsite with completely different people who have just an overall idea about your performance during the selection process. You may have read in other books that if you are invited to the onsite interview, it means that the company is sure in your technical level and simply wants to see how good you will suite the team. In real life this is hardly true. Don’t make this mistake, as we see many people who arrive for the onsite interview totally unprepared and extremely surprised by taut coding questions.
[More]
by Alex
1. December 2008 10:49
Some interviewers use a very powerful technique of interviewing I call "Cascade pattern". In this interview pattern, the interviewer follows your answer with a question that is related to your previous answer.
[More]
All material copyright © North Pacific Technology Group, LLC.
All rights are reserved. No part of any material on this web site may be reproduced, or stored in a database or retrieval system, distributed, or transmitted in any form or by any means, electronic, mechanical, photocopying, recording, or otherwise, without the prior written permission. Terms of use.
Powered by BlogEngine.NET 1.4.5.0